Homotopy Gerstenhaber algebras are strongly homotopy commutative

TL;DR

This paper demonstrates that homotopy Gerstenhaber algebras inherently possess a strongly homotopy commutative structure, connecting different notions of homotopy commutativity through additional operations.

Contribution

It establishes a natural link between homotopy Gerstenhaber algebras and strongly homotopy commutative algebras, clarifying their structural relationship.

Findings

Homotopy Gerstenhaber algebras are naturally shc algebras.

Additional operations induce homotopy commutativity.

Connects different frameworks of homotopy algebra structures.

Abstract

We show that any homotopy Gerstenhaber algebra is naturally a strongly homotopy commutative (shc) algebra in the sense of Stasheff-Halperin with a homotopy associative structure map. In the presence of certain additional operations corresponding to a cup-1 product on the bar construction, the structure map becomes homotopy commutative, so that one obtains an shc algebra in the sense of Munkholm.

Equations

$$\Phi :A\otimes A\Rightarrow A$$

$$\Phi \circ (1_A\otimes {\eta }_A)=\Phi \circ ({\eta }_A\otimes 1_A)=1_A.$$

$$\Phi \circ (\Phi \otimes 1_A)\simeq \Phi \circ (1_A\otimes \Phi ):A\otimes A\otimes A\Rightarrow A.$$

$$\Phi \circ T_{A,A}\simeq \Phi :A\otimes A\Rightarrow A.$$

$$E_k:A\otimes A^{\otimes k}\to A$$

$$\mathbf{B}A\otimes \mathbf{B}A\stackrel{\nabla }{⟶}\mathbf{B}(A\otimes A)\stackrel{\mathbf{B}\Phi }{\to }\mathbf{B}A,$$

$$F(a,b,c)$$

$$G(a,b)\stackrel{\varkappa }{=}{f}_1(f_2(a))\otimes g_1(g_2(b))$$

$$G=f_1{f}_2\otimes g_1{g}_2=(-1{)}^{|f_2||g_1|}(f_1\otimes g_1)(f_2\otimes g_2)$$

$$E_k:A\otimes A^{\otimes k}\to A,a\otimes b_1\otimes \cdots \otimes b_k\mapsto E_k(a;b_1,\dots ,b_k)$$

$$d(E_k)(a;b_{\bullet })$$

$$+(-1{)}^k{E}_{k-1}(a;b_{\bullet })b_k.$$

$$E_k(a_1{a}_2;b_{\bullet })\stackrel{\varkappa }{=}\sum _{k_1+k_2=k}{E}_{k_1}(a_1;b_{\bullet })E_{k_2}(a_2;b_{\bullet })$$

$$E_{l}(E_{k}(a;b_{\bullet});c_{\bullet})\stackrel{{\scriptstyle\varkappa}}{{=}}\\ \sum_{\begin{subarray}{c}i_{1}+\dots+i_{k}+{}\\ j_{0}+\dots+j_{k}=l\end{subarray}}\!\!(-1)^{\varepsilon}\,E_{n}\bigl{(}a;\underbrace{c_{\bullet}}_{j_{0}},E_{i_{1}}(b_{1};c_{\bullet}),\underbrace{c_{\bullet}}_{j_{1}},\dots,\underbrace{c_{\bullet}}_{j_{k-1}},E_{i_{k}}(b_{k};c_{\bullet}),\underbrace{c_{\bullet}}_{j_{k}}\bigr{)},$$

$$n=k+\sum_{t=0}^{k}j_{t}\qquad\text{and}\qquad\varepsilon=\sum_{s=1}^{k}i_{s}\Bigl{(}k+\sum_{t=s}^{k}j_{t}\Bigr{)}+\sum_{t=1}^{k}t\,j_{t}.$$

$$F_{kl}:A^{\otimes k}\otimes A^{\otimes l}\to A$$

$$d(F_{kl})(a_{\bullet };b_{\bullet })=A_{kl}+(-1{)}^k{B}_{kl}$$

$$A_{1l}$$

$$A_{kl}$$

$$+\sum _{j=1}^l(-1{)}^k{F}_{k-1,j}(a_{\bullet };b_{\bullet })E_{l-j}(a_k;b_{\bullet })$$

$$B_{k1}$$

$$B_{kl}$$

$$+(-1{)}^l{F}_{k,l-1}(a_{\bullet };b_{\bullet })b_l$$

$$d({\cup }_2)(a;b)=a{\cup }_{1}b+(-1{)}^{|a||b|}b{\cup }_{1}a$$

$${\Phi }_{(n)}:(A\otimes A{)}^{\otimes n}\to A$$

$${\Phi }_{(n)}(a_{\bullet }\otimes b_{\bullet })\stackrel{\varkappa }{=}(-1{)}^{n-1}\sum _{\begin{array}{c}{j}_1+\cdots +j_n\\ =n-1\end{array}}{E}_{j_1}(a_1;b_{\bullet })\cdots E_{j_n}(a_n;b_{\bullet })b_n$$

$$\forall 1\le s\le n{j}_1+\cdots +j_s<s.$$

$${\Phi }_{(1)}$$

$${\Phi }_{(2)}$$

$${\Phi }_{(3)}$$

$$C_{*}(X)\otimes C_{*}(X)\overset{\nabla}{\underset{AW}{\rightleftarrows}}C_{*}(X\times X)\,{}\mathbin{\rotatebox{90.0}{$\circlearrowleft$}}\,h.$$

$$\mathbf{B}A\otimes \mathbf{B}A\stackrel{\nabla }{⟶}\mathbf{B}(A\otimes A)\stackrel{\mathbf{B}\Phi }{\to }\mathbf{B}A$$

$$A^{\otimes k}\otimes A^{\otimes l}\stackrel{({\mathbf{s}}^{-1}{)}^{\otimes n}}{\to }{\mathbf{B}}_{k}A\otimes {\mathbf{B}}_{l}A\stackrel{\nabla }{⟶}{\mathbf{B}}_{k+l}(A\otimes A)\stackrel{\Phi }{⟶}A$$

$$\mathbfit{c}^{\prime}=\pm\bigl{[}\,a^{\prime}_{1}\otimes b^{\prime}_{1}\bigm{|}\dots\bigm{|}a^{\prime}_{n}\otimes b^{\prime}_{n}\,\bigr{]}$$

Full text

The author was supported by an NSERC Discovery Grant.

1. Introduction

Let $A$ and $B$ be augmented dgas over a commutative ring $\Bbbk$. Recall that an $A_{\infty}$ map $f\colon A\Rightarrow B$ is a map of differential graded coalgebras $\mathbf{B}A\to\mathbf{B}B$ between the bar constructions of $A$ and $B$. According to Stasheff–Halperin [14, Def. 8], the dga $A$ is a strongly homotopy commutative (shc) algebra if

1. (i)

the multiplication map $\mu_{A}\colon A\otimes A\to A$ extends to an $A_{\infty}$ morphism

[TABLE]

in the sense that the base component $\Phi_{(1)}\colon A\otimes A\to A$ of $\Phi$ equals $\mu$.

Munkholm [12, Def. 4.1] additionally requires the following:

1. (ii)

The map $\eta_{A}\colon\Bbbk\to A$, $1\mapsto 1$ is a unit for $\Phi$, that is,

[TABLE] 2. (iii)

The $A_{\infty}$ map $\Phi$ is homotopy associative, that is,

[TABLE] 3. (iv)

The map $\Phi$ is homotopy commutative, that is,

[TABLE]

Note that we write $1_{A}$ for the identity map of $A$ and $T_{A,A}\colon A\otimes A\to A\otimes A$ for the the transposition of factors. Also, the compositions and tensor products above are those of $A_{\infty}$ maps.

Using acyclic models, Munkholm [12, Prop. 4.7] has constructed a natural shc structure on the normalized singular cochain complex $C^{*}(X)$ of a space $X$. Slightly earlier, Gugenheim–Munkholm [6] have given a recursive formula for $\Phi$ in this case based on the Eilenberg–Zilber contraction, see Remark 4.2.

Singular cochain complexes are the main example of homotopy Gerstenhaber algebras (hgas) besides the Hochschild cochains of associative algebras. Recall that an hga is essentially an augmented dga $A$ with maps

[TABLE]

for $k\geq 1$ that induce a dga structure on the bar construction $\mathbf{B}A$ compatible with the diagonal. See Section 3.1 for a reformulation in terms of the identities the operations $E_{k}$ have to satisfy. Kadeishvili [8] has identified certain additional operations on an hga $A$ that allow to define a $\mathbin{\cup_{1}}$-product on $\mathbf{B}A$. We call such an hga extended, see Section 3.2. Singular cochain algebras are extended hgas.

As pointed out by Kadeishvili [9, Sec. 1.6], it follows from general considerations that any hga admits an shc structure in the sense of Stasheff–Halperin such that the composition of $\mathbf{B}\Phi$ with the shuffle map,

[TABLE]

is homotopic to the product on $\mathbf{B}A$ determined by the hga structure.

Our main result is the following. In the companion paper [4] we apply it to determine the cohomology rings of a large class of homogeneous spaces.

Theorem 1.1**.**

Let $A$ be an hga.

1. (i)

There is a canonical shc structure on $A$ satisfying properties (i), (ii) and (iii) of the definition above. 2. (ii)

If $A$ is extended, then the shc structure additionally satisfies property (iv). 3. (iii)

All structure maps commute with morphisms of (extended) hgas. 4. (iv)

The composition (1.1) is exactly the multiplication map on $\mathbf{B}A$.

The $A_{\infty}$ map $\Phi$ is defined in Section 4 and the associativity and commutativity homotopies in Sections 5 and 6. The verification that they satisfy the required identities is an elementary, but very lengthy computation that has been relegated to the appendices. The claimed naturality will be obvious from the construction. We conclude in Section 7 with results about $A_{\infty}$ maps and shc maps from polynomial algebras to dgas and hgas, respectively.

Acknowledgements**.**

Maple and SymPy [11] were used to check our formulas. I thank Chris Hall for his help with Python programming.

2. Preliminaries

From now on, we call $A_{\infty}$ maps strongly homotopy multiplicative (shm) because this terminology pairs better with “shc algebras”. We refer to the companion paper [4, Secs. LABEL:h@sec:tw–LABEL:h@sec:shm-tensor] for our general conventions, the definitions of twisting cochains, twisting cochain homotopies and the corresponding families as well as those of shm maps and their homotopies, compositions and tensor products. We work over an arbitrary commutative ring $\Bbbk$ with unit.

We recall from  [4, Sec. LABEL:h@sec:tw] our “$\stackrel{{\scriptstyle\varkappa}}{{=}}$” notation which alleviates us from explicitly specifying signs coming from the Koszul sign rule. For example, if we define a map $F\colon A\otimes B\otimes C\to A^{\prime}\otimes B^{\prime}$ between complexes by

[TABLE]

Composition of maps is distributed over tensor products. For instance,

[TABLE]

defines the element

[TABLE]

in the endomorphism operad.

3. Homotopy Gerstenhaber algebras

Homotopy Gerstenhaber algebras were introduced by Voronov–Gerstenhaber [15, §8]. For the convenience of the reader, we reproduce the definition of an (extended) homotopy Gerstenhaber algebra from [4, Sec. LABEL:h@sec:hga].

3.1. Definition of an hga

A homotopy Gerstenhaber algebra (homotopy G-algebra, hga) is an augmented dga $A$ with certain operations

[TABLE]

of degree $|E_{k}|=-k$ for $k\geq 1$. It is often convenient to use the additional operation $E_{0}=1_{A}$. These operations satisfy the following properties.

1. (i)

All $E_{k}$ with $k\geq 1$ take values in the augmentation ideal $\bar{A}$ and vanish if any argument is equal to $1$.

[TABLE]

for all $k\geq 1$ and all $a$, $b_{1}$, …, $b_{k}\in A$.

[TABLE]

for $k\geq 0$ and all $a_{1}$, $a_{2}$, $b_{1}$, …, $b_{k}\in A$, where the sum is over all decompositions of $k$ into two non-negative integers.

[TABLE]

for all $k$, $l\geq 0$ and all $a$, $b_{1}$, …, $b_{k}$, $c_{1}$, …, $c_{l}\in A$, where the sum is over all decompositions of $l$ into $2k+1$ non-negative integers,

[TABLE]

A morphism of hgas is a morphism $f\colon A\to B$ of augmented dgas that is compatible with the hga operations in the obvious way.

Remark 3.1**.**

By the properties (iii) and (3.100) as well as multilinearity, we can rewrite any expression formed within an hga as a linear combination of terms $W$ such that no sums or scalar multiples occur inside $W$ and such that the first argument of any operation $E_{k}$ appearing in $W$ is a single variable and neither a product nor another hga operation. When we speak of the terms appearing in some expression within an hga, we mean the terms appearing in such an expansion.

An expansion of this kind is actually unique and corresponds to a $\Bbbk$-basis for the operad $F_{2}\mathcal{X}$ governing homotopy Gerstenhaber algebras, compare [10, Sec. 4] and [3, §1.6.6].

3.2. Extended hgas

