format: text

text:
# Non-amenable finitely presented torsion-by-cyclic groups

## 1 Introduction

### 1.1 Short history of the problem

Hausdorff  proved in 1914 that one can subdivide the 2-sphere minus a countable set of points into 3 parts $`A`$, $`B`$, $`C`$, such that each of these three parts can be obtained from each of the other two parts by a rotation, and the union of two of these parts can be obtained by rotating the third part. This implied that one cannot define a finitely additive measure on the 2-sphere which is invariant under the group $`SO(3)`$. In 1924 Banach and Tarski  generalized Hausdorff’s result by proving, in particular, that in $`^3`$, every two bounded sets $`A,B`$ with non-empty interiors can be decomposed $`A=_{i=1}^nA_i`$, $`B=_{i=1}^nB_i`$ such that $`A_i`$ can be rotated to $`B_i`$, $`i=1,\mathrm{},n`$ (the so called Banach-Tarski paradox). Von Neumann  was first who noticed that the cause of the Banach-Tarski paradox is not the geometry of $`^3`$ but an algebraic property of the group $`SO(3)`$. He introduced the concept of an amenable group (he called such groups “measurable”) as a group $`G`$ which has a left invariant finitely additive measure111Later amenable groups were characterized in many different ways. There exist a geometric characterization by Følner , a characterization by Kesten  in terms of random walks, and a combinatorial characterization by Grigorchuk  among others. $`\mu `$, $`\mu (G)=1`$, noticed that if a group is amenable then any set it acts upon freely also has an invariant measure and proved that a group is not amenable provided it contains a free non-abelian subgroup. He also showed that groups like $`PSL(2,)`$, $`SL(2,)`$ contain free non-abelian subgroups. So analogs of Banach-Tarski paradox can be found in $`^2`$ and even $``$. Von Neumann showed that the class of amenable groups contains abelian groups, finite groups and is closed under taking subgroups, extensions, and infinite unions of increasing sequences of groups. Day and Specht showed that this class is closed under homomorphic images. The class of groups without free non-abelian subgroups is also closed under these operations and contains abelian and finite groups.

The problem of existence of non-amenable groups without non-abelian free subgroups probably goes back to von Neumann and became known as the “von Neumann problem” in the fifties. As far as we know, the first paper where this problem was formulated was the paper by Day . It is also mentioned in the monograph by Greenleaf  based on his lectures given in Berkeley in 1967. Tits  proved that every non-amenable matrix group over a field of characteristic $`0`$ contains a non-abelian free subgroup. In particular every semisimple Lie group over a field of characteristic $`0`$ contains such a subgroup (see also Vershik ).

First counterexamples to the von Neumann problem were constructed by Ol’shanskii . He proved that the groups with all proper subgroups cyclic constructed by him, both torsion-free  and torsion  (the so called “Tarski monsters”), are not amenable. Later Adian  showed that the free Burnside group of odd exponent $`n665`$ with at least two generators (that is the group $`B(m,n)`$ given by $`m`$ generators and all relations of the form $`v^n=1`$ where $`v`$ is a word in generators) is not amenable. It is interesting that the possibility of using torsion groups and, in particular, free Burnside groups as potential counterexamples to von Neumann’s problem was mentioned by Day , conjectured by Kesten , and by B.H. Neumann’s in his review of Specht’s paper  in Zentralblatt.

Both Ol’shanskii’s and Adian’s examples are not finitely presented: in the modern terminology these groups are inductive limits of word hyperbolic groups, but they are not hyperbolic themselves. Since many mathematicians (especially topologists) are mostly interested in groups acting “nicely” on manifolds, it is natural to ask if there exists a finitely presented non-amenable group without non-abelian free subgroups. This question was explicitly formulated, for example, by Grigorchuk in  and by Cohen in . This question is one of a series of similar questions about finding finitely presented “monsters”, i.e. groups with unusual properties. Probably the most famous problem in that series is the problem about finding a finitely presented infinite torsion group. Other similar problems ask for finitely presented divisible group (group where every element has roots of every degree), finitely presented Tarski monster, etc. In each case a finitely generated example can be constructed as a limit of hyperbolic groups (see ), and there is no hope to construct finitely presented examples as such limits.

One difficulty in constructing a finitely presented non-amenable group without free non-abelian subgroups is that there are “very few” known finitely presented groups without free non-abelian subgroups. Most non-trivial examples are solvable or “almost” solvable (see ), and so they are amenable. The only known examples of finitely presented groups without free non-abelian subgroups for which the problem of amenability is non-trivial, are R.Thompson’s group $`F`$ and its close “relatives”. The fact that $`F`$ does not contain free non-abelian subgroups was proved by Brin and Squier in . A conjecture that $`F`$ is not amenable was formulated first by Geoghegan . A considerable amount of work has been done to prove this conjecture (see ) but it is still open.

One approach to constructing a finitely presented counterexample to the von Neumann problem would be in using the Higman embedding theorem which states that every recursively presented group can be embedded into a finitely presented group. So one can take a known finitely generated non-amenable group without non-abelian free subgroups and embed it into a finitely presented group. Of course, the resulting group will be non-amenable since the class of amenable groups is closed under taking subgroups. Unfortunately all known constructions of Higman embeddings (see, for example, ) use amalgamated products and non-ascending HNN extensions, which immediately leads to non-abelian free subgroups. Nevertheless Higman-like embeddings play an important role in our construction.

Our main result is the following.

###### Theorem 1.1.

For every sufficiently large odd $`n`$, there exists a finitely presented group $`𝒢`$ which satisfies the following conditions.

1. $`𝒢`$ is an ascending HNN extension of a finitely generated infinite group of exponent $`n`$.
2. $`𝒢`$ is an extension of a non-locally finite group of exponent $`n`$ by an infinite cyclic group.
3. $`𝒢`$ contains a subgroup isomorphic to a free Burnside group of exponent $`n`$ with $`2`$ generators.
4. $`𝒢`$ is a non-amenable finitely presented group without free non-cyclic subgroups.

Notice that part 1 of Theorem 1.1 immediately implies part 2. By a theorem of Adian , part 3 implies that $`𝒢`$ is not amenable. Thus parts 2 and 3 imply part 4.

Note that the first example of a finitely presented group which is a cyclic extension of an infinite torsion group was constructed by Grigorchuk . But the torsion subgroup in Grigorchuk’s group does not have a bounded exponent and his group is amenable (it was the first example of a finitely presented amenable but not elementary amenable group).

In the two subsequent subsections, we present the main ideas of our construction (we simplify the notation for the sake of clarity).

### 1.2 Congruence extension embeddings of the free Burnside groups

We first formulate two theorems on embeddings of the free Burnside group $`B(m,n)`$ of sufficiently large222The number $`n`$ in the paper is chosen after one chooses several auxiliary parameters $`\alpha >\beta >\gamma \mathrm{}`$, related by a system of inequalities. We first choose $`\alpha `$, then $`\beta ,\gamma `$, etc. Although the values of parameters and $`n`$ can be calculated precisely (for example $`n>10^{10}`$), we are not doing it here because the consistency of the system of inequalities is obvious. Indeed, each inequality has the form $`f(x,y,\mathrm{})>0`$ where $`x<y<\mathrm{}`$, and for already chosen positive values of $`y,\mathrm{}`$, this inequality is obviously true for any sufficiently small positive value of the smallest parameter $`x`$ (this is the Lowest Parameter Principle from ). odd exponent $`n`$ with $`m>1`$ generators, and deduce Theorem 1.1 from theorems 1.2 and 1.3 which, in turn, will be proved in sections $`210.`$

We say that a subgroup $`H`$ of a group $`G`$ satisfies the Congruence Extension Property (CEP) if any homomorphism $`HH_1`$ of $`H`$ onto a group $`H_1`$ extends to a homomorphism $`GG_1`$ of $`G`$ onto some group $`G_1`$ containing $`H_1`$ as a subgroup. Equivalently, for any normal subgroup $`L`$ of $`H`$, there exists a normal subgroup $`M`$ of $`G`$ such that $`HM=L`$. There is another obvious reformulation, which is more convenient when dealing with defining relations. Namely, the subgroup $`H`$ satisfies CEP if, for any subset $`SH`$, we have $`HS^G=S^H`$ (where the normal closure of a subset $`T`$ in a group $`K`$ is denoted as $`T^K`$).

We will write $`H_{CEP}G`$ if the subgroup $`H`$ of a group $`G`$ satisfies CEP. We also say that $`H`$ is CEP-embedded in $`G`$, or $`H`$ is a CEP-subgroup of $`G`$.

Clearly every retract $`H`$ of any group $`G`$ satisfies CEP. It is also clear that if $`K`$ is a CEP-subgroup of $`H`$ and $`H`$ is a CEP-subgroup of $`G`$ then $`K`$ is a CEP-subgroup of $`G`$.

But there exist less obvious examples. For instance, the free group $`F_{\mathrm{}}`$ of infinite rank can be CEP-embedded into a 2-generated free group $`F_2`$. Moreover, $`F_{\mathrm{}}`$ can be CEP-embedded into any non-elementary hyperbolic group . This fact was used in  to prove that every non-elementary hyperbolic group is SQ-universal.

###### Theorem 1.2.

For any sufficiently large odd $`n,`$ there exists a natural number333By using our proof of theorem 1.2 and some additional arguments, D.Sonkin recently showed that one can set $`s=2`$. $`s=s(n)`$ such that the free Burnside group $`B(\mathrm{},n)`$ of infinite countable rank is CEP-embedded into the free Burnside group $`B(s,n)`$ of rank $`s`$.444 Theorem 1.2 is of independent interest because it immediately implies, in particular, that every countable group of exponent $`n`$ is embedable into a finitely generated group of exponent $`n`$. This was first proved by Obraztsov (see ).

In the next theorem, $`^n`$ denotes the subgroup of a group $``$ generated by all $`n`$-th powers $`h^n`$ of elements $`h`$.

###### Theorem 1.3.

Let $`n`$ be a sufficiently large odd number. Then for every positive integer $`s`$, there is a finitely presented group $``$ containing subgroup $`B(s,n)`$, such that

(1) $`^nB(s,n)=1,`$ so there exists a canonical embedding of $`B(s,n)`$ into $`/^n`$.

(2) the embedding of $`B(s,n)`$ into $`/^n`$ from (1) satisfies CEP.

To derive here Theorem 1.1 from Theorems 1.2 and 1.3, we assume that $`n`$ is a sufficiently large odd integer and $`s`$ is the number given by Theorem 1.2. Then let $``$ be a group provided by Theorem 1.3. It has a finite presentation $`c_1,\mathrm{},c_m|`$.

Since retracts are CEP-subgroups, we can chose a subgroup chain

$$B(m,n)_{CEP}B(m+2,n)_{CEP}B(\mathrm{},n)_{CEP}B_s(s,n)$$
(1)
where the first and the second embeddings are given by the embeddings of the generating sets, the third and the fourth ones are given by theorems 1.2 and 1.3, respectively. Since CEP is a transitive property, we obtain from (1) and Theorem 1.3 the chain

$$B(m,n)_{CEP}B(m+2,n)_{CEP}(n)$$
(2)
The factor-group $`(n)=/^n`$ admits presentation

$$(n)=c_1,\mathrm{},c_m|𝒱,$$
(3)
where $`𝒱`$ is the set of all $`n`$-th powers $`v^n`$ of group words $`v=v(c_1,\mathrm{},c_m)`$.

Let $`b_1,\mathrm{},b_m`$ and $`b_1,\mathrm{},b_m,b_{m+1},b_{m+2}`$ be free generating sets of the subgroup $`B(m,n)`$ and $`B(m+2,n)`$, respectively, in (1) and in (2). It will be convenient to denote these subgroups of $``$ (and of $`(n)`$) by $`B_b(m,n)`$ and by $`B_b(m+2,n)`$, respectively. There are words $`w_1(c_1,\mathrm{},c_m),\mathrm{},w_m(c_1,\mathrm{},c_m)`$ such that

$$b_1=w_1(c_1,\mathrm{},c_m),\mathrm{},b_m=w_m(c_1,\mathrm{},c_m)$$

in $``$. For every $`r(c_1,\mathrm{},c_m)`$, we define derived words

$`r^{}(c_1,\mathrm{},c_m)r(w_1(c_1,\mathrm{},c_m),\mathrm{},w_m(c_1,\mathrm{},c_m)),`$
$`r^{\prime \prime }(c_1,\mathrm{},c_m)r^{}(w_1(c_1,\mathrm{},c_m),\mathrm{},w_m(c_1,\mathrm{},c_m)),\mathrm{}`$ (4)
(the sign ”$``$” means the letter-for-letter equality) and define $`^{}`$ as the set of all $`r^{},r^{\prime \prime },\mathrm{},r^{(i)},\mathrm{}`$ for every $`r`$. We consider the group obtained from (3) by the following formula

$$\overline{}=(n)/(^{})^{(n)}=c_1,\mathrm{},c_m|𝒱^{}$$
(5)
Since $`B(m,n)c_1,\mathrm{},c_m|𝒱`$, we have from (5)

$$\overline{}B_c(m,n)/(^{})^{B_c(m,n)}.$$
(6)
where $`B_c(m,n)`$ is the free Burnside group with $`m`$ free generators $`c_1,\mathrm{},c_m`$. Let $`_b`$ and $`_b^{}`$ consist of copies of words from $``$ and $`^{}`$ written in letters $`b_1,\mathrm{},b_m`$. Then from (6), we immediately deduce

$$\overline{}B_c(m,n)/(^{})^{B_c(m,n)}B_b(m,n)/(_b_b^{})^{B_b(m,n)}.$$
(7)
Since the embedding of $`B_b(m,n)`$ into $`(n)`$ is an CEP-embedding (see (2)), the right-hand side of (7) is isomorphic to the group

$$\overline{B}=B_b(m,n)/(B_b(m,n)(_b_b^{})^{(n)}).$$

However, by the definition (4), $`r(b_1,\mathrm{},b_m)=r^{}(c_1,\mathrm{},c_m),r^{}(b_1,\mathrm{},b_m)=r^{\prime \prime }(c_1,\mathrm{},c_m),\mathrm{}`$ in $`(n),`$ and so $`(_b_b^{})^{(n)}=(^{})^{(n)}.`$ Hence $`\overline{B}=B_b(m,n)/(B_b(m,n)(^{})^{(n)})`$, i.e. $`\overline{B}`$ is the canonical image of the subgroup $`B_b(m,n)(n)`$ in $`\overline{}`$. Thus, the left-hand side $`\overline{}`$ of (7) is isomorphic to the image $`\overline{B}`$ of $`B_b(m,n)`$ in $`\overline{}`$ under the mapping $`c_ib_i`$, $`i=1,\mathrm{}m`$. (We preserve notations $`c_1,\mathrm{},c_m`$, $`b_1,\mathrm{},b_m`$ for the images of the generators in $`\overline{}`$.)

The isomorphism of $`\overline{}`$ with its subgroup $`\overline{B}`$ allows us to introduce the ascending HNN-extension

$$𝒢=\overline{},t|tc_it^1=b_i,i=1,\mathrm{},m=c_1,\mathrm{},c_m|𝒱^{}𝒰,$$

where $`𝒰=\{tc_it^1w_i^1,i=1,\mathrm{},m\}`$.555E.Rips has been publicizing a simpler idea of constructing $`𝒢`$ for several years. He suggested to consider a finitely presented group $`=c_1,\mathrm{},c_m|`$, containing $`B(2,n)`$, subject to relations from $``$ and additional relations of the form $`c_i=u_i`$, $`i=1,\mathrm{}m`$, where the words $`u_i(c_1,\mathrm{},c_m)`$ represent “long and complicated” elements in $`B(2,n)`$. The resulting group is clearly finitely presented and torsion since the images of $``$ and $`B(2,n)`$ coincide in it. So if it were infinite, it would be an example of an infinite finitely presented torsion group (a solution of an outstanding group theory problem). If such an example were to exist, it would most certainly be non-amenable. Unfortunately in all known cases the resulting group is obviously finite, and Rips’ idea has not been implemented yet. Our group (8) is not torsion but it is torsion-by-cyclic, and it satisfies the identity $`[x,y]^n=1`$.  However, relators from $`𝒰`$ and formulas (4) imply that $`tr^{(i)}(c_1,\mathrm{},c_m)t^1=r^{(i+1)}(c_1,\mathrm{},c_m)`$ for $`i0`$ where $`r^{(0)}=r,r^{(1)}=r^{},\mathrm{}`$ for $`r.`$ Hence $`𝒢=c_1,\mathrm{},c_m|𝒱𝒰.`$

Next we observe that for every word $`v`$ in letters $`b_1,\mathrm{},b_m`$, the relation $`v(b_1,\mathrm{},b_m)^n=1`$ follows from $``$ because $`B_b(m,n)`$ is a subgroup of $``$. Therefore $`v(c_1,\mathrm{},c_m)^n=t^1v(b_1,\mathrm{},b_m)^nt=1`$ follows from $`𝒰`$. Hence

$$𝒢=c_1,\mathrm{},c_m|𝒰,$$
(8)
and so $`𝒢`$ is a finitely presented group.

The group $`𝒢`$ is an ascending HNN-extension of the group $`\overline{}`$, which is of exponent $`n`$ being a homomorphic image of the group $`(n)`$.

Finally, we notice that the canonical image $`B`$ of the subgroup $`B_b(m+2,n)(n)`$ in $`\overline{}`$ is isomorphic to $`B_b(m+2,n)/(_{}^{}{}_{}{}^{(n)}B_b(m+2,n))=B_b(m+2,n)/(^{})^{B_b(m+2,n)}`$ because of the CEP-embedding $`B_b(m+2,n)_{CEP}`$ (see (2)). The group $`B_b(m+2,n)/(^{})^{B_b(m+2,n)}`$ can be homomorphically mapped onto the free Burnside group $`B(2,n)`$ because all words from $`^{}`$ are written in the first $`m`$ of the $`m+2`$ generators of $`B_b(m+2,n)`$. Therefore $`B`$ has a retract which is isomorphic to $`B(2,n)`$. (The retraction $`B(2,n)B`$ does exist since the group $`B(2,n)`$ is free in the variety of periodic group defined by the identity $`x^n=1`$.)

Thus, statements 1 and 3 of Theorem 1.1 (and so statements 2 and 4, as we noticed earlier) follow from Theorems 1.2 and 1.3.

###### Remark 1.4.

The embedding of $`B(s,n)`$ into the group $``$ in Theorem 1.3 and the set of defining relation $``$ of $``$ will be constructed explicitly. Since the function $`f`$ in Lemma 4.1 and the number of generators in Lemma 4.2 are obtained explicitly, the CEP-embedding for Theorem 1.2 is constructive too. Therefore one can also write down an explicit presentation (8) of the group $`𝒢`$ in Theorem 1.1. But an easier, clear and explicit construction of a finite set of the subwords $`w_1,\mathrm{}w_m`$ of relators $`𝒰`$ from (8) is explained in Remark 4.3 which goes back to .

### 1.3 The scheme of the proof of Theorem 1.3 and the plan of the paper

To prove Theorem 1.3, we have to construct special embeddings of given free Burnside group $`B(m,n)`$ generated by a set $``$ of cardinality $`m`$ into a finitely presented group $``$ such that $`^nB(m,n)=1`$, and the canonical image of $`B(m,n)`$ in $`(n)=/^n`$ enjoys CEP. The embedding in $``$ is obtained in a similar way as in our papers ,  but we need a more complicated $`S`$-machine than in  ($`S`$-machines were introduced by Sapir in ), and now the proof requires a detailed analysis of the construction of the group $`(n)`$.

This group is a factor-group of the group $``$ generated by $`𝒞=\{c_1,\mathrm{},c_m\}`$ subject to the relations $``$ of $``$ over the normal subgroup generated by Burnside relations. In other words, $`(n)`$ is the Burnside factor of $``$. Burnside factors of free groups and free products have been studied first by Adian and Novikov in , . Geometric approach based on the notion of $`A`$-map was employed in the study of Burnside factors of these and more complicated groups in . Papers ,  extends this approach to Burnside factors of hyperbolic groups. The main problem we face in this paper is that $``$ is “very” non-hyperbolic. In particular, the set of relations $``$ (denoted below by $`Z(𝕊,\mathrm{\Lambda })`$) contains many commutativity relations, so $``$ contains non-cyclic torsion-free abelian subgroups which cannot happen in a hyperbolic group.

Nevertheless (and it is one of the main ideas of the paper) one can make the Cayley graph of $``$ look hyperbolic if one divides the generators from $`𝒞`$ into two sets and consider letters from one set as zero letters, and the corresponding edges of the Cayley graph as edges of length 0. Thus the length of a path in the Cayley graph or in a van Kampen diagram over the presentation of $``$ is the number of non-zero edges of the path.

More precisely, the group $``$ is similar to the group $`G(𝕊)`$ of , , . As we mentioned above it corresponds to an $`S`$-machine $`𝕊`$. The set $`𝒞`$ consists of tape letters (the set $`𝐀`$), state letters (the set $`𝐊`$) and command letters (the set $`𝐑`$). Recall that unlike an ordinary Turing machine, an $`S`$-machine works with elements of a group, not elements of the free semigroup.

It turns out that the most productive point of view is to consider an $`S`$-machine as an inverse semigroup of partial transformations of a set of states which are special (admissible) words of a certain group $`H_{ka}^{}`$ generated by $`𝐊𝐀`$. The generators of the semigroup are the $`S`$-rules. The machine $`𝕊`$ is the set of the $`S`$-rules. Every computation of the machine corresponds to a word over $`𝕊`$ which is called the history of computation, i.e. the string of commands used in the computation. With every computation $`h`$ applied to an admissible element $`W`$, one associates a van Kampen diagram $`T(W,h)`$ (called a trapezium) over the presentation of $`H_{ka}^{}`$ (see Figure 1; a more precise picture of a trapezium is Figure 14 in Section 7.3).

The first and the last words of the computation are written on the bases the trapezium, copies of the history of the computation are written on the vertical sides. The horizontal strips (bands) of cells correspond to applications of individual rules in the computation.

The trapezia $`T(W,h)`$ play central role in our study of the Burnside factor $`(n)`$ of $``$. As in , the main idea is to construct a graded presentation of $`(n)`$ where longer relations have higher ranks and such that every van Kampen diagram over the presentation of $`(n)`$ has the so called property A from . In all diagrams over the graded presentation of $`(n)`$, cells corresponding to the relations from $``$ are considered as $`0`$-cells or cells of rank $`1/2`$, and cells corresponding to Burnside relations from the graded presentation are considered as cells of ranks 1, 2,…. So in these van Kampen diagrams “big” Burnside cells are surrounded by “invisible” 0-cells and “small” cells.

Fig. 1.

The main part of property A is the property that if a diagram over $`(n)`$ contains two Burnside cells $`\mathrm{\Pi }_1,\mathrm{\Pi }_2`$ connected by a rectangular  contiguity  subdiagram $`\mathrm{\Gamma }`$ of rank 0 where the sides contained in the contours of the two Burnside cells are “long enough” then these two cells cancel, that is the union of $`\mathrm{\Gamma }`$, $`\mathrm{\Pi },\mathrm{\Pi }^{}`$ can be replaced by a smaller subdiagram. This is a “graded substitute” to the classic property of small cancellation diagrams (where contiguity subdiagrams contain no cells).

Roughly speaking nontrivial contiguity subdiagrams of rank 0 turn out to be trapezia of the form $`T(W,h)`$ (after we clean them of Burnside $`0`$-cells), so properties of contiguity subdiagrams can be translated into properties of the machine $`𝕊`$, and the inverse semigroup described above.

As an intermediate step in studying the group $`(n)`$, we construct a graded presentation of the Burnside factor of the subgroup of $``$ generated by $`𝐑𝐀`$. To avoid repeating the same arguments twice, for $``$ and for the subgroup, we formulate certain key properties (Z1), (Z2), (Z3) of a presentation of a group with a separation of generators into zero and non-zero generators, so that there exists a graded presentation of the Burnside factor of the group which satisfies property $`A`$ (Section 3).

In order to roughly explain these conditions, consider the following example. Let $`P=F_A\times F_B`$ be the direct product of two free groups of rank $`m`$. Then the Burnside factor of $`P`$ is simply $`B(m,n)\times B(m,n)`$. Nevertheless the theory of  cannot be formally applied to $`P`$. Indeed, there are arbitrarily thick rectangles corresponding to relations $`u^1v^1uv=1`$ in the Cayley graph of $`P`$ so diagrams over $`P`$ are not A-maps in the terminology of  (i.e. they do not look like hyperbolic spaces). But one can obtain the Burnside factor of $`P`$ in two steps. First we factorize $`F_A`$ to obtain $`Q=B(m,n)\times F_B`$. After that we consider all edges labeled by letters from $`A`$ in the Cayley graph of $`Q`$ as edges of length 0. As a result the Cayley graph of $`Q`$ becomes a hyperbolic space. This allows us to apply the theory of A-maps from  to obtain the Burnside factor of $`Q`$. The real reason for the theory from  to work in $`Q`$ is that $`Q`$ satisfies our conditions (Z1), (Z2), (Z3). But the class of groups satisfying these conditions is much bigger and includes groups corresponding to $`S`$-machines considered in this paper. In particular (Z3) holds in $`Q`$ because all 0-letters centralize $`F_B`$. This does not happen in more complicated situations. But we associate with every cyclically reduced non-0-element $`w`$ a “personal” subgroup $`\mathrm{𝟎}(w)`$ consisting of $`0`$-elements which is normalized by $`w`$.

The plan of the paper is the following. First in Section 2.2 we discuss some basic facts about van Kampen diagrams and the main tools of studying them. In Section 2, we repeat the main definitions and the main results of the theory of A-maps from \[30, Chapter 5\]. We also give some modifications of statements from  that we need later.

Then in Section 3, we introduce properties (Z1), (Z2), (Z3) and study Burnside factors. Although we follow the general scheme of , we encounter new significant difficulties. One of the main difficulties is that non-zero elements can be conjugates of zero elements. As a bi-product of this study, we show that under certain mild conditions, one can one can construct analogs of HNN extensions in the class of Burnside groups of sufficiently large odd exponents (see Corollary 3.40).

In Section 4, we prove some properties of the free Burnside group, in particular the existence of a countably generated free Burnside subgroup with congruence extension property (Theorem 4.4). Roughly speaking, we obtain the required embedding of the group $`B(\mathrm{},n)`$ into $`B(s,n)`$ if we choose the images of free generators of $`B(\mathrm{},n)`$ as aperiodic words $`A_1,A_2,\mathrm{}`$ in generators of $`B(s,n)`$ satisfying a strong small cancellation condition. Here we start the inductive proof with the factor-group of the absolutely free group $`F_s`$ by arbitrary relations of form $`r(A_1,A_2,\mathrm{})`$. (This first step was described in .)

Then in Section 5, we define the presentation of our group $``$ by listing the rules of an $`S`$-machine and showing how to convert the $`S`$-machine into a group.

In Section 6 we conduct a detailed study of the inverse semigroup corresponding to our $`S`$-machine. Two important properties reflect the flavor of that section and can be singled out. Lemma 6.5 (iv) says that if there is a computation starting with an element $`W`$, with history of the form $`h^2`$ (that is if $`W`$ is in the domain of $`h^2`$), then there exists a computation with history $`h^s`$ for every integer $`s`$. In other words, if a sequence of rules can be applied twice in a row, it can be applied any number of times. That lemma is used in the geometric part of the paper when we are cleaning contiguity subdiagrams of Burnside 0-cells (see Lemma 9.1). Proposition 6.17 provides an important property of stabilizers of elements in the inverse semigroup generated by the $`S`$-rules. It says, basically, that if $`W`$ is stabilized by $`h`$, $`ghg^1`$ and $`g^1hg`$ then it is stabilized by $`g^shg^s`$ for any integer $`s`$. This proposition is used when we consider long and narrow contiguity subdiagrams (see Lemma 9.9). Another very important feature of our $`S`$-machine is that two words $`h_1`$ and $`h_2`$ in the alphabet $`𝕊`$ define the same partial transformation on the intersection of their domains provided $`h_1`$ and $`h_2`$ are equal modulo Burnside relations (see Lemma 6.5 (ii)). Thus the work of the $`S`$-machine is “compatible” with Burnside relations.

In the remaining sections of the paper, we show that properties (Z1), (Z2), (Z3) are satisfied by the presentation of the group $`H_{kra}`$ corresponding to our $`S`$-machine.

The proof ends in Section 10.

Acknowledgment. The authors are grateful to Eliyahu Rips for inspiring discussions of topics related to this paper. The authors are also grateful to Goulnara Arjantseva who read the original version of the paper and sent us numerous comments about it. This allowed us to significantly improve the exposition.

## 2 Maps and diagrams

Planar maps and van Kampen diagrams are standard tools to study complicated groups (see, for example,  and ). Here we present the main concepts related to maps and diagrams. A van Kampen diagram is a labeled map, so we start by discussing maps.

### 2.1 Graphs and maps

We are using the standard definition of a graph. In particular, every edge has a direction, and every edge has an inverse edge (having the opposite direction). For every edge $`e`$, $`e_{}`$ and $`e_+`$ are the beginning and the end vertices of the edge.

A map is simply a finite plane graph drawn on a disc or an annulus which subdivides this surface into polygonal cells. Edges do not have labels, so no group presentations are involved in studying maps. On the other hand the theory of maps helps find the structure of van Kampen diagrams because every diagram becomes a map after we remove all the labels.

Let us recall the necessary definitions from .

A map is called graded if every cell $`\mathrm{\Pi }`$ is assigned a non-negative number, $`r(\mathrm{\Pi })`$, its rank. A map $`\mathrm{\Delta }`$ is called a map of rank $`i`$ if all its cells have ranks $`i`$. Every graded map $`\mathrm{\Delta }`$ has a type $`\tau (\mathrm{\Delta })`$ which is the vector whose first coordinate is the maximal rank of a cell in the map, say, $`r`$, the second coordinate is the number of cells of rank $`r`$ in the map, the third coordinate is the number of cells of rank $`r1`$ and so on. We compare types lexicographically.

Let $`\mathrm{\Delta }`$ be a graded map on a surface $`X`$. The cells of rank $`0`$ in $`\mathrm{\Delta }`$ are called 0-cells. Some of the edges in $`\mathrm{\Delta }`$ are called $`0`$-edges. Other edges and cells will be called positive. We define the length of a path $`p`$ in a map as the number of positive edges in it. The length of a path $`p`$ is denoted by $`|p|`$, in particular, $`|(\mathrm{\Pi })|`$ is the perimeter of a cell $`\mathrm{\Pi }`$.

We assume that

* the inverse edge of a $`0`$-edge is also a $`0`$-edge,
* either all edges in a 0-cell are 0-edges or exactly two of these edges are positive,
* for every cell $`\mathrm{\Pi }`$ of rank $`r(\mathrm{\Pi })>0`$ the length $`|(\mathrm{\Pi })|`$ of its contour is positive.

### 2.2 Bands

A van Kampen diagram over a presentation $`𝒳|`$ is a planar map with edges labeled by elements from $`𝒳^{\pm 1}`$, such that the label of the contour of each cell belongs to $``$ up to taking cyclic shifts and inverses . In $`\mathrm{\S }11`$ of , 0-edges of van Kampen diagrams have label 1, but in this paper 0-edges will be labeled also by the so called 0-letters. All diagrams which we shall consider in this paper, when considered as planar maps, will obviously satisfy conditions (M1), (M2), (M3) from Section 2.1. By van Kampen Lemma, a word $`w`$ over $`𝒳`$ is equal to 1 modulo $``$ if and only if there exists a van Kampen disc diagram over $``$ with boundary label $`w`$. Similarly (see ) two words $`w_1`$ and $`w_2`$ are conjugate modulo $`R`$ if and only if there exists an annular diagram with the internal counterclockwise contour labeled by $`w_1`$ and external counterclockwise contour labeled by $`w_2`$. There may be many diagrams with the same boundary label. Sometimes we can reduce the number of cells in a diagram or ranks of cells by replacing a 2-cell subdiagram by another subdiagram with the same boundary label. The simplest such situation is when there are two cells in a diagram which have a common edge and are mirror images of each other. In this case one can cancel these two cells (see ). In order strictly define this cancellation (to preserve the topological type of the diagram), one needs to use the so called $`0`$-refinement. The $`0`$-refinement consists of adding $`0`$-cells with (freely trivial) boundary labels of the form $`1aa^1`$ or $`111`$ (see , $`\mathrm{\S }11.5`$).

As in our previous papers ,  and , one of the main tools to study van Kampen diagrams are bands and annuli.

Let $`S`$ be a subset of $`𝒳`$. An $`S`$-band $``$ is a sequence of cells $`\pi _1,\mathrm{},\pi _n`$, for some $`n0`$ in a van Kampen diagram such that

* Each two consecutive cells in this sequence have a common edge labeled by a letter from $`S`$.
* Each cell $`\pi _i`$, $`i=1,\mathrm{},n`$ has exactly two $`S`$-edges (i.e. edges labeled by a letter from $`S`$).
* If $`n=0`$, then the boundary of $`S`$ has form $`ee^1`$ for an $`S`$-edge $`e`$.

Figure 2 illustrates this concept. In this Figure edges $`e,e_1,\mathrm{},e_{n1},f`$ are $`S`$-edges, the lines $`l(\pi _i,e_i),l(\pi _i,e_{i1})`$ connect fixed points in the cells with fixed points of the corresponding edges.

Fig. 2.

The broken line formed by the lines $`l(\pi _i,e_i)`$, $`l(\pi _i,e_{i1})`$ connecting points inside neighboring cells is called the connecting line666In ,  this line was called the median of the band, but in , it is called the connecting line. of the band $``$. The $`S`$-edges $`e`$ and $`f`$ are called the start and end edges of the band.

The counterclockwise boundary of the subdiagram formed by the cells $`\pi _1,\mathrm{},\pi _n`$ of $``$ has the form $`e^1q_1fq_2^1`$. We call $`q_1`$ the bottom of $``$ and $`q_2`$ the top of $``$, denoted $`\mathrm{𝐛𝐨𝐭}()`$ and $`\mathrm{𝐭𝐨𝐩}()`$.

A band $`\pi _1,\mathrm{},\pi _t`$ is called reduced if $`\pi _{i+1}`$ is not a mirror image of $`\pi _i`$, $`i=1,\mathrm{},t1`$ (otherwise cells $`\pi _i`$ and $`\pi _{i+1}`$ cancel and there exists a diagram with the same boundary label as $`_i\pi _i`$ ad containing fewer cells). Similarly, we define reduce annuli.

We say that two bands cross if their connecting lines cross. We say that a band is an annulus if its connecting line is a closed curve. In this case the first and the last cells of the band coincide (see Figure 3a).

Fig. 3.

If a band $``$ connects two edges on the boundary of a van Kampen disc diagram $`\mathrm{\Delta }`$ then the connecting line of $``$ divides the region bounded by $`(\mathrm{\Delta })`$ into two parts. Let $`\mathrm{\Delta }_1`$ and $`\mathrm{\Delta }_2`$ be the maximal subdiagrams of $`\mathrm{\Delta }`$ contained in these parts. Then we say that the (connecting line of the) band $``$ divides $`\mathrm{\Delta }`$ into two subdiagrams $`\mathrm{\Delta }_1`$ and $`\mathrm{\Delta }_2`$. Notice that $``$ does not belong to either $`\mathrm{\Delta }_1`$ or $`\mathrm{\Delta }_2`$ and $`\mathrm{\Delta }=\mathrm{\Delta }_1\mathrm{\Delta }_2`$. Similarly if $`\mathrm{\Delta }`$ is an annular diagram and $``$ is an annulus surrounding the hole of $`\mathrm{\Delta }`$ then (the connecting line of) $``$ divides $`\mathrm{\Delta }`$ into two annular subdiagrams.

The maximal subdiagram bounded by the connecting line of an annulus in a disc diagram is called the inside diagram of this annulus.

Let $`S`$ and $`T`$ be two disjoint subsets of $`𝒳`$, let ($`\pi `$, $`\pi _1`$, …, $`\pi _n`$, $`\pi ^{}`$) be an $`S`$-band and let ($`\pi `$, $`\gamma _1`$, …, $`\gamma _m`$, $`\pi ^{}`$) is a $`T`$-band. Suppose that:

* the connecting lines of these bands form a simple closed curve,
* on the boundary of $`\pi `$ and on the boundary of $`\pi ^{}`$ the pairs of $`S`$-edges separate the pairs of $`T`$-edges,
* the start and end edges of these bands are not contained in the region bounded by the connecting lines of the bands.

Then we say that these bands form an $`(S,T)`$-annulus and the closed curve formed by the parts of connecting lines of these bands is the connecting line of this annulus (see Figure 3b). For every $`(S,T)`$-annulus we define the inside subdiagram diagram of the annulus as the maximal subdiagram bounded by the connecting line of the annulus.

### 2.3 Bonds and contiguity submaps

Now let us introduce the main concepts from Chapter 5 of . Consider a map $`\mathrm{\Delta }`$. A path in $`\mathrm{\Delta }`$ is called reduced if it does not contain subpaths of length 2 which are homotopic to paths of length 0 by homotopies involving only 0-cells. We shall usually suppose that the contour of $`\mathrm{\Delta }`$ is subdivided into several subpaths called sections. We usually assume that sections are reduced paths.

By property M2 if a 0-cell has a positive edge, it has exactly two positive edges. Thus we can consider bands of 0-cells having positive edges. The start and end edges of such bands are called adjacent.

Let $`e`$ and $`f`$ be adjacent edges of $`\mathrm{\Delta }`$ belonging to two positive cells $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$ or to sections of the contour of $`\mathrm{\Delta }`$. Then there exists a band of $`0`$-cells connecting these edges. The union of the cells of this band is called a $`0`$-bond between the cells $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$ (or between a cell and a section of the contour of $`\mathrm{\Delta }`$, or between two sections of the contour). The connecting line of the band is called the connecting line of the bond. The contour of the $`0`$-bond has the form $`p^1es^1f^1`$ where $`p`$ and $`s`$ are paths of length 0 because every $`0`$-cell has at most two positive edges.

Now suppose we have chosen two pairs $`\{e_1,f_1\}`$ and $`\{e_2,f_2\}`$ of adjacent edges such that $`e_1,e_2`$ belong to the contour of a cell $`\mathrm{\Pi }_1`$ and $`f_1^1,f_2^1`$ to the contour of a cell $`\mathrm{\Pi }_2`$. Then we have two bonds $`E_1`$ and $`E_2`$. If $`E_1=E_2`$ (that is $`e_1=e_2,f_1=f_2`$) then let $`\mathrm{\Gamma }=E_1`$. Now let $`E_1E_2`$ and $`z_1e_1w_1f_1^1`$ and $`z_2e_2w_2f_2^1`$ be the contours of these bonds. Further let $`y_1`$ and $`y_2`$ be subpaths of the contours of $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$ (of $`\mathrm{\Pi }_1`$ and $`q`$, or $`q_1`$ and $`q_2`$, where $`q`$, $`q_1`$ and $`q_2`$ are some segments of the boundary cotours) where $`y_1`$ (or $`y_2`$) has the form $`e_1pe_2`$ or $`e_2pe_1`$ (or $`(f_1uf_2)^1`$ or $`(f_2uf_1)^1`$). If $`z_1y_1w_2y_2`$ (or $`z_2y_1w_1y_2`$) is a contour of a disc submap $`\mathrm{\Gamma }`$ which does not contain $`\mathrm{\Pi }_1`$ or $`\mathrm{\Pi }_2`$, then $`\mathrm{\Gamma }`$ is called a $`0`$-contiguity submap of $`\mathrm{\Pi }_1`$ to $`\mathrm{\Pi }_2`$ (or $`\mathrm{\Pi }_1`$ to $`q`$ or of $`q_1`$ to $`q_2`$). The contour of $`\mathrm{\Gamma }`$ is naturally subdivided into four parts. The paths $`y_1`$ and $`y_2`$ are called the contiguity arcs. We write $`y_1=\mathrm{\Gamma }\mathrm{\Pi }_1`$, $`y_2=\mathrm{\Gamma }\mathrm{\Pi }_2`$ or $`y_2=\mathrm{\Gamma }q`$. The other two paths are called the side arcs of the contiguity submap.

The ratio $`|y_1|/|(\mathrm{\Pi }_1)|`$ (or $`|y_2|/|(\mathrm{\Pi }_2)|`$ is called the degree of contiguity of the cell $`\mathrm{\Pi }_1`$ to the cell $`\mathrm{\Pi }_2`$ or to $`q`$ (or of $`\mathrm{\Pi }_2`$ to $`\mathrm{\Pi }_1`$). We denote the degree of contiguity of $`\mathrm{\Pi }_1`$ to $`\mathrm{\Pi }_2`$ (or $`\mathrm{\Pi }_1`$ to $`q`$) by $`(\mathrm{\Pi }_1,\mathrm{\Gamma },\mathrm{\Pi }_2)`$ (or $`(\mathrm{\Pi }_1,\mathrm{\Gamma },q)`$). Notice that this definition is not symmetric and when $`\mathrm{\Pi }_1=\mathrm{\Pi }_2=\mathrm{\Pi }`$, for example, then $`(\mathrm{\Pi },\mathrm{\Gamma },\mathrm{\Pi })`$ is a pair of numbers.

A connecting line of $`\mathrm{\Gamma }`$ is chosen as the connecting line of one of the bonds $`E_1`$ or $`E_2`$.

We say that two contiguity submaps are disjoint if none of them has a common point with the interior of the other one, and their contiguity arcs do not have common edges.

Now we are going to define $`k`$-bonds and $`k`$-contiguity submaps for $`k>0`$. In these definitions we need a fixed number $`\epsilon `$, $`0<\epsilon <1`$.

Let $`k>0`$ and suppose that we have defined the concepts of $`j`$-bond and $`j`$-contiguity submap for all $`j<k`$. Consider three cells $`\pi ,\mathrm{\Pi }_1,\mathrm{\Pi }_2`$ (possibly with $`\mathrm{\Pi }_1=\mathrm{\Pi }_2`$) satisfying the following conditions:

1. $`r(\pi )=k,r(\mathrm{\Pi }_1)>k,r(\mathrm{\Pi }_2)>k`$,
2. there are disjoint submaps $`\mathrm{\Gamma }_1`$ and $`\mathrm{\Gamma }_2`$ of $`j_1`$-contiguity of $`\pi `$ to $`\mathrm{\Pi }_1`$ and of $`j_2`$-contiguity of $`\pi `$ to $`\mathrm{\Pi }_2`$, respectively, with $`j_1<k,j_2<k`$, such that $`\mathrm{\Pi }_1`$ is not contained in $`\mathrm{\Gamma }_2`$ and $`\mathrm{\Pi }_2`$ is not contained in $`\mathrm{\Gamma }_1`$,
3. $`(\pi ,\mathrm{\Gamma }_1,\mathrm{\Pi }_1)\epsilon `$, $`(\pi ,\mathrm{\Gamma }_2,\mathrm{\Pi }_2)\epsilon `$.

Then there is a minimal submap $`E`$ in $`\mathrm{\Delta }`$ containing $`\pi ,\mathrm{\Gamma }_1,\mathrm{\Gamma }_2`$. This submap is called a $`k`$-bond between $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$ defined by the contiguity submaps $`\mathrm{\Gamma }_1`$ and $`\mathrm{\Gamma }_2`$ with principal cell $`\pi `$ (see Figure 4).

The contiguity arc $`q_1`$ of the bond $`E`$ to $`\mathrm{\Pi }_1`$ is $`\mathrm{\Gamma }_1\mathrm{\Pi }_1`$. It will be denoted by $`E\mathrm{\Pi }_1`$. Similarly $`E\mathrm{\Pi }_2`$ is by definition the arc $`q_2=\mathrm{\Gamma }_2\mathrm{\Pi }_2`$. The contour $`(E)`$ can be written in the form $`p_1q_1p_2q_2`$ where $`p_1`$, $`p_2`$ are called the side arcs of the bond $`E`$.

Fig. 4.

For each $`k`$-bond we fix a connecting line obtained by joining the terminal points of connecting lines of $`\mathrm{\Gamma }_1`$ and $`\mathrm{\Gamma }_2`$ inside $`\pi `$. The connecting line divides $`\pi `$ (and the whole $`E`$) into two connected components.

Bonds between a cell and a section of the contour of $`\mathrm{\Delta }`$ or between two sections of the contour are defined in a similar way.

Now let $`E_1`$ be a $`k`$-bond and $`E_2`$ be a $`j`$-bond between two cells $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$, $`jk`$ and either $`E_1=E_2`$ or these bonds are disjoint. If $`E_1=E_2`$ then $`\mathrm{\Gamma }=E_1=E_2`$ is called the $`k`$-contiguity submap between $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$ determined by the bond $`E_1=E_2`$. If $`E_1`$ and $`E_2`$ are disjoint then the corresponding contiguity submap $`\mathrm{\Gamma }`$ is defined as the smallest submap containing $`E_1`$ and $`E_2`$ and not containing $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$ (see Figure 5).

Fig. 5.

The contiguity arcs $`q_1`$ and $`q_2`$ of $`\mathrm{\Gamma }`$ are intersections of $`(\mathrm{\Gamma })`$ with $`(\mathrm{\Pi }_1)`$ and $`(\mathrm{\Pi }_2)`$. The contour of $`\mathrm{\Gamma }`$ has the form $`p_1q_1p_2q_2`$ where $`p_1`$ and $`p_2`$ are called the side arcs of $`\mathrm{\Gamma }`$. The connecting line of $`\mathrm{\Gamma }`$ is one of the connecting lines of $`E_1`$ or $`E_2`$. The ratio $`|q_1|/|(\mathrm{\Pi }_1)|`$ is called the contiguity degree of $`\mathrm{\Pi }_1`$ to $`\mathrm{\Pi }_2`$ with respect to $`\mathrm{\Gamma }`$ and is denoted by $`(\mathrm{\Pi }_1,\mathrm{\Gamma },\mathrm{\Pi }_2)`$. If $`\mathrm{\Pi }_1=\mathrm{\Pi }_2=\mathrm{\Pi }`$ then $`(\mathrm{\Pi },\mathrm{\Gamma },\mathrm{\Pi })`$ is a pair of numbers.

Contiguity submaps of a cell to a section of the contour and between sections of the contour are defined in a similar way. (In this paper we do not use notion ”degree of contiguity of a section of a contour to” anything.)

We are going to write “bonds” and “ contiguity submaps” in place of “$`k`$-bonds” and “$`k`$-contiguity submaps”. Instead of writing “the contiguity submap $`\mathrm{\Gamma }`$ of a cell $`\mathrm{\Pi }`$ to …”, we sometimes write “the $`\mathrm{\Gamma }`$\- contiguity of $`\mathrm{\Pi }`$ to …”.

The above definition involved the standard decomposition of the contour of a contiguity submap $`\mathrm{\Gamma }`$ into four sections $`p_1q_1p_2q_2`$ where $`q_1=\mathrm{\Gamma }\mathrm{\Pi }_1`$, $`q_2=\mathrm{\Gamma }\mathrm{\Pi }_2`$ (or $`q_2=\mathrm{\Gamma }q`$ if $`q`$ is a section of $`(\mathrm{\Delta })`$), we shall write $`p_1q_1p_2q_2=(\mathrm{\Pi }_1,\mathrm{\Gamma },\mathrm{\Pi }_2)`$, and so on.

As in  (see $`\mathrm{\S }15.1`$) we fix certain real numbers $`\iota <<\zeta <<\epsilon <<\delta <<\gamma <<\beta <<\alpha `$ between 0 and 1 where ”$`<<`$” means “much smaller”. Here “much” means enough to satisfy all the inequalities in Chapters 5, 6 of . We also set $`\overline{\alpha }=\frac{1}{2}+\alpha `$, $`\overline{\beta }=1\beta `$, $`\overline{\gamma }=1\gamma ,h=\delta ^1,n=\iota ^1`$.

### 2.4 Condition A

The set of positive cells of a diagram $`\mathrm{\Delta }`$ is denoted by $`\mathrm{\Delta }(2)`$ and as before the length of a path in $`\mathrm{\Delta }`$ is the number of positive edges in the path. A path $`p`$ in $`\mathrm{\Delta }`$ is called geodesic if $`|p||p^{}|`$ for any path $`p^{}`$ combinatorially homotopic to $`p`$.

The condition A has three parts:

* If $`\mathrm{\Pi }`$ is a cell of rank $`j>0,`$ then $`|(\mathrm{\Pi })|nj`$.
* Any subpath of length $`\mathrm{max}(j,2)`$ of the contour of an arbitrary cell of rank $`j`$ in $`\mathrm{\Delta }(2)`$ is geodesic in $`\mathrm{\Delta }`$.
* If $`\pi ,\mathrm{\Pi }\mathrm{\Delta }(2)`$ and $`\mathrm{\Gamma }`$ is a contiguity submap of $`\pi `$ to $`\mathrm{\Pi }`$ with $`(\pi ,\mathrm{\Gamma },\mathrm{\Pi })\epsilon `$, then $`|\mathrm{\Gamma }\mathrm{\Pi }|<(1+\gamma )k`$ where $`k=r(\mathrm{\Pi })`$.

A map satisfying conditions A1, A2, A3 will be called an $`A`$-map. As in , Section 15.2, a (cyclic) section $`q`$ of a contour of a map $`\mathrm{\Delta }`$ is called a smooth section of rank $`k>0`$ (we write $`r(q)=k`$) if:

1) every subpath of $`q`$ of length $`\mathrm{max}(k,2)`$ of $`q`$ is geodesic in $`\mathrm{\Delta }`$;

2) for each contiguity submap $`\mathrm{\Gamma }`$ of a cell $`\pi `$ to $`q`$ satisfying $`(\pi ,\mathrm{\Gamma },q)\epsilon `$, we have $`|\mathrm{\Gamma }q|<(1+\gamma )k`$.

It is shown in , $`\mathrm{\S }\mathrm{\S }16,17`$, that $`A`$-maps have several “hyperbolic” properties. We summarize these properties here. (They show that $`A`$-maps of rank $`i`$ are hyperbolic spaces with hyperbolic constant depending on $`i`$ only.)

The next three lemmas are Lemmas 15.3, 15.4 and 15.8 in .

Lemma 2.1 shows that in a contiguity diagram between two cells side arcs are “much shorter” than perimeters of these cells (so the cells are close to each other).

###### Lemma 2.1.

Let $`\mathrm{\Delta }`$ be an A-map, $`\mathrm{\Gamma }`$ a contiguity submap of either:

(i) a cell $`\mathrm{\Pi }_1`$ to a cell $`\mathrm{\Pi }_2`$ or

(ii) a cell $`\mathrm{\Pi }_1`$ to a boundary section $`q^1`$ of $`\mathrm{\Delta }`$, or

(iii) a boundary section $`q^1`$ to a boundary section $`q^2`$.

Let $`p_1`$ and $`p_2`$ be the side arcs of $`\mathrm{\Gamma }`$, and $`c=\mathrm{max}(|p_1|,|p_2|)`$. Then $`c<2\epsilon ^1r(\mathrm{\Pi }_1)<\zeta nr(\mathrm{\Pi }_1)`$ in cases (i) and (ii), and $`c<\zeta nr(\mathrm{\Pi }_2)`$ in case (i). Furthermore $`c<\zeta nr(q^1)`$ in cases (ii) and (iii) provided $`q^1`$ is smooth.

Lemma 2.2 says that contiguity arcs in a contiguity subdiagram have “almost the same lengths”.

###### Lemma 2.2.

Let $`\psi `$ be the degree of $`\mathrm{\Gamma }`$-contiguity of a cell $`\mathrm{\Pi }_1`$ to a cell $`\mathrm{\Pi }_2`$ (or to a section $`q`$ of a contour) in an A-map $`\mathrm{\Delta }`$, and $`q_1=\mathrm{\Gamma }\mathrm{\Pi }_1`$, $`q_2`$ are the contiguity arcs of $`\mathrm{\Gamma }`$. Then

$$(\overline{\beta }2\zeta \psi ^1)|q_1|<|q_2|.$$

In particular, $`|q_2|>(\psi 2\beta )|(\mathrm{\Pi }_1)|,`$ and if also $`\psi \epsilon ,`$ then $`|q_1|<(1+2\beta )|q_2|.`$

Furthermore if $`q_2=\mathrm{\Gamma }\mathrm{\Pi }_2`$ or $`q_2=\mathrm{\Gamma }q`$ and $`q`$ is a smooth section, then

$$|q_1|>\overline{\beta }(1+2\zeta \psi ^1)^1|q_2|.$$

In particular, if $`\psi \epsilon `$, then

$$|q_1|>(12\beta )|q_2|.$$

Lemma 2.3 shows that the degree of contiguity of one cell to another cell cannot be significantly bigger than $`1/2`$ and the degree of contiguity of a cell of a bigger rank to a cell of a smaller rank is very small.

###### Lemma 2.3.

In an arbitrary A-map $`\mathrm{\Delta }`$ the degree of contiguity of an arbitrary cell $`\pi `$ to an arbitrary cell $`\mathrm{\Pi }`$ or to an arbitrary smooth section $`q`$ of the contour via an arbitrary contiguity submap $`\mathrm{\Gamma }`$ is less than $`\overline{\alpha }`$, and the degree of contiguity of $`\pi `$ to $`\mathrm{\Pi }`$ (or to $`q`$) with $`r(\mathrm{\Pi })r(\pi )`$ (or $`r(q)r(\pi )`$) is less than $`\epsilon .`$

The next lemma is a generalization of the Greenlinger lemma from the theory of small cancellation groups . It shows that any $`A`$-map contains a cell whose boundary is almost entirely contiguous to the boundary of the diagram.

###### Lemma 2.4.

a) Let $`\mathrm{\Delta }`$ be a disc A-map whose contour is subdivided into at most $`4`$ sections $`q^1,q^2,q^3,q^4`$, and $`r(\mathrm{\Delta })>0`$. Then there exists a positive cell $`\pi `$ and disjoint contiguity submaps $`\mathrm{\Gamma }_1,\mathrm{},\mathrm{\Gamma }_4`$ of $`\pi `$ to $`q^1,\mathrm{},q^4`$ (some of these submaps may be absent) such that the sum of corresponding contiguity degrees $`_{i=1}^4(\pi ,\mathrm{\Gamma }_i,q^i)`$ is greater than $`\overline{\gamma }=1\gamma `$.

b) Let $`\mathrm{\Delta }`$ be an annular A-map whose contours are subdivided into at most 4 sections $`q^1,q^2,q^3,q^4`$ regarded as cyclic or ordinary paths, and $`r(\mathrm{\Delta })>0`$. Then $`\mathrm{\Delta }`$ has a positive cell $`\pi `$ and disjoint contiguity submaps $`\mathrm{\Gamma }_1`$,…, $`\mathrm{\Gamma }_4`$ of $`\pi `$ to $`q^1`$ $`q^2`$, $`q^3`$, $`q^4`$ (up to three of these submaps may be absent) such that the sum of contiguity degrees of these contiguity submaps is greater than $`\overline{\gamma }`$.

###### Proof.

Both statements are immediate corollaries of Theorem 16.1 from . ∎

The next lemma follows from Lemma 2.4 in the same way as Theorem 16.2 follows from Corollary 16.1 in .

###### Lemma 2.5.

If $`\mathrm{\Delta }`$ is a disc or annular A-map with contour subdivided into at most $`4`$ sections, and $`r(\mathrm{\Delta })>0`$, then there exists a positive cell $`\mathrm{\Pi }`$ and a contiguity submap $`\mathrm{\Gamma }`$ of $`\mathrm{\Pi }`$ to one of the sections $`q`$ of the contour of $`\mathrm{\Delta }`$ such that $`r(\mathrm{\Gamma })=0`$ and $`(\mathrm{\Pi },\mathrm{\Gamma },q)\epsilon `$.

Here we add an additional property whose proof is contained in the proof of Theorem 16.2 in .

###### Lemma 2.6.

Let $`\mathrm{\Delta }`$ be a disc or annular A-map with contour subdivided into at most $`4`$ sections. Assume there is a cell $`\mathrm{\Pi }`$ in $`\mathrm{\Delta }`$ and a contiguity submap $`\mathrm{\Gamma }`$ of $`\mathrm{\Pi }`$ to one of the sections $`q`$ of the boundary with $`(\mathrm{\Pi },\mathrm{\Gamma },q)\epsilon `$. Then there is a cell $`\pi `$ of $`\mathrm{\Delta }`$ and a contiguity submap $`\mathrm{\Gamma }^{}`$ of $`\pi `$ to $`q`$ such that $`r(\mathrm{\Gamma }^{})=0`$ and $`(\pi ,\mathrm{\Gamma }^{},q)\epsilon .`$

The next four lemmas are Theorem 17.1, Corollary 17.1, Lemma 17.1 and Lemma 17.2 in .

The following lemma shows that smooth sections of contours of $`A`$-maps are almost geodesic.

###### Lemma 2.7.

Let $`\mathrm{\Delta }`$ be a disc map with contour $`qt`$ or an annular $`A`$-map with contours $`q`$ and $`t.`$ If $`q`$ is a smooth section then $`\overline{\beta }|q||t|.`$

The next nine lemmas demonstrate different variants of the fact that in $`A`$-maps, quasigeodesic quadrangles are thin. But we need more precise statements than in the usual theory of hyperbolic spaces. The constants appearing in these statements do not depend on the rank of diagrams while the hyperbolic constants of $`A`$-maps tends to infinity with the rank.

###### Lemma 2.8.

If a disc $`A`$-map $`\mathrm{\Delta }`$ contains a cell $`\mathrm{\Pi }`$ of positive rank, then $`|(\mathrm{\Delta })|>\overline{\beta }|(\mathrm{\Pi })|.`$

###### Lemma 2.9.

Let $`\mathrm{\Delta }`$ be a disc A-map with contour $`p_1q_1p_2q_2`$ where $`q_1`$ and $`q_2`$ are smooth sections such that $`|q_1|+|q_2|>0`$, $`|p_1|+|p_2|\gamma (|q_1|+|q_2|).`$ Then there is either a 0-bond between $`q_1`$ and $`q_2`$ or a cell $`\mathrm{\Pi }\mathrm{\Delta }(2)`$ and disjoint contiguity submaps $`\mathrm{\Gamma }_1`$ and $`\mathrm{\Gamma }_2`$ of $`\mathrm{\Pi }`$ to $`q_1`$ and $`q_2`$, respectively, such that $`(\mathrm{\Pi },\mathrm{\Gamma }_1,q_1)+(\mathrm{\Pi },\mathrm{\Gamma }_2,q_2)>\overline{\beta }=1\beta .`$

We also need the following version of Lemma 2.9.

We say that a bond between two boundary sections $`q_1`$ and $`q_2`$ of a map is narrow if it is either a 0-bond or, in the inductive definition of the bond, we add that $`(\pi ,\mathrm{\Gamma }_1,q_1)+(\pi ,\mathrm{\Gamma }_2,q_2)>1\alpha /2`$ for the principal cell $`\pi `$ of the bond. A contiguity submap between $`q_1`$ and $`q_2`$ is narrow if it is defined by narrow bonds (according to the inductive definition).

###### Lemma 2.10.

Let $`\mathrm{\Delta }`$ be a disc A-map with contour $`p_1q_1p_2q_2`$ where $`q_1`$ and $`q_2`$ are smooth sections such that $`|q_1|+|q_2|>0`$, $`|p_1|+|p_2|\alpha ^2(|q_1|+|q_2|)`$. Then there is either a $`0`$-bond between $`q_1`$ and $`q_2`$ or a cell $`\mathrm{\Pi }\mathrm{\Delta }(2)`$ and disjoint contiguity submaps $`\mathrm{\Gamma }_1`$ and $`\mathrm{\Gamma }_2`$ of $`\mathrm{\Pi }`$ to $`q_1,q_2`$ (respectively) such that $`(\mathrm{\Pi },\mathrm{\Gamma }_1,q_1)+(\mathrm{\Pi },\mathrm{\Gamma }_2,q_2)1\alpha /2.`$ Hence $`\mathrm{\Pi }`$, $`\mathrm{\Gamma }_1`$ and $`\mathrm{\Gamma }_2`$ form a narrow bond between $`q_1`$ and $`q_2`$.

###### Proof.

The difference between the formulations of Lemma 2.10 and Lemma 17.2 of  is that the parameters $`\gamma `$ and $`\overline{\beta }`$ are now substituted by $`\alpha ^2`$ and $`1\alpha /2`$, respectively. The proof differs from the proof of Lemma 17.2  only in some insignificant details.

There is no change in Case 1) of the proof of Lemma 17.2 . The only alteration in Case 2) is the substitution of the first factor $`\gamma `$ for $`\alpha ^2`$ in the left-hand side of the long inequality at the end. It is easy to see that the resulting inequality is also true by the choice of the parameters.

In Case 3), we should assume now that $`(\mathrm{\Pi },\mathrm{\Gamma },p_1)>\overline{\gamma }(1\alpha /2)=\alpha /2\gamma `$ (instead of $`(\mathrm{\Pi },\mathrm{\Gamma },p_1)>\overline{\gamma }\overline{\beta }=\beta \gamma `$ in ). This leads to the similar substitution of the term $`\beta \gamma `$ for $`\alpha /2\gamma `$ in the right-hand side of inequality (7) of the proof. It remains to notice that the last long inequality of Case 3) is still true after the substitution of $`\beta \gamma `$ by $`\alpha /2\gamma `$ in the right-hand side, and the substitution of the factor $`\gamma `$ by $`\alpha ^2`$ in the left-hand side.

The difference $`\beta \gamma `$ should be replaced by $`\alpha /2\gamma `$ in the hypothesis of Case 4). This leads to the same substitution in inequality (9) of the proof of Lemma 17.2 . Then again, it remains to replace the term $`\beta \gamma `$ by $`\alpha /2\gamma `$ in the right-hand side of the concluding inequality, and to replace the factor $`\gamma `$ by $`\alpha ^2`$ in the left-hand side of it. ∎

###### Lemma 2.11.

Let $`\mathrm{\Delta }`$ be a disc A-map with contour $`p_1q_1p_2q_2,`$ where $`q_1`$ and $`q_2`$ are smooth sections of some ranks $`k`$ and $`l,`$ $`kl,`$ and $`|p_1|+|p_2|\gamma (|q_1|+|q_2|)`$. Then there is a narrow contiguity submap between $`q_1`$ and $`q_2`$ with contour $`p_1^{}q_1^{}p_2^{}q_2^{},`$ where $`q_1=u^{}q_1^{}u^{\prime \prime }`$, $`q_2=v^{\prime \prime }q_2^{}v^{}`$ and $`|u^{}|,|v^{}|<\gamma ^1(|p_1|+\alpha k),`$ $`|u^{\prime \prime }|,|v^{\prime \prime }|<\gamma ^1(|p_2|+\alpha k).`$

###### Proof.

Up to the term “narrow”, the proof is the same as the proof of items 1) and 2) of Lemma 17.3  (Lemma 2.12 below). In fact Lemma 2.11 follows from the proof of Lemma 17.3  because $`\alpha /2>\beta `$. ∎

###### Lemma 2.12.

(Lemma 17.3 ) Let $`\mathrm{\Delta }`$ be a disc A-map with contour $`p_1q_1p_2q_2`$ where $`q_1`$ and $`q_2`$ are smooth sections of ranks $`k`$ and $`l`$, $`kl`$, such that

$$|p_1|+|p_2|\gamma (|q_1|+|q_2|).$$
(9)
Then:

(1) there exist vertices $`o_1`$ and $`o_2`$ on $`q_1`$ and $`q_2`$ and a path $`x`$ joining them in $`\mathrm{\Delta }`$ such that $`|x|<\alpha k.`$

(2) one can choose $`o_1`$ and $`o_2`$ in such a way that the lengths of the initial segments of $`q_1`$ and $`q_2^1`$ (or of $`q_1^1`$ and $`q_2`$) ending at $`o_1`$ and $`o_2,`$ are less than $`\gamma ^1(|p_1|+\alpha k)`$ (or than $`\gamma ^1(|p_2|+\alpha k)).`$

(3)if (9) is replaced by

$$|p_1|,|p_2|<\alpha k,$$

then any vertex $`o`$ of $`q_1`$ (or of $`q_2`$) can be joined in $`\mathrm{\Delta }`$ by a path $`y`$ to a vertex $`o^{}`$ on $`q_2`$ (or on $`q_1`$) in such a way that $`|y|<\gamma ^1k.`$

Consider an A-map $`\mathrm{\Delta }`$ with contour $`p_1q_1p_2q_2,`$ where $`q_1,q_2`$ are smooth sections and $`\mathrm{\Delta }`$ is a narrow contiguity submap between $`q_1`$ and $`q_2.`$ We define an $`\alpha `$-series as a maximal series of disjoint narrow bonds between $`q_1`$ and $`q_2.`$ In particular, the maximal series contains the bonds from the definition of narrow contiguity submap. By $`\mathrm{\Pi }_0`$ we denote a cell of maximal perimeter among principal cells of the bonds over all $`\alpha `$-series.

###### Lemma 2.13.

With the preceding notation, any vertex of $`q_1`$ is at the distance at most $`\alpha ^1|(\mathrm{\Pi }_0)|`$ from the path $`q_2`$.

###### Proof.

Assume that $`E_1,\mathrm{},E_s`$ is the $`\alpha `$-series. Let $`x_1^ly_1^lx_2^ly_2^l`$ be the standard contour of $`E_l,`$ where $`y_j^l`$ is a subpath of $`q_j`$ for $`j=1,2.`$ By Lemma 2.1 and the definition of narrow bonds, $`|x_j^l|<(\alpha +2\zeta )|(\mathrm{\Pi }_0)|.`$ By Lemmas 2.2 and 2.3, $`|y_j^l|<(12\beta )^1\overline{\alpha }|(\mathrm{\Pi }_0)|.`$ Therefore the distance between any vertex of some $`y_1^l`$ and $`q_2`$ is less than $`(\alpha +2\zeta +(12\beta )^1\overline{\alpha }/2)|(\mathrm{\Pi }_0)|<|(\mathrm{\Pi }_0)|/3<\alpha ^1|(\mathrm{\Pi }_0)|.`$

Then we consider the submaps $`\mathrm{\Delta }_1,\mathrm{},\mathrm{\Delta }_{s1}`$ with contours $`(x_2^l)^1z_1^l(x_1^{l+1})^1z_2^l`$, where $`z_j^l`$ is a subpath of $`q_j`$ for $`j=1,2.`$ One may suppose that $`|z_1^l|+|z_2^l|<\alpha ^2(|x_2^l|+|x_1^{l+1}|),`$ because otherwise by Lemma 2.10 there would be an additional narrow bond in $`\mathrm{\Delta }_l,`$ which contradicts the definition of the $`\alpha `$-series. (Indeed $`(\mathrm{\Pi },\mathrm{\Gamma }_j,q_j)1\alpha /2\overline{\alpha }>\epsilon `$ for $`j=1,2`$ in the Lemma 2.10 by Lemma 2.3, and therefore that cell $`\mathrm{\Pi }`$ is a principle cell of a narrow bond between $`q_1`$ and $`q_2.`$) Since $`|x_2^l|+|x_1^{l+1}|<(\alpha +4\zeta )|(\mathrm{\Pi }_0)|,`$ we have $`|z_1^l|<\alpha ^1(1+4\zeta \alpha ^1)|(\mathrm{\Pi }_0)|,`$ and the distance between any vertex of $`z_1^l`$ and $`q_2`$ is less than $`|z_1^l|/2+(\alpha +2\zeta )|(\mathrm{\Pi }_0)|<\alpha ^1|(\mathrm{\Pi }_0)|,`$ and the lemma is proved. ∎

###### Lemma 2.14.

(Lemma 17.4 .) Let $`\mathrm{\Delta }`$ be a disc A-map with contour $`p_1q_1p_2q_2`$, where $`q_1`$ and $`q_2`$ are smooth sections of ranks $`k`$ and $`l,`$ $`kl`$, and $`|p_1|,|p_2|<\zeta nk`$. Then the perimeter of every cell of $`\mathrm{\Delta }`$ is less than $`3\gamma ^1\zeta nk<nk`$ and $`r(\mathrm{\Delta })<3\gamma ^1\zeta k<k.`$

###### Lemma 2.15.

(Lemma 17.5 ). Let $`\mathrm{\Delta }`$ be a disc A-map with contour $`p_1q_1p_2q_2`$, where $`q_1`$ and $`q_2`$ are smooth sections of ranks $`k`$ and $`l,`$ $`kl`$, and $`|q_j|M0`$ for $`j=1,2`$ and $`M=\gamma ^1(|p_1|+|p_2|+k).`$ Then it is possible to excise a submap from $`\mathrm{\Delta }`$ with contour $`p_1^{}q_1^{}p_2^{}q_2^{}`$ where $`q_1^{}`$ ($`q_2^{}`$) is a subpath of $`q_1`$ (of $`q_2`$), $`|p_1^{}|,|p_2^{}|<\alpha k,`$ and $`|q_j^{}|>|q_j|M`$ for $`j=1,2.`$

The next lemma shows that annular $`A`$-maps can be cut by short paths to obtain a disc map.

###### Lemma 2.16.

(Lemma 17.1, ) Let $`\mathrm{\Delta }`$ be an annular A-map with contours $`p`$ and $`q`$ such that any loop consisting of 0-edges of $`\mathrm{\Delta }`$ is 0-homotopic. Then there is a path $`t`$ connecting some vertices $`o_1`$ and $`o_2`$ of the paths $`p`$ and $`q`$ respectively, such that $`|t|<\gamma (|p|+|q|).`$

## 3 Burnside quotients

### 3.1 Axioms

Recall that in Chapter 6 of , it is proved that for any sufficiently large odd $`n`$, there exists a presentation of the free Burnside group $`B(m,n)`$ with $`m2`$ generators, such that every reduced diagram over this presentation is an $`A`$-map.

Our goal here is to generalize the theory from  to Burnside factors of non-free groups in the following way.

In , 0-edges are labeled by 1 only, and (trivial) 0-relators have the form $`1\mathrm{}1`$ or $`a1\mathrm{}1a^11\mathrm{}1`$. We need to increase the collection of labels of 0-edges and the collection of 0-relations. In other words, we divide the generating set of our group into the set of 0-letters and the set of positive letters. Then in the diagrams, 0-letters label 0-edges. We shall also add defining relators of our group which have the form $`uavb^1`$ where $`u,v`$ are words consisting of 0-letters only (we call such words 0-words), and $`a,b`$ are a positive letters, as well as defining relations without positive letters, to the list of zero relations. The corresponding cells in diagrams will be called $`0`$-cells.

Let $`𝐆`$ be a group given by a presentation $`𝒳|`$. Let $`𝒳`$ be a symmetric set (closed under taking inverses). Let $`𝒴𝒳`$ be a symmetric subset which we shall call the set of non-zero letters or $`Y`$-letters. All other letters in $`𝒳`$ will be called $`0`$-letters.

By the $`Y`$-length of a word $`A`$, written $`|A|_Y`$ or just $`|A|`$, we mean the number of occurrences of $`Y`$-letters in $`A`$. The $`Y`$-length $`|g|_Y`$ of an element $`gG`$ is the length of the $`Y`$-shortest word representing element $`g`$.

Let $`𝐆(\mathrm{})`$ be the group given by the presentation $`𝒳|`$ inside the variety of Burnside groups of exponent $`n`$. We will choose a presentation of the group $`𝐆(\mathrm{})`$ in the class of all groups, that is we add enough relations of the form $`A^n=1`$ to ensure that $`𝐆(\mathrm{})`$ has exponent $`n`$. This infinite presentation will have the form $`𝒳|(\mathrm{})=𝒮_i`$ where sets $`𝒮_i`$ will be disjoint, and relations from $`𝒮_i`$ will be called relations of rank  $`i`$. Unlike \[30, Chapter 6\], $`i`$ runs over $`0,1/2,1,2,3,\mathrm{}.`$ ($`i=0,1,2,\mathrm{}`$ in \[30, Chapter 6\].) The set $``$ will be equal to $`𝒮_0𝒮_{1/2}`$. The detailed description of sets $`𝒮_i`$ will be given below. We shall call this presentation of $`𝐆(\mathrm{})`$ a graded presentation. Our goal is the same as in : we want every diagram over $`(\mathrm{})`$ to be an A-map.

We are going to prove that this goal is possible to achieve if $``$ satisfies conditions (Z1), (Z2), (Z3) presented below. While listing these conditions, we also fix some notation and definitions.

* The set $``$ is the union of two disjoint subsets $`𝒮_0=_0`$ and $`𝒮_{1/2}`$. The group $`𝒳|𝒮_0`$ is denoted by $`𝐆(0)`$ and is called the group of rank $`0`$. We call relations from $`𝒮_0`$ relations of rank 0. The relations from $`𝒮_{1/2}`$ have rank $`1/2.`$ The group $`𝒳|`$ is denoted by $`𝐆(1/2).`$

+ The set $`𝒮_0`$ consists of all relations from $``$ which have $`Y`$-length $`0`$ and all relations of $``$ which have the form (up to a cyclic shift) $`ay_1by_2^1=1`$ where $`y_1,y_2Y^+`$, $`a`$ and $`b`$ are of $`Y`$-length $`0`$ (i.e. $`0`$-words).
    + The set $`𝒮_0`$ implies all Burnside relations $`u^n=1`$ of $`Y`$-length 0.

The subgroup of $`𝐆(0)`$ generated by all $`0`$-letters will be called the $`0`$-subgroup of $`𝐆(0)`$. Elements from this subgroup are called $`0`$-elements. Elements which are not conjugates of elements from the $`0`$-subgroup will be called essential. An essential element $`g`$ from $`𝐆(0)`$ is called cyclically $`Y`$-reduced if $`|g^2|_Y=2|g|_Y`$. We shall show that $`g`$ is cyclically $`Y`$-reduced if and only if it is cyclically minimal (in rank 0), i.e. it is not a conjugate of a $`Y`$-shorter element in $`𝐆(0)`$ (Lemma 3.5).

Notice that condition (Z1.1) allows us to consider $`Y`$-bands in van Kampen diagrams over $`𝒮_0`$. Maximal $`Y`$-bands do not intersect.

* The relators of the set $`𝒮_{1/2},`$ will be called hubs. The corresponding cells in van Kampen diagrams are also called hubs. They satisfy the following properties

+ The $`Y`$-length of every hub is at least $`n`$.
    + Every hub is linear in $`Y,`$ i.e. contains at most one occurrence $`y^{\pm 1}`$ for every letter $`yY.`$
    + Assume that each of words $`v_1w_1`$ and $`v_2w_2`$ is a cyclic permutation of a hub or of its inverse, and $`|v_1|\epsilon |v_1w_1|.`$ Then an equality $`u_1v_1=v_2u_2`$ for some 0-words $`u_1,`$ $`u_2,`$ implies in $`𝐆(0)`$ equality $`u_2w_1=w_2u_1`$ (see Figure 6).

    Fig. 6.

A word $`B`$ over $`𝒳`$ is said to be cyclically minimal in rank $`1/2`$ if it is not a conjugate in $`𝐆(1/2)`$ of a word of smaller $`Y`$-length. An element $`g`$ of $`𝐆(0)`$ is called cyclically minimal in rank $`1/2`$ if it is represented by a word which is cyclically minimal in rank $`1/2`$.

* With every essential element $`g𝐆(0)`$ we associate a subgroup $`\mathrm{𝟎}(g)𝐆(0)`$, normalized by $`g`$. If $`g`$ is cyclically $`Y`$-reduced, let $`\mathrm{𝟎}(g)`$ be the maximal subgroup consisting of $`0`$-elements which contains $`g`$ in its normalizer. By Lemmas 3.3 (2) and 3.4 (3) below arbitrary essential element $`g`$ is equal to a product $`vuv^1`$ where $`u`$ is cyclically $`Y`$-reduced. In this case we define $`\mathrm{𝟎}(g)=v\mathrm{𝟎}(u)v^1.`$ We shall prove in Lemma 3.7 that $`\mathrm{𝟎}(g)`$ is well defined.

+ Assume that $`g`$ is an essential cyclically minimal in rank $`1/2`$ element of $`𝐆(0)`$ and for some $`x𝐆(0)`$, both $`x`$ and $`g^4xg^4`$ are 0-elements. Then $`x\mathrm{𝟎}(g).`$
    + For every essential cyclically minimal in rank $`1/2`$ element $`g𝐆(0)`$ there exists a $`0`$-element $`r`$ such that $`gr^1`$ commutes with every element of $`\mathrm{𝟎}(g)`$.777At the beginning of May 2002, influenced by the talk by Sergei Ivanov at the Geometric Group Theory conference in Montreal, we realized that Condition (Z3.2) can be replaced by the following weaker condition: (Z3.2’) For every essential cyclicly minimal in rank $`1/2`$ element $`g𝐆(0)`$, the extension of $`\mathrm{𝟎}(g)`$ by the automorphism induced by $`g`$ (acting by conjugation) satisfies the identity $`x^n=1`$. It is clear, that in the proof of Lemma 3.12 below (the only lemma in this paper, where (Z3.2) is used), property (Z3.2) can be replaced by (Z3.2’).

In this section, we show how the theory from \[30, Chapter 6\] can be adapted to diagrams over a presentation satisfying (Z1), (Z2), (Z3).

### 3.2 Corollaries of (Z1), (Z2), (Z3)

Here we are going to deduce some useful facts about groups $`𝐆(0)`$ whose presentations satisfy (Z1), (Z2), (Z3). (Some of them can be deduced from a presentation of $`𝐆(0)`$ as an HNN-extension.)

The following lemma is obvious.

###### Lemma 3.1.

If the set $``$ satisfies property (Z1.1) then there exists a homomorphism from $`𝐆(0)`$ to the group of integers $`𝐙`$ which sends every $`Y`$-letter to $`1`$ and every $`0`$-letter to $`0`$.

###### Lemma 3.2.

Suppose that $``$ satisfies (Z1.1). Let $`\mathrm{\Delta }`$ be a van Kampen diagram over $`𝒮_0`$ and $`p`$ be a subpath of the boundary $`(\mathrm{\Delta })`$. Suppose that a $`Y`$-band starting on $`p`$ ends on $`p^1`$. Then $`\varphi (p)`$ contains a subword of $`Y`$-length 2 which is equal to a $`0`$-word in $`𝐆(0)`$.

###### Proof.

Since maximal $`Y`$-bands cannot intersect, there exists a $`Y`$-band $`𝒯`$ starting on edge $`e`$ and ending on edge $`f^1`$, where $`e,fp`$, such that the shortest subpath $`p_1`$ of $`p`$ containing $`e`$ and $`f`$ has length $`2`$. Let $`\mathrm{\Delta }_1`$ be the subdiagram of $`\mathrm{\Delta }`$ bounded by $`p_1`$ and one of the sides $`q_1`$ of $`𝒯`$. The word $`\varphi (q_1)`$ is a $`0`$-word, so $`\varphi (p_1)`$ is a subword of $`A`$ of $`Y`$-length $`2`$ which is equal to a $`0`$-word in $`𝐆(0)`$. ∎

A word $`A`$ which does not contain a subword of $`Y`$-length 2 that is equal to a 0-word in $`𝐆(0)`$, will be called $`Y`$-reduced. A word $`A`$ is called cyclically $`Y`$-reduced if every cyclic shift of $`A`$ is $`Y`$-reduced.

###### Lemma 3.3.

Suppose that $``$ satisfies (Z1.1). Then the following conditions hold.

(1) Let $`A`$ be a word representing an element $`g𝐆(0)`$, but $`|A|_Y>|g|_Y`$. Then $`A`$ is not $`Y`$-reduced.

(2) If $`A`$ is a $`Y`$-reduced word that represents a conjugate of an essential element $`g`$, but it is not a shortest word representing a conjugate of $`g`$, then the word $`A`$ has the form as a product $`UVU^{}`$ where $`|U|_Y>0`$ and $`U^{}U`$ is equal to a $`0`$-word in $`𝐆(0)`$, $`V`$ is a cyclically $`Y`$-reduced word.

###### Proof.

(1) Let $`B`$ be a $`Y`$-shortest word representing $`g`$. Then there exists a diagram over $`𝒮_0`$ with boundary $`pq`$ where $`\varphi (p)A`$, $`\varphi (q)B^1`$.

Condition (Z1.1) imply that every $`Y`$-edge on $`A`$ is the start edge of a maximal $`Y`$-band. Each of these $`Y`$-bands ends on the boundary of $`\mathrm{\Delta }`$. Since $`|A|_Y>|B|_Y`$, one of the $`Y`$-bands starting on $`p`$ ends on $`p`$. By Lemma 3.2 there exists a subword of $`A`$ of length $`2`$ which is equal to a $`0`$-word in $`𝐆(0)`$.

To prove part (2), one can take an annular diagram instead of a disc diagram as in part (1), and prove that a cyclic shift of $`A`$ has a subword of $`Y`$-length 2 which is equal to a $`0`$-word in $`𝐆(0)`$. Hence $`AUVU^{}`$ where $`|U|_Y>0`$, $`U^{}U`$ is equal to a $`0`$-word $`W`$ in $`𝐆(0)`$. Since the word $`VW`$ represents a conjugate of $`g`$ and is shorter than $`A`$, we can conclude the proof by induction on $`|A|_Y`$. ∎

###### Lemma 3.4.

Suppose that $``$ satisfies (Z1.1). Then the following statements are true.

1. If $`g𝐆(0)`$ and $`A`$ is a $`Y`$-reduced word representing $`g`$ then there exists a decomposition $`AA_1A_2`$ such that the element represented by $`A_2A_1`$ is cyclically $`Y`$-reduced in $`𝐆(0)`$.
2. If $`g𝐆(0)`$ is cyclically $`Y`$-reduced then for every integer $`m`$, $`|g^m|_Y=|m||g|_Y`$ and $`g^m`$ is cyclically $`Y`$-reduced.
3. If $`g`$ is cyclically $`Y`$-reduced and $`A`$ is a $`Y`$-shortest word representing $`g`$ in $`𝐆(0)`$ then $`A`$ is cyclically $`Y`$-reduced.

###### Proof.

(1) By Lemma 3.3 (1) we can suppose that $`A`$ is a $`Y`$-shortest word representing $`g`$. Let $`B`$ be a shortest word representing $`g^2`$. If $`|B|_Y=2|A|_Y`$ then $`g`$ is cyclically $`Y`$-reduced. Suppose that $`2|A|_Y>|B|_Y`$. By Lemma 3.3 there exists a subword $`C`$ of $`A^2`$ of $`Y`$-length $`2`$ which is equal to a $`0`$-word $`D`$ in $`𝐆(0)`$. By Lemma 3.1 we can assume that $`Cy_1uy_2^1`$ (or $`Cy_1^1uy_2`$) where $`u`$ is a $`0`$-word and $`y_1,y_2Y^+`$.

Since $`A`$ is $`Y`$-reduced, one can represent $`A`$ as $`u_2y_2^1A_1y_1u_1`$ where $`u_1u_2u`$. Then the cyclic shift $`A_1y_1uy_2`$ of $`A`$ can be represented by $`A_1D`$ which is a reduced word. Since this word is $`Y`$-shorter than $`A`$ we can apply induction and conclude that there exists a cyclic shift of $`A_1D`$ which represents a cyclically reduced element.

(2) Let $`A`$ be a shortest word representing $`g`$. Suppose that for some $`m>0`$, $`A^m`$ is not a shortest word representing $`g^m`$. Then by Lemma 3.3 $`A^m`$ contains a subword of $`Y`$-length 2 which is equal to a $`0`$-word in $`𝐆(0)`$. But then the same subword occurs in $`A^2`$, so $`A^2`$ is not a shortest word representing $`g^2`$, a contradiction.

(3) Notice that for every cyclic shift $`A_1`$ of $`A`$, $`A_1^2`$ is a subword of $`A^3`$. It remains to apply part (2) of this lemma. ∎

###### Lemma 3.5.

Suppose that $``$ satisfies (Z1.1). Let $`A`$ be a $`Y`$-shortest word representing an essential element $`g`$ in $`𝐆(0)`$.

Then the following conditions are equivalent:

(i) $`A`$ is cyclically $`Y`$-reduced;

(ii) $`g`$ is cyclically minimal in $`𝐆(0)`$ (that is $`g`$ is not conjugate in $`𝐆(0)`$ of an element of a smaller $`Y`$-length);

(iii) $`g`$ is cyclically $`Y`$-reduced in $`𝐆(0)`$ (that is $`|g^2|_Y=2|g|_Y`$).

###### Proof.

(i)$``$(ii). Suppose that every cyclic shift of $`A`$ is $`Y`$-reduced. Then $`A`$ cannot be represented in the form $`UVU^{}`$ where $`|U|_Y>0`$ and $`U^{}U`$ is equal to a $`0`$-word in $`𝐆(0)`$. Therefore by Lemma 3.3 (2), $`A`$ is a shortest word among all words representing conjugates of $`g`$. Hence $`g`$ is not a conjugate of a shorter word, so $`g`$ is cyclically minimal.

(ii)$``$(iii). Suppose that $`g`$ is cyclically minimal but $`|g^2|_Y<2|g|_Y`$. Then $`A^2`$ is not a shortest word representing $`g^2`$. By Lemma 3.3 (1), $`A^2`$ is not $`Y`$-reduced, which means that $`A^2`$ contains a subword $`W`$ of $`Y`$-length $`2`$ which is equal to a 0-word in $`𝐆(0)`$. Since $`A`$ is reduced (by assumption it is a shortest word representing $`g`$), $`WU^{}U`$ where $`U^{}`$ is a suffix of $`A`$, $`U`$ is a prefix of $`A`$. By Lemma 3.1, $`|A|_Y2`$. Hence $`AUVU^{}`$ for some word $`V`$. The cyclic shift $`VU^{}U`$ of $`A`$ is not $`Y`$-reduced, so it represents an element of $`𝐆(0)`$ which is shorter than $`g`$. Hence $`g`$ is a conjugate of a shorter element, a contradiction.

(iii)$``$ (i). This follows directly from Lemma 3.4 (3). ∎

###### Lemma 3.6.

Suppose that $``$ satisfies (Z1.1). Let $`x`$ and $`g^1xg`$ be $`0`$-elements and $`g=hf`$ where $`|g|=|f|+|h|.`$ Then $`h^1xh`$ is also an $`0`$-element.

###### Proof.

Let $`X,G,H`$ be $`Y`$-reduced words representing the elements $`x,g,h,`$ respectively. By Lemma 3.3, the only possible reduction of the word $`G^1XG`$ can be fulfilled in the middle of it. Then, after $`|h|`$ such reductions, we will see that the subword $`HXH^1`$ is equal to a $`0`$-word. ∎

The next several lemmas deal with the subgroups $`\mathrm{𝟎}(g)`$ in property (Z3).

###### Lemma 3.7.

Suppose that $``$ satisfies (Z1.1). Then:

(1) the subgroup $`\mathrm{𝟎}(g)`$ is well-defined, i.e. $`v\mathrm{𝟎}(u)v^1`$ does not depend on the presentation $`vuv^1`$ of an element $`g`$ where $`u`$ is cyclically $`y`$-reduced.

(2) For every $`h𝐆(0)`$ and every essential $`g,`$ we have $`\mathrm{𝟎}(hgh^1)=h\mathrm{𝟎}(g)h^1.`$

###### Proof.

Assume that $`g=v^{}u^{}(v^{})^1`$ and $`v^{}\mathrm{𝟎}(u^{})(v^{})^1v\mathrm{𝟎}(u)v^1.`$ Then

$$\mathrm{𝟎}(u^{})(v^{})^1v\mathrm{𝟎}(u)v^1v^{}.$$

Thus, to prove the statement, one may assume that $`g`$ is cyclically $`Y`$-reduced. Therefore one has to obtain equality $`\mathrm{𝟎}(g)=v\mathrm{𝟎}(u)v^1`$ for the maximal 0-subgroups $`\mathrm{𝟎}(g)`$ and $`\mathrm{𝟎}(u)`$ normalized by $`g`$ and $`u,`$ respectively. By the symmetry, it suffices to prove that $`v\mathrm{𝟎}(u)v^1`$ is a 0-subgroup, because it is normalized by $`g=vuv^1.`$

Let $`G,U,V`$ be shortest words representing elements $`g,u,v.`$ Then there is an annular diagram diagram over $`𝐆(0)`$ whose boundary labels are $`G\varphi (q_1)`$ and $`U\varphi (q_2^1)`$ and a path $`t`$, connecting the initial vertices of $`q_1`$ and $`q_2`$ is labeled by $`V.`$ Arbitrary $`Y`$-band starting with $`q_1`$ ends on $`q_2,`$ and vise versa, since $`g`$ and $`u`$ are cyclically $`Y`$-reduced. Since these words are essential, $`(q_1)_{}`$ can be connected with a vertex of $`q_2`$ by a path $`p`$ with label $`P`$ where $`|P|=0`$. It defines a decomposition $`UU_1U_2.`$ Hence $`V=PU_1^1U^k`$ in $`𝐆(0)`$ for some integer $`k`$ by Lemma 11.4 from .

Now, $`U^k\mathrm{𝟎}(U)U^k=\mathrm{𝟎}(U),`$ by the definition of $`\mathrm{𝟎}(U)=\mathrm{𝟎}(u).`$ Then $`U_1^1\mathrm{𝟎}(U)U_1`$ is also a 0-subgroup by Lemma 3.6 since the word $`UU_1U_2`$ normalizes $`\mathrm{𝟎}(U).`$ Finally, $`V\mathrm{𝟎}(U)V^1=P(U_1^1\mathrm{𝟎}(U)U_1)P^1`$ is a 0-subgroup because $`P`$ is a $`0`$-word.

The second statement of the lemma immediately follows from the first one. ∎

###### Lemma 3.8.

Suppose that $``$ satisfies (Z1.1). If $`g`$ is an essential cyclically $`Y`$-reduced element of $`𝐆(0)`$ and $`x\mathrm{𝟎}(g)`$ then $`g^sx`$ is an essential and cyclically $`Y`$-reduced element for $`s0`$ .

###### Proof.

Suppose that $`g^sx=h^1uh`$ for $`0`$-element $`u`$ and $`h𝐆(0)`$. Then the $`Y`$-length of $`(g^sx)^m`$ is at most $`2|h|_Y`$ for every integer $`m0`$. On the other, we have $`(g^sx)^m=g^{sm}x_1`$ for some $`0`$-element $`x_1\mathrm{𝟎}(g)`$ since the 0-subgroup $`\mathrm{𝟎}(g)`$ is normalized by $`g`$ . Therefore $`g^{sm}=h^1u^mhx_1^1`$ and the $`Y`$-length of $`g^{sm}`$ is at most $`2|h|_Y`$ for every integer $`m`$. This contradicts the fact that $`g^{sm}`$ is cyclically $`Y`$-reduced by the second part of Lemma 3.4.

Similarly if $`g^sx`$ is not cyclically $`Y`$-reduced then $`|(g^sx)^2|_Y<2|g^sx|_Y=2|g^s|_Y`$. Therefore for some $`0`$-element $`x_1`$ we have $`|g^{2s}|_Y=|g^{2s}x_1|_Y=|(g^sx)^2|<2|g^s|_Y`$ which contradicts Lemma 3.4 (2). ∎

###### Lemma 3.9.

Suppose that $``$ satisfies (Z1.1). If $`g`$ is an essential element and $`x\mathrm{𝟎}(g)`$ then $`\mathrm{𝟎}(gx)=\mathrm{𝟎}(g)`$.

###### Proof.

By Lemma 3.7 we can assume that $`g`$ is cyclically $`Y`$-reduced. Since $`x\mathrm{𝟎}(g)`$, the subgroup $`\mathrm{𝟎}(g)`$ which is normalized by $`g`$, is also normalized by $`gx`$. Since by Lemma 3.8, $`gx`$ is also cyclically $`Y`$-reduced, we have $`\mathrm{𝟎}(g)\mathrm{𝟎}(gx)`$. In particular $`x\mathrm{𝟎}(gx)`$, so $`x^1\mathrm{𝟎}(gx)`$. Therefore, as above, $`\mathrm{𝟎}(gx)\mathrm{𝟎}(gxx^1)=\mathrm{𝟎}(g)`$. Hence $`\mathrm{𝟎}(g)=\mathrm{𝟎}(gx)`$. ∎

###### Lemma 3.10.

Suppose that $``$ satisfies (Z1.1). If $`g`$ is an essential element then for every integer $`m0,`$ element $`g^m`$ is essential and $`\mathrm{𝟎}(g^m)=\mathrm{𝟎}(g)`$

###### Proof.

By Lemma 3.7 we can assume that $`g`$ is cyclically $`Y`$-reduced. By Lemma 3.4 (2) one may assume that $`g^m`$ is also cyclically $`Y`$-reduced. Then $`g^m`$ is essential by lemmas 3.4 (2) and 3.3, and subgroups $`\mathrm{𝟎}(g)`$ and $`\mathrm{𝟎}(g^m)`$ are 0-subgroups. It is clear that $`\mathrm{𝟎}(g)\mathrm{𝟎}(g^m)`$. Let $`x\mathrm{𝟎}(g^m)`$. Then $`x\mathrm{𝟎}(g^{ms})`$ for any $`s0`$. Take any integer $`t0`$. We need to show that $`g^txg^t`$ is a $`0`$-word. But we may choose $`s`$ so that $`g^{ms}=g^tg^t^{}`$ for some $`t^{}`$ and $`|g^{ms}|=|g^t|+|g^t^{}|`$ by Lemma 3.3. Then $`g^txg^t`$ is a 0-word by Lemma 3.6. ∎

###### Lemma 3.11.

Suppose that $``$ satisfies (Z1.1). If $`g`$ is an essential element of $`𝐆(0)`$ and $`x\mathrm{𝟎}(g)`$, $`l0`$, then $`g^lx`$ is an essential element and $`\mathrm{𝟎}(g^lx)=\mathrm{𝟎}(g)`$.

###### Proof.

The claim follows immediately from lemmas 3.10, 3.9, 3.8 and 3.7. ∎

###### Lemma 3.12.

Suppose that $``$ satisfies conditions (Z1.1), (Z1.2) and (Z3.2). Then for every essential element $`g𝐆(0)`$ which is cyclically minimal in rank $`1/2`$, and every $`x\mathrm{𝟎}(g)`$, we have $`(gx)^n=g^n`$.

###### Proof.

By the definition of $`\mathrm{𝟎}(g)`$ and Lemma 3.7, we can assume that $`g`$ is cyclically reduced and $`x`$ is a 0-element. We have $`(gx)^n=g^n(g^{n+1}xg^{n1})\mathrm{}(g^1xg)x`$. By by property (Z3.2), there exists a $`0`$-element $`r`$ such that $`gr^1`$ commutes with every element of $`\mathrm{𝟎}(g)`$. Therefore $`r`$ also normalizes $`\mathrm{𝟎}(g)`$ and the actions of $`r`$ and $`g`$ on $`\mathrm{𝟎}(g)`$ (by conjugation) coincide. Hence for every integer $`s`$ the actions of $`r^s`$ and $`g^s`$ on $`\mathrm{𝟎}(g)`$ also coincide, so $`g^sxg^s=r^sxr^s`$. Therefore

$$(g^{n+1}xg^{n1})\mathrm{}(g^1xg)x=(r^{n+1}xr^{n1})\mathrm{}(r^1xr)x=r^n(rx)^n.$$

By property (Z1.2) $`(rx)^n=r^n=1`$ in $`𝐆(0)`$. Hence $`(gx)^n=g^n`$. ∎

###### Lemma 3.13.

Suppose that $``$ satisfies conditions (Z1.1), (Z1.2), (Z3.2). Then for every essential element $`g𝐆(0)`$ which is cyclically minimal in rank $`1/2`$, and every $`x\mathrm{𝟎}(g)`$ we have $`g^nx=xg^n`$.

###### Proof.

It follows from Lemma 3.12 that $`g^n`$ commutes with both $`g`$ and $`gx`$. Therefore it commutes with $`x`$. ∎

###### Lemma 3.14.

Suppose that $``$ satisfies (Z1.1). Let $`A`$ be a $`Y`$-reduced essential word over $`𝒳`$ (i.e. it represents an essential element in $`𝐆(0)`$) and let $`C`$ be a 0-word. Suppose that the subgroup generated by $`A^sCA^s`$ for all integers $`s`$ consists of $`0`$-elements. Then $`C\mathrm{𝟎}(A)`$.

###### Proof.

If $`A`$ is cyclically $`Y`$-reduced then $`C\mathrm{𝟎}(A)`$ by definition. Otherwise by Lemma 3.3 (2), $`A`$ can be represented as $`UVU^{}`$ where $`U^{}U`$ is equal to a 0-word $`W`$ in $`𝐆(0)`$ and $`V`$ is cyclically $`Y`$-reduced, so every cyclic shift of $`V`$ is $`Y`$-reduced. Since we assume that $`A`$ is essential, $`VW`$ is an essential word. By Lemma 3.3 (1) then every cyclic shift of $`VW`$ is $`Y`$-reduced. Hence $`VW`$ is cyclically $`Y`$-reduced. By Lemma 3.6, $`U^1CU`$ is a $`0`$-element. Since the subgroup generated by $`A^sCA^s`$, $`s`$ consists of $`0`$-elements and is normalized by $`A`$, $`U(VW)^s(U^1CU)(VW)^s)U^1`$ is a $`0`$-element for every $`s`$.

Notice that $`U(VW)^sU^1`$ is a $`Y`$-reduced form of $`A^s`$. Indeed, $`V`$ is cyclically $`Y`$-reduced subword of $`A`$ by definition, $`VW`$ is a conjugate of $`A`$ of the same $`Y`$-length as $`V`$. Hence by Lemma 3.3 (2), $`VW`$ is cyclically $`Y`$-reduced. By Lemma 3.4 (2) then $`(VW)^s`$ is cyclically $`Y`$-reduced. By Lemma 3.3(1), $`U(VW)^sU^1`$ is reduced because every subword of $`Y`$-length $`2`$ of $`U(VW)^sU^1`$ is either a subword of $`A`$ or a subword of $`(VW)^s`$.

Since $`A^sCA^s=U(VW)^s(U^1CU)(VW)^s)U^1`$ is a $`0`$-element for every $`s`$, and $`U^{}WU^1`$ is a suffix of $`A^s`$, by Lemma 3.6, the subgroup generated by $`(VW)^s(U^1CU)(VW)^s`$ consists of $`0`$-elements and is normalized by $`U^1AU=VW`$. Hence $`U^1CU`$ is in $`\mathrm{𝟎}(U^1AU)`$. Therefore $`C\mathrm{𝟎}(A)`$ by Lemma 3.7. ∎

###### Lemma 3.15.

Suppose that $``$ satisfies (Z1.1), (Z1.2), (Z3.1) and (Z3.2). Let $`g`$ be an essential element of $`𝐆(0)`$ represented by a cyclically $`Y`$-reduced word $`A`$ in $`𝐆(0)`$. Suppose that $`A`$ contains a subword $`B^6`$, where $`B`$ is a cyclically minimal in rank $`1/2`$ word of a positive $`Y`$-length. Let $`A^{}`$ be the word obtained by replacing that occurrence of $`B^6`$ by $`B^{6n}`$. Then $`\mathrm{𝟎}(A)\mathrm{𝟎}(A^{}),`$ provided the word $`A^{}`$ represents an essential element of $`𝐆(0)`$.

###### Proof.

Let $`x\mathrm{𝟎}(A)`$. Then for every integer $`s`$, $`g^sxg^s`$ is a $`0`$-element. Fix $`s>0`$. Let $`C`$ be a $`0`$-word representing $`x`$, $`D`$ be the word representing $`g^sxg^s`$. Notice that $`B^6`$ contains the fifth power of every cyclic shift of $`B`$. Let $`B_1`$ be a cyclic shift of $`B`$ starting with a letter from $`Y`$. Let $`AA_1B_1^5A_2`$. Clearly then the word $`A^{}`$ obtained from $`A`$ by replacing $`B^6`$ by $`B^{6n}`$ is equal to $`A_1B_1^{5n}A_2`$ in the free group.

Consider a van Kampen diagram over $`𝐆(0)`$ with boundary label $`p_1q_1p_2^1q_2^1`$ where $`\varphi (p_1)=C`$, $`\varphi (p_2)=D`$, $`\varphi (q_1)=\varphi (q_2)=A^s`$. The path $`q_1`$ can be represented as

$$q_1=t_{1,1}t_{1,2}t_{1,3}t_{1,4}t_{2,1}t_{2,2}t_{2,3}t_{2,4}\mathrm{}t_{s,1}t_{s,2}t_{s,3}t_{s,4}$$

where $`\varphi (t_{i,2})B_1^4`$, $`\varphi (t_{i,3})B_1`$, $`i=1,\mathrm{},s`$ ($`\varphi (t_{i,2}t_{i,3})`$ is the fixed occurrence of $`B_1^5`$ in $`A`$).

Since $`A^s`$ is $`Y`$-reduced and $`p_1,p_2`$ do not contain $`Y`$-edges, the maximal $`Y`$-bands starting on $`q_1`$ provide a one-to-one correspondence between $`Y`$-edges of $`q_1`$ and $`Y`$-edges of $`q_2`$. Since $`B_1`$ starts with a $`Y`$-letter, $`t_{i,2}`$ and $`t_{i,3}`$ start with a $`Y`$-edges, $`e_i`$ and $`f_i`$ respectively, $`i=1,\mathrm{},s`$.

For every $`i=1,\mathrm{},s`$, consider the maximal $`Y`$-band $`𝒯_i`$ starting on $`e_i`$ and the maximal $`Y`$-band $`_i`$ starting on $`f_i`$. Consider the smallest subdiagram $`\mathrm{\Delta }_i`$ bounded by a side of $`𝒯_i`$, a side of $`_i`$, $`q_1`$, $`q_2`$, containing $`𝒯_i`$ but not containing $`_i`$. The boundary of each $`\mathrm{\Delta }_i`$ has the form $`p_i^{}t_{i,2}(p_i^{\prime \prime })^1(t_i^{})^1`$ where $`\varphi (t_{i,2})\varphi (t_i^{})B_1^4`$, $`v_i\varphi (p_i^{})`$ and $`v_i^{}\varphi (p_i^{\prime \prime })`$ are $`0`$-words. Therefore

$$B_1^4v_iB_1^4=v_i^{}$$

for every $`i=1,\mathrm{},s`$.

By Property (Z3.1) (all premises of (Z3.1) hold), $`v_i\mathrm{𝟎}(B_1)`$. By Lemma 3.13, $`v_i`$ commutes with $`B_1^n`$. For every $`i=1,\mathrm{},s`$ consider a van Kampen diagram $`\mathrm{\Gamma }_i`$ over $`𝐆(0)`$ with boundary $`\overline{p}_i\overline{q}_i(\overline{p}_i^{})^1(\overline{q}_i^{})^1`$ where $`\varphi (\overline{p}_i)\varphi (\overline{p}_i^{})v_i`$, $`\varphi (\overline{q}_i)\varphi (\overline{q}_i^{})B_1^n`$. Now cut the diagram $`\mathrm{\Delta }`$ along each path $`p_i`$. Thus each path $`p_i^{}`$ turns into two copies of $`p_i^{}`$, which we shall call the left copy and the right copy: the right copy is contained in the diagram containing the band $`𝒯_i`$. For every $`i=1,\mathrm{},s`$, identify paths $`\overline{p}_i`$ of $`\mathrm{\Gamma }_i`$ with the left copy of $`p_i`$, $`\overline{p}_i^{}`$ with the right copy of $`p_i`$, $`i=1,\mathrm{},s`$. As a result, we get a van Kampen diagram with boundary label $`(A_1B_1^nB_1^5A_2)^sC(A_1B_1^nB_1^5A_2)^sD^1`$. Since as we have noticed, $`A_1B_1^{5n}A_2=A^{}`$, we have that $`(A^{})^sC(A^{})^s=D`$ in $`𝐆(0)`$ for every positive $`s`$. The same result for negative $`s`$ can be proved similarly.

Hence the subgroup generated by $`(A^{})^sC(A^{})^s`$, $`s`$, consists of $`0`$-elements and is normalized by $`A^{}`$. By Lemma 3.14, $`C\mathrm{𝟎}(A^{})`$ as required. ∎

###### Lemma 3.16.

Suppose that $``$ satisfies (Z1.1), (Z2.1), (Z2.2), (Z2.3). Let $`g`$ be an essential element of $`𝐆(0)`$ represented by a cyclically $`Y`$-reduced word $`A`$ in $`𝐆(0)`$. Suppose that $`A`$ contains a subword $`B`$ which is a prefix of a cyclic shift $`C`$ of a hub, $`CBB^{}`$, and $`|B|\epsilon |C|`$. Let $`A^{}`$ be the word obtained by replacing that occurrence of $`B`$ by $`(B^{})^1`$. Then, provided $`A^{}`$ represents an essential element of $`𝐆(0),`$ we have inclusion $`\mathrm{𝟎}(A)\mathrm{𝟎}(A^{})`$.

###### Proof.

The proof is similar to the proof of Lemma 3.15. Let $`x\mathrm{𝟎}(A)`$. Then for every integer $`s`$, $`g^sxg^s`$ is a $`0`$-element. Fix $`s>0`$. Let $`C`$ be a $`0`$-word representing $`x`$, $`D`$ be the word representing $`g^sxg^s`$. Since letters not from $`Y`$ have $`Y`$-length $`0`$, we can assume that $`B`$ starts and ends with $`Y`$-letters. Let $`AA_1BA_2`$. Clearly then the word $`A^{}`$ obtained from $`A`$ by replacing $`B`$ by $`(B^{})^1`$ is equal to $`A_1(B^{})^1A_2`$ in the free group.

Consider a van Kampen diagram with boundary label $`p_1q_1p_2^1q_2^1`$ where $`\varphi (p_1)C`$, $`\varphi (p_2)D`$, $`\varphi (q_1)\varphi (q_2)A^s`$. The path $`q_1`$ can be represented as

$$q_1=t_{1,1}t_{1,2}t_{1,3}t_{2,1}t_{2,2}t_{2,3}\mathrm{}t_{s,1}t_{s,2}t_{s,3}$$

where $`\varphi (t_{i,2})B`$, $`i=1,\mathrm{},s`$ ($`\varphi (t_{i,2})`$ is the fixed occurrence of $`B`$ in $`A`$).

Since $`A^s`$ is $`Y`$-reduced by Lemma 3.4 (2), and $`p_1,p_2`$ do not contain $`Y`$-edges, the maximal $`Y`$-bands starting on $`q_1`$ provide a one-to-one correspondence between $`Y`$-edges of $`q_1`$ and $`Y`$-edges of $`q_2`$. Since $`B`$ starts and ends with a $`Y`$-letter, $`t_{i,2}`$ starts and ends with a $`Y`$-edges, $`e_i`$ and $`f_i`$ respectively, $`i=1,\mathrm{},s`$.

For every $`i=1,\mathrm{},s`$, consider the maximal $`Y`$-band $`𝒯_i`$ starting on $`e_i`$ and the maximal $`Y`$-band $`_i`$ starting on $`f_i`$. Consider the smallest subdiagram $`\mathrm{\Delta }_i`$ bounded by a side of $`𝒯_i`$, a side of $`_i`$, $`q_1`$, and $`q_2`$, containing $`𝒯_i`$ and $`_i`$. The boundary of each $`\mathrm{\Delta }_i`$ has the form $`p_i^{}t_{i,2}(p_i^{\prime \prime })^1(t_i^{})^1`$ where $`\varphi (t_{i,2})\varphi (t_i^{})B`$, $`v_i\varphi (p_i^{})`$ and $`v_i^{}\varphi (p_i^{\prime \prime })`$ are $`0`$-words. Therefore

$$v_iB=Bv_i^{}$$

for every $`i=1,\mathrm{},s`$.

By Property (Z2.3) (all premises of (Z2.3) hold), we have

$$v_i(B^{})^1=(B^{})^1v_i^{},i=1,\mathrm{},s.$$

Thus for every $`i=1,\mathrm{},s`$ there exists a van Kampen diagram $`\mathrm{\Gamma }_i`$ over $``$ with boundary $`p_i^{}\overline{t}_{i,2}(p_i^{\prime \prime })^1(\overline{t}_i^{})^1`$ where $`\varphi (\overline{t}_{i,2})(B^{})^1`$, $`\varphi (\overline{t}_i^{})(B^{})^1`$. Now we can substitute the subdiagrams $`\mathrm{\Delta }_i`$ in $`\mathrm{\Delta }`$ by $`\mathrm{\Gamma }_i`$. The boundary label of the resulting diagram is equal $`(A^{})^sC(A^{})^sD^1`$. Hence $`(A^{})^sC(A^{})^s=D`$ in $`𝐆(0)`$ for every positive $`s`$. The same result for negative $`s`$ can be proved similarly.

Hence the subgroup generated by $`(A^{})^sC(A^{})^s`$, $`s`$, consists of $`0`$-elements and is normalized by $`A^{}`$. By Lemma 3.14 $`C\mathrm{𝟎}(A^{})`$ as required. ∎

### 3.3 The construction of a graded presentation

In this section, we show how the theory from \[30, Chapter 6\] can be adapted to diagrams over a presentation satisfying (Z1), (Z2), (Z3).

We are defining several concepts analogous to concepts in , chapter 6, by induction on the rank $`i`$.

We say that a certain statement holds in rank $`i`$ if it holds in the group $`𝐆(i)`$ given by $`_i=_{j=0}^i𝒮_j`$.

Recall that a word $`w`$ is $`A`$-periodic if it is a subword of some power of the word $`A.`$ Any $`A`$-periodic word can be read (say, clockwise) on a cyclic graph with $`|A|`$ edges, labeled, starting with a vertex $`o,`$ by the word $`A.`$ Then every $`A`$-periodic word corresponds to a path on this graph. Let $`WW_1W_2`$ be a decomposition of an $`A`$-periodic word $`W,`$ such that the word $`W_1`$ ends at $`o,`$ when reading the word $`W`$ on the cyclic graph, $`|W||A|`$. Then we say that the decomposition is a phase decomposition of $`W.`$ If the label of a simple path $`p`$ of an arbitrary labeled graph has an $`A`$-periodic label $`W\varphi (p),`$ then a vertex of $`p,`$ defining a phase decomposition of $`p`$ is said to be a phase vertex of $`p.`$

Up to the end of this section, the $`Y`$-length of a word $`W`$ will be called simply length and will be denoted by $`|W|`$.

Let us define simple words of rank $`i=0,1/2,1,2,\mathrm{}`$ and periods of rank $`i=1,2,3,\mathrm{}`$. Let $`𝒮_0=_0`$ and $`𝒮_{1/2}`$ be the set of hubs. Thus the groups $`𝐆(0)`$ and $`𝐆(1/2)=𝐆`$ are defined by relations of the sets $`_0`$ and $`_{1/2}=𝒮_0𝒮_{1/2},`$ respectively. A word $`A`$ of positive length is said to be simple in rank 0 (resp. 1/2) if it is not a conjugate in rank 0 (resp. 1/2) either of a word of length 0 or of a product of the form $`B^lP`$, where $`|B|<|A|`$ and $`P\mathrm{𝟎}(B)`$ in rank 0.

Suppose that $`i1`$, and we have defined the sets of relators $`_j`$, $`j<i`$, and the corresponding groups $`𝐆(j)`$ of ranks $`j<i`$. Suppose also that we have defined simple words of ranks $`j`$, $`j<i`$, and periods of rank $`j`$, $`1j<i`$.

For every $`i=1/2,1,2,3,..`$ let $`i_{}`$ denote $`i1`$ if $`i>1`$, $`1/2`$ if $`i=1`$ or $`0`$ if $`i=1/2`$. Similarly $`i_+`$ is $`1/2`$ if $`i=0`$ or $`1`$ if $`i=1/2`$ or $`i+1`$ if $`i1`$.

For every $`i1`$ consider the set $`𝒳_i^{}`$ of all words of length $`i`$ which are simple in rank $`i_{}`$, and the equivalence $`_i_{}`$ given in Lemma 3.24 (we apply it for the smaller rank here). Now choose a set of representatives $`𝒳_i`$ of the equivalence classes of $`𝒳_i^{}`$. The words of $`𝒳_i`$ are said to be periods of rank $`i.`$ The set of words $`_i`$ (defining the group $`𝐆(i)`$ or rank $`i`$) is the union of $`_i_{}`$ and $`𝒮_i=\{A^n,A𝒳_i\}`$.

Let $`A`$ be a word of positive length. We say that $`A`$ is simple in rank $`i1`$ if it is not a conjugate in rank $`i`$ either of a word of length 0 or of a word of the form $`B^lP,`$ where $`B`$ is a period of rank $`ji`$ or an essential word with $`|B|<|A|`$, and $`P`$ represents a word of the subgroup $`\mathrm{𝟎}(B).`$

Let $`(\mathrm{})=_0^{\mathrm{}}_i`$. If $`\mathrm{\Pi }`$ is a cell of a diagram over $`(\mathrm{})`$ with the boundary labeled by a word of the set $`𝒮_j,`$ then, by definition, $`r(\mathrm{\Pi })=j.`$ The boundary label of every cell of a rank $`1`$ (read counterclockwise), has a period $`A`$ defined up to cyclic shifts.

For $`j1`$, a pair of distinct cells $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$ of rank $`j`$ of a diagram $`\mathrm{\Delta }`$ is said to be a $`j`$-pair, if their counterclockwise contours $`p_1`$ and $`p_2`$ are labeled by $`A^n`$ and $`A^n`$ for a period $`A`$ of rank $`j`$ and there is a path $`t=(p_1)_{}(p_2)_{}`$ without self-intersections such that $`\varphi (t)`$ is equal, in rank $`j_{}`$, to an element of $`\mathrm{𝟎}(A).`$ Then $`\varphi (t)`$ and $`A^n`$ commute in rank $`j_{}`$ by Lemma 3.13, and so the subdiagram with contour $`p_1tp_2t^1`$ can be replaced in $`\mathrm{\Delta }`$ by a diagram of rank $`j_{}`$. As a result, we obtain a diagram with the same boundary label as $`\mathrm{\Delta }`$ but of a smaller type.

Similarly, a pair of hubs $`\mathrm{\Pi }_1,`$ $`\mathrm{\Pi }_2`$ with counterclockwise contours $`p_1`$, $`p_2`$ forms a $`\frac{1}{2}`$-pair, if the vertices $`(p_1)_{}`$ and $`(p_2)_{}`$ are connected by a path $`t`$ without self-intersections such that the label of the path $`p_1tp_2t^1`$ is equal to 1 in $`𝐆(0).`$ Consequently, any diagram can be replaced by a diagram having no $`j`$-pairs, $`j=1/2,1,2,\mathrm{}`$, i.e. by a g-reduced diagram with the same boundary label(s)888Recall that in , $`\mathrm{\S }13.2,`$ such diagrams are called reduced. But in this paper we shall consider two kinds of reduced diagrams, so we call diagrams without $`j`$-pairs g-reduced; “g” stands for “graded”..

Assume that $`q_1`$ and $`q_2`$ are disjoint sections of the boundary $`(\mathrm{\Delta })`$ of a diagram $`\mathrm{\Delta }`$ of rank $`i,`$ and $`\varphi (q_1),\varphi (q_2)`$ are $`A`$\- and $`A^1`$-periodic words respectively, where $`|q_1|,|q_2||A|`$, $`A`$ is simple in rank $`i`$ or a period of rank $`ji`$ . We call $`q_1`$ and $`q_2`$ compatible if there exist phase vertices $`o_1`$ and $`o_2`$ on $`q_1`$ and $`q_2,`$ respectively, and a path $`t=o_1o_2`$ without self-intersections, such that $`\varphi (t)`$ is equal in rank $`i`$ to an element of $`\mathrm{𝟎}(A)`$; moreover the equality must be true in rank $`j_{}`$ if $`A`$ is a period of rank $`j.`$

Similarly one defines the compatibility of an $`A`$-periodic cell $`\mathrm{\Pi }`$ of rank $`j1`$ with a $`A^{\pm 1}`$-periodic section $`q`$ of $`(\mathrm{\Delta })`$.

###### Lemma 3.17.

Let $`\mathrm{\Pi }_1`$ be a cell of rank $`j1`$ in a g-reduced diagram $`\mathrm{\Delta }`$ of rank $`i`$. Assume it has a boundary label $`A^n`$. Let $`\mathrm{\Gamma }`$ be a subdiagram of $`\mathrm{\Delta }`$ with contour $`p_1q_1p_2q_2`$, where $`q_1`$ is a subpath of $`(\mathrm{\Pi }_1)`$ and $`q_2`$ is a subpath of the contour of a cell $`\mathrm{\Pi }_2`$ with the boundary label $`A^n`$, ($`\mathrm{\Pi }_1,\mathrm{\Pi }_2`$ do not belong to $`\mathrm{\Gamma }`$). Then

1) $`q_1`$ and $`q_2`$ cannot be compatible in $`\mathrm{\Gamma }`$;

2) the subdiagram $`\mathrm{\Gamma }`$ contains no cells compatible with $`q_1.`$

###### Proof.

If one of the statements were false, we could include the cell $`\mathrm{\Pi }_1`$ into a $`j`$-pair and come to an obvious contradiction with the assumption that $`\mathrm{\Delta }`$ is g-reduced diagram, as in Lemma 13.2 from . ∎

###### Lemma 3.18.

Let $`p_1,p_2\mathrm{}`$ be a partition of the boundary of a diagram $`\mathrm{\Delta }`$ of rank $`i`$ into several sections, and $`\varphi (p_1)A^l`$ for some period of rank $`j`$. Assume that a cell $`\mathrm{\Pi }`$ of $`\mathrm{\Delta }`$ is compatible with $`p_1`$. Then there exists a g-reduced diagram $`\mathrm{\Delta }^{}`$ with topologically identical partition of the boundary into $`p_1^{},p_2^{},\mathrm{},`$ such that $`\tau (\mathrm{\Delta }^{})<\tau (\mathrm{\Delta }),`$ $`\varphi (p_k^{})\varphi (p_k)`$ for $`k2,`$ $`\varphi (p_1^{})A^{l+sn}`$ for some integer $`s,`$ and $`\mathrm{\Delta }^{}`$ has no cells compatible with $`p_1.`$

###### Proof.

Let $`t`$ be the path connecting a phase vertex $`o_1`$ of $`p_1`$ and a phase vertex $`o_2`$ of the $`A^{\pm 1}`$-periodic cell $`\mathrm{\Pi },`$ according to the definition of the compatibility, and $`T\varphi (t)`$ is equal in rank $`i`$ to an element of $`\mathrm{𝟎}(A).`$ The vertex $`o_1`$ defines a decomposition $`A^{l_1}A^{l_2},`$ and there is a path $`p`$ homotopic to $`p_1`$ with label $`WA^{l_1}TA^{\pm n}T^1A^{l_2}.`$ By Lemma 3.13, we have $`W=A^{l\pm n}`$ in rank $`j_{}.`$ Thus one can cut $`\mathrm{\Pi }`$ out of $`\mathrm{\Delta },`$ by cutting along $`p`$. Then one can replace the deleted subdiagram by the diagram of the equality $`W=A^{l\pm n}.`$ By continuing this process, we prove the lemma. ∎

The following proposition is the main statement of this section.

###### Proposition 3.19.

If the presentation $``$ of a group $`𝐆`$ satisfies properties (Z1), (Z2), (Z3) then the graded presentation $`𝒮_0𝒮_{1/2}𝒮_1𝒮_2\mathrm{}`$ satisfies statements of Lemmas 3.20 through 3.39 below and is such that $`=𝒮_0𝒮_{1/2}`$. In particular, all g-reduced diagrams over this presentation are $`A`$-maps. Every relator from $`𝒮_i`$, $`i1`$, is of the form $`A^n`$ for a cyclically reduced word $`A`$ of $`Y`$-length $`i`$. The group defined by this presentation is $`𝐆/g^n,g𝐆`$.

Lemmas from 3.20 to 3.39 will be proved by simultaneous induction on rank $`i\frac{1}{2}.`$

###### Lemma 3.20.

Let $`V`$ be a periodic word with a simple in rank $`i`$ period. Assume that for some word $`U`$ with $`2|U||V|`$, the word $`VU`$ is a conjugate in rank $`i`$ of a 0-word. Then there is a decomposition $`VV_1V_2,`$ such that $`||V_1||V_2||<\beta |V|+|U|`$ and for some word $`S`$ of length at most $`3\gamma |V|,`$ $`V_2UV_1=S`$ in rank $`i.`$

###### Proof.

Consider a g-reduced annular diagram $`\mathrm{\Delta }`$ for the conjugacy of $`VU`$ to a 0-word $`W.`$ We may assume that $`\mathrm{\Delta }`$ has the smallest possible type. Therefore there are no $`Y`$-bands surrounding the hole of $`\mathrm{\Delta },`$ since otherwise their boundary labels were 0-words. Hence, by lemmas 3.38 and 2.16, there are vertices $`o_1`$ on the contour $`q_1`$ labeled by $`VU`$ and $`o_2`$ on the contour $`q_2`$ labeled by $`W,`$ which can be connected by a simple path $`t`$ of length at most $`\gamma (|V|+|U|)3\gamma |V|/2`$ (see Figure 7).

One may suppose that the vertex $`o_2`$ does not cut the word $`W,`$ because $`|W|=0.`$ The vertex $`o_1`$ cannot cut the word $`|U|.`$ Indeed, in case it defines a decomposition $`UU_1U_2,`$ we obtain the following equality in rank $`i`$: $`U_1TW^1T^1U_2=V^1,`$ where $`T\varphi (t).`$ It follows by lemmas 3.39 and 2.7 that $`\overline{\beta }|V|<|U|+2\gamma (|V|+|U|),`$ whence $`|V|<(\overline{\beta }2\gamma )^1(1+2\gamma )|U|2|U|,`$ contrary to the hypothesis of the lemma.

Fig. 7.

Thus the vertex $`o_1`$ defines a decomposition $`VV_1V_2,`$ and $`TW^1T^1V_2U=V_1^1`$ in rank $`i.`$ Then, as above, $`\overline{\beta }|V_1|<|V_2|+|U|+2\gamma (|V|+|U|)`$. Therefore $`|V_1||V_2|<\beta |V_1|+|U|+3\gamma |V|`$. Similarly, $`|V_2||V_1|<\beta |V_1|+|U|+3\gamma |V|,`$ and so $`||V_1||V_2||<\beta |V|+|U|`$, as $`2|U||V|.`$

To complete the proof we observe that the product $`V_2UV_1`$ is equal in rank $`i`$ to the word $`STWT^1`$ of length at most $`3\gamma |V|`$. ∎

Let $`q_1,`$ $`q_2`$ be two paths labeled by $`A^{\pm 1}`$-periodic words for some period $`A.`$ We say that vertices $`o_1`$, $`o_2`$ of these paths are in the same phase (with respect to $`A`$) if they are phase vertices for the paths $`q_1,`$ $`q_2`$ with respect to a cyclic permutation $`A^{}`$ of the word $`A.`$

###### Lemma 3.21.

Let $`\mathrm{\Pi }`$ be a cell of positive rank in a g-reduced disc diagram $`\mathrm{\Delta }`$ of rank $`i`$ with contour $`p_1q_1p_2q_2`$, where $`q_1`$ and $`q_2^1`$ are labeled by $`A`$-periodic words where $`A`$ is a simple in rank $`i`$ word. Suppose there are disjoint contiguity subdiagrams $`\mathrm{\Gamma }_j`$ of $`\mathrm{\Pi }`$ to $`q_j`$ of degrees $`\psi _j`$ for $`j=1,2,`$ with $`\psi _1+\psi _2>1\alpha /2.`$ Denote $`s_1^jt_1^js_2^jt_2^j=(\mathrm{\Pi },\mathrm{\Gamma }_j,q_j)`$ (see Figure 8). Let $`p`$ be a subpath of $`q_2^1,`$ such that vertex $`o=(s_2^2)_+`$ belongs to $`p,`$ where the lengths of subpaths $`p^{}=p_{}o`$ and $`p^{\prime \prime }=op_+`$ are less than $`\frac{1}{3}|(\mathrm{\Pi })|.`$ Then any vertex $`o_2`$ of $`p`$ is not in the same phase with vertex $`o_1=(s_1^1)_{}`$.

###### Proof.

By lemmas 3.38, 3.39 and 2.3,

$$\psi _1,\psi _2[1/22\alpha ,\overline{\alpha }],$$
(10)
and by Lemma 2.2,

$$|t_2^1|,|t_2^2|[(1+2\beta )^1(1/22\alpha )|(\mathrm{\Pi })|,(12\beta )^1\overline{\alpha }|(\mathrm{\Pi })|]$$
(11)
Assume that $`o_2`$ and $`o_1`$ are in the same phase and $`o_2p^{}.`$ First, let $`\mathrm{\Pi }`$ be a hub. Then $`r(\mathrm{\Gamma }_1)=r(\mathrm{\Gamma }_2)=0`$ by Lemma 3.37 in the smaller rank, hence $`|s_l^j|=0`$, $`l,j=1,2`$. Recall that by (Z2.2), every hub is a linear word. By definition, every simple word in rank $`i`$ is cyclically $`Y`$-reduced.

Therefore by Lemmas 3.2 and 3.4 every maximal $`Y`$-band starting on $`t_l^j`$ ends on $`t_{3l}^j`$ and forms a $`0`$-bond between these paths. Hence any subpath of $`t_l^j`$ starting and ending with $`Y`$-letters, is a contiguity arc for some contiguity subdiagram between $`t_l^j`$ and $`t_{3l}^j`$ for $`l,j=1,2.`$ By our assumption and inequality (11), there are subpaths $`u^1`$ and $`u^2`$ of $`t_2^1`$ and $`(t_2^2)^1`$ with the same label $`U`$, such that

$$|U|>((1+2\beta )^1(1/22\alpha )1/3)|(\mathrm{\Pi })|>\frac{1}{7}|(\mathrm{\Pi })|$$

Gluing along $`u_1`$ and $`u_2`$ one can construct a contiguity diagram of rank 0 between disjoint arcs of the cell $`\mathrm{\Pi }`$ of length greater than $`\frac{1}{7}|(\mathrm{\Pi })|.`$ But this contradicts condition (Z2.2).

Fig. 8.

Now assume that $`\mathrm{\Pi }`$ is a cell with a period $`B`$ of rank $`ki`$. In this case, $`r(\mathrm{\Gamma }_1),r(\mathrm{\Gamma }_2)<k`$ by lemmas 2.1, 2.14 and 3.39. As in the previous paragraph, there are subpaths $`u_1`$ and $`u_2`$ of $`t_2^1`$ and $`(t_2^2)^1`$ with the same label $`U,`$ where $`|U|>\frac{1}{7}|(\mathrm{\Pi })|.`$

Lemma 2.1 and inequality (10) show that Lemma 2.12 is applicable to each of the diagrams $`\mathrm{\Gamma }_1,\mathrm{\Gamma }_2.`$ Since $`|s_1^j|<\zeta |(\mathrm{\Pi })|`$, it follows from Lemma 2.12 that an arbitrary vertex of $`t_l^j`$ ($`l,j\{1,2\}`$) can be connected in $`\mathrm{\Gamma }_j`$ with a vertex of $`t_{3l}^j`$ by a path of length at most $`3\gamma ^1\zeta |(\mathrm{\Pi })|.`$ Therefore, for $`j=1,2,`$ there exist subdiagrams $`\mathrm{\Gamma }_j^{}`$ of $`\mathrm{\Gamma }_j`$ with contours $`x_1^jy_1^jx_2^jy_2^j,`$ where $`|x_l^j|<3\gamma ^1\zeta |(\mathrm{\Pi })|,`$ $`\varphi (y_2^1)\varphi (y_2^2)^1U`$ and $`y_1^j`$ are subpaths of $`t_1^j.`$

By gluing diagrams $`\mathrm{\Gamma }_1^{}`$ and $`\mathrm{\Gamma }_2^{}`$ along $`y_2^1`$ and $`(y_2^2)^1,`$ one can obtain (after deleting $`j`$-pairs) a g-reduced diagram $`\mathrm{\Gamma }_0`$ with contour $`z_1y_1^1z_2y_1^2`$ where $`|z_1|,|z_2|<6\gamma ^1\zeta |(\mathrm{\Pi })|.`$ Notice, that by property A1 and Lemma 2.7,

$$|y_1^j|\overline{\beta }|y_2^j||x_1^j||x_2^j|>\frac{1}{7}\overline{\beta }|(\mathrm{\Pi })|6\gamma ^1\zeta |(\mathrm{\Pi })|>\frac{1}{8}|(\mathrm{\Pi })|\frac{n}{8}|B|$$

Therefore one can apply Lemma 2.15 to $`\mathrm{\Gamma }_0`$ and obtain a subdiagram $`\mathrm{\Gamma }_0^{}`$ of $`\mathrm{\Gamma }_0`$ with contour $`v_1w_1v_2w_2,`$ where $`w_j`$ is a subpath of $`y_1^j`$ (for $`j=1,2`$), $`|v_1|,|v_2|<\alpha |B|,`$ and

$$|w_1|,|w_2|>\frac{1}{8}|(\mathrm{\Pi })|\gamma ^1(12\gamma ^1\zeta |(\mathrm{\Pi })|+|B|)>\frac{n}{9}|B|$$

since $`|(\mathrm{\Pi })|n|B|`$ and the rank of $`\mathrm{\Pi }`$ is $`k=|B|`$. Since the labels of both $`w_1`$ and $`w_2`$ are $`B`$-periodic words, and period $`B`$ is simple in rank $`r(\mathrm{\Gamma }_0^{})<k,`$ we obtain a contradiction with Lemma 3.33 in a smaller rank.

Assume now that $`o_2p^{\prime \prime }.`$ Then we consider $`o_1^{}=o=(s_2^2)_+`$. There is a vertex $`o_2^{}`$ on the path $`q_1,`$ such that $`o_2^{}o_1`$ is a subpath of $`q_1`$ of length $`|o_2o|<\frac{1}{3}|(\mathrm{\Pi })|`$. Then $`o_1^{}`$ and $`o_2^{}`$ are in the same phase. Thus, this case is completely analogous to the case when $`o_2p^{}`$ up to the interchange of the paths $`q_1`$ and $`q_2^1.`$ The lemma is proved. ∎

###### Lemma 3.22.

Let $`\mathrm{\Delta }`$ be a narrow contiguity diagram of rank $`i`$ between $`q_1`$ and $`q_2`$ with contour $`p_1q_1p_2q_2,`$ where $`q_1`$ and $`q_2^1`$ are paths with $`A`$-periodic labels for some simple in rank $`i`$ period $`A.`$ Assume that there are vertices $`o_1`$ and $`o_2`$ on $`q_1`$ and $`q_2`$ respectively, which are in the same phase, the label $`\varphi (o_1o_2)`$ of a path $`o_1o_2`$ is a conjugate of a 0-word in rank $`i`$ and $`||(q_1)_{}o_1||(q_2)_+o_2||\frac{1}{3}\mathrm{min}(|q_1|,|q_2|),`$ where $`(q_1)_{}o_1`$ and $`o_2(q_2)_+`$ are subpaths of $`q_1`$ and $`q_2`$. Then $`r(\mathrm{\Delta })=0`$.

###### Proof.

As in the proof of Lemma 2.13, $`\mathrm{\Delta }`$ can be partitioned into several narrow bonds $`E_l`$ of an $`\alpha `$-series and several subdiagrams $`\mathrm{\Delta }_1,\mathrm{\Delta }_2,\mathrm{}`$ between successive bonds. If $`r(E_l)=r(E_{l+1})=0,`$ then $`r(\mathrm{\Delta }_l)=0`$ by Lemma 2.11 and the maximality of the $`\alpha `$-series. Thus it suffices to prove that $`r(E_l)=0`$ for every $`E_l.`$ Proving by contradiction, we choose the bond $`E_l`$ whose principal cell $`\mathrm{\Pi }_0`$ has maximal perimeter (see Figure 9).

Fig. 9.

By Lemma 2.7 (and lemmas 3.38, 3.39) $`|q_2|\overline{\beta }^1(|q_1|+|p_1|+|p_2|).`$ We have $`|p_1|+|p_2|<(\alpha +4\zeta )|(\mathrm{\Pi }_0)|`$ as in Lemma 2.13 for the side arcs of narrow bonds. Denote by $`\mathrm{\Gamma }_1`$ and $`\mathrm{\Gamma }_2`$ the contiguity subdiagrams of $`\mathrm{\Pi }_0`$ to $`q_1`$ and $`q_2`$ with contours $`s_1^jt_1^js_2^jt_2^j`$ ($`j=1,2`$) as in Lemma 3.21. Applying lemmas 2.2, 2.3, to $`\mathrm{\Gamma }_1`$, we have $`|q_1|>(1\alpha \overline{\alpha })|(\mathrm{\Pi }_0)|,`$ because $`q_1`$ contains $`t_2^1.`$ Hence $`|p_1|+|p_2|<\frac{5}{2}\alpha |q_1|`$ and $`|q_2|<(1+3\alpha )|q_1|.`$

Then we decompose $`q_1=q_1^{}t_2^1q_1^{\prime \prime }`$, $`q_2=q_2^{\prime \prime }t_2^2q_2^{}`$ and $`(\mathrm{\Pi })=t_1^1u_1t_1^2u_2`$.

Observe that since $`E_l`$ is also a bond of a narrow contiguity subdiagram between the paths $`q_1^{}t_2^1`$ and $`t_2^2q_2^{},`$ we have the similar inequality as for $`|q_1|`$ and $`|q_2|`$ above: $`|q_1^{}t_2^1|<(1+3\alpha )|t_2^2q_2^{}|.`$ This implies that $`|q_1^{}|+|q_2^{\prime \prime }|<(1+3\alpha )(|q_2^{}|+|t_2^2|+|q_2^{\prime \prime }|)=(1+3\alpha )|q_2|.`$ Similarly, $`|q_1^{}|+|q_2^{\prime \prime }|<(1+3\alpha )|q_1|.`$

Assume first that $`o_1q_1^{}`$ and $`o_2q_2^{\prime \prime }`$. We may also suppose by symmetry that $`|q_1^{}|<\frac{1+3\alpha }{2}\mathrm{min}(|q_1|,|q_2|).`$ Notice that equal shifts of the vertices $`o_1,o_2`$ along $`q_1`$ and $`q_2`$ preserve the assumption of the lemma. Now assume that, after shifts, $`o_2`$ becomes equal to $`(q_2)_{}`$ and $`o_1`$ still belongs to $`q_1^{}`$. The last assumption leads to a contradiction, because we have for the new $`o_1`$ and $`o_2`$ that $`|o_2(q_2)_+||o_1(q_1)_{}|>|q_2|\frac{1+3\alpha }{2}|q_2|>|q_2|/3`$ contrary to the assumption of the lemma. Therefore one can move $`o_1`$ to $`(t_2^1)_{}`$ and $`o_2`$ to a vertex laying on $`q_2`$, in this case.

If $`o_1q_1^{}`$ and $`o_2t_2^2`$ ($`o_2q_2^{}`$), then obviously, one can make equal shifts of these vertices so that either $`o_1`$ becomes equal to $`(t_2^1)_{}`$ or $`o_2`$ becomes equal to $`(t_2^2)_{}`$ . Similarly, one of the vertices $`o_1,o_2`$ can be made equal to one of the $`(t_2^1)_\pm ,(t_2^2)_\pm `$ after parallel shifts, if $`o_1t_2^1`$ and $`o_2t_2^2.`$ The remaining cases are symmetric to the examined ones.

Thus, to prove the lemma, one may assume that either $`o_1=(t_2^1)_{}`$ or $`o_1=(t_2^1)_+,`$ or $`o_2=(t_2^2)_{},`$ or $`o_2=(t_2^2)_+.`$ We will assume that $`o_1=(t_2^1)_+=(s_1^1)_{}.`$

In addition, one may assume that the vertex $`o_2`$ belongs to the subpath $`t_2^2q_2^{},`$ because otherwise it belongs to $`q_2^{\prime \prime }`$ and $`|o_2(t_2^2)_{}|\frac{1}{3}|(\mathrm{\Pi }_0)|`$ by Lemma 3.21. In this case, by Lemma 2.2, one might shift $`o_1`$ to $`(t_2^1)_{}`$ so that corresponding vertex $`o_2`$ shifts to a vertex of the path $`q_2^{\prime \prime }t_2^2`$ because

$$\begin{array}{c}|o_2(t_2^2)_+|>\frac{1}{3}|(\mathrm{\Pi }_0)|+|t_2^2|>(1/3+(12\beta )(1\alpha \overline{\alpha }))|(\mathrm{\Pi }_0)|>\hfill \\ \frac{2}{3}|(\mathrm{\Pi }_0)|>(1+2\beta )\overline{\alpha }|(\mathrm{\Pi }_0)|>|t_2^1|\hfill \end{array}$$

Then one gets a situation which is symmetric to the one considered above with respect to changing of notations $`p_1p_2^1`$, $`p_2p_1^1`$, $`q_1q_1^1`$, $`q_2q_2^1`$ (i.e. we replace $`\mathrm{\Delta }`$ by its mirror copy).

Thus, up to symmetries, one has to consider only one case when $`o_1=(t_2^1)_+`$ and $`o_2t_2^2q_2^{}.`$ The vertices $`o_2`$ and $`o_1`$ can be connected by a path $`vu,`$ where $`v=o_2(t_2^2)_{}`$ and $`u=(s_2^2)^1u_2(s_1^1)^1.`$ Set $`V\varphi (v)`$ and $`U\varphi (u).`$ As has been mentioned, $`|U|(\alpha +2\zeta )|(\mathrm{\Pi }_0)|.`$ On the other hand, $`|V|\frac{1}{3}|(\mathrm{\Pi }_0)|`$ by Lemma 3.21. Therefore one gets the decomposition $`VV_1V_2`$ guaranteed by Lemma 3.20. Denote by $`o`$ the vertex of $`v`$ which gives the corresponding decomposition $`v=v_1v_2.`$ There are two subcases.

(1) $`|V|<3\alpha ^1|(\mathrm{\Pi }_0)|.`$ Recall, that by Lemma 3.20 the word $`V_2UV_1`$ is equal in rank $`i`$ to a word $`S`$ of length at most $`3\gamma |V|`$ and

$$||V_1||V_2||<\beta |V|+|U|<(3\alpha ^1\beta +\alpha +2\zeta )|(\mathrm{\Pi }_0)|<2\alpha |(\mathrm{\Pi }_0)|.$$
(12)
By Lemma 3.21, $`|V||(\mathrm{\Pi }_0)|/3`$, whence $`|V_1|,|V_2|>(1/6\alpha )|(\mathrm{\Pi }_0)|>1/7|(\mathrm{\Pi }_0)|`$ by (12). Since

$$0.45|(\mathrm{\Pi }_0)|<(1+2\beta )^1(1\overline{\alpha }\alpha )|(\mathrm{\Pi }_0)|<|t_2^j|<(12\beta )^1\overline{\alpha }|(\mathrm{\Pi }_0)|$$

by lemmas 2.3 and 2.2, we have in case $`ot_2^2`$ that

$$|o(s_1^2)_{}|<|t_2^2||V_2|<((1+2\beta )\overline{\alpha }1/6+\alpha )|(\mathrm{\Pi }_0)|<0.35|(\mathrm{\Pi }_0)|$$

If $`oq_2^{}`$, then

$$|o(s_1^2)_{}|=|V_2||t_2^2|<|V_1|+2\alpha |(\mathrm{\Pi }_0)|0.45|(\mathrm{\Pi }_0)|.$$

Hence in any case the path between $`o`$ and $`(s_1^2)_{}`$ has length at most $`\mathrm{max}(0.35|(\mathrm{\Pi }_0)|,|V_1|2\alpha |(\mathrm{\Pi }_0)|),`$ because of (12) and the inequality $`4\alpha <0.45.`$ Since $`|s_1^2u_1^1s_2^1|<(\alpha +2\zeta )|(\mathrm{\Pi }_0)|,`$ the vertex $`o`$ can be connected with $`(t_2^1)_{}`$ by a path $`p`$ of length at most $`\mathrm{max}(0.4|(\mathrm{\Pi }_0)|,|V_1|).`$

The path $`pt_2^1`$ is homotopic to the path $`v_2u.`$ Thus the word $`S`$ is equal in rank $`i`$ to the word $`P\varphi (t_2^1)V_1`$, where $`P\varphi (p).`$ The word $`W\varphi (t_2^1)V_1`$ is A-periodic because the vertices $`o_2`$ and $`o_1`$ are in the same phase. It has length at least $`|V_1|+|t_2^1|>|V_1|+0.45|(\mathrm{\Pi }_0)|.`$ Then $`W=P^1S`$ in rank $`i,`$ which implies, by lemmas 2.7 and 3.38, 3.39 applied to the diagram for this equality, that

$$\mathrm{max}(0.4|(\mathrm{\Pi }_0)|,|V_1|)+3\gamma |V|>|P|+|S|>\overline{\beta }(|V_1|+|t_2^1|)>\overline{\beta }(|V_1|+0.45|(\mathrm{\Pi }_0)|)$$
(13)
On the other hand, since $`|V_1||V|3\alpha ^1|(\mathrm{\Pi }_0)|,`$ we have $`(\beta +3\gamma )|V|<(0.45\overline{\beta }0.4)|(\mathrm{\Pi }_0)|`$ which contradicts inequality (13).

(2) Let $`|V|3\alpha ^1|(\mathrm{\Pi }_0)|.`$ Recall that $`|V_1||V_2|<\beta |V|+(\alpha +2\zeta )|(\mathrm{\Pi }_0)|`$, and since $`|V|=|V_1|+|V_2|3\alpha ^1|(\mathrm{\Pi }_0)|`$, the length of $`v_2`$ is greater than $`\frac{7}{15}|V|1.4\alpha ^1|(\mathrm{\Pi }_0)|`$. By Lemma 2.13, the vertex $`o`$ can be connected with a vertex $`o^{}q_1^{}t_2^1`$ by a path $`t`$ of length at most $`\alpha ^1|(\mathrm{\Pi }_0)|<\frac{1}{3}|V|.`$ By Lemma 2.7, the length of the path $`q=o^{}o_1`$ is at least

$$\overline{\beta }|v_2||t||u|>\frac{7}{15}|V|\frac{1}{3}|V|\alpha ^2|V|>|V|/8$$

because $`|u|(\alpha +2\zeta )|(\mathrm{\Pi }_0)|<\alpha ^2|V|`$ by the assumption of case (2). Therefore the length of the $`A`$-periodic word $`WQV_1`$ (where $`Q\varphi (q)`$) is greater than $`(\frac{7}{15}+\frac{1}{8})|V|\frac{7}{12}|V|.`$ By Lemma 2.7, $`W`$ cannot be equal in rank $`i`$ to a word of length $`|V|/2`$. But it is equal in rank $`i`$ to the label of $`t`$ times $`S`$ which is equal in rank $`i`$ to $`V_2UV_1`$. Therefore $`W`$ is equal in rank $`i`$ to a word of length $`<(\frac{1}{3}+3\gamma )|V|,`$ a contradiction. ∎

###### Lemma 3.23.

Assume that $`A`$ is a word which is not a conjugate in rank $`i`$ of a 0-word. Let $`A=XB^lRX^1`$ in rank $`i`$, where $`B`$ is a simple in rank $`i`$ word or a period of rank $`ji`$ and $`R\mathrm{𝟎}(B)`$. Then $`\mathrm{𝟎}(A)X\mathrm{𝟎}(B)X^1`$ in rank $`i`$ (i.e. the canonical image of $`\mathrm{𝟎}(A)`$ in $`𝐆(i)`$ is a subgroup of the image of $`X\mathrm{𝟎}(B)X^1).`$

###### Proof.

One may suppose that $`A`$ is a $`Y`$-reduced word, moreover that $`A`$ is cyclically $`Y`$-reduced, by Lemma 3.4(1) and Lemma 3.7.

Consider a diagram $`\mathrm{\Delta }_1`$ of rank $`i`$ for the equality $`A=XB^lRX^1`$. Let $`\mathrm{\Delta }_2`$ be an annular diagram which arises after identifying the boundary sections of $`\mathrm{\Delta }_1`$ labeled by $`X.`$ It has contours $`q_1`$ and $`q_2`$ labeled by $`A`$ and $`B^lR,`$ respectively. Initial vertices $`o_1`$ of $`q_1`$ and $`o_2`$ of $`q_2`$ are connected in $`\mathrm{\Delta }_2`$ by a path $`x`$ labeled by the word $`X.`$ If $`\mathrm{\Delta }_2`$ is not g-reduced, one can reduce it and obtain a diagram $`\mathrm{\Delta }_3`$ of a smaller type in which the vertices $`o_1`$ and $`o_2`$ are connected by a path $`x^{}`$ with $`X^{}\varphi (x^{})=X`$ in rank $`i.`$ (Lemma 11.3 .) We will induct on the type of $`\mathrm{\Delta }_3.`$

If $`r(\mathrm{\Delta }_3)=0,`$ then $`\mathrm{𝟎}(A)=X^{}\mathrm{𝟎}(B^lR)(X^{})^1`$ in rank 0, by Lemma 3.7. Since $`X^{}=X`$ in rank $`i,`$ the statement of the lemma follows from Lemma 3.11.

Assume now that $`r(\mathrm{\Delta }_3)>0.`$ One may suppose that there are no cells compatible with $`q_2`$ in $`\mathrm{\Delta }_3`$ (if $`B`$ is a period of rank $`ji),`$ since otherwise one can decrease the type of $`\mathrm{\Delta }_3`$ by Lemma 3.18 and replace the label of $`q_2`$ for $`B^{\mathrm{}\pm sn}R.`$ Therefore the cyclic section $`q_2`$ is smooth by Lemma 3.39, and so the degree of contiguity of any cell of $`\mathrm{\Delta }_3`$ to $`q_2`$ is less $`\overline{\alpha }`$ by Lemma 2.3. By Lemma 2.4 there is a positive cell $`\mathrm{\Pi }`$ and its contiguity subdiagram $`\mathrm{\Gamma }^{}`$ to $`q_1`$ such that $`(\mathrm{\Pi },\mathrm{\Gamma }^{},q_1)>\frac{1}{2}(\overline{\gamma }\overline{\alpha })>\epsilon .`$

It follows, from Lemma 2.6 that there is a positive cell $`\pi `$ of $`\mathrm{\Delta }_3`$ and a contiguity subdiagram $`\mathrm{\Gamma }`$ of rank 0 of $`\pi `$ to $`q_1,`$ such that $`(\pi ,\mathrm{\Gamma },q_1)\epsilon .`$

Let $`(\pi ,\mathrm{\Gamma },q_1)=s_1t_1s_2t_2.`$ Then $`|s_1|=|s_2|=0`$ since $`r(\mathrm{\Gamma })=0`$. There are no $`Y`$-bands connecting different edges of subpath $`t_1`$ of $`(\pi )`$ by axiom A2. Therefore $`|t_1||t_2|,`$ and the word $`A^{}`$ obtained by the exchange in $`A`$ of the subword $`\varphi (t_2)`$ by $`\varphi (s_2t_1s_1)^1,`$ is $`Y`$-reduced (and equal to $`A`$ in rank 0.)

The subword $`\varphi (t_1)^1`$ of $`A^{}`$ is a subword of the boundary label of $`\pi `$ and $`|\varphi (t_1)^1|\epsilon |(\pi )|.`$ By Lemmas 3.15, 3.16, if one substitutes $`\varphi (t_1)^1`$ in $`A^{}`$ by $`\varphi (t)`$, where $`t_1t`$ is the contour of $`\pi ,`$ and replaces the resulting word by an equal in rank $`0`$ $`Y`$-reduced word $`A^{\prime \prime },`$ then $`\mathrm{𝟎}(A^{\prime \prime })\mathrm{𝟎}(A^{})=\mathrm{𝟎}(A).`$

The word $`A^{\prime \prime }`$ is the label of the contour of a g-reduced diagram $`\mathrm{\Delta }_4`$ which is obtained from $`\mathrm{\Delta }_3`$ by cutting the cell $`\pi `$ out and (possibly) adding several 0-cells. Of course, such surgeries (cutting off a contiguity diagram or a cell) can touch the path $`x^{},`$ but there is a homotopic path $`x^{\prime \prime }`$ with label $`X^{\prime \prime }=X^{}=X`$ in rank $`i`$ which is not touched by the surgeries (i.e. this path does not pass through the contiguity subdiagram and does not have common edges with the cell). By the inductive hypothesis for the diagram $`\mathrm{\Delta }_4`$ of a smaller type, $`\mathrm{𝟎}(A^{\prime \prime })X^{\prime \prime }\mathrm{𝟎}(B)(X^{\prime \prime })^1`$ in rank $`i`$. Hence $`\mathrm{𝟎}(A)X\mathrm{𝟎}(B)X^1,`$ as desired. ∎

We need the statement of the following lemma to define periods of rank $`i_+.`$

###### Lemma 3.24.

The following relation $`_i`$ is an equivalence on the set of all simple in rank $`i`$ words: $`A_iB`$ by definition, if there are words $`X,P,R`$, where $`P\mathrm{𝟎}(A)`$, $`R\mathrm{𝟎}(B)`$ (in rank 0), such that $`AP=XB^{\pm 1}RX^1`$ in rank $`i`$.

###### Proof.

Obviously, $`_i`$ is a reflexive relation.

The equality $`AP=XB^{\pm 1}RX^1`$ implies $`B^{\pm 1}R=X^1APX`$ in rank $`i`$. Taking the inverses, if necessary, we have equality $`BR_\pm =X^1A^{\pm 1}P_\pm X`$ for a suitable $`P_\pm \mathrm{𝟎}(A)`$, $`R_\pm \mathrm{𝟎}(B)`$, because $`\mathrm{𝟎}(A)`$ and $`\mathrm{𝟎}(B)`$ are normalized by $`A`$ and $`B`$ respectively. By Lemma 3.9 $`\mathrm{𝟎}(B)=\mathrm{𝟎}(BR_\pm )`$, and so $`R_\pm X^1\mathrm{𝟎}(A)X`$ by Lemma 3.23. Then $`QXR_\pm X^1\mathrm{𝟎}(A)`$ by Lemma 3.7. Hence $`B=X^1A^{\pm 1}VX`$ in rank $`i`$, where $`VP_\pm Q\mathrm{𝟎}(A)`$, and so the relation $`_i`$ is symmetric.

We have also proved that $`B_iA`$ implies that $`B=X^1A^{\pm 1}VX`$ in rank $`i`$ for some $`V\mathrm{𝟎}(A)`$ and a word $`X.`$

Assume now that $`B_iC`$, that is $`B=YC^{\pm 1}QY^1`$ in rank $`i`$ for a word $`Y`$ and some $`Q\mathrm{𝟎}(C).`$ Then, in rank $`i`$, $`AP=X(YC^{\pm 1}Q_\pm Y^1)RX^1`$ for suitable $`Q_\pm \mathrm{𝟎}(C)`$, and $`VY^1RY\mathrm{𝟎}(C)`$ by lemmas 3.23 and 3.7. Hence, in rank $`i`$, $`AP=(XY)C^{\pm 1}(Q_\pm V)(XY)^1`$, where $`Q_\pm V\mathrm{𝟎}(C).`$ Therefore the relation $`_i`$ is transitive. ∎

###### Lemma 3.25.

Every word $`X`$ is a conjugate in rank $`i0`$ either of a 0-word or of a word $`A^lP,`$ where $`|A||X|,`$ $`A`$ is either period of rank $`ji`$ or a simple in rank $`i`$ word and $`P`$ represents in rank $`0`$ an element of the subgroup $`\mathrm{𝟎}(A).`$

###### Proof.

If the statement were false for $`X`$, then, in rank $`i`$, $`X=YA^sRY^1`$ for some ($`Y`$-reduced) essential word $`A`$ with $`|A|<|X|`$ and word $`R\mathrm{𝟎}(A)`$. By the inductive hypothesis, we may assume that $`A=ZB^tPZ^1`$ in rank $`i`$ where $`B`$ is either a period of rank $`ji`$ or a simple in rank $`i`$ word, and $`P\mathrm{𝟎}(B).`$

We have that $`A^sR=Z(B^tP)^sZ^1R`$ in rank $`i`$. The word $`Z^1RZ`$ is equal in rank $`i`$ to a word $`Q\mathrm{𝟎}(B^tP)=\mathrm{𝟎}(B)`$ by Lemma 3.23 and Lemma 3.11. Therefore $`A^sR=Z((B^tP)^sQ)Z^1`$. Since $`\mathrm{𝟎}(B)`$ is normalized by $`B`$ (by definition), $`X`$ is a conjugate in rank $`i`$ of a word of the form $`B^{st}S`$ for some $`S\mathrm{𝟎}(B),`$ as desired. ∎

###### Lemma 3.26.

If a word $`X`$ has a finite order in rank $`i,`$ then it is a conjugate in rank $`i`$ either of a 0-word or of a word $`A^lR,`$ where $`A`$ is a period of rank $`ji`$ and $`R\mathrm{𝟎}(A).`$

###### Proof.

If the claim were false, then, by Lemma 3.25, since $`\mathrm{𝟎}(A)`$ is normalized by $`A`$, $`A^lR=1`$ in rank $`i`$ for some simple in rank $`i`$ word $`A,`$ $`R\mathrm{𝟎}(A)`$ and $`|l|>0.`$ Then $`A^l=R^1`$ in rank $`i`$ and $`\overline{\beta }|l||A|<|R|=0`$ by lemmas 3.38, 3.39 and Lemma 2.7. The statement is proved by contradiction. ∎

###### Lemma 3.27.

If $`A`$ and $`B`$ are simple in rank $`i`$ words and $`A`$ is equal in rank $`i`$ to $`XB^lRX^1`$ for some word $`X`$, and some word $`R\mathrm{𝟎}(B),`$ then $`l=\pm 1`$ and $`|A|=|B|.`$

###### Proof.

When proving the first assertion by contradiction, one can assume that $`l2.`$ By Lemma 3.39 and Lemma 2.7 for a g-reduced annular diagram for the conjugacy of $`A`$ and $`B^lR`$, we have $`2\overline{\beta }|B|<|A|,`$ whence $`|B|<|A|`$ contrary to the simplicity of the word $`A`$ in rank $`i.`$ Then we have $`PXRX^1\mathrm{𝟎}(A)`$ in rank $`i`$ by Lemma 3.7, Lemma 3.11, and $`B=X^1(AP^1)^{\pm 1}X.`$ Hence $`|A|=|AP^1||B|`$ since $`|P|=0`$ by definition of $`\mathrm{𝟎}(A)`$ (see property (Z3)) and the simplicity of $`B`$ in rank $`i.`$

###### Lemma 3.28.

If words $`X`$ and $`Y`$ are conjugate in rank $`i,`$ and $`X`$ is not a conjugate in rank $`i`$ of a $`0`$-word, then there is a word $`Z,`$ such that $`|Z|\overline{\alpha }(|X|+|Y|)`$ and $`ZYZ^1`$ is equal to $`X`$ in rank $`i.`$

###### Proof.

The proof is analogous to the proof of Lemma 18.5 . One may apply Lemma 2.16 (which is an analog of Lemma 17.1 ) since $`X`$ is not a conjugate of a 0-word. ∎

###### Lemma 3.29.

Let $`\mathrm{\Delta }`$ be a narrow contiguity diagram between sections $`q_1`$ and $`q_2`$ of its contour. Assume that it is of rank 0 and has contour $`p_1q_1p_2q_2,`$ where $`q_1`$ and $`q_2^1`$ are paths labeled by $`A`$-periodic words with a simple in rank $`i`$ period $`A.`$ Assume that $`|q_1|,|q_2|2|A|,`$ and $`o_1`$ and $`o_2`$ are vertices of $`q_1`$ and $`q_2`$ which are in the same phase, $`|(q_1)_{}(o_1)||q_1|/2`$, $`|(q_2)_+(o_2)||q_2|/2,`$ and $`\varphi (o_1o_2)`$ is a conjugate in rank $`i`$ of a 0-word. Then the vertices $`(q_1)_{}`$ and $`(q_2)_+`$ are in the same phase too.

###### Proof.

Without loss of generality, one may assume that $`(q_2)_+=o_2`$ since the vertices $`o_1`$ and $`o_2`$ can be simultaneously shifted along the paths $`q_1`$ and $`q_2`$.

Every $`Y`$-band of $`\mathrm{\Delta }`$ is a 0-bond between $`q_1`$ and $`q_2`$ because the narrow diagram $`\mathrm{\Delta }`$ of rank 0 is defined by 0-bonds and by Lemma 3.2, there are no bands connecting different $`Y`$-edges of $`q_1`$ (of $`q_2`$) as the period $`A`$ is simple in rank 0. Hence $`|p_1|=0,`$ and the vertex $`o_1`$ can be connected with a vertex $`o_0`$ of $`q_2`$ by a path of length 0. Proving by contradiction, one may suppose that $`|V^{}|>0`$ for the word $`V^{}\varphi ((q_1)_{}o_1).`$ Then $`|V|=|V^{}|>0`$ for the word $`V\varphi (o_2o_0).`$

Denote $`U\varphi (o_0o_1)`$. Then $`|U|=0,`$ and the word $`VU`$ is a conjugate of a 0-word in rank $`i`$ by the hypothesis of the lemma. Lemma 3.20 provides us with a decomposition $`VV_1V_2,`$ where $`V_2UV_1`$ is equal in rank 0 to a word $`S`$ of length at most $`3\gamma |V|.`$

Consider the vertex $`o`$ of the subpath $`o_2o_0`$ that defines the decomposition $`V_1V_2`$ of the label $`V`$ of $`o_2o`$. Then the word $`V_2UV_1`$ is readable in $`\mathrm{\Delta }`$ starting with $`o`$: the suffix $`V_1`$ can be read in the beginning of $`o_1(q_1)_+`$ since $`o_1`$ and $`o_2`$ are in the same phase. The vertex $`o`$ can be connected with a vertex $`o^{}`$ of $`q_1`$ by a path of length $`0`$ (see Figure 10).

Fig. 10.

Thus, up to a factor of length 0, the word $`V_2UV_1`$ is equal to a subword of $`q_1`$ of the length $`|V_2|+|V_1|=|V|,`$ which is not equal in rank $`i`$ to a word of length $`\overline{\beta }|V|`$, by Lemma 3.39 and Lemma 2.7. The inequality $`\overline{\beta }|V|3\gamma |V|`$ contradicts the Lowest Parameter Principle. This completes the proof of the lemma. ∎

The following lemmas 3.303.32 are analogous to lemmas 18.6 - 18.8 . For a given rank $`i1/2,`$ they are proved by simultaneous induction on the sum $`L`$ of lengths of periods.

###### Lemma 3.30.

Let $`\mathrm{\Delta }`$ be a g-reduced diagram of rank $`i`$ with contour $`p_1q_1p_2q_2`$, where $`\varphi (q_1)`$ and $`\varphi (q_2)^1`$ are periodic words with a simple in rank $`i`$ period $`A.`$ Then the paths $`q_1`$ and $`q_2`$ are $`A`$-compatible in $`\mathrm{\Delta },`$ provided $`|p_1|,|p_2|<\alpha |A|`$ and $`|q_1|,|q_2|>(\frac{5}{6}h+1)|A|.`$ (The inductive parameter $`L`$ is equal to $`|A|+|A|.`$)

###### Proof.

The same argument, as in the proof of Lemma 18.6  allows us to assume that the vertices $`(p_1)_+`$ and $`(p_1)_{}`$ are in the same phase, $`|q_1|,|q_2|>\frac{5}{6}h|A|`$ and $`|p_1|<(\alpha +1/2)|A|=\overline{\alpha }|A|.`$ In view of Lemma 3.7, to prove the lemma, one may replace period $`A`$ by a cyclic permutation. Therefore we suppose that both $`q_1`$ and $`q_2^1`$ start with the prefix $`A.`$

Suppose that the word $`P_1\varphi (p_1)`$ is not a conjugate in rank $`i`$ of a 0-word. In this case the annular diagram $`\overline{\mathrm{\Delta }}`$ obtained after identification of the the long subpaths of $`q_1`$ and $`q_2`$ with equal labels, has no paths of length 0 surrounding the hole. Therefore we can apply Lemma 2.16 (which is Lemma 17.1 from ). The rest of the proof of Lemma 18.6 from  carries out with one minor change: by Lemma 3.25, the word $`D\varphi (p_1)`$ is equal in rank $`i`$ to the product $`YB^mRY^1,`$ $`R\mathrm{𝟎}(B)`$ instead of simply $`YB^mY^1`$. The word $`D^l`$ is equal in rank $`i`$ to $`YB^{ml}QY^1,`$ for some 0-word $`Q\mathrm{𝟎}(B)`$ since $`\mathrm{𝟎}(B)`$ is normalized by $`B`$. Then we have to define $`ZQY^1\varphi (s^{})`$, instead of $`ZY^1\varphi (s^{})`$ in . This does not effect on the further proof because $`|Q^l|=0`$ by the definition of $`\mathrm{𝟎}(B)`$.

Assume now that the word $`P`$ is a conjugate in rank $`i`$ of a 0-word. Since $`q_1`$ and $`q_2`$ are long enough ($`h=\delta ^1)`$, we can excise a narrow contiguity subdiagram $`\mathrm{\Delta }^0`$ of $`\mathrm{\Delta }`$ with contour $`p_1^{}q_1^{}p_2^{}q_2^{}`$ according to Lemma 2.11 (which can be applied because $`q_1`$ and $`q_2`$ are smooth sections of rank $`|A|`$ by Lemma 3.39 in the smaller rank). Moreover by Lemma 2.11, we may suppose that $`|q_1^{}|,|q_2^{}|>\frac{1}{2}h|A|`$ and $`|p_1^{}|,|p_2^{}|<\alpha |A|`$. Again, by Lemma 2.11, there are vertices $`o_1`$ and $`o_2`$ of $`q_1^{}`$ and $`q_2^{}`$ respectively, such that the paths $`(p_1)_+o_1`$ and $`(p_1)_{}o_2`$ have the same label (say, $`X`$) and

$$|(q_1^{})_{}o_1|,|(q_2^{})_+o_2|<\gamma ^1(\overline{\alpha }+\alpha )|A|<\frac{h}{6}|A|.$$

Then the label of any path $`o_1o_2`$ is equal in rank $`i`$ to $`X^1P^1X,`$ and therefore it is a conjugate in rank $`i`$ of a 0-word. By Lemma 3.22, $`r(\mathrm{\Delta }^0)=0,`$ and the vertices $`(q_1^{})_{}`$ and $`(q_2^{})_+`$ are in the same phase by Lemma 3.29 (see Figure 11).

Fig. 11.

Every $`Y`$-band starting on $`q_1^{}`$ must end on $`q_2^{}`$ by Lemma 3.2. Hence one may suppose that $`\varphi (q_1^{})\varphi (q_2^{})^1U`$ for some word $`U.`$ Then $`U^1\varphi (p_1^{})U=\varphi (p_2^{})^1`$ in $`𝐆(0)`$, and since $`|U|>\frac{h}{2}|A|>4|A|`$, we have $`A_1^4\varphi (p_1)A_1^4\mathrm{𝟎}(A_1)`$ by Lemma 3.6, where $`A_1`$ is the cyclic shift of $`A`$ which is the prefix of $`\varphi (q_1^{}).`$ Thus the paths $`q_1^{}`$ and $`q_2^{}`$ are compatible by (Z3.1) since $`A`$ is simple in rank $`1/2`$ (recall that $`i1/2`$). Therefore the paths $`q_1,q_2`$ are also compatible by Lemma 3.7, and the lemma is proved. ∎

###### Lemma 3.31.

Let $`Z_1A^{m_1}Z_2=A^{m_2}`$ in rank $`i`$, $`m=\mathrm{min}(m_1,m_2),`$ and $`A`$ be a simple word in rank $`i.`$ Then each of the words $`Z_1,Z_2`$ is equal in rank $`i`$ to a product of a power of $`A`$ and a word representing an element of the subgroup $`\mathrm{𝟎}(A)`$ provided $`|Z_1|+|Z_2|<(\gamma (m\frac{5}{6}h1)1)|A|.`$ (The inductive parameter $`L`$ is equal to $`|A|+|A|`$.)

###### Proof.

As in Lemma 18.7  we can consider a g-reduced disc diagram $`\mathrm{\Delta }`$ of rank $`i`$ with the contour $`p_1q_1p_2q_2,`$ where $`\varphi (q_1)A^{m_1}`$, $`\varphi (q_2^1)A^{m_2}`$, $`\varphi (p_1)=Z_1`$, $`\varphi (p_2)=Z_2`$. By lemmas 3.38, 3.39, $`q_1`$ and $`q_2`$ are smooth of rank $`|A|`$. By lemmas 3.38 and 2.15, we can excise from $`\mathrm{\Delta }`$ a subdiagram $`\mathrm{\Delta }^{}`$ with contour $`p_1^{}q_1^{}p_2^{}q_2^{}`$ where

$$\begin{array}{c}|p_1^{}|,|p_2^{}|<\alpha |A|,|q_j^{}|>|q_j|\gamma ^1(|Z_1|+|Z_2|+|A|)>\hfill \\ m|A|(m\frac{5}{6}h1)|A|=(\frac{5}{6}h+1)|A|,j=1,2.\hfill \end{array}$$

By Lemma 3.30, $`q_1^{}`$ and $`q_2^{}`$ are compatible in $`\mathrm{\Delta }^{}`$. So there exist phase vertices $`o_1q_1`$ and $`o_2q_2`$ such that the label $`T=\varphi (t)`$ of a path $`t`$ connecting these vertices represents an element of $`\mathrm{𝟎}(A)`$ in rank $`i`$. Then $`\varphi ((q_1)_{}o_1)`$ and $`\varphi ((q_2)_+o_2)`$ are powers of $`A`$, we have an equality of the following form in rank $`i`$: $`Z_1=A^{s_1}TA^{s_2}`$. Since $`\mathrm{𝟎}(A)`$ is normalized by $`A`$ in rank 0, the lemma is proved. ∎

###### Lemma 3.32.

Let $`\mathrm{\Delta }`$ be a g-reduced disc diagram of rank $`i`$ with the contour $`p_1q_1p_2q_2,`$ where $`\varphi (q_1)`$ and $`\varphi (q_2)`$ are periodic words with simple in rank $`i`$ periods $`A`$ and $`B,`$ respectively, and $`|A||B|.`$ Assume that $`|p_1|,|p_2|<\alpha |B|,`$ $`|q_1|>\frac{3}{4}h|A|`$ and $`|q_2|>h|B|.`$ Then the word $`A`$ is a conjugate in rank $`i`$ of a product $`B^{\pm 1}R,`$ where $`R`$ represents an element of the subgroup $`\mathrm{𝟎}(B),`$ and $`|A|=|B|.`$ Moreover, if the words $`\varphi (q_1)`$ and $`\varphi (q_2)^1`$ start with $`A`$ and $`B^1,`$ respectively, then $`A`$ is equal in rank $`i`$ to $`\varphi (p_1)^1B^{\pm 1}R\varphi (p_1).`$ (The inductive parameter $`L`$ is equal to $`|A|+|B|.`$)

###### Proof.

The proof is similar to the proof of Lemma 18.8 , but, at the very end, by Lemma 3.31, we obtain the equality $`Z_1=B^sR`$ (instead of $`Z_1=B^s`$) with $`R\mathrm{𝟎}(B)`$. Then $`s=\pm 1`$ and $`|A|=|B|`$ by Lemma 3.27.∎

###### Lemma 3.33.

Let $`\mathrm{\Delta }`$ be a disc diagram of rank $`i`$ with the contour $`p_1q_1p_2q_2,`$ where both $`\varphi (q_1)`$ and $`\varphi (q_2)`$ are periodic words with a simple in rank $`i`$ period $`A`$ and $`|p_1|,|p_2|<\alpha |A|.`$ Then $`|q_1|,|q_2|h|A|.`$

###### Proof.

We prove the statement by contradiction. The proof is parallel to the proof of Lemma 18.9  up to the application of Lemma 3.32 (instead of Lemma 18.8). This lemma gives the equality $`AR=Z^1(A^1)^lZ`$ in rank $`i`$, where $`l=\pm 1,R\mathrm{𝟎}(A),|Z|<(1+\alpha )|A|.`$ Then, in case $`l=1,`$ $`Z^1A^kZ=A^kQ`$ in rank $`i,`$ where $`Q\mathrm{𝟎}(A)`$, because of (Z3) where $`\varphi (q_1)A^k\overline{A}`$, $`|\overline{A}|<|A|`$. The rest of the argument of the proof of Lemma 18.9 from  in this case remains valid because $`\mathrm{𝟎}(A)`$ is normalized by $`A`$ in rank $`0`$ and all elements in $`\mathrm{𝟎}(A)`$ have length $`0`$ (so the corresponding factors do not affect length estimates).

In case $`l=1,`$ the equality $`AR=Z^1A^1Z`$, in rank $`i,`$ implies $`A^n=Z^1A^nZ`$ by Lemma 3.12. Hence $`Z^2`$ commutes with $`A^n`$ in rank $`i`$. Therefore $`Z^2`$ commutes with any $`A^{sn}`$, $`s=1,2,\mathrm{}`$. Taking $`s`$ sufficiently large, we can apply Lemma 3.31 and conclude that $`Z^2=A^dP`$ in rank $`i,`$ with $`P\mathrm{𝟎}(A).`$ Then again, $`Z^{2n}=A^{dn}`$ in rank $`i`$ by Lemma 3.12. Therefore the word $`Z`$ commutes with $`A^{dn}`$ in rank $`i.`$ But the equality $`A^n=Z^1A^nZ`$ implies that $`Z^1A^{dn}Z=A^{dn}`$ in rank $`i.`$ Hence $`A^{2dn}=1`$ in rank $`i.`$ This would contradict the definition of a simple word and Lemma 3.26, if $`d0.`$

Consequently $`d=0`$ and $`Z^2=P`$ in rank $`i.`$ Then $`Z`$ has finite order in rank $`i`$ by property (Z1.2). This order must divide $`n`$ by property (Z1.2), Lemma 3.12 and Lemma 3.26 since $`B^n=1`$ in rank $`i`$ for every period $`B`$ of rank $`i`$. Therefore $`Z^2=P\mathrm{𝟎}(A)`$ implies that $`Z\mathrm{𝟎}(A)`$ in rank $`i`$ as $`n`$ is an odd number.

By Lemma 3.13 $`Z`$ commutes with $`A^n`$ in rank $`i`$. It follows that $`A^{2n}=1`$ in rank $`i.`$ This is the final contradiction, as simple in rank $`i`$ word $`A`$ has infinite order in rank $`i`$ by Lemma 3.26. ∎

###### Lemma 3.34.

Let $`\mathrm{\Delta }`$ be a g-reduced disc diagram of rank $`i`$ with the contour $`p_1q_1p_2q_2,`$ where $`\varphi (q_1)`$ and $`\varphi (q_2)`$ are periodic words with simple in rank $`i`$ periods $`A`$ and $`B`$. Assume that $`|p_1|,|p_2|<\alpha |B|,`$ $`|q_1|>(1+\frac{\gamma }{2})|A|,`$ $`|q_2|>\frac{1}{2}\epsilon n|B|.`$ Then the word $`A`$ is a conjugate in rank $`i`$ of a word $`B^{\pm 1}R,`$ where $`R\mathrm{𝟎}(B).`$ Moreover it is equal in rank $`i`$ to $`\varphi (p_1)^1B^{\pm 1}R\varphi (p_1)`$ if the word $`\varphi (q_1)`$ starts with $`A`$ and $`\varphi (q_2)^1`$ starts with $`B^1.`$

###### Proof.

To prove the lemma, one should repeat the argument from Lemma 19.1  up to the reference to Lemma 3.31, instead of Lemma 18.7  which provides us with the additional factor $`R`$ as compared with . ∎

###### Lemma 3.35.

Let $`\mathrm{\Delta }`$ be a g-reduced disc diagram of rank $`i`$ with the contour $`p_1q_1p_2q_2`$, where $`\varphi (q_1)`$ and $`\varphi (q_2)`$ are periodic words with simple in rank $`i`$ periods $`A`$ and $`B;`$ $`|q_2|\epsilon n|B|,`$ $`|p_1|,|p_2|<\zeta nc`$ for $`c=\mathrm{min}(|A|,|B|).`$ Then either $`|q_1|<(1+\gamma )|A|,`$ or $`A`$ is a conjugate in rank $`i`$ of a word $`B^{\pm 1}R`$ where $`R\mathrm{𝟎}(B)`$. Furthermore, equality $`AB^{\pm 1}`$ implies $`AB^1`$ and the paths $`q_1`$, $`q_2`$ are $`A`$-compatible in $`\mathrm{\Delta }`$.

###### Proof.

The statement can be reduced to the claim of Lemma 3.34 in the similar way as in Lemma 19.2 . ∎

Recall that $`i_+`$ means 1 if $`i=1/2`$, and $`i+1`$ if $`i1`$.

###### Lemma 3.36.

1) If $`|X|i_+`$ then $`X^n=1`$ in rank $`i_+.`$

2) period $`A`$ of rank $`i_+`$ is simple in any rank $`ji.`$

3) Let $`A`$ and $`B`$ be periods of ranks $`k,li_+`$, and $`A_jB`$ for some $`j<k,l.`$ Then $`AB.`$

###### Proof.

1) If $`X`$ is a conjugate of a word of length 0 in rank $`i_+`$, the statement follows from (Z1.2). Otherwise by Lemma 3.25 $`X`$ is a conjugate in rank $`i`$ of a word of the form $`A^lP`$ with $`|A||X|,P\mathrm{𝟎}(A)`$ and $`A`$ is either a period of rank $`i`$ or a simple word in rank $`i`$. Then $`(A^lP)^n=A^{ln}`$ by Lemma 3.12. If $`|A|<i_+,`$ then $`A^{ln}=1`$ in rank $`i`$ by the definition of relators of rank $`i.`$ Hence $`X^n=1`$ in rank $`i`$, and consequently, in rank $`i_+.`$ If $`|A|=i_+`$ and so, $`A`$ is simple in rank $`i`$, then $`AV=YB^{\pm 1}RY^1`$ in rank $`i`$ for a period $`B`$ of rank $`i_+`$, some $`V\mathrm{𝟎}(A)`$, $`R\mathrm{𝟎}(B)`$ and a word $`Y`$, by the definition of the set $`X_{i_+}.`$ Hence equality $`A^n=1`$ in rank $`i_+`$ follows from equality $`B^n=1`$ in rank $`i_+`$ and Lemma 3.12.

2) Follows from the inclusion of the set of relators of rank $`j`$ into the set of relators of rank $`i`$ for $`ji.`$

3) If $`k`$ were less than $`l`$, for example, then $`B=XA^{\pm 1}PX^1`$ in rank $`l_{}`$ for some $`X`$ and $`P\mathrm{𝟎}(A)`$ as it was shown at Lemma 3.24, but this contradicts the choice of periods of rank $`l`$. If $`k=l`$, then $`AB`$ by the definition of the set $`X_l`$. ∎

Lemmas 3.373.39 will be proved by simultaneous induction on the type of diagrams.

###### Lemma 3.37.

Let $`\pi `$ be a hub in a g-reduced diagram $`\mathrm{\Delta }`$ of rank $`i_+.`$ Then (1) the degree of contiguity of arbitrary cell $`\mathrm{\Pi }`$ to $`\pi `$ is less than $`\epsilon ;`$ (2)arbitrary contiguity subdiagram $`\mathrm{\Gamma }`$ of $`\pi `$ to a cell $`\mathrm{\Pi }`$ or to a section $`p`$ of the boundary $`(\mathrm{\Delta }),`$ labeled by a $`A`$-periodic word where $`A`$ is a simple in rank $`i_+`$ word or a period of rank $`i_+,`$ is of rank 0, provided in the last case that there are no cells compatible with $`p,`$ in $`\mathrm{\Delta }.`$

###### Proof.

Consider a contiguity subdiagram $`\mathrm{\Gamma }`$ between a hub $`\pi `$ and another cell $`\mathrm{\Pi }.`$ Let $`E`$ be one of the bonds defining $`\mathrm{\Gamma }.`$ If $`r(E)>0,`$ then the principal cell of $`E`$ has the contiguity degree to $`\pi `$ at least $`\epsilon `$, and this contradicts the statement of the lemma for a subdiagram of a smaller type (the subdiagram does not contain $`\mathrm{\Pi }`$). Thus $`E`$ is a 0-bond.

Furthermore the same argument shows that a cell $`\pi ^{}`$ of positive rank from $`\mathrm{\Gamma }`$ possesses no contiguity subdiagram to $`\pi `$ (to $`\mathrm{\Pi }`$ if $`\mathrm{\Pi }`$ is also a hub), with degree $`\epsilon `$. If $`\mathrm{\Pi }`$ is a cell of rank $`1`$, then by lemmas 3.38, 3.39 for $`\mathrm{\Gamma }`$ and Lemma 3.17, one may apply Lemma 2.3 and conclude that a contiguity degree of $`\pi ^{}`$ to $`\mathrm{\Pi }`$ is less than $`\overline{\alpha }`$. Since side arcs of $`\mathrm{\Gamma }`$ are of length 0, this contradicts Lemma 2.4 because $`\epsilon +\overline{\alpha }<\overline{\gamma }.`$ Thus $`r(\mathrm{\Gamma })=0`$ if $`\pi \mathrm{\Pi }`$ .

If $`\mathrm{\Pi }`$ is a hub, then $`(\mathrm{\Pi },\mathrm{\Gamma },\pi )<\epsilon `$ by property (Z2.3) because otherwise a subdiagram containing hubs $`\pi `$ and $`\mathrm{\Pi }`$ could be replaced by a subdiagram of rank 0, but $`\mathrm{\Delta }`$ is a g-reduced diagram. If $`\mathrm{\Pi }`$ has rank $`1`$, then every maximal $`Y`$-band of $`\mathrm{\Gamma },`$ starting on $`\mathrm{\Pi },`$ must end on $`\pi `$ by Lemma 3.2, and so $`\mathrm{\Gamma }\mathrm{\Pi }`$ cannot contain a subword of length $`>|A|`$ since every letters of $`\varphi (\mathrm{\Gamma }\pi )`$ are distinct by $`(Z2.2)`$. Therefore $`(\mathrm{\Pi },\mathrm{\Gamma },\pi )\iota <\epsilon `$ by A1, and the lemma claim is proved for a contiguity subdiagram between a hub and another cell.

If $`\pi =\mathrm{\Pi }`$, then again the bond $`E`$ has rank 0, because otherwise the principal cell $`\pi ^{}`$ of this bond differs from $`\pi `$, and, by previous case, $`\pi ^{}`$ possesses no contiguity subdiagram of degree $`\epsilon `$ to $`\pi `$ contrary to the definition of a bond. Then $`r(\mathrm{\Gamma })=0`$ as above, and the assumption $`(\pi ,\mathrm{\Gamma },\pi )>\epsilon `$ would contradict property (Z2.2).

Finally, if $`\mathrm{\Gamma }`$ is the contiguity subdiagram of the hub $`\pi `$ to the boundary section $`p`$ given in the lemma hypothesis, then again the rank of the bond $`E`$ is 0 as above, and then the same argument shows that $`r(\mathrm{\Gamma })=0.`$

###### Lemma 3.38.

A g-reduced diagram $`\mathrm{\Delta }`$ of rank $`i_+`$ is an A-map.

###### Proof.

1) Hubs have rank 1/2 and perimeter at least $`n`$ by property (Z2.1). The perimeter of a cell with a period of a positive integer rank $`ji_+`$ is equal to $`nj`$. Thus $`\mathrm{\Delta }`$ satisfies condition A1.

2) Let $`q`$ be a subpath of $`(\mathrm{\Pi })`$, where $`r(\mathrm{\Pi })=ji_+,`$ and let $`|q|\mathrm{max}(j,2).`$ Let $`p`$ be a path homotopic to $`q`$ in $`\mathrm{\Delta },`$ and $`\mathrm{\Gamma }`$ denote the subdiagram with contour $`p^1q.`$ If $`\mathrm{\Pi }`$ does not occur in $`\mathrm{\Gamma }`$, then the type of $`\mathrm{\Gamma }`$ is smaller than that of $`\mathrm{\Delta }`$, and $`\mathrm{\Gamma }`$ is an $`A`$-map by the inductive hypothesis. If also $`|q|2`$ and $`|p|<2`$, then $`|(\mathrm{\Gamma })|3`$, and $`r(\mathrm{\Gamma })=0`$ by Lemma 2.8. Then $`\varphi (p)=\varphi (q)`$ in $`𝐆(0)`$, which is impossible by the cyclic irreducibility of periods and, if $`\mathrm{\Pi }`$ is a hub, by (Z2.2).

We suppose next that $`|q|j`$ and $`j>1.`$ If $`|p|<|q|,`$ then $`|(\mathrm{\Gamma })|<2j,`$ and by Lemma 2.8, the perimeters of all cells of positive rank in $`\mathrm{\Gamma }`$ are less than $`2j\overline{\beta }^1,`$ and so $`r(\mathrm{\Gamma })<2j\overline{\beta }^1n^1<j`$ by A1. In this case, one can find a subword $`\varphi (q)`$ of the cyclic permutation of the period $`A`$ of $`\mathrm{\Pi }`$, equal in rank $`j1`$ to the shorter word $`\varphi (p)`$. Thus, one has a simple in rank $`j1`$ word $`A`$ that is a conjugate in rank $`j1`$ of a word of length $`<|A|`$; a contradiction.

We now assume that $`\mathrm{\Pi }`$ occurs in $`\mathrm{\Gamma }`$. Then $`\mathrm{\Pi }`$ does not occur in the subdiagram $`\mathrm{\Gamma }^{}`$ with contour $`pq^{}`$ where $`q^{}`$ is the complement of $`q`$ in the contour of $`\mathrm{\Pi }.`$ Thus $`\mathrm{\Gamma }^{}`$ is an $`A`$-map by the inductive hypothesis. If $`r(\mathrm{\Pi })1,`$ then, by Lemma 3.17 2), no cell of $`\mathrm{\Gamma }^{}`$ is compatible with $`q^{}`$. Hence, applying Lemma 3.39 to $`\mathrm{\Gamma }^{},`$ $`q^{}`$ is a smooth section in $`(\mathrm{\Gamma }^{})`$, and by Lemma 2.7, $`\overline{\beta }|q^{}||p|.`$ Therefore

$$|q|2(n2)^1|q^{}|2\overline{\beta }^1(n2)^1|p|<|p|.$$

It remains to suppose that $`\mathrm{\Pi }`$ is a hub. Then, by Lemma 3.37, there is no cell in $`\mathrm{\Gamma }^{}`$ with a contiguity subdiagram to $`q^{}`$ of degree $`\epsilon .`$ Hence $`q^{}`$ is a smooth section in $`(\mathrm{\Gamma }^{})`$. Then again $`|q|2(n2)^1\overline{\beta }^1|p|<|p|,`$ which completes the verification of condition A2.

3) Let $`\mathrm{\Gamma }`$ be a contiguity subdiagram of a cell of rank $`j`$ to a cell of rank $`k`$ in $`\mathrm{\Delta }`$, with $`p_1q_1p_2q_2=(\pi ,\mathrm{\Gamma },\mathrm{\Pi })`$ and $`(\pi ,\mathrm{\Gamma },\mathrm{\Pi })\epsilon .`$ Then $`k1`$ by Lemma 3.37, and $`\mathrm{\Gamma }`$ is an $`A`$-map by the inductive hypothesis.

Assume first that $`j=1/2.`$ Then $`r(\mathrm{\Gamma })=0`$ by Lemma 3.37. By Lemma 3.2 every maximal $`Y`$-band of $`\mathrm{\Gamma }`$ starting on $`q_2`$ must end on $`q_1,`$ and therefore, by property (Z2.2), all the edges of $`q_2`$ have distinct labels. Hence $`|q_2||A|=k<(1+\gamma )k`$ where $`A`$ is the period of $`\mathrm{\Pi }.`$

Then suppose that $`j1.`$ In this case, $`q_1`$ and $`q_2`$ are smooth sections of ranks $`j`$ and $`k`$, respectively, in $`(\mathrm{\Gamma })`$ by Lemma 3.17 2) and Lemma 3.39 applied to $`\mathrm{\Gamma }.`$ Thus, applying Lemma 2.1 to $`\mathrm{\Gamma },`$ $`|p_1|,|p_2|<\zeta n\mathrm{min}(j,k).`$ Hence, by Lemma 2.14, $`r=r(\mathrm{\Gamma })<\mathrm{min}(j,k),`$ and, by Lemma 3.36, the periods $`B,A`$ corresponding to $`\pi `$ and $`\mathrm{\Pi }`$ are simple in rank $`r.`$ Thus, applying Lemma 3.35 to $`\mathrm{\Gamma }`$, either $`|q_2|<(1+\gamma )|A|=(1+\gamma )k`$ (that is, condition A3 holds), or $`A=XB^{\pm 1}RX^1`$ in rank $`r`$ for $`R\mathrm{𝟎}(B)`$, and therefore $`AB`$ by Lemma 3.36. Hence, by Lemma 3.35, $`q_1`$ and $`q_2`$ are compatible, contradicting Lemma 3.17 1). This completes the proof. ∎

###### Lemma 3.39.

Let $`p`$ be a section of a contour of a g-reduced diagram $`\mathrm{\Delta }`$ of rank $`i_+`$ and one of the following two conditions holds.

(1) The path $`p`$ is not a cyclic section and $`\varphi (p)`$ is an $`A`$-periodic word where $`A`$ is a period of a rank $`ki_+,`$ and there are no cells in $`\mathrm{\Delta }`$, compatible with $`p`$, or a simple word in rank $`i_+`$.

(2)The path $`p`$ is a cyclic section and $`\varphi (p)A^mP`$ where $`A`$ is a simple in rank $`i_+`$ word and $`P\mathrm{𝟎}(A)`$.

Then $`p`$ is a smooth section of rank $`|A|`$ in $`(\mathrm{\Delta })`$.

###### Proof.

Case 1. Suppose first that assumption (1) from the lemma holds. Let us check two conditions from the definition of a smooth section.

1) Let $`q`$ be a subpath in $`p`$, $`|q|\mathrm{max}(|A|,2)`$, and $`t`$ a path homotopic to $`q`$ in $`\mathrm{\Delta }.`$ The subdiagram $`\mathrm{\Gamma }`$ with contour $`qt^1`$ is an A-map by Lemma 3.38. If $`|t|<|q|2,`$ then $`|(\mathrm{\Gamma })|3`$, which gives a contradiction as in the proof of Lemma 3.38. We can thus assume that $`|q||A|.`$ If $`A`$ is a simple in rank $`i_+,`$ word then it is not a conjugate in rank $`i_+`$ of a shorter word, and so we have, for the subword $`\varphi (q)`$ of a cyclic permutation of $`A`$, $`|\varphi (q)||\varphi (t)|,`$ since $`\varphi (q)=\varphi (t)`$ in rank $`i_+.`$ This enables us to assume that $`r(A)=ki_+.`$

If we now suppose that $`|t|<|q|,`$ then $`|(\mathrm{\Gamma })|<2k,`$ and by Lemma 2.8, $`r(\mathrm{\Gamma })=j<k.`$ Then by Lemma 3.36, $`A`$ is simple in rank $`j`$, and we arrive at the previous case. Thus, the first condition in the definition of smoothness of section of rank $`|A|`$ is verified.

2) Let $`\mathrm{\Gamma }`$ be a contiguity subdiagram of a cell $`\mathrm{\Pi }`$ of rank $`j`$ to $`q,`$ where $`(\mathrm{\Pi },\mathrm{\Gamma },q)=p_1q_1p_2q_2`$ and $`(\mathrm{\Pi },\mathrm{\Gamma },q)\epsilon .`$ If $`j=1/2,`$ then $`|q_2||A|<(1+\gamma )|A|`$ as in the proof of Lemma 3.38. Hence we suppose that $`j1`$ and $`B`$ is the period for $`\mathrm{\Pi }.`$

Subdiagram $`\mathrm{\Gamma }`$ is an A-map by Lemma 3.38, and by the inductive hypothesis $`q_2`$ is a smooth section of rank $`|A|`$ in $`(\mathrm{\Gamma }).`$ The section $`q_1`$ is smooth of rank $`j`$ by lemmas 3.17 2) and 3.39 applied to $`\mathrm{\Gamma }.`$ Applying Lemma 2.1 to $`\mathrm{\Gamma }`$, $`|p_1|,|p_2|<\zeta n\mathrm{min}(j,|A|).`$ Hence, by Lemma 2.14, $`r=r(\mathrm{\Gamma })<\mathrm{min}(j,|A|),`$ and by lemma 3.36, the periods $`A`$ and $`B`$ are simple in rank $`r.`$ So, applying Lemma 3.35 to $`\mathrm{\Gamma },`$ either $`|q_2|<(1+\gamma )|A|`$ (that is, the second condition in the definition of smooth section holds), or $`A=XB^{\pm 1}RX^1`$ in rank $`r`$, where $`R\mathrm{𝟎}(B).`$ Then, by Lemma 3.36, $`AB^{\pm 1}`$, and by Lemma 3.35, $`q_1`$ and $`q_2`$ are $`A`$-compatible in $`\mathrm{\Gamma }`$, that is, $`\mathrm{\Pi }`$ and $`q`$ are $`A`$-compatible in $`\mathrm{\Delta }`$, contrary to the hypothesis of the lemma

Case 2. Suppose now the assumption (2) of the lemma holds. The label of the contiguity arc $`q_2`$ in item 2) (and $`\varphi (q)`$ in item 1)) can be of the form $`U_1PU_2`$ where $`U_1U_2`$ is a phase decomposition of an $`A`$-periodic word. By the definition of $`\mathrm{𝟎}(A)`$, by Lemma 3.6 and by Lemma 3.7 $`PU_2=U_2P^{}`$ in $`𝐆(0)`$, where $`P^{}\mathrm{𝟎}(A^{})`$,$`|P^{}|=0`$, $`A^{}`$ is a cyclic permutation of $`A`$ and $`UU_1U_2`$ is an $`A^{}`$-periodic word with phase decomposition $`U1.`$ Hence one can transform $`\mathrm{\Gamma }`$ by adding a subdiagram of rank $`0`$ whose contour labelled by $`UP^{}(U_1PU_2)^1.`$ The new diagram $`\mathrm{\Gamma }^{}`$ can be considered as in Case 1, because $`|P^{}|=0`$ and $`P^{}`$ can be can be considered a part of the label of the side arc of $`\mathrm{\Gamma }^{}.`$

The lemma is proved. ∎

This together with Lemma 3.36 1) complete the proof of Proposition 3.19.

Proposition 3.19 immediately implies the following statement that shows that one can construct analogs of HNN extensions in the class of groups of odd exponent $`n>>1`$.

###### Corollary 3.40.

Let $`G=A|R`$ be a group satisfying the identity $`x^n=1`$ for some odd $`n>>1`$. Let $`P_i,Q_i`$ be subgroups of $`G`$, $`i=1,2,\mathrm{},k`$, $`k1`$, and for each $`i=1,..,k`$, let $`\varphi _i:P_iQ_i`$ be an isomorphism. Let $`H`$ be the (multiple) HNN extension of $`G`$ corresponding to these pairs of isomorphic subgroups,

$$H=A,t_1,\mathrm{},t_k|R,t_iut_i^1=\varphi _i(u),\text{ for all }uP_i,i=1,\mathrm{},k.$$

Consider $`A`$ as a set of $`0`$-generators and $`Y=\{t_1,\mathrm{},t_k\}`$ as the set of non-zero generators of $`H`$. Suppose that $`H`$ satisfies the conditions (Z3.1) and (Z3.2) (or (Z3.1) and (Z3.2’)). Then the natural homomorphism $`GH/H^n`$ is an embedding.

###### Proof.

Indeed, notice that $`H`$ obviously satisfies conditions (Z1). Conditions (Z2) also are satisfied because there are no hubs. Conditions (Z3) are satisfied by our assumption. Hence by Proposition 3.19 every $`g`$-reduced diagram over some graded presentation $`RS_1S_2\mathrm{}`$ of $`H/H^n`$ is an A-map, and every relator in $`S_i`$, $`i=1,2,\mathrm{}`$ is of the form $`A^n`$ where $`A`$ is a cyclically reduced word of $`Y`$-length $`i`$.

Let $`W`$ be a word in $`A`$ which is equal to $`1`$ in $`H/H^n`$. Let $`\mathrm{\Delta }`$ be a $`g`$-reduced van Kampen diagram with boundary label $`W`$. If the rank of $`\mathrm{\Delta }`$ is at least 1 then by Lemma 2.5 $`\mathrm{\Delta }`$ contains a cell $`\mathrm{\Pi }`$ of rank $`1`$ and a contiguity subdiagram of rank $`0`$ of $`\mathrm{\Pi }`$ to $`(\mathrm{\Delta })`$ with non-zero contiguity degree. This implies that the label of $`(\mathrm{\Delta })`$ must contain a letter from $`Y`$, a contradiction (we assumed that $`W`$ contains only letters from $`A`$). Hence $`\mathrm{\Delta }`$ has rank 0, so $`\mathrm{\Delta }`$ is a diagram over $`R`$. Hence $`W=1`$ in $`G`$. ∎

###### Remark 3.41.

Sergei Ivanov also proved Corollary 3.40. We added this corollary in our paper after the second author attended Ivanov’s talk at the Geometric Group Theory conference in Montreal (May, 2002). A particular case of that corollary has been obtained by K.V.Mikhajlovskii . He considered the case when $`k=1`$, each of the subgroups $`P_1`$ and $`Q_1`$ is malnormal (i.e. $`P_1xP_1x^1=\{1\}`$ if $`xG\backslash P_1`$, $`Q_1xQ_1x^1=\{1\}`$ if $`xG\backslash Q_1`$), and $`xP_1x^1Q_1=\{1\}`$ for every $`xG`$. In that case $`\mathrm{𝟎}(h)=\{1\}`$ for every non-zero cyclically minimal element $`hH`$. Hence condition (Z3) trivially holds.

## 4 Subgroups of the free Burnside groups.

In this section we prove certain properties of free Burnside groups. Although Theorem 4.4 below is of independent interest, this section plays an auxiliary role in the paper and can be skipped in the first reading.

### 4.1 Sets of words with small cancellation

Let $`𝒜=\{a_1,\mathrm{},a_m\}`$ be an alphabet. For a constant $`c>1`$, we say that a word $`v`$ is $`c`$-aperiodic if for every word $`A`$, there are no non-empty $`A`$-periodic subwords $`w`$ of $`v`$ with $`|w|c|A|.`$

###### Lemma 4.1.

For every $`\epsilon >0`$, one can find $`m=m(\epsilon )`$ such that the set of (positive) $`(1+\epsilon )`$-aperiodic words in the alphabet $`𝒜_m=\{a_1,\mathrm{},a_m\}`$ is infinite. Moreover, the number $`f(i)`$ of such words of length $`i1`$ is greater than $`m^{(1\epsilon /2)i}.`$

###### Proof.

First notice that one can assume that $`\epsilon `$ is sufficiently small and fix a number $`m`$ such that

$$mm^{\frac{\epsilon }{2}+\frac{1}{1+\epsilon }}m^{1+\frac{\epsilon }{2}+\frac{2}{1+\epsilon }}>m^{1\frac{\epsilon }{2}}m^{\frac{1}{1+\epsilon }}$$
(14)
Obviously, $`f(1)=m>m^{1\epsilon /2}.`$ We will prove the inequality $`f(i+1)>m^{1\epsilon /2}f(i)`$, for $`i1,`$ by induction on $`i.`$

By adding a letter to a $`(1+\epsilon )`$-aperiodic word $`w^{}`$ of length $`i`$ on the right, one obtains $`mf(i)`$ words of length $`i+1.`$ But some of these words $`w`$ may contain non-empty $`A`$-periodic subwords $`v`$ with $`|v|(1+\epsilon )|A|`$ for some $`|A|.`$ We need an upper estimate for the number of such “bad” possibilities.

Clearly, the subword $`v`$ must be a suffix of $`w`$, $`wuv,`$ since otherwise $`v`$ would be a subword of the prefix $`w^{}`$ of length $`i`$ in $`w.`$ Further we may assume that the word $`v`$ starts with the period $`A`$, and the previous argument shows that $`A`$ is uniquely determined by $`v`$, because otherwise word $`w^{}`$ were not $`(1+\epsilon )`$-aperiodic. Since $`|v|(1+\epsilon )|A|,`$ the total number of the words $`v`$ of length $`k`$, which can occur, is at most $`m^{\frac{k}{1+\epsilon }}`$. Therefore the number of “bad” products $`wuv`$ with $`|v|=k`$ and $`|u|=n+1k`$, is at most $`f(n+1k)m^{\frac{k}{1+\epsilon }}.`$ By using the inductive hypothesis, one can substitute the first factor by $`f(n)m^{(1k)(1\epsilon /2)}.`$ Then, by summing over $`k2,`$ we obtain

$$f(n+1)>mf(n)f(n)\underset{k=2}{\overset{\mathrm{}}{}}m^{(1\epsilon /2)(1k)+\frac{k}{1+\epsilon }}=$$

$$f(n)\left(m\frac{m^{1+\frac{\epsilon }{2}+\frac{2}{1+\epsilon }}}{1m^{1+\frac{\epsilon }{2}+\frac{1}{1+\epsilon }}}\right)>m^{1\epsilon /2}f(n)$$

by (14), as required. ∎

###### Lemma 4.2.

For any $`\epsilon >0,`$ there exists $`m=m(\epsilon )`$ and an infinite set $`S`$ of (positive) words $`A_1,A_2,\mathrm{}`$ in the alphabet $`𝒜_m=\{a_1,\mathrm{},a_m\}`$ such that:

(1) every reduced product, whose factors belong to $`S,`$ has no non-empty $`A`$-periodic subwords of length $`(1+\epsilon )|A|`$ unless the word $`A`$ is freely conjugate to a product of some words of $`S`$;

(2) suppose that $`A^{}UV^{}`$ and $`A^{\prime \prime }UV^{\prime \prime }`$, or $`A^{}V^{}U`$ and $`A^{\prime \prime }V^{\prime \prime }U,`$ are distinct cyclic permutations of the words of $`S`$ (that is, $`U`$ is a common prefix or a common suffix). Then $`|U|<\frac{\epsilon }{10}\mathrm{min}(|A^{}|,|A^{\prime \prime }|).`$

(3) $`|A_i|n`$, $`i=1,2,\mathrm{}`$.

###### Proof.

We can assume that $`\epsilon <1/3`$ and choose a number $`m_1=m_1(\epsilon _1)`$ for $`\epsilon _1=\epsilon /10`$ and an infinite set of positive words $`B_1,B_2,\mathrm{}`$ in alphabet $`𝒜_{m_1}`$, according to Lemma 4.1. Then define $`m=sm_1`$ for a number $`s2\epsilon _1^1.`$

Set $`A_i=B_{i,1}\mathrm{}B_{i,s}`$ for $`i=1,2,\mathrm{}`$, where $`B_{i,j}`$ are the copies of the word $`B_i`$ in the alphabet $`𝒜_j=\{a_{1j},\mathrm{},a_{m_1j}\}`$. Throwing out, if necessary, a finite subset of $`\{A_1,A_2,\mathrm{}\}`$ we can assume that $`|A_i|n`$. Hence property (3) holds. Property (2) follows from the inequality $`s2\epsilon _1^1`$ because the alphabets $`𝒜_j`$ are disjoint.

In particular, in any product $`A_iA_j^1,`$ we can cancel at most $`\epsilon _1`$ (in length) of $`A_i`$ or $`A_j`$ if $`ij,`$ and no letter of $`B_{i,s1}`$ or $`B_{j,s1}^1`$ can be cancelled in the product. Similar remark concerns the product $`A_i^1A_j.`$

To prove (1), suppose that $`v`$ is a non-empty $`A`$-periodic subword of a reduced form $`w\overline{A}_{i_1}^{\pm 1}\mathrm{}\overline{A}_{i_l}^{\pm 1}`$ of a product $`A_{i_1}^{\pm 1}\mathrm{}A_{i_l}^{\pm 1},`$ and $`|v|(1+\epsilon )|A|.`$ We may assume that $`vA^{}A^{\prime \prime }A^{},`$ where $`AA^{}A^{\prime \prime }`$ and $`|A^{}|\epsilon |A|,`$ because otherwise we can just shorten the subword $`v.`$

Assume first that both occurrences $`A^{}`$ are contained in the same factor $`\overline{A}_{i_r}^{\pm 1}`$ of $`w.`$ Then $`v^{\pm 1}`$ is a subword of the product $`B_{i_r1}\mathrm{}B_{i_rs}`$, and the both occurrences of $`A^{}`$ are present in some $`B_{i_rj}.`$ Hence $`v`$ is a subword of $`B_{i_rj},`$ contrary to the choice of the words $`B_1,B_2\mathrm{}.`$

Now assume, the first $`A^{}`$ of the decomposition of $`v`$ starts in some $`\overline{A}_{i_l}^{\pm 1}`$, and the last $`A^{}`$ ends in some $`\overline{A}_{i_r}^{\pm 1}`$ with $`r>l.`$ Then the definition of the words $`A_i`$ implies that $`v`$ must contain at least $`\frac{s3}{2}>\frac{2}{5}s`$ factors $`B_{i_lj}`$ of some $`A_{i_k}`$ where $`lkr.`$ Then

$$|A^{}|\epsilon (1+\epsilon )^1|v|>\epsilon (1+\epsilon )^1\frac{2}{5}|A_{i_k}|>3\epsilon _1|A_{i_k}|$$

By the choice of $`s`$, $`A^{}`$ contains a subword $`(B_{i_k,t}B_{i_k,t+1}B_{i_k,t+2}B_{i_k,t+3})^{\pm 1}`$ for some $`t.`$ We will suppose that the exponent is equal to $`+1`$. Hence a cyclic permutation of $`A`$ is freely equal to a word $`(B_{i_k,t+2}B_{i_k,t+3})\mathrm{}(B_{i_k,t}B_{i_k,t+1}).`$ This subword of $`w`$ must be freely equal to a cyclic permutation of a product of a number of factors $`A_i^{\pm 1}`$, because there is only one occurrence of the form $`B_{j,q}B_{j,q+1}`$ in all the words $`A_1,A_2,\mathrm{}`$. The lemma is proved. ∎

###### Remark 4.3.

In the proof of Theorem 1.1, we do not need infinite collections of words satisfying the conditions of Lemma 4.2. We only need a collection of words satisfying that conditions and consisting of $`Cm`$ words where $`C`$ is a constant depending on $`n`$ (but not on $`m`$), $`C>n>\frac{20}{\epsilon }`$, and $`m`$ is a sufficiently large integer.

An explicit and easy construction of such collections of words can be found in . Let us repeat this construction here. Let us fix integers $`r>C^2`$ and $`m=rn`$. Consider an $`r^2\times n`$-matrix $`M`$ where every odd-numbered column is equal to

$$(1,2,\mathrm{},r,1,2,\mathrm{},r,\mathrm{},1,2,\mathrm{},r)$$

and every even-numbered column is equal to

$$(1,1,\mathrm{},1,2,2,\mathrm{},2,\mathrm{},r,r,\mathrm{},r).$$

Now let us replace every number $`i`$ in column $`j`$ of $`M`$ by letter $`a_{i,j}`$. Rows of the resulting matrix can be viewed as words of length $`n`$ over the alphabet with $`m=rn`$ letters $`\{a_{i,j},i=1,\mathrm{},r,j=1,\mathrm{},n\}`$. For example the first word is equal to $`a_{1,1}a_{1,2}\mathrm{}a_{1,n}`$, etc. Let $`S=\{w_1,\mathrm{},w_{r^2}\}`$ be the collection of these words. Let us call words from $`S`$ and their inverses blocks.

It is mentioned in  (and obvious) that no two different words in $`S`$ have a common subword of length $`2`$. Condition (3) of Lemma 4.2 holds by definition of the blocks. Since $`n>\frac{20}{\epsilon }`$, condition (2) of Lemma 4.2 holds.

To prove (1), consider a reduced product $`W=w_{i_1}^{s_1}\mathrm{}w_{i_k}^{s_k}`$ of words from $`S`$, $`s_i=\pm 1`$, where $`w_{i_j}^{s_j}w_{i_{j+1}}^{s_{j+1}}1`$, $`j=1,\mathrm{},k1`$. Suppose that $`W`$ contains an $`A`$-periodic subword $`V`$ where $`|V|>(1+\epsilon )|A|`$. Since $`n>4/\epsilon `$, we can assume that $`V`$ contains a subword $`AB`$ where $`B`$ is the beginning of $`A`$ of length $`4`$. Then either the first two letters of $`B`$ are in one block of $`W`$ or the last two letters of $`B`$ are in one block of $`W`$. Since every block is completely determined by any of its 2-letter subwords, we can shift $`A`$ to the left or to the right in $`W`$, replacing $`A`$ by a cyclic shift $`A^{}`$ of $`A`$, such that $`A^{}`$ starts with the beginning of a block and ends with the end of a block. Then $`A^{}`$ is a product of blocks as required.

### 4.2 Subgroups of $`B(m,n)`$ satisfying the congruence
extension property

Recall that a subgroup $`HG`$ satisfies the congruence extension property if for every normal in $`H`$ subgroup $`N`$ there is a normal subgroup $`L`$ of $`G`$, such that $`N=LH.`$

In this section, we prove

###### Theorem 4.4.

For any sufficiently large odd $`n,`$ there exists $`m=m(n)`$ such that the free Burnside group $`B(m,n)`$ has a subgroup $`H`$ with three properties:

(1) $`H`$ is isomorphic to the free Burnside group $`B(\mathrm{},n)`$ of the infinite countable rank;

(2) $`H`$ satisfies the congruence extension property in $`B(m,n)`$.

(3) the words $`A_1,A_2,\mathrm{}`$ representing the free generators of $`H`$ can be effectively chosen in accordance with Lemma 4.2, and for every $`l1`$, the free Burnside subgroup generated by $`A_1,\mathrm{},A_l`$, also possesses the congruence extension property in $`B(m,n).`$

The statements (1) and (2) constitute Theorem 1.2. The proof of Theorem 4.4 follows very closely Section 6 of  although we repeat a few notation and definitions from .

In particular, we use the positive parameters $`\alpha ,\beta ,\gamma ,\delta ,\epsilon ,\zeta ,\iota ,n`$ from Section 2. Let $`m=m(\epsilon )`$ be taken according to Lemma 4.2. Then we fix the infinite set of words $`A_1,A_2,\mathrm{}`$ which exists by Lemma 4.2. By Lemma 4.2 (3) the words $`A_k`$ are sufficiently long, say, $`|A_k|n.`$ Let $`H`$ be the subgroup generated by all words $`A_1,A_2,\mathrm{}`$ in the free Burnside group $`B(m,n)`$ with the free basis $`𝒜=\{a_1,..,a_m\}.`$

Suppose that $`v`$ is a (cyclically) reduced word of length $`t`$ in certain variables $`x_1,\mathrm{},x_s`$. The (cyclic) word $`v(A_1,\mathrm{},A_s)A_{i_1}^{\eta _1}\mathrm{}A_{i_t}^{\eta _t}`$ obtained by replacing $`A_i`$ for $`x_i`$ will be called a (cyclic) $`H`$-word and will be considered together with its decomposition into factors $`A_{i_1}^{\eta _1},\mathrm{},A_{i_t}^{\eta _t}.`$

###### Lemma 4.5.

The words $`A_1,A_2\mathrm{},`$ satisfying conditions (1) and (2) of Lemma 4.2, freely generate a free Burnside subgroup (of infinite countable rank) of exponent $`n`$ in the group $`B(m,n).`$

###### Proof.

To prove the lemma, we consider the graded presentation of $`B(m,n)`$ from Section 18 in . Assume there is a non-trivial relation $`v(A_1,\mathrm{},A_l)=1`$ . Then there is a g-reduced diagram $`\mathrm{\Delta }`$ of some rank $`i>0`$ whose boundary label $`\varphi (q)`$ is freely equal to an $`H`$-word. Proving by contradiction, we may suppose that the number of cells of $`\mathrm{\Delta }`$ is minimal.

By Lemma 2.5, there is a cell $`\mathrm{\Pi }`$ of $`\mathrm{\Delta }`$ and a contiguity subdiagram $`\mathrm{\Gamma }`$ with $`(\mathrm{\Pi },\mathrm{\Gamma },q)\epsilon .`$ Since $`n\epsilon >2,`$ we obtain, by Lemma 4.2(1), (3) that $`\mathrm{\Pi }`$ corresponds to a period $`A`$ where $`A`$ is freely conjugate to an $`H`$-word $`\overline{A}`$. By Lemma 4.2(2) the boundary label $`\varphi (q^{})`$ of the subdiagram $`\mathrm{\Delta }^{},`$ obtained from $`\mathrm{\Delta }`$ by cutting off the cell $`\mathrm{\Pi }`$, is freely equal to an $`H`$-word also, and $`\varphi (q)`$ is freely equal to the product of $`\varphi (q^{})`$ and a word $`X\overline{A}^nX^1`$ for some $`H`$-word $`X.`$ By the minimality of $`\mathrm{\Delta },`$ diagram $`\mathrm{\Delta }^{}`$ corresponds to a relation $`v^{}(A_1,\mathrm{},A_l)=1`$ such that $`v^{}(x_1,\mathrm{},x_l)`$ follows from the Burnside identity $`x^n=1`$. Then the relation $`v(A_1,\mathrm{},A_l)=1`$ follows from Burnside relations too. ∎

Let $`\mathrm{\Delta }`$ be a map. A smooth section $`q`$ of rank 1 in the contour $`(\mathrm{\Delta })`$ is said to be $`\epsilon `$-section if for any cell $`\pi `$ of $`\mathrm{\Delta }`$ and any contiguity subdiagram $`\mathrm{\Gamma }`$, $`(\pi ,\mathrm{\Gamma },q)<\epsilon .`$

Let us now fix an arbitrary normal subgroup $`N`$ in $`H`$. We would like to define a group presentation of the factor group of $`B(m,n)`$ by the normal closure of $`N`$ in $`B(m,n)`$.

We denote by $`T`$ the set of all $`H`$-words (in the alphabet $`a_1,\mathrm{},a_m`$) representing elements of $`N`$, that are cyclically reduced as elements of the free subgroup $`H`$ (of the absolutely free group) with generators $`A_1,A_2,\mathrm{}.`$ In particular, $`T`$ contains all powers of the form $`v(A_1,\mathrm{},A_s)^n.`$ The following alteration of the definitions from Section 18 of  depends on $`N`$.

We define $`𝐆(0)=F(𝒜)`$ to be the absolutely free group with the empty set $`_0`$ of defining words. For every $`i0`$ a non-trivial word $`A`$ is called simple in rank $`i`$ if it is not conjugate in rank $`i`$ (i.e. in group $`𝐆(i)`$) either to a power of a period $`B`$ of rank $`k`$, where $`1ki,`$ or to a power of a word $`C`$, where $`|C|<|A|`$, or to an $`H`$-word.

Every word of $`T`$ is included in the system $`_1`$ of relators of rank 1. (Let us call them $`T`$-relators.) We also include words $`a_1^n,\mathrm{},a_m^n`$ in the system $`_1.`$ Every word $`a_k`$ of length 1 is, by definition, a period of rank 1, and $`𝐆(1)=𝒜|_1.`$

For ranks $`i2`$, the definitions of periods of rank $`i`$ and the group $`𝐆(i`$)=$`𝒜|_i,𝐆(\mathrm{}),`$ given in Section 18 of  remain valid.

Instead of Lemma 18.1  we claim now that the following statement holds.

###### Lemma 4.6.

Every word $`X`$ over $`𝒜`$ is a conjugate in rank $`i0`$ either of a power of some period of rank $`ji`$ or of a power of a simple in rank $`i`$ word, or of an $`H`$-word.

The proof can be easily derived from the definition as in .

Analogs of Lemma 18.2, Corollaries 18.1 and 18.2 are not used in the proof, so we do not need them now.

The following statement replaces Lemma 18.3 .

###### Lemma 4.7.

If a word $`X`$ has a finite order in rank $`i`$, then it is a conjugate in rank $`i`$ of a power of a period of rank $`ki`$ or of an $`H`$-word.

There are no changes in the proof as compared with .

Assume that $`\mathrm{\Pi }`$ is a $`T`$-cell (i.e. it corresponds to a $`T`$-relator) in a g-reduced annular diagram $`\mathrm{\Delta }`$ of rank $`i,`$ and $`\mathrm{\Gamma }`$ is a contiguity diagram of the cell $`\mathrm{\Pi }`$ to itself, such that the hole of $`\mathrm{\Delta }`$ is “surrounded” by $`\mathrm{\Pi }`$ and $`\mathrm{\Gamma }`$, i.e. the union of $`\mathrm{\Pi }`$ and $`\mathrm{\Gamma }`$ does not belong to any disc subdiagram of $`\mathrm{\Delta }`$ (see Figure 12).

Fig. 12.

The subdiagram $`\mathrm{\Gamma }`$ is of rank $`0`$ by Lemma 4.13 (1) applied for a smaller rank. If the degree of $`\mathrm{\Gamma }`$-contiguity of $`\mathrm{\Pi }`$ to $`\mathrm{\Pi }`$ is at least $`\epsilon ,`$ we call $`\mathrm{\Pi }`$ a hoop. The reduced boundary $`q`$ of a hoop can be decomposed as $`q_1pq_2\overline{p}^1`$, where $`p,\overline{p}`$ are the contiguity arcs of $`\mathrm{\Gamma },`$, $`\varphi (\overline{p})`$ is freely equal to $`\varphi (p)`$, and so $`|p|,|\overline{p}|\epsilon |q|`$. In view of property (2) of Lemma 4.2, there is a subpath $`p^{}`$ of $`p`$, such that $`\varphi (p^{})`$ is a unique subword of a unique word $`A_k^{\pm 1}.`$ (More details of such an argument can be found in §2 of .) This implies that the words $`\varphi (q_1)`$ and $`\varphi (q_2)`$ are freely conjugate to some $`H`$-words. Besides, it follows from $`T`$-relations that $`X\varphi (q_1)X^1=\varphi (q_2)^1`$ for some $`H`$-word $`X.`$

Lemma 18.4 in  remains unchanged:

###### Lemma 4.8.

If $`A`$ and $`B`$ are simple in rank $`i`$ and $`A`$ is equal in rank $`i`$ to $`XB^lX^1`$ for some $`X`$ then $`l=\pm 1`$.

The proof does not change much also. Notice only that by definition, a simple word of rank $`i1`$ cannot be conjugate in rank $`i`$ of an $`H`$-word. Therefore the diagram $`\mathrm{\Delta }`$ from the proof of Lemma 18.4 , cannot have hoops, and so the analog of Lemma 19.4  (see Lemma 4.15 below) is applicable.

The formulation of Lemma 18.5 changes as follows.

###### Lemma 4.9.

If words $`X`$ and $`Y`$ are conjugate in rank $`i`$ and $`X`$ is not a conjugate of any $`H`$-word in rank $`i`$ then there exists a word $`Z`$ such that $`X`$ is equal to $`ZYZ^1`$ in rank $`i`$ and $`|Z|\overline{\alpha }(|X|+|Y|)`$.

The additional assumption that $`X`$ is not a conjugate of an $`H`$-word again allows us to apply Lemma 4.15, the analog of Lemma 19.4 .

Consider a section $`q`$ of a contour of some diagram $`\mathrm{\Delta }`$, where $`\varphi (q)`$ is freely equal to an $`H`$-word. We call $`q`$ an $`H`$-section. Assume that there is a $`T`$-cell $`\mathrm{\Pi }`$ in $`\mathrm{\Delta }`$ with boundary path $`p`$ starting with a vertex $`o`$ of $`(\mathrm{\Pi }),`$ and there is a path $`t`$ having no self-intersections, which connects $`o`$ and a vertex $`o^{}`$ cutting $`q`$ into a product $`q_1q_2.`$ We say that $`\mathrm{\Pi }`$ is compatible with $`q`$, if the boundary label of the path $`q_1t^1ptq_2,`$ without self-intersections, is freely equal to an $`H`$-word. Obviously, one can cut such a cell out of $`\mathrm{\Delta }`$ replacing $`q`$ by another $`H`$-section. The definition of compatibility can be generalized in the case when $`\varphi (q)`$ is a subword of a reduced form $`W`$ of an $`H`$-word with $`|\varphi (q)|\epsilon |W|`$ in view of Lemma 4.2(2). (Such a path $`q`$ is also an $`H`$-section by definition.)

Similarly, one defines the compatibility of two $`T`$-cells in a diagram. A pair of two compatible $`T`$-cells can be substituted by (at most) one $`T`$-cell. Therefore a g-reduced diagram of some rank $`i`$ cannot contain pairs of compatible $`T`$-cells or $`j`$-pairs in the terminology of  for $`j=1`$. For Burnside cells (i.e. cells corresponding to relations of the form $`A^n=1`$ where $`A`$ is a period of rank $`j>0`$) we are using the same definition of $`j`$-pairs as in .

###### Lemma 4.10.

Assume that a word $`W`$ is a conjugate of an $`H`$-word in rank $`i.`$ Then $`W=UVU^1`$, in rank $`i,`$ for some $`H`$-word $`V`$ and some word $`U`$, such that $`|V|\overline{\beta }^1|W|`$ and $`|U|2|W|.`$

###### Proof.

Consider a g-reduced annular diagram $`\mathrm{\Delta }`$ for the conjugacy of $`W`$ to some $`H`$-word $`V`$. We may assume that there are no hoops in $`\mathrm{\Delta },`$ because otherwise one can replace $`\mathrm{\Delta }`$ by a diagram of a smaller type, that also demonstrates the conjugacy of $`W`$ to a subword of the boundary label of a hoop. For the same reason, we may assume that $`\mathrm{\Delta }`$ has no $`T`$-cells compatible with the contour, say $`p,`$ of $`\mathrm{\Delta }`$ labeled by $`V`$. Then $`\mathrm{\Delta }`$ is an $`A`$-map by Lemma 4.15, and $`p`$ is a smooth section of $`(\mathrm{\Delta })`$ by Lemma 4.16. Then $`|V|\overline{\beta }^1|W|`$ by Lemma 2.7, and the word $`U`$ can be taken in such a way that

$$|U|\overline{\alpha }(1+\overline{\beta }^1)|W|2|W|$$

by Lemma 4.9. ∎

The following Lemma implies malnormality of the subgroup $`H`$ in $`B(m,n).`$

###### Lemma 4.11.

Let $`V`$ and $`W`$ be two non-trivial in rank $`i`$ $`H`$-words and $`W=UVU^1`$ in rank $`i`$. Then the word $`U`$ is itself equal in rank $`i`$ to an $`H`$-word.

###### Proof.

Let $`\mathrm{\Delta }`$ be a g-reduced annular diagram of rank $`i`$ with contours $`p`$ and $`q`$ labeled by $`V`$ and $`W`$ respectively. One can assume that there is a path $`t=q_{}p_{}`$ in $`\mathrm{\Delta }`$, such that $`\varphi (t)=U`$ in rank $`i`$. Then it suffices to show that $`\varphi (t)`$ is freely equal to an $`H`$-word.

One can suppose that $`\mathrm{\Delta }`$ has no $`T`$-cells compatible with the contours, because otherwise our problem reduces to a similar problem for an annular diagram of smaller type. If $`\mathrm{\Delta }`$ has a hoop, then $`t`$ can be constructed as a product $`t_1t_2t_3`$ where the path $`t_2`$ cuts the hoop and $`t_1,t_3`$ are the cutting paths for annular subdiagrams of smaller types whose labels are $`H`$-words by induction. Thus, we may assume that there are no hoops in $`\mathrm{\Delta }.`$ Then both $`p`$ and $`q`$ are $`\epsilon `$-sections by Lemma 4.14. It follows that $`\mathrm{\Delta }`$ has rank 0, because otherwise the inequality $`\overline{\gamma }>2\epsilon ,`$ Lemma 2.4 and Lemma 4.15 lead to a contradiction. Then the desired property of $`\mathrm{\Delta }`$ follows from the malnormality of the subgroup generated by the words $`A_1,A_2,\mathrm{}`$ in the absolutely free group $`F(𝒜),`$ which, in turn, can be easily derived from the statement of Lemma 4.2(2). ∎

Next as in \[30, Section 18\] we prove analogs of lemmas 18.6,18.7, 18.8 by a simultaneous induction on the sum $`L`$ of the two periods involved in the formulations of these lemmas. The formulations of these lemmas do not change.

###### Lemma 4.12.

(Analog of Lemma 18.6 .) Let $`\mathrm{\Delta }`$ be a g-reduced disc diagram of rank $`i`$ with contour $`p_1q_1p_2q_2`$ where $`\varphi (q_1)`$ and $`\varphi (q_2^1)`$ are periodic words with period $`A`$ simple in rank $`i`$. If $`|p_1|,|p_2|<\alpha |A|`$ and $`|q_1|,|q_2|>(\frac{5}{6}h+1)|A|`$, then $`q_1`$ and $`q_2`$ are $`A`$-compatible in $`\mathrm{\Delta }`$. (The inductive parameter is $`L=|A|+|A|`$.)

###### Proof.

As in the proof of Lemma 18.6 from , assume that $`A`$ is a prefix of both $`\varphi (q_1)`$ and $`\varphi (q_2^1)`$ by making if necessary $`p_1`$ a little longer (by at most $`1/2|A|`$). The new path is also denoted by $`p_1`$.

Notice first that if $`\varphi (p_1)`$ is not a conjugate of an $`H`$-word in rank $`i`$ then in any g-reduced annular diagrams of rank $`i`$ where one of the contours is labeled by $`\varphi (p_1)`$, there are no hoops. So the proof proceeds as in .

Otherwise, as in , consider the annular diagram $`\overline{\mathrm{\Delta }}`$ of rank $`i`$ with boundary labels $`W\varphi (p_1)`$ and $`W^{}\varphi (q^{})\varphi (p_2)^1`$. Then $`W,W^{}`$ are conjugate in rank $`i`$ of some $`H`$-word. If $`W=1`$ in rank $`i`$ then there is nothing to prove. Thus we assume that the word $`W`$ is non-trivial in rank $`i`$.

Inequalities (2), (3) from Section 18 of  are still valid:

$$|W|<\overline{\alpha }|A|,|W^{}|<(\overline{\beta }^11)(\frac{5}{6}\delta ^1|A|+|A|)+2|A|<(\overline{\beta }^11)(|q_2|+2|A|)$$

By Lemma 2.10, one can find $`H`$-words $`V`$ and $`V^{}`$ such that

$$|V|\overline{\beta }^1|W|<\overline{\beta }^1\overline{\alpha }|A|<|A|,|V^{}|<\overline{\beta }^1(\overline{\beta }^11)(5/6\delta ^1|A|+|A|)<\beta \delta ^1|A|,$$

and, in rank $`i,`$ $`W=UVU^1,W^{}=U^{}V^{}U^1,`$ where $`|U|<2|A|,|U^{}|<2\beta \delta ^1|A|`$ by Lemma 4.10.

On the other hand, $`QWQ^1=W^{}`$, in rank $`i,`$ for $`Q\varphi (q_2),`$ $`|Q|>\frac{5}{6}\delta ^1|A|`$ (recall that $`h=\delta ^1`$). Therefore $`H`$-words $`V`$ and $`V^{}`$ are conjugate in rank $`i`$ by the product $`U^1QU.`$ By Lemma 4.11, this product must be equal, in rank $`i`$ to an $`H`$-word $`X`$.

Let $`\mathrm{\Delta }_0`$ be a g-reduced diagram of rank $`i`$ for the equality $`(U^{})^1QU=X.`$ Its contour has a natural decomposition $`(u^{})^1qux^1.`$ By changing $`H`$-word $`X,`$ one can suppose that there are no $`T`$-cells compatible with $`x`$ in $`\mathrm{\Delta }.`$ Hence this section is an $`\epsilon `$-section of $`\mathrm{\Delta }_0`$ by Lemma 4.14. Therefore the sum of the degrees of contiguity of an arbitrary cell $`\mathrm{\Pi }`$ of $`\mathrm{\Delta }`$ to $`q`$ and to $`x`$, is less than $`\overline{\alpha }+\epsilon <2/3`$ by Lemmas 2.3 and lemma 4.16 below. Recall that $`Q`$ is a periodic word with the simple in rank $`i`$ period $`A.`$

Notice that

$$|u^{}|+|u|<2(\beta \delta ^1+1)|A|<\frac{5}{6}\alpha ^2\delta ^1|A|<\alpha ^2|q|.$$

Thus, there is an 0-bond between $`q`$ and $`x`$ by Lemma 2.10 (we have mentioned above that the other possibility from that lemma is not possible). Then $`q=q(1)eq(2),`$ for the contiguity edge $`e`$ of the 0-bond. If the length of $`q(1)`$ or $`q(2)`$ is greater than $`2\alpha ^2(\beta \delta ^1+1)|A|,`$ then one is able to get a new $`0`$-bond between $`q`$ and $`x`$ by Lemma 2.10. By keeping obtaining new and new such $`0`$-bonds, we conclude, that there is a subpath $`q(0)`$ of $`q`$ and a contiguity subdiagram $`\mathrm{\Gamma }(0)`$ of rank 0 between $`q(0)`$ and $`x`$, where $`|q(0)|>|q|/2>2|A|>(1+\epsilon )|A|.`$

Consequently, a reduced form of the $`H`$-word $`X^1`$ has an $`A`$-periodic subword of length $`>(1+\epsilon )|A|.`$ By Lemma 4.2(1), the word $`A`$ is itself freely conjugate to an $`H`$-word. This contradicts the definition of simple words and completes the proof of our lemma. ∎

The proofs of Lemmas 18.7, 18.8 remain unchanged.

The formulations of lemmas 18.9 - 19.3  are left unchanged. The proofs are also unchanged. Only when we apply our analog of Lemma 18.3 (Lemma 4.7 above) in the proof of Lemma 18.9, we take into account that by $`T`$-relations every $`H`$-word has order dividing the odd number $`n`$ in rank $`i1`$. In the proof of the first statement of Lemma 19.3, one should remember that the reduced form of $`W^n`$ is included in the list of $`T`$-relators for an arbitrary $`H`$-word $`W.`$

In order to prove analogs of Lemmas 19.4 and 19.5 , we need two more Lemmas 4.13 and 4.14. These two lemmas and our analogs of Lemmas 19.4, 19.5  will be proved by a simultaneous induction on the number of positive cells.

###### Lemma 4.13.

Let $`\mathrm{\Gamma }`$ be a contiguity subdiagram of a cell $`\pi `$ to a $`T`$-cell $`\mathrm{\Pi }`$ in a g-reduced diagram $`\mathrm{\Delta }`$ of rank $`i+1.`$ Then:

(1) the rank $`r(\mathrm{\Gamma })`$ is $`0`$ and

(2) if $`\pi \mathrm{\Pi },`$ then $`(\pi ,\mathrm{\Gamma },\mathrm{\Pi })<\epsilon .`$

###### Proof.

We can assume that the statement of the lemma is not true and the triple $`(\pi ,\mathrm{\Gamma },\mathrm{\Pi })`$ is a minimal counterexample in the sense that $`|\mathrm{\Gamma }(2)|`$ is minimal possible.

Since $`|\mathrm{\Gamma }(2)|<|\mathrm{\Delta }(2)|`$, the subdiagram $`\mathrm{\Gamma }`$ is an $`A`$-map by Lemma 4.15. Let $`p_1q_1p_2q_2=(\pi ,\mathrm{\Gamma },\mathrm{\Pi }).`$ Notice that $`|p_1|=|p_2|=0,`$ because otherwise the principal cell of one of the bonds defining $`\mathrm{\Gamma }`$ would be a positive cell with degree of contiguity to $`\mathrm{\Pi }`$ at least $`\epsilon `$, which would contradict the minimality of our counterexample.

There are no cells in $`\mathrm{\Gamma }`$ which are compatible with either $`q_1`$ or $`q_2`$ because otherwise these cells would be compatible with cells in $`\mathrm{\Delta },`$ and $`\mathrm{\Delta }`$ would be a non-g-reduced diagram. Then $`q_2`$ is an $`\epsilon `$-section by Lemma 4.14(2) for $`\mathrm{\Gamma }.`$ Also $`q_1`$ is a smooth section in $`(\mathrm{\Gamma })`$ by Lemma 4.16 or 4.14 (2). Therefore the sum of contiguity degrees of any cell of $`\mathrm{\Gamma }`$ to $`q_1`$ and $`q_2`$ is less than $`\overline{\alpha }+\epsilon <\overline{\gamma },`$ and so $`r(\mathrm{\Gamma })=0`$ by Lemma 2.4.

Assume that $`(\pi ,\mathrm{\Gamma },\mathrm{\Pi })\epsilon .`$ It follows from Lemma 4.2(2) that the cells $`\pi `$ an $`\mathrm{\Pi }`$ are compatible if $`\pi `$ is a $`T`$-cell. But this is impossible in the g-reduced diagram $`\mathrm{\Delta }.`$ If $`\pi `$ is not a $`T`$-cell, we obtain a contradiction to the definition of periods by Lemma 4.2(1). Thus the lemma is proved by contradiction. ∎

###### Lemma 4.14.

Let $`\mathrm{\Gamma }`$ be a contiguity diagram of a cell $`\pi `$ to an $`H`$-section $`q`$ of the boundary of a g-reduced diagram $`\mathrm{\Delta }`$ of rank $`i+1.`$ Assume there are no $`T`$-cells compatible with $`q`$ in $`\mathrm{\Delta }.`$ Then:

(1) $`r(\mathrm{\Gamma })=0`$ and

(2) $`q`$ is an $`\epsilon `$-section of $`(\mathrm{\Delta }).`$

###### Proof.

The proof is analogous to the proof of Lemma 4.13. ∎

The formulation of Lemma 19.4 of  is modified:

###### Lemma 4.15.

A g-reduced diagram of rank $`i+1,`$ having no hoops, is an $`A`$-map.

###### Proof.

The perimeter of any $`T`$-cell is at least $`n`$ by Lemma 4.2 (3), and so condition A1 is true. The proof of part A2 remains the same except at the end the argument related to $`A`$-compatibility should be replaced by a similar argument related to the compatibility of a $`T`$-cell with an $`H`$-section, if the cell $`\mathrm{\Pi }`$ is a $`T`$-cell. The assumption $`(\pi ,\mathrm{\Gamma },\mathrm{\Pi })\epsilon ,`$ in part A3 means that $`\mathrm{\Pi }`$ is not a $`T`$-cell by Lemma 4.13(2), since $`\pi \mathrm{\Pi }`$ (the diagram contains no hoops). Therefore there are no changes in the proof of this part if $`\pi `$ is not a $`T`$-cell as well. Otherwise the inequality $`|q_2|<(1+\gamma )|A|`$ follows from Lemma 4.13(1) and Lemma 4.2(1) (because $`\gamma >\epsilon `$). ∎

We add one more possibility to the hypothesis of the analog of Lemma 19.5 in . This lemma is now formulated as follows.

###### Lemma 4.16.

Let $`p`$ be a section of the contour of a g-reduced diagram $`\mathrm{\Delta }`$ of rank $`i+1`$ and one of the following possibilities holds:

* The label of $`p`$ is an $`A`$-periodic word where $`A`$ is simple in rank $`i+1`$,
* The label of $`p`$ is an $`A`$-periodic word where $`A`$ is a period of rank $`ki+1`$, and $`\mathrm{\Delta }`$ has no cells of rank $`k`$ $`A`$-compatible with $`p`$.
* The label of $`p`$ is an $`H`$-word and there are no $`T`$-cells in $`\mathrm{\Delta }`$ which are compatible with $`p`$.

(If $`p`$ is a cyclic section then in the first two cases we further require that $`\varphi (p)A^m`$ for some integer $`m`$.) Then $`p`$ is a smooth section of rank $`|A|`$ in the first and the second cases and of rank 1 in the third case, in $`(\mathrm{\Delta })`$.

###### Proof.

We need to prove the two properties from the definition of a smooth section.

1. The proof that every subpath of $`p`$ of length $`\mathrm{max}(k,2)`$ is geodesic in $`\mathrm{\Delta }`$ coincides with part 1) in the proof of Lemma 19.5  if $`\varphi (p)`$ is not an $`H`$-word. In the case when $`\varphi (p)`$ is an $`H`$-word, this property follows from Lemmas 4.13, 2.8 and 4.2.

2. The proof that for every contiguity submap $`\mathrm{\Gamma }`$ of a cell $`\pi `$ to $`p`$ satisfying $`(\pi ,\mathrm{\Gamma },p)\epsilon `$ we have $`|\mathrm{\Gamma }p|<(1+\gamma )(i+1)`$ proceeds along the lines of part 2) of Lemma 19.5 . But we need to consider a new case when $`\pi `$ is a $`T`$-cell. In this case, $`r(\mathrm{\Gamma })=0`$ as in the proof of Lemma 4.13 (one should just replace $`\mathrm{\Pi }`$ by $`p`$). Then the inequality $`|q_2|(1+\gamma )(i+1)`$ follows from Lemma 4.2(1) and from the definition of $`T`$-relations.

If $`\varphi (p)`$ is an $`H`$-word, then the second property of smooth sections follows from Lemma 4.14 (2). ∎

###### Lemma 4.17.

The constructed group $`𝐆(\mathrm{})`$ satisfies identity $`x^n=1.`$

###### Proof.

This immediately follows from Lemma 19.3 (1)  (its formulation remains the same in our situation). That lemma states that the order of every word of length at most $`i`$, in rank $`i`$, is a divisor of $`n`$. ∎

Proof of Theorem 4.4. By Lemma 4.5, it remains to show that for arbitrary normal in $`H`$ subgroup $`N,`$ the intersection of the normal closure $`L`$ of $`N`$ in $`B(m,n)`$ and $`H`$ is equal to $`N,`$ i.e. any $`H`$-word $`w`$ representing an element of $`L,`$ represents an element of $`N.`$

Consider the group $`𝐆(\mathrm{})`$ constructed above for this particular $`N`$. Since $`w`$ represents an element from $`L`$ in $`B(m,n)`$, it belongs to the normal closure, in the absolutely free group, of set $`T`$ plus the set of all words of the form $`A^n=1`$. By Lemma 4.17 and the definition of $`𝐆(1)`$ then $`w`$ represents $`1`$ in $`𝐆(\mathrm{})`$. Therefore there is a g-reduced diagram $`\mathrm{\Delta }`$ of some rank $`i`$ whose boundary label $`\varphi (q)`$ is freely equal to $`w.`$

By contradiction assume that the $`H`$-word $`w`$ does not represent an element of $`N`$, and the diagram $`\mathrm{\Delta }`$ has minimal possible number of positive cells.

By Lemma 2.5, there are a cell $`\mathrm{\Pi }`$ of $`\mathrm{\Delta }`$ and a contiguity subdiagram $`\mathrm{\Gamma }`$ of rank 0 with $`(\mathrm{\Pi },\mathrm{\Gamma },q)\epsilon .`$ If $`\mathrm{\Pi }`$ is a $`T`$-cell, then it must be compatible with $`q`$ by Lemma 4.2(2). Therefore when we cut the cell $`\mathrm{\Pi }`$ from $`\mathrm{\Delta }`$, we multiply (in the free group) the boundary label of $`\mathrm{\Delta }`$ by a word $`U`$ of the form $`VWV^1`$ where $`W`$ is the boundary label of $`\mathrm{\Pi }`$, and $`V`$ is an $`H`$-word. Since $`W`$ represents an element of $`N`$, $`V`$ represents an element of $`H`$, and $`N`$ is normal in $`H`$, the word $`U`$ represents an element of $`N`$. Hence the boundary label of the resulting diagram $`\mathrm{\Delta }_1`$ is an $`H`$-word which does not represent an element from $`N`$. So $`\mathrm{\Delta }_1`$ is a counterexample with a smaller number of positive cells. If $`\mathrm{\Pi }`$ is not a $`T`$-cell, i.e. it corresponds to a relation $`A^n=1,`$ then we get a contradiction with Lemma 4.14(2).

It is clear that if $`H`$ is a subgroup of $`B(m,n)`$ satisfying properties (1) and (2) from Theorem 4.4 then any subgroup generated by finitely many of the free generators of $`H`$ is also free in the variety of Burnside groups of exponent $`n`$, and has the congruence extension property because retracts of subgroups with the congruence extension property also have this property and because the congruence extension property is transitive (if $`H_1`$ has the congruence extension property in $`H`$ and $`H`$ has it in $`𝐆`$ then $`H_1`$ has the congruence extension property in $`𝐆`$).

Theorem 4.4 (and Theorem 1.2) are proved.

### 4.3 Burnside groups and free products

The following lemma is Theorem VI.3.2 from  (or Theorem 19.5 from ).

###### Lemma 4.18.

The centralizer of every non-trivial element of $`B(m,n)`$ is cyclic of order $`n`$.

We are going to use the following Lemma repeatedly in Section 6.

###### Lemma 4.19.

If $`a,b,cB(m,n)`$, $`n>>1`$ odd, $`a1`$, $`c1`$, $`[a,c]=1`$, $`[bab^1,c]=1`$ then $`[b,c]=[b,a]=1`$.

###### Proof.

Indeed, suppose that $`[a,c]=1`$, $`[bab^1,c]=1`$. By Lemma 4.18, the centralizer of every non-trivial element of $`B(m,n)`$ is cyclic of order $`n`$. Hence $`a,bab^1,c`$ belong to the same cyclic subgroup $`C`$ of $`B(m,n)`$. Therefore $`bCb^1`$ and $`C`$ are non-trivially intersecting cyclic subgroups of order $`n`$. By Lemma 4.18, $`bCb^1=C`$. Hence $`b,C`$ is a finite subgroup of $`B(m,n)`$ (or order at most $`n^2`$). By Theorem 19.6 from , $`b,C`$ is cyclic of order $`n`$, so $`bC`$. Hence $`[b,c]=1`$ as required. ∎

In order to prove Proposition 6.17 below, we will need some properties of free products. Let $`P`$ and $`Q`$ be two free groups. Elements of the free product $`PQ`$ are represented by words of the form $`p_1q_1p_2\mathrm{}q_sp_{s+1}`$ where $`p_iP`$, $`i=1,\mathrm{},s+1`$, is called a $`P`$-syllable, $`q_iQ`$, $`i=1,\mathrm{},s`$, is called a $`Q`$-syllable. By definition, a $`P`$-syllable (resp. $`Q`$-syllable) is a maximal subword over the set of generators of $`P`$ (resp. $`Q`$). Elements of $`P`$ and $`Q`$ are called 1-syllable elements.

A word $`p_1q_1\mathrm{}p_sq_sp_{s+1}`$ from $`PQ`$, where $`p_i,q_j`$ are syllables, is called \*-reduced in $`PQ`$ if none of its syllables except possibly for $`p_1,p_{s+1}`$ is equal to 1. If a product is \*-reduced, it is not equal in $`PQ`$ to such a product with smaller number of syllables. The $`P`$-syllable $`p_{s+1}`$ is called the last syllable of $`p_1q_1\mathrm{}p_sq_sp_{s+1}`$ (even if $`p_{s+1}`$ is empty). If in $`p_1q_1\mathrm{}p_sq_sp_{s+1}`$, a syllable, say, $`p_i`$, is freely equal to 1, we can remove it and glue $`q_{i1}`$ with $`q_i`$ to form a new $`Q`$-syllable. Applying this operation several times, we get a \*-reduced in $`PQ`$ form of the product which is unique. Notice that a word which is \*-reduced in $`PQ`$ may not be freely reduced (as a word written in the free generators of $`P`$ and $`Q`$).

Let $`\psi :P\overline{P}`$ be a homomorphism of $`P`$ onto a group $`\overline{P}`$ satisfying the identity $`x^n=1`$. We say that a word $`h`$ of $`PQ`$ is $`\psi `$-trivial if the $`\psi `$-image of every syllable of $`h`$ is 1 in $`\overline{P}`$.

###### Lemma 4.20.

Let $`h_1,h_2`$ be words in $`PQ`$ which are equal modulo Burnside relations. Then the following properties hold.

(i) If $`h_1`$ is $`\psi `$-trivial, and $`h_2`$ is of minimal length among all words which are equal to $`h_1`$ modulo Burnside relations then $`h_2`$ is $`\psi `$-trivial.

(ii) Suppose that $`h_1`$ has exactly two $`P`$-syllables $`p,p^{}`$ with non-trivial $`\psi `$-images, $`h_1xpyp^{}z`$, and $`y`$ is not equal to a word in $`P`$ modulo Burnside relations. Then $`h_2`$ is not $`\psi `$-trivial.

(iii) If $`h_1`$ is $`\psi `$-trivial, $`h_11`$ modulo Burnside relations, $`h_2P`$, and modulo Burnside relations $`h_1=xh_2x^1`$ for some $`xPQ`$, then there exists a word $`x_1PQ`$ such that $`x_1h_2x_1^1=h_1`$ modulo Burnside relations and the word $`x_1h_2x_1^1`$ is $`\psi `$-trivial.

###### Proof.

(i) Obviously we can assume that $`h_1`$ is \*-reduced. Consider a g-reduced diagram $`\mathrm{\Delta }`$ over the graded presentation of the free Burnside quotient of $`PQ`$ from Section 18 of  corresponding to the equality $`h_1=h_2`$. If the rank of $`\mathrm{\Delta }`$ is 0 then $`h_1=h_2`$ in $`PQ`$, and each syllable of the word $`h_2`$ (of minimal length) must be a product of several syllables of $`h_1`$. Hence $`h_2`$ is $`\psi `$-trivial.

Suppose that the rank of $`\mathrm{\Delta }`$ is $`>0`$, and $`(\mathrm{\Delta })=s_1s_2`$ where $`\varphi (s_1)=h_1`$, $`\varphi (s_2^1)=h_2`$. Since $`s_2`$ is geodesic, $`s_2`$ is a smooth section of rank $`|s_2|`$. By Lemma 2.4, part a), and Lemma 2.3 there exists a cell $`\mathrm{\Pi }`$ of rank $`>0`$ and its contiguity subdiagram $`\mathrm{\Gamma }`$ to $`s_1`$ of contiguity degree $`>1/2\gamma \alpha >3\epsilon `$. By Lemma 2.6, $`\mathrm{\Delta }`$ contains a cell $`\pi `$ and a rank 0 contiguity subdiagram $`\mathrm{\Gamma }^{}`$ of $`\pi `$ to $`s_1`$, such that the contiguity degree of $`\mathrm{\Gamma }^{}`$ is $`>\epsilon `$. Let $`t`$ be the contiguity arc of $`\mathrm{\Gamma }^{}`$ on $`(\pi )`$, $`|t|>\epsilon |(\pi )|`$. There are two possibilities.

Case 1. The period of $`\varphi ((\pi ))`$ is a 1-syllable word. Then $`\varphi ((\pi ))`$ is a 1-syllable word, and one can cut the subdiagram $`\pi \mathrm{\Gamma }^{}`$ from $`\mathrm{\Delta }`$ preserving the $`\psi `$-triviality of $`\varphi (s_1)`$. Here we use the fact that $`\overline{P}`$ satisfies the identity $`x^n=1`$.

Case 2. The period $`A`$ of $`\varphi ((\pi ))`$ contains at least 2 syllables. Since $`\mathrm{\Gamma }^{}`$ is a diagram of rank 0, and $`\epsilon n>2`$, every syllable of $`A`$ is a syllable of $`\varphi (s_1)^{\pm 1}=h_1^{\pm 1}`$. Hence $`A`$ is $`\psi `$-trivial (since $`h_1`$ is $`\psi `$-trivial). Therefore, again, one can cut the subdiagram $`\mathrm{\Gamma }^{}\pi `$ from $`\mathrm{\Delta }`$ preserving the $`\psi `$-triviality of $`\varphi (s_1)`$: we replace subword $`A`$ of $`\varphi (s_1)^{\pm 1}`$ by $`A^{1n}`$ and reduce the resulting word.

Thus in each of these cases we replace $`\mathrm{\Delta }`$ by a diagram of smaller type, and complete the proof by induction on the type of $`\mathrm{\Delta }`$.

(ii) By contradiction assume that $`h_2`$ is $`\psi `$-trivial. We have that $`pyp^{}=x^1h_2z^1`$. By part (i) of this lemma we can replace $`x^1h_2z^1`$ by a $`\psi `$-trivial word $`h`$ of minimal possible length. Consider a g-reduced diagram $`\mathrm{\Delta }`$ with $`(\mathrm{\Delta })=s_1t_1s_2t_2`$ where $`\varphi (s_1)=p,`$ $`\varphi (t_1)=y`$, $`\varphi (s_2)=p^{}`$, $`\varphi (t_2^1)=h`$. If the rank of $`\mathrm{\Delta }`$ is 0 then $`pyp^{}=h`$ in $`PQ`$. Since $`y`$ is not equal to a word from $`P`$ and is $`\psi `$-trivial, and $`\psi (p)1`$, we have that the \*-reduced in $`PQ`$ form of $`pyp^{}`$ is not $`\psi `$-trivial, a contradiction with the $`\psi `$-triviality of $`h`$.

If the rank of $`\mathrm{\Delta }`$ is $`>0`$ then as in part (i), we get a cell $`\pi `$ and a contiguity subdiagram $`\mathrm{\Gamma }^{}`$ of $`\pi `$ to one of the subpaths $`s_1,t_1,s_2`$ with contiguity degree $`\epsilon `$, such that $`\mathrm{\Gamma }^{}`$ has rank 0. Since $`\varphi (s_1)`$ and $`\varphi (s_2)`$ are 1-syllable words, the period $`A`$ of $`\pi `$ is a 1-syllable word if $`\mathrm{\Gamma }^{}`$ is a contiguity subdiagram to $`s_1`$ or $`s_2`$. If $`\mathrm{\Gamma }^{}`$ is a contiguity subdiagram to $`t_1`$, $`A`$ is a $`\psi `$-trivial word. As in part (i) we can remove $`\mathrm{\Gamma }^{}\pi `$ from $`\mathrm{\Delta }`$ preserving the structure of the boundary of $`\mathrm{\Delta }`$ and the condition that $`\varphi (y)`$ is a $`\psi `$-trivial, and does not belong to $`P`$ modulo Burnside relations, $`\varphi (s_1)`$, $`\varphi (s_2)`$ are 1-syllable words from $`P`$, $`\psi (\varphi (s_1)),\psi (\varphi (s_2))1`$. We can complete the proof by induction of the type of $`\mathrm{\Delta }`$.

(iii) Consider a g-reduced annular diagram $`\mathrm{\Delta }`$ with pointed contours $`s_1`$, $`s_2`$, where $`\varphi (s_1)h_1,\varphi (s_2)h_2`$. If the rank of $`\mathrm{\Delta }`$ is 0 then $`h_1=xh_2x^1`$ in $`PQ`$ and $`xh_2x^1`$ is $`\psi `$-trivial.

Suppose that the rank of $`\mathrm{\Delta }`$ is $`>0`$. As in parts (i), (ii), we can remove a cell of rank $`>0`$ from $`\mathrm{\Delta }`$ and change $`s_1`$ or $`s_2`$ preserving $`\varphi (s_1),\varphi (s_2)`$ modulo Burnside relations. The labels of the contours $`s_1^{}`$, $`s_2^{}`$ of the new annular diagram satisfy all the conditions of part (iii) of the lemma, and again we can complete the proof by induction on the type of $`\mathrm{\Delta }`$. ∎

###### Lemma 4.21.

Suppose that $`h,gPQ`$, and there is no $`xPQ`$ such that $`g=xpx^1,h=xp^{}x^1`$ modulo Burnside relations for some $`p,p^{}P`$. Suppose also that $`h`$, the \*-reduced forms of $`ghg^1`$, and a word $`b`$ which is equal to $`g^1hg`$ modulo Burnside relations are $`\psi `$-trivial. Then $`g`$ is $`\psi `$-trivial.

###### Proof.

Suppose that $`g`$ is not $`\psi `$-trivial. Let $`gg_1pg_2`$ where $`g_2`$ is $`\psi `$-trivial, $`p`$ is a $`P`$-syllable, $`\psi (p)1`$. Consider the \*-reduced form of $`ghg^1g_1pg_2hg_2^1p^1g_1^1`$. Since this word is $`\psi `$-trivial, and $`g_2`$ is also $`\psi `$-trivial, the syllable $`p`$ is glued with a $`P`$-syllable $`p_h`$ of $`h`$ and with the $`P`$-syllable $`p^1`$ of $`g^1`$. This means that $`h=g_2^1p_hg_2`$ in the free group $`PQ`$, and the \*-reduced form of $`ghg^1`$ is $`g_1pp_hp^1g_1^1`$. This implies that $`g_1`$ is $`\psi `$-trivial, so $`g`$ has only one $`P`$-syllable with non-trivial $`\psi `$-image. Now consider the \*-reduced form $`b^{}`$ of the word $`g^1hg=g_2^1p^1g_1^1g_2^1p_hg_2g_1pg_2`$.

Since $`b`$ is equal to $`b^{}`$ modulo Burnside relations and $`b`$ is $`\psi `$-trivial, we can conclude by Lemma 4.20(ii) that $`g_1^1g_2^1p_hg_2g_1`$ is equal to a word $`p^{\prime \prime }P`$ modulo Burnside relations. Taking the projection of the equality $`(g_2g_1)^1p_hg_2g_1=p^{\prime \prime }`$ onto the subgroup $`P`$, we get $`P(g_2g_1)^1p_hP(g_2g_1)=p^{\prime \prime }`$ modulo Burnside relations, where $`P(g_2g_1)`$ is the $`P`$-projection of $`g_2g_1`$. Therefore $`P(g_2g_1)^1(g_2g_1)`$ centralizes $`p_h`$ modulo Burnside relations. Since the centralizers of $`p_h`$ in the free Burnside quotient of $`P`$ and $`PQ`$ have order $`n`$ (by Lemma 4.18), these centralizers coincide. Hence $`P(g_2g_1)^1g_2g_1`$ belongs to $`P`$ modulo Burnside relations, so $`g_2g_1P`$ modulo Burnside relations. Then $`g_2gg_2^1P`$, $`g_2hg_2^1=g_2g_2^1p_hg_2g_2^1=p_hP`$ modulo Burnside relations, which is impossible by our assumption. ∎

## 5 The presentation of the group

In this section, we define an $`S`$-machine consisting of a set of (positive) $`S`$-rules $`𝕊^+`$. Using this $`S`$-machine, we define our groups $``$ (Theorem 1.3).

Fix some numbers first. We use the same odd number $`n>>1`$ as in the previous sections. Let $`N>n`$, and let $`m=m(n)`$ be the number which exists by Theorem 4.4.

### 5.1 $`S`$-machines and their interpretation

We start with definition of the generating set $`𝐗`$ of the group $`H`$ and the alphabet of the $`S`$-machine.

Let $`𝒜`$ be the set $`\{a_1,\mathrm{},a_m\}`$. Let $`\mathrm{\Omega }`$ be the set $`\{0,\mathrm{},2n+1\}`$.

The set $`𝕊^+`$ that we shall define in the next section, will be the union of disjoint sets $`𝕊_\omega ^+`$, $`\omega \mathrm{\Omega }`$, and the set $`\{𝐜_0,\mathrm{},𝐜_{2n}\}`$ called the set of connecting rules. For each $`\omega \{0,\mathrm{},2n\}`$, the set $`𝕊_\omega ^+`$ will consist of $`m`$ rules, one for each letter in $`𝒜`$. The rules from $`_{\omega =0}^{2n}𝕊_\omega \{𝐜_0,\mathrm{},𝐜_{2n}\}`$ will be called working rules.

The rules from $`𝕊_{2n+1}^+`$ will be called cleaning rules. The set $`𝕊_{2n+1}^+`$ will be in one-to-one correspondence with the set of all working rules (thus the set of cleaning rules and the set of working rules are disjoint but have the same cardinality).

Consider the alphabet

$$𝐊=\{\lambda (i,\omega ),\kappa (i),\rho (i),\stackrel{}{\kappa }(i,j,\omega ),\stackrel{}{\kappa }(i,j,\omega ),i=1,\mathrm{},N,j=1,\mathrm{},n,\omega \mathrm{\Omega }\}.$$

Elements of $`𝐊`$ will be called $`𝐊`$-letters. Let also $`\overline{𝐊}`$ be the set of letters obtained from $`𝐊`$ by removing the $`\mathrm{\Omega }`$-coordinate $`\omega `$, and let us call the corresponding map from $`𝐊`$ to $`\overline{𝐊}`$ the $`\overline{𝐊}`$-projection. The preimage of every letter $`z\overline{𝐊}`$ under the $`\overline{𝐊}`$-projection will be denoted by $`\overline{𝐊}(z)`$. For every $`z(\overline{𝐊})^1`$ we denote $`\overline{𝐊}(z^1)^1`$ by $`\overline{𝐊}(z)`$. Sometimes it will be convenient to assume that letters with $`\overline{𝐊}`$-projection $`\kappa (i)`$ or $`\rho (i)`$ also have $`\mathrm{\Omega }`$-coordinates but we identify all letters $`\kappa (i,\omega )`$ with $`\kappa (i)`$ and all letters $`\rho (i,\omega )`$ with $`\rho (i)`$.

If $`U`$ is any word containing letters from $`\overline{𝐊}`$, and $`\omega \mathrm{\Omega }`$, then we define $`U(\omega )`$ as the word, obtained from $`U`$ by replacing every letter $`z`$ from $`\overline{𝐊}\backslash \{\kappa (i),\rho (i),i=1,\mathrm{},N\}`$ by $`z(\omega )`$ (in other words, we add the coordinate $`\omega `$ to each letter from $`\overline{𝐊}`$ in $`U`$ except $`\kappa (i),\rho (i)`$). In this case we shall call $`\omega `$ the $`\mathrm{\Omega }`$-coordinate of $`U(\omega )`$.

For every $`z\overline{𝐊}\backslash \{\lambda (i),\rho (i),\kappa (j),1iN,j=2,\mathrm{},N\}`$ consider a copy $`A(z)`$ of the alphabet $`𝒜`$. For each $`z\{\lambda (i),\rho (i),1iN\}`$, consider the set $`A(z)`$ which is a copy of the set of working rules: with every working rule $`\tau `$ we associate a letter $`\overline{\tau (z)}`$ in $`A(z)`$ (all sets $`A(z)`$ are disjoint). Notice that we have not defined the sets $`A(\kappa (j))`$, $`j=2,\mathrm{},N`$. For convenience we assume that all these sets are empty.

Let $`𝐀`$ be the union of all the sets $`A(z)`$, $`z\overline{𝐊}`$. Elements of this set will be called $`𝐀`$-letters.

Consider also the set of $`𝐑`$-letters $`𝐑=\{r(\tau ,z),\tau 𝕊^+,z\overline{𝐊}\}`$.

Now let

$$𝐗=𝐊𝐀𝐑.$$

This is the generating set of our group $``$. We rank some of the letters in $`𝐗`$ in the following way: $`𝐊>𝐑>𝐀`$, that is letters from $`𝐊`$ have rank higher than all other letters, etc. For every word over $`𝐗`$ we can consider its $`𝐊`$-length, etc.

Consider the following word $`\mathrm{\Lambda }`$ over $`\overline{𝐊}`$:

$$\begin{array}{c}\lambda (1)\kappa (1)\rho (1)\stackrel{}{\kappa }(1,1)\stackrel{}{\kappa }(1,1)\mathrm{}\stackrel{}{\kappa }(1,n)\stackrel{}{\kappa }(1,n)\mathrm{}\hfill \\ \lambda (N)\kappa (N)\rho (N)\stackrel{}{\kappa }(N,1)\stackrel{}{\kappa }(N,1)\mathrm{}\stackrel{}{\kappa }(N,n)\stackrel{}{\kappa }(N,n)\hfill \end{array}$$
(15)
The word $`\mathrm{\Lambda }(0)`$ will be called the hub.

We define a circular order on $`\overline{𝐊}`$ according to the appearance in $`\mathrm{\Lambda }`$ if we consider the word $`\mathrm{\Lambda }`$ as written on a circle. For every $`z\overline{𝐊}`$ let $`z_{}`$ be the letter immediately preceding $`z`$ in our order, and let $`z_+`$ be the letter next to $`z`$ in that order. We extend that order also on letters from $`\overline{𝐊}^1`$. If $`z\overline{𝐊}`$ then $`(z^1)_{}(z_+)^1`$, $`(z^1)_+(z_{})^1`$. We define a corresponding circular order on $`𝐊𝐊^1`$:

$$z(\omega )_+z_+(\omega ).$$

For every $`z\overline{𝐊}^1`$ we set $`A(z)=A(z_{}^1)`$. Also by definition for every $`\overline{z}𝐊`$ with $`\overline{𝐊}`$-projection $`z`$ we let $`A(\overline{z}^{\pm 1})=A(z^{\pm 1})`$.

The language of admissible words consists of all words of the form $`y_1u_1y_2u_2\mathrm{}y_t`$ where $`y_i𝐊`$, $`u_i`$ are words in $`A(y_i)`$, $`i=1,2,\mathrm{},t1`$, and for every $`i=1,2\mathrm{}`$, either $`y_{i+1}(y_i)_+`$ or $`y_{i+1}y_i^1`$. Thus all $`𝐊`$-letters in an admissible word have the same $`\mathrm{\Omega }`$-coordinates. (Notice that $`\mathrm{\Lambda }(\omega )`$ is an admissible word for every $`\omega `$.) The subword $`y_iu_iy_{i+1}`$ is called the $`y_i`$-sector of the admissible word, $`i=1,2\mathrm{}.`$. Two admissible words $`y_1u_1y_2u_2\mathrm{}y_t`$ and $`y_1^{}u_1^{}y_2^{}u_2^{}\mathrm{}y_t^{}^{}`$ are considered equal if $`t=t^{}`$, $`y_iy_i^{}`$, $`i=1,\mathrm{},t`$, and $`u_i=u_i^{}`$, $`i=1,\mathrm{},t1`$, in the free Burnside group (later on we will identify these admissible words if $`y_iy_i^{}`$ and $`u_i=u_i^{}`$ in the group $`H_{ka}^{}`$ defined below).

The set of defining relations of the group $``$ consists of the hub $`\mathrm{\Lambda }(0)`$ and relations corresponding to the $`S`$-rules. We are going to present these relations now.

We start with defining the set of $`S`$-rules (an $`S`$-machine in the terminology of ) and the corresponding defining relations.

Each rule means simultaneous replacing certain subwords in admissible words by other subwords (the rule specifies the subwords which need be replaced and the replacements).

We shall write a rule $`\tau `$ in the form $`[z_1v((z_1)_{})z_1u(z_1),\mathrm{},z_sv((z_s)_{})z_su(z_s);\omega \omega ^{}]`$ where $`z_i\overline{𝐊}`$, each of $`u(z),v(z)`$ is either a letter from $`A(z)^{\pm 1}`$ or empty, $`z\overline{𝐊}`$.

Some of the arrows in a rule can have the form $`\stackrel{\mathrm{}}{}`$. This means that the rule can be applied if the corresponding sector does not have $`𝐀`$-letters in it. We shall say that the corresponding sectors are locked by the rule and the rule locks these sectors. If a $`z`$-sector is locked by the rule, $`u(z)`$ and $`v(z)`$ must be empty.

If $`z\overline{𝐊}`$ does not appear in this rule then we set $`u(z)`$, $`v(z_{})`$ to be empty. Thus with every rule $`\tau `$ and every $`z\overline{𝐊}`$ we associate two words over $`𝐀`$: $`u(z)`$ and $`v(z)`$. We can extend this definition to $`z\overline{𝐊}^1`$ by saying that $`v(z^1)u(z)^1`$, $`u(z^1)v(z_{})^1`$.

If for some $`z\overline{𝐊}`$, $`u(z)`$ is not empty then we call $`\tau `$ left active for $`z`$-sectors, if $`v(z)`$ is not empty then $`\tau `$ is right active for $`z`$-sectors.

If $`\tau `$ is a rule as above then for every $`z\overline{𝐊}\overline{𝐊}^1`$ we define two words $`L(\tau ,z)r(\tau ,z_{})v(z_{})`$ and $`R(\tau ,z)r(\tau ,z)u(z)^1`$. If $`h\tau _1\tau _2\mathrm{}\tau _t`$ is a word in the alphabet $`𝕊`$, we set $`L(h,z)L(\tau _1,z)L(\tau _2,z)\mathrm{}L(\tau _t,z)`$, $`R(h,z)R(\tau _1,z)R(\tau _2,z)\mathrm{}R(\tau _t,z)`$.

The rule $`\tau `$ is applicable to a one-letter admissible word $`y`$ if and only if the $`\mathrm{\Omega }`$-coordinate of $`y`$ is $`\omega `$.

Let $`Wy_1uy_2`$ be an admissible word with two $`𝐊`$-letters. The following two conditions must hold for $`\tau `$ to be applicable to $`W`$:

(i) $`y_1`$ and $`y_2`$ belong to $`\overline{𝐊}(\omega )`$;

(ii) if $`y_1`$ is one of the letters $`z_i`$, $`i=1,\mathrm{},s`$, $`\tau `$ locks $`y_1`$-sectors then $`u`$ must be empty.

If conditions (i) and (ii) hold then the result of the application of $`\tau `$ to $`W`$ is the word

$$y_1^{}u(y_1)uv((y_2)_{})y_2^{}$$

where $`y_i^{}`$ are obtained from $`y_i`$ by replacing the $`\mathrm{\Omega }`$-coordinate $`\omega `$ by $`\omega ^{}`$ (recall that $`\tau `$ contains the instruction $`\omega \omega ^{}`$).

If $`Wy_1u_1y_2\mathrm{}u_ty_t`$ is an admissible word with $`t2`$ $`\overline{𝐊}(\omega )`$-letters then the rule $`\tau `$ is applicable to $`W`$ if and only if it is applicable to every sector of $`W`$. In order to apply an $`S`$-rule to $`W`$ we apply it to every sector of $`W`$.

Let $`W^{}`$ be the resulting word. Notice that $`W^{}`$ is clearly again an admissible word.

With every rule $`\tau =[z_1v((z_1)_{})z_1u(z_1),\mathrm{},z_sv((z_s)_{})z_su(z_s);\omega \omega ^{}]`$ we associate the inverse rule $`\tau ^1=[z_1v((z_1)_{})^1z_1u_(z_1)^1,\mathrm{},z_sv((z_s)_{})^1z_su(z_s)^1;\omega ^{}\omega ]`$. Clearly if $`\tau `$ is applicable to an admissible word $`W`$ and $`W^{}`$ is the result of application of $`\tau `$ to $`W`$, then $`\tau ^1`$ is applicable to $`W^{}`$ and $`W`$ is the result of application of $`\tau ^1`$ to $`W^{}`$.

The rules from $`𝕊^+`$, described below, will be called positive, the inverses of these rules will be called negative.

Now let us describe the procedure of converting an $`S`$-rule into a set of relations. After that we shall present the list of rules $`𝕊`$ corresponding to our group $``$.

Let $`\tau =[z_1v((z_1)_{})z_1u(z_1),\mathrm{},z_sv((z_s)_{})z_su(z_s);\omega \omega ^{}]`$ be an $`S`$-rule. Then for every $`z\overline{𝐊}`$, we introduce a relation

$$r(\tau ,z_{})^1z(\omega )r(\tau ,z)=v(z_{})z(\omega ^{})u(z).$$

If (and only if) $`\tau `$ does not lock $`z`$-sectors, we also include all relations of the form

$$r(\tau ,z)b=br(\tau ,z),bA(z).$$

For every $`z\overline{𝐊}`$ let $`𝐑(z)`$ denote the set $`\{r(\tau ,z)|\tau 𝕊\}`$.

To make formulas look less frightening let us agree on the following:

> In every word of the form $`u_{ar}zv_{ar}`$ appearing in an $`S`$-rule or in a defining relation of our group, or in an admissible word, where $`z\overline{𝐊}(\omega )`$, $`u_{ar}`$, $`v_{ar}`$ are words in the alphabet $`𝐀𝐑`$, we shall always assume that the letters in $`u_{ar}`$ are from $`A(z_{})𝐑(z_{})`$ only, and the letters in $`v_{ar}`$ are from $`A(z)𝐑(z)`$ only. So we shall omit the $`\overline{𝐊}`$-coordinates in these words. We shall also omit the $`\mathrm{\Omega }`$-coordinate in $`𝐊`$-letters if the value of it is clear.

Example. Suppose, for example, that the rule $`\tau `$ has the form

$$[\kappa (1)\kappa (1)a,\stackrel{}{\kappa }(1,1)\stackrel{}{\kappa }(1,1)a,\stackrel{}{\kappa }(1,2)\stackrel{\mathrm{}}{}a\stackrel{}{\kappa }(1,2),12]$$

(this rule is not in $`𝕊`$, we use it just as an example). Then the set of relations corresponding to this rule consists of the following relations.

* $`r(\tau )^1\kappa (1)r(\tau )=\kappa (1)a;`$
* $`r(\tau )^1\stackrel{}{\kappa }(1,1,1)r(\tau )=\stackrel{}{\kappa }(1,1,2)a;`$
* $`r(\tau )^1\stackrel{}{\kappa }(1,2,1)r(\tau )=a\stackrel{}{\kappa }(1,2,2);`$
* $`r(\tau )^1z(1)r(\tau )=z(2)`$ for every $`z\overline{𝐊},z\kappa (1),\stackrel{}{\kappa }(1,1)`$.
* $`r(\tau )b=br(\tau )`$ for every $`bA(z)`$ and $`z\stackrel{}{\kappa }(1,2)`$.

Notice that, for example in the relation $`r(\tau )^1\stackrel{}{\kappa }(1,1,1)r(\tau )=\stackrel{}{\kappa }(1,1,2)a`$, the two letters $`r(\tau )`$ are different according to our agreement: the first letter is $`r(\tau ,\kappa (1))`$ and the second letter is $`r(\tau ,\rho (1))`$. This rule $`\tau `$ is left active for $`\kappa (1)`$-sectors and for $`\stackrel{}{\kappa }(1,1)`$-sectors, right active for $`\stackrel{}{\kappa }(1,2)`$-sectors, and locking for $`\stackrel{}{\kappa }(1,1)`$-sectors.

Here is one of the main properties of the systems of relations corresponding to $`S`$-rules. The lemma immediately follows from definitions.

###### Lemma 5.1.

Let $`W`$ be an admissible word, starting with $`z𝐊`$ and ending with $`z^{}𝐊`$, let $`\tau =[z_1v((z_1)_{})z_1u(z_1),\mathrm{},z_sv((z_s)_{})z_su(z_s);\omega \omega ^{}]`$ be an $`S`$-rule applicable to $`W`$ (some of the arrows $``$ may be of the form $`\stackrel{\mathrm{}}{}`$). Then:

1. $`L(\tau ,z)^1WR(\tau ,z^{})`$ is equal modulo the relations corresponding to $`\tau `$ to the admissible word $`W^{}`$ obtained by applying $`\tau `$ to $`W`$.
2. If $`\tau `$ locks $`z`$-sectors then the $`z`$-sectors of $`W`$ and $`W^{}`$ have trivial retraction to the subgroup $`𝐀`$ in the free group generated by $`𝐀𝐊`$.
3. For every $`z\overline{𝐊}`$, $`L(\tau ,z)z(\omega ^{})=z(\omega )R(\tau ,z)`$ is one of the defining relations corresponding to $`\tau `$.

### 5.2 The $`S`$-machine $`𝕊`$

Now let us define our collection of $`S`$-rules $`𝕊^+`$. As we have announced in the Section 5.1, the set $`𝕊^+`$ will be divided into $`2n+3`$ subsets:

$$𝕊_0^+,\mathrm{},𝕊_{2n+1}^+,\{𝐜_i;i=0,\mathrm{},2n\}.$$

The sets $`𝕊_i`$ will be called steps, $`𝐜_i`$ will be called connecting rules. Rules from $`𝕊_{2n+1}`$ are called cleaning rules, other rules are called working.

In each set $`𝕊_i^+`$, $`i2n`$, each rule corresponds to a letter $`a𝒜`$, it will be denoted by $`\tau (i,a)`$.

The rule $`\tau (0,a)`$ in the set $`𝕊_0^+`$ is the following

$$\left[\begin{array}{c}\lambda (i)\stackrel{\mathrm{}}{}\lambda (i),\kappa (i)\stackrel{\mathrm{}}{}\kappa (i),\rho (i)\stackrel{\mathrm{}}{}\rho (i),\stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)a^1,\stackrel{}{\kappa }(i,j)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j),\hfill \\ i=1,\mathrm{},N,j=1,\mathrm{},n;00\hfill \end{array}\right].$$

This rule inserts copies of the letter $`a^1`$ to the right of $`\stackrel{}{\kappa }(i,j)`$. A sequence

$$\tau (0,a_{i_1})^{\pm 1},\mathrm{},\tau (0,a_{i_s})^{\pm 1}$$

of these rules inserts copies of the word $`(a_{i_1}^{\pm 1}\mathrm{}a_{i_s}^{\pm 1})^1`$ in $`\stackrel{}{\kappa }(i,j)`$-sectors. These rules lock all other sectors. The connecting rule $`𝐜_0`$ has the form

$$[\lambda (i)\stackrel{\mathrm{}}{}\lambda (i),\kappa (i)\stackrel{\mathrm{}}{}\kappa (i),\rho (i)\stackrel{\mathrm{}}{}\rho (i),\stackrel{}{\kappa }(i,j)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j),i=1,\mathrm{},N,j=1,\mathrm{},n;01].$$

It locks all sectors except for $`\stackrel{}{\kappa }(i,j)`$-sectors.

The rule $`\tau (1,a)`$ has the form

$$\left[\begin{array}{c}\kappa (i)\stackrel{\mathrm{}}{}\overline{\tau (1,a)}\kappa (i),\stackrel{}{\kappa }(i,1)\overline{\tau (1,a)}\stackrel{}{\kappa }(i,1)a,\hfill \\ \stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)a,\stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)a,\hfill \\ 1iN,2jn;11\hfill \end{array}\right].$$

This rule moves letters from $`\stackrel{}{\kappa }(i,j)`$-sectors to $`\stackrel{}{\kappa }(i,j)`$-sectors (i.e. the rule removes a letter from $`\stackrel{}{\kappa }(i,j)`$-sectors, and adds a copy of that letter to each of the $`\stackrel{}{\kappa }(i,j)`$-sectors). It writes a copy of itself in the $`\lambda (i)`$-sectors and $`\rho (i)`$-sectors. It locks all $`\kappa (i)`$-sectors.

The connecting rule $`𝐜_1`$ has the form

$$\left[\begin{array}{c}\kappa (i)\stackrel{\mathrm{}}{}\overline{𝐜_1}\kappa (i),\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\overline{𝐜_1}\stackrel{}{\kappa }(i,1),\stackrel{}{\kappa }(i,j)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j),\hfill \\ 1iN,2jn;12\hfill \end{array}\right].$$

It writes a copy of itself in the $`\lambda (i)`$-sectors and $`\rho (i)`$-sectors. It locks $`\stackrel{}{\kappa }(i,j)`$-sectors and $`\kappa (i)`$-sectors.

For every $`t=2,\mathrm{},n`$ and every $`a𝒜`$ the rule $`\tau (2t1,a)`$ has the form:

$$\left[\begin{array}{c}\kappa (1)\overline{\tau (2t1,a)}\kappa (1),\kappa (i^{})\stackrel{\mathrm{}}{}\overline{\tau (2t1,a)}\kappa (i^{}),\hfill \\ \stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\overline{\tau (2t1,a)}\stackrel{}{\kappa }(i,1),\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,1),\hfill \\ \stackrel{}{\kappa }(i,s)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,s),\stackrel{}{\kappa }(i,s)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,s),\stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)a,\stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)a,\hfill \\ 1iN,2i^{}N,2s<t,tjn;2t12t1\hfill \end{array}\right].$$

This rule moves letters from $`\stackrel{}{\kappa }(i,j)`$-sectors to $`\stackrel{}{\kappa }(i,j)`$-sectors, $`j=t,\mathrm{},n`$, and writes a copy of itself in the $`\lambda (i)`$-sectors and $`\rho (i)`$-sectors. It locks $`\kappa (i)`$-sectors, $`i2`$, all $`\stackrel{}{\kappa }(i,j)`$-sectors, $`j<t`$, and all $`\stackrel{}{\kappa }(i,j)`$-sectors, $`j<t`$.

The connecting rule $`𝐜_{2t1}`$ has the form

$$\left[\begin{array}{c}\kappa (1)\overline{𝐜_{2t1}}\kappa (1),\kappa (i^{})\stackrel{\mathrm{}}{}\overline{𝐜_{2t1}}\kappa (i^{}),\hfill \\ \stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\overline{𝐜_{2t1}}\stackrel{}{\kappa }(i,1),\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,1),\hfill \\ \stackrel{}{\kappa }(i,j)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j),\stackrel{}{\kappa }(i,s)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,s),\hfill \\ 1iN,2i^{}N,2s<t,2jn;2t12t\hfill \end{array}\right].$$

It locks $`\kappa (i)`$-sectors, $`i2`$, all $`\stackrel{}{\kappa }(i,j)`$-sectors, and all $`\stackrel{}{\kappa }(i,j)`$-sectors, $`j<t`$. It also writes a copy of itself in the $`\lambda (i)`$-sectors and $`\rho (i)`$-sectors.

For every $`t=1,\mathrm{},n`$ the rule $`\tau (2t,a)`$ has the form:

$$\left[\begin{array}{c}\kappa (1)\overline{\tau (2t,a)}\kappa (1)a^1,\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\overline{\tau (2t,a)}\stackrel{}{\kappa }(i,1),\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,1),\hfill \\ \kappa (i^{})\stackrel{\mathrm{}}{}\overline{\tau (2t,a)}\kappa (i^{}),\stackrel{}{\kappa }(i,s)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,s),\stackrel{}{\kappa }(i,s^{})\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,s^{}),\stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)a^1,\hfill \\ \stackrel{}{\kappa }(i,j^{})\stackrel{}{\kappa }(i,j^{})a^1,\hfill \\ 1iN,2i^{}N,2st,t<jn,1s^{}<t,tj^{}n;2t2t\hfill \end{array}\right].$$

This rule moves letters from $`\stackrel{}{\kappa }(i,t)`$-sector to $`k(1)`$-sector, letters from $`\stackrel{}{\kappa }(i,j)`$-sectors, $`j>t`$, to $`\stackrel{}{\kappa }(i,j)`$-sectors, and writes a copy of itself in the $`\lambda (i)`$-sectors and $`\rho (i)`$-sectors. It locks all other sectors.

The connecting rule $`𝐜_{2t}`$, $`t=1,\mathrm{},n1`$, has the form

$$\left[\begin{array}{c}\kappa (i)\stackrel{\mathrm{}}{}\overline{𝐜_{2t}}\kappa (i),\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,1)\hfill \\ \stackrel{}{\kappa }(i,s)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,s),\stackrel{}{\kappa }(i,j)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j),\hfill \\ 1iN,2st,1jn;2t2t+1\hfill \end{array}\right].$$

It writes a copy of itself in the $`\lambda (i)`$-sectors and $`\rho (i)`$-sectors. It locks all $`\kappa (i)`$-sectors, $`i>1`$, all $`\stackrel{}{\kappa }(i,j)`$-sectors and all $`\stackrel{}{\kappa }(i,j)`$-sectors, $`it`$.

The connecting rule $`𝐜_{2n}`$, $`t=1,\mathrm{},n1`$, has the form

$$\left[\begin{array}{c}\kappa (i)\stackrel{\mathrm{}}{}\overline{𝐜_{2n}}\kappa (i),\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\overline{𝐜_{2n}}\stackrel{}{\kappa }(i,1),\stackrel{}{\kappa }(i,j)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j)\hfill \\ \stackrel{}{\kappa }(i,j^{})\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j^{}),\hfill \\ 1iN,1jn,2j^{}n;2n2n+1\hfill \end{array}\right].$$

It writes a copy of itself in the $`\lambda (i)`$-sectors and $`\rho (i)`$-sectors. It locks all other sectors.

The cleaning rules are in one-to-one correspondence with working rules. For every working rule $`r`$, the corresponding cleaning rule $`\tau (2n+1,r)`$ has the form

$$\left[\begin{array}{c}\kappa (i)\stackrel{\mathrm{}}{}\overline{r}\kappa (i),\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\overline{r}\stackrel{}{\kappa }(i,1),\stackrel{}{\kappa }(i,1)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,1),\hfill \\ \stackrel{}{\kappa }(i,j)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j),\stackrel{}{\kappa }(i,j)\stackrel{\mathrm{}}{}\stackrel{}{\kappa }(i,j),1iN,2jn;2n+12n+1\hfill \end{array}\right].$$

These rules remove the content of $`\lambda (i,j)`$-sectors and $`\rho (i,j)`$-sectors (which contain copies of the history of the computation) and locks all other sectors.

Notice that only connecting rules change the $`\mathrm{\Omega }`$-coordinates of $`𝐊`$-letters. Notice also that for every $`a𝒜`$ and every $`i=1,\mathrm{},2n`$, one can define the rule $`\tau (i,a^1)`$ as before. Similarly for every working rule $`r`$ one can define $`\tau (2n+1,r^1)`$. It is easy to see that

$$\tau (i,a^1)=\tau (i,a)^1.$$

The following picture (Figure 13) shows which rules of the $`S`$-machine $`𝕊`$ are locking, active or neither for which sectors of admissible words.

Fig. 13.

A filled box means that the sector is locked, a box with “$`>`$” in it means that the rules are left active for that sector, a box with “$`<`$” in it means that the rules are right active, and an empty box means that the rules from the corresponding set of $`S`$-rules are neither active for that sector nor locking it. For example, this picture shows that rules from $`𝕊_2`$ are right active for $`\lambda (i)`$-sectors and $`\rho (i)`$-sectors, lock $`\stackrel{}{\kappa }(1,1)`$-sectors but are left active for $`\stackrel{}{\kappa }(1,2)`$-sectors. It also shows that $`\kappa (i)`$-sectors, $`i2`$, are locked by all rules of $`𝕊`$.

### 5.3 The presentation

The set of relations corresponding to the rules from $`𝕊`$ will be denoted by $`Z(𝕊)`$. By $`Z(𝕊,\mathrm{\Lambda })`$ we shall denote the set $`Z(𝕊)`$ together with the hub $`\mathrm{\Lambda }(0)`$.

Our main result is that the group $``$ defined by the set of relations $`Z(𝕊,\mathrm{\Lambda })`$ satisfies the two conditions of Theorem 1.3.

### 5.4 The subgroup $`𝒜`$ of $``$ is a torsion group of exponent $`n`$

For every group word $`u`$ in the alphabet $`𝒜`$ and every $`𝐊`$-letter $`z\{\lambda (i),\rho (i,1),i=1,\mathrm{},N\}`$ we denote a copy of $`u`$ in the alphabet $`A(z)`$ by $`u(z)`$. We may identify $`𝒜`$ with $`A(\kappa (1))`$.

###### Lemma 5.2.

For every word $`u`$ in $`𝒜𝒜^1`$ the relation $`u(\kappa (1))^n=1`$ follows from $`Z(𝕊,\mathrm{\Lambda })`$.

###### Proof.

Let $`ua_{i_1}a_{i_2}\mathrm{}a_{i_s}`$ be a group word in the alphabet $`𝒜`$. Start with the admissible word $`\mathrm{\Lambda }(0)\lambda (1,0)`$ and apply $`S`$-rules $`\tau (0,a_{i_1})`$,…, $`\tau (0,a_{i_s})`$ from $`𝕊_0`$ to $`\mathrm{\Lambda }(0)\lambda (1,0)`$. The resulting word is equal to

$$\begin{array}{c}\lambda (1)\kappa (1)\rho (1)\stackrel{}{\kappa }(1,1)u^1\stackrel{}{\kappa }(1,1)\stackrel{}{\kappa }(1,2)u^1\stackrel{}{\kappa }(1,2)\mathrm{}\lambda (N)\kappa (N)\rho (N)\hfill \\ \stackrel{}{\kappa }(N,n)u^1\stackrel{}{\kappa }(N,n)\lambda (1)\hfill \end{array}$$
(16)
the $`\mathrm{\Omega }`$-coordinate of each $`𝐊`$-letter is $`0`$.

Applying now the connecting rule $`𝐜_0`$, we change the $`\mathrm{\Omega }`$-coordinates of all $`𝐊`$-letters to $`1`$.

After that, applying rules $`\tau (1,a_{i_s})`$, …,$`\tau (1,a_{i_1})`$, we get the word

$$\begin{array}{c}\lambda (1)v_1\kappa (1)\rho (1)v_1\stackrel{}{\kappa }(1,1)\stackrel{}{\kappa }(1,1)u\stackrel{}{\kappa }(1,2)\mathrm{}\lambda (N)v_1\kappa (N)\rho (N)v_1\stackrel{}{\kappa }(N,1)\mathrm{}\hfill \\ \stackrel{}{\kappa }(N,n)\stackrel{}{\kappa }(N,n)u\lambda (1)\hfill \end{array}$$
(17)
(the $`\mathrm{\Omega }`$-coordinates are $`1`$) where $`v_1\overline{\tau (1,a_{i_s})}\mathrm{}\overline{\tau (1,a_{i_1})}`$.

The connecting rule $`𝐜_1`$ makes all $`\mathrm{\Omega }`$-coordinates $`2`$ and adds letter $`\overline{𝐜_1}`$ at the end of $`v`$.

Now we can apply rules $`\tau (2,a_{i_1})`$, …, $`\tau (2,a_{i_s})`$, $`𝐜_2`$, $`\tau (3,a_{i_s})`$,…, $`\tau (3,a_{i_1})`$, $`𝐜_3`$,…, $`\tau (2n,a_{i_1})`$, …, $`\tau (2n,a_{i_s})`$, and obtain the following word:

$$\begin{array}{c}\lambda (1)v_{2n}\kappa (1)u^n\rho (1)v_{2n}\stackrel{}{\kappa }(1,1)\stackrel{}{\kappa }(1,1)\mathrm{}\lambda (N)v_{2n}\kappa (N)\rho (N)v_{2n}\stackrel{}{\kappa }(N,1)\stackrel{}{\kappa }(N,1)\hfill \\ \mathrm{}\stackrel{}{\kappa }(N,n)\stackrel{}{\kappa }(N,n)\lambda (1)\hfill \end{array},$$
(18)
where the $`\mathrm{\Omega }`$-coordinate of every $`𝐊`$-letter is $`2n`$, $`v_{2n}`$ is a copy of the history of the computation.

Let $`W`$ be the word (18) without the last letter.

Let $`h\tau (0,a_{i_1})\mathrm{}\tau (2n,a_{i_s})`$ be the string of all rules from $`𝕊`$ applied so far to $`\mathrm{\Lambda }(0)\lambda (1)`$. Then by Lemma 5.1 (part 3), we have the following equality:

$$L(h,\lambda (1))W\lambda (1,2n)=\mathrm{\Lambda }(0)\lambda (1,0)R(h,\lambda (1))=\mathrm{\Lambda }(0)L(h,\lambda (1))\lambda (1,2n).$$

So

$$W=L(h,\lambda (1))^1\mathrm{\Lambda }(0)L(h,\lambda (1))=1$$

modulo $`Z(𝕊,\mathrm{\Lambda })`$.

Notice that if we apply connecting rules $`𝐜_0,\mathrm{},𝐜_{2n}`$ to $`\mathrm{\Lambda }(0)\lambda (1,0)`$, we obtain

$$\mathrm{\Lambda }(2n+1)\lambda (1,2n+1).$$

Now take the word $`\mathrm{\Lambda }(2n+1)\lambda (1,2n+1)`$ and apply the cleaning rules $`\tau (2n+1,t_1)\mathrm{}\tau (2n+1,t_s)`$ where $`\overline{t_1}\mathrm{}\overline{t_s}v_{2n}`$, and the rule $`𝐜_{2n}^1`$. We get the word

$$\begin{array}{c}\lambda (1)v_{2n}\kappa (1)\rho (1)v_{2n}\stackrel{}{\kappa }(1,1)\stackrel{}{\kappa }(1,1)\mathrm{}\lambda (N)v_{2n}\kappa (N)\rho (N)v_{2n}\stackrel{}{\kappa }(N,1)\stackrel{}{\kappa }(N,1)\hfill \\ \mathrm{}\stackrel{}{\kappa }(N,n)\stackrel{}{\kappa }(N,n)\lambda (1)\hfill \end{array},$$
(19)
with $`\mathrm{\Omega }`$-coordinate $`2n`$. Let $`W^{}`$ be the word (19) without the last letter. Let $`h^{}`$ be the word of rules applied to $`\mathrm{\Lambda }(0)\lambda (1,0)`$ to get (19). Then by Lemma 5.1, we have

$$L(h^{},\lambda (1))W^{}\lambda (1,2n)=\mathrm{\Lambda }(0)\lambda (1,0)R(h^{},\lambda (1))=\mathrm{\Lambda }(0)L(h^{},\lambda (1))\lambda (1,2n)$$

modulo $`Z(𝕊,\mathrm{\Lambda })`$. This implies $`W^{}=1`$ modulo $`Z(𝕊,\mathrm{\Lambda })`$. But the words $`W`$ and $`W^{}`$ differ only by the factor $`u(\kappa (1))^n`$. Thus $`u(\kappa (1))^n=1`$ modulo $`Z(𝕊,\mathrm{\Lambda })`$. Hence the $`n`$-th power of every word over $`A(\kappa (1))`$ is 1 modulo $`Z(𝕊,\mathrm{\Lambda })`$. ∎

## 6 Properties of the $`S`$-machine $`𝕊`$

### 6.1 The inverse semigroup $`P(𝕊`$)

We fix an arbitrary set $`R(\kappa (1))`$ of words in the alphabet $`A(\kappa (1))=𝒜.`$ (We choose $`R(\kappa (1))=\mathrm{}`$ for the construction of the group $``$, but later we should consider arbitrary $`R(\kappa (1))`$ to prove part (2) of Theorem 1.3.)

Let $`H_a`$ be the group generated by the set $`𝐀`$ subject all relations of the form $`u^n=1`$ ($`u`$ is any word in $`𝐀`$) and relations $`r=1`$ for all $`rR(\kappa (1))`$. The group $`H_a`$ is isomorphic to the free product in the variety of groups of exponent $`n`$ of subgroups $`A(z)`$, $`z\overline{𝐊}`$, where all $`A(z)`$, $`z\kappa (1)`$, are free Burnside groups of exponent $`n`$, and $`A(\kappa (1))`$ is a group of exponent $`n`$ with additional relators from $`R(\kappa (1)).`$

Let $`H_{ka}^{}`$ be the free product of the group $`H_a`$ and the free group freely generated by the set $`𝐊`$.

¿From now on we will not distinguish admissible words which are equal in $`H_{ka}^{}`$. Thus a word of the form $`y_1u_1\mathrm{}y_t`$ where $`y_i𝐊`$, $`u_i`$ are words in $`A(z_i)`$, is admissible if for every $`i=1,\mathrm{},t1`$, either $`y_{i+1}(y_i)_+`$ or $`y_{i+1}y_i^1`$.

If no sector of an admissible word $`W`$ is equal in $`H_{ka}^{}`$ to a word without $`𝐊`$-letters then $`W`$ is called a reduced admissible word. By Lemma 3.3 this property of an admissible word is equivalent to being $`𝐊`$-reduced in $`H_{ka}^{}`$.

The result of an application of an $`S`$-rule to an admissible word is again an admissible word.

Let $`W^{}`$ be a word obtained from $`W`$ by an application of a rule $`\tau `$ from $`𝕊`$. Then the $`𝐊`$-letters in $`W`$ differ from the corresponding $`𝐊`$-letters in $`W^{}`$ by their $`\mathrm{\Omega }`$-coordinates only.

Therefore we have the following simple fact.

###### Lemma 6.1.

If $`W^{}`$ is obtained from $`W`$ by a nonempty sequence of applications of $`S`$-rules from $`𝕊`$ then the word $`W^{}`$ is also admissible and the $`𝐊`$-letters of $`W^{}`$ differ from the corresponding $`𝐊`$-letters in $`W`$ only by the $`\mathrm{\Omega }`$-coordinate. The $`\mathrm{\Omega }`$-coordinate of $`W^{}`$ is $`\omega `$ if and only if the last rule applied was from $`𝕊_\omega `$ or equal to $`𝐜_{\omega 1}`$, $`𝐜_\omega ^1`$.

Thus every $`\tau 𝕊`$ defines a partial one-to-one transformation of the set of admissible words. Let $`P(𝕊)`$ be the subsemigroup generated by these partial transformations in the inverse semigroup of all partial one-to-one transformations of the set of admissible words. Then $`P(𝕊)`$ is an inverse semigroup because for every rule $`\tau `$ in $`𝕊`$, the inverse rule $`\tau ^1`$ is also in $`𝕊`$. The zero of $`P(𝕊)`$ is a transformation with empty domain. Removing zero from $`P(𝕊)`$ we get what is usually called a pseudogroup of partial transformations. Every word in $`𝕊`$ induces a partial one-to-one transformation from $`P(𝕊)`$.

The following obvious lemma is a general property of inverse semigroups .

###### Lemma 6.2.

Let a word $`h`$ over $`𝕊`$ be graphically equal to $`h_1aa^1h_2`$. Then, considered as a transformation of the set of admissible words, the domain of $`h`$ is contained in the domain of $`h_1h_2`$, but the partial transformations induced by $`h`$ and $`h_1h_2`$ coincide on the domain of $`h`$. Thus for every word $`h`$ over $`𝕊`$ the domain of the transformation induced by $`h`$ is contained in the domain of transformation induced by the reduced form of $`h`$.

Notice that the domain of the reduced form of $`h`$ may be strictly bigger than the domain of $`h`$.

If $`h`$ is a word in $`𝕊`$ then denote by $`Wh`$ ($`W`$ is an admissible word), the result of the application of the freely reduced form of $`h`$ to $`W`$ (if it exists). Thus the equality $`Wh=W^{}`$ means that $`W`$ is in the domain of the freely reduced form of $`h`$ and the transformation induced by the reduced form of $`h`$ takes $`W`$ to $`W^{}`$.

The following easy but important lemma immediately follows from the definition of application of an $`S`$-rule to an admissible word.

###### Lemma 6.3.

Let $`W`$ be an admissible word. Let $`h\tau _1\mathrm{}\tau _t`$ be a word in $`𝕊`$. Then the following conditions are equivalent:

(i) $`W`$ belongs to the domain of $`h`$;

(ii) Every sector of $`W`$ belongs to the domain of $`h`$.

Moreover $`W^{}=Wh`$ if and only if for every $`z`$-sector $`W_1`$ of $`W`$ and $`z`$-sector $`W_1^{}`$ of $`W^{}`$ we have $`W_1^{}=W_1h`$, $`z\overline{𝐊}\overline{𝐊}^1`$.

For every $`\tau 𝕊`$ and $`z\overline{𝐊}\overline{𝐊}^1`$ we have defined two words $`L(\tau ,z)`$ and $`R(\tau ,z)`$. These words belong to the free group generated by $`𝐀𝐑`$. Let $`L^a(\tau ,z)`$ and $`R^a(\tau ,z)`$ be the $`𝐀`$-projections of $`L(\tau ,z)`$ and $`R(\tau ,z)`$. For every word $`h`$ in the alphabet $`𝕊`$, we define the words $`L(h,z)`$, $`R(h,z)`$, $`L^a(h,z)`$ and $`R^a(h,z)`$ in the natural way ($`L(h,z)`$ and $`R(h,z)`$ have been already defined before). Clearly $`L^a(.,z)`$ and $`R^a(.,z)`$ are homomorphisms from the free semigroup generated by $`𝕊`$ into the subgroups $`A(z_{})`$ and $`A(z)`$ respectively.

We say that a word $`w`$ is a copy of a word $`w^{}`$ if $`w^{}`$ is obtained from $`w`$ by replacing equal letters for equal letters and different letters for different letters. For example, $`xyx`$ is a copy of $`aba`$.

The following lemma immediately follows from the definition of the words $`L(\tau ,z)`$ and $`R(\tau ,z)`$ and the definition of an application of an $`S`$-rule.

###### Lemma 6.4.

(i) Let $`h`$ be a word over $`𝕊`$ applicable (in $`P(𝕊)`$) to a one-sector admissible word $`z_1wz_2`$ then $`z_1wz_2h=z_1^{}(R^a(h,z_1))^1wL^a(h,z_2)z_2^{}`$ where $`z_i^{}`$ differs from $`z_i`$ only by the $`\mathrm{\Omega }`$-coordinate, $`i=1,2`$.

(ii) For every $`\omega \mathrm{\Omega }`$ and every $`z\overline{𝐊}\overline{𝐊}^1`$ either $`L^a(\tau ,z)`$ (resp. $`R^a(\tau ,z)`$) is empty for every $`\tau 𝕊_\omega `$ or $`L^a(\tau ,z)`$ (resp. $`R^a(\tau ,z)`$) is not empty for every $`\tau 𝕊_\omega `$. If for some $`\tau 𝕊`$ and some $`z\overline{𝐊}\overline{𝐊}^1`$, $`L^a(\tau ,z)`$ is not empty (resp. $`R^a(\tau ,z_+)`$ is not empty) then for every $`\tau 𝕊`$, $`L^a(\tau ,z_+)`$ is empty (resp. $`R^a(\tau ,z)`$ is empty).

(iii) Suppose that either none of the rules appearing in a word $`h`$ over $`𝕊`$ are from $`𝕊_{2n+1}`$ or all of them are from $`𝕊_{2n+1}`$. Then if all rules of a word $`h`$ over $`𝕊`$ are left active for $`z`$-sectors for some $`z\overline{𝐊}`$ then $`R^a(h,z)`$ is a copy of $`h`$ written in the alphabet $`A(z)A(z)^1`$. If all rules of a word $`h`$ are right active for $`z`$-sectors for some $`z\overline{𝐊}`$ then $`L^a(h,z_+)`$ is a copy of $`h`$ written in the alphabet $`A(z)`$.

###### Lemma 6.5.

(i) If $`hh_1^s`$ is a reduced word in $`𝕊`$, $`s>1`$, $`W`$ belongs to the domain of $`h`$ then $`Wh`$ and $`W`$ have the same $`\mathrm{\Omega }`$-coordinates.

(ii) Let $`h_1`$ and $`h_2`$ be two words in $`𝕊`$ which are equal in the free group modulo Burnside relations. Suppose that $`W`$ is in the domain of both $`h_1`$ and $`h_2`$. Then $`Wh_1=Wh_2`$.

(iii) Let $`h`$ be a word in $`𝕊`$ containing subword $`g`$ which is equal to 1 modulo Burnside relations: $`h=h_1gh_2`$. Suppose $`W`$ is in the domain of $`h`$. Then $`W`$ is in the domain of $`h_1h_2`$ and $`Wh_1h_2=Wh`$.

(iv) If $`W`$ belongs to the domain of $`h^2`$, where $`h`$ is a cyclically reduced word, then it belongs to the domain of $`h^s`$ for every integer $`s`$ (in particular, $`h^s`$ has a non-empty domain).

###### Proof.

(i) Recall that non-connecting rules do not change $`\mathrm{\Omega }`$-coordinates and each connecting rule $`𝐜_\omega `$ replaces $`\omega `$ by $`\omega +1`$, $`\omega \mathrm{\Omega }`$. Hence for every word $`g`$ over $`𝕊`$, there exists $`\omega `$ in $`\mathrm{\Omega }`$ such that the domain of $`g`$ consists of admissible words with $`\mathrm{\Omega }`$-coordinate $`\omega `$. Since $`Wh_1`$ is in the domain of $`h_1`$, the $`\mathrm{\Omega }`$-coordinate of $`Wh_1`$ is the same as the $`\mathrm{\Omega }`$-coordinate of $`W`$. Hence for every $`\omega \mathrm{\Omega }`$, the product of occurrences of $`𝐜_\omega ^{\pm 1}`$ in $`h_1`$ is 1. The same is true for any power $`h=h_1^s`$, $`s`$, of $`h`$. Therefore for $`Wh`$ has the same $`\mathrm{\Omega }`$-coordinate as $`W`$.

(ii) Let $`W`$ be in the domain of $`h_1,h_2`$. Suppose that $`h_1`$ is equal to $`h_2`$ modulo the Burnside relations in the free group. Clearly it is enough to assume that $`W`$ has only one sector: $`Wz_1wz_2`$. Then by Lemma 6.4(i) $`Wh_i=z_{1,i}(R^a(h_i,z_1))^1wL^a(h_i,z_2)z_{2,i}`$, $`i=1,2`$. Since $`R^a(.,z_1)`$ and $`L^a(.,z_2)`$ are homomorphisms and $`h_1`$ and $`h_2`$ are equal modulo Burnside relations, $`R^a(h_1,z_1)=R^a(h_2,z_1)`$ and $`L^a(h_1,z_2)=L^a(h_2,z_2)`$ modulo Burnside relations. But all Burnside relations hold in $`𝐀`$, so $`(R^a(h_1,z_1))^1wL^a(h_1,z_2)=(R^a(h_2,z_1))^1wL^a(h_2,z_2)`$.

It remains to show that the $`\mathrm{\Omega }`$-coordinates of $`Wh_1`$ and $`Wh_2`$ are the same. These $`\mathrm{\Omega }`$-coordinates are determined by the projections of $`h_1`$ and $`h_2`$ on the alphabet $`\{𝐜_1,\mathrm{},𝐜_{2n+1}\}`$ (because other rules do not change the $`\mathrm{\Omega }`$-coordinate). Each connecting rule $`𝐜_\omega `$ induces a partial transformation on $`\mathrm{\Omega }`$ of the form $`\omega \omega +1`$. Therefore every product of $`𝐜_\omega `$, $`\omega \mathrm{\Omega }`$ which has a non-empty domain considered as a transformation of $`\mathrm{\Omega }`$, must be freely equal to a word of the form $`(𝐜_i𝐜_{i+1}\mathrm{}𝐜_s)^{\pm 1}`$ for some $`is`$.

Since $`h_1`$ and $`h_2`$ are equal modulo Burnside relations, their projections are also equal modulo Burnside relations. But words of the form $`(𝐜_i𝐜_{i+1}\mathrm{}𝐜_s)^{\pm 1}`$ can be equal modulo Burnside relations only if they are graphically equal. Thus projections of $`h_1`$ and $`h_2`$ onto the alphabet $`\{𝐜_1,\mathrm{},𝐜_{2n+1}\}`$ are freely equal. It remains to observe that if two words in $`𝐜_\omega `$, $`\omega \mathrm{\Omega }`$, are freely equal and induce non-empty transformations of $`\mathrm{\Omega }`$, then they induce the same transformation of $`\mathrm{\Omega }`$. Hence $`Wh`$ and $`Wh^{}`$ have the same $`\mathrm{\Omega }`$-coordinates.

(iii) Indeed by part (ii) $`Wh_1`$ is equal to $`Wh_1g`$ and is in the domain of $`h_2`$. Therefore $`W`$ is in the domain of $`h_1h_2`$ and $`Wh_1h_2=Wh`$.

(iv) Let $`W`$ belong to the domain of $`h^2`$ where $`h`$ is cyclically reduced. It is enough to consider the case when $`W`$ consists of one sector: $`Wz_1wz_2`$.

Suppose first that $`h`$ does not contain rules which lock $`z_1`$-sectors. By Lemma 6.4(i) $`Wh^2=z_1^{}(R^a(h^2,z_1))^1wL^a(h^2,z_2)z_2^{}`$ where $`z_1^{}`$ and $`z_2^{}`$ differ from $`z_1`$ and $`z_2`$ only by the $`\mathrm{\Omega }`$-coordinate. By part (i), $`z_1^{}z_1`$ and $`z_2^{}z_2`$. So $`Wh^2`$ is in the domain of $`h`$, because $`Wh^2`$ has the same $`\mathrm{\Omega }`$-coordinate as $`W`$, and $`h`$ does not contain rules which lock $`z_1`$-sectors. Thus $`W`$ is in the domain of $`h^s`$ for all positive integers $`s`$. By part (ii), $`Wh^n=W`$. Therefore $`W`$ is in the domain of $`h^2`$ ($`n>2`$). This implies as before that $`W`$ is in the domain of $`h^s`$ for all negative integers $`s`$.

Now suppose that $`h`$ contains a rule $`\tau `$ which locks $`z_1`$-sectors, $`hh_1\tau h_2`$ for some words $`h_1,h_2`$ in $`𝕊`$. Then $`Wh_1`$ has the form $`z_1^{}z_2^{}`$ where $`z_1^{},z_2^{}`$ differ from $`z_1,z_2`$ only by the $`\mathrm{\Omega }`$-coordinate, $`h^2h_1\tau h_2h_1\tau h_2`$. Then $`Wh_1`$ and $`Wh_1\tau h_2h_1`$ have the same $`\mathrm{\Omega }`$-coordinates because both words are in the domain of $`\tau `$. Since $`\tau `$ locks $`z_1`$-sectors, $`Wh_1`$ and $`Wh_1\tau h_2h_1`$ are both equal to the word of the form $`z_1^{}z_2^{}`$ in $`H_{ka}^{}`$. Since $`Wh_1`$ is in the domain of $`\tau h_2h_1\tau h_2`$, $`Wh_1\tau h_2h_1`$ must be in the domain of $`\tau h_2h_1\tau h_2`$ too. Thus $`W`$ is in the domain of $`h_1\tau h_2h_1\tau h_2h_1\tau h_2h^3`$. Considering consequently $`Wh,Wh^2,\mathrm{}`$ instead of $`W`$, we conclude that $`W`$ is in the domain of $`h^s`$ for every positive integer $`s`$. Using part (ii), as before, we deduce the same fact for negative $`s`$. ∎

###### Lemma 6.6.

For every admissible word $`U`$ with $`\mathrm{\Omega }`$-coordinate $`\omega `$, and every two non-empty words $`h_1,h_2`$ over $`𝕊_\omega `$ if $`W`$ is in the domains of $`h_1`$, $`h_1=h_2`$ modulo Burnside relations then $`Uh_1=Uh_2`$.

###### Proof.

By Lemma 6.3, we can assume that $`Uzuz^{}`$ is a one-sector admissible word. Recall that either all rules from $`𝕊_\omega `$ are left (resp. right) active for $`z`$-sectors or all these rules lock $`z`$-sectors or none of these rules are active or locking for $`z`$-sectors. Hence we can conclude that since $`U`$ is in the domain for $`h_1`$, and $`h_1`$ is not empty, it is also in the domain for $`h_2`$. The equality $`Wh_1=Wh_2`$ follows from Lemma 6.5 (ii).∎

Words in the alphabet $`𝕊`$, that do not have subwords which are equal to 1 modulo Burnside relations, will be called Burnside-reduced.

###### Lemma 6.7.

Let $`Wz_1wz_2`$ be an admissible word consisting of one sector, $`z_2z_1^1`$. Let $`h`$ be a word in $`𝕊`$. Suppose that $`R^a(\tau ,z_1)`$ (resp. $`L^a(\tau ,z_2)`$) is non-empty for all $`\tau `$ in $`h`$. Suppose that either none of the rules in $`h`$ is from $`𝕊_{2n+1}`$ or all of them are from $`𝕊_{2n+1}`$. Suppose also that $`Wh=W`$. Finally suppose that $`z_1\kappa (1)`$, $`z_1\rho (1)^1`$. Then $`h`$ is equal to 1 modulo Burnside relations.

###### Proof.

We only consider the case when $`R^a(\tau ,z_1)`$ is not empty because the $`L^a`$-case is similar. Recall that by Lemma 6.4 (ii) then $`L^a(\tau ,z_1)`$ is empty for every $`\tau `$ from $`h`$. By Lemma 6.4(i), $`Wh`$ is graphically equal to $`z_1R^a(h,z_1)^1wz_2`$ and by Lemma 6.4 (iii) $`R^a(h,z_1)`$ is a copy of the word $`h`$ written in the alphabet $`A(z_1)A(z_1)^1`$. Since $`Wh=W`$, $`R^a(h,z_1)=1`$ in the subgroup $`A(z_1)`$ of $`H_{ka}^{}`$. This subgroup is a free Burnside group of exponent $`n`$ (freely generated by $`A(z_1)`$). Therefore $`h`$ is equal to 1 modulo Burnside relations. ∎

The presentation of $`H_{ka}^{}`$ satisfies conditions (Z1) if we consider letters from $`𝐀`$ as $`0`$-letters and let $`Y=𝐊`$, so we can apply Lemmas from Section 3.2. In particular, by Lemma 3.3, an admissible word $`W`$ is $`𝐊`$-reduced if and only if it does not have sectors $`zuz^1`$ where $`u=1`$ modulo relations of $`H_a`$.

###### Lemma 6.8.

Let $`W`$ be a $`𝐊`$-reduced admissible word which is in the domain of some word $`h`$ over $`𝕊`$. Then $`Wh`$ is also $`𝐊`$-reduced.

###### Proof.

Indeed, one only needs to check that no sector in $`Wh`$ is equal to 1 in $`H_{ka}^{}`$. Indeed, it is trivial for sectors of the form $`zwz_+`$ because the application of $`\tau `$ do not change the $`\overline{𝐊}`$-projections of $`𝐊`$-letters and the free group $`𝐊`$ is a retract of $`H_{ka}^{}`$. If a sector of $`W`$ has the form $`zwz^1`$ then the corresponding sector in $`Wh`$ has the form $`zuwu^1z^1`$ for some $`u`$ by Lemma 6.4. This sector is equal to 1 only if $`uwu^1=1`$. But then $`w=1`$ and the sector $`zwz^1`$ is also equal to 1 in $`H_{ka}^{}`$. ∎

From now on we consider only $`𝐊`$-reduced admissible words.

###### Lemma 6.9.

Let $`Wzwz^1`$ be an admissible word consisting of one sector. Let $`h`$ be a reduced word in $`𝕊`$ and $`W`$ is in the domain of $`h`$. Then $`h`$ does not contain rules which lock $`z`$-sectors.

###### Proof.

Indeed, suppose $`hh_1\tau h_2`$ for some $`\tau 𝕊`$ which locks $`z`$-sectors. Then by Lemma 6.4

$$Wh_1=z^{}R^a(h_1,z)w(R^a(h_1,z))^1(z^{})^1=z^{}(z^{})^1$$

because $`Wh_1`$ is in the domain of $`\tau `$. This implies that $`w=1`$ and $`W=1`$ which contradicts the assumption that $`W`$ is reduced in $`H_{ka}^{}`$. ∎

###### Lemma 6.10.

Let $`Wzwz^1`$ be an admissible word consisting of one sector. Let $`h`$ be a word in $`𝕊`$ and all rules in $`h`$ are left active for $`z`$-sectors. Suppose that $`Wh=W`$. Then

(i) $`R^a(h,z)`$ commutes with $`w`$

(ii) if in addition $`z\kappa (1)`$ and $`h`$ either does not contain rules from $`𝕊_{2n+1}`$ or contains only rules from $`𝕊_{2n+1}`$ then $`h`$ is equal modulo Burnside relations to the power of a certain word $`\text{root}_\omega (w)`$ depending only on $`w`$ and the $`\mathrm{\Omega }`$-coordinate of $`z`$. Moreover $`W\text{root}_\omega (w)=W`$.

###### Proof.

The first statement immediately follows from Lemma 6.4(i). To prove (ii), recall that by Lemma 6.4(iii) $`R^a(h,z)`$ is a copy of $`h`$ written in the alphabet $`A(z)^1`$ and the subgroup $`A(z)`$ of $`H_{ka}^{}`$ is the free Burnside group of exponent $`n`$. By Lemma 4.18 then $`R^a(h,z)`$ and $`w`$ belongs to the same maximal cyclic subgroup $`w_0`$ of $`A(z)`$ where $`w_0`$ depends only on $`w`$. Therefore $`h`$ is equal modulo Burnside relations to a power of a copy of $`w_0`$ written in the alphabet $`𝕊`$. Denote this copy by $`\text{root}_\omega (w)`$. Then all rules in $`\text{root}_\omega (w)`$ are left active for $`z`$-sectors, and so $`W`$ is in the domain of $`\text{root}_\omega (w)`$. Since $`R^a(\text{root}_\omega (w),z)=w_0`$ commutes with $`w`$, we have $`W\text{root}_\omega (w)=W`$. ∎

###### Lemma 6.11.

Let $`h`$ be a reduced word in $`𝕊`$ containing a subword of the form $`𝐜_\omega ^{\pm 1}h^{}𝐜_\omega ^1`$ where $`h^{}`$ is a word in $`𝕊_\omega `$ or $`𝕊_{\omega +1}`$. Let $`Wz_1wz_2`$ be an admissible word consisting of one sector, $`z_1\kappa (1),\rho (1)^1`$. Suppose that $`𝐜_\omega `$ locks $`z_1`$-sectors, but rules from $`h^{}`$ are (left or right) active for $`z_1`$-sectors. Finally suppose that $`W`$ is in the domain of $`h`$. Then $`h^{}`$ is equal to 1 modulo Burnside relations.

###### Proof.

Indeed, since $`𝐜_\omega `$ locks $`z_1`$-sectors, by Lemma 6.9 $`z_2z_1^1`$. Thus $`z_2(z_1)_+`$ by the definition of admissible words. From the definition of $`𝕊`$, it follows that then either $`R^a(\tau ,z_1)`$ is empty for all $`\tau 𝕊`$ or $`L^a(\tau ,z_2)`$ is empty for all $`\tau 𝕊`$. Without loss of generality assume that $`L^a(\tau ,z_2)`$ is empty for all $`\tau `$ from $`h^{}`$. Then $`R^a(\tau ,z_1)`$ are not empty for $`\tau `$ from $`h^{}`$ and by Lemma 6.4 (iii) $`R^a(h^{},z_1)`$ is a copy of $`h^{}`$ written in the alphabet $`A(z_1)A(z_1)^1`$. By Lemma 6.4 (i), $`Wh=z_1R^a(h^{},z_1)z_2=z_1z_2`$ because $`Wh`$ is in the domain of $`𝐜_\omega ^1`$ which locks $`z_1`$-sectors. Therefore $`R^a(h^{},z_1)=1`$, thus $`h^{}`$ is 1 modulo Burnside relations. ∎

The argument in the proof of Lemma 6.11 can be easily generalized to prove the following statement.

###### Lemma 6.12.

Let $`h`$ be a reduced word in $`𝕊`$ of the form $`h_1h_2`$. Let $`Wz_1wz_2`$ be an admissible word consisting of one sector, $`z_2(z_1)_+`$, $`z_1\kappa (1),\rho (1)^1`$. Suppose that $`W`$ is in the domain of $`h`$ and $`Wh_1=Wh_1h_2`$ and that rules from $`h_2`$ are active for $`z_1`$-sectors. Then $`h_2=1`$ modulo Burnside relations.

###### Lemma 6.13.

Let $`Wzuz^{}`$ be a one-sector admissible word and $`h,g`$ be words over $`𝕊`$, $`Wh=W`$, $`Wghg^1=W`$. Suppose that at least one of the following three possibilities holds for all rules $`\tau `$ of $`h,g`$ simultaneously:

(i) $`R^a(\tau ,z)`$ is not empty;

(ii) $`L^a(\tau ,z^{})`$ is not empty;

(iii) $`L^a(\tau ,z)`$ and $`R^a(\tau ,z)`$ are empty.

Suppose also that either all rules from $`h,g`$ are not from $`𝕊_{2n+1}`$ or all of them are from $`𝕊_{2n+1}`$. Finally suppose that $`z\kappa (1)`$, $`z\rho (1)^1`$. Then either $`g,h`$ commute modulo Burnside relations or $`Wg=W`$.

###### Proof.

Consider two possible cases.

Case 1. $`Wzuz_+`$. Since $`z\kappa (1),\rho (1)^1`$, by Lemma 6.4(ii) possibilities (i) and (ii) from the formulation of the lemma cannot both hold. By assumption, we have the following possibilities:

Case 1.1. For every rule $`\tau `$ from $`h,g`$, $`R^a(\tau ,z)`$ is not empty but $`L^a(\tau ,z_+)`$ is empty.

Case 1.2. For every rule $`\tau `$ from $`g,h`$, $`L^a(\tau ,z_+)`$ is not empty but $`R^a(\tau ,z)`$ is empty.

Case 1.3. For every rule $`\tau `$ from $`g,h`$ $`R^a(\tau ,z)`$ and $`L^a(\tau ,z_+)`$ are empty.

In Cases 1.1, 1.2, by Lemma 6.7, $`h=1`$ modulo Burnside relations, so $`g,h`$ commute modulo Burnside relations, as required.

In Case 1.3 by Lemma 6.4(i) for every $`\tau `$ in $`g`$, we have $`W\tau =W`$, and so $`Wg=W`$, as required.

Case 2. $`Wzuz^1`$ (again $`z\kappa (1),\rho (1)^1`$ by assumption).

Case 2.1. Suppose first that for every rule from $`g,h`$, $`R^a(\tau ,z)`$ is not empty.

In this case by Lemma 6.10 $`h`$ commutes with $`ghg^1`$ modulo Burnside relations which implies by Lemma 4.19 that $`h`$ commutes with $`g`$ modulo Burnside relations.

Case 2.2. Suppose now that every rule $`\tau `$ of $`g,h`$, $`R^a(\tau ,z)`$ (and hence $`L^a(\tau ,z^1)`$) is empty.

In this case again by Lemma 6.4(i), for every $`\tau 𝕊_\omega `$ we have $`W\tau =W`$, and so $`Wg=W`$, as required. ∎

### 6.2 Stabilizers in $`P(𝕊)`$ of subwords of the hub

For every $`i=1,\mathrm{},N`$ let $`\mathrm{\Lambda }_i`$ be the subword of $`\mathrm{\Lambda }`$ starting with $`\lambda (i)`$ and ending with $`\lambda (i+1)`$ (“$`N+1`$” here is 1).

Suppose $`i>1`$, and that $`\mathrm{\Lambda }_i(0)`$ is in the domain of a word $`h`$ over $`𝕊`$. Let $`U_i(\omega )\mathrm{\Lambda }_i(0)h`$, $`U_i\lambda (i)u_1\kappa (i)\rho (i)u_2\mathrm{}\stackrel{}{\kappa }(i,n)u_{2n+2}\lambda (i+1)`$ for some words $`u_1,\mathrm{},u_{2n+2}`$ (notice that the word between $`\kappa (i)`$ and $`\rho (i)`$ is empty, $`i=2,\mathrm{},N`$ because every rule in $`𝕊`$ locks $`\kappa (i)`$-sectors).

Let $`U_j`$ be the admissible word obtained from $`U_i`$ by replacing all indexes $`i`$ in $`\overline{𝐊}`$-letters by $`j`$:

$$U_j\lambda (j)u_1\kappa (j)\rho (j)u_2\mathrm{}\stackrel{}{\kappa }(j,n)u_{2n+2}\lambda (j+1).$$

It is easy to see by inspection that rules of $`𝕊`$ act in the same way on $`U_j`$ for all $`j>1`$. Therefore, an induction on $`|h|`$ gives us

$$\mathrm{\Lambda }_j(0)h=U_j(\omega ).$$
(20)
Let us also define $`U_1`$:

$$U_1\lambda (1)u_1\kappa (1)\mathrm{\Phi }(u_1)\rho (1)u_2\mathrm{}\stackrel{}{\kappa }(1,n)u_{2n+2}\lambda (2)$$

where $`\mathrm{\Phi }`$ is the homomorphism from $`A(\lambda (1))`$ to $`A(\kappa (1))`$ which takes every letter $`\overline{\tau (\omega ,a)}`$ to $`a(\kappa (1))^1`$ if $`\omega `$ is even and greater than 0, and every other letter to 1. Notice that the map $`\mathrm{\Phi }`$ from $`A(\lambda (1))`$ to $`A(\kappa (1))\{1\}`$ is indeed extendable to a homomorphism from $`A(\lambda (1))`$ to $`A(\kappa (1))`$ because $`A(\lambda (1))`$ is a free Burnside group and $`A(\kappa (1))`$ satisfies all Burnside relations.

###### Remark 6.14.

Notice that $`U_1`$ would be a copy of $`U_j`$ obtained by replacing index $`1`$ for $`j`$ if not for the $`\kappa `$-sector: the $`\kappa (j)`$-sector of an admissible word contains no $`𝐀`$-letters, but $`\kappa (1)`$-sectors may contain $`𝐀`$-letters. If the $`𝐀`$-subword of the $`\kappa (1)`$-sector of $`U_1`$ is trivial (say, if $`U_1`$ is in the domain of $`𝐜_{2n}^{\pm 1}`$), then $`U_1`$ is a copy of $`U_j`$.

For every word $`ua_{i_1}\mathrm{}a_{i_s}`$ over $`𝒜𝒜^1`$ and every even $`\omega `$ from $`\mathrm{\Omega }`$ let $`T_\omega (u)`$ be the word

$$\tau (\omega ,a_{i_1})\mathrm{}\tau (\omega ,a_{i_s}).$$

For every odd $`\omega 2n+1`$ from $`\mathrm{\Omega }`$ let

$$T_\omega (u)\tau (\omega ,a_{i_s})\mathrm{}\tau (\omega ,a_{i_1}).$$

Let $`z,z^{}`$ be two letters from $`\overline{𝐊}`$, $`z^{}z_+`$ or $`z^{}z^1`$ then every sector of an admissible word of the form $`(z(\omega )uz^{}(\omega ))^{\pm 1}`$ will be called a sector of the type (form) $`[zz^{}]`$.

###### Lemma 6.15.

Let $`j>1`$. Suppose $`\mathrm{\Lambda }_j(0)`$ is in the domain of a word of the form $`h𝐜_{2n}`$ where the word $`h`$ is Burnside-reduced and does not contain $`𝐜_{2n}^{\pm 1}`$. Let $`U_j(2n+1)\mathrm{\Lambda }_j(0)h𝐜_{2n}`$. Then $`\mathrm{\Lambda }_1(0)`$ is in the domain of $`h𝐜_{2n}`$ and $`U_1(2n+1)\mathrm{\Lambda }_1(0)h𝐜_{2n}`$.

###### Proof.

Suppose that $`h`$ contains a subword of the form $`𝐜_ih^{}𝐜_i^1`$ where $`h^{}`$ contains no connecting rules: $`hh_1𝐜_ih^{}𝐜_i^1h_2`$ for some even $`i`$ from $`0`$ to $`2n2`$. Then consider the sector $`W^{}`$ of the type $`[\stackrel{}{\kappa }(j,n)\lambda (j+1)]`$ of $`\mathrm{\Lambda }_j(0)h_1𝐜_i`$. Since $`𝐜_i`$ locks $`\stackrel{}{\kappa }(j,n)`$-sectors, $`W^{}`$ has the form $`\stackrel{}{\kappa }(j,n,\omega ^{})\lambda (j+1,\omega ^{})`$ (the $`𝐀`$-part of the sectors is trivial). Since $`W^{}h^{}`$ is in the domain of $`𝐜_i^1`$, $`W^{}=W^{}h^{}`$. Since all rules in $`h^{}`$ are left active for $`\stackrel{}{\kappa }(j,n)`$-sectors (all these rules belong to $`𝕊_{i+1}`$, and $`i`$ is odd), by Lemma 6.11, $`h^{}=1`$ modulo Burnside relations, a contradiction. Similarly, $`h`$ does not contain subwords of the form $`𝐜_i^1h^{}𝐜_i`$ with even $`i>0`$ where $`h^{}`$ does not contain connecting rules.

Suppose that $`h`$ contains a subword of the form $`𝐜_ih^{}𝐜_i^1`$ where $`h^{}`$ contains no connecting rules and $`i`$ is odd, $`i2n1`$. Then applying the argument similar to the one used in the previous paragraph to the sector of the form $`[\stackrel{}{\kappa }(j,n)\stackrel{}{\kappa }(j,n)]`$, we get a contradiction. Similarly one can prove that $`h`$ does not contain subwords of the form $`𝐜_i^1h^{}𝐜_i`$ where $`h^{}`$ contains no connecting rules, $`i`$ is any odd number between $`1`$ and $`2n1`$.

Suppose now that $`h`$ contains one of the connecting rules twice. Since $`\mathrm{\Lambda }_j(0)`$ has $`\mathrm{\Omega }`$-coordinate $`0`$, and $`\mathrm{\Lambda }_j(0)h`$ has $`\mathrm{\Omega }`$-coordinate $`2n`$, the facts proved in the previous two paragraphs imply that $`h`$ contains a subword of the form

$$h_0𝐜_0h_1\mathrm{}h_{2n2}𝐜_{2n1}h_{2n1}𝐜_{2n1}^1h_{2n2}^{}\mathrm{}𝐜_0^1h_0^{}$$

where the subwords $`h_\omega ,h_\omega ^{}`$ are words over $`𝕊_\omega `$. Let then $`W^{}`$ be the sector of the form $`[\rho (j)\stackrel{}{\kappa }(j,1)]`$ of $`\mathrm{\Lambda }_j(0)h_0`$. The word $`W^{}`$ is in the domain of

$$h^{\prime \prime }𝐜_0h_1\mathrm{}h_{2n2}𝐜_{2n1}h_{2n1}𝐜_{2n1}^1h_{2n2}^{}\mathrm{}𝐜_0^1,$$

$`𝐜_0`$ locks $`W^{}`$, all other rules from $`h^{\prime \prime }`$ are right active for $`\rho (j)`$-sectors. None of these rules belong to $`𝕊_{2n+1}`$. Hence by Lemma 6.11, $`h^{}=1`$ modulo Burnside relations, a contradiction. Therefore $`h`$ contains each of its connecting rules only once.

Hence $`h`$ can be represented in the form $`h_0𝐜_0h_1𝐜_1\mathrm{}h_{2n}`$ for some words $`h_i`$ over $`𝕊_i`$, $`i=0,\mathrm{},2n`$.

For some words $`u_0,\mathrm{},u_{2n}`$ over $`𝒜𝒜^1`$, $`h_iT_i(u_i)`$, $`i=0,\mathrm{},2n`$. Let us prove by induction on $`i`$ that $`u_i=u_0`$ modulo Burnside relations. Indeed, this statement is trivial for $`i=0`$. Suppose that it is true for some $`\omega `$ from $`0`$ to $`2n1`$. Let us prove it for $`\omega +1`$. Since $`u_0=u_1=\mathrm{}=u_\omega `$ modulo Burnside relations, by Lemma 6.6,

$$\mathrm{\Lambda }_j(0)h_0𝐜_0h_1𝐜_1\mathrm{}h_\omega 𝐜_\omega =\mathrm{\Lambda }_j(0)T_0(u)𝐜_0T_1(u)𝐜_1\mathrm{}T_\omega (u)𝐜_\omega =V.$$

In particular the $`\mathrm{\Omega }`$-coordinate of $`V`$ is $`\omega +1`$.

Suppose that $`\omega `$ is even. Then as in the proof of Lemma 5.2 the sector of the form $`[\stackrel{}{\kappa }(j,n)\stackrel{}{\kappa }(j,n)]`$ of $`V`$ is equal to $`\stackrel{}{\kappa }(j,n,\omega +1)u\stackrel{}{\kappa }(j,n,\omega +1)`$. Since $`VT_{\omega +1}(u_{\omega +1})`$ is in the domain of $`𝐜_{\omega +1}`$ and $`𝐜_{\omega +1}`$ locks $`\stackrel{}{\kappa }(j,n)`$-sectors, we get that the sector of the form $`[\stackrel{}{\kappa }(j,n)\stackrel{}{\kappa }(j,n)]`$ of $`VT_{\omega +1}(u_{\omega +1})`$ is equal to $`\stackrel{}{\kappa }(j,n,\omega +1)\stackrel{}{\kappa }(j,n,\omega +1)`$. By Lemma 6.4, we get that $`u_{\omega +1}=u`$ modulo Burnside relations, as required.

If $`\omega `$ is odd then we can apply the above argument to the sector of the form $`[\stackrel{}{\kappa }(j,n)\lambda (j+1)]`$ of $`V`$.

Therefore we can apply Lemma 6.6 $`2n+1`$ times and conclude that $`\mathrm{\Lambda }_1(0)h_0=\mathrm{\Lambda }_1(0)T_0(u)`$, $`\mathrm{\Lambda }_1(0)h_0`$ is in the domain of $`𝐜_0h_1`$ and $`\mathrm{\Lambda }_1(0)h_0𝐜_0h_1=\mathrm{\Lambda }_1(0)T_0(u)𝐜_0T_1(u)`$,…, $`\mathrm{\Lambda }_1(0)h_1𝐜_0\mathrm{}h_{2n1}=\mathrm{\Lambda }_1(0)T_0(u)𝐜_0\mathrm{}T_{2n1}(u)`$ is in the domain of $`𝐜_{2n1}h_{2n}`$ and

$$\mathrm{\Lambda }_1(0)h_1𝐜_0\mathrm{}h_{2n1}𝐜_{2n1}h_{2n}=\mathrm{\Lambda }_1(0)T_0(u)𝐜_0\mathrm{}T_{2n1}(u)𝐜_{2n1}T_{2n}(u)=V^{}.$$

All sectors of the latter word contain no $`𝐀`$-letters except for the $`\lambda (1)`$-sector, $`\kappa (1)`$-sector, and $`\rho (1)`$-sector. The first and the third of these sectors contain copies $`\overline{h𝐜_{2n}}`$ of the word $`h𝐜_{2n}`$, the $`\kappa (1)`$-sector contains $`u^n`$ (as in the proof of Lemma 5.2) which is equal to 1 modulo relations of $`A(\kappa (1))`$. Clearly $`\mathrm{\Phi }(\overline{h𝐜_{2n}})=u^n`$. Thus $`\mathrm{\Lambda }_1(0)h𝐜_{2n}`$ exists and is equal to $`U_1(2n+1)`$. ∎

###### Proposition 6.16.

Suppose that for some Burnside-reduced word $`h`$ over $`𝕊`$, and some $`j>1`$, $`\mathrm{\Lambda }_j(0)h=\mathrm{\Lambda }_j(0)`$. Then for every $`i=1,\mathrm{},N`$, $`\mathrm{\Lambda }_i(0)h=\mathrm{\Lambda }_i(0)`$.

###### Proof.

If $`h`$ is empty, the statement is obviously true. By (20), the statement is also true if $`i>1`$. So let $`h`$ be non-empty and $`i=1`$.

Then as in the proof of Lemma 6.15, Lemma 6.11 implies that $`h`$ contains no subwords of the form $`𝐜_i^{\pm 1}f𝐜_i^1`$ where $`f`$ does not contain connecting rules, $`i0,2n`$. Hence $`h`$ can be represented in the form

$$h_1𝐜_{2n}g_1𝐜_{2n}^1h_2^1𝐜_0^1h_2^{}𝐜_{2n}g_2𝐜_{2n}^1h_3^1𝐜_0^1h_3^{}𝐜_{2n}g_3\mathrm{}g_{s1}𝐜_{2n}^1h_s^1$$

where $`g_p`$ are non-empty words over $`𝕊_{2n+1}`$, $`p=1,\mathrm{},s1`$, $`h_1,\mathrm{},h_s,h_2^{},\mathrm{},h_{s1}^{}`$.

We claim that for every $`t=2,\mathrm{},s1`$, the word

$$V\mathrm{\Lambda }_j(0)h_1𝐜_{2n}g_1𝐜_{2n}^1h_2^1𝐜_0^1h_2^{}𝐜_{2n}g_2𝐜_{2n}^1\mathrm{}g_{t1}𝐜_{2n}^1h_t^1𝐜_0^1$$

is equal to $`\mathrm{\Lambda }_j(0)T_0(u_t)`$ for some word $`u_t`$ over $`𝐀𝐀^1`$.

Indeed, let

$$V^{}\mathrm{\Lambda }_j(0)h_1𝐜_{2n}g_1𝐜_{2n}^1h_2^1𝐜_0^1h_2^{}𝐜_{2n}g_2𝐜_{2n}^1\mathrm{}g_{t1}𝐜_{2n}^1.$$

Then $`VV^{}h_t^1𝐜_0^1`$. By Lemma 6.11, the word $`h_t`$ is represented in the form $`p_1𝐜_1p_2𝐜_2\mathrm{}p_{2n}`$ where $`p_iT_i(v_i)`$ for some words $`v_i`$ over $`𝕊_i`$, $`i=1,\mathrm{},2n`$. Since $`V^{}h_t^1`$ is in the domain of $`𝐜_0^1`$, $`V^{}h_t^1`$ has the form

$$\lambda (j,1)\kappa (j,1)\rho (j,1)\stackrel{}{\kappa }(j,1,1)w_1\stackrel{}{\kappa }(j,1,1)\stackrel{}{\kappa }(j,2,1)w_2\mathrm{}\stackrel{}{\kappa }(j,n,1)w_n\stackrel{}{\kappa }(j,n,1)\lambda (j+1,1).$$

Since $`V^{}h_t^1T_1(v_1)`$ is in the domain of $`𝐜_1`$, and $`𝐜_1`$ locks any $`\stackrel{}{\kappa }(j,i)`$-sector, by Lemma 6.4(iii), each of the words $`w_1,\mathrm{},w_n`$ is a copy of $`v_1`$. Hence $`V^{}h_t^1𝐜_0^1=\mathrm{\Lambda }_j(0)T_0(v_1)`$ as required.

Therefore $`\mathrm{\Lambda }_j(0)`$ is in the domain of $`T_0(u_t)𝐜_0h_t𝐜_{2n}`$ and $`T_0(u_t)h_t^{}𝐜_{2n}`$.

Let $`U_{j,t}(2n+1)\mathrm{\Lambda }_j(0)T_0(u_t)𝐜_0h_t𝐜_{2n}`$, $`U_{j,t}^{}(2n+1)\mathrm{\Lambda }_j(0)T_0(u_t)h_t^{}𝐜_{2n}`$. By Lemma 6.15, $`\mathrm{\Lambda }_1(0)`$ is in the domain of $`T_0(u_t)𝐜_0h_t𝐜_{2n}`$ and $`T_0(u_t)h_t^{}𝐜_{2n}`$, and $`U_{1,t}(2n+1)=\mathrm{\Lambda }_j(0)T_0(u_t)𝐜_0h_t𝐜_{2n}`$, $`U_{1,t}^{}(2n+1)=\mathrm{\Lambda }_j(0)T_0(u_t)h_t^{}𝐜_{2n}`$.

By Remark 6.14, $`U_{1,t}(2n+1)`$ is a copy of $`U_{j,t}(2n+1)`$ and $`U_{1,t}^{}(2n+1)`$ is a copy of $`U_{j,t}^{}(2n+1)`$ An easy induction on the length of a word $`g`$ over $`𝕊_{2n+1}`$ gives that $`U_{1,t}(2n+1)g`$ (resp. $`U_{1,t}^{}(2n+1)g`$) is a copy of $`U_{j,t}(2n+1)`$ (resp. $`U_{j,t}^{}(2n+1)`$).

Thus we can conclude that

$$\begin{array}{c}(\mathrm{}((\mathrm{\Lambda }_1(0)h_1𝐜_{2n}g_1)(𝐜_{2n}^1h_2^1𝐜_0^1T_0(u_1)^1))T_0(u_1)h_2^{}𝐜_{2n}g_2)\mathrm{})T_0(u_{s1})h_{s1}^{}𝐜_{2n}g_{s1})\hfill \\ 𝐜_{2n}^1h_s^1=\mathrm{\Lambda }_1(0).\hfill \end{array}$$

By Lemma 6.2, we obtain $`\mathrm{\Lambda }_1(0)h=\mathrm{\Lambda }_1(0)`$ as required. ∎

### 6.3 Stabilizers of arbitrary admissible words

We call an admissible word $`W`$ accepted if for some word $`h`$ over $`𝕊`$, the word $`Wh`$ is a cyclic shift of $`\mathrm{\Lambda }(0)^{\pm 1}`$. Clearly $`\mathrm{\Lambda }(0)`$ is an accepted word and every admissible word of the form $`\mathrm{\Lambda }(0)h`$ is accepted.

In the rest of the section, we are going to prove the following statement.

###### Proposition 6.17.

Let $`W`$ be an admissible word of the form $`z_1w_1z_2\mathrm{}z_sw_sz_1`$ (the first and the last $`𝐊`$-letters are the same) which does not contain an accepted subword.

(1) Suppose that for some $`i=1,\mathrm{},N`$, every sector of $`W`$ is of one of the types $`[\kappa (i)^1\kappa (i)]`$, $`[\kappa (i)\rho (i)]`$ or $`[\rho (i)\rho (i)^1]`$. Let $`h`$, $`g`$, $`b`$ be words in the alphabet $`𝕊`$ such that $`Wh=W`$, $`Wghg^1=W`$, $`Wb=W`$ and $`b`$ is equal to $`g^1hg`$ modulo Burnside relations. Then for every integer $`s`$ there exists a word $`b_s`$ which is equal to $`g^shg^s`$ modulo Burnside relations and such that $`Wb_s=W`$.

(2) Suppose that there is no $`i`$ from 1 to $`N`$ such that every sector of $`W`$ is of one of the types $`[\kappa (i)^1\kappa (i)]`$, $`[\kappa (i)\rho (i)]`$ or $`[\rho (i)\rho (i)^1]`$. Let $`h`$, $`g`$ be words in the alphabet $`𝕊`$ such that $`Wh=W`$, $`Wghg^1=W`$. Then $`Wg=W`$ or $`g`$ and $`h`$ commute modulo Burnside relations.

###### Remark 6.18.

Clearly if $`Wg=W`$ or $`g`$ and $`h`$ commute modulo Burnside relations then the conclusion of (1) holds, so the conclusion of (2) is stronger than the conclusion of (1).

Let us prove condition (1) of the proposition. Thus consider the case when for some $`i=1,\mathrm{},N`$, $`W`$ contains sectors only of the form $`[\kappa (i)^1\kappa (i)]`$, $`[\kappa (i)\rho (i)]`$ or $`[\rho (i)\rho (i)^1]`$.

Notice that since $`W`$ starts and ends with the same $`𝐊`$-letter, the definition of admissible words forces $`W`$ to have all three of these types of sectors. Indeed, suppose that $`W`$ contains a sector of the type $`[\kappa (i)\rho (i)]`$. Then $`W`$ must contain sectors of the types $`[z\kappa (i)]`$ and $`[\rho (i)z^{}]`$ for some $`z,z^{}`$. By assumption, each of these sectors can be of one of the three types $`[\kappa (i)^1\kappa (i)]`$, $`[\kappa (i)\rho (i)]`$ or $`[\rho (i)\rho (i)^1]`$. Hence $`z\kappa (i)^1`$, $`z^{}\rho (i)^1`$. Thus sectors of all three types are inside $`W`$. If $`W`$ contains a sector of the type $`[\kappa (i)^1\kappa (i)]`$ then it must contain a sector of the type $`[\kappa (i)z]`$ for some $`z`$ and by assumption $`z`$ cannot be anything but $`\rho (i)`$. So $`W`$ contains a sector of the type $`[\kappa (i)\rho (i)]`$ which implies that $`W`$ contains all three types of sectors. Finally if $`W`$ contains a sector of the type $`[\rho (i)\rho (i)^1]`$ then $`W`$ contains a sector of the type $`[z\rho (i)]`$ for some $`z`$. This $`z`$ must be equal to $`\kappa (i)`$, so $`W`$ contains a sector of the type $`[\kappa (i)\rho (i)]`$ which, as before, implies that $`W`$ contains all three types of sectors.

Therefore by Lemma 6.9 $`h`$ and $`g`$ do not contain rules from $`𝕊_0\{𝐜_0,𝐜_0^1\}`$. We will use this below several times.

We are going to use lemmas from Section 4.3. Consider the free group freely generated by $`𝕊\backslash (𝕊_0\{𝐜_0,𝐜_0^1\})`$ as the free product of the group $`Q`$ freely generated by $`𝕊_{2n+1}\{𝐜_{2n}\}`$ and the group $`P`$ freely generated by other generators. Consider the homomorphism $`\upsilon `$ from $`P`$ to $`A(\kappa (1))`$ which takes every rule $`\tau `$ from $`P`$ to $`R^a(\tau ,\kappa (1))`$. This allows us to talk about syllables of words in $`PQ`$ and about $`\upsilon `$-trivial elements of $`PQ`$.

Notice that if $`h`$ and the reduced form of $`ghg^1`$ consist of rules from $`P`$, we can apply Lemma 6.13 to a sector of the form $`[\kappa (i)^1\kappa (i)]`$ (case (i) of the formulation of that lemma holds) and conclude that $`g,h`$ commute modulo Burnside relations. This implies part (1) of the proposition.

Thus we can assume that $`h`$ or the reduced form of $`ghg^1`$ contain rules from $`𝕊_{2n+1}\{𝐜_{2n},𝐜_{2n}^1\}`$. Since $`Wh=W,Wghg^1=W`$, $`g`$ or the reduced form of $`ghg^1`$ must contain a rule from $`𝕊_{2n+1}\{𝐜_{2n},𝐜_{2n}^1\}`$.

Therefore there exists a word $`x`$ in $`𝕊`$ such that $`W^{}=Wx`$ is in the domain of a rule from $`𝕊_{2n+1}\{𝐜_{2n},𝐜_{2n}^1\}`$. By Lemma 6.2 $`W^{}x^1hx=W^{}`$, $`W^{}(x^1gx)(x^1hx)(x^1gx)=W^{}`$, $`W^{}x^1bx=W^{}`$. It is clear that if for every integer $`s`$ there exists $`b_s^{}`$ which is equal to $`(x^1gx)^s(x^1hx)(x^1gx)^s`$ modulo Burnside relations and such that, $`W^{}b_s^{}=W^{}`$, then condition (1) holds for $`W`$, $`g,h`$. Hence we can assume that $`W=W^{}`$.

Thus all sectors of the form $`[\kappa (i)\rho (i)]`$ in $`W`$ are equal to $`\kappa (i)\rho (i)`$ (since every rule from $`𝕊_{2n+1}\{𝐜_{2n},𝐜_{2n}^1\}`$ locks $`\kappa (i)`$-sectors).

For every $`i=1,\mathrm{},N`$, consider the homomorphism $`\vartheta _i:\tau L^a(\tau ,\kappa (i))`$ from $`PQ`$ to $`A(\lambda (i))`$.

###### Lemma 6.19.

Let $`xPQ`$. Then the following conditions hold:

(i) $`\kappa (1)\rho (1)x=\kappa (1)\rho (1)`$ if and only if $`x`$ is $`\upsilon `$-trivial.

(ii) $`\kappa (1)\rho (1)`$ is in the domain of $`x`$ if and only if every $`P`$-syllable of $`x`$ except possibly the last one has trivial $`\upsilon `$-image.

(iii) Let $`W^{}\kappa (i)^1u\kappa (i)`$ be a 1-sector admissible word, $`i=1,\mathrm{},N`$. Then $`W^{}x=W^{}`$ if and only if $`\vartheta _i(x)`$ commutes with $`u`$ modulo Burnside relations.

(iv) Every 1-sector admissible word of the form $`[\kappa (i)^1\kappa (i)]`$ or $`[\rho (i)\rho (i)^1]`$, $`i=1,\mathrm{},N`$, is in the domain of $`x`$.

(v) For every sector $`W^{}`$ of the form $`[\rho (i)\rho (i)^1]`$ of the word $`W`$, $`W^{}x=W^{}`$.

(vi) If $`i=1`$ then the word $`W`$ is in the domain of $`x`$ if and only if all $`P`$-syllables of $`x`$ except possibly the last one are $`\upsilon `$-trivial. If $`i>1`$ then the word $`W`$ is in the domain of $`x`$.

(vii) If $`i=1`$ then $`Wx=W`$ if and only if $`x`$ is $`\upsilon `$-trivial, and for every sector $`W^{}\kappa (1)^1u\kappa (1)`$ of $`W`$, $`\vartheta _1(x)`$ commutes with $`u`$ modulo Burnside relations. If $`i>1`$ then $`Wx=W`$ if and only if for every sector $`W^{}\kappa (i)^1u\kappa (i)`$, $`\vartheta _i(x)`$ commutes with $`u`$ modulo Burnside relations.

###### Proof.

Since we identify letters $`\kappa (i,\omega )`$, $`\omega \mathrm{\Omega }`$, with $`\kappa (i)`$ and $`\rho (i,\omega )`$, $`\omega \mathrm{\Omega }`$, with $`\rho (i)`$ ($`i=1,\mathrm{},N`$), all rules from $`P`$ are applicable to $`W`$ and to any word of the form $`Wx`$. Rules from $`Q`$ are applicable to such a word if and only if every sector of the form $`[\kappa (1)\rho (1)]`$ is equal to $`\kappa (1)\rho (1)`$ in $`H_{ka}^{}`$. This implies parts (i), (ii) of the lemma.

All rules from $`PQ`$ are applicable to any sector of the form $`[\kappa (i)^1\kappa (i)]`$ or $`[\rho (i)\rho (i)^1]`$. For every rule $`\tau `$ from $`PQ`$, $`R^a(\tau ,\rho (i))=L^a(\tau ,\rho (i)_+)=1`$. This implies parts (iii),(iv) and (v) because of Lemma 6.4.

Parts (vi), (vii) follow from the previous parts of the lemma by Lemma 6.3. ∎

###### Lemma 6.20.

Let $`U\kappa (i)^1u\kappa (i)`$ be a one-sector admissible word $`i1`$. Suppose that $`Uh=U,Ughg^1=U`$. Then for every positive integer $`s`$, $`Ug^shg^s=U`$.

###### Proof.

By Lemma 6.19 (iii) $`\vartheta _i(h)`$, $`\vartheta _i(ghg^1)`$ commutes with $`u`$ modulo Burnside relations. Since $`u1`$ modulo Burnside relations (we have agreed to consider only reduced admissible words), by Lemma 4.19, then $`\vartheta _i(g)`$ commutes with $`\vartheta _i(h)`$ modulo Burnside relations. Hence $`\vartheta (g^shg^s)=\vartheta (h)`$ modulo Burnside relations. Since by Lemma 6.19 (iv) $`U`$ is in the domain of $`g^shg^s`$, by Lemma 6.5(ii), we get $`Ug^shg^s=Uh=U`$.∎

Now we are ready to prove part (1) of the proposition if $`i>1`$.

###### Lemma 6.21.

Part (1) of the Proposition 6.17 holds if $`i>1`$.

###### Proof.

Indeed all rules from $`𝕊`$ lock sectors of the form \[$`\kappa (i)\rho (i)`$\] and are not left active for $`\rho (i)`$-sectors and for $`\rho (i)^1`$-sectors. Therefore if $`W^{}`$ is any of the sectors of $`W`$ of the form \[$`\kappa (i)\rho (i)`$\] or \[$`\rho (i)\rho (i)^1`$\] then $`W^{}g=W^{}`$, so for every integer $`s`$, $`W^{}g^shg^s=W^{}`$. By Lemma 6.20 the same conclusion can be drawn for sectors of the form \[$`\kappa (i)^1\kappa (i)`$\]. Hence by Lemma 6.3 $`Wg^shg^s=W`$ as required. ∎

Now let $`i=1`$. It is obvious that we can assume that $`g,h1`$ modulo Burnside relations.

###### Lemma 6.22.

If there exists a word $`xPQ`$ such that $`g=xpx^1`$, $`h=xqx^1`$ modulo Burnside relations, where $`p,qP`$, then $`g`$ and $`h`$ commute modulo Burnside relations.

###### Proof.

Suppose that such a word $`x`$ exists. By Lemma 6.19 (i), the word $`h`$, the reduced form of $`ghg^1`$ and the word $`b`$ from the formulation of part (1) of the proposition are $`\upsilon `$-trivial. By Lemma 4.21, $`g`$ is also $`\upsilon `$-trivial. Then by Lemma 4.20(iii) (since $`g,h1`$) there exist words $`x_1`$ and $`x_2`$ such that $`x_1px_1^1=g`$, $`x_2qx_2^1=h`$ modulo Burnside relations, $`x_1px_1^1`$, $`x_2qx_2^1`$ are $`\upsilon `$-trivial. Since $`h,g1`$ modulo Burnside relations, $`x_1px_1^1`$, $`x_2qx_2^1`$ can be considered reduced. This implies that $`\upsilon (p)=\upsilon (q)=1`$.

We have that $`x^1x_1`$ commutes with $`p`$ modulo Burnside relations. Therefore $`x^1x_1`$ belongs to the centralizer of $`p`$ modulo Burnside relations. The centralizer of every non-trivial element of a free Burnside group is cyclic of order $`n`$ by Lemma 4.18. Therefore the centralizer of $`p`$ in the free Burnside factor of $`PQ`$ and in the free Burnside factor of $`P`$ are the same. Thus $`x^1x_1`$ belongs to $`P`$ modulo Burnside relations and $`x=x_1p_1`$ for some $`p_1P`$ from the same cyclic subgroup as $`p`$. Since $`x_1px_1^1`$ is $``$-reduced and $`\upsilon `$-trivial, all $`P`$-syllables of $`x_1p_1`$ except for, possibly, the last one are $`\upsilon `$-trivial. Hence by Lemma 6.19(vi), $`W`$ is in the domain of $`x_1p_1`$.

Notice that $`x_1p_1qp_1^1x_1^1=xqx^1=h`$ modulo Burnside relations. Hence by Lemma 6.5(ii) $`Wx_1p_1qp_1^1x_1^1=Wh=W`$. The word $`ghg^1`$ is equal to

$$x_1px_1^1x_1p_1qp_1^1x_1^1x_1p^1x_1^1=x_1pp_1qp_1^1p^1x_1^1$$

modulo Burnside relations.

Let $`W_1=Wx_1`$. Then $`W_1p_1qp_1^1=W_1`$ and $`W_1p(p_1qp_1^1)p^1=W_1`$. By Lemma 6.10 applied to a $`[\kappa (i)^1\kappa (i)]`$-sector of $`W_1`$, $`p`$ commutes with $`p_1qp_1^1`$ modulo Burnside relations. Conjugating by $`x_1`$, we deduce that $`g,h`$ commute modulo Burnside relations. ∎

Now we are ready to prove part (1) of Proposition 6.17 for $`i=1`$.

Recall that we can assume that all sectors of $`W`$ of the form $`[\kappa (1)\rho (1)]`$ are equal to $`\kappa (1)\rho (1)`$ in $`H_{ka}^{}`$.

By Lemma 6.22, we can assume that there is no word $`x`$ such that $`g=xpx^1`$, $`h=xqx^1`$ modulo Burnside relations, where $`p,qP`$.

By Lemma 6.19(i), $`h,ghg^1`$, and $`b`$ are $`\upsilon `$-trivial words. By Lemma 4.21 then $`g`$ is an $`\upsilon `$-trivial word. Hence by Lemma 6.19(i), $`W_1g=W_1`$ for every sector of $`W`$ of the form $`[\kappa (1)\rho (1)]`$. This implies that $`W_1g^shg^s=W_1`$ for every integer $`s`$. By Lemma 6.20, the same equality is true for every sector of $`W`$ of the form $`[\kappa (1)^1\kappa (1)]`$. By Lemma 6.19(v) the same is true for sectors of the form $`[\rho (1)\rho (1)^1]`$. Thus $`Wg^shg^s=W`$ for every integer $`s`$.

This completes the proof of part (1) of Proposition 6.17.

Now let us prove part (2) of the proposition. So let us assume that there is no $`i=1,\mathrm{},N`$ such that each sector of $`W`$ is of one of the forms $`[\kappa (i)\rho (i)]`$, $`[\kappa (i)^1\kappa (i)]`$, $`[\rho (i)\rho (i)^1]`$. Assume that part (2) of Proposition 6.17 is not true and that $`(|h|,|g|)`$ is the smallest in lexicographic order pair of numbers for all such counterexamples $`(h,g)`$ (for any $`W`$). Clearly the word $`h`$ is not empty.

The next four lemmas allow us to improve out counterexample $`(h,g)`$.

###### Lemma 6.23.

For every word $`x`$ over $`𝕊`$ such that $`W`$ is in the domain of $`x`$, the pair $`(x^1hx,x^1gx)`$ is also a counterexample to statement (2) of Proposition 6.17.

###### Proof.

Indeed by Lemma 6.2 $`(Wx)x^1hx=Wx`$,

$$(Wx)(x^1gx)(x^1hx)(x^1gx)^1=Wx.$$

Also since $`W`$ does not contain accepted subwords, $`Wx`$ does not contain accepted subwords. ∎

###### Lemma 6.24.

The word $`h`$ is cyclically reduced.

###### Proof.

Suppose that $`h`$ is not cyclically reduced. We can represent $`h`$ in the form $`h_1h_2`$ such that the reduced form $`h^{}`$ of the word $`h_2h_1`$ is cyclically reduced and $`|h^{}|<|h|`$. By Lemma 6.23, the pair $`(h^{},h_1^1gh_1)`$ is also a counterexample to part (2) of Proposition 6.17. This contradicts the minimality of the counterexample $`(h,g)`$. Hence $`h`$ is cyclically reduced. ∎

###### Lemma 6.25.

There exists a possibly different counterexample $`(\overline{h},\overline{g})`$ with $`|\overline{h}|=|h|`$, $`|\overline{g}|=|g|`$ such that $`\overline{h}`$ is cyclically reduced and $`\overline{g}\overline{h}\overline{g}^1`$ is reduced. Moreover for some prefix $`x^1`$ of the word $`h`$, we have $`\overline{h}=xhx^1`$, $`\overline{g}=xgx^1`$ in the free group.

###### Proof.

By Lemma 6.24, $`h`$ is cyclically reduced.

Therefore either $`gh`$ or $`hg^1`$ is a freely reduced word. Let us assume that $`hg^1`$ is freely reduced. The right-left dual of the argument presented below will work in the case when $`gh`$ is freely reduced.

Notice that $`gg_1h^1`$ for any $`g_1`$, since otherwise $`g_1hg_1^1`$ is freely equal to $`ghg^1`$, and the counterexample $`(h,g_1)`$ would be smaller than $`(g,h)`$. Thus $`gg_1f`$ where $`f^1f^{}h`$ and $`g_1f^{}`$ is a reduced word. Hence $`ghg^1=g_1f^{}f^1g_1^1`$, whence

$$Wg_1f^{}f^1g_1^1=W$$
(21)
Since $`Wf^1f^{}=Wh=W`$, we have $`(Wf^1)f^{}f^1=Wf^1`$. Let $`W^{}=Wf^1`$. Then $`W^{}f^{}f^1=W^{}`$ and $`W^{}(fg_1)f^{}f^1(fg_1)^1=W^{}`$ by (21).

Now notice that since $`h`$ is cyclically reduced, $`|f^{}f^1|=|h|`$. If $`|fg_1|<|g|`$ then the minimality of $`(|h|,|g|)`$ implies that $`W^{}(fg_1)=W^{}`$ or $`fg_1`$ commutes with $`f^{}f^1`$ modulo Burnside relations. In the first case $`Wg_1f=W`$. Since $`Wh=W`$, we get $`Wg=W(g_1f)=W`$, a contradiction. In the second case conjugating by $`f^1`$, we get that $`g_1f`$ commutes with $`f^1f^{}=h`$ modulo Burnside relations. Therefore $`gg_1f`$ commutes with $`h`$ modulo Burnside relations, a contradiction.

Hence the length of the freely reduced form of $`fg_1`$ is equal to $`|g|`$. This implies that if $`g_1`$ is not empty then $`g`$ is cyclically reduced (since $`f`$ is not empty by our assumption).

Case 1. Suppose that $`g_1`$ is not empty. Then the word $`fg_1f^{}f^1g_1^1f^1`$ is reduced ($`fg_1`$ is reduced because $`gg_1f`$, $`|fg_1|=|g|`$, $`g_1f^{}`$ is reduced by the definition, $`f^{}f^1`$ is reduced because it is a cyclic shift of the cyclically reduced word $`h`$, $`f^1g_1^1`$ is reduced because $`g_1fg`$ is reduced). In this case $`\overline{h}f^{}f^1`$, $`\overline{g}fg_1`$ and $`xf`$. Therefore $`W`$ is in the domain of $`x^1`$. By Lemma 6.23, the pair $`(\overline{h},\overline{g})`$ is a (minimal) counterexample, as required.

Case 2. Now let $`g_1`$ be empty, that is $`fg`$. If $`g`$ is not cyclically reduced, then $`gyg_2y^1`$, $`hyg_2^1y^1h_2`$ for some $`g_2,h_2`$ and a non-empty $`y`$. Applying Lemma 6.23 for $`xy`$, we obtain a counterexample $`(g_2y^1h_2y,g_2)`$. Since $`g_2`$ is shorter than $`g`$, and $`g_2y^1h_2y`$ is of the same length as $`h`$, we get a contradiction. Hence $`g`$ is cyclically reduced.

Now let $`g^s`$ be the maximal power of $`g`$ which is a prefix of $`h`$. Using Lemma 6.23 with $`xg^s`$, we can pass from the pair $`(h,g)`$ to another minimal counterexample $`(\widehat{h},g)=(h_1g^s,g)`$ where $`h_1`$ is defined by the formula $`hg^sh_1`$. Notice that since $`h`$ is cyclically reduced by Lemma 6.24, $`h_1g^s`$ is cyclically reduced. The word $`h_1`$ is not trivial because otherwise $`g`$ and $`h`$ would commute, so $`(h,g)`$ would not be a counterexample. Since $`g`$ is cyclically reduced, the product $`\widehat{h}g^1`$ is reduced. If $`g\widehat{h}`$ is reduced, the product $`g\widehat{h}g^1`$ is reduced and we are done. Otherwise, since $`g^1`$ is not a prefix of $`\widehat{h}`$ (by the choice of $`s`$), we can apply the argument of Case 1 and produce the required counterexample. ∎

Lemma 6.25 allows us to assume (from now on) that $`ghg^1`$ is reduced.

###### Lemma 6.26.

The words $`g`$, $`h`$ are Burnside reduced.

###### Proof.

Let $`h`$ contain a non-empty subword $`c`$ which is equal to $`1`$ modulo Burnside relations. Then $`hh_1ch_2`$ for some $`h_1,h_2`$. By Lemma 6.5 (iii), $`Wh_1h_2=W`$. Since $`ghg^1`$ is reduced, we have $`Wgh_1ch_2g^1=W`$, so $`Wgh_1h_2g^1=W`$. Now it is clear that $`(h_1h_2,g)`$ is a counterexample to part (2) of Proposition 6.17, which contradicts the minimality of $`(h,g)`$. Similarly if $`g`$ is not Burnside-reduced, we can shorten $`g`$. ∎

###### Lemma 6.27.

One cannot represent $`h`$ as a product $`h_1h_2h_3`$ where $`h_1=h_3^1`$ modulo Burnside relations and $`h_1,h_3`$ consist of rules from the same $`𝕊_\omega `$, $`\omega \mathrm{\Omega }`$, and at least one of the words $`h_1`$ or $`h_3`$ is not empty.

###### Proof.

If one of the words $`h_1`$ or $`h_3`$ is empty then $`h_1=h_3=1`$ modulo Burnside relations, and we get a contradiction with Lemma 6.26. Hence both $`h_1`$ and $`h_3`$ are not empty. Let $`f`$ be a shortest word among $`h_1,h_3^1`$. By Lemma 6.6, $`h_1,h_3^1,f`$ define the same transformation from $`P(𝕊)`$. Hence we have

$$Wh=Wh_1h_2h_3=Wfh_2f^1=Wfh_2f^1=W$$

and, since $`ghg^1`$ is reduced,

$$Wgh_1h_2h_3g^1=Wg(fh_2f^1)g^1=W.$$

Since $`h=fh_2f^1`$ modulo Burnside relations, the pair $`(fh_2f^1,g)`$ is a counterexample to part (2) of Proposition 6.17. Since $`|f||h_1|,|h_3|`$, $`(fh_2f^1,g)`$ is a minimal counterexample. But $`fh_2f^1`$ is not cyclically reduced, a contradiction with Lemma 6.24. ∎

###### Lemma 6.28.

Suppose that $`ghg^1`$ contains a connecting rule $`𝐜_\omega ^{\pm 1}`$ which locks a sector $`zwz^{}`$ of $`W`$, $`z\kappa (1),\rho (1)^1`$. Suppose that all rules in $`ghg^1`$ which differ from $`𝐜_\omega ^{\pm 1}`$ are left or right active for $`z`$-sectors. Then $`ghg^1`$ contains at least two different connecting rules $`𝐜_i^{\pm 1}`$ and $`𝐜_{i+1}^{\pm 1}`$, $`i\mathrm{\Omega }`$.

###### Proof.

By Lemma 6.9, $`z^{}z_+`$; $`z\kappa (i),\rho (i)^1`$ for any $`i`$ because all rules lock $`\kappa (i)`$-sectors if $`i>1`$, and $`z\kappa (1),\rho (1)^1`$ by assumption. Hence every connecting rule changes the $`\mathrm{\Omega }`$-coordinate of $`z`$-sectors.

Suppose, by contradiction, that $`ghg^1`$ does not contain two different connecting rules. Since $`Wghg^1=W`$ and $`Wh=W`$, and the word $`ghg^1`$ is reduced, $`W`$ and $`Wg`$ have the same $`\mathrm{\Omega }`$-coordinate. Hence either $`g`$ does not contain $`𝐜_\omega ^{\pm 1}`$ or $`g`$ contains a subword $`𝐜_\omega ^{\pm 1}f𝐜_\omega ^1`$ where $`f`$ contains no connecting rules. In the first case, $`h`$ contains $`𝐜_\omega ^{\pm 1}`$, so (since $`Wh=W`$), $`h`$ contains a subword of the form $`𝐜_\omega ^{\pm 1}f𝐜_\omega ^1`$. In both cases $`f`$ contains rules from only one $`𝕊_i`$. All these rules are active for $`z`$-sectors by our assumption. Hence by Lemma 6.11 (which can be applied since $`z\kappa (1),\rho (1)^1`$), $`f=1`$ modulo Burnside relations, a contradiction with Lemma 6.26. ∎

###### Lemma 6.29.

$`W`$ cannot contain a sector of the form $`[\stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)^1]`$.

###### Proof.

Suppose that $`W`$ contains such a sector $`W^{}\stackrel{}{\kappa }(i,j,\omega )w\stackrel{}{\kappa }(i,j,\omega )^1`$. Notice that since $`W`$ starts and ends with the same $`𝐊`$-letter, it must contain a sector $`W^{\prime \prime }`$ of the form $`z^1w^{\prime \prime }z`$, $`z\overline{𝐊}(\omega )`$, either to the left or to the right of our sector $`W^{}`$. Replacing $`W`$ by $`W^1`$ if necessary, we can assume that such a sector occurs to the left of $`W^{}`$. We also choose $`W^{\prime \prime }`$ to be as close to $`W^{}`$ on the left as possible.

By Lemma 6.9, $`ghg^1`$ does not contain occurrences of $`𝐜_\omega `$ or rules from $`𝕊_\omega `$ which lock $`\stackrel{}{\kappa }(i,j)`$-sectors. For every $`t\mathrm{\Omega }`$ either $`𝐜_t`$ or $`𝐜_{t+1}`$ locks $`\stackrel{}{\kappa }(i,j)`$-sectors, and $`𝐜_{2n}`$ and every rule from $`𝕊_{2n+1}`$ lock these sectors. Therefore $`ghg^1`$ can only contain rules from two consecutive $`𝕊_t`$, $`𝕊_{t+1}`$ ($`\omega =t`$ or $`\omega =t+1`$), and does not contain rules from $`𝕊_{2n+1}\{𝐜_{2n},𝐜_{2n}^1\}`$.

If $`ghg^1`$ contains rules only from one $`𝕊_t`$, then by Lemma 6.10(ii), we have that $`h`$ and $`ghg^1`$ are equal modulo Burnside relations to powers of $`\text{root}_\omega (w)`$. By Lemma 4.19, it follows that $`h`$ and $`g`$ commute modulo Burnside relations, a contradiction.

Thus we can assume that $`ghg^1`$ contains rules from two different sets $`𝕊_t`$ and $`𝕊_{t+1}`$ or $`ghg^1𝐜_t^{\pm 1}f𝐜_t^1`$ for some $`f`$. In both cases $`ghg^1`$ contains an occurrence of $`𝐜_t`$ and an occurrence of $`𝐜_t^1`$.

Since $`W^{}`$ is not a prefix of $`W`$, by the definition of admissible words, $`W`$ contains a subword of one of the following forms:

$$\begin{array}{c}\stackrel{}{\kappa }(i,j,\omega )^1w_1\stackrel{}{\kappa }(i,j,\omega )w\stackrel{}{\kappa }(i,j,\omega )^1,\hfill \\ \stackrel{}{\kappa }(i,j1,\omega )w_1\stackrel{}{\kappa }(i,j,\omega )w\stackrel{}{\kappa }(i,j,\omega )^1(j>1),\hfill \\ \rho (i)w_1\stackrel{}{\kappa }(i,1,\omega )w\stackrel{}{\kappa }(i,1,\omega )^1,\hfill \end{array}$$

for some word $`w_1`$ over $`A(\stackrel{}{\kappa }(i,j)_{})`$.

Consider each of these cases.

Case 1. $`W`$ contains $`\stackrel{}{\kappa }(i,j,\omega )^1w_1\stackrel{}{\kappa }(i,j,\omega )w\stackrel{}{\kappa }(i,j,\omega )^1`$ for some $`w`$.

Case 1.1. Let $`j>1`$. Then $`\stackrel{}{\kappa }(i,j)_{}=\stackrel{}{\kappa }(i,j1)`$. Since for every $`t0`$ if $`𝐜_t`$ is active for $`\stackrel{}{\kappa }(i,j)`$-sectors then it locks $`\stackrel{}{\kappa }(i,j1)`$-sectors, $`𝐜_t`$ locks $`\stackrel{}{\kappa }(i,j1)`$-sectors. This contradicts Lemma 6.9.

Case 1.2. Let $`j=1`$. Then $`\stackrel{}{\kappa }(i,j)_{}\rho (i)`$. Then by Lemma 6.9, $`t,t+10`$. Recall also that $`t,t+12n+1`$ and that all other (working) rules except for rules from $`𝕊_0\{𝐜_0\}`$ are right active for $`\rho (i)`$-sectors. By Lemma 6.10 (ii) $`h`$ and $`ghg^1`$ are a powers of $`\text{root}_\omega (w_1)`$ modulo Burnside relations, so by Lemma 4.19, $`h`$ and $`g`$ commute modulo Burnside relations, a contradiction.

Case 2. $`W`$ contains $`\stackrel{}{\kappa }(i,j1,\omega )w_1\stackrel{}{\kappa }(i,j,\omega )w\stackrel{}{\kappa }(i,j,\omega )^1`$, $`j>1`$. Then $`𝐜_t`$ locks $`\stackrel{}{\kappa }(i,j1)`$-sectors (indeed, every connecting rule which does not lock some $`\stackrel{}{\kappa }(s,l)`$-sectors locks all $`\stackrel{}{\kappa }(s,l)`$-sectors). Lemma 6.28 now implies that rules of one of the sets $`𝕊_t`$ or $`𝕊_{t+1}`$ lock $`\stackrel{}{\kappa }(i,j1)`$-sectors. Let $`𝕊_t^{}`$, $`t^{}\{t,t+1\}`$ consist of rules which lock $`\stackrel{}{\kappa }(i,j1)`$-sectors. By definition of $`𝕊`$, $`t^{}\{0,2j1,2j,2j+1,\mathrm{},2n+1\}`$. Since for $`t^{}\{2j,\mathrm{},2n+1\}`$ the rules of $`𝕊_t^{}`$ lock also $`\stackrel{}{\kappa }(i,j)`$-sectors, we conclude that $`t^{}\{0,2j1\}`$.

Case 2.1. Let $`t^{}=2j1`$, $`j>1`$. Then $`t^{}=t+1`$ because rules from $`𝕊_{2j}`$ lock $`\stackrel{}{\kappa }(i,j)`$-sectors. So $`t=2j2`$. Since all rules from $`𝕊_{2j1}`$ lock all $`\stackrel{}{\kappa }(i,1)`$-, $`\stackrel{}{\kappa }(i,1)`$-,…,$`\stackrel{}{\kappa }(i,j1)`$-sectors, none of the letters $`\stackrel{}{\kappa }(i,1,\omega )`$, $`\stackrel{}{\kappa }(i,1,\omega )`$, …, $`\stackrel{}{\kappa }(i,j1,\omega )`$ belong to the sector $`W^{\prime \prime }`$ (by Lemma 6.9). The definition of admissible words now implies that in $`W`$, $`𝐊`$-letters to the left of $`\stackrel{}{\kappa }(i,j1,\omega )`$ are placed in the natural (decreasing) order from $`\stackrel{}{\kappa }(i,j1,\omega )`$ to $`\stackrel{}{\kappa }(i,1,\omega )`$. The $`𝐊`$-letter in $`W`$ next to the left of $`\stackrel{}{\kappa }(i,1,\omega )`$ may be either $`\rho (i)`$ or $`\stackrel{}{\kappa }(i,1,\omega )^1`$. Consider both cases.

Case 2.1.1. Suppose that $`W`$ contains a sector of the form $`\rho (i)w^{\prime \prime \prime }\stackrel{}{\kappa }(i,1,\omega )`$. Since neither $`t`$ nor $`t+1`$ are equal to $`0`$ or $`2n+1`$ (recall that $`t^{}\{t,t+1\}`$, $`t^{}=2j1,j>1`$), all rules from $`𝕊_t𝕊_{t+1}\{𝐜_t\}`$ are right active for the $`\rho (i)`$-sectors and (by Lemma 6.4) $`L^a(h,\stackrel{}{\kappa }(i,1))`$ is a copy of $`h`$. Since $`Wh=W`$, we conclude that $`h=1`$ modulo Burnside relations, a contradiction.

Case 2.1.2. Suppose that $`W`$ contains a sector of the form $`\stackrel{}{\kappa }(i,1,\omega )^1w^{\prime \prime \prime }\stackrel{}{\kappa }(i,1,\omega )`$. Then by Lemma 6.10 $`h`$ and $`ghg^1`$ belong to the same cyclic subgroup generated by $`\text{root}_\omega (w^{\prime \prime \prime })`$ modulo Burnside relations. As before, by Lemma 4.19, this implies that $`h`$ and $`g`$ commute modulo Burnside relations, a contradiction.

Case 2.2. Let $`t^{}=0`$. Then $`ghg^1`$ contain rules from $`𝕊_0𝕊_1\{𝐜_0,𝐜_0^1\}`$ only.

Notice that $`g`$ cannot contain a subword of the form $`𝐜_0g_1𝐜_0^1`$ where $`g_1`$ is a word over $`𝕊_1`$. Indeed otherwise by Lemma 6.11 applied to the sector $`\stackrel{}{\kappa }(i,j1,\omega )w_1\stackrel{}{\kappa }(i,j,\omega )`$ of $`W`$, we get $`g_1=1`$ modulo Burnside relations (since $`𝐜_0`$ locks this sector, and all rules from $`𝕊_1`$ are left active for it). This would contradict Lemma 6.26. Similarly $`h`$ cannot contain a subword of the form $`𝐜_0h_1𝐜_0^1`$ where $`h_1`$ consists of rules from $`𝕊_1`$. Hence either $`h`$ contains rules from only one $`𝕊_\omega `$ or $`h`$ has the form $`h_1𝐜_0^1h_2𝐜_0h_3`$ where $`h_1,h_3`$ are possibly empty words over $`𝕊_1`$, $`h_2`$ is a word over $`𝕊_0`$.

Since $`W`$ and $`Wg`$ are in the domain of $`h`$, $`W`$ and $`Wg`$ have the same $`\mathrm{\Omega }`$-coordinate. Hence the total degree of $`𝐜_0`$ in $`g`$ is $`0`$. Therefore either $`g`$ does not contain $`𝐜_0`$ and $`𝐜_0^1`$ or $`g`$ has the form $`g_1𝐜_0^1g_2𝐜_0g_3`$ where $`g_1,g_3`$ are words over $`𝕊_1`$ (these words can be empty) and $`g_2`$ is a non-empty word over $`𝕊_0`$.

Consider these two cases separately.

Case 2.2.1. Suppose that $`g`$ does not contain $`𝐜_0`$ and $`𝐜_0^1`$. Since $`ghg^1`$ must contain $`𝐜_0`$ or $`𝐜_0^1`$, $`h`$ has the form $`h_1𝐜_0^1h_2𝐜_0h_3`$ where $`h_1,h_3`$ are words over $`𝕊_1`$, $`h_2`$ is a word over $`𝕊_0`$. Since $`Wh=W`$, the $`\mathrm{\Omega }`$-coordinate of $`W`$ is $`1`$, and $`g`$ is a word over $`𝕊_1`$.

Let us apply Lemma 6.4 (i) to the sector $`\stackrel{}{\kappa }(i,j1,\omega )w_1\stackrel{}{\kappa }(i,j,\omega )`$ of $`W`$. Since $`𝐜_0`$ locks this sector, $`R^a(gh_1,\stackrel{}{\kappa }(i,j1))=R^a(h_1,\stackrel{}{\kappa }(i,j1))=w_1`$ modulo Burnside relations. By Lemma 6.4 (iii), we obtain that $`gh_1=h_1`$ modulo Burnside relations, so $`g=1`$ modulo Burnside relations, a contradiction.

Case 2.2.2. Suppose that $`gg_1𝐜_0^1g_2𝐜_0g_3`$ where $`g_1,g_3`$ are words over $`𝕊_1`$, $`g_2`$ is a word over $`𝕊_0`$.

If $`h`$ consists of rules from $`𝕊_1`$, then we can apply Lemma 6.11 to the subword $`g_3hg_3^1`$ of $`ghg^1`$ and a sector of the type $`[\stackrel{}{\kappa }(i,j1)\stackrel{}{\kappa }(i,j)]`$ of $`Wg_1𝐜_0^1g_2𝐜_0`$ to obtain that $`g_3hg_3^1`$ is equal to 1 modulo Burnside relations. Hence $`h=1`$ modulo Burnside relations, a contradiction.

Since $`h`$ does not have subwords of the form $`c_0\overline{h}c_0^1`$, $`h`$ has the form $`h_1𝐜_0^1h_2𝐜_0h_3`$ where $`h_1,h_3`$ are words over $`𝕊_1`$, $`h_2`$ is a word over $`𝕊_0`$. Then again by Lemma 6.11, $`g_3h_1=1`$, $`h_3g_3^1=1`$ modulo Burnside relations. Hence $`h_1=h_3^1`$ modulo Burnside relations, which contradicts Lemma 6.27 if $`h_1`$ or $`h_3`$ are not empty or Lemma 6.24 if $`h_1`$ and $`h_3`$ are empty.

###### Remark 6.30.

Notice that the only properties of the sector $`\stackrel{}{\kappa }(i,j1,\omega )w_1\stackrel{}{\kappa }(i,j,\omega )`$ used in Case 2.2 are the properties that all rules from $`𝕊_0\{𝐜_0\}`$ lock this sector and all rules from $`𝕊_1`$ are active for this sector.

Case 3. Let $`W`$ contain sectors $`\rho (i)w_1\stackrel{}{\kappa }(i,1,\omega )`$ and $`\stackrel{}{\kappa }(i,1,\omega )w\stackrel{}{\kappa }(i,1,\omega )^1`$. Recall that $`t,t+12n+1`$.

Case 3.1. Suppose that $`t0`$. Then all rules from $`𝕊_t𝕊_{t+1}\{𝐜_t\}`$ are right active for $`\rho (i)`$-sectors. Therefore by Lemma 6.12 $`h=1`$ modulo Burnside relations, a contradiction.

Case 3.2. Let $`t=0`$. By Remark 6.30, this case is similar to Case 2.2 because all rules from $`𝕊_0\{𝐜_0\}`$ lock $`\rho (i)`$-sectors and all rules from $`𝕊_1`$ are (right) active for these sectors. ∎

###### Lemma 6.31.

$`W`$ cannot contain a sector of the form $`[\stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)^1]`$, $`i=1,\mathrm{},N,j=1,\mathrm{},n`$.

###### Proof.

Suppose that $`W`$ contains a sector $`W^{}`$ of the form $`\stackrel{}{\kappa }(i,j,\omega )w\stackrel{}{\kappa }(i,j,\omega )^1`$, $`i=1,\mathrm{},N,j=1,\mathrm{},n,\omega \mathrm{\Omega }`$. As in the proof of Lemma 6.29, we can assume that $`W`$ contains a sector $`W^{\prime \prime }`$ of the form $`[z^1z]`$ to the left of $`W^{}`$, $`z𝐊`$. We also assume that $`W^{\prime \prime }`$ is the closest to $`W^{}`$ such sector (in principle, $`W^{\prime \prime }`$ can have a common letter $`\stackrel{}{\kappa }(i,j,\omega )`$ with $`W^{}`$).

Since all rules from $`𝕊_0𝕊_{2n+1}\{𝐜_{2i},i=0,\mathrm{},n\}`$ lock $`\stackrel{}{\kappa }(i,j)`$-sectors, none of these rules can occur in $`ghg^1`$ by Lemma 6.9. Therefore $`ghg^1`$ involves rules from at most two sets $`𝕊_t,𝕊_{t+1}`$.

If $`ghg^1`$ contains rules of only one set $`𝕊_\omega `$ then by Lemma 6.13 $`(h,g)`$ is not a counterexample to part (2) of Proposition 6.17, a contradiction.

Thus $`ghg^1`$ contains $`𝐜_t`$ for some $`t`$. Moreover this $`t`$ must be odd because connecting rules with even indices lock $`\stackrel{}{\kappa }(i,j)`$-sectors.

Then $`𝐜_t`$ locks $`\stackrel{}{\kappa }(k,\mathrm{})`$-sectors, $`1kN,1\mathrm{}n`$. So by Lemma 6.9, $`z\stackrel{}{\kappa }(k,\mathrm{})`$ for any $`k,\mathrm{}`$.

Hence the first letter $`\stackrel{}{\kappa }(i,j,\omega )`$ of $`W^{}`$ does not belong to $`W^{\prime \prime }`$. Therefore $`W`$ contains a sector of the form $`[\stackrel{}{\kappa }(i,j)\stackrel{}{\kappa }(i,j)]`$. If rules from $`𝕊_t`$ and $`𝕊_{t+1}`$ are active for $`\stackrel{}{\kappa }(i,j)`$-sectors, and $`𝐜_t`$ locks these sectors, we get a contradiction with Lemma 6.28.

Hence rules from $`𝕊_{t+1}`$ must lock $`\stackrel{}{\kappa }(i,j)`$-sectors. Therefore these rules lock all $`\stackrel{}{\kappa }(i,j^{})`$\- and $`\stackrel{}{\kappa }(i,j^{})`$-sectors with $`j^{}<j`$. Hence $`z\stackrel{}{\kappa }(i,j^{})`$, $`j^{}=2,3,\mathrm{},j`$ and $`z\stackrel{}{\kappa }(i,j^{})`$, $`j^{}=1,2,\mathrm{},j`$. Hence the $`𝐊`$-letter preceding $`\stackrel{}{\kappa }(i,j,\omega )`$ in $`W`$ is $`\stackrel{}{\kappa }(i,j,\omega )`$, the $`𝐊`$-letter preceding $`\stackrel{}{\kappa }(i,j,\omega )`$ is $`\stackrel{}{\kappa }(i,j1,\omega )`$, etc. We conclude that $`W`$ contains a sector of one of the forms $`[\rho (i)\stackrel{}{\kappa }(i,1)]`$ or $`[\stackrel{}{\kappa }(i,1)^1\stackrel{}{\kappa }(i,1)]`$.

In the first case we get a contradiction with Lemma 6.7. In the second case by Lemma 6.10 $`h,ghg^1`$ belong to the same cyclic subgroup modulo Burnside relations, and we get a contradiction using Lemma 4.19. ∎

###### Lemma 6.32.

Not all sectors of $`W`$ have the form $`[zz^1]`$ where $`z`$ is one of the letters $`\lambda (i,\omega )`$, $`\lambda (i,\omega )^1`$, $`\rho (i)`$, $`\rho (i)^1`$.

###### Proof.

Suppose that each sector of $`W`$ has one of these forms. But for each

$$z\{\lambda (i,\omega ),\lambda (i,\omega )^1,\rho (i),\rho (i)^1\},$$

$`L^a(\tau ,z)=R^a(\tau ,z)=1`$ for every $`\tau 𝕊`$. Notice that $`W`$ is in the domain of $`g`$ because $`ghg^1`$ is reduced and $`Wghg^1=W`$. Now by Lemma 6.4 we have $`Wg=W`$, a contradiction. ∎

###### Lemma 6.33.

$`W`$ does not contain sectors of the form $`[\kappa (i)\kappa (i)^1]`$.

###### Proof.

If $`i>1`$ then the statement immediately follows from Lemma 6.9 because all rules in $`𝕊`$ lock $`\kappa (i)`$-sectors. So let $`i=1`$ and suppose that $`W`$ contains a sector of the form $`[\kappa (1)\kappa (1)^1]`$. Then by Lemma 6.9 $`ghg^1`$ does not contain rules from $`𝕊_0`$ and $`𝕊_{2n+1}`$ and connecting rules $`𝐜_0^{\pm 1},𝐜_{2n}^{\pm 1}`$. As before we may assume that there is a sector $`W^{\prime \prime }`$ of the form $`z^1w_1z`$ to the left of $`W^{}`$ in $`W`$ (if not we replace $`W`$ by $`W^1`$). In particular, $`W^{}`$ is not a prefix of $`W`$. The $`𝐊`$-letter preceding $`\kappa (1)`$ of $`W^{}`$ in $`W`$ is either $`\kappa (1)^1`$ or $`\lambda (1,\omega )`$. In the first case we get a contradiction using Lemma 6.10 (ii) and Lemma 6.19(iii) because by Lemma 6.4 (iii) $`\vartheta _1(ghg^1)`$ is a copy of $`ghg^1`$ in this case. In the second case we get a contradiction with Lemma 6.7. ∎

###### Lemma 6.34.

$`W`$ does not contain sectors of the form $`z^1wz`$, where $`z\stackrel{}{\kappa }(i,j,\omega )`$ for $`j1`$ or $`z\stackrel{}{\kappa }(i,j,\omega )`$ or $`z\lambda (i,\omega )`$.

###### Proof.

Indeed, suppose that $`W`$ contains such a sector $`W^{}`$. Then by Lemma 6.9, rules from $`𝕊_{2n+1}\{𝐜_{2n},𝐜_{2n}^1\}`$ do not occur in $`ghg^1`$ if $`z\stackrel{}{\kappa }(i,j,\omega )`$ for $`j1`$ or $`z\stackrel{}{\kappa }(i,j,\omega )`$ or $`z\lambda (i,\omega )`$.

Since $`W`$ starts and ends with the same $`𝐊`$-letter, we can assume that $`W`$ contains a sector $`W^{\prime \prime }`$ of the form $`z_1w_1z_1^1`$ to the right of $`W^{}`$. By Lemmas 6.29 and 6.31 the $`𝐊`$-letter $`z_1`$ in $`W^{\prime \prime }`$ can be of one of the forms $`\lambda (s,\omega ),\kappa (s),\rho (s)`$ for some $`s`$. By Lemma 6.9 this implies that rules from $`𝕊_0`$ and $`𝐜_0`$ cannot occur in $`ghg^1`$. As in the proofs of Lemmas 6.29, 6.31, all rules in $`ghg^1`$ are contained in $`𝕊_t𝕊_{t+1}\{𝐜_t,𝐜_t^1\}`$, $`t0,2n`$.

Case 1. Suppose that the $`𝐊`$-letter in $`W^{}`$ is $`\stackrel{}{\kappa }(i,j,\omega )`$. Then by Lemma 6.29 the $`𝐊`$-letter next to the right of $`W^{}`$ cannot be $`\stackrel{}{\kappa }(i,j,\omega )^1`$, so it must be $`\stackrel{}{\kappa }(i,j,\omega )`$. But rules from $`𝕊_t𝕊_{t+1}`$ are active for $`\stackrel{}{\kappa }(i,j)`$-sectors and the rule $`𝐜_t`$ locks this sector. Thus we get a contradiction with Lemma 6.28.

Case 2. Suppose now that $`z\stackrel{}{\kappa }(i,j,\omega )`$. Then by Lemma 6.31, the $`𝐊`$-letter next to the right of $`W^{}`$ cannot be $`\stackrel{}{\kappa }(i,j,\omega )^1`$, so it must be $`\stackrel{}{\kappa }(i,j+1,\omega )`$ if $`j<n`$ or $`\lambda (i+1,\omega )`$ if $`j=n`$. As in Case 1, rules from $`𝕊_t𝕊_{t+1}`$ are active for $`\stackrel{}{\kappa }(i,j)`$-sectors, and the rule $`𝐜_t`$ locks these sectors, which contradicts Lemma 6.28.

Case 3. Suppose that the $`𝐊`$-letter in $`W^{}`$ is $`\lambda (i,\omega )`$. Since by Lemma 6.32 not all sectors of $`W`$ have the form $`zwz^1`$ where $`z\{\lambda (i,\omega ),\lambda (i,\omega )^1\}`$, $`W`$ either has a sector of the form $`[\lambda (i)\kappa (i)]`$ or it has sectors of the forms $`[\lambda (i)\lambda (i)^1]`$ and $`[\stackrel{}{\kappa }(i1,n)\lambda (i)]`$.

Case 3.1. Suppose that $`W`$ has a sector of the form $`[\lambda (i)\kappa (i)]`$. Recall that rules from $`𝕊_0`$, $`𝐜_0,𝐜_{2n}`$ do not occur in $`ghg^1`$. All other rules are right active for $`\lambda (i)`$-sectors. This by Lemma 6.7 implies that $`ghg^1=1`$ modulo Burnside relations, a contradiction.

Case 3.2. Suppose that $`W`$ has a sector of the form $`[\lambda (i)\lambda (i)^1]`$ and a sector of the form $`[\stackrel{}{\kappa }(i1,n)\lambda (i)]`$. Since we have already proved (Cases 1, 2) that $`W`$ does not contain sectors of the form $`[\stackrel{}{\kappa }(p,q)^1\stackrel{}{\kappa }(p,q)]`$, $`[\stackrel{}{\kappa }(p,q)^1\stackrel{}{\kappa }(p,q)]`$, $`q1`$, $`W`$ must contain sectors of the forms, $`[\stackrel{}{\kappa }(i1,n)\stackrel{}{\kappa }(i1,n)]`$, $`[\stackrel{}{\kappa }(i1,n1)\stackrel{}{\kappa }(i1,n)]`$, …,$`[\stackrel{}{\kappa }(i1,1)\stackrel{}{\kappa }(i1,1)]`$. Thus $`W`$ contains $`\stackrel{}{\kappa }(i1,1,\omega )^1`$. The $`𝐊`$-letter next to the right of $`\stackrel{}{\kappa }(i1,1,\omega )^1`$ in $`W`$ is either $`\stackrel{}{\kappa }(i1,1,\omega )`$ or $`\rho (i1)^1`$. Since all rules from $`𝕊_t𝕊_{t+1}\{𝐜_t\}`$ are left active for $`\stackrel{}{\kappa }(i1,1)^1`$-sectors, in the first case we get a contradiction by using Lemma 6.10(ii) and Lemma 4.19. In the second case we get a contradiction with Lemma 6.7. ∎

###### Lemma 6.35.

If $`W`$ contains a sector $`W^{}`$ of the form $`[\stackrel{}{\kappa }(i,n)\stackrel{}{\kappa }(i,n)]`$ and a sector $`W^{\prime \prime }`$ of the form $`[\stackrel{}{\kappa }(i,n)\lambda (i+1)]`$, and $`h`$ contains a subword $`h^{}`$ of the form $`𝐜_s^{\pm 1}h_1𝐜_s^1`$, where $`h_1`$ does not contain either connecting rules or rules from $`𝕊_{2n+1}`$, then $`h_1`$ contains rules from $`𝕊_0`$.

###### Proof.

Indeed suppose that $`h_1`$ does not contain rules from $`𝕊_0`$. Notice that $`𝐜_s`$ locks either $`W^{}`$ or $`W^{\prime \prime }`$, but all rules from $`𝕊\backslash (𝕊_0𝕊_{2n+1}\{𝐜_0,\mathrm{},𝐜_{2n}\})`$ are left active for $`\stackrel{}{\kappa }(i,n)`$-sectors and for $`\stackrel{}{\kappa }(i,n)`$-sectors. Hence we can apply Lemma 6.11 to either $`W^{}`$ or $`W^{\prime \prime }`$, $`h_1`$ is equal to 1 modulo Burnside relations which contradicts Lemma 6.26. ∎

###### Lemma 6.36.

If $`W`$ contains a sector of the form $`[\stackrel{}{\kappa }(i,n)\stackrel{}{\kappa }(i,n)]`$ and a sector of the form $`[\stackrel{}{\kappa }(i,n)\lambda (i+1)]`$ then $`h`$ contains a rule from $`𝕊_0\{𝐜_0\}`$ or $`h`$ is a word over $`𝕊_{2n+1}`$.

###### Proof.

Let $`\omega `$ be the $`\mathrm{\Omega }`$-coordinate of $`W`$. Suppose $`h`$ does not contain rules from $`𝕊_0`$ and does not consist of rules from $`𝕊_{2n+1}`$.

Then by Lemma 6.35, $`h`$ has the form

$$h_\omega 𝐜_\omega h_{\omega +1}\mathrm{}h_{2n}𝐜_{2n}h_{2n+1}𝐜_{2n}^1h_{2n}^{}\mathrm{}𝐜_\omega ^1h_\omega ^{}$$

where $`h_j`$ and $`h_j^{}`$ are words over $`𝕊_j`$, $`j=\omega ,\mathrm{},2n+1`$.

The connecting rule $`𝐜_\omega `$ locks either $`\stackrel{}{\kappa }(i,n)`$-sectors or $`\stackrel{}{\kappa }(i,n)`$-sectors. The rule $`𝐜_{2n}`$ locks both $`\stackrel{}{\kappa }(i,n)`$-sectors and $`\stackrel{}{\kappa }(i,n)`$-sectors. All rules from $`𝕊_\omega `$, $`\omega <2n`$, are left active for $`\stackrel{}{\kappa }(i,n)`$-sectors, and for $`\stackrel{}{\kappa }(i,n)`$-sectors, rules from $`𝕊_{2n}`$ are left active for $`\stackrel{}{\kappa }(i,n)`$-sectors. Hence by Lemma 6.4(iii) $`h_\omega =(h_\omega ^{})^1`$ modulo Burnside relations. By Lemma 6.27, $`h_\omega `$ and $`h_\omega ^{}`$ are empty. Then $`h`$ is not cyclically reduced (it starts with $`𝐜_\omega `$ and ends with $`𝐜_\omega ^1`$, a contradiction). ∎

###### Lemma 6.37.

Suppose $`W`$ contains a sector of the form $`[\stackrel{}{\kappa }(i,n)\stackrel{}{\kappa }(i,n)]`$ and a sector of the form $`[\stackrel{}{\kappa }(i,n)\lambda (i+1)]`$. Then $`ghg^1`$ contains rules from $`𝕊_0`$.

###### Proof.

Suppose by contradiction that $`ghg^1`$ does not contain rules from $`𝕊_0`$. By Lemma 6.36 $`h`$ is a word over $`𝕊_{2n+1}`$.

Since $`Wh=W`$, the $`\mathrm{\Omega }`$-coordinate of $`W`$ is $`2n+1`$.

Suppose that $`g`$ consists of rules from $`𝕊_{2n+1}`$. Suppose that rules from $`𝕊_{2n+1}`$ are active for a sector of the form $`[zz^{}]`$ of $`W`$. Then $`z\kappa (1),\rho (1)^1`$. Hence by Lemma 6.13, either $`g`$ and $`h`$ commute modulo Burnside relations or $`Wg=W`$, a contradiction. If rules from $`𝕊_{2n+1}`$ are not active for sectors of $`W`$ then $`Wg=W`$ by Lemma 6.4(i), a contradiction. Hence $`g`$ contains some rules not from $`𝕊_{2n+1}`$.

Since $`W`$ is in the domain of $`g`$ (indeed $`W`$ is in the domain of $`ghg^1`$ and $`ghg^1`$ is reduced) , $`g`$ must start with a rule from $`𝕊_{2n+1}\{𝐜_{2n}^1\}`$. Since $`g`$ contains some rules not from $`𝕊_{2n+1}`$, $`g`$ has a subword of the form $`𝐜_t^{\pm 1}f𝐜_t^1`$ where $`f`$ is a word over some $`𝕊_t^{}`$, $`t^{}0`$. By Lemma 6.11, $`g`$ is not Burnside-reduced, a contradiction with Lemma 6.26. ∎

###### Lemma 6.38.

If $`W`$ contains an occurrence of $`\stackrel{}{\kappa }(i,j,\omega )`$ or $`\stackrel{}{\kappa }(i,j,\omega )`$ or $`\lambda (i,\omega )`$ then $`ghg^1`$ contains rules from $`𝕊_0`$.

###### Proof.

Consider the cyclic graph labeled by $`\mathrm{\Lambda }(\omega )`$ where $`\omega `$ is the $`\mathrm{\Omega }`$-coordinate of $`W`$. We can consider this graph as an “inverse automaton”, so that we can read clockwise and counterclockwise. Of course when we pass an edge labeled by $`z`$ in the counterclockwise direction, we read $`z^1`$, when we pass it in the clockwise direction, we read $`z`$. Then the word $`z_1z_2\mathrm{}z_1`$ of $`𝐊`$-letters from $`W`$ can be read on this automaton, and the start edge coincides with the end edge. This interpretation makes it clear that if $`W`$ contains $`\stackrel{}{\kappa }(i,j,\omega )`$, $`\stackrel{}{\kappa }(i,j,\omega )`$ or $`\lambda (i,\omega )`$ and does not contain sectors of the form $`[zz^1]`$ with $`z\{\stackrel{}{\kappa }(p,q,\omega ),\stackrel{}{\kappa }(p,q,\omega ),\stackrel{}{\kappa }(p,q,\omega )^1,\lambda (p,\omega )^1\}`$ for any $`p,q`$ (see Lemmas 6.29, 6.31, 6.34) then $`W`$ must contain a sector of the form $`[\stackrel{}{\kappa }(p,n)\stackrel{}{\kappa }(p,n)]`$ and a sector of the form $`[\stackrel{}{\kappa }(p,n)\lambda (p+1,n)]`$. Now the statement of the lemma follows from Lemma 6.37. ∎

###### Lemma 6.39.

$`W`$ does not contain sectors of the form $`zwz^1`$ where $`z𝐊`$.

###### Proof.

Suppose that $`W`$ contains such a sector. By Lemmas 6.29, 6.31, 6.33,

$$z\{\lambda (i,\omega ),\rho (i)\}.$$

Case 1. Let $`z\lambda (i,\omega )`$. Since by Lemma 6.34 $`W`$ does not contain sectors of the form $`[\lambda (i)^1\lambda (i)]`$, $`W`$ must contain a sector of the form $`[\stackrel{}{\kappa }(i1,n)\lambda (i)]`$. Since by Lemma 6.34 $`W`$ does not contain sectors of the form $`[\stackrel{}{\kappa }(i1,n)^1\stackrel{}{\kappa }(i1,n)]`$, $`W`$ must contain a sector of the form $`[\stackrel{}{\kappa }(i1,n)\stackrel{}{\kappa }(i1,n)]`$. Now by Lemma 6.37, $`ghg^1`$ contains a rule from $`𝕊_0`$. But this possibility cannot occur because rules from $`𝕊_0`$ lock $`\lambda (i)`$-sectors.

Case 2. Let $`z\rho (i)`$. Then $`ghg^1`$ does not contain rules from $`𝕊_0`$ by Lemma 6.9.

Suppose that $`W`$ contains a $`𝐊`$-letter of the form $`\stackrel{}{\kappa }(i,j,\omega )`$, $`\stackrel{}{\kappa }(i,j,\omega )`$ or $`\lambda (i,\omega )`$. Then as in the proof of Lemma 6.38, by Lemmas 6.29, 6.31, 6.34 $`W`$ must contain sectors of the form $`[\stackrel{}{\kappa }(i,n)\stackrel{}{\kappa }(i,n)]`$ and $`[\stackrel{}{\kappa }(i,n)\lambda (i)]`$. But this contradicts Lemma 6.37.

Therefore all $`𝐊`$-letters in $`W`$ belong to the set $`\{\kappa (i),\kappa (i)^1,\rho (i),\rho (i)^1\}`$. By Lemma 6.32 not all $`𝐊`$-letters belong to the set $`\{\rho (i),\rho (i)^1\}`$. By Lemma 6.33, not all of them belong to $`\{\kappa (i),\kappa (i)^1\}`$. Therefore for some $`i`$ from 1 to $`N`$ each sector of $`W`$ has one of the four forms $`[\kappa (i)\rho (i)]`$, $`[\kappa (i)^1\kappa (i)]`$, $`[\rho (i)\rho (i)^1]`$, $`[\rho (i)^1\rho (i)]`$ (recall that sectors of the form $`[\kappa (i)\kappa (i)^1]`$ cannot appear by Lemma 6.33). Moreover a sector of the form $`[\kappa (i)^1\kappa (i)]`$ must appear among sectors of $`W`$ (the $`𝐊`$-letter preceding $`\kappa (i)`$ in $`W`$ cannot be $`\lambda (i,\omega )`$ since $`W`$ does not contain letters of the form $`\lambda (j,\omega )`$).

If rules from $`𝕊_{2n+1}`$ do not appear in $`g,h`$ then we can consider any sector of $`W`$ of the form \[$`\kappa (i)^1\kappa (i)`$\], and use Lemma 6.10 to get a contradiction. Therefore rules from $`𝕊_{2n+1}`$ do appear in $`ghg^1`$. By the same reason not all rules in $`ghg^1`$ are from $`𝕊_{2n+1}`$. Therefore $`ghg^1`$ contains $`𝐜_{2n}`$. Since $`𝐜_{2n}`$ locks $`\kappa (i)`$-sectors, sectors of the form \[$`\rho (i)^1\rho (i)`$\] do not appear in $`W`$. Therefore for some $`i`$ all sectors of $`W`$ have the form $`[\kappa (i)^1\kappa (i)]`$, $`[\kappa (i)\rho (i)]`$ or $`[\rho (i)\rho (i)^1]`$. But this contradicts the assumption of part (ii) of Proposition 6.17. ∎

Recall that $`W`$ is an admissible word which starts and ends with the same letter and does not contain accepted subwords. By replacing $`W`$ with $`W^1`$ if necessary we can assume that the first letter in $`W`$ belongs to $`\overline{𝐊}(\omega )`$ for some $`\omega \mathrm{\Omega }`$. Then by Lemma 6.39 all $`𝐊`$-letters in $`W`$ belong to $`\overline{𝐊}(\omega )`$. Since $`W`$ is an admissible word, it must contain an admissible subword $`W^{}`$ whose projections onto $`𝐊`$-letters is equal to a cyclic shift of $`\mathrm{\Lambda }(\omega )`$.

###### Lemma 6.40.

$`W^{}`$ is an accepted word.

###### Proof.

By definition, $`W`$ contains sectors of the form $`[zz_+]`$ for every $`z\overline{𝐊}(\omega )`$. In particular, $`W`$ contains sectors of the form $`[\stackrel{}{\kappa }(1,n)\stackrel{}{\kappa }(1,n)]`$ and $`[\stackrel{}{\kappa }(1,n)\lambda (1,n)]`$. By Lemma 6.37, $`ghg^1`$ contains a rule from $`𝕊_0`$. By Lemma 6.13, $`ghg^1`$ contains rules from at least two different $`𝕊_i`$. Hence $`ghg^1`$ also contains either rules from $`𝐒_1`$ or $`𝐜_0^{\pm 1}`$.

Let us prove that $`ghg^1`$ or $`gh^1g^1`$ contains a subword $`𝐜_0h_1c_1`$ where $`h_1`$ is a word over $`𝐒_1`$. Suppose that it is not true. Then $`ghg^1`$ contains rules from $`𝕊_0\{𝐜_0,𝐜_0^1\}𝕊_1`$ only. Hence $`ghg^1`$ contains $`𝐜_0`$ and $`𝐜_0^1`$. Since the $`\mathrm{\Omega }`$-coordinates of $`W`$, $`Wg`$, $`Wgh`$ are the same, the total exponent of $`𝐜_0`$ in $`g`$ is 0 and the total exponent of $`𝐜_0`$ in $`h`$ is 0. If $`g`$ or $`h`$ contains a subword $`𝐜_0f𝐜_0^1`$ where $`f`$ is a word over $`𝕊_1`$, then by Lemma 6.7, applied to any $`\stackrel{}{\kappa }(i,j)`$-sector of $`W`$, we get that $`f=1`$ modulo Burnside relations, a contradiction with Lemma 6.26. Hence neither $`g`$ nor $`h`$ contain subwords of the form $`𝐜_0f𝐜_0^1`$. Now consider two cases.

Case 1. Suppose that $`\omega =0`$. Since $`Wghg^1=W`$, the first occurrence of $`𝐜_0^{\pm 1}`$ in $`ghg^1`$ is $`𝐜_0`$. Since $`h`$ does not contain subwords of the form $`𝐜_0f𝐜_0^1`$, this $`𝐜_0`$ occurs in $`g`$. But since $`Wg`$ has the same $`\mathrm{\Omega }`$-coordinate as $`W`$, $`g`$ must contain $`𝐜_0^1`$, hence $`g`$ contains a subword of the form $`𝐜_0f𝐜_0^1`$, a contradiction.

Case 2. Suppose that $`\omega =1`$. Then the first occurrence of $`𝐜_0^{\pm 1}`$ in $`ghg^1`$ is $`𝐜_0^1`$. Since $`Wg=W`$, we can represent $`g`$ as $`g_1g_2`$ where $`g_2`$ is the maximal suffix of $`g`$ consisting of rules from $`𝕊_1`$ and $`g_1`$ is either empty or ends with $`𝐜_0`$. Since $`Wh=W`$, we can represent $`h`$ as $`h_1h_2h_3`$ where $`h_1`$ and $`h_3`$ consist of rules from $`𝕊_1`$ and either $`h_2=h_3`$ is empty or $`h_2`$ starts with $`𝐜_0^1`$ and ends with $`𝐜_0`$. Consider any $`\stackrel{}{\kappa }(1,1)`$-sector $`U\stackrel{}{\kappa }(1,1,1)u\stackrel{}{\kappa }(1,2,1)`$ of $`W`$.

Case 2.1. Suppose that $`g_1`$ is empty, $`gg_2`$ consists of rules from $`𝕊_1`$. Since $`ghg^1`$ contains $`𝐜_0`$, $`h`$ must contain $`𝐜_0`$, so $`h_2`$ is not empty.

Since $`𝐜_0`$ locks $`U`$ and rules from $`g`$ are left active for $`\stackrel{}{\kappa }(1,1)`$-sectors, by Lemma 6.4 (i), we have $`R^a(gh_1)=u=(R^a(h_3g^1))^1`$ modulo Burnside relations. By Lemma 6.4 (iii), we have that $`gh_1=gh_3^1`$ modulo Burnside relations. Hence $`h_1=h_3^1`$ modulo Burnside relations. This contradicts Lemma 6.27 if $`h_1`$ or $`h_3`$ is not empty or Lemma 6.24 if $`h_1`$, $`h_3`$ are empty.

Case 2.2. Suppose that $`g_1`$ is not empty. Then $`g_1`$ ends with $`𝐜_0^1`$. If $`h`$ does not contain $`𝐜_0`$, that is $`h_2,h_3`$ are empty, then by Lemma 6.7 applied to a $`\stackrel{}{\kappa }(1,1)`$-sector of $`W`$, $`g_2hg_2^1=1`$ modulo Burnside relations, so $`h=1`$ modulo Burnside relations, a contradiction.

If $`h`$ contains $`𝐜_0`$, that is $`h_2`$ is not empty, then again by Lemma 6.7 $`g_2h_1=1`$, $`h_3g_2^1=1`$ modulo Burnside relations. Thus $`h_1=h_3^1`$ modulo Burnside relations which as before contradicts Lemma 6.27 or Lemma 6.24.

Thus, since one can always consider $`h^1`$ instead of $`h`$, we can assume that $`h`$ has the form $`e𝐜_0h_1𝐜_1f`$ for some words $`e,f`$. Since $`𝐜_0`$ locks $`z`$-sectors, $`z\{\lambda (i),\kappa (i),\rho (i),\stackrel{}{\kappa }(i,j)\}`$, a cyclic shift of $`W^{}e`$ has the form

$$\lambda (1,0)\kappa (1)\rho (1)\stackrel{}{\kappa }(1,1,0)u_{1,1}\stackrel{}{\kappa }(1,1,0)\stackrel{}{\kappa }(1,2,0)u_{1,2}\stackrel{}{\kappa }(1,2,0)\mathrm{}\stackrel{}{\kappa }(N,n,0)u_{N,n}\stackrel{}{\kappa }(N,n,0).$$

The word $`W^{}e𝐜_0`$ has the form

$$\lambda (1,1)\kappa (1)\rho (1)\stackrel{}{\kappa }(1,1,1)u_{1,1}\stackrel{}{\kappa }(1,1,1)\stackrel{}{\kappa }(1,2,1)u_{1,2}\stackrel{}{\kappa }(1,2,1)\mathrm{}\stackrel{}{\kappa }(N,n,1)u_{N,n}\stackrel{}{\kappa }(N,n,1)$$

Since $`𝐜_1`$ locks $`\stackrel{}{\kappa }(i,j)`$-sectors, for every $`i\{1,\mathrm{},N\}`$ and every $`j\{1,\mathrm{},n\}`$, we have

$$R^a(h_1,\stackrel{}{\kappa }(i,j))=u_{i,j}$$

modulo Burnside relations. Hence all $`u_{i,j}`$ are equal modulo Burnside relations, so a cyclic shift of $`W^{}e`$ is equal to the word

$$\lambda (1,0)\kappa (1,0)\rho (1,0)\stackrel{}{\kappa }(1,1,0)u\stackrel{}{\kappa }(1,1,0)\stackrel{}{\kappa }(1,2,0)u\stackrel{}{\kappa }(1,2,0)\mathrm{}\stackrel{}{\kappa }(N,n,0)u\stackrel{}{\kappa }(N,n,0)$$
(22)
for some word $`u`$ which is equal to $`u_{i,j}`$ modulo Burnside relations. Denote by $`\overline{u}`$ the copy of $`u`$ written in $`𝕊_0`$. Then by Lemma 6.4 $`W^{}e\overline{u}=\mathrm{\Lambda }(0)`$, so $`W^{}`$ is accepted. ∎

Lemma 6.40 gives us the final contradiction because by our assumption $`W`$ cannot contain an accepted subword. Proposition 6.17 is proved.

## 7 Bands, annuli, and trapezia

### 7.1 Definitions and basic facts

In Section 6, we introduced an auxiliary group $`H_{ka}^{}`$ which was the free product of the subgroup $`𝐊`$ freely generated by $`𝐊`$ and the subgroup $`H_a`$ generated by the set $`𝐀`$ subject to the $`R(\kappa (1))`$-relations and the Burnside relations. Recall that the subgroup $`H_a`$ is the free product in the variety of Burnside groups of exponent $`n`$ of its subgroups $`A(z)`$, $`z\overline{𝐊}`$. From now on let us call all relations of $`H_a`$ as $`a`$-relations. All relations from $`Z(𝕊)`$ involving letters from $`𝐊`$ will be called $`\kappa `$-relations and all relations involving letters from $`𝐑`$ will be called $`r`$-relations. We also will call the commutativity relations from $`Z(𝕊)`$ involving $`𝐑`$\- and $`𝐀`$-letters $`ra`$-relations. Accordingly we shall consider $`a`$-cells, $`\kappa `$-cells, $`r`$-cells and $`ra`$-cells in van Kampen diagrams. Notice that $`\kappa `$-cells are also $`r`$-cells. Recall that the set of relations $`Z(𝕊,\mathrm{\Lambda })`$ consists of $`Z(𝕊)`$ and the hub $`\mathrm{\Lambda }(0)`$. The cells corresponding the hub relation, will be called hubs as well.

In this section, we shall consider diagrams over the set $`Z(𝕊,a)`$ of all $`a`$-relations and all $`r`$-relations (including $`\kappa `$-relations).

With every word over $`𝐊𝐑𝐀`$ we associate its $`𝐊`$-length, its $`𝐑`$-length and its $`𝐀`$-length in the natural way. In any diagram over $`Z(𝕊,a)`$ we consider $`𝐑`$-edges and $`𝐀`$-edges as $`0`$-edges and $`𝐊`$-edges as non-zero edges. In a diagram is over the presentation consisting of $`a`$-relations and $`ra`$-relations, then we consider $`𝐑`$-edges as non-zero edges and $`𝐀`$-edges as zero edges. Thus the metric on a diagram depends on over what presentation this diagram is.

Let $`S`$ be one of the sets $`𝐊,𝐑,𝐀`$. Then we can consider $`S`$-bands in any diagram over $`Z(𝕊,a)`$ as in Section 2.2.

* $`𝐊`$-bands consist of $`\kappa `$-cells. A maximal $`𝐊`$-band which is not an annulus can start and end on the boundary of a diagram. All $`𝐊`$-letters of a $`𝐊`$-band belong to the same set $`\overline{𝐊}(z)`$ for some $`z\overline{𝐊}\overline{𝐊}^1`$. Thus we can consider $`\overline{𝐊}(z)`$-bands as well.
* $`𝐑`$-bands consist of $`r`$-cells. A maximal $`𝐑`$-band which is not an annulus must start and end on the boundary of the diagram. For every $`𝐑`$-band $`𝒯`$ there exists a rule $`\tau 𝕊`$ such that $`𝐑`$-edges in an $`𝐑`$-band have labels of the form $`r(\tau ,z)`$, $`z\overline{𝐊}`$. Thus we will sometimes call $`𝒯`$ a $`\tau `$-band.

The next lemma immediately follows from the definition of words $`L(.,z)`$ and $`R(.,z)`$ and the definition of $`\overline{𝐊}`$-relations.

###### Lemma 7.1.

Consider a disc or an annular diagram consisting of one $`\overline{𝐊}(z)`$-band $`𝒯`$. Then for some word $`h`$ over $`𝕊`$ (which is called the history of the band), the word written on the top of $`𝒯`$ is $`R(h,z)`$, the word written on the bottom of $`𝒯`$ is $`L(h,z)`$. The word $`R(h,z)`$ (resp. $`L(h,z)`$) is $`𝐑`$-reduced if and only if $`𝒯`$ does not contain two consecutive cells that cancel. Moreover $`L(h,z)z^{}=zR(h,z)`$ modulo $`\kappa `$-relations, where $`z,z^{}`$ are the labels of the start and end edges of the band.

The next lemma contains easy properties of $`𝐑`$-bands which follow immediately from the definition of $`Z(𝕊)`$ and Lemma 5.1.

###### Lemma 7.2.

Let

$$wu_0z_1u_1z_2\mathrm{}z_su_s$$

be the bottom side of a $`\tau `$-band $`𝒯`$,

$$w^{}u_0^{}z_1^{}u_1^{}z_2^{}\mathrm{}z_s^{}^{}u_s^{}^{}$$

be the top side of $`𝒯`$, where $`z_i,z_i^{}\overline{𝐊}(\overline{𝐊})^1`$ $`u_i,u_i^{}`$ are words over $`𝐀`$. Then $`Wz_1u_1z_2\mathrm{}z_s`$ and $`W^{}z_1^{}u_1^{}z_2^{}\mathrm{}z_s^{}^{}`$ are admissible words and $`W\tau =W^{}`$.

### 7.2 Forbidden annuli

Let $`\mathrm{\Delta }`$ be any (disc or annular) diagram over $`Z(𝕊,a)`$. We call $`\mathrm{\Delta }`$ $`Z(𝕊,a)`$-reduced if every $`𝐊`$-band is reduced (that is they do not contain consecutive $`𝐊`$-cells that cancel) and every disc subdiagram whose boundary label is a word over $`𝐀`$ and is equal to 1 modulo $`a`$-relations does not contain $`𝐑`$-edges.

###### Lemma 7.3.

Let $`\mathrm{\Delta }`$ be a $`Z(𝕊,a)`$-reduced disc diagram. Then $`\mathrm{\Delta }`$ does not contain

1. $`𝐊`$-annuli,
2. $`(𝐊,𝐑)`$-annuli,
3. $`𝐑`$-annuli,
4. disc subdiagrams with some $`r`$-cells whose boundary path contains no $`𝐑`$-edges,

###### Proof.

We are proving these statements by a joint induction on the number of cells of the inside diagrams of the annulus or the “bad” subdiagrams. By contradiction take the smallest (with respect to the number of cells) disc subdiagram $`\mathrm{\Delta }^{}`$ of $`\mathrm{\Delta }`$ which either contains one of the annuli forbidden by the lemma or has boundary path forbidden by the lemma.

Case 1. Assume there is a $`𝐊`$-annulus $`𝒬`$ in $`\mathrm{\Delta }`$. Then there exists an $`𝐑`$-edge on a side of $`𝒬`$. Hence $`𝒬`$ crosses an $`𝐑`$-band $`𝒯`$. Since $`𝒬`$ and $`𝒯`$ form a $`(𝐊,𝐑)`$-annulus with the inside diagram smaller than that for $`𝒬`$, we obtain a contradiction.

Case 2. Suppose that $`\mathrm{\Delta }^{\prime \prime }`$ is the inside diagram of a $`(𝐊,𝐑)`$-annulus $`𝒲_1𝒲_2`$ where $`𝒲_1`$ is a $`𝐊`$-band and $`𝒲_2`$ is an $`𝐑`$-band.

Then the contour of $`\mathrm{\Delta }^{\prime \prime }`$ does not contain $`\overline{𝐊}`$-edges (otherwise there would be a $`(𝐊,𝐑)`$-annulus with a smaller inside diagram). Therefore $`𝒲_1`$ consists of two cells. These two cells have a common $`𝐊`$-edge and they belong to the same $`r`$-band $`𝒲_2`$. Therefore these two $`\kappa `$-cells cancel, a contradiction.

Case 3. Suppose that there is a $`\kappa `$-cell in an $`𝐑`$-annulus $`𝒬`$. Then we get a contradiction as in Case 1. Therefore the boundary label $`W`$ of $`\mathrm{\Delta }^{\prime \prime }`$ is a word in $`𝐀`$. Since the counterexample is minimal, $`\mathrm{\Delta }^{\prime \prime }`$ has no edges except for $`𝐀`$-edges. Hence $`W=1`$ modulo $`a`$-relations. Diagram $`\mathrm{\Delta }^{}`$ has the same boundary label $`W`$, since all $`(r,a)`$-cells in $`𝒬`$, are commutativity cells. But this contradicts the property that $`\mathrm{\Delta }^{}`$ is $`Z(𝐒,𝐚)`$-reduced, because there are $`𝐑`$-edges in $`𝒬.`$

Case 4. Suppose that $`(\mathrm{\Delta }^{})`$ contains no $`𝐑`$-edges. Then by part 3 of the lemma, $`\mathrm{\Delta }^{}`$ contains no $`𝐑`$-edges, so it cannot contain $`r`$-cells, a contradiction. ∎

###### Corollary 7.4.

The group $`H_{ka}^{}`$ is (naturally) embedded into the group defined by $`Z(𝕊,a)`$.

###### Proof.

Indeed, let $`W`$ be a word in $`𝐊𝐀`$ which is equal to 1 modulo $`Z(𝕊,a)`$. Then there exists a $`Z(𝕊,a)`$-reduced van Kampen disc diagram $`\mathrm{\Delta }`$ with boundary label $`W`$. By Lemma 7.3, part 4, $`\mathrm{\Delta }`$ contains no $`r`$-cells, so all cells in $`\mathrm{\Delta }`$ are $`a`$-cells. Hence $`W=1`$ modulo $`a`$-relations, so $`W=1`$ in $`H_{ka}^{}`$. Thus the natural map of $`H_{ka}^{}`$ into the group given by the relations $`Z(𝕊,a)`$ is an embedding. ∎

### 7.3 Trapezia

Here we shall present a tool to translate results from Section 6 into the language of van Kampen diagrams and vice versa.

Let $`\mathrm{\Delta }`$ be a $`Z(𝕊,a)`$-reduced disc diagram which has the contour of the form $`p_1q_1p_2^1q_2^1`$ where:

(TR1) $`\varphi (q_1)`$, $`\varphi (q_2)`$ are $`𝐊`$-reduced words without $`𝐑`$-letters, starting and ending with $`𝐊`$-letters, and

(TR2) $`p_1`$ and $`p_2`$ are sides of reduced $`𝐊`$-bands each containing at least one $`\kappa `$-cell.

Then $`\mathrm{\Delta }`$ is called a trapezium. The path $`q_1`$ is called the bottom base, the path $`q_2`$ is called the top base of the trapezium, the paths $`p_1`$ and $`p_2`$ are called the left and right sides of the trapezium. The history of the $`𝐊`$-band whose side is $`p_1`$ is called the history of the trapezium.

By Lemma 5.1, if a word $`h`$ over $`𝕊`$ contains just one rule $`\tau `$, $`Wz_1u_1\mathrm{}z_t`$ is a reduced admissible word, and $`Wh=W_1`$, then there exists a word $`W^{}`$ which is equal to $`W`$ modulo $`a`$-relations and such that $`\tau `$ is applicable to $`W^{}`$, $`W^{}h=W_1^{}`$ where $`W_1^{}`$ is equal to $`W_1`$ modulo $`a`$-relations. By Lemma 5.1 there exists a trapezium $`\mathrm{\Theta }`$ consisting of one $`\tau `$-band with bottom base label $`W^{}`$, top base label $`W_1^{}`$. Since $`W=W^{}`$, $`W_1=W_1^{}`$ modulo Burnside relations, there exist diagrams $`\mathrm{\Delta },\mathrm{\Delta }_1`$ consisting of $`a`$-cells with boundary labels $`W(W^{})^1`$ and $`W_1(W_1^{})^1`$ respectively. Gluing three diagrams $`\mathrm{\Delta }`$, $`\mathrm{\Theta }`$, $`\mathrm{\Delta }_1`$ in a natural way, we get a trapezium $`T(W,\tau )`$ with bottom base label $`W`$, top base label $`W_1`$, left side label $`L(\tau ,z_1)`$, right side label $`R(\tau ,z_t)`$.

If a reduced word $`h`$ consists of several rules, the corresponding trapezium can be obtained by induction. Let $`h=h^{}\tau `$ where $`h^{}`$ is a word of smaller length than $`h`$. Suppose that we have constructed a trapezia $`T(W,h^{})`$ with the bottom base label $`W`$ and the top base label $`Wh^{}`$, and suppose that $`Wh`$ exists. Then $`Wh^{}`$ is in the domain of $`\tau `$, so $`\tau `$ is applicable to a reduced admissible word $`W_1`$ which is equal to $`Wh^{}`$ modulo $`a`$-relations. Then there exists a diagram $`\mathrm{\Delta }`$ over the $`a`$-relations with contour $`s_1s_2^1`$ where $`\varphi (s_1)=Wh^{},\varphi (s_2)=W_1`$. By Lemma 5.1 there exists a trapezium $`T(W_1,\tau )`$ with the bottom base label $`W_1`$. Glue $`T(W,h^{})`$ with the diagram $`\mathrm{\Delta }`$ identifying the top base of $`T(W,h^{})`$ with $`s_1`$. Then glue the resulting diagram with $`T(W_1,\tau )`$ identifying $`s_2`$ with the bottom base of $`T(W_1,\tau )`$. The $`𝐊`$-bands in the resulting diagram $`T(W,h)`$ are reduced because $`h`$ is a reduced word. Every closed path in $`T(W,h)`$ consisting of $`𝐀`$-edges is contained in one of the subdiagrams $`\mathrm{\Delta }`$ consisting of $`a`$-cells. Hence $`T(W,h)`$ is a $`Z(𝕊,a)`$-reduced diagram. It is clear that conditions (TR1) and (TR2) are satisfied. Hence $`T(W,h)`$ is a trapezium with bottom base label $`W`$, top base label $`Wh`$, left side label $`L(h,z_1)`$ and right side label $`R(h,z_t)`$. It has a form of a sandwich where diagrams consisting of $`a`$-cells are sandwiched between $`\tau `$-bands (see Figure 14).

Clearly $`T(W,h)`$ is not determined uniquely by $`W`$ and $`h`$ because we can choose the $`a`$-parts of the sandwich in many different ways. Any trapezium of the form $`T(W,h)`$ is called a normal trapezium with history $`h`$ and base label $`W`$.

Fig. 14.

###### Lemma 7.5.

Every trapezium is a normal trapezium $`T(W,h)`$ for some $`W`$ and some $`h`$.

###### Proof.

Consider a trapezium $`\mathrm{\Delta }`$ with bases $`q_1,q_2`$ and sides $`p_1`$, $`p_2`$. By condition (TR2) $`p_1`$ and $`p_2`$ contain $`𝐑`$-edges. Since by (TR2), $`p_1`$ and $`p_2`$ are sides of reduced $`𝐊`$-bands, $`\varphi (p_1),\varphi (p_2)`$ are $`𝐑`$-reduced. Since $`\mathrm{\Delta }`$ is $`Z(𝕊,a)`$-reduced, we can apply Lemma 7.3(2) and conclude that every maximal $`𝐑`$-band starting on $`p_1`$ ends on $`p_2`$ and every maximal $`𝐑`$-band starting on $`p_2`$ ends on $`p_1`$. By Lemma 7.3(3), $`\mathrm{\Delta }`$ does not contain any other maximal $`𝐑`$-bands.

Since by (TR1) $`\varphi (q_1)`$ and $`\varphi (q_2)`$ are $`𝐊`$-reduced, by Lemma 3.2 every maximal $`𝐊`$-band starting on $`q_1`$ (resp. $`q_2`$) ends on $`q_2`$ (resp. $`q_1`$) and by Lemma 7.3(1) $`\mathrm{\Delta }`$ does not have any other maximal $`𝐊`$-bands.

Let $`𝒯,𝒯^{}`$ be the first and the last maximal $`𝐊`$-bands in $`\mathrm{\Delta }`$ starting on $`q_1`$ counting from $`p_1`$ to $`p_2`$. Let $``$ and $`^{}`$ be the first and the last $`𝐑`$-bands of $`\mathrm{\Delta }`$, counting from $`q_1`$ to $`q_2`$.

Consider the subdiagram $`\mathrm{\Delta }^{}`$ of $`\mathrm{\Delta }`$ bounded by $`q_1`$ and the connecting line of $``$. By Lemma 7.2 the boundary label of $`\mathrm{\Delta }^{}`$ is equal to $`\varphi (q_1)W^1`$ where $`W`$ is an admissible word. Since $`\mathrm{\Delta }^{}`$ does not contain $`r`$-cells (by Lemma 7.3, part 3), $`W=\varphi (q_1)`$ in $`H_{ka}^{}`$. Since $`\varphi (q_1)`$ is reduced by (TR1), $`W`$ is a reduced admissible word and $`\varphi (q_1)`$ is a reduced admissible word which is equal to $`W`$. Let $`\mathrm{\Delta }^{\prime \prime }`$ be the diagram obtained from $`\mathrm{\Delta }`$ by removing $`\mathrm{\Delta }^{}`$ and $``$. Then $`(\mathrm{\Delta }^{\prime \prime })=p_1^{}q_1^{}(p_2^{})^1(q_2^{})^1`$ where $`p_1^{}`$ is a side of $`𝒯`$ without the first cell, $`p_2^{}`$ is a side of $`𝒯^{}`$ without the first cell, $`q_1^{}`$ is a side of $``$, $`q_2^{}=q_2`$. Since by Lemma 7.2 $`\varphi (q_1^{})=\varphi (q_1)\tau `$ in $`H_{ka}^{}`$ if $``$ is a $`\tau `$-band, we have that $`\varphi (q_1^{})`$ is $`𝐊`$-reduced.

Suppose that $`p_1^{}`$ does not have $`𝐑`$-edges. Then $`p_2^{}`$ does not have $`𝐑`$-edges either (every maximal $`𝐑`$-band of $`\mathrm{\Delta }^{\prime \prime }`$ is a maximal $`𝐑`$-band of $`\mathrm{\Delta }`$), so the boundary of $`\mathrm{\Delta }^{\prime \prime }`$ contains no $`𝐑`$-edges. By Lemma 7.3 (4) $`\mathrm{\Delta }^{\prime \prime }`$ does not contain $`r`$-cells, hence $`\varphi (q_2)=\varphi (q_1^{})=\varphi (q_1)\tau `$ in $`H_{ka}^{}`$, hence $`\mathrm{\Delta }=T(\varphi (q_1),\tau )`$ as required.

Now if $`p_1^{}`$ contains $`𝐑`$-edges then $`p_2^{}`$ also contains $`𝐑`$-edges, so $`\mathrm{\Delta }^{\prime \prime }`$ satisfies conditions (TR1) and (TR2), so $`\mathrm{\Delta }^{\prime \prime }`$ is a trapezium. Since $`\mathrm{\Delta }^{\prime \prime }`$ contains fewer maximal $`𝐑`$-bands than $`\mathrm{\Delta }`$, by induction, we can assume that $`\mathrm{\Delta }^{\prime \prime }=T(\varphi (q_1^{}),h)`$ for some $`h`$. Then $`\mathrm{\Delta }=T(\varphi (q_1),\tau h)`$ as required ∎

## 8 The group $`H_{ra}`$

Consider the group $`H_{ra}`$ which is the group generated by $`𝐀𝐑`$ subject to the set of relations consisted of all $`a`$-relations and all (commutativity) $`ra`$-relations from $`Z(𝕊,a)`$. We consider $`𝐀`$-letters as zero-letters and $`𝐑`$-letters as non-zero letters. So in terminology of Section 3, in this section $`Y=𝐑`$.

We are going to prove that the presentation of $`H_{ra}`$ satisfies conditions (Z1), (Z2), (Z3) from Section 3

Locally, in this section, we are going to keep the same notation as in Section 3. We let $`_0=𝒮_0`$ be the set of $`a`$-relations and $`ra`$-relations. The set $`𝒮_{1/2}`$ is thus empty. Clearly conditions (Z1.1) and (Z1.2) hold.

Since $`𝒮_{1/2}`$ is empty, conditions (Z2.1), (Z2.2) and (Z2.3) also hold.

We will use the terminology and results from Section 3.1 and Section 3.2. In particular, we are going to talk about essential, reduced and cyclically reduced words in $`H_{ra}`$.

As in Section 3, for every cyclically reduced essential element $`gH_{ra}`$ we define $`\mathrm{𝟎}(g)=\mathrm{𝟎}(g)`$ as the maximal subgroup of $`H_a`$ which contains $`g`$ in its normalizer. For an arbitrary essential element $`g`$ of the form $`vuv^1`$ where $`u`$ is cyclically reduced, we define $`\mathrm{𝟎}(g)=v\mathrm{𝟎}(u)v^1`$. By Lemma 3.7, $`\mathrm{𝟎}(g)`$ is well defined (does not depend on the presentation $`g=vuv^1`$).

The following lemma will imply both (Z3.1) and (Z3.2).

###### Lemma 8.1.

Let $`g`$ be an essential element represented by a cyclically reduced word $`A`$, let $`x1`$ be a $`0`$-element such that $`g^4xg^4`$ is a $`0`$-element. Then the following two statements hold.

(i) There exists a $`0`$-element $`u`$ such that $`gu^1`$ commutes with every element of $`\mathrm{𝟎}(g)`$.

(ii) $`x\mathrm{𝟎}(g)`$.

###### Proof.

By Lemma 3.6, $`g^2xg^2`$ is $`0`$-element. Let $`B`$ be a word in $`𝐀`$ representing a non-trivial element $`x`$ from $`\mathrm{𝟎}(g)`$, $`C`$ be a word in $`𝐀`$ representing $`g^2xg^2`$.

Let $`Au_1r_1u_2\mathrm{}r_su_{s+1}`$ where $`r_i𝐑`$, $`i=1,\mathrm{},s`$, $`u_i`$ are words in $`𝐀`$, $`i=1,\mathrm{},s+1`$. By Lemma 3.7 (all of the conditions of that lemma hold), we can replace $`A`$ by any cyclic shift of $`A`$. So we can assume that $`u_1`$ is empty.

Then there exists a diagram $`\mathrm{\Delta }`$ of minimal type over the presentation $`𝒮_0`$ of $`H_{ra}`$ with boundary $`p_1q_1p_2^1q_2^1`$ where $`\varphi (q_1)\varphi (q_2)A^2`$, $`\varphi (p_1)B`$, $`\varphi (p_2)C`$.

Since $`A`$ is cyclically reduced and $`p_1,p_2`$ do not contain $`𝐑`$-edges, every maximal $`𝐑`$-band in $`\mathrm{\Delta }`$ starting on $`q_1`$ ends on $`q_2`$ and every maximal $`𝐑`$-band starting on $`q_2`$ ends on $`q_1`$. By Lemma 7.3 (3), $`\mathrm{\Delta }`$ contains no other maximal $`𝐑`$-bands.

Let $`𝒯_1,\mathrm{},𝒯_{2s}`$ be all maximal $`𝐑`$-bands starting on $`q_1`$, counted from $`p_1`$ to $`p_2`$. Notice that every $`ra`$-relation is a commutativity relation of the form $`ra=ar`$ where $`r𝐑(z),aA(z)`$ for some $`z\overline{𝐊}`$. For every $`i=1,\mathrm{},2s`$, $`r_i`$ belongs to $`𝐑(z_i)`$ for some $`z_i\overline{𝐊}`$. Then the labels of the top and the bottom paths of $`𝒯_i`$ are equal to a word $`v_i`$ in the alphabet $`A(z_i)A(z_i)^1`$. Notice that $`B`$ is conjugate of each of the words $`v_i`$, $`i=1,\mathrm{},2s`$ in $`H_{ra}`$. Indeed, the subdiagram of $`\mathrm{\Delta }`$ bounded by $`p_1,q_1,q_2`$ and the connecting line of $`𝒯_i`$ has boundary label $`t^1Btv_i^1`$ for some word $`t`$. Since $`B1`$ modulo in $`H_{ra}`$, none of the words $`v_i`$ is equal to 1 modulo in $`H_{ra}`$.

The connecting lines of the bands $`𝒯_1,\mathrm{},𝒯_{2s}`$ divide $`\mathrm{\Delta }`$ into diagrams $`\mathrm{\Delta }_0`$,…,$`\mathrm{\Delta }_{2s+1}`$ such that the boundary of each $`\mathrm{\Delta }_i`$ contains no $`𝐑`$-edges. By Lemma 7.3 (4), each $`\mathrm{\Delta }_i`$ has no $`r`$-cells, so the boundary label of each $`\mathrm{\Delta }_i`$ is equal to 1 in the group $`H_a`$.

Since $`A`$ starts with $`r_1`$, the subdiagram $`\mathrm{\Delta }_0`$ is bounded by a side of $`𝒯_1`$ and $`p_1`$. Hence $`B=\varphi (p_1)=v_1`$ modulo $`a`$-relations.

The boundary label of $`\mathrm{\Delta }_1`$ is $`u_2^1v_1u_2v_2^1`$. Hence $`u_2^1v_1u_2=v_2`$ in $`H_a`$. Recall that $`H_a`$ is the free product of subgroups $`A(z)`$ in the variety of Burnside groups of exponent $`n`$. By Lemma 36.2, 34.11 from , each of these subgroups is malnormal in $`H_a`$. Therefore $`v_2,u_2A(z_1)`$ modulo $`a`$-relations. Since $`u_2,v_21`$, $`z_1z_2`$. Now considering subdiagrams $`\mathrm{\Delta }_2,\mathrm{},\mathrm{\Delta }_{s+1}`$ one by one, we conclude that $`u_i,v_i`$ are words in $`A(z_1)`$, $`i=1,\mathrm{},s+1`$, and $`z_1=z_2=\mathrm{}=z_s`$. Therefore all $`r_i`$ belong to $`𝐑(z_1)`$. Since $`v_i`$ are not empty, $`r_i`$ commutes with some letters from $`A(z_i)`$. By definition of $`Z(𝕊)`$ then $`r_i`$ commutes with every letter from $`A(z_1)`$ in $`H_{ra}`$. Hence $`r_1,\mathrm{},r_s`$ commute with all letters from $`u_1,\mathrm{},u_{s+1}`$. In particular, $`A=r_1r_2\mathrm{}r_su_1\mathrm{}u_{s+1}`$ in $`H_{ra}`$.

Let $`u=u_1\mathrm{}u_s`$. This word does not contain letters from $`𝐑`$. Notice that $`H_a`$ is a retract of $`H_{ra}`$, $`u`$ is the $`H_a`$-projection of $`g`$, so $`u`$ does not depend in $`H_{ra}`$ on the word $`A`$ representing $`g`$. Let also $`g_1=r_1\mathrm{}r_s`$. Since $`𝐑`$ is a retract of $`H_{ra}`$, $`g_1`$ does not depend on the word $`A`$ representing $`g`$, $`gu^1=g_1`$.

We have proved that $`B`$ is equal modulo $`a`$-relations to a word in $`A(z_1)`$. So $`g_1`$ commutes with $`B=x`$. Since $`\mathrm{𝟎}(g)`$ is a $`0`$-subgroup normalized by $`g`$, it consists of $`0`$-elements $`y`$ such that $`g^2yg^2`$ is a $`0`$-element. We have proved that $`g_1`$ commutes with every such $`y`$. Hence $`gu^1`$ commutes with all elements in $`\mathrm{𝟎}(g)`$ which proves (i).

Notice that the subgroup $`A(z_1)`$ is normalized by $`g=g_1u`$ because $`g_1`$ commutes with this subgroup and $`u`$ belongs to it. Hence $`A(z_1)\mathrm{𝟎}(g)`$. Since $`xA(z_1)`$, $`x\mathrm{𝟎}(g)`$, which proves (ii). ∎

We have checked all properties (Z1), (Z2), (Z3), so by Proposition 3.19, we have the following statement.

###### Proposition 8.2.

There exists a graded presentation $`_{ra}`$ of the factor group $`H_{ra}(\mathrm{})`$ of $`H_{ra}`$ over the subgroup generated by all $`n`$-th powers of elements of $`H_{ra}`$, such that every g-reduced diagram over $`_{ra}`$ satisfies property A from section 2.4, and all the lemmas from Section 3 hold.

As a corollary of Proposition 8.2, we have the following statements which we are going to use later.

###### Lemma 8.3.

Let $`\mathrm{\Delta }`$ be a g-reduced diagram over $`_{ra}`$, $`(\mathrm{\Delta })=p_1q_1s^1q_2^1`$, obtained by gluing two diagrams $`\mathrm{\Gamma }`$ and $`\mathrm{\Pi }`$ where

(i) $`(\mathrm{\Gamma })=p_1q_1p_2^1q_2^1`$, $`\varphi (p_1)`$ is a subword of $`R(h,z)`$ for some reduced word $`h`$ over $`𝕊`$ and some $`z𝐊𝐊^1`$, $`p_1`$ starts and ends with $`𝐑`$-edges; $`q_1`$ and $`q_2`$ do not contain $`𝐑`$-edges; $`\mathrm{\Gamma }`$ is a diagram of rank $`0`$ (that is over $`Z(𝕊,a)`$);

(ii) $`\mathrm{\Pi }`$ is a cell of corresponding to a relation $`v^n=1`$ in $`_{ra}`$ of rank $`1`$, $`(\mathrm{\Pi })=p_2s^1`$;

(iii) $`v`$ starts with an $`𝐑`$-letter $`r`$, $`\varphi (p_2)v^lr`$ where $`l>1/2\epsilon n`$.

Then there exists a diagram $`\mathrm{\Delta }^{}`$ over $`_{ra}`$ which has the same boundary label as $`\mathrm{\Delta }`$, $`(\mathrm{\Delta }^{})=p_1^{}q_1^{}(s^{})^1(q_2^{})^1`$ where $`\varphi (p_1^{})\varphi (p_1),\varphi (q_1^{})\varphi (q_1)`$, $`\varphi (s^{})\varphi (s),\varphi (q_2^{})\varphi (q_2)`$, and

(1) $`\mathrm{\Delta }^{}`$ contains a subdiagram $`\mathrm{\Pi }^{}`$ where $`\varphi ((\mathrm{\Pi }^{}))u^n`$ where $`u`$ is a cyclically $`𝐑`$-reduced word,

(2) $`|(\mathrm{\Pi }^{})p_1^{}|>6|u|`$,

(3) $`\mathrm{\Delta }^{}\backslash \mathrm{\Pi }^{}`$ is of rank 0.

###### Proof.

Consider the $`𝐑`$-bands in $`\mathrm{\Gamma }`$ starting on $`p_2`$. Since $`v`$ is a period, it is cyclically $`𝐑`$-reduced (by Proposition 8.2 and the definition of periods from Section 3. Since $`q_1`$ and $`q_2`$ are of $`𝐑`$-length 0, every $`𝐑`$-band starting on $`p_2`$ ends on $`p_1`$. Since $`\varphi (p_1)`$ is a subword of an $`𝐑`$\- reduced word $`R(h,z)`$, every $`𝐑`$-bands starting on $`p_1`$ ends on $`p_2`$. Hence the $`𝐑`$-projections of words $`\varphi (p_1)`$ and $`\varphi (p_2)`$ are identical (the labels of $`𝐑`$-edges in all cells of a $`𝐑`$-band are the same).

Therefore $`\varphi (p_1)u^lr`$ where $`|u|_𝐑=|v|_𝐑`$, $`u`$ starts with $`r`$. Since $`u`$ and $`u^2`$ are subwords of an $`𝐑`$-reduced word $`R(h,z)`$ (since $`l\epsilon n>2`$), $`u`$ is cyclically $`𝐑`$-reduced. In particular, $`u`$ is an essential word.

Let $`𝒯`$ and $`𝒯^{}`$ be the first and the last maximal $`𝐑`$-bands in $`\mathrm{\Gamma }`$ starting on $`p_1`$ (we count the $`𝐑`$-bands from $`(p_1)_{}`$ to $`(p_1)_+`$). Consider the subdiagram $`\mathrm{\Gamma }_1`$ of $`\mathrm{\Gamma }`$ bounded by the top side of $`𝒯`$, $`p_1`$, $`p_2`$ and the connecting line of $`𝒯^{}`$ (so this subdiagram is equal to $`\mathrm{\Gamma }`$ minus $`𝒯^{}`$). Since all cells in $`𝒯^{}`$ are commutativity cells, $`x_1=\varphi (\mathrm{𝐭𝐨𝐩}(𝒯^{}))=\varphi (\mathrm{𝐛𝐨𝐭}(𝒯^{}))`$. The subdiagram of $`\mathrm{\Gamma }`$ bounded by a side of $`𝒯^{}`$ and $`q_1`$ does not contain $`𝐑`$-bands, so $`\varphi (q_1)=x_1`$ modulo $`a`$-relations. Similarly $`\varphi (q_2)=x_2`$ modulo $`a`$-relations where $`x_2`$ is the word written in a side of $`𝒯`$. Clearly $`|x_1|_𝐑=|x_2|_𝐑=0`$.

Let $`\overline{p}_1`$ be the path $`p_1`$ without the last edge, $`\overline{p}_2`$ be $`p_2`$ without the last edge. Then $`\varphi (\overline{p}_1)u^l`$, $`\varphi (\overline{p}_2)v^l`$,

$$u^lx_1=x_2v^l$$
(23)
modulo $`a`$-relations and $`ra`$-relations.

Similarly every subword of the cyclic word $`u`$ is equal to a subword of the same $`𝐑`$-length of the cyclic word $`v`$ up to multiples of zero length. Hence $`v`$ is cyclically reduced by Lemma 3.3. Therefore $`v`$ is essential.

Suppose that $`u`$ is not simple in rank 0. By Lemma 3.25 there exists a word $`w`$ which is simple in rank 0 (and so $`w`$ is simple in rank $`1/2`$ because $`_{ra}`$ does not contain hubs), $`|w|_𝐑<|u|_𝐑`$, and a word $`t\mathrm{𝟎}(w)`$ such that $`u=xw^btx^1`$ in rank 0, for some word $`x`$ and some integer $`b0`$. Since $`u`$ is cyclically reduced, $`|x|_𝐑=0`$ and $`|w^b|_𝐑=|u|_𝐑`$.

Therefore by $`u^l=xw^{bl}t_1x^1`$ for some $`t_1\mathrm{𝟎}(w)`$ (since $`\mathrm{𝟎}(w)`$ is normalized by $`w`$). Using (23), we get

$$u^lx_1=xw^{bl}t_1x^1x_1=x_2v^l$$

in rank 0, where both $`w`$ and $`v`$ are simple in rank 0, the $`𝐑`$-lengths of $`x,x_1,t_1,x_2`$ are equal to 0 (for $`x,x_1,x_2`$ we have established it above, for $`t_1`$, this follows from the definition of $`\mathrm{𝟎}(w)`$ since $`w`$ is cyclically $`𝐑`$-reduced). Now we can apply Lemma 3.32 and conclude that $`v=yw^{\pm 1}t_2y^1`$ in rank 0 for some word $`y`$ and some $`t_2\mathrm{𝟎}(w)`$. This contradicts the fact that $`v`$ is simple in rank 0 (since $`|w|_𝐑<|u|_𝐑=|v|_𝐑`$).

Thus $`u`$ is simple in rank $`0`$ (and so it is simple in rank $`1/2`$). Then again by Lemma 3.32, we can conclude that

$$x_2v^{\pm 1}t_2x_2^1=u$$
(24)
in rank 0 for some $`t_2\mathrm{𝟎}(v)`$. Suppose that the exponent of $`v`$ in (24) $`1`$, that is $`x_2v^1t_2x_2^1=u`$. Therefore

$$u^l=x_2(v^1t_2)^lx_2^1=x_2v^lt^{}x_2^1$$

for some $`t^{}\mathrm{𝟎}(v)`$ (since $`\mathrm{𝟎}(v)`$ is normalized by $`v`$). By (23),

$$x_2^1u^l=v^lx_1^1=v^lt^{}x_2^1$$

whence

$$v^{2l}=t^{}x_2^1x_1.$$

Since $`t^{}`$ is of $`𝐑`$-length 0 (this follows from the definition of $`\mathrm{𝟎}(v)`$ since $`v`$ is cyclically $`𝐑`$-reduced), $`x_1`$ and $`x_2`$ are also of $`𝐑`$-length $`0`$, we have that $`v^{2l}`$ is of $`𝐑`$-length 0 which contradicts the fact that $`v`$ is cyclically $`𝐑`$-reduced. This contradiction shows that in fact the exponent of $`v`$ in (24) is 1.

By Lemma 3.12, $`(vt_2)^n=v^n`$ in rank 0. Hence $`u^n=x_2v^nx_2^1`$ in rank 0.

Recall that $`\varphi (\overline{p}_1)u^l`$. Let $`\overline{\mathrm{\Delta }}`$ be a diagram with contour $`\overline{p}_1(p_1^{})^1`$ where $`\varphi (p_1^{})u^l`$, which is a result of gluing two mirror copies $`\mathrm{\Pi }^{}`$ and $`\overline{\mathrm{\Pi }}`$ with boundary labels $`u^{\pm n}`$ over $`_{ra}`$ where $`p_1^{}`$ is a part of the boundary of $`\mathrm{\Pi }^{}`$, $`\overline{p}_1`$ is a part of the boundary of $`\mathrm{\Pi }`$. Consider the union of $`\mathrm{\Delta }`$ and $`\overline{\mathrm{\Delta }}`$. Notice that $`|p_1^{}|l|u|\frac{1}{2}\epsilon n|u|>6|u|`$. It remains to observe that in the union of $`\mathrm{\Delta }`$ and $`\overline{\mathrm{\Delta }}`$, the $`\overline{\mathrm{\Pi }}`$ is connected with $`\mathrm{\Pi }`$ by a path with label $`x_2`$, hence this pair of subdiagrams and the connecting path can be replaced by a diagram of rank 0 corresponding to the equality $`u^n=x_2v^nx_2^1`$. The lemma is proved. ∎

## 9 The group $`H_{kra}`$

Recall that in Section 7 we considered the set of defining relations $`Z(𝕊,a)`$ which is the union of the set of all $`a`$-relations and the set $`Z(𝕊)`$ of relations corresponding to the $`S`$-machine $`𝕊`$.

Now consider the union $`Z(𝕊,\mathrm{\Lambda },ra)=Z(𝕊,a)\{\mathrm{\Lambda }(0)\}_{ra}`$ and the group $`H_{kra}`$ generated by $`𝐊𝐑𝐀`$ subject to the relations from $`Z(𝕊,\mathrm{\Lambda },ra)`$. Each relation of $`Z(𝕊,\mathrm{\Lambda },ra)`$ is either the hub, an $`a`$-relation, a (commutativity) $`ra`$-relation, or a $`\kappa `$-relation or belongs to $`_{ra}`$. Burnside relations from $`_{ra}`$ will be called Burnside $`ra`$-relations. The corresponding cells in diagrams will be called Burnside $`ra`$-cells. The set of all relations from $`Z(𝕊,\mathrm{\Lambda },ra)`$ except the hub will be denoted by $`Z(𝕊,ra)`$.

As in Section 3, we divide the set of generators of $`H_{kra}`$ into the set of $`0`$-letters and the set of non-$`0`$-letters.

Our main goal is to prove that the presentation $`Z(𝕊,\mathrm{\Lambda },ra)`$ satisfies properties (Z1), (Z2), (Z3) if we consider $`𝐊`$ as the set of non-zero letters and the $`𝐑𝐀`$ as the set of $`0`$-letters.

But at first we show how to get rid of Burnside $`ra`$-cells in diagrams over $`Z(𝕊,ra)`$.

As in Section 7, we can consider $`𝐊`$\- and $`𝐑`$–bands in diagrams over $`Z(𝕊,ra)`$. The definition of these bands is the same as in Section 7 (Burnside cells do not belong to $`𝐑`$-bands). The only difference is that now $`𝐑`$-bands can start and end on Burnside $`ra`$-cells.

### 9.1 Getting rid of Burnside $`ra`$-cells

Consider (temporarily) $`𝐑`$ as the set of non-$`0`$-letters and all other letters as $`0`$-letters. We can consider $`𝐑`$-bands connecting two Burnside $`ra`$-cells (a Burnside $`ra`$-cell and a part of the boundary of a diagram) as $`0`$-bonds, and define bonds and contiguity subdiagrams of all ranks. (We preserve the grading of the set of Burnside $`ra`$-relations $`_{ra}`$.)

Suppose that a disc van Kampen diagram $`\mathrm{\Delta }`$ is obtained by gluing together two disc diagrams $`\mathrm{\Theta }`$ and $`\mathrm{\Pi }`$ over $`Z(𝕊,ra)`$ along pieces of their boundaries, where

(1) $`\mathrm{\Theta }`$ is a trapezium $`T(W,h)`$ with contour $`p_1q_1p_2^1q_2^1`$ ($`q_1,q_2`$ are the bottom and the top bases);

(2) $`\varphi (\mathrm{\Pi })u^n`$ for some cyclically $`𝐑`$-reduced word $`u`$ over $`𝐑𝐀`$, the diagram $`\mathrm{\Pi }`$ does not contain $`𝐊`$-edges;

(3) $`\mathrm{\Pi }`$ and $`\mathrm{\Theta }`$ are glued along a subpath $`p`$ of $`p_2`$; $`|p|3|u|`$.

Then we shall say that $`\mathrm{\Delta }`$ has the form $`\mathrm{\Theta }\mathrm{\Pi }`$.

Suppose that a disc van Kampen diagram $`\mathrm{\Delta }`$ is obtained by gluing together two diagrams $`\mathrm{\Pi }`$ and $`\mathrm{\Theta }`$ where

(1) $`\mathrm{\Theta }`$ is a trapezium $`T(W,h)`$ with contour $`p_1q_1p_2^1q_2^1`$ ($`q_1,q_2`$ are the bases);

(2) $`\varphi (\mathrm{\Pi })u^n`$ for some cyclically $`𝐑`$-reduced word $`u`$ over $`𝐑𝐀`$ containing $`𝐑`$-letters; $`\mathrm{\Pi }`$ does not contain $`𝐊`$-edges;

(3) $`\mathrm{\Pi }`$ and $`\mathrm{\Theta }`$ are glued along a subpath $`p`$ of $`p_1`$.

Then we shall say that $`\mathrm{\Delta }`$ has the form $`\mathrm{\Pi }\mathrm{\Theta }`$. It is easy to see that

$$T(W,h)\mathrm{\Pi }=\mathrm{\Pi }T(Wh,h^1)$$

(this means that if the right hand side of the equality exists then both sides exist and are equal).

###### Lemma 9.1.

For every van Kampen disc diagram $`\mathrm{\Delta }`$ of the form $`\mathrm{\Theta }\mathrm{\Pi }`$ there exists a van Kampen disc diagram $`\mathrm{\Delta }^{}`$ of the form $`\mathrm{\Pi }^{}\mathrm{\Theta }^{}`$ with the same boundary label and such that:

(i) the label of the bottom (top) base of $`\mathrm{\Theta }`$ is equal to the label of the bottom (top) base of $`\mathrm{\Theta }^{}`$;

(ii) The histories of the trapezia $`\mathrm{\Theta }`$ and $`\mathrm{\Theta }^{}`$ are equal modulo Burnside relations (see Figure 15).

Fig. 15.

###### Proof.

Let $`\mathrm{\Theta }=T(W,h)`$. Then $`\varphi (p_2)R(h,z)^1`$ where $`z𝐊𝐊^1`$ is the last letter of $`W`$. Let $`p`$ be the common subpath of the contour of $`\mathrm{\Pi }`$ and the right side of the trapezium $`\mathrm{\Theta }`$, $`\varphi ((\mathrm{\Pi }))u^n`$ for a cyclically $`𝐑`$-reduced word $`u`$. Then $`\varphi (p)R(h,z)^1`$ contains a cube of a cyclic shift of $`u`$ as a subword. Without loss of generality we can assume that this cyclic shift is $`u`$ itself. The word $`R(h,z)^1`$ is a product of blocks of the form $`R(\tau ,z)`$, $`\tau 𝕊`$, each of which is either a one-letter word $`r𝐑𝐑^1`$ or a two-letter word $`(ra)^{\pm 1}`$ where $`r𝐑`$, $`a𝐀𝐀^1`$. Every block is completely determined by its $`𝐑`$-letter. Consider the occurrence of $`u^3`$ in $`R(h,z)^1`$.

The word $`u^3`$ contains subword $`v^2`$ where $`v`$ is a cyclic shift of $`u`$ and the first occurrence of $`v`$ (in $`v^2`$) starts with the beginning of a block. Suppose that $`v`$ does not end with the end of a block. Then the second occurrence of $`v`$ in $`v^2`$ starts in the middle of a block, so the first letter of $`v`$ is both a beginning of a block and an end of a block. Therefore this letter belongs to $`𝐀^{\pm 1}`$. Hence $`var_1v^{}r_2`$ where $`a𝐀𝐀^1`$, $`r_1𝐑^1`$, $`r_2𝐑`$, $`ar_1`$ and $`r_2a`$ are blocks. But then the second letter of the second occurrence of $`v`$ must be $`r_1`$, and it must be the beginning of a block. Thus the same $`𝐑`$-letter $`r_1`$ is a beginning and the end of a block. This contradicts the fact that every block is completely determined by its $`𝐑`$-letter.

Hence $`v`$ starts with a beginning of a block and ends with the end of a block. Therefore $`vR(h_1,z)`$ for some cyclically reduced word $`h_1`$ over $`𝕊`$. Thus $`h_1^2`$ is a subword of $`h`$. Let $`hh^{}h_1^2h^{\prime \prime }`$ for some words $`h^{},h^{\prime \prime }`$. Then $`Wh^{}`$ is in the domain of $`h_1^2`$. By Lemma 6.5(iv), then $`Wh^{}`$ is in the domain of $`h_1^s`$ for every integer $`s`$. In particular, $`Wh^{}`$ is in the domain of $`h_1^{2n}`$. By Lemma 6.5(ii),

$$Wh=Wh^{}h_1^2h^{}=Wh^{}h_1^{2n}h^{\prime \prime }.$$

Since $`vR(h_1,z)`$ is a cyclic shift of $`u`$, one can read $`v^n`$ on the boundary of $`\mathrm{\Pi }`$, and the boundary label of $`\mathrm{\Theta }\mathrm{\Pi }`$ is freely equal as a cyclic word to

$$\begin{array}{c}WR(h^{\prime \prime },z)^1v^{n2}R(h^{},z)^1(Wh)^1L(h,z^{})=\hfill \\ WR(h^{\prime \prime },z)^1R(h_1^{2n},z)^1R(h^{},z)^1(Wh)^1L(h,z^{})=\hfill \\ WR(h^{}h_1^{2n}h^{\prime \prime },z)^1(Wh)^1L(h^{}h_1^2h^{\prime \prime },z^{})\hfill \end{array}$$
(25)
where $`z^{}`$ is the first letter of $`W`$.

Consider now the trapezium $`\mathrm{\Theta }^{}=T(W,h^{}h_1^{2n}h^{\prime \prime })`$ which exists by Lemma 7.5(i) since $`W`$ is in the domain of $`h^{}h_1^{2n}h^{\prime \prime }`$. Since $`Wh^{}h_1^{2n}h^{\prime \prime }=Wh`$, we can assume that the top base label of $`\mathrm{\Theta }^{}`$ is the same as the top base label of $`\mathrm{\Theta }`$, that is $`Wh`$.

The boundary label of $`\mathrm{\Theta }^{}`$ is thus freely equal (as a cyclic word) to

$$WR(h^{}h_1^{2n}h^{\prime \prime },z)^1(Wh)^1L(h^{}h_1^{2n}h^{\prime \prime },z^{}).$$

Notice that by Proposition 8.2 there exists a van Kampen disc diagram $`\mathrm{\Pi }^{}`$ containing only $`a`$-cells, $`ra`$-cells and Burnside $`ra`$-cells, that has boundary label $`L(h_1,z^{})^n`$. We can glue $`\mathrm{\Pi }^{}`$ and $`\mathrm{\Theta }^{}`$ along the path labeled by $`L(h_1,z^{})^{2n}`$, we get a diagram $`\mathrm{\Delta }^{}`$ of the form $`\mathrm{\Pi }^{}\mathrm{\Theta }^{}`$. The boundary label of this diagram will be freely equal to

$$WR(h^{}h_1^{2n}h^{\prime \prime },z)^1(Wh)^1L(h^{}h_1^2h^{\prime \prime },z^{}).$$

Comparing this with (25) we conclude that the boundaries of $`\mathrm{\Delta }`$ and $`\mathrm{\Delta }^{}`$ are freely equal. The labels of the bottom (top) bases of $`\mathrm{\Theta }`$ and $`\mathrm{\Theta }^{}`$ are equal by construction, the history $`hh^{}h_1^2h^{\prime \prime }`$ of $`\mathrm{\Theta }`$ is equal to the history $`h^{}h^{2n}h^{\prime \prime }`$ of $`\mathrm{\Theta }^{}`$ modulo Burnside relations, as required. ∎

Lemma 9.1 allows us to move subdiagrams with boundary labels of the form $`u^n`$ from one side of a trapezium to another side, preserving the history of the trapezium modulo Burnside relations. The next lemma is the first application of this trick.

###### Lemma 9.2.

For every disc diagram $`\mathrm{\Delta }`$ over $`Z(𝕊,ra)`$ there exists another disc diagram $`\mathrm{\Delta }^{}`$ with the same boundary label and without $`𝐊`$-annuli.

###### Proof.

We can assume that $`\mathrm{\Delta }`$ contains exactly one $`𝐊`$-annulus $``$ and $`(\mathrm{\Delta })`$ is equal to $`t=\mathrm{𝐭𝐨𝐩}()`$. Then the subdiagram $`\mathrm{\Delta }^{}`$ bounded by $`\mathrm{𝐛𝐨𝐭}()`$ is a diagram over $`_{ra}`$. We can assume that this subdiagram is $`g`$-reduced, and that the $`𝐊`$-annulus $``$ is reduced.

By Proposition 8.2 $`\mathrm{\Delta }^{}`$ is an $`A`$-map. Suppose that $`\mathrm{\Delta }^{}`$ contains a Burnside $`ra`$-cell. By Lemma 2.6 there exists a Burnside $`ra`$-cell $`\mathrm{\Pi }`$ in $`\mathrm{\Delta }^{}`$ and its contiguity subdiagram $`\mathrm{\Gamma }`$ to $`\mathrm{𝐛𝐨𝐭}()`$ with contiguity degree at least $`\epsilon `$. By Lemma 8.3, we can replace $`\mathrm{\Pi }\mathrm{\Gamma }`$ by a new subdiagram $`\mathrm{\Psi }`$ with the same boundary label which contains a subdiagram $`\mathrm{\Pi }^{}`$ such that $`\varphi ((\mathrm{\Pi }^{}))u^n`$ for some word $`u`$ and $`|(\mathrm{\Pi }^{})\mathrm{𝐛𝐨𝐭}()|>6|u|`$, $`\mathrm{\Psi }\backslash \mathrm{\Pi }^{}`$ is a diagram of rank 0. Now using Lemma 9.1, we can move $`\mathrm{\Pi }^{}`$ through $``$ without producing new $`𝐊`$-annuli.

After a number of such transformations we replace $`\mathrm{\Delta }`$ by a new disc diagram $`\overline{\mathrm{\Delta }}`$ with the same boundary label containing exactly one $`𝐊`$-annulus which bounds a subdiagram without Burnside $`ra`$-cells. By Lemma 7.3, part 1, applied to the subdiagram bounded by that $`𝐊`$-band, we can replace that subdiagram by a subdiagram without $`𝐊`$-edges. Since this operation reduces the number of $`𝐊`$-annuli, the statement of the lemma follows. ∎

Let $`\mathrm{\Delta }`$ be an annular diagram over $`Z(𝕊,ra)`$ with inner contour $`p_1`$ and outer contour $`p_2`$, and let $`q`$ be a path in $`\mathrm{\Delta }`$. Suppose that $`\mathrm{\Delta },q`$ satisfy the following conditions:

(T1) $`p_1`$ and $`p_2`$ are sides of $`𝐊`$-annuli $`𝒯_1`$ and $`𝒯_2`$ respectively; $`\varphi (p_1)1`$ modulo $`Z(𝕊,ra)`$;

(T2) $`q`$ connects $`(p_1)_{}=(p_1)_+`$ with $`(p_2)_{}=(p_2)_+`$; the first and the last edges of $`q`$, $`e_1,e_2`$, are $`𝐊`$-edges;

(T3) Every maximal $`𝐊`$-band in $`\mathrm{\Delta }`$ is an annulus surrounding the hole of $`\mathrm{\Delta }`$.

Maximal $`𝐊`$-bands in $`\mathrm{\Delta }`$ divide $`\mathrm{\Delta }`$ into annular subdiagrams (without $`\kappa `$-cells) which will be called chambers. We count the chambers of $`\mathrm{\Delta }`$ from $`p_1`$ to $`p_2`$.

###### Lemma 9.3.

Suppose that all chambers of $`\mathrm{\Delta }`$ except the last one, $`\overline{\mathrm{\Delta }}`$, do not contain Burnside $`ra`$-cells and $`\varphi (q)`$ is $`𝐊`$-reduced.

Then there exists another annular diagram $`\mathrm{\Delta }^{}`$ over $`Z(𝕊,a)`$ (that is without Burnside $`ra`$-cells) with contours $`p_1^{}`$ and $`p_2^{}`$, and a path $`q^{}`$ in $`\mathrm{\Delta }^{}`$ satisfying the conditions (T1),(T2), (T3) such that $`\varphi (p_1^{})=\varphi (p_1)`$, $`\varphi (p_2^{})=\varphi (p_2)`$ modulo Burnside relations, $`\varphi (q^{})=\varphi (q)`$ modulo $`Z(𝕊,ra)`$, $`\varphi (q^{})`$ is $`𝐊`$-reduced.

###### Proof.

Among all pairs $`(\mathrm{\Delta },q)`$ satisfying the conditions of the lemma and having the same boundary labels of contours $`p_1,p_2`$ modulo Burnside relations and the same labels of $`q`$ modulo $`Z(𝕊,ra)`$ let us choose a pair where $`\mathrm{\Delta }`$ has the smallest possible number of chambers and the last chamber $`\overline{\mathrm{\Delta }}`$ has the smallest type in the sense of Section 3.

First of all let us reduce all chambers of $`\mathrm{\Delta }`$. We can get rid of $`j`$-pairs of Burnside $`ra`$-cells by first replacing the path $`q`$ by a path avoiding the $`j`$-pair and its connecting path and then reducing the $`j`$-pair. Similarly, if $`\mathrm{\Delta }`$ contains a disc subdiagram $`\mathrm{\Psi }`$ over $`Z(𝕊,a)`$ containing $`r`$-cells, whose boundary label is a word over $`𝐀`$ and is equal to 1 modulo $`a`$-relations, then we can replace this subdiagram by a subdiagram with the same boundary label containing no $`r`$-cells. The resulting diagram will satisfy conditions (T1), (T2), (T3). These operations will not increase the number of chambers in $`\mathrm{\Delta }`$ or the type of $`\overline{\mathrm{\Delta }}`$ or the $`𝐊`$-length of $`\varphi (q)`$. Thus we can assume that $`\mathrm{\Delta }`$ does not contain disc subdiagrams whose boundary labels are words over $`𝐀`$ equal 1 modulo $`a`$-relations. In particular, all chambers except for the last one are $`Z(𝕊,a)`$-reduced in the sense of Section 7.2.

We can also reduce all $`𝐊`$-annuli in $`\mathrm{\Delta }`$ and also the bands $`𝒯_1`$ and $`𝒯_2`$ without changing the $`𝐊`$-length of $`q`$. Notice that we do not assume that $`𝒯_1`$ and $`𝒯_2`$ are cyclically reduced because it may be impossible to reduce the annuli $`𝒯_1`$ and $`𝒯_2`$ without changing $`q`$.

Hence we can assume that $`\overline{\mathrm{\Delta }}`$ is g-reduced in the sense of Section 3 as a diagram over $`Z(𝕊,ra)`$ and $`\mathrm{\Delta }\backslash (\overline{\mathrm{\Delta }}𝒯_2𝒯_1)`$ which is a diagram over $`Z(𝕊,a)`$ is $`Z(𝕊,a)`$-reduced.

Since $`\varphi (q)`$ is $`𝐊`$-reduced in $`H_{kra}`$, $`q`$ intersects every $`𝐊`$-annulus in $`\mathrm{\Delta }`$ only once. Therefore the $`𝐊`$-length of $`q`$ is equal to the number of $`𝐊`$-annuli in $`\mathrm{\Delta }`$.

Let $``$ be a maximal $`𝐑`$-band connecting the contours of $`\mathrm{\Delta }^{\prime \prime }=\mathrm{\Delta }\backslash (\overline{\mathrm{\Delta }}𝒯_2)`$. Such a band exists because if every $`𝐑`$-band starting on the boundary of $`𝒯_1`$ ends on the boundary of $`𝒯_1`$ then the label of a side of $`𝒯_1`$ is equal to 1 modulo $`Z(𝕊,ra)`$, a contradiction with (T1).

Since the label of a side of $``$ is equal to the label of the portion of $`q`$ in that subdiagram multiplied by words of $`𝐊`$-length 0 (read along the boundaries of the subdiagram), the label of any side of $``$ is $`𝐊`$-reduced.

By Proposition 8.2, chamber $`\overline{\mathrm{\Delta }}`$ is an $`A`$-map. Let $`o=(e_2)_{}`$. Let $`s`$ be the inner contour of $`\overline{\mathrm{\Delta }}`$, and let $`t`$ be the outer contour of $`\overline{\mathrm{\Delta }}`$. We consider $`o`$ as the beginning and the end of $`t`$.

Suppose that $`\overline{\mathrm{\Delta }}`$ contains Burnside $`ra`$-cells. Then by Lemma 2.5, part c), there exists a Burnside $`ra`$-cell $`\mathrm{\Pi }`$ in $`\overline{\mathrm{\Delta }}`$ and its contiguity subdiagram $`\mathrm{\Gamma }`$ of rank 0 to one of the contours $`s`$ or $`t`$ of contiguity degree $`\epsilon `$.

Replacing $`\mathrm{\Gamma }`$ (if necessary) by a smaller contiguity diagram, we can assume that conditions (i)-(iv) of Lemma 8.3 hold. By this lemma, we can replace $`\mathrm{\Gamma }\mathrm{\Pi }`$ by a subdiagram $`\mathrm{\Psi }`$ with the same boundary label, which has a subdiagram $`\mathrm{\Pi }^{}`$ such that $`(\mathrm{\Pi }^{})u^n`$ where $`u`$ is a cyclically $`𝐑`$-reduced word and $`|(\mathrm{\Pi }^{})s|>6|u|`$ or $`|(\mathrm{\Pi }^{})t|>6|u|`$ and $`\mathrm{\Psi }\backslash \mathrm{\Pi }^{}`$ has rank 0.

Suppose first that $`|(\mathrm{\Pi }^{})t|>6|u|`$. By Lemma 9.1 we can move $`\mathrm{\Pi }^{}`$ through $`𝒯_2`$ replacing $`𝒯_2`$ by a $`𝐊`$-band with a history which is equal to the history of $`𝒯_2`$ modulo Burnside relations. The path $`q`$ can be replaced in the new annular diagram by a path with the same label modulo $`Z(𝕊,ra)`$. This operation decreases the type of the last chamber of $`\mathrm{\Delta }`$.

Suppose now that $`|(\mathrm{\Pi }^{})s|>6|u|`$. Let $`x=(\mathrm{\Pi }^{})s`$. Consider the annular subdiagram $`\mathrm{\Delta }^{\prime \prime }`$ bounded by $`s`$ and $`p_1`$. The diagram $`\mathrm{\Delta }^{\prime \prime }`$ is a $`Z(𝕊,a)`$-reduced diagram. By Lemma 7.3 every maximal $`𝐑`$-band starting on $`x`$ must end on $`p_1`$. Indeed otherwise the $`𝐑`$-band would have two intersections with a reduced $`𝐊`$-band in a disc subdiagram of $`\mathrm{\Delta }^{\prime \prime }`$ which contradicts Lemma 7.3, part 2. Since such an $`𝐑`$-band cannot intersect twice a $`𝐊`$-annulus, and $`\varphi (q)`$ is a $`𝐊`$-reduced word, the label of a side of any of these $`𝐑`$-bands is a $`𝐊`$-reduced word. There exists a disc subdiagram $`\mathrm{\Theta }`$ of $`\mathrm{\Delta }^{\prime \prime }`$ containing at least half of these $`𝐑`$-bands, bounded by a subpath $`y`$ of $`x`$, a subpath of $`p_1`$ and by two $`r`$-bands. Now $`\mathrm{\Theta }`$ is a trapezium because it satisfies conditions (TR1) and (TR2). By Lemma 7.5, $`\mathrm{\Theta }`$ is a normal trapezium. The union of $`\mathrm{\Theta }`$ and $`\mathrm{\Pi }^{}`$ is, by definition, equal to $`\mathrm{\Theta }\mathrm{\Pi }^{}`$. As before we can move $`\mathrm{\Pi }^{}`$ through $`\mathrm{\Theta }`$ replacing $`\mathrm{\Theta }`$ by a trapezium with the same history modulo Burnside relations. Again we decrease the type of $`\mathrm{\Delta }`$.

The new diagram satisfies conditions (T1), (T2), (T3) and has a smaller type than $`\mathrm{\Delta }`$.

Thus we can complete the proof by induction on the type of $`\mathrm{\Delta }`$. ∎

Lemma 9.3 implies the following stronger statement.

###### Lemma 9.4.

The conclusion of Lemma 9.3 holds if one removes the restriction that only the last chamber contains Burnside $`ra`$-cells.

###### Proof.

Since $`\varphi (q)`$ is reduced, we can assume that it crosses the connecting line of every $`𝐊`$-annulus only once.

Let us use induction on the number of chambers in $`\mathrm{\Delta }`$. If the number of chambers is 1, we can apply Lemma 9.3. Consider the diagram $`\mathrm{\Delta }_1=\mathrm{\Delta }\backslash (\overline{\mathrm{\Delta }}𝒯_2)`$ where $`\overline{\mathrm{\Delta }}`$ is the last chamber. Let $`q_1`$ be the part of $`q`$ in $`\mathrm{\Delta }_1`$. The number of chambers in $`\mathrm{\Delta }_1`$ is smaller than the number of chambers in $`\mathrm{\Delta }`$. Therefore we can apply the induction hypothesis and conclude that there exists a diagram $`\mathrm{\Delta }_2`$ and a path $`q_2`$ which satisfy the conclusion of Lemma 9.3.

Since the label of the outer contour of $`\mathrm{\Delta }_2`$ is equal to the label of the outer contour of $`\mathrm{\Delta }_1`$ modulo Burnside relations, we can glue to the outer contour of $`\mathrm{\Delta }_2`$ a diagram over $`_{ra}`$ such that the resulting diagram $`\mathrm{\Delta }_3`$ has the same outer boundary label as $`\mathrm{\Delta }_1`$.

Now replace the subdiagram $`\mathrm{\Delta }_1`$ in $`\mathrm{\Delta }`$ by $`\mathrm{\Delta }_3`$ and the subpath $`q_1`$ of $`q`$ by $`q_2`$. Let $`(\mathrm{\Delta }_4,q_4)`$ be the resulting pair of an annular diagram and a cutting path. Reducing if necessary, the last $`𝐊`$-annulus of subdiagram $`\mathrm{\Delta }_3`$ of $`\mathrm{\Delta }_4`$, we obtain a pair $`(\mathrm{\Delta }_5,q_5)`$ satisfying conditions of Lemma 9.3. Applying that lemma, we complete the proof. ∎

The following lemma is an algebraic consequence of Lemma 9.4.

###### Lemma 9.5.

Let $`P_1,P_2`$ be words over $`𝐀𝐑`$ which are not equal to 1 modulo $`Z(𝕊,ra)`$. Let $`A^1P_1A=P_2`$ in $`H_{kra}`$ for some word $`A`$ which is $`𝐊`$-reduced in $`H_{kra}`$ and starts and ends with a letter $`z𝐊𝐊^1`$. Then $`A=R_1BR_2`$ in $`H_{kra}`$ where $`R_1=L(h_1,z)`$, $`R_2=R(h_2,z)`$, $`z`$ is in the domain of $`h_1,h_2^1`$, $`B`$ is a reduced admissible word starting and ending with $`z_1`$ such that $`R_1z_1=zR(h_1,z)`$, $`z_1R_2=L(h_2,z_1)z`$ modulo $`Z(𝕊,a)`$.

###### Proof.

Equality $`P_2=A^1P_1A`$ gives us an annular diagram $`\mathrm{\Delta }`$ with inner contour $`p_1`$ labeled by $`P_1`$, outer contour $`p_2`$ labeled by $`P_2`$ and a cutting path $`q`$ labeled by $`A`$.

The connecting line of any $`𝐊`$-annulus in $`\mathrm{\Delta }`$ not surrounding the hole of $`\mathrm{\Delta }`$ cannot cross $`q`$ because otherwise by Lemma 9.2 we would be able to decrease the $`𝐊`$-length of $`q`$ by going along the boundary of such a $`𝐊`$-annulus instead of crossing it. Hence by Lemma 9.2 we can assume that $`\mathrm{\Delta }`$ does not contain $`𝐊`$-annuli not surrounding the hole of $`\mathrm{\Delta }`$.

Let $`e`$ and $`f`$ be the first and the last edges of $`q`$. Since $`e`$ and $`f`$ are $`𝐊`$-edges, they belong to the first and the last $`𝐊`$-annulus of $`\mathrm{\Delta }`$ counting from $`p_1`$ to $`p_2`$. The label of $`p_1`$ is equal modulo $`Z(𝕊,ra)`$ to the label of a side $`p_1^{}`$ of the first $`𝐊`$-annulus in $`\mathrm{\Delta }`$ and the label of $`p_2`$ is equal in $`Z(𝕊,ra)`$ to the label of a side of the last $`𝐊`$-annulus in $`\mathrm{\Delta }`$. Hence we can assume that $`p_1`$ and $`p_2`$ are the sides of these annuli.

Thus $`\mathrm{\Delta }`$ satisfies conditions (T1), (T2), (T3). Since $`\varphi (q)`$ is $`𝐊`$-reduced, we can apply Lemma 9.4 and conclude that there exists another annular diagram $`\mathrm{\Delta }^{}`$ over $`Z(𝕊,a)`$ with contours $`p_1^{}`$ and $`p_2^{}`$, and a path $`q^{}`$ in $`\mathrm{\Delta }^{}`$ satisfying the conditions (T1),(T2), (T3) such that $`\varphi (p_1^{})=\varphi (p_1)`$, $`\varphi (p_2^{})=\varphi (p_2)`$ modulo Burnside relations, $`\varphi (q^{})=\varphi (q)=A`$ modulo $`Z(𝕊,ra)`$, $`\varphi (q^{})`$ is $`𝐊`$-reduced.

Assume that every maximal $`𝐑`$-band starting on the first $`𝐊`$-annulus of $`\mathrm{\Delta }^{}`$ does not end on $`p_2^{}`$. Then the label of $`p_1^{}`$ is equal to $`1`$ modulo $`Z(𝕊,ra),`$ a contradiction. Hence $`\mathrm{\Delta }^{}`$ contains an $`𝐑`$-band $``$, starting on $`p_1^{}`$ and ending on $`p_2^{}`$.

Let $`t`$ be a side of $``$. Then $`q`$ is homotopic to $`(p_1^{})^s(p_1^{\prime \prime })tp_2^{\prime \prime }`$ for some integer $`s`$, where $`p_1^{\prime \prime }`$ is a subpath of $`p_1^{}`$ and $`p_2^{\prime \prime }`$ is a subpath of $`p_2^{}`$. By Lemma 7.2 $`\varphi (t)B`$ is an admissible word starting and ending with a $`𝐊`$-letter $`z^{}`$. The $`𝐊`$-length of $`B`$ is the same as the $`𝐊`$-length of $`A`$ (since $``$ intersects each of the $`𝐊`$-annuli exactly once), whence $`B`$ is reduced in $`H_{kra}`$.

The word $`\varphi ((p_1^{})^s(p_1^{\prime \prime })`$ is written on the top side of $`z^{}`$-band, so it is equal to $`R_1L(h_1,z)`$ for some $`h_1`$. Similarly $`\varphi (p_2^{\prime \prime })R(h_2,z)`$ for some $`h_2`$. The last equalities from the lemma follow from Lemma 7.1. ∎

###### Lemma 9.6.

Let $`A`$ be a $`𝐊`$-reduced word without $`𝐑`$-letters, starting and ending with letters $`z_1,z_2`$ from $`𝐊𝐊^1`$, and suppose that for some words $`P_1`$ and $`P_2`$ of $`𝐊`$-length $`0`$, $`P_11`$ modulo $`Z(𝕊,ra)`$, we have $`A^1P_1A=P_2`$ modulo $`Z(𝕊,ra)`$. Then:

(1) $`P_1=L(h,z_1)`$, $`P_2=R(h,z_2)`$ modulo $`Z(𝕊,ra)`$ for some word $`h`$ over $`𝕊`$;

(2) $`A`$ is a reduced admissible word;

(3) $`Ah=A`$.

###### Proof.

Consider a van Kampen disc diagram $`\mathrm{\Delta }`$ over $`Z(𝕊,ra)`$ for the equality $`A^1P_1A=P_2`$, $`(\mathrm{\Delta })=p_1q_1p_2^1q_2^1`$ where $`\varphi (p_i)P_i^1,\varphi (q_i)A`$, $`i=1,2`$. By Lemma 9.2 we can assume that $`\mathrm{\Delta }`$ does not contain $`𝐊`$-annuli. We can also assume that all $`𝐊`$-bands in $`\mathrm{\Delta }`$ are reduced. Hence every maximal $`𝐊`$-band in $`\mathrm{\Delta }`$ connects $`q_1`$ and $`q_2`$. These maximal $`𝐊`$-bands divide $`\mathrm{\Delta }`$ into diagrams over $`Z(𝕊,ra)`$ without $`𝐊`$-edges, which we shall call chambers as in the annular case before. As in the proof of Lemma 9.4, one can use induction on the number of chambers, Proposition 8.2, Lemma 8.3 and Lemma 9.1, to move all Burnside $`ra`$-cells out of $`\mathrm{\Delta }`$. Since only two sides of $`\mathrm{\Delta }`$, namely $`p_1`$ and $`p_2`$ may contain $`𝐑`$-edges, only these two sides will change during this process. Their labels will stay the same modulo $`Z(𝕊,ra)`$. Hence there exists a van Kampen diagram $`\mathrm{\Delta }_1`$ over $`Z(𝕊,a)`$ (i.e. over $`Z(𝕊,ra)`$ but without Burnside $`ra`$-cells) with contour $`p_1^{}q_1(p_2^{})^1q_2^1`$ where $`\varphi (p_i^{})=\varphi (p_i)`$, modulo Burnside relations $`i=1,2`$.

Let $`𝒯_1`$ and $`𝒯_2`$ be the first and the last $`𝐊`$-bands in $`\mathrm{\Delta }_1`$ starting on $`q_1`$ and ending on $`q_2`$ (we count the $`𝐊`$-bands starting at $`p_1^{}`$). Consider the subdiagram $`\mathrm{\Delta }_2`$ of $`\mathrm{\Delta }_1`$ bounded by $`𝒯_1`$, $`𝒯_2`$, $`q_1`$, $`q_2`$ (and containing $`𝒯_1,𝒯_2`$). Then $`(\mathrm{\Delta }_2)=p_1^{\prime \prime }q_1(p_2^{\prime \prime })^1q_2^1`$ where $`p_1^{\prime \prime }`$ is a side of $`𝒯_1`$, $`p_2^{\prime \prime }`$ is a side of $`𝒯_2`$.

Considering the subdiagrams of $`\mathrm{\Delta }_1`$ bounded by $`p_1^{}(p_1^{\prime \prime })^1`$ and $`p_2^{}(p_2^{\prime \prime })^1`$, we conclude that $`\varphi (p_1^{})=\varphi (p_1^{\prime \prime })`$, $`\varphi (p_2^{})=\varphi (p_2^{\prime \prime })`$ modulo $`Z(𝕊,ra)`$. This gives part (1) of the lemma.

The subdiagram $`\mathrm{\Delta }_2`$ is a trapezium (by definition). Hence it is a normal trapezium $`T(A,h)`$ for some word $`h`$ (by Lemma 7.5). In particular, $`A`$ is an admissible word which proves part (2) of the lemma. Moreover, $`\varphi (p_1)=\varphi (p_1^{})=\varphi (p_1^{\prime \prime })=L(h,z_1)^1`$, $`\varphi (p_2)=\varphi (p_2^{})=\varphi (p_2^{\prime \prime })=R(h,z_2)^1`$ modulo $`Z(𝕊,ra)`$ for some word $`h`$ over $`𝕊`$. Since the top base of $`\mathrm{\Delta }_2`$ has label $`A`$, we have $`Ah=A`$. This gives part (3) of the lemma. ∎

###### Lemma 9.7.

Let $`B`$ be a $`𝐊`$-reduced word, starting with a letter $`z𝐊𝐊^1`$ and ending with a letter $`z^{}𝐊𝐊^1`$ which does not contain $`𝐑`$-letters . Let $`U`$ be a word over $`𝐀`$, let $`P,R`$ be words of $`𝐊`$-length $`0`$ such that $`BURBUz`$ is $`𝐊`$-reduced, $`P1`$ in $`Z(𝕊,ra)`$. Suppose that $`(BURBUz)^1P(BURBUz)`$ is a $`0`$-word $`Q`$ modulo $`Z(𝕊,ra)`$. Then $`BUz`$ is an admissible word, and there exist $`0`$-words $`P^{},R^{}`$ and $`Q^{}`$ which are equal modulo $`Z(𝕊,ra)`$ respectively to $`P,R,Q`$, such that $`(BUR^{}BUz)^1P^{}(BUR^{}BUz)=Q^{}`$ modulo $`Z(𝕊,a)`$.

###### Proof.

Consider a disc diagram $`\mathrm{\Delta }`$ over $`Z(𝕊,ra)`$ corresponding to the equality

$$(BURBUz)^1P(BURBUz)=Q,$$

$`(\mathrm{\Delta })=p_1q_1p_2^1q_2^1`$ where $`\varphi (p_1)P`$, $`\varphi (p_2)Q`$, $`\varphi (q_1)\varphi (q_2)BURBUz`$. Let $`q_1=s_1x_1t_1s_1^{}`$, $`q_2=s_2x_2t_2s_2^{}`$ where $`\varphi (s_i)B`$, $`\varphi (x_i)U`$, $`\varphi (t_i)R`$, $`\varphi (s_i^{})BUz`$, $`i=1,2`$. Let $`𝒯_1,𝒯_2`$ be the first and the last $`𝐊`$-bands starting on $`s_1`$, $`𝒯_3,𝒯_4`$ be the first and the last $`𝐊`$-bands starting on $`s_1^{}`$. Since $`BUR`$ is cyclically reduced, $`𝒯_1,𝒯_2`$ end on the first and the last edges of $`s_2`$, $`𝒯_3,𝒯_4`$ end on the first and the last edges of $`s_2^{}`$. Then we can assume that $`p_1`$ is a side of $`𝒯_1`$, $`p_2`$ is a side of $`𝒯_4`$. Let $`\overline{p}_1`$ be the side of $`𝒯_2`$ which connects $`(s_2)_+`$ with $`(s_1)_+`$, let $`\overline{p}_2`$ be a side of $`𝒯_3`$ which connects $`(s_2^{})_{}`$ with $`(s_1^{})_{}`$.

By Lemma 9.6 $`\varphi (p_1)=L(h_1,z)`$, $`\varphi (p_2)=R(h_2,z)`$ modulo $`Z(𝕊,ra)`$, $`B`$ and $`BUz`$ are admissible words, and $`Bh_1=B`$, $`BUzh_2=BUz`$. Thus as in Lemma 9.4 we can move all Burnside cells out of the subdiagrams $`\mathrm{\Delta }_1`$ and $`\mathrm{\Delta }_2`$ of $`\mathrm{\Delta }`$ bounded by $`p_1s_1(\overline{p}_1)^1s_2^1`$ and by $`\overline{p}_2s_1^{}p_2^1(s_2^{})^1`$, and replace them by trapezia $`T(B,h_1)`$ and $`T(B,h_2)`$ in the expense of possible increasing the number of cells in the subdiagram $`\mathrm{\Gamma }`$ bounded by $`\overline{p}_1x_1t_1\overline{p}_2^1(x_2t_2)^1`$. Hence we can assume that $`\mathrm{\Delta }_1=T(B,h_1)`$, $`\mathrm{\Delta }_2=T(B,h_2)`$.

Thus all Burnside $`ra`$-cells in $`\mathrm{\Delta }`$ are in $`\mathrm{\Gamma }`$. Consider the diagram $`\mathrm{\Gamma }`$. By Lemma 9.2 we can assume that $`\mathrm{\Gamma }`$ does not have $`𝐊`$-annuli. Since the boundary of $`\mathrm{\Gamma }`$ does not contain $`𝐊`$-edges, the entire diagram $`\mathrm{\Gamma }`$ does not have $`𝐊`$-edges.

Since $`\varphi (t_1)\varphi (t_2)`$, we can identify $`t_1`$ and $`t_2`$ to obtain an annular diagram $`\overline{\mathrm{\Gamma }}`$ and a path $`t`$ connecting the contours $`x_2^1\overline{p}_1x_1`$ and $`\overline{p}_2`$ of $`\mathrm{\Gamma }`$. We can eliminate all $`j`$-pairs of $`\overline{\mathrm{\Gamma }}`$, replacing $`t`$ by a path with the same label modulo $`Z(𝕊,ra)`$. Hence we can assume that $`\overline{\mathrm{\Gamma }}`$ does not have $`j`$-pairs. Hence $`\overline{\mathrm{\Gamma }}`$ is an $`A`$-map by Proposition 8.2.

If $`\overline{\mathrm{\Gamma }}`$ does not have Burnside $`ra`$-cells, we are done, because we can again cut $`\overline{\mathrm{\Gamma }}`$ along the path $`t`$. Suppose that $`\overline{\mathrm{\Gamma }}`$ contains Burnside $`ra`$-cells. Consider $`\overline{\mathrm{\Gamma }}`$ as a map satisfying condition A from Section 2.4 with boundary divided into four parts: $`x_1,x_2,\overline{p}_1,\overline{p}_2`$. Recall that paths $`x_1`$, $`x_2`$ do not contain $`𝐑`$-edges. By Lemma 2.5, there exists a Burnside $`ra`$-cell $`\mathrm{\Pi }`$ and a contiguity subdiagram $`\mathrm{\Gamma }^{}`$ of rank $`0`$ of $`\mathrm{\Pi }`$ to $`\overline{p}_1`$ or $`\overline{p}_2`$ with contiguity degree at least $`\epsilon `$. We can assume that $`t`$ avoids $`\mathrm{\Gamma }^{}`$. Hence $`\mathrm{\Pi }`$ and $`\mathrm{\Gamma }^{}`$ are subdiagrams of the (disc) diagram $`\mathrm{\Gamma }`$. As in the proofs of Lemmas 9.3, 9.4, we can use Lemmas 8.3 and 9.1 and move $`\mathrm{\Pi }`$ through either the trapezium $`\mathrm{\Delta }_1`$ or the trapezium $`\mathrm{\Delta }_2`$ leaving $`\varphi (p_1)`$ and $`\varphi (p_2)`$ the same modulo $`Z(𝕊,ra)`$, leaving paths $`s_i,x_i`$ untouched and decreasing the number of Burnside $`ra`$-cells in $`\mathrm{\Gamma }`$. The proof now can be completed by induction on the number of Burnside $`ra`$-cells in $`\mathrm{\Gamma }`$. ∎

### 9.2 Conditions (Z1), (Z2), (Z3)

Now we are ready to check that the presentation $`Z(𝕊,\mathrm{\Lambda },ra)`$ satisfies conditions (Z1), (Z2), (Z3) from Section 3.

Here we are going to use notation from Section 3 again, as in Section 8.

Let $`_0=𝒮_0`$ be the set $`Z(𝕊,ra)`$ of all relations in $`Z(𝕊,\mathrm{\Lambda },ra)`$ except for the hub, and let $`𝒮_{1/2}=\{\mathrm{\Lambda }(0)\}`$, so $`Z(𝕊,\mathrm{\Lambda },ra)=_{1/2}`$. We let $`𝒴=𝐊`$, so all letters from $`𝐑𝐀`$ are 0-letters.

Condition (Z1.1) holds by an easy inspection. Condition (Z1.2) holds by Proposition 8.2.

The length of $`\mathrm{\Lambda }`$ is $`(2n+3)N>n`$, so (Z2.1) holds. The condition (Z2.2) is obviously true.

The next lemma gives us (Z2.3).

###### Lemma 9.8.

Assume that $`v_1w_1`$ and $`v_2w_2`$ are cyclic permutations of $`\mathrm{\Lambda }(0)^{\pm 1}`$ and $`|v_1|\epsilon |\mathrm{\Lambda }(0)|.`$ Then if $`u_1v_1=v_2u_2`$ holds modulo $`𝒮_0`$ for some 0-words $`u_1`$, $`u_2`$, then we have $`u_2w_1=w_2u_1`$ modulo $`𝒮_0`$.

###### Proof.

Suppose that $`u_1v_1=v_2u_2`$ modulo $`𝒮_0`$. Then there exists a van Kampen diagram $`\mathrm{\Gamma }`$ over $`𝒮_0`$ with boundary $`p_1q_1p_2^1q_2^1`$ such that $`\varphi (p_1)u_1`$, $`\varphi (p_2)u_2`$, $`\varphi (q_1)v_1`$, $`\varphi (q_2)v_2`$ (see Figure 6). The $`𝐊`$-bands of $`\mathrm{\Gamma }`$ starting on $`q_1`$ end on $`q_2`$ since $`\varphi (q_1)`$ is a linear word and $`u_1,u_2`$ do not contain letters from $`𝐊𝐊^1`$. The labels of the start and end edges of each of these bands are equal. Hence $`v_2\varphi (q_2)\varphi (q_1)v_1v`$. Since $`|v|>0`$, and $`\mathrm{\Lambda }(0)`$ and $`\mathrm{\Lambda }(0)^1`$ do not have common letters, $`v`$ cannot be a subword of both $`\mathrm{\Lambda }(0)`$ and $`\mathrm{\Lambda }(0)^1`$. Without loss of generality assume that $`v`$ is a subword of $`\mathrm{\Lambda }(0)`$.

Recall that for every $`j=1,\mathrm{},N`$, we denote $`\mathrm{\Lambda }_j(0)`$ to be the subword of $`\mathrm{\Lambda }(0)`$ starting with $`\lambda (j)`$ and ending with $`\lambda (j+1)`$ ( as usual “$`N+1`$” here is 1).

By Lemma 9.6 there exists a word $`h`$ over $`𝕊`$ such that $`vh=v`$, $`u_1=L(h,z_1)`$, $`u_2=R(h,z_2)`$ modulo $`Z(𝕊,ra)`$ for some $`z_1,z_2`$. Hence we can assume that $`u_1=L(h,z_1)`$, $`u_2=R(h,z_2)`$ in the free group and that $`\mathrm{\Gamma }=T(v,h)`$. Since $`T(v,h)`$ is a diagram over $`Z(𝕊,a)`$, $`\mathrm{\Gamma }`$ does not contain Burnside $`ra`$-cells.

Since $`v\varphi (q_1)\varphi (q_2)`$ is a subword of $`\mathrm{\Lambda }(0)`$, we can attach to $`\mathrm{\Gamma }`$ two hubs $`\mathrm{\Pi }_1`$ and $`\mathrm{\Pi }_2`$ along the paths $`q_1`$ and $`q_2`$, and consider the resulting diagram $`\mathrm{\Delta }`$ with boundary label $`w_2u_1w_1^1u_2^1`$. We need to show that $`\mathrm{\Delta }`$ can be replaced by a diagram over $`𝒮_0`$ with the same boundary label.

Since $`|v_1|\epsilon |\mathrm{\Lambda }(0)|`$ and $`N>n>3/\epsilon `$, we conclude that $`v_1`$ contains $`\mathrm{\Lambda }_j(0)`$ for some $`j>1`$.

Let $`q_1^{}`$ be the subpath of $`q_1`$ such that $`\varphi (q_1^{})\mathrm{\Lambda }_j(0)`$. Since $`\mathrm{\Lambda }`$ is linear, every $`𝐊`$-band starting on $`q_1`$ ends on $`q_2`$. Let $`𝒯_1`$ be the $`\lambda (j)`$-band and $`𝒯_2`$ be the $`\lambda (j+1)`$-band starting on $`q_1^{}`$. Then $`𝒯_1`$ ends on the edge of $`q_2`$ labeled by $`\lambda (j,0)`$ and $`𝒯_2`$ ends on the edge of $`q_2`$ labeled by $`\lambda (j+1,0)`$.

The bands $`𝒯_1`$, $`𝒯_2`$, the path $`q_1^{}`$ and the path $`q_2`$ bound a subdiagram $`\mathrm{\Gamma }^{}`$ of $`\mathrm{\Gamma }`$ which is a trapezium. By Lemma 7.5, $`\mathrm{\Gamma }^{}=T(\mathrm{\Lambda }_j(0),h)`$ and $`\mathrm{\Lambda }_j(0)h=\mathrm{\Lambda }_j(0)`$. Let $`t`$ be the subpath of $`(\mathrm{\Gamma }^{})`$ which is a side of $`𝒯_1`$.

Consider the subdiagram $`\mathrm{\Delta }^{}`$ of $`\mathrm{\Delta }`$ consisting of $`\mathrm{\Pi }_1`$, $`\mathrm{\Pi }_2`$ and $`t`$. Since $`\mathrm{\Delta }\backslash \mathrm{\Delta }^{}`$ consists of $`0`$-cells, it suffices to show that the boundary label of $`\mathrm{\Delta }^{}`$ is equal to 1 modulo $`𝒮_0`$.

Thus we need to show that $`\varphi (t)=L(h,\lambda (j))`$ commutes with

$$\mathrm{\Lambda }_j(0)\lambda (j+1,0)^1\mathrm{\Lambda }_{j+1}(0)\lambda (j+2,0)^1\mathrm{}\mathrm{\Lambda }_{j1}(0)\lambda (j,0)^1.$$
(26)
By Proposition 6.16, for every $`i=1,\mathrm{},N`$ we have $`\mathrm{\Lambda }_i(0)h=\mathrm{\Lambda }_i(0)`$. The trapezium $`T(\mathrm{\Lambda }_i(0),h)`$ gives us the equality

$$\mathrm{\Lambda }_i(0)^1L(h,\lambda (i))\mathrm{\Lambda }_i(0)=R(h,\lambda (i+1))=\lambda (i+1,0)^1(L(h,\lambda (i+1))\lambda (i+1,0),i=1,\mathrm{},N$$

modulo $`𝒮_0`$. Hence

$$\lambda (i+1,0)\mathrm{\Lambda }_i(0)^1L(h,\lambda (i))\mathrm{\Lambda }_i(0)\lambda (i+1,0)^1=L(h,\lambda (i+1)),i=1,\mathrm{},N.$$

Hence if we conjugate $`L(h,\lambda (i))`$ by the word (26), we get $`L(h,\lambda (i))`$ as required.∎

As in Section 3, for every cyclically reduced essential element $`gH_{kra}`$ we define $`\mathrm{𝟎}(g)`$ as the maximal subgroup of $`H_{ra}`$ which contains $`g`$ in its normalizer. For an arbitrary essential element $`g`$ of the form $`vuv^1`$ where $`u`$ is cyclically reduced, we define $`\mathrm{𝟎}(g)=v\mathrm{𝟎}(u)v^1`$. By Lemma 3.7, $`\mathrm{𝟎}(g)`$ is well defined (does not depend on the presentation $`g=vuv^1`$).

The following lemma will imply both (Z3.1) and (Z3.2).

###### Lemma 9.9.

Let $`w`$ be an essential element represented by a cyclically minimal in rank $`1/2`$ word $`W`$, let $`x1`$ be a $`0`$-element in $`H_{kra}`$ such that $`w^4xw^4`$ is a $`0`$-element. Then the following two statements hold.

(i) There exists a $`0`$-element $`u`$ such that $`wu^1`$ commutes with every element of $`\mathrm{𝟎}(w)`$.

(ii) $`x\mathrm{𝟎}(w)`$.

###### Proof.

We divide the proof into several steps.

1. Let $`P_1`$ be a $`0`$-word representing $`x`$. By Lemma 3.4 every cyclic shift of $`W`$ is a cyclically $`𝐊`$-reduced word. Therefore we can assume that $`W`$ starts with a letter $`z𝐊𝐊^1`$ (by Lemma 3.7).

By Lemma 3.6, $`(Wz)^1P_1Wz`$ is equal in $`H_{kra}`$ to a $`0`$-word $`P`$. By Lemma 9.5 $`Wz=CBz^{}D`$ in $`H_{kra}`$ where $`B`$ does not contain $`𝐑`$-letters and starts with a $`𝐊`$-letter $`z^{}`$ such that $`Cz^{}=zC^{}`$, $`z^{}D=D^{}z`$ modulo $`Z(𝕊,a)`$ where $`D^{}L(f,z)`$, $`CL(f^{},z)`$ for some words $`f,f^{}`$ over $`𝕊`$.

In particular since $`Wz=CBz^{}D=CBD^{}z`$, we have $`W=CBD^{}`$ in $`H_{kra}`$. Since $`D^{}Cz^{}=z^{}DC^{}`$, passing if necessary to a cyclic shift $`BD^{}C`$ of $`W`$, we can assume that $`C`$ is empty, so $`z^{}=z`$, and replace $`W`$ by $`BD^{}`$ where $`D^{}z=zD`$ modulo $`Z(𝕊,a)`$. The word $`B`$ is equal to $`zB_1U`$ where $`B_1`$ is either empty or ends with a letter $`z^{}𝐊𝐊^1`$, $`U`$ is a word over $`𝐀`$.

2. By Lemma 3.6, we have the following equalities in $`H_{kra}`$:

$$(zB_1UD^{}zB_1Uz)^1P_1(zB_1UD^{}zB_1Uz)=P_2$$
(27)
$$(zB_1UD^{}zB_1UD^{}zB_1Uz)^1P_1(zB_1UD^{}zB_1UD^{}zB_1Uz)=P_3$$
(28)
where $`P_2`$ and $`P_3`$ are $`0`$-words.

By Lemma 9.7 (which can be applied because $`zB_1UD^{}zB_1Uz`$ is reduced since this word is equal to a subword of the same length of the reduced word $`W^3`$) we can assume that equality (27) holds modulo $`Z(𝕊,a)`$ (replacing $`P_1`$ and $`P_2`$ by equal in $`H_{kra}`$ words if necessary), $`Bz`$ is a reduced admissible word. By Lemma 3.6, since $`D^{}z=zD`$, we have that $`(zB_1Uz)^1P_1(zB_1Uz)`$ is a $`0`$-word modulo $`Z(𝕊,a)`$. Hence by Lemma 9.6 $`P_1=L(h,z)`$ modulo $`Z(𝕊,a)`$ and

$$Bzh=Bz.$$
(29)
3. Now consider a diagram $`\mathrm{\Delta }`$ over $`Z(𝕊,a)`$ corresponding to equality (27), $`(\mathrm{\Delta })=p_1q_1p_2^1q_2^1`$ where $`\varphi (p_1)P_1`$, $`\varphi (p_2)P_2`$, $`\varphi (q_1)BD^{}Bz\varphi (q_2)`$. Then $`q_1=s_1t_1s_1^{}`$, where $`\varphi (s_1)B`$, $`\varphi (t_1)D^{}`$, $`\varphi (s_1^{})Bz`$. Consider the maximal $`z`$-band $`𝒯_1`$ in $`\mathrm{\Delta }`$ starting on the first edge of $`s_1^{}`$. As usual, we can assume that $`p_2`$ is a side of a $`z`$-band $`𝒯_2`$. The bands $`𝒯_1`$ and $`𝒯_2`$ bound a subdiagram $`\mathrm{\Delta }_1`$ of $`\mathrm{\Delta }`$ which is a trapezium. By Lemma 7.5, $`\mathrm{\Delta }_1=T(Bz,h_1)`$ where $`h_1`$ is the history of $`𝒯_1`$.

Consider the natural homomorphism $`\psi `$ from $`H_{kra}`$ to the free group freely generated by $`𝕊`$. This homomorphism takes $`𝐊`$ and $`𝐀`$ to 1, and takes each letter from $`𝐑`$ to the corresponding rule from $`𝕊`$. It is clear that this homomorphism is correctly defined because killing all letters from $`𝐊𝐀`$ in every relation from $`Z(𝕊,a)`$ and replacing letters from $`𝐑`$ by the corresponding rules from $`𝕊`$ gives us a trivial relation $`1=1`$. Since $`D^{}=L(f,z)`$, $`\psi (D^{})=f`$. Applying this homomorphism to the boundary label of the subdiagram of $`\mathrm{\Delta }`$ bounded by $`p_1`$ and a side of $`𝒯_1`$, we get $`h_1=f^1hf`$. Hence we have

$$Bzf^1hf=Bz.$$
(30)
4. Now let $`\mathrm{\Delta }_1`$ be a van Kampen diagram corresponding to equality (28). Applying Lemma 9.6 to the subdiagram $`\mathrm{\Delta }_2`$ of $`\mathrm{\Delta }_1`$ bounded by two $`z`$-bands $`𝒯_1`$, $`𝒯_2`$ corresponding to the two last distinguished occurrences of $`z`$ in $`zB_1UD^{}zB_1UD^{}zB_1Uz`$, we obtain $`zB_1Uzh_2=zB_1Uz`$, i.e. $`Bzh_2=Bz`$ where $`h_2`$ is the history of the $`z`$-band $`𝒯_1`$. Applying the homomorphism $`\psi `$ to the boundary label of the subdiagram of $`\mathrm{\Delta }_2^{}=\mathrm{\Delta }_1\backslash \mathrm{\Delta }_2`$ we obtain the equality $`\psi (D^{})^2h\psi (D^{})^2h_2^1=f^2hf^2h_2^1`$ modulo Burnside relations. Hence $`f^2hf^2h_2^1=1`$ modulo Burnside relations. We conclude that

$$Bzh_2=Bz$$
(31)
where $`h_2=f^2hf^2`$ modulo Burnside relations.

Let $`W_1=Bz`$, $`h_1=f^1hf`$, $`g=f`$, $`b=h_2`$. Then $`W_1h_1=W_1`$ by (30), $`W_1gh_1g^1=W_1`$ by (29) and $`W_1b=W_1`$ by (31) where $`b=g^1h_1g`$ modulo Burnside relations.

Suppose that $`Bz`$ contains an accepted subword $`B^{}`$. Then $`B^{}h^{}`$ is a cyclic shift $`C`$ of $`\mathrm{\Lambda }(0)`$ for some word $`h^{}`$ over $`𝕊`$. Then for some admissible subword $`B^{\prime \prime }`$ of $`B`$ and $`B^{}`$, $`B^{\prime \prime }h^{}=C^{}`$ where $`C^{}C^{\prime \prime }C`$, $`|C^{\prime \prime }|1`$. By Lemma 7.5 $`B^{\prime \prime }=UC^{}V`$ in $`H_{kra}`$ where $`U`$ and $`V`$ are $`0`$-words. Hence $`B^{\prime \prime }=U(C^{\prime \prime })^1V`$ in rank $`1/2`$. Since $`|U(C^{\prime \prime })^1V|<|UC^{}V|`$, and $`B^{\prime \prime }`$ is a subword of $`W`$, we get a contradiction with the assumption that $`W`$ is cyclically minimal in rank 1/2.

Thus all conditions of Proposition 6.17 hold. By that proposition and by Remark 6.18, we can conclude that for every integer $`s`$ there exists an word $`b_{s+1}`$ over $`𝕊`$ which is equal to $`g^sh_1g^s=f^{s1}hf^{s+1}`$ modulo Burnside relations and such that

$$Bzb_{s+1}=Bz.$$

5. For arbitrary integer $`s`$ consider the trapezia $`T_s=T(Bz,b_s)`$. Let $`(T_s)=p_1q_1p_2^1q_2^1`$, where $`\varphi (p_1)=L(b_s,z)`$, $`\varphi (p_2)=R(b_s,z)`$, $`\varphi (q_i)=Bz`$, $`i=1,2`$.

Considering the subdiagram of $`T_s`$ obtained by removing the last $`z`$-band (whose side is $`p_2`$), we get the equality

$$L(b_s,z)BL(b_s,z)^1=B$$

modulo $`Z(𝕊,a)`$. Thus $`B`$ commutes with $`L(b_s,z)`$ modulo $`Z(𝕊,a)`$. Notice that $`b_0=h`$. Hence $`B`$ commutes with $`L(f,z)^sL(h,z)L(f,z)^s`$ modulo $`Z(𝕊,ra)`$. Recall that $`L(f,z)D^{}`$, $`L(h,z)P_1L(b_0,z)`$. Hence $`(D^{})^sx(D^{})^s`$ commutes with $`B`$ for every integer $`s`$.

Therefore for every non-negative integer $`s`$, we have the following equalities in $`H_{kra}`$:

$$\begin{array}{c}W^sP_1W^s=\hfill \\ (BD^{})^sP_1(BD^{})^s=(D^{})^1B^1\mathrm{}(D^{})^1B^1(D^{})^1\underset{¯}{(B^1P_1B)}D^{}BD^{}\mathrm{}BD^{}=\hfill \\ (D^{})^1B^1\mathrm{}(D^{})^1\underset{¯}{B^1((D^{})^1P_1D^{})B}D^{}\mathrm{}BD^{}=\hfill \\ (D^{})^1B^1\mathrm{}\underset{¯}{B^1((D^{})^2P_1(D^{})^2)B}\mathrm{}BD^{}=\mathrm{}\hfill \\ (D^{})^sP_1(D^{})^s\hfill \end{array}$$
(32)
(we underline the parts of the words which are changing). Similar equalities hold for negative $`s`$. Therefore for every integer $`s`$, $`w^sxw^s`$ is a $`0`$-element in $`H_{kra}`$. Hence $`x\mathrm{𝟎}(w)`$ (since the subgroup generated by $`w^sxw^s`$, $`s=0,\pm 1,\mathrm{}`$, consists of $`0`$-elements and is normalized by $`w`$).

6. Let us prove that $`B`$ commutes with every element $`y\mathrm{𝟎}(w)`$ modulo $`Z(𝕊,ra)`$. Let $`P_y`$ be a word in $`𝐑𝐀`$ representing $`y`$. Since $`y\mathrm{𝟎}(w)`$, $`W^2P_yW^2`$ is equal modulo $`Z(𝕊,ra)`$ to a $`0`$-word. By Lemma 3.6, $`(BD^{}z)^1P_y(BD^{}z)`$ is a $`0`$-word (modulo $`Z(𝕊,ra)`$). Since $`D^{}z=zD`$ modulo $`Z(𝕊,ra)`$, we have that $`(BzD)^1P_y(BzD)`$ is a $`0`$-word modulo $`Z(𝕊,ra)`$. By Lemma 3.6, $`(Bz)^1P_y(Bz)`$ is a $`0`$-word $`P_y^{}`$ modulo $`Z(𝕊,ra)`$. Considering a van Kampen diagram for this equality, we deduce (by a usual argument) that $`P_y=L(h_y,z)`$, $`P_y^{}=R(h_y^{},z)`$ for some words $`h_y,h_y^{}`$ over $`𝕊`$. Applying the homomorphism $`\psi `$ to the equality

$$(Bz)^1L(h_y,z)(Bz)=R(h_y^{},z)$$

we get that $`h_y=h_y^{}`$ modulo Burnside relations. The last equality implies

$$B^1P_yB=B^1L(h_y,z)B=zR(h_y^{},z)z^1=L(h_y^{},z)=P_y$$
(33)
modulo $`Z(𝕊,ra)`$ (by Lemma 7.1). Hence $`B`$ commutes with $`P_y`$ modulo $`Z(𝕊,ra)`$, as required.

7. Now let $`y\mathrm{𝟎}(w)`$ be represented by a word $`P_y`$. Let us prove by induction on $`l`$ that $`(D^{})^lP_y(D^{})^l`$ belongs to $`\mathrm{𝟎}(w)`$ for every $`l0`$. This is clearly true for $`l=0`$. Suppose that it is true for some $`l0`$. Then

$$(D^{})^{l+1}P_y(D^{})^{l1}=(D^{})(D^{})^lP_y(D^{})^l(D^{})^1=B^1(BD^{})(D^{})^lP_y(D^{})^l(BD^{})^1B.$$
(34)
Since $`(D^{})^lP_y(D^{})^l`$ belongs to $`\mathrm{𝟎}(w)=\mathrm{𝟎}(BD^{})`$, we have that $`(BD^{})(D^{})^lP_y(D^{})^l(BD^{})^1`$ belongs to $`\mathrm{𝟎}(w)`$ (by the definition of $`\mathrm{𝟎}(w)`$). Since $`B`$ commutes with every element of $`\mathrm{𝟎}(w)`$, (34) implies that

$$(D^{})^{l+1}P_y(D^{})^{l1}=(BD^{})(D^{})^lP_y(D^{})^l(BD^{})^1\mathrm{𝟎}(w).$$

Similarly one can prove that $`(D^{})^lP_y(D^{})^l`$ belongs to $`\mathrm{𝟎}(w)`$ for all $`l<0`$.

8. Let $`u`$ be the element of $`H_{kra}`$ represented by $`D^{}`$. Then clearly $`u`$ is a $`0`$-element. Let $`w`$ be the element represented by $`W(D^{})^1`$. We need to prove that $`w`$ commutes with $`y`$, that is, $`W(D^{})^1`$ commutes with $`P_y`$ modulo $`Z(𝕊,ra)`$, or, equivalently,

$$(BD^{})^1P_y(BD^{})=(D^{})^1P_y(D^{})$$

modulo $`Z(𝕊,ra)`$. This has been proved already in (33). ∎

This completes verification of properties (Z1), (Z2), (Z3). By Proposition 3.19, we have the following statement.

###### Proposition 9.10.

There exists a graded presentation $`_{kra}`$ containing $`Z(𝕊,ra)`$ of the factor group $`H_{kra}(\mathrm{})`$ of $`H_{kra}`$ over the subgroup generated by all $`n`$-th powers of elements of $`H_{kra}`$, such that every relation of $`_{kra}`$ of rank $`1`$ has the form $`u^n=1`$ for some word $`u`$, and every minimal diagram over $`_{kra}`$ satisfies property A from Section 2.4, and all the lemmas from Section 3.

## 10 Proof of Theorem 1.3

###### Lemma 10.1.

For every word $`w(x_1,\mathrm{},x_m)`$, if $`w(a_1(\kappa (1)),\mathrm{},a_m(\kappa (1)))=1`$ in $`H_{kra}(\mathrm{})`$, then $`w(a_1,\mathrm{},a_m)=1`$ in $`A(\kappa (1))`$.

###### Proof.

Let $`\mathrm{\Delta }`$ be a g-reduced diagram over $`_{kra}`$ with boundary label $`w(a_1(\kappa (1)),\mathrm{},a_m(\kappa (1)))`$. Suppose that $`\mathrm{\Delta }`$ contains cells of rank $`>0`$. By Proposition 9.10 $`\mathrm{\Delta }`$ is an $`A`$-map. By Lemma 2.5 $`\mathrm{\Delta }`$ contains a cell $`\mathrm{\Pi }`$ of rank $`>0`$ and a contiguity subdiagram of $`\mathrm{\Pi }`$ to $`(\mathrm{\Delta })`$. Since non-0 letters in presentation $`_{kra}`$ are letters from $`𝐊`$, by definition of contiguity subdiagrams from Section 2, $`(\mathrm{\Delta })`$ contains a $`𝐊`$-edge, a contradiction.

Hence $`\mathrm{\Delta }`$ does not contain cells of rank $`>0`$. Therefore $`\mathrm{\Delta }`$ is a diagram over $`H_{kra}`$. So we can assume that $`\mathrm{\Delta }`$ is a g-reduced diagram over $`H_{kra}`$. By Lemma 9.2 we can assume that $`\mathrm{\Delta }`$ does not contain $`𝐊`$-annuli. Hence $`\mathrm{\Delta }`$ does not contain $`𝐊`$-edges. Therefore $`\mathrm{\Delta }`$ is a diagram over $`_{ra}`$ where $`𝐑`$ is the set of non-0 letters.

Suppose that $`\mathrm{\Delta }`$ contains a cell of rank $`>0`$. Then by Proposition 8.2 and Lemma 2.6 $`\mathrm{\Delta }`$ contains a cell $`\mathrm{\Pi }`$ of rank $`>0`$ and a contiguity subdiagram of $`\mathrm{\Pi }`$ to $`(\mathrm{\Delta })`$. Hence $`(\mathrm{\Delta })`$ contains $`𝐑`$-edges, a contradiction. Therefore $`\mathrm{\Delta }`$ does not contain cells of rank $`>0`$. Hence $`\mathrm{\Delta }`$ is a diagram over $`H_{ra}`$. By Lemma 7.3, part (3), $`\mathrm{\Delta }`$ does not contain $`𝐑`$-annuli. Hence $`\mathrm{\Delta }`$ does not contain $`𝐑`$-edges. This means that all cells of $`\mathrm{\Delta }`$ are $`a`$-cells. Therefore $`\mathrm{\Delta }`$ is a diagram over $`H_a`$.

Since $`A(\kappa (1))`$ is a retract of $`H_a`$, we obtain that $`w(a_1(\kappa (1)),\mathrm{},a_m(\kappa (1)))`$ is equal to 1 modulo $`R(\kappa (1))`$-relations and Burnside relations, as required. ∎

Given the Burnside group $`B(m,n)`$ generated by $`a_1,\mathrm{},a_m`$, we have, by Lemma 5.2, a homomorphism $`\varphi :B(m,n)`$ such that $`\varphi (a_i)=a_i(\kappa (1))`$, $`i=1,\mathrm{},m`$.

Assume that $`\varphi (w(a_1,\mathrm{},a_m))^n`$. Then $`w(a_1(\kappa (1)),\mathrm{}a_m(\kappa (1)))=1`$ in $`H_{kra}(\mathrm{})=(n)=/^n`$ by Proposition 9.10. Setting $`R(\kappa (1))=\mathrm{}`$, we have from Lemma 10.1 that $`w=1`$ in $`A(\kappa (1))=B(a_1,\mathrm{},a_m;n)`$. Hence $`\varphi `$ is an embedding, and moreover, the intersection of $`\varphi (B(m,n))^n`$ is trivial. This proves Statement (1) of Theorem 1.3.

Let now $`L`$ be an arbitrary normal subgroup of $`B(m,n)`$ (the latter can now be identified with its image in $`/^n`$). To prove Statement (2) of Theorem 1.3, we have to show that $`L=L^{/^n}B(m,n)=L`$. Let us define $`R(\kappa (1))`$ to be the set of all words in $`a_1(\kappa (1)),\mathrm{},a_m(\kappa (1))`$ representing elements of $`L`$. The new group $`H_{kra}(\mathrm{})`$ (whose construction depends now on the new choice of $`R(\kappa (1))`$) is a homomorphic image of $`/^n`$ by Proposition 9.10. Therefore it suffices to prove that every word $`w(a_1(\kappa (1)),\mathrm{},a_m(\kappa (1)))`$ that is equal to 1 in $`H_{kra}(\mathrm{})`$, is also trivial in $`B(m,n)/LA(\kappa (1))`$. But again, this claim is a part of Lemma 10.1.

The proof of Theorem 1.3 is complete.

Subject index

accepted admissible word 6.3
adjacent edges 2.3
admissible word 5.1, 6.1, 6.1
annulus 2.2
$`(S,T)`$-annulus 2.2
$`c`$-aperiodic word 4.1
$`𝐊`$-band 7.1
$`\overline{𝐊}`$-band 7.1
$`𝐑`$-band 7.1
$`S`$-band 2.2
$`\tau `$-band 7.1
bases of a trapezium 7.3
bond 2.3
$`0`$-bond 2.3
bottom side of a band 2.2
Burnside cells 4.9
Burnside-reduced word 6.6
Burnside $`ra`$-relations 9
$`0`$-cell 2.1
chamber 9.2
cleaning rule 5.2
compatibility of cells 3.3, 4.9
congruence extension property (CEP) 1.2
connecting line of a band 2.2
connecting line of a bond 2.3
connecting line of a contiguity submap 2.3
connecting rule 5.1, 5.2
contiguity arc 2.3
contiguity degree 2.3
contiguity submap 2.3
converting $`S`$-rules into sets of relations 5.1
$`\mathrm{\Omega }`$-coordinate of a word 5.1
copy of a word 6.3
crossing bands 2.2
cyclically $`Y`$-reduced element 3.1
cyclically $`Y`$-reduced word 3.2
diagram divided by a connecting line (band) 2.2
domain of a word in $`𝕊`$ 6.2
$`0`$-edge 2.1
$`0`$-element 3.1
essential element 3.1
graded map 2.1
graded presentation 3.1
history of a computation 1.3
history of a $`𝐊`$-band 7.1
history of a trapezium 7.3
hoop 4.7
homomorphism $`\vartheta _i`$ 6.18
homomorphism $`\upsilon `$ 6.18
inside diagram of an annulus 2.2
inverse rule 5.1
inverse semigroup $`P(𝕊)`$ 6.1
Lowest Parameter Principle 2
length of a path 1.3
$`Y`$-length 3.1
$`Y`$-letter 3.1
$`0`$-letter 2.2
map 2.1
A-map 2.4
narrow bond 2.9
normal trapezium 7.3
$`j`$-pair 3.3
$`1/2`$-pair 3.3
period of rank $`i`$ 3.3, 4.5
$`A`$-periodic word 3.3
phase decomposition 3.3
positive edge (cell) 2.1
positive and negative $`S`$-rules 5.1
principal cell of a bond 2.3
properties A1, A2, A3 2.4
properties (M1),(M2), (M3) 2.1
properties (T1), (T2), (T3) 9.2
properties (TR1), (TR2) 7.3
properties (Z1),(Z2), (Z3) 3.1
rank of a cell 2.1
rank of a map 2.1
reduced admissible word 6.1
reduced band 2.2
reduced path 2.3
g-reduced diagram 3.3
$`Z(𝕊,a)`$-reduced diagram 7.2
\*-reduced word 4.19
$`Y`$-reduced word 3.2
$`T`$-relator 4.5
$`a`$-relations 7.1
$`k`$-relations 7.1
$`r`$-relations 7.1
$`ra`$-relations 7.1
$`S`$-rule 5.1
$`S`$-rule applicable to an admissible word 5.1
$`S`$-rule locking a sector 5.1
$`S`$-rule left (right) active for a sector 5.1
section of a contour of a diagram 2.3
$`\epsilon `$-section 4.5
$`H`$-section 4.9
sector 5.1
sector of the type (form) $`[zz^{}]`$ 6.14
simple in rank $`i`$ word 3.3, 4.5
smooth section 2.4
$`\alpha `$-series 2.12
side arc of a contiguity subdiagram 2.3
sides of a trapezium 7.3
start and end edges of a band 2.2
$`0`$-subgroup 3.1
top side of a band 2.2
trapezium 7.3
$`\psi `$-trivial word 4.19
type of a map (diagram) 2.1
van Kampen diagram 2.2
van Kampen lemma 2.2
vertices in the same phase 3.20
$`0`$-word (Z1.1)
$`H`$-word 4.4
working rule 5.1, 5.2

$`𝐀`$ 5.1
$`𝒜`$ 5.1
$`|A|_Y`$ 3.1
$`A(z)`$ 5.1
$`\alpha ,\beta ,\gamma ,\delta ,\epsilon ,\zeta ,\iota ,h,n,\overline{\alpha },\overline{\beta },\overline{\gamma }`$ 2.3
$`B(m,n)`$ 1.2
$`\mathrm{𝐛𝐨𝐭}()`$ 2.2
$`(\mathrm{\Pi }_1,\mathrm{\Gamma },\mathrm{\Pi }_2)`$ 2.3
$`(\mathrm{\Pi })`$, $`|(\mathrm{\Pi })|`$ 2.1
$`e_{}`$, $`e_+`$ 2.1
$``$ 1.2
$`\mathrm{\Gamma }\mathrm{\Pi }`$ 2.3
$`𝐆(i),𝐆(\mathrm{})`$ 3.3
$``$ 1.3, 5.3
$`H_a`$ 6.1
$`H_{ka}^{}`$ 6.1
$`H_{ra}`$ 8
$`H_{ra}(\mathrm{})`$ 8.2
$`H_{kra}`$9
$`H_{kra}(\mathrm{})`$ 9.10
$`\overline{𝐊}`$ 5.1
$`\overline{𝐊}(z)`$ 5.1
$`𝐊`$ 5.1
$`\mathrm{\Lambda }`$ 5.1
$`\mathrm{\Lambda }_i(0)`$ 6.2
$`L(\tau ,z)`$ 5.1
$`L^a(\tau ,z)`$ 6.3
$`\mathrm{𝟎}(g)`$ (Z3)
$`\mathrm{\Omega }`$ 5.1
$`(\mathrm{\Pi }_1,\mathrm{\Gamma },\mathrm{\Pi }_2)`$ 2.3
$`\mathrm{\Pi }\mathrm{\Theta }`$ 9.1
$`R(\kappa (1))`$ 6.1
$`R(\tau ,z)`$ 5.1
$`R^a(\tau ,z)`$ 6.3
$`𝐑`$ 5.1
$`𝐑(z)`$ 5.1
$`(\mathrm{})`$ 3.3
$`_i`$ 3.3
$`_{kra}`$ 9.10
$`_{ra}`$ 8.2
$`r(\mathrm{\Pi })`$ 2.1
$`r(q)`$ 2.4
$`r(\tau ,z)`$ 5.2
$`𝒮_i`$ 3.3
$`𝕊^+`$ 5,5.2
$`𝕊_\omega ^+`$ 5.1
$`_i`$ 3.3
$`\mathrm{\Theta }\mathrm{\Pi }`$ 9.1
$`\stackrel{\mathrm{}}{}`$ 5.1
$`\overline{\tau (z)}`$ 5.1
$`\mathrm{𝐭𝐨𝐩}()`$ 2.2
$`U(\omega )`$ 5.1
$`Wh`$ 6.2
$`𝐗`$ 5.1
$`𝒳_i`$ 3.3
$`z_{},z_+`$ 5.1
$`Z(𝕊)`$ 5.3
$`Z(𝕊,\mathrm{\Lambda })`$ 5.3
$`Z(𝕊,a)`$ 7.1
$`Z(𝕊,ra)`$ 9
$`Z(𝕊,\mathrm{\Lambda },ra)`$ 9

Alexander Yu. Ol’shanskii
Department of Mathematics
Vanderbilt University
olsh@math.vanderbilt.edu
http://www.math.vanderbilt.edu/$``$olsh
and
Department of Higher Algebra, MEHMAT
Moscow State University
olshan@shabol.math.msu.su

Mark V. Sapir
Department of Mathematics
Vanderbilt University
http://www.math.vanderbilt.edu/$``$msapir