In [8] Kadeishvili introduced the notion of an ‘extended hga’ as an hga $A$ defined over $\Bbbk=\mathbb{Z}_{2}$ that admits certain additional operations $E^{i}_{kl}$. Based on this, he constructed $\cup_{i}$-products on $\mathbf{B}A$ for all $i\geq 1$. We will only need the family $F_{kl}=E^{1}_{kl}$, but for coefficients in any $\Bbbk$. We therefore define an hga to be extended if it comes with a family of operations

[TABLE]

of degree $|F_{kl}|=-(k+l)$ for $k$, $l\geq 1$, satisfying the following conditions: The values of all operations $F_{kl}$ lie in the augmentation ideal $\bar{A}$ and vanish if any argument is equal to $1\in A$. The differential of $F_{kl}$ is given by

[TABLE]

for all $a_{1}$, …, $a_{k}$, $b_{1}$, …, $b_{l}\in A$, where

[TABLE]

for $l\geq 2$, cf. [8, Def. 2].

The operation $\mathbin{\cup_{2}}=-F_{11}$ is a $\mathbin{\cup_{2}}$-product for $A$ in the sense that

[TABLE]

for all $a$, $b\in A$. This implies that the Gerstenhaber bracket in $H^{*}(A)$ is trivial, compare [4, eq. \tagform@LABEL:h@eq:def-gerstenhaber-bracket].

A morphism of extended hgas is a morphism of hgas that commutes with all operations $F_{kl}$, $k$, $l\geq 1$.

Cochain algebras of simplicial sets, in particular singular cochain algebras of topological spaces, are naturally extended hgas, compare [4, Sec. LABEL:h@sec:cochains-hga].

4. The shm map

We define the family of maps

[TABLE]

by

[TABLE]

for $n\geq 0$, where the sum is over all decompositions of $n-1$ into $n$ non-negative integers such that

[TABLE]

This condition means that the arguments of any term $E_{j_{s}}(a_{s};\dots)$ are $b$-variables with indices strictly smaller than $s$. It implies $j_{1}=0$, so that each summand starts with the variable $a_{1}$. Omitting the arguments $a_{\bullet}\otimes b_{\bullet}=a_{1}\otimes b_{1}$, $a_{2}\otimes b_{2}$, …, the components of $\Phi$ look as follows in small degrees:

[TABLE]

For $n\geq 1$ the number of summands in $\Phi_{(n)}$ is the Catalan number $C_{n-1}$.

Proposition 4.1**.**

The $\Phi_{(n)}$ assemble to an shm map $\Phi\colon A\otimes A\Rightarrow A$ that satisfies properties (i) and (ii) of the definition of an shc algebra.

Proof.

The verification of property (i) is a direct computation, see Appendix A. For property (ii) we observe that the normalization condition for the hga operations implies that $\Phi_{(n)}$ vanishes for $n>1$ if all $a_{i}$ or all $b_{j}$ equal $1$. Similarly, $\Phi_{(n)}$ vanishes for $n>1$ if $a_{i}\otimes b_{i}=1\otimes 1$ for some $i$, as required by the definition of a twisting family, see [4, eq. \tagform@LABEL:h@eq:tw-fam-1-bis]: For $i<n$ we would have $b_{i}=1$ as an argument to some $E_{k}$-term with $k\geq 1$. For $i=n$ the term $E_{j_{n}}(a_{n};\dots)$ vanishes since $a_{n}=1$ and $j_{n}\geq 1$ as there is at least one more argument, namely $b_{n-1}$. ∎

Remark 4.2**.**

Let $X$ be a simplicial set. Gugenheim–Munkholm [6, Thm. 4.1*∗*] have given a recursive formula for an extension of the cup product to an shm map $C^{*}(X)\otimes C^{*}(X)\Rightarrow C^{*}(X)$. It is based on the Eilenberg–Zilber contraction

[TABLE]

Computer calculations suggest that this algorithm leads to our map $\Phi$ if one uses a slight modification of the classical homotopy $h\colon 1_{C_{*}(X\times X)}\simeq\nabla AW$ defined by Eilenberg–Mac Lane. That the hga structure on $1$-reduced simplicial sets can be defined via the Gugenheim–Munkholm formula follows from combining results of Hess–Parent–Scott–Tonks [7, Sec. 5] and the author [5, App. A].

Proposition 4.3**.**

The composition

[TABLE]

coincides with the product on $\mathbf{B}A$ given by the hga structure of $A$.

Proof.

We verify that the twisting cochain associated to the composition given above equals the twisting cochain $\mathbf{E}$ corresponding to the multiplication on $\mathbf{B}A$ as defined in [4, eq. \tagform@LABEL:h@eq:def-EE]. Let us consider the components

[TABLE]

with $k$, $l\geq 0$ and $n=k+l$.

A look at the formula for $\Phi_{(1)}$ shows that (4.8) is the identity map of $A$ if $(k,l)=(1,0)$ or $(0,1)$. Moreover, the map is zero if $k\neq 1$ and $l=0$, or if $k=0$ and $l\neq 1$ since for $n\geq 2$ at least one term $E_{m}$ with $m\geq 1$ is contained in $\Phi_{(n)}$ and this term vanishes if any argument equals $1$. These cases are therefore verified.

Now assume $k$, $l\geq 1$, and let

[TABLE]

be a term appearing in $\nabla(\mathbfit{c})$ such that $\Phi(\mathbfit{c}^{\prime})$ is non-zero, where

[TABLE]

Because $b^{\prime}_{1}$, …, $b^{\prime}_{n-1}$ become arguments to $E$ terms, they cannot equal $1$. Hence $a^{\prime}_{1}=\dots=a^{\prime}_{n-1}=1$ and $i_{n-1}=1$ in (4.3). This implies

[TABLE]

hence

[TABLE]

It remains to verify that the sign is $+1$ in the case $k=1$. Write $B=A\otimes A$ and

[TABLE]

The summand of $\nabla(\mathbfit{c})$ that is not annihilated by $\Phi$ is

[TABLE]

where

[TABLE]

It is mapped to

[TABLE]

as desired. ∎

Corollary 4.4**.**

The following diagram commutes for any $n\geq 0$:

[TABLE]

Here we have written $\nabla^{[n]}$ and $\mu^{[n]}$ for the $n$-fold iterations of the shuffle map and the multiplication on $A$, which are both associative. See [4, eq. \tagform@LABEL:h@eq:def-Phi-n] for the definition of the iterations of the shm map $\Phi$.

Proof.

We proceed by induction. For $n\leq 1$ there is nothing to show, and the case $n=2$ has been done above. For the induction step we observe that the parallelogram in the diagram

[TABLE]

commutes by [4, Lemma LABEL:h@thm:shuffle-natural-shm] and therefore the outer triangle by induction. This establishes the claim for $n+1$ and completes the proof. ∎

5. Homotopy associativity

The goal of this section is to establish a homotopy $h^{a}$ between the twisting cochains $\Phi\circ(\Phi\otimes 1)$ and $\Phi\circ(1\otimes\Phi)$. To state our definition, we need to introduce some terminology.

A $c$-product is a product of one or more variables $c_{k}$; it is called proper if it has more than one factor. A $b$-term is a term of the form $E_{m}(b_{j};\dots)$ with $m\geq 0$ where all remaining arguments are $c$-products. A $bc$-product is a product of one or more $b$-terms, say ending with $E_{m}(b_{j};\dots)$, followed by the variable $c_{j}$. An $a$-term is a term of the form $E_{m}(a_{i};\dots)$ with $m\geq 0$ where all remaining arguments are $b$-terms, $c$-products or $bc$-products. An $ab$-product is a product of one or more $a$-terms and possibly $b$-terms that ends with an $a$-term. If we want to be more precise about the first variable of an $E$-term, we call it an $a_{i}$-term or a $b_{j}$-term.

To motivate our formula, we observe the following: By [4, eq. \tagform@LABEL:h@eq:f-mult-otimes-g] we have

[TABLE]

Note that $\Phi_{(n)}(b_{\bullet}\otimes c_{\bullet})$ is a $bc$-product. To compute $(\Phi\circ(1\otimes\Phi))_{(n)}(a_{\bullet}\otimes b_{\bullet}\otimes c_{\bullet})$ we use [4, eq. \tagform@LABEL:h@eq:twc-composition]. Taking property (iii) of the definition of an hga into account, we see that we obtain a sum of terms $\pm\,U\,V$ where $V$ is a $bc$-product and $U$ a product of $a$-terms having only $bc$-products as arguments. A similar argument, combined with the associativity condition (3.100), shows that each term appearing in $(\Phi\circ(\Phi\otimes 1))_{(n)}\linebreak[1](a_{\bullet}\otimes b_{\bullet}\otimes c_{\bullet})$ is of the form $\pm\,U\,b_{n}\,W$ where $U$ is an $ab$-product and $W$ a $c$-product. Moreover no $bc$-products appear inside $a$-terms in this case, and the final variable of each $c$-product, say $c_{j}$, corresponds to a $b_{j}$-term that appears as a factor of the top-level product and not as an argument to some $a$-term. The homotopy $h^{a}$ has to interpolate between the two kinds of terms we have described.

We set $h^{a}_{(0)}=\eta_{A}$. For $n\geq 1$, we define

[TABLE]

where the sum is over all $ab$-products $U$ and all $bc$-products $V$ satisfying the following conditions:

1. (i)

Each of the $3n$ variables $a_{1}$, …, $c_{n}$ appears exactly once in $U\,V$. The $a_{i}$’s appear in ascending order, as do the $b_{i}$’s and the $c_{i}$’s. Moreover, $a_{i}$ precedes $b_{i}$ and $b_{i}$ precedes $c_{i}$ for each $i$. 2. (ii)

The first argument to any $E$-term in $U\,V$ has a larger index than the remaining arguments. (The definitions above imply that the first argument also has a smaller letter than the remaining arguments, where $a<b<c$.) 3. (iii)

Any top-level $b$-term appearing in $U$, say with first argument $b_{i}$, comes right after the $a$-term with first argument $a_{i}$. 4. (iv)

Define

[TABLE]

By construction, $\{1,\dots,n\}$ is the disjoint union of $J_{a}$, $J_{b}$ and $J_{c}$. Note that $J_{c}$ cannot be empty as $V$ is a $bc$-product. We additionally require

[TABLE]

where we have written $\nu=\max J_{a}$. If $c_{j}$ does not appear in a proper product, then it is considered to be the last factor of a $c$-product with a single factor. Consequently, we have $n\geq 2$ and $J_{c}=\{\nu+1,\dots,n\}$.

The sign exponent $\varepsilon$ in (5.2) is defined recursively. Write $\mu=\min J_{a}$. If $\mu=\nu$, that is, if $J_{a}=\{\nu\}$, then

[TABLE]

The contributions are as follows: Consider a $bc$-product

[TABLE]

occurring in some term $E_{p}(a_{i};\dots)$ as $m$-th argument (with $a_{i}$ being at position [math] and the last argument at position $p$). The contribution of such a term is

[TABLE]

Note that $q_{j}+\dots+q_{k}$ is the degree of the $bc$-product, considered as a function of its arguments, and $p-m+1$ is the number of arguments of $E_{p}(a_{i};\dots)$ from the $bc$-product (including) to the end. If $E_{q}(b_{\nu};\dots)$ occurs in the term $E_{p}(a_{i};\dots)$ as $m$-th argument, then its contribution is

[TABLE]

where $\hat{\varepsilon}$ is the degree of the terms preceding the $E(a_{i};\dots)$-term, again considered as a function of their arguments. For example, if $U\,V$ is

[TABLE]

then the contribution of the $bc$-product inside the $a_{6}$-term is $2\cdot 1=2$, and that of the $b_{3}$-term is $1+1+1\cdot 1=3$.

If $J_{a}$ is not a singleton, then we compare (5.2) to a summand $(-1)^{\varepsilon^{\prime}}\,U^{\prime}\,V^{\prime}$ with $J_{a}^{\prime}=J_{a}\setminus\{\mu\}$ and $J_{b}^{\prime}=J_{b}\cup\{\mu\}$. More precisely: We can write $U\,V$ as

[TABLE]

where the $b_{\mu}$-term is the $m$-th argument of the $a_{i}$-term. We define $U^{\prime}\,V^{\prime}$ as

[TABLE]

where all $c$-variables $c_{\bullet}$ appearing between $a_{\mu+1}$ and $b_{\mu}$ have been moved as additional arguments to the term $E(a_{\mu};\dots)$. Moreover, the proper $c$-product starting with $c_{\mu}$ is split into $c_{\mu}$ and the remaining product. These two arguments replace the original $c$-product, wherever it appears in $U\,V$. For example, if $U\,V$ is

[TABLE]

then $U^{\prime}\,V^{\prime}$ equals

[TABLE]

The sign exponents $\varepsilon$ and $\varepsilon^{\prime}$ are related by

[TABLE]

where

[TABLE]

is the degree of the expression preceding $E(a_{i};\dots)$ as a function of its arguments, and $\hat{\varepsilon}$ is the sign exponent for the summand of $d(U^{\prime}V^{\prime})$ that recombines $c_{\mu}$ and the following $c$-product to the original one. In the example (5.16) we have $\hat{\varepsilon}=5$. Since $\tilde{\varepsilon}$ is a summand of $\hat{\varepsilon}$, the difference $\varepsilon-\varepsilon^{\prime}$ is actually independent of $\tilde{\varepsilon}$.

Omitting the arguments, $a_{\bullet}\otimes b_{\bullet}\otimes c_{\bullet}$, the components of $h^{a}$ look as follows in small degrees. We also indicate the values of $J_{a}$, $J_{b}$ and $J_{c}$ for each term. Note that the vanishing of $h^{a}_{(1)}$ reflects the identity $(\Phi\circ(\Phi\otimes 1))_{(1)}=(\Phi\circ(1\otimes\Phi))_{(1)}=\mu_{A}^{[3]}$.

[TABLE]

Remark 5.1**.**

The number of terms seems to grow rapidly with $n$, by a factor close to $10$ with each degree. There are no terms in $h^{a}_{(1)}$, two terms in $h^{a}_{(2)}$, $25$ terms in $h^{a}_{(3)}$, $254$ terms in $h^{a}_{(4)}$, $2421$ terms in $h^{a}_{(5)}$, $22{,}522$ terms in $h^{a}_{(6)}$, $207{,}682$ terms in $h^{a}_{(7)}$, $1{,}911{,}954$ terms in $h^{a}_{(8)}$ and $17{,}635{,}830$ terms in $h^{a}_{(9)}$.

Proposition 5.2**.**

The maps $h^{a}_{(n)}$ assemble to an shm homotopy $h^{a}$ from $\Phi\circ(\Phi\otimes 1)$ to $\Phi\circ(1\otimes\Phi)$.

Proof.

This is a very long direct computation, see Appendix B. We remark that this proof is the only place in this paper where we use the associativity condition (3.100) for the hga structure, besides assuming that the product on $\mathbf{B}A$ is associative.

Let us verify here the normalization condition [4, eq. \tagform@LABEL:h@eq:tw-h-family-1] for twisting homotopy families. Consider a term $U\,V$ in (5.2) and assume that $a_{i}=b_{i}=c_{i}=1$ for some $i$.

If $i\in J_{a}$, then the $a$-term containing $b_{i}$ vanishes and therefore also $U\,V$.

In the case $i\in J_{b}$ the $b_{i}$-term is top-level and there is a $c$-product ending in $c_{i}$. If $i>1$ and $b_{i-1}$ is not top-level, then it must be an argument to the $a_{i}$-term, which therefore vanishes. Otherwise, the $c$-product containing $c_{i}$ is just $c_{i}=1$ itself. Since it is argument to some $a$-term or $b$-term, the whole expression is again [math].

We finally consider the case $i\in J_{c}$. Again, the $c$-product containing $c_{i}$ is $c_{i}=1$ itself. If the $bc$-term containing $b_{i}$ does not end in $c_{i}$, then $c_{i}$ is argument to some later $b$-term in the same $bc$-product, so that $U\,V$ vanishes. If the $bc$-product ends in $c_{i}$, we look at $b_{i-1}$. If it appears in the same $bc$-product, then $c_{i-1}$ is an argument of the $b_{i}$-term. If $i=\nu$ or if $b_{i-1}$ is part of an earlier $bc$-product, then it appears inside the $a_{i}$-term, which once again forces $U\,V$ to vanish. ∎

Proposition 5.3**.**

The associated coalgebra homotopy $\mathbf{B}h^{a}$ vanishes on the image of the iterated shuffle map $\nabla^{[3]}\colon\mathbf{B}A\otimes\mathbf{B}A\otimes\mathbf{B}A\to\mathbf{B}(A\otimes A\otimes A)$.

Proof.

Assume that $h^{a}$ does not vanish on the term

[TABLE]

appearing in

[TABLE]

where $n=k+l+m\geq 1$. By the definition of the shuffle map, two of the three factors are equal to $1$ in each tensor product $a^{\prime}_{j}\otimes b^{\prime}_{j}\otimes c^{\prime}_{j}$. We must have $b^{\prime}_{j}\neq 1$ for $j\in J_{a}$ because otherwise the $b^{\prime}_{j}$-term would have value [math] or $1$, in which case the surrounding $a$-term vanishes. This implies $c^{\prime}_{j}=1$ for all $j\in J_{a}$, so that the $c$-product $\tilde{c}$ ending in $c_{\nu}$ is $1$. As a consequence, the $E$-term having $\tilde{c}$ as an argument vanishes. We conclude that for $n\geq 1$ there is no term in the image of the shuffle map on which $h^{a}$ assumes a non-zero value. In other words, $\mathbf{B}h^{a}\,\nabla^{[3]}=0$. ∎

Remark 5.4**.**

Corollary 4.4 applies in particular to $\Phi^{[3]}=\Phi\circ(\Phi\otimes 1)$, and a look at the proof shows that the conclusion equally holds for $\Phi\circ(1\otimes\Phi)$. Together with Proposition 5.3, this implies (in a quite roundabout way) that condition (3.100) of an hga structure indeed leads to an associative multiplication on the bar construction.

In the remainder of this section we collect some observations that will be used in Appendix B. We start by noting the following variant of property (ii) of the definition of an hga,

[TABLE]

valid for all $k$, $q\geq 0$ and all $a$, $b$, $c_{\bullet}\in A$. This is a consequence of the convention (2.4) because we have permuted the operations $E_{p-1}$ and $E_{q}$. Similarly, property (iii) implies

[TABLE]

for all $k$, $p_{1}$, $p_{2}\geq 0$ and all $a_{1}$, $a_{2}$, $b_{\bullet}$, $c_{\bullet}\in A$.

Let us write $\Phi^{\prime}=\Phi\circ(\Phi\otimes 1)$. We note that each term appearing $\Phi^{\prime}(a_{\bullet}\otimes b_{\bullet}\otimes c_{\bullet})$ contains only one $bc$-product (at the very end) and that no two top-level $b$-terms are adjacent.

Lemma 5.5**.**

Let $(-1)^{\varepsilon}\,W$ be a summand appearing in $\Phi^{\prime}_{(n)}(a_{\bullet}\otimes b_{\bullet}\otimes c_{\bullet})$. Assume that it has at least one $b$-term inside an $a$-term, and let $\mu$ be the smallest index of such a $b$-variable. Then a term $E_{q}(b_{\mu};\dots)$ appears as, say, the $m$-th argument  of a term $E_{p_{r}}(a_{r};\dots)$, and $c_{\mu}$ as the first variable inside a proper $c$-product $c_{\mu}\tilde{c}$. Let $W^{\prime}$ be obtained from $W$ in the same way as in (5.13), and let $\varepsilon^{\prime}$ be the sign exponent of $W^{\prime}$ in $\Phi^{\prime}_{(n)}(a_{\bullet}\otimes b_{\bullet}\otimes c_{\bullet})$. We have

[TABLE]

Here $\tilde{\varepsilon}$ is the degree of all $E$-operations in front of the $a_{i}$-term in $W$, and $\hat{\varepsilon}$ is the sign exponent of the part of the differential $d(W^{\prime})$ that recombines $c_{\mu}$ and $\tilde{c}$ to $c_{\mu}\tilde{c}$.

In other words, the rule used in the recursive sign definition (5.17) for $h^{a}$ also applies to $\Phi^{\prime}$. Note that $c_{\mu}\tilde{c}$ may be the trailing $c$-product in the case of $\Phi^{\prime}$, which is impossible for $h^{a}$. This will be important for the pair 36.2.2. in Section B.2.

Proof.

We can perform the modification $W\to W^{\prime}$ in steps: We move $c$-variables in front of the $b_{\mu}$-term to the preceding $a$-term (as in the pair 13. in Section B.1), we move the $b_{\mu}$-term to the preceding $a$-term (as in the pair 1.) or out of the current $a$-term if it is contained in the $a_{\mu+1}$-term (as in 2. and 4.–6.).

In each step, one could verify the signs directly, keeping track of

1. (1)

the sign in the definition (4.2) of $\Phi$, 2. (2)

the sign given by [4, eq. \tagform@LABEL:h@eq:twc-composition-sign] that arises from the composition of the twisting cochains $\Phi$ and $\Phi\otimes 1$, 3. (3)

the sign that accounts for distributing composition of maps over tensor products as in (2.4), 4. (4)

the product of the signs that appears when the first argument in each term $E_{i_{s}}(A;c_{\bullet})$ is split into its factors as in (5.27) where $A$ is a summand of some $\Phi_{(j_{t})}(a_{\bullet}\otimes b_{\bullet})$ given by (4.2), and 5. (5)

the product of the signs appearing each time a term $E_{l}(E_{j_{t}}(a_{t};b_{\bullet});c_{\bullet})$ is expanded according to the associativity rule (3.100).

Alternatively, we can argue as follows: Since $\Phi^{\prime}$ is a twisting cochain, the corresponding family satisfies the defining equation [4, eq. \tagform@LABEL:h@eq:tw-fam-2]. We observe that the terms $W$ and $W^{\prime}$ share exactly one term in their differentials with respect to the $\Bbbk$-basis for $F_{2}\mathcal{X}(n)$ described in Remark 3.1. Moreover, this common term is not produced by the differential of any other term appearing in $\Phi^{\prime}_{(n)}(a_{\bullet}\otimes b_{\bullet}\otimes c_{\bullet})$, nor by any term appearing on the right-hand side of the defining equation. Hence the two terms in question must cancel out, which leads to the claimed sign rule. ∎

6. Homotopy commutativity

Let $\Phi\colon A\otimes A\Rightarrow A$ be the shm map constructed in Section 4 or, more generally for the moment, any shm map extending the multiplication in $A$ such that Proposition 4.3 holds. Then

[TABLE]

for all $a$, $b\in A$, cf. [12, Prop. 4.8].111The second “$a$” appearing in the argument of $\Phi$ in [12, Prop. 4.8] should read “$\bar{a}$”. We also remark that the twisting cochain condition [4, eq. \tagform@LABEL:h@eq:def-tw-cochain] implies $\Phi_{(2)}(a\otimes 1,1\otimes b)=0$. (For our $\Phi$ this can be read off from (4.5).) Now assume that $h$ is an shm homotopy from $\Phi$ to $\Phi\circ T$, as required by property (iv) of an shc algebra. A straightforward computation shows that

[TABLE]

is a $\mathbin{\cup_{2}}$-product for $A$ in the sense that it satisfies (3.9). As remarked in Section 3.2, a non-trivial Gerstenhaber bracket in $H^{*}(A)$ is an obstruction to the existence of a $\mathbin{\cup_{2}}$-product and therefore to the homotopy commutativity of $\Phi$.

In order to proceed, we put as an additional assumption in this section that $A$ be extended. Let us define $h^{c}_{(0)}=\eta_{A}$ and

[TABLE]

for $n\geq 1$. The first sum is over all decompositions of $n$ into $n$ non-negative integers. The second sum is over all positive integers $p$, $q$, $k$, $l$ and all non-negative integers $i_{1}$, …, $i_{q}$, $j_{1}$, …, $j_{p}$ such that

[TABLE]

and

[TABLE]

Omitting the argument $a_{\bullet}\otimes b_{\bullet}$, the formula for $h^{c}$ looks as follows in small degrees.

[TABLE]

Proposition 6.1**.**

Assume that the hga $A$ is extended. The maps $h^{c}_{(n)}$ assemble to an shm homotopy $h^{c}$ from $\Phi\circ T$ to $\Phi$.

Note that $h^{c}\circ T$ is a homotopy in the other direction.

Proof.

This is a yet another lengthy direct verification, see Appendix C. It is helpful to observe the following: Consider a term appearing in the second sum of (6.5), and let $1\leq m\leq n$. Then $b_{m}$ appears in the leading group of $E$-terms if and only if $a_{m}$ appears in the same group or in the $F$-term. Equivalently, $a_{m}$ appears in the trailing group of $E$-terms if and only if $b_{m}$ appears in the same group or in the $F$-term.

This in particular shows that $h^{c}$ satisfies the normalization condition for twisting homotopy families because it is impossible for any term in the second sum and any $m$ that $b_{m}$ appears before the $F$-term and $a_{m}$ after it. That the first sum vanishes if some $b_{m}=1$ is clear. ∎

Using the homotopy $h^{c}$, we can generalize the formula for the $\mathbin{\cup_{1}}$-product on the bar construction given by Kadeishvili [8, Prop. 2] for $\Bbbk=\mathbb{Z}_{2}$. Earlier, Baues [1, §2.9] obtained the dual formula for the cobar construction $\Omega\,C(X)$ of a $1$-reduced simplicial set $X$ and any $\Bbbk$ (without using the surjection operad explicitly).

Corollary 6.2**.**

The composition $\mathbf{B}h^{c}\,\nabla_{A,A}$ is a coalgebra homotopy from the product with commuted factors to the regular product on $\mathbf{B}A$. The associated twisting cochain homotopy $\mathbf{F}$ is given by

[TABLE]

where the “$\mp$” indicates a minus sign combined with the sign from [4, eq. \tagform@LABEL:h@eq:def-tw-h-fam].

Proof.

Assume $n=k+l>0$ and consider a term

[TABLE]

appearing in $\nabla([a_{1}|\dots|a_{k}]\otimes[b_{1}|\dots|b_{l}])$. Any such term is mapped to [math] by the first sum in the definition of $h^{c}_{(n)}$. Assume that $b^{\prime}_{i}$ occurs in the leading group of $E$-term in a non-zero contribution to the second sum. Then $a^{\prime}_{i}$ appears also in the leading group or in the $F$-term. The normalization conditions for the $E$-operations and the $F$-operations imply $a^{\prime}_{i}\neq 1$, so that we have $b^{\prime}_{i}=1$. By looking at the trailing group of $E$-term, we similarly conclude $a^{\prime}_{i}=1$. Hence $p=k$ and $q=l$ in the definition of $h^{c}_{(n)}$,

[TABLE]

and all variables $i_{t}$ and $j_{s}$ are [math]. ∎

7. Polynomial algebras

Let $A$ and $B$ be augmented dgas, and let $\mathfrak{b}\lhd B$ be a differential ideal. Recall from [4, eq. \tagform@LABEL:h@eq:def-shm-strict] that an shm map $f\colon A\Rightarrow B$ is called $\mathfrak{b}$-strict if we have $f_{(n)}\equiv 0\pmod{\mathfrak{b}}$ for all components with $n\geq 2$. Similarly, a homotopy $h$ between $f$ and another shm map $g$ is called $\mathfrak{b}$-trivial if $h_{(n)}\equiv 0\pmod{\mathfrak{b}}$ for $n\geq 1$, see [4, eq. \tagform@LABEL:h@eq:h-trivial-def].

We write $\Bbbk[x]$ for a polynomial algebra on a generator $x$ of even degree. We start with an analogue of the first part of [12, Prop. 6.2]. The second part will be addressed by Proposition 7.2.

Proposition 7.1**.**

Let $f$, $g\colon\Bbbk[x]\Rightarrow A$ be $\mathfrak{a}$-strict shm maps. If there is a $b\in\mathfrak{a}$ such that $db=f_{(1)}(x)-g_{(1)}(x)$, then $f$ and $g$ are homotopic via an $\mathfrak{a}$-trivial homotopy.

Proof.

We assume first that $g$ is strict with $g(x)=f_{(1)}(x)=\vcentcolon a$. It is a direct calculation to verify that an $\mathfrak{a}$-trivial homotopy from $f$ to $g$ is given by the family

[TABLE]

for $n\geq 1$, see Appendix D. The decomposition $k^{\prime}+k^{\prime\prime}=k_{n}-1$ is into non-negative integers. Note that $h_{(n)}(x^{k_{\bullet}})$ vanishes for any $n\geq 1$ if $k_{n}\leq 1$ or $k_{m}=0$ for some $m<n$. This in particular shows that $h_{(n)}$ satisfies the normalization condition for twisting homotopy families.

As a consequence of this and [4, Lemma LABEL:h@thm:tw-h-equiv-rel], we can assume that both $f$ and $g$ are strict in order to prove the general case. Then

[TABLE]

is an algebra homotopy from $f$ to $g$ (in the sense of [12, §1.11]) taking values in $\mathfrak{a}$. It gives rise to an $\mathfrak{a}$-trivial shm homotopy $\tilde{h}$ from $f$ to $g$ with $\tilde{h}_{(1)}=h$ and $\tilde{h}_{(n)}=0$ for $n\geq 2$. ∎

The following is a variant of [12, Lemma 7.3] with an explicit homotopy. Recall that any hga is canonically an shc algebra in the sense of Stasheff–Halperin, and in the sense of Munkholm if it is extended. We refer to [4, Sec. LABEL:h@sec:shc] for the definition of an ($\mathfrak{a}$-natural) shc map.

Proposition 7.2**.**

Let $A$ be an hga such that all operations $E_{k}$, $k\geq 2$, take values in a common ideal $\mathfrak{a}\lhd A$. Let $a\in A$ be a cocycle of even degree and assume that there is a $b\in\mathfrak{a}$ such that $db=E_{1}(a;a)$. Then the dga map

[TABLE]

is an $\mathfrak{a}$-natural shc map.

Proof.

We have to show that the dga map

[TABLE]

is homotopic to the shm map

[TABLE]

via an $\mathfrak{a}$-strict shm homotopy. Such a homotopy from the latter map to the former is given by the following twisting homotopy family, where we write $x^{k_{\bullet}}\otimes x^{l_{\bullet}}$ for the sequence of arguments $x^{k_{1}}\otimes x^{l_{1}}$, …, $x^{k_{n}}\otimes x^{l_{n}}$:

[TABLE]

for $n\geq 3$. The first sum in the first group of (7.7) extends over all decompositions $n-1=i_{1}+\dots+i_{n}$ into $n$ non-negative integers such that

[TABLE]

and the first sums in the other two groups of (7.7) similarly over all decompositions $n-2=i_{1}+\dots+i_{n-1}$ into $n-1$ non-negative integers such that

[TABLE]

The decompositions into $k^{\prime}+k^{\prime\prime}$ and $l^{\prime}+l^{\prime\prime}$ also involve non-negative integers. Note that the formula for $n=2$ is the same as the one for $n\geq 3$ with the sum over $l^{\prime}+l^{\prime\prime}=l_{n-2}-1$ omitted. Also observe that $b$ is of even degree $2|a|-2$ and that $i_{n}+1\geq 2$ in the first group of (7.7) so that $h$ is indeed $\mathfrak{a}$-trivial. The verification of the homotopy property is a lengthy computation, see Appendix E.

That the normalization condition for twisting homotopy families is satisfied follows by direct inspection: Assume that $k_{i}=l_{i}=0$ for some $i$. It is clear that each term in the sum for $n=2$ vanishes if $k_{2}=0$ or $l_{1}=0$. Similarly, each term in the first two sums for $n\geq 3$ vanishes if $k_{n}=0$ or $l_{n-1}=0$ or $l_{m}=0$ for $m\leq n-2$. For each term in the third sum we get this for $k_{n}=0$ or $l_{n-2}=0$ or $l_{m}=0$ for $m\leq n-3$. In the case $k_{n-1}=0$ we finally use that the corresponding $E$-term has another argument since $i_{n-1}\geq 1$. ∎

8. Concluding remark

It would certainly be desirable to have a more conceptual proof of Theorem 1.1 than our explicit construction. (Remark 4.2 might indicate a first step in this direction.) We point out, however, that the operad $F_{2}\mathcal{X}$ governing hgas has non-trivial homology in the degrees we are interested in. In fact, since $F_{2}\mathcal{X}(n)$ models the configuration space of $n$ points in the plane, its homology $H_{k}(F_{2}\mathcal{X}(n))$ is non-zero for all $0\leq k<n$, see the references given in Remark 3.1 as well as [13]. The Gerstenhaber bracket is a non-trivial element in $H_{1}(F_{2}\mathcal{X}(n))$ for $n\geq 2$, and its iterations give non-zero elements of higher degree.

A direct way to see this is the following: The Hochschild cohomology of an algebra $A$ is an algebra over $H(F_{2}\mathcal{X})$. If $A$ is commutative, then $H\mkern-2.0muH^{0}(A)=A$, and $H\mkern-2.0muH^{1}(A)=\operatorname{Der}(A)$ are the derivations of $A$. The Gerstenhaber bracket of $a\in A$ and $D\in\operatorname{Der}(A)$ is given by $[D,a]=D(a)\in A$, cf. [2, Props. 19, 22, Example 52]. If $A=\Bbbk[x_{1},\dots,x_{n}]$ is a polynomial algebra, then the expression in $n$ elements from $H\mkern-2.0muH^{*}(A)$ involving a $k$-fold iterated bracket,

[TABLE]

shows $H_{k}(F_{2}\mathcal{X}(n))\neq 0$ for any $0\leq k<n$.

Appendix A Proof of Proposition 4.1

In this and the following appendices we outline several proofs that are elementary, but lengthy computations. The main difficulties are to distinguish between the many cases to consider and to keep track of the signs. We write “X $\to$ Y” to indicate that the terms for case X cancel with or result in the terms for case Y.

Terms produced by $d(\Phi_{(n)})$

1. 1.

$b_{j}$-variable moved out of an $E(a_{i};...)$-term to the left

In this case we have $i>1$.

1. 1.1.

$j<i-1$

$\to$ 2.1. 2. 1.2.

$j=i-1$

$\to$ 6. 2. 2.

$b$-variable moved out of an $E(a_{i};...)$-term to the right

1. 2.1.

$i<n$

$\to$ 1.1. 2. 2.2.

$i=n$

$\to$ 5.

In this case we have $j=n-1$. 3. 3.

Two $b$-variables multiplied together in an $E$-term

$\to$ 4.

In this case the corresponding $a$-variables are further to the left.

Terms appearing in $\Phi_{(n-1)}(\dots,a_{i}a_{i+1}\otimes b_{i}b_{i+1},\dots)$

1. 4.

$i<n-1$

$\to$ 3. 2. 5.

$i=n-1$

$\to$ 2.2.

Terms appearing in $\Phi_{(k)}\,\Phi_{(n-k)}$

1. 6.

all such terms

$\to$ 1.2.

Appendix B Proof of Proposition 5.2

We write $\Phi^{\prime}=\Phi\circ(\Phi\otimes 1)$ and $\Phi^{\prime\prime}=\Phi\circ(1\otimes\Phi)$. Because of the recursive definition of the sign for each term appearing in $h^{a}$, we first pair up the terms appearing in the equation under consideration,

[TABLE]

In a second step we show that the signs work out the way they should.

B.1. Pairing the terms

We assume $n\geq 2$. Recall that we write $\nu$ for the maximal index $j$ such that $b_{j}$ does not appear in a $bc$-product.

Terms produced by $d(h^{a}_{(n)})$

1. 1.

Terms coming from an $a_{i}$-term

In this case we have $i>1$.

$\to$ 3.3.2.

1.1.1.2.2.

$j=\nu$

In this case $c_{\nu}c_{\nu+1}$ does not appear in a $c$-product.

1. 1.1.1.2.2.1.

$b_{\nu+1}$ is first $b$-variable in $bc$-product inside an $a$-term

$\to$ 1.3.1.3.2.1.2.

1.1.1.2.2.1.2.

$b_{\nu+1}$ is not the only $b$-variable in this $bc$-product       

$\to$ 1.3.1.2.2.1.

1.1.1.2.2.2.

$b_{\nu+1}$ is first $b$-variable in final $bc$-product

1.1.1.2.2.2.1.

$b_{\nu+1}$ is not the only $b$-variable in this $bc$-produc

$\to$ LABEL:ha:12131

This case means $\nu<n-1$.

1.1.1.2.2.2.2.

$b_{\nu+1}$ is the only $b$-variable in this $bc$-product

$\to$ 8.1.

This case means $\nu=n-1$.

1.1.2.

$bc$-product moved out to the left

Let’s write the final $c$-variable of the $bc$-product as $c_{j}$.

1. 1.1.2.1.

$j<i-1$

$\to$ 1.2.2.1. 2. 1.1.2.2.

$j=i-1$

$\to$ 10.

All $c_{k}$ with $k>j$ appear as single arguments, not inside a proper $c$-product.

1.1.3.

$c$-product moved out to the left

Let’s write the final $c$-variable as $c_{j}$.

1. 1.1.3.1.

Previous term is $a_{i-1}$-term

$\to$ 1.2.3.1.

In this case we have $j<i-1$. 2. 1.1.3.2.

Previous term is (top-level) $b_{i-1}$-term

1. 1.1.3.2.1.

$j<i-1$

$\to$ 2.2. 2. 1.1.3.2.2.

$j=i-1$

$\to$ 7.

Since $b_{j}$ is top-level, we cannot have $j=\nu$.

1.2.

Last argument moved out to the right

1. 1.2.1.

$b_{j}$-term moved out to the right

$\to$ 3.3.1.

1.2.2.

$bc$-product moved out to the right

In this case the next term cannot be a top-level $b$-term.

1. 1.2.2.1.

Next term is $a_{i+1}$-term

$\to$ 1.1.2.1. 2. 1.2.2.2.

Next term is first $b$-term of final $bc$-product

$\to$ 3.1.2.2.

1.2.3.

$c$-product moved out to the right

1. 1.2.3.1.

Next term is $a_{i+1}$-term

$\to$ 1.1.3.1. 2. 1.2.3.2.

Next term is top-level $b_{i}$-term inside $ab$-product

$\to$ 2.1. 3. 1.2.3.3.

Next term is first $b$-term of final $bc$-product

$\to$ 3.1.1.

1.3.

Two arguments multiplied together

1. 1.3.1.

First argument is a $b_{j}$-term

1. 1.3.1.1.

Second argument is a $b_{j+1}$-term

$\to$ 4.

In this case we have $c_{j}c_{j+1}$ inside some $c$-product. 2. 1.3.1.2.

Second argument is a $bc$-product

In this case we have $j=\nu$.

1. 1.3.1.2.1.

$\nu=1$

$\to$ 9.2.2. 2. 1.3.1.2.2.

$\nu>1$

1. 1.3.1.2.2.1.

$b_{\nu-1}$ appears in a top-level $b$-term

$\to$ 1.1.1.2.2.1.2.

In this case $c_{\nu-1}c_{\nu}$ does not appear in any $c$-product. 2. 1.3.1.2.2.2.

$b_{\nu-1}$ does not appear in a top-level $b$-term

$\to$ 1.4.2.3.1.

In this case $c_{\nu-1}c_{\nu}$ appears in a $c$-product inside the given $bc$-product. 3. 1.3.1.3.

Second argument is a $c$-product

Let’s write $c_{k}$ for the final $c$-variable in the $c$-product.

1. 1.3.1.3.1.

$k<j$

$\to$ 1.4.1.2. 2. 1.3.1.3.2.

$k=j$

1. 1.3.1.3.2.1.

$c$-product is the single variable $c_{j}$

1. 1.3.1.3.2.1.1.

$k=j=1$

$\to$ 9.2.1. 2. 1.3.1.3.2.1.2.

$k=j>1$

$\to$ 1.1.1.2.2.

In this case $b_{j-1}$ is top-level. 2. 1.3.1.3.2.2.

$c$-product is proper $c$-product

$\to$ 1.4.2.2.2.2.

In this case we have $j=k=\nu$. 2. 1.3.2.

First argument is a $bc$-product

$\to$ 1.4.2.1.2.2.

In this case the second argument is also a $bc$-product. 3. 1.3.3.

First argument is a $c$-product

Let’s write $c_{k}$ for the last variable appearing in the $c$-product.

1. 1.3.3.1.

Second argument is a $b$-term

$\to$ 1.4.1.1. 2. 1.3.3.2.

Second argument is a $bc$-product

$\to$ 1.4.2.1.1. 3. 1.3.3.3.

Second argument is a $c$-product

$\to$ LABEL:ha:111213

In this case we have $k<\nu$ since all $c_{l}$ with $l>\nu$ appear in $bc$-products. Hence $b_{k}$ appears in a top-level $b$-term.

1.4.

Terms produced by one of the arguments of the $a$-term

1. 1.4.1.

Terms produced by a $b$-term as argument

Let’s write the $b$-variable as $b_{j}$.

1. 1.4.1.1.

$c$-product moved out to the left

$\to$ 1.3.3.1. 2. 1.4.1.2.

$c$-product moved out to the right

$\to$ 1.3.1.3.1. 3. 1.4.1.3.

Two $c$-products multiplied together

$\to$ LABEL:ha:111211

Let’s write $c_{k}$ for the final $c$-variable of the first $c$-product. Then $k<j\leq\nu$, hence $b_{k}$ appears in a top-level $b$-term. 2. 1.4.2.

Terms produced by a $b$-term inside a $bc$-product

Let’s write the $b$-variable as $b_{j}$.

1. 1.4.2.1.

$c$-product moved out to the left

Let’s write the final $c$-variable as $c_{k}$.

1. 1.4.2.1.1.

$b$-term is the first $b$-term in the $bc$-product

$\to$ 1.3.3.2. 2. 1.4.2.1.2.

$b$-term is not the first $b$-term in the $bc$-product

1. 1.4.2.1.2.1.

$k<j-1$

$\to$ 1.4.2.2.1. 2. 1.4.2.1.2.2.

$k=j-1$

$\to$ 1.3.2.

In this case the $c$-product is a single variable $c_{i-1}$. 2. 1.4.2.2.

$c$-product moved out to the right

Let’s write the final $c$-variable as $c_{k}$.

1. 1.4.2.2.1.

$b_{j}$ is not the last $b$-variable in the $bc$-product

$\to$ 1.4.2.1.2.1. 2. 1.4.2.2.2.

$b_{j}$ is the last $b$-variable in the $bc$-product

In this case we have $k=j-1$.

1. 1.4.2.2.2.1.

$\nu<j-1$

$\to$ 6.1.2.

In this case the $c$-product is the single variable $c_{j-1}$. Also, $b_{j-1}$ is part of the same $bc$-product for otherwise $c_{n-1}$ would be at the end of the previous $bc$-product. 2. 1.4.2.2.2.2.

$\nu=j-1$

$\to$ 1.3.1.3.2.2. 3. 1.4.2.3.

Two $c$-products multiplied together

Let’s write $c_{k}$ for the final $c$-variable of the first $c$-product.

1. 1.4.2.3.1.

$b_{k}$ appears in a $b$-term inside an $a$-term

$\to$ 1.3.1.2.2.2.

In this case we have $k=\nu$. 2. 1.4.2.3.2.

$b_{k}$ appears in a top-level $b$-term

$\to$ LABEL:ha:111215a 3. 1.4.2.3.3.

$b_{k}$ appears in a $bc$-product (inside some $a$-term)

$\to$ 6.1.1.

In this case the second $c$-product is the single variable $c_{k+1}$, and $b_{k+1}$ appears in the same $bc$-product as $b_{k}$.

2.

Terms coming from a top-level $b$-term in the $ab$-product

1. 2.1.

$c$-product moved out to the left

$\to$ 1.2.3.2. 2. 2.2.

$c$-product moved out to the right

$\to$ 1.1.3.2.1. 3. 2.3.

Two $c$-products multiplied together

$\to$ LABEL:ha:111215

Let’s write $c_{j}$ for the final $c$-variable of the first $c$-product. Then $j<i$, hence $b_{j}$ appears in a top-level $b$-term.

3.

Terms coming from a $b_{i}$-term in the final $bc$-product

1. 3.1.

$c$-product moved out to the left

Let’s write the final $c$-variable as $c_{j}$.

1. 3.1.1.

$b_{i}$ is the first $b$-variable in the $bc$-product

$\to$ 1.2.3.3. 2. 3.1.2.

$b_{i}$ is not the first $b$-variable in the $bc$-product

1. 3.1.2.1.

$j<i-1$

$\to$ 3.2.1. 2. 3.1.2.2.

$j=i-1$

$\to$ 1.2.2.2.

In this case the $c$-product is a single variable $c_{i-1}$. 2. 3.2.

$c$-product moved out to the right

Let’s write the final $c$-variable as $c_{j}$.

1. 3.2.1.

$i<n$

$\to$ 3.1.2.1. 2. 3.2.2.

$i=n$

In this case we have $j=n-1$.

1. 3.2.2.1.

$\nu<n-1$

$\to$ 6.2.2.

In this case the $c$-product is the single variable $c_{n-1}$. Also, $b_{n-1}$ is part of the same $bc$-product for otherwise $c_{n-1}$ would be at the end of the previous $bc$-product. 2. 3.2.2.2.

$\nu=n-1$

$\to$ 8.2. 3. 3.3.

Two $c$-products multiplied together

Let’s write $c_{j}$ for the final $c$-variable of the first $c$-product. Then $b_{j}$ appears either in a top-level $b$-term or in a $bc$-product.

1. 3.3.1.

$b_{j}$ appears in an $a$-term

$\to$ 1.2.

In this case we have $j=\nu$. 2. 3.3.2.

$b_{j}$ appears in a top-level $b$-term

$\to$ B.1 3. 3.3.3.

$b_{j}$ appears in a $bc$-product

$\to$ 6.2.1.

In this case the second $c$-product is the single variable $c_{j+1}$, and $b_{j+1}$ appears in the same $bc$-product as $b_{j}$.

Terms appearing in $h^{a}_{(n-1)}(\dots,a_{i}a_{i+1}\otimes b_{i}b_{i+1}\otimes c_{i}c_{i+1},\dots)$

1. 4.

$b_{i}b_{i+1}$ in a $b$-term that is argument to an $a$-term

$\to$ 1.3.1.1. 2. 5.

$b_{i}b_{i+1}$ in a top-level $b$-term in the $ab$-product

$\to$ LABEL:ha:1212 3. 6.

$b_{i}b_{i+1}$ in a $b$-term appearing in a $bc$-product

1. 6.1.

$c_{i}c_{i+1}$ in a $bc$-product inside an $a$-term

1. 6.1.1.

$c_{i}c_{i+1}$ is argument to a $b$-term in the $bc$-product

$\to$ 1.4.2.3.3. 2. 6.1.2.

$c_{i}c_{i+1}$ at the end of the $bc$-product

$\to$ 1.4.2.2.2.1. 2. 6.2.

$c_{i}c_{i+1}$ in final $bc$-product

1. 6.2.1.

$c_{i}c_{i+1}$ is argument to a $b$-term in the $bc$-product

$\to$ 3.3.3. 2. 6.2.2.

$c_{i}c_{i+1}$ at the end of the $bc$-product

$\to$ 3.2.2.1.

Terms appearing in \bigl{(}\Phi\circ(\Phi\otimes 1)\bigr{)}_{(k)}\,h^{a}_{(n-k)}

1. 7.

$k<n$

$\to$ 1.1.3.2.2. 2. 8.

$k=n$

1. 8.1.

$b_{n-1}$ appears before $a_{n}$-term in $\Phi^{\prime}$

$\to$ 1.1.1.2.2.2.2.

In this case the final $c$-product in $\Phi^{\prime}$ is $c_{n}$ only. 2. 8.2.

$b_{n-1}$ appears inside $a_{n}$-term in $\Phi^{\prime}$

$\to$ 3.2.2.2.

In this case $\Phi^{\prime}$ ends with a proper $c$-product.

Terms appearing in h^{a}_{(k)}\,\bigl{(}\Phi\circ(1\otimes\Phi)\bigr{)}_{(n-k)}

Note that all $b$’s and $c$’s in $\Phi^{\prime\prime}$ appear inside $bc$-products with no proper $c$-products.

1. 9.

$k=0$

1. 9.1.

There is only the final $bc$-product in $\Phi^{\prime\prime}$ (preceded by the product of all $a$-variables)

$\to$ LABEL:ha:12133 2. 9.2.

There is a $bc$-product inside some $a$-term in $\Phi^{\prime\prime}$

1. 9.2.1.

The first $bc$-product is $b_{1}c_{1}$

$\to$ 1.3.1.3.2.1.1. 2. 9.2.2.

The first $bc$-product contains $b_{2}$

$\to$ 1.3.1.2.1. 2. 10.

$k>0$

$\to$ 1.1.2.2.

B.2. Checking the signs

1. 1.

Pair LABEL:ha:1111 $\leftrightarrow$ LABEL:ha:1211

1. 1.1.

$\mu=j=\nu$ 2. 1.2.

$\mu=j<\nu$ 3. 1.3.

$\mu<j\leq\nu$

1. 1.3.1.

$b_{\mu}$ appears before $a_{i-1}$-term

1. 1.3.1.1.

$c_{\mu}$ appears before $a_{i-1}$-term 2. 1.3.1.2.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i-1}$-term 3. 1.3.1.3.

$c_{\mu}$ appears inside a $b$-term that is argument to $a_{i-1}$-term 4. 1.3.1.4.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i}$-term 5. 1.3.1.5.

$c_{\mu}$ appears inside $b_{j}$-term (that is argument to $a_{i}$-term) 6. 1.3.1.6.

$c_{\mu}$ appears inside another $b$-term or $bc$-product that is argument to $a_{i}$-term 7. 1.3.1.7.

$c_{\mu}$ appears after $a_{i}$-term 2. 1.3.2.

$b_{\mu}$ appears inside $a_{i-1}$-term

1. 1.3.2.1.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i-1}$-term 2. 1.3.2.2.

$c_{\mu}$ appears inside a $b$-term that is argument to $a_{i-1}$-term 3. 1.3.2.3.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i}$-term 4. 1.3.2.4.

$c_{\mu}$ appears inside $b_{j}$-term (that is argument to $a_{i}$-term) 5. 1.3.2.5.

$c_{\mu}$ appears inside another $b$-term or $bc$-product that is argument to $a_{i}$-term 6. 1.3.2.6.

$c_{\mu}$ appears after $a_{i}$-term 2. 2.

Pair LABEL:ha:111211 $\leftrightarrow$ 1.4.1.3. and the following pairs

In LABEL:ha:111211, $b_{j}$-term is the first argument to $a_{i}$-term.

1. 2.1.

$\mu=j<\nu$

This case is built into the recursive sign formula. 2. 2.2.

$\mu<j<\nu$

1. 2.2.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 2.2.2.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i}$-term 3. 2.2.3.

$c_{\mu}$ appears inside $b_{j}$-term (that is argument to $a_{i}$-term) 4. 2.2.4.

$c_{\mu}$ appears inside another $b$-term or $bc$-product that is argument to $a_{i}$-term 5. 2.2.5.

$c_{\mu}$ appears after $a_{i}$-term 3. 3.

Pair LABEL:ha:111215a $\leftrightarrow$ 1.4.2.3.2.

Subsumed under case 2. 4. 4.

Pair LABEL:ha:111213 $\leftrightarrow$ 1.3.3.3.

Subsumed under case 2. 5. 5.

Pair LABEL:ha:111215 $\leftrightarrow$ 2.3.

Subsumed under case 2. 6. 6.

Pair B.1 $\leftrightarrow$ 3.3.2.

Subsumed under case 2. 7. 7.

Pair 1.1.1.2.2. $\leftrightarrow$ 1.3.1.3.2.1.2. and the following pair

1. 7.1.

$\mu=j=\nu$

1. 7.1.1.

$b_{\nu+1}$-term appears in $a_{i}$-term 2. 7.1.2.

$b_{\nu+1}$-term appears in later $a$-term 2. 7.2.

$\mu<j=\nu$

1. 7.2.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 7.2.2.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i}$-term 3. 7.2.3.

$c_{\mu}$ appears inside $b_{\nu}$-term (that is argument to $a_{i}$-term) 4. 7.2.4.

$c_{\mu}$ appears inside $bc$-product starting with $b_{\nu+1}$ (if it is argument to $a_{i}$-term) 5. 7.2.5.

$c_{\mu}$ appears after $a_{i}$-term 8. 8.

Pair 1.1.1.2.2.1.2. $\leftrightarrow$ 1.3.1.2.2.1.

Subsumed under case 7. 9. 9.

Pair 1.1.1.2.2.2. $\leftrightarrow$ LABEL:ha:12131

1. 9.1.

$\mu=j=\nu$ 2. 9.2.

$\mu<j=\nu$

1. 9.2.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 9.2.2.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i}$-term 3. 9.2.3.

$c_{\mu}$ appears inside $b_{\nu}$-term (that is argument to $a_{i}$-term) 4. 9.2.4.

$c_{\mu}$ appears after $a_{i}$-term 10. 10.

Pair 1.1.1.2.2.2.2. $\leftrightarrow$ 8.1.

1. 10.1.

$\mu=\nu$ 2. 10.2.

$\mu<\nu$

This cases uses Lemma 5.5.

1. 10.2.1.

$c_{\mu}$ appears before the $a_{n}$-term 2. 10.2.2.

$c_{\mu}$ appears in $b_{n-1}$-term 3. 10.2.3.

$c_{\mu}$ appears in $c$-product that is argument to $a_{n}$-term 4. 10.2.4.

$c_{\mu}$ appears in $b_{n}$-term 11. 11.

Pair 1.1.2.1. $\leftrightarrow$ 1.2.2.1.

1. 11.1.

$\mu=\nu$ 2. 11.2.

$\mu<\nu$

This case is analogous to 1.3. (with some subcases omitted). 12. 12.

Pair 1.1.2.2. $\leftrightarrow$ 10.

1. 12.1.

$\mu=\nu$ 2. 12.2.

$\mu<\nu$

1. 12.2.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 12.2.2.

$c_{\mu}$ appears in $bc$-product that is first argument to $a_{i}$-term 13. 13.

Pair 1.1.3.1. $\leftrightarrow$ 1.2.3.1.

This case is analogous to case 11. (by considering a $c$-product as a “$bc$-product with no $b$-terms and several trailing $c$-variables”) with the following additional case for the recursive step.

1. 13.1.

$c_{\mu}$ appears inside the $c$-product that is first argument to $a_{i}$-term 14. 14.

Pair 1.1.3.2.1. $\leftrightarrow$ 2.2.

This case is analogous to case 13. 15. 15.

Pair 1.1.3.2.2. $\leftrightarrow$ 7.

Note that $k\neq\mu$.

1. 15.1.

$k<\mu\leq\nu$

1. 15.1.1.

$\mu=\nu$ 2. 15.1.2.

$\mu<\nu$ 2. 15.2.

$\mu<k<\nu$

Using Lemma 5.5, this case is recursively reduced to 15.1. 16. 16.

Pair LABEL:ha:1212 $\leftrightarrow$ 5.

1. 16.1.

$|J_{a}|=2$, that is, $J_{a}=\{\mu,\nu\}$

Let’s say that $b_{\nu}$ appears in the $a_{k}$-term.

1. 16.1.1.

$c_{\mu}$ appears before $a_{k}$-term 2. 16.1.2.

$c_{\mu}$ appears in $c$-product that is argument to $a_{k}$-term before $b_{\nu}$-term 3. 16.1.3.

$c_{\mu}$ appears inside $b_{\nu}$-term 4. 16.1.4.

$c_{\mu}$ appears in $c$-product that is argument to $a_{k}$-term after $b_{\nu}$-term, but before any $bc$-product (if $a_{k}$-term has such arguments) 5. 16.1.5.

$c_{\mu}$ appears inside first $bc$-product that is argument to $a_{k}$-term (if $a_{k}$-term has such an argument) 2. 16.2.

$|J_{a}|>2$

1. 16.2.1.

$\mu=j<\nu-1$

Let $k=\min(J_{a}\setminus\{\mu\})$. There are only top-level $b$-terms between the $a_{k}$-term and the $a$-term containing the $b_{k}$-term. Using the cases 1. and 13., we can take the $b_{k}$-term (together with the preceding $c$-products) out of the $a$-term and move it right after the $a_{k}$-term. The sign change is analogous to the recursive definition (5.17) of the sign. We then use induction with $J_{a}\setminus\{k\}$ instead of $J_{a}$ until we reach the case 16.1. 2. 16.2.2.

$\mu<j\leq\nu-1$

1. 16.2.2.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 16.2.2.2.

$c_{\mu}$ appears inside $b_{i-1}$-term 3. 16.2.2.3.

$c_{\mu}$ appears inside other $b$-term that is argument to $a_{i}$-term 4. 16.2.2.4.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i}$-term 5. 16.2.2.5.

$c_{\mu}$ appears inside $b_{i}$-term 6. 16.2.2.6.

$c_{\mu}$ appears after $b_{i}$-term 17. 17.

Pair LABEL:ha:12133 $\leftrightarrow$ 9.1. 18. 18.

Pair 1.2. $\leftrightarrow$ 3.3.1.

1. 18.1.

$|J_{a}|=2$, that is, $J_{a}=\{\mu,\nu\}$ with $\mu=\nu-1$

1. 18.1.1.

$b_{\mu}$ appears before $a_{n}$-term 2. 18.1.2.

$b_{\mu}$ appears inside $a_{n}$-term 2. 18.2.

$|J_{a}|>2$

1. 18.2.1.

$c_{\mu}$ appears before $a_{n}$-term 2. 18.2.2.

$c_{\mu}$ appears inside $b_{\nu}$-term 3. 18.2.3.

$c_{\mu}$ appears inside other $b$-term that is argument to $a_{n}$-term 4. 18.2.4.

$c_{\mu}$ appears in $c$-product that is argument to $a_{n}$-term 5. 18.2.5.

$c_{\mu}$ appears in final $bc$-product 19. 19.

Pair 1.2.2.2. $\leftrightarrow$ 3.1.2.2.

1. 19.1.

$J_{a}=\{\nu\}$ 2. 19.2.

$|J_{a}|>1$

1. 19.2.1.

$b_{\mu}$ appears before $a_{n}$-term

1. 19.2.1.1.

$c_{\mu}$ appears before $a_{n}$-term 2. 19.2.1.2.

$c_{\mu}$ appears in $c$-product that is argument to $a_{n}$-term 3. 19.2.1.3.

$c_{\mu}$ appears in $b$-term that is argument to $a_{n}$-term 4. 19.2.1.4.

$c_{\mu}$ appears in $bc$-product that is argument to $a_{n}$-term, but not the last argument 5. 19.2.1.5.

$c_{\mu}$ appears in final $bc$-product inside $a_{n}$-term (but not as trailing $c$-variable) 2. 19.2.2.

$b_{\mu}$ appears inside $a_{n}$-term

1. 19.2.2.1.

$c_{\mu}$ appears in $c$-product that is argument to $a_{n}$-term 2. 19.2.2.2.

$c_{\mu}$ appears in $b$-term that is argument to $a_{n}$-term 3. 19.2.2.3.

$c_{\mu}$ appears in $bc$-product that is argument to $a_{n}$-term, but not the last argument 4. 19.2.2.4.

$c_{\mu}$ appears in final $bc$-product inside $a_{n}$-term (but not as trailing $c$-variable) 20. 20.

Pair 1.2.3.2. $\leftrightarrow$ 2.1.

This case is analogous to 19. (again by considering a $c$-product as a “$bc$-product with no $b$-terms and several trailing $c$-variables”) with the following additional subcases for the case 19.2. and with some subcases omitted. Note that $\mu\neq i$.

1. 20.1.

$b_{\mu}$ appears before $a_{i}$-term

1. 20.1.1.

$c_{\mu}$ appears in final $c$-product inside $a_{i}$-term 2. 20.1.2.

$c_{\mu}$ appears in or after $b_{i}$-term 2. 20.2.

$b_{\mu}$ appears inside $a_{i}$-term

1. 20.2.1.

$c_{\mu}$ appears in final $c$-product inside $a_{i}$-term 2. 20.2.2.

$c_{\mu}$ appears in or after $b_{i}$-term 3. 20.3.

$b_{\mu}$ appears after $b_{i}$-term 21. 21.

Pair 1.2.3.3. $\leftrightarrow$ 3.1.1.

This case is analogous to 19. and 20. with some subcases omitted. 22. 22.

Pair 1.3.1.1. $\leftrightarrow$ 4.

We have $\mu\leq j\leq\nu-1$.

1. 22.1.

$\mu=j=\nu-1$, that is, $J_{a}=\{\nu-1,\nu\}$

1. 22.1.1.

$c_{\mu}c_{\mu+1}$ is argument to $a_{i}$-term 2. 22.1.2.

$c_{\mu}c_{\mu+1}$ appears after $a_{i}$-term and before any $bc$-products 3. 22.1.3.

$c_{\mu}c_{\mu+1}$ appears in (first) $bc$-product inside $a_{i}$-term 4. 22.1.4.

$c_{\mu}c_{\mu+1}$ appears in (first) $bc$-product inside later $a$-term 5. 22.1.5.

$c_{\mu}c_{\mu+1}$ appears in final $bc$-product

This case is analogous to 22.1.2. 2. 22.2.

$\mu=j<\nu-1$

Let $k=\min(J_{a}\setminus\{\mu,\mu+1\})$.

1. 22.2.1.

$i\leq k$

This case is analogous to 16.2.1. We can take the $b_{k}$-term out of the $a$-term where it appears. 2. 22.2.2.

$i>k$

Using the cases 1. and 13., we can move the $b_{\mu}$-term and the $b_{\mu+1}$-term (together with the preceding $c$-products) to the $a_{i-1}$-term. This inductively reduces this case to 22.2.1. 3. 22.3.

$\mu<j\leq\nu-1$

1. 22.3.1.

$b_{\mu}$ appears before $a_{i}$-term

1. 22.3.1.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 22.3.1.2.

$c_{\mu}$ appears inside $a_{i}$-term before $b_{j}$ 3. 22.3.1.3.

$c_{\mu}$ appears inside $b_{j}$-term 4. 22.3.1.4.

$c_{\mu}$ appears inside $b_{j+1}$-term 5. 22.3.1.5.

$c_{\mu}$ appears after $b_{j+1}$-term 2. 22.3.2.

$b_{\mu}$ appears inside $a_{i}$-term

1. 22.3.2.1.

$c_{\mu}$ appears inside $a_{i}$-term before $b_{j}$ 2. 22.3.2.2.

$c_{\mu}$ appears inside $b_{j}$-term 3. 22.3.2.3.

$c_{\mu}$ appears inside $b_{j+1}$-term 4. 22.3.2.4.

$c_{\mu}$ appears after $b_{j+1}$-term 23. 23.

Pair 1.3.1.2.1. $\leftrightarrow$ 9.2.2.

This case uses [4, eq. \tagform@LABEL:h@eq:twc-composition-sign] for the sign of the composition of two shm maps and the convention (2.4) for our “$\stackrel{{\scriptstyle\varkappa}}{{=}}$” notation. Note that the sign exponent $n-1$ in (4.2) leads to the sign exponent $n-1$ in $(\Phi\circ(1\otimes\Phi))_{(n)}$. 24. 24.

Pair 1.3.1.2.2.2. $\leftrightarrow$ 1.4.2.3.1.

1. 24.1.

$\mu<\nu-1$

1. 24.1.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 24.1.2.

$c_{\mu}$ appears in $c$-product that is argument to $a_{i}$-term before $b_{\nu}$ 3. 24.1.3.

$c_{\mu}$ appears in $c$-product inside $b_{\nu}$-term 4. 24.1.4.

$c_{\mu}$ appears between $b_{\nu+1}$ and $c_{\nu}$ 2. 24.2.

$\mu=\nu-1$

1. 24.2.1.

$b_{\mu}$ appears before $a_{i}$-term 2. 24.2.2.

$b_{\mu}$ appears inside $a_{i}$-term 25. 25.

Pair 1.3.1.3.1. $\leftrightarrow$ 1.4.1.2.

1. 25.1.

$\mu=j=\nu$ 2. 25.2.

$\mu=j<\nu$

1. 25.2.1.

$c_{\mu}$ appears inside $a_{i}$-term 2. 25.2.2.

$c_{\mu}$ appears after $a_{i}$-term 3. 25.3.

$\mu<j\leq\nu$

1. 25.3.1.

$b_{\mu}$ appears before $a_{i}$-term

1. 25.3.1.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 25.3.1.2.

$c_{\mu}$ appears inside $a_{i}$-term before $b_{\nu}$-term 3. 25.3.1.3.

$c_{\mu}$ appears inside $b_{\nu}$-term 4. 25.3.1.4.

$c_{\mu}$ appears in $c$-product following $b_{\nu}$-term (together with $c_{k}$) 5. 25.3.1.5.

$c_{\mu}$ appears inside $a_{i}$-term after $c_{k}$ 6. 25.3.1.6.

$c_{\mu}$ appears after $a_{i}$-term 2. 25.3.2.

$b_{\mu}$ appears inside $a_{i}$-term

1. 25.3.2.1.

$c_{\mu}$ appears inside $a_{i}$-term before $b_{\nu}$-term 2. 25.3.2.2.

$c_{\mu}$ appears inside $b_{\nu}$-term 3. 25.3.2.3.

$c_{\mu}$ appears in $c$-product following $b_{\nu}$-term (together with $c_{k}$) 4. 25.3.2.4.

$c_{\mu}$ appears inside $a_{i}$-term after $c_{k}$ 5. 25.3.2.5.

$c_{\mu}$ appears after $a_{i}$-term 26. 26.

Pair 1.3.1.3.2.1.1. $\leftrightarrow$ 9.2.1.

This case is analogous to 23. 27. 27.

Pair 1.3.1.3.2.2. $\leftrightarrow$ 1.4.2.2.2.2.

1. 27.1.

$J_{a}=\{\mu=\nu-1,\nu\}$

1. 27.1.1.

$b_{\mu}$ appears before $a_{i}$-term 2. 27.1.2.

$b_{\mu}$ appears inside $a_{i}$-term 2. 27.2.

$|J_{a}|>2$

1. 27.2.1.

$b_{\mu}$ appears before $a_{i}$-term

1. 27.2.1.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 27.2.1.2.

$c_{\mu}$ appears inside $a_{i}$-term before $b_{\nu}$-term 3. 27.2.1.3.

$c_{\mu}$ appears inside $b_{\nu}$-term 4. 27.2.1.4.

$c_{\mu}$ appears inside $a_{i}$-term in $c$-product following $b_{\nu}$-term

This case uses 25. 2. 27.2.2.

$b_{\mu}$ appears inside $a_{i}$-term

1. 27.2.2.1.

$c_{\mu}$ appears inside $a_{i}$-term before $b_{\nu}$-term 2. 27.2.2.2.

$c_{\mu}$ appears inside $b_{\nu}$-term 3. 27.2.2.3.

$c_{\mu}$ appears inside $a_{i}$-term in $c$-product following $b_{\nu}$-term

This case uses 25. 28. 28.

Pair 1.3.2. $\leftrightarrow$ 1.4.2.1.2.2.

1. 28.1.

$J_{a}=\{\nu\}$ 2. 28.2.

$|J_{a}|>1$

1. 28.2.1.

$b_{\mu}$ appears before $a_{i}$-term

1. 28.2.1.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 28.2.1.2.

$c_{\mu}$ appears inside $a_{i}$-term before first $bc$-product 3. 28.2.1.3.

$c_{\mu}$ appears inside first $bc$-product 2. 28.2.2.

$b_{\mu}$ appears inside $a_{i}$-term

1. 28.2.2.1.

$c_{\mu}$ appears inside $a_{i}$-term before first $bc$-product 2. 28.2.2.2.

$c_{\mu}$ appears inside first $bc$-product 29. 29.

Pair 1.3.3.1. $\leftrightarrow$ 1.4.1.1.

1. 29.1.

$J_{a}=\{\nu\}$ 2. 29.2.

$|J_{a}|>1$

Let’s write $b_{j}$ for the $b$-term following $c_{k}$.

1. 29.2.1.

$b_{\mu}$ appears before $a_{i}$-term

1. 29.2.1.1.

$c_{\mu}$ appears before $a_{i}$-term 2. 29.2.1.2.

$c_{\mu}$ appears inside $a_{i}$-term before $c$-product containing $c_{k}$ 3. 29.2.1.3.

$c_{\mu}$ appears in $c$-product containing $c_{k}$ 4. 29.2.1.4.

$c_{\mu}$ appears in $b_{j}$-term 5. 29.2.1.5.

$c_{\mu}$ appears inside $a_{i}$-term after $b_{j}$-term 6. 29.2.1.6.

$c_{\mu}$ appears after $a_{i}$-term 2. 29.2.2.

$b_{\mu}$ appears inside $a_{i}$-term before $c$-product containing $c_{k}$

1. 29.2.2.1.

$c_{\mu}$ appears inside $a_{i}$-term before $c$-product containing $c_{k}$ 2. 29.2.2.2.

$c_{\mu}$ appears in $c$-product containing $c_{k}$ 3. 29.2.2.3.

$c_{\mu}$ appears in $b_{j}$-term 4. 29.2.2.4.

$c_{\mu}$ appears inside $a_{i}$-term after $b_{j}$-term 5. 29.2.2.5.

$c_{\mu}$ appears after $a_{i}$-term 3. 29.2.3.

$\mu=j$

This case uses 20. 30. 30.

Pair 1.3.3.2. $\leftrightarrow$ 1.4.2.1.1.

This case is analogous to 28. with the following additional cases.

1. 30.1.

$|J_{a}|>1$, $b_{\mu}$ appears before $a_{i}$-term, $c_{\mu}$ appears inside (formerly second) $bc$-product 2. 30.2.

$|J_{a}|>1$, $b_{\mu}$ appears inside $a_{i}$-term, $c_{\mu}$ appears inside (formerly second) $bc$-product 31. 31.

Pair 1.4.2.1.2.1. $\leftrightarrow$ 1.4.2.2.1.

Let’s write the two $b$-variables in question as $b_{j}$ and $b_{j+1}$.

1. 31.1.

$J_{a}=\{\nu\}$ 2. 31.2.

$|J_{a}|>1$

1. 31.2.1.

$c_{\mu}$ appears before $b_{j}$-term 2. 31.2.2.

$c_{\mu}$ appears inside $b_{j}$-term 3. 31.2.3.

$c_{\mu}$ appears inside or after $b_{j+1}$-term 32. 32.

Pair 1.4.2.2.2.1. $\leftrightarrow$ 6.1.2.

1. 32.1.

$J_{a}=\{\nu\}$ 2. 32.2.

$|J_{a}|>1$ 33. 33.

Pair 1.4.2.3.3. $\leftrightarrow$ 6.1.1.

1. 33.1.

$J_{a}=\{\nu\}$ 2. 33.2.

$|J_{a}|>1$ 34. 34.

Pair 3.1.2.1. $\leftrightarrow$ 3.2.1.

This case is analogous to 31. 35. 35.

Pair 3.2.2.1. $\leftrightarrow$ 6.2.2.

1. 35.1.

$J_{a}=\{\nu\}$ 2. 35.2.

$|J_{a}|>1$

This case is analogous to 32.2. 36. 36.

Pair 3.2.2.2. $\leftrightarrow$ 8.2.

1. 36.1.

$\mu=\nu$ 2. 36.2.

$\mu<\nu$

This case uses Lemma 5.5.

1. 36.2.1.

$c_{\mu}$ appears before last argument of $b_{n}$-term 2. 36.2.2.

$c_{\mu}$ appears in $c$-product that is last argument of $b_{n}$-term 37. 37.

Pair 3.3.3. $\leftrightarrow$ 6.2.1.

1. 37.1.

$J_{a}=\{\nu\}$ 2. 37.2.

$|J_{a}|>1$

This case is analogous to 33.2.

Appendix C Proof of Proposition 6.1

Terms produced by $d(h^{c}_{(n)})$

Recall that there are leading $E$-terms if and only if there is an $F$-term. If there is an $F$-term, the index of each $b$-variable appearing in it is larger than the index of any $a$-variables appearing in it.

1. 1.

Terms produced by group of trailing $E$-terms

The trailing $E$-terms may or may not be preceded by a leading $E$-group and an $F$-term.

1. 1.1.

$b$-variable moved out of a trailing $E_{m}(a_{i};\dots)$-term to the left

1. 1.1.1.

This $E$-term is the first $E$-term of the trailing group

1. 1.1.1.1.

There is an $F$-term

$\to$ 3.2. 2. 1.1.1.2.

There is no $F$-term

1. 1.1.1.2.1.

$m=1$

$\to$ 6.1. 2. 1.1.1.2.2.

$m>1$

$\to$ 3.6.1. 2. 1.1.2.

This $E$-term is a later $E$-term of the trailing group

$\to$ 1.2.1. 2. 1.2.

$b$-variable moved out of a trailing $E$-term to the right

1. 1.2.1.

$E$-term is not final $E$-term

$\to$ 1.1.2. 2. 1.2.2.

$E$-term is final $E$-term

$\to$ 8.

In this case we can split up the trailing $E$-terms in a unique way such that the second part is a valid term in $\Phi$ 3. 1.3.

Two $b$-variables multiplied together in a trailing $E$-term

$\to$ 4.1. 2. 2.

Terms produced by group of leading $E$-terms

1. 2.1.

$a_{i}$-variable moved out of a leading $E(b_{j};\dots)$-term to the left

In this case we have $j>1$.

1. 2.1.1.

$i<j-1$

$\to$ 2.2.2. 2. 2.1.2.

$i=j-1$

$\to$ 7. 2. 2.2.

$a$-variable moved out of a leading $E$-term to the right

1. 2.2.1.

This $E$-term is the last $E$-term of the leading group

$\to$ 3.3. 2. 2.2.2.

This $E$-term is an earlier $E$-term of the leading group

$\to$ 2.1.1. 3. 2.3.

Two $a$-variables multiplied together in a leading $E$-term

$\to$ 4.1.

In this case the corresponding $b$-variables appear further to the left. 3. 3.

Terms produced by $F$-term

1. 3.1.

$E(b_{j};\dots)$-term split off $F$-term to the left

$\to$ 3.4.

Note the first $a_{i}$variable of the trailing $E$-terms has index $i\geq j$. 2. 3.2.

$b$-variable moved out of $F$-term to the right

$\to$ 1.1.1.1. 3. 3.3.

$a$-variable moved out of $F_{kl}(b_{j},\dots;b_{i},\dots)$-term to the left

$\to$ 2.2.1.

In this case we have $l>1$, so that $i<j-1$. 4. 3.4.

$E(a_{i};\dots)$-term split off $F$-term to the right

$\to$ 3.1.

Note the last $b_{j}$variable of the leading $E$-terms has index $j\geq i$. 5. 3.5.

$F_{1l}$-term converted into $E_{l}(b;\dots)$-term with $l\geq 1$

1. 3.5.1.

The next term is a $a$-variable

$\to$ 6.2. 2. 3.5.2.

The next term is an $E_{m}(a;\dots)$-term with $m\geq 1$

$\to$ 3.6.2. 6. 3.6.

$F_{k1}$-term converted into $E_{k}(a_{i};\dots)$-term with $k\geq 1$

1. 3.6.1.

The previous $E$-term is an $b$-variable

$\to$ 1.1.1.2.2.

In this case the $b$-variable is the only leading $E$-term because otherwise $a_{i-1}$ would appear in the $F$-term. 2. 3.6.2.

The previous $E$-term is an $E_{m}(b;\dots)$-term with $m\geq 1$

$\to$ 3.5.2. 7. 3.7.

Two $b$-variables multiplied together

$\to$ 5.2.

In this case the corresponding $a$-variables occur in trailing $E$-terms 8. 3.8.

Two $a$-variables multiplied together

$\to$ 4.2.

In this case the corresponding $b$-variables occur in leading $E$-terms

Terms appearing in $h^{c}_{(n-1)}(\dots,a_{i}a_{i+1}\otimes b_{i}b_{i+1},\dots)$

Either the repeated $b$-terms appear in a leading $E$-term or the repeated $a$-terms appear in a trailing $E$-term.

1. 4.

The repeated $b$-terms appear in a leading $E$-term

1. 4.1.

The repeated $a$-terms appear in a leading $E$-term

$\to$ 2.3. 2. 4.2.

The repeated $a$-terms appear in the $F$-term

$\to$ 3.8. 2. 5.

The repeated $a$-terms appear in a trailing $E$-term

1. 5.1.

The repeated $b$-terms appear in the trailing $E$-term

$\to$ 1.3. 2. 5.2.

The repeated $b$-terms appear in the $F$-term

$\to$ 3.7.

Terms appearing in $\Phi^{\prime}_{(m)}\,h^{c}_{(n-m)}$

Here $\Phi^{\prime}=\Phi\circ T$.

1. 6.

$h^{c}_{(n-m)}$ does not contain an $F$-term

1. 6.1.

$m=1$

$\to$ 1.1.1.2.1. 2. 6.2.

$m>1$

$\to$ 3.5.1. 2. 7.

$h^{c}_{(n-m)}$ contains an $F$-term

$\to$ 2.1.2.

Terms appearing in $h^{c}_{(m)}\,\Phi_{(n-m)}$

1. 8.

all such terms

$\to$ 1.2.2.

Appendix D Proof of Proposition 7.1

We assume $n\geq 1$.

Terms produced by $d(h_{(n)})$

1. 1.

Two arguments of $f_{(n+1)}$ multiplied together

1. 1.1.

At position $m\leq n-2$ (if $n\geq 3$)

$\to$ 3. 2. 1.2.

At position $m=n-1$ (if $n\geq 2$)

$\to$ 4.1. 3. 1.3.

At position $m=n$

1. 1.3.1.

$k^{\prime\prime}=0$

$\to$ 6. 2. 1.3.2.

$k^{\prime\prime}>0$

$\to$ 2.2.2. 2. 2.

$f_{(n+1)}$ split into two terms

1. 2.1.

At position $m\leq n-1$ (if $n\geq 2$)

$\to$ 5. 2. 2.2.

At position $m=n$

1. 2.2.1.

$k^{\prime}=0$

$\to$ 7.

By the normalization condition, this term vanishes unless $n=1$. 2. 2.2.2.

$k^{\prime}>0$

$\to$ 1.3.2.

Terms appearing in $h_{(n-1)}(\dots,x^{k_{m}+k_{m+1}},\dots)$

1. 3.

$m\leq n-2$ (if $n\geq 3$)

$\to$ 1.1. 2. 4.

$m=n-1$ (if $n\geq 2$)

1. 4.1.

$k^{\prime\prime}<k_{n}$

$\to$ 1.2. 2. 4.2.

$k^{\prime\prime}\geq k_{n}$

$\to$ 8.

Terms appearing in $f_{(m)}\,h_{(n-m)}$

1. 5.

$m<n$ (if $n\geq 2$)

$\to$ 2.1. 2. 6.

$m=n$

$\to$ 1.3.1.

Terms appearing in $h_{(m)}\,g_{(n-m)}$

Since $g$ is strict, the only non-zero contribution is for $m=n-1$.

1. 7.

$n=1$

$\to$ 2.2.1. 2. 8.

$n\geq 2$

$\to$ 4.2.

Appendix E Proof of Proposition 7.2

We write $F=\mu_{A}\,(f\otimes f)$ and $g=f\,\mu_{\Bbbk[x]}$. There is nothing to show for $n=1$ since $F_{(1)}=g$. Below we assume $n\geq 2$. Terms appearing only for $n\geq 3$ are marked “∗” and those appearing only for $n\geq 4$ are marked “${}^{\boldsymbol{*}}{}^{\boldsymbol{*}}$”.

Terms produced by $d(h_{(n)})$

1. 1.

Terms produced by the first group of sums

1. 1.1.

Argument moved out of some $E(a^{k_{i}};\dots)$ to the left

In this case with have $i>1$.

1. 1.1.1.

$\mathllap{{}^{\boldsymbol{*}}}$ $i\leq n-1$

In this case the argument is some $a^{l_{j}}$.

1. 1.1.1.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $j<i-1$

$\to$ 1.2.1. 2. 1.1.1.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $j=i-1$

$\to$ 7.1. 2. 1.1.2.

$i=n$

1. 1.1.2.1.

$i_{n}=1$

$\to$ 2.4. 2. 1.1.2.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i_{n}>1$

$\to$ 1.2.2.

In this case the argument is some $a^{l_{j}}$. 2. 1.2.

Argument moved out of some $E(a^{k_{i}};\dots)$ to the right

1. 1.2.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i\leq n-2$

$\to$ 1.1.1.1. 2. 1.2.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-1$

$\to$ 1.1.2.2. 3. 1.2.3.

$i=n$

$\to$ 1.3.3.2.

We may assume $l^{\prime}\geq 1$ in this case. 3. 1.3.

Two arguments of some $E(a^{k_{i}};\dots)$ multiplied together

1. 1.3.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ Arguments are $a^{l_{j}}$ and $a^{l_{j+1}}$ with $j\leq n-3$

$\to$ 4.1. 2. 1.3.2.

$\mathllap{{}^{\boldsymbol{*}}}$ Arguments are $a^{l_{n-2}}$ and $a^{l^{\prime}}$

$\to$ 4.2.1.

In this case we have $i_{n}>1$. 3. 1.3.3.

Arguments are $a^{l^{\prime}}$ and $a$

1. 1.3.3.1.

$l^{\prime\prime}=0$

$\to$ 8. 2. 1.3.3.2.

$l^{\prime\prime}>0$

$\to$ 1.2.3. 2. 2.

Terms produced by the second group of sums

1. 2.1.

$\mathllap{{}^{\boldsymbol{*}}}$ Argument $a^{l_{j}}$ moved out of some $E(a^{k_{i}};\dots)$ to the left

In this case with have $i>1$.

1. 2.1.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $j<i-1$

$\to$ 2.2.1. 2. 2.1.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $j=i-1$

$\to$ 7.2. 2. 2.2.

Argument moved out of some $E(a^{k_{i}};\dots)$ to the right

1. 2.2.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i\leq n-2$

$\to$ 2.1.1. 2. 2.2.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-1$

1. 2.2.2.1.

$\mathllap{{}^{\boldsymbol{*}}}$ $i_{n-1}=1$

$\to$ 5.3.1. 2. 2.2.2.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i_{n-1}>1$

$\to$ 5.2.1. 3. 2.3.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ Two arguments $a^{l_{j}}$ and $a^{l_{j+1}}$ of some $E(a^{k_{i}};\dots)$ multiplied together

$\to$ 5.1.

In this case we have $j\leq n-3$. 4. 2.4.

Term produced by $b$

$\to$ 1.1.2.1.

We have $\sum_{k^{\prime}+k^{\prime\prime}=k_{n}-1}a^{k^{\prime}}\,E_{1}(a;a)\,a^{k^{\prime\prime}}=E_{1}(a^{k_{n}};a)$. 3. 3.

$\mathllap{{}^{\boldsymbol{*}}}$ Terms produced by the third group of sums

1. 3.1.

$\mathllap{{}^{\boldsymbol{*}}}$ Argument moved out of some $E(a^{k_{i}};\dots)$ to the left

In this case with have $i>1$.

1. 3.1.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i\leq n-2$

In this case the argument is some $a^{l_{j}}$.

1. 3.1.1.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $j<i-1$

$\to$ 3.2.1. 2. 3.1.1.2.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $j=i-1$

$\to$ 7.3. 2. 3.1.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-1$

1. 3.1.2.1.

$\mathllap{{}^{\boldsymbol{*}}}$ $i_{n-1}=1$

$\to$ 3.2.3.1. 2. 3.1.2.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i_{n-1}>1$

$\to$ 3.2.2.

In this case the argument is some $a^{l_{j}}$. 2. 3.2.

$\mathllap{{}^{\boldsymbol{*}}}$ Argument moved out of some $E(a^{k_{i}};\dots)$ to the right

1. 3.2.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i\leq n-3$

$\to$ 3.1.1.1. 2. 3.2.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-2$

$\to$ 3.1.2.2. 3. 3.2.3.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-1$

1. 3.2.3.1.

$\mathllap{{}^{\boldsymbol{*}}}$ $i_{n-1}=1$

$\to$ 3.1.2.1. 2. 3.2.3.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i_{n-1}>1$

$\to$ 5.2.2. 3. 3.3.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ Two arguments of some $E(a^{k_{i}};\dots)$ multiplied together

1. 3.3.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ Arguments are $a^{l_{j}}$ and $a^{l_{j+1}}$ with $j\leq n-4$

$\to$ 6.1. 2. 3.3.2.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ Arguments are $a^{l_{n-3}}$ and $a^{l^{\prime}}$

$\to$ 6.2.1.

In this case we have $i_{n-1}>1$. 4. 3.4.

$\mathllap{{}^{\boldsymbol{*}}}$ Term produced by $b$

$\to$ 4.3.2.

We have $\sum_{k^{\prime}+k^{\prime\prime}=k_{n}-1}a^{k^{\prime}}\,E_{1}(a;a)\,a^{k^{\prime\prime}}=E_{1}(a^{k_{n}};a)$.

Terms appearing in $h_{(n-1)}(\dots,a^{k_{i}+k_{i+1}}\otimes a^{l_{i}+l_{i+1}},\dots)$

1. 4.

$\mathllap{{}^{\boldsymbol{*}}}$ Terms produced by the first group of sums

1. 4.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i\leq n-3$

$\to$ 1.3.1. 2. 4.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-2$

We have either $l^{\prime}\geq l_{n-2}$ or $l^{\prime\prime}\geq l_{n-1}$.

1. 4.2.1.

$\mathllap{{}^{\boldsymbol{*}}}$ $l^{\prime}\geq l_{n-2}$

$\to$ 1.3.2. 2. 4.2.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $l^{\prime\prime}\geq l_{n-1}$

$\to$ 4.3.3. 3. 4.3.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-1$

We decompose the term $E_{i_{n-1}+1}(a^{k_{n-1}+k_{n}};\dots,a^{l_{n-3}},a^{l^{\prime}},a)$ into the following three kinds of terms.

1. 4.3.1.

$\mathllap{{}^{\boldsymbol{*}}}$ $E_{i_{n-1}+1}(a^{k_{n-1}};\dots,a^{l_{n-3}},a^{l^{\prime}},a)\,a^{k_{n}}$

$\to$ 9. 2. 4.3.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $E_{i_{n-1}}(a^{k_{n-1}};\dots,a^{l_{n-3}},a^{l^{\prime}})\,E_{1}(a^{k_{n}};a)$

$\to$ 3.4. 3. 4.3.3.

$\mathllap{{}^{\boldsymbol{*}}}$ $E_{i_{n-1}}(a^{k_{n-1}};a^{l_{\bullet}})\,E_{i_{n}+1}(a^{k_{n}};\dots,a^{l_{n-3}},a^{l^{\prime}},a)$ with $i_{n}\geq 1$

$\to$ 4.2.2. 2. 5.

$\mathllap{{}^{\boldsymbol{*}}}$ Terms produced by the second group of sums

1. 5.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i\leq n-3$

$\to$ 2.3. 2. 5.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-2$

We have either $l^{\prime}\geq l_{n-2}$ or $l^{\prime\prime}\geq l_{n-1}$.

1. 5.2.1.

$\mathllap{{}^{\boldsymbol{*}}}$ $l^{\prime}\geq l_{n-2}$

$\to$ 2.2.2.2. 2. 5.2.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $l^{\prime\prime}\geq l_{n-1}$

$\to$ 3.2.3.2. 3. 5.3.

$\mathllap{{}^{\boldsymbol{*}}}$ $i=n-1$

We have either $k^{\prime}\geq k_{n-1}$ or $k^{\prime\prime}\geq k_{n}$.

1. 5.3.1.

$\mathllap{{}^{\boldsymbol{*}}}$ $k^{\prime}\geq k_{n-1}$

$\to$ 2.2.2.1. 2. 5.3.2.

$\mathllap{{}^{\boldsymbol{*}}}$ $k^{\prime\prime}\geq k_{n}$

$\to$ 10. 3. 6.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ Terms produced by the third group of sums

1. 6.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i\leq n-4$

$\to$ 3.3.1. 2. 6.2.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i=n-3$

We have either $l^{\prime}\geq l_{n-3}$ or $l^{\prime\prime}\geq l_{n-2}$.

1. 6.2.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $l^{\prime}\geq l_{n-3}$

$\to$ 3.3.2. 2. 6.2.2.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $l^{\prime\prime}\geq l_{n-2}$

$\to$ 6.3.2. 3. 6.3.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i=n-2$

We decompose the term $E_{i_{n-2}}(a^{k_{n-2}+k_{n-1}};\dots,a^{l_{n-4}},a^{l^{\prime}})$ into the following two kinds of terms.

1. 6.3.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $E_{i_{n-2}}(a^{k_{n-2}};\dots,a^{l_{n-4}},a^{l^{\prime}})\,a^{k_{n-1}}$

$\to$ 6.4.1. 2. 6.3.2.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $E_{i_{n-2}}(a^{k_{n-2}};a^{l_{\bullet}})\,E_{i_{n-1}}(a^{k_{n-1}};\dots,a^{l_{n-4}},a^{l^{\prime}})$ with $i_{n-1}\geq 1$

$\to$ 6.2.2. 4. 6.4.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $i=n-1$

We have either $k^{\prime}\geq k_{n-1}$ or $k^{\prime\prime}\geq k_{n}$.

1. 6.4.1.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $k^{\prime}\geq k_{n-1}$

$\to$ 6.3.1. 2. 6.4.2.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ $k^{\prime\prime}\geq k_{n}$

$\to$ 11.

Terms appearing in $F_{(m)}\,h_{(n-m)}$

Recall that $h_{(1)}=0$.

1. 7.

$\mathllap{{}^{\boldsymbol{*}}}$ $1\leq m\leq n-2$

1. 7.1.

$\mathllap{{}^{\boldsymbol{*}}}$ Terms produced by the first group of sums in $h$

$\to$ 1.1.1.2. 2. 7.2.

$\mathllap{{}^{\boldsymbol{*}}}$ Terms produced by the second group of sums in $h$

$\to$ 2.1.2. 3. 7.3.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ Terms produced by the third group of sums in $h$

$\to$ 3.1.1.2. 2. 8.

$m=n$

$\to$ 1.3.3.1.

Terms appearing in $h_{(n-1)}\,g$

1. 9.

$\mathllap{{}^{\boldsymbol{*}}}$ Terms produced by the first group of sums in $h$

$\to$ 4.3.1. 2. 10.

$\mathllap{{}^{\boldsymbol{*}}}$ Terms produced by the second group of sums in $h$

$\to$ 5.3.2. 3. 11.

$\mathllap{{}^{\boldsymbol{*}}}{}^{\boldsymbol{*}}$ Terms produced by the third group of sums in $h$

$\to$ 6.4.2.