text:
# 1. Introduction

## 1. Introduction

Let $`F_m=x_1,\mathrm{},x_m`$ be the free group of a finite rank $`m2`$ on the set $`\{x_1,\mathrm{},x_m\}`$. The purpose of this paper is to present a positive solution to the following problem raised by Shpilrain :

Problem. Are there 2 elements $`u_1`$, $`u_2`$ in $`F_m`$ such that any endomorphism $`\psi `$ of $`F_m`$ with non-cyclic image is uniquely determined by $`\psi (u_1)`$, $`\psi (u_2)`$ ? (In other words, are there 2 elements $`u_1`$, $`u_2`$ in $`F_m`$ such that whenever $`\varphi (u_i)=\psi (u_i)`$, $`i=1,\mathrm{\hspace{0.17em}2}`$, for endomorphisms $`\varphi `$, $`\psi `$ of $`F_m`$ with non-cyclic images, it follows that $`\varphi =\psi `$ ?)

In , Ivanov solved in the affirmative this problem in the case where $`\psi `$ is a monomorphism of $`F_m`$ by constructing a so-called $`C`$-test word $`w_n(x_1,\mathrm{},x_n)`$ for each $`n2`$. A $`C`$-test word is defined due to Ivanov  as follows:

Definition. A non-empty word $`v(x_1,\mathrm{},x_n)`$ is a $`C`$-test word in $`n`$ letters for $`F_m`$ if for any two $`n`$-tuples $`(X_1,\mathrm{},X_n)`$, $`(Y_1,\mathrm{},Y_n)`$ of elements of $`F_m`$ the equality $`v(X_1,\mathrm{},X_n)=v(Y_1,\mathrm{},Y_n)1`$ implies the existence of an element $`SF_m`$ such that $`Y_i=SX_iS^1`$ for all $`i=1,\mathrm{\hspace{0.17em}2},\mathrm{},n`$.

According to the result of \[2, Corollary 1\], if $`v`$ is a $`C`$-test word in $`m`$ letters for $`F_m`$, $`\varphi `$ is an endomorphism, $`\psi `$ is a monomorphism of $`F_m`$, and $`\varphi (v)=\psi (v)`$, then we have $`\varphi =\tau _S\psi `$, where $`SF_m`$ is such that $`S,\psi (v)`$ is cyclic, and $`\tau _S`$ is the inner automorphism of $`F_m`$ defined by means of $`S`$. Notice that this assertion is no longer true if $`\psi `$ is extended to an endomorphism of $`F_m`$ with non-cyclic image, since the fact $`\psi (v)1`$ is no longer guaranteed. The efforts to extend the result of \[2, Corollary 1\] to the case where $`\psi `$ is an endomorphism of $`F_m`$ with non-cyclic image have led us to proving the following:

###### Theorem

For every $`n2`$ there exists a $`C`$-test word $`v_n(x_1,\mathrm{},x_n)`$ in $`n`$ letters for $`F_m`$ with the additional property that $`v_n(X_1,\mathrm{},X_n)=1`$ if and only if the subgroup $`X_1,\mathrm{},X_n`$ of $`F_m`$ generated by $`X_1,\mathrm{},X_n`$ is cyclic.

We construct such a $`C`$-test word $`v_n(x_1,\mathrm{},x_n)`$ by combining Ivanov’s $`C`$-test word $`w_2(x_1,x_2)`$ and an auxiliary word $`u(x_1,x_2)`$ defined below. Here, let us recall Ivanov’s $`C`$-test word $`w_2(x_1,x_2)`$:

$$\begin{array}{c}w_2(x_1,x_2)=[x_1^8,x_2^8]^{100}x_1[x_1^8,x_2^8]^{200}x_1[x_1^8,x_2^8]^{300}x_1^1[x_1^8,x_2^8]^{400}x_1^1\hfill \\ \hfill [x_1^8,x_2^8]^{500}x_2[x_1^8,x_2^8]^{600}x_2[x_1^8,x_2^8]^{700}x_2^1[x_1^8,x_2^8]^{800}x_2^1.\end{array}$$

We define an auxiliary word $`u(x_1,x_2)`$ as follows:

$$\begin{array}{c}u(x_1,x_2)=[x_1^{48},x_2^{40}]^{100}x_1^6[x_1^{48},x_2^{40}]^{200}x_1^6[x_1^{48},x_2^{40}]^{300}x_1^6[x_1^{48},x_2^{40}]^{400}x_1^6\hfill \\ \hfill [x_1^{48},x_2^{40}]^{500}x_2^5[x_1^{48},x_2^{40}]^{600}x_2^5[x_1^{48},x_2^{40}]^{700}x_2^5[x_1^{48},x_2^{40}]^{800}x_2^5.\end{array}$$
$`1.1`$
We then construct $`v_n(x_1,\mathrm{},x_n)`$ as follows: If $`n=2`$ then

$$v_2(x_1,x_2)=w_2(x_1,x_2).$$
$`1.2`$
If $`n=3`$ then

$$v_3(x_1,x_2,x_3)=u(u(v_2(x_1,x_2),v_2(x_2,x_3)),u(v_2(x_2,x_3),v_2(x_3,x_1))).$$
$`1.3`$
Inductively, for $`n4`$, define

$$\begin{array}{c}v_n(x_1,\mathrm{},x_n)=u(u(v_{n1}(x_1,x_2,x_3,\mathrm{},x_{n1}),v_{n1}(x_{n1},x_2,x_3,\mathrm{},x_{n2},x_n)),\hfill \\ \hfill u(v_{n1}(x_{n1},x_2,x_3,\mathrm{},x_{n2},x_n),v_{n1}(x_n,x_2,x_3\mathrm{},x_{n2},x_1))).\end{array}$$
$`1.4`$
For instance,

$$v_4(x_1,x_2,x_3,x_4)=u(u(v_3(x_1,x_2,x_3),v_3(x_3,x_2,x_4)),u(v_3(x_3,x_2,x_4),v_3(x_4,x_2,x_1))).$$
$`1.5`$
In Section 2, we establish several technical lemmas concerning properties of Ivanov’s word $`v_2(x_1,x_2)`$ and the auxiliary word $`u(x_1,x_2)`$ which will be used throughout this paper. In Sections 3–5, we prove that, for each $`n3`$, the word $`v_n(x_1,\mathrm{},x_n)`$ constructed above is indeed a $`C`$-test word with the property in the statement of the Theorem (the case $`n=2`$ is already proved in ). We first treat the case $`n=3`$ in Section 3, and then proceed by simultaneous induction on $`n`$ with base $`n=4`$ together with several necessary lemmas in Sections 4–5.

Once the Theorem is proved, our Corollary 1 that is an extended version of \[2, Corollary 1\] to the case where $`\psi `$ is an endomorphism of $`F_m`$ with non-cyclic image follows immediately, as intended, by taking $`u=v_m(x_1,\mathrm{},x_m)`$:

###### Corollary 1

There exists an element $`uF_m`$ such that if $`\varphi `$ is an endomorphism, $`\psi `$ is an endomorphism of $`F_m`$ with non-cyclic image, and $`\varphi (u)=\psi (u)`$, then $`\varphi `$ also has non-cyclic image, more precisely, $`\varphi =\tau _S\psi `$, where $`SF_m`$ is such that $`S,\psi (u)`$ is cyclic, and $`\tau _S`$ is the inner automorphism of $`F_m`$ defined by means of $`S`$.

In Corollary 2, we provide a positive solution to the Shpilrain’s problem mentioned above:

###### Corollary 2

There exist two elements $`u_1,u_2F_m`$ such that any endomorphism $`\psi `$ of $`F_m`$ with non-cyclic image is uniquely determined by $`\psi (u_1)`$, $`\psi (u_2)`$.

The proof of Corollary 2 makes use of the words $`v_m(x_1,\mathrm{},x_m)`$ and $`v_{m+1}(x_1,\mathrm{},x_{m+1})`$. Its detailed proof is given in Section 6. The idea and the techniques used in  are developed further in the present paper.

## 2. Preliminary Lemmas

We begin this section by establishing some notation and terminology. We let $`X`$, $`Y`$ (with or without subscript) be words in $`F_m`$ throughout this paper. By $`X=Y`$ we denote the equality in $`F_m`$ of words $`X`$ and $`Y`$, and by $`XY`$ the graphical (letter-by-letter) equality of words $`X`$ and $`Y`$. The length of a word $`X`$ is denoted by $`|X|`$ (note $`|x_1x_{1}^{}{}_{}{}^{1}|=2`$). We say that a word $`X`$ is a proper power if $`X=Y^{\mathrm{}}`$ for some $`Y`$ with $`\mathrm{}>1`$ and that a word $`A`$ is simple if $`A`$ is non-empty, cyclically reduced, and is not a proper power. If $`A`$ is simple, then an $`A`$-periodic word is a subword of $`A^k`$ with some $`k>0`$.

Now let us introduce several lemmas concerning properties of the word $`v_2(x_1,x_2)`$ defined by $`(1.2)`$. For proofs of Lemmas 1–2, see .

###### Lemma 1 \[2, Lemma 3\]

If the subgroup $`X_1,X_2`$ of $`F_m`$ is non-cyclic, then $`v_2(X_1,X_2)`$ is neither equal to the empty word nor a proper power. If $`X_1,X_2`$ is cyclic, then $`v_2(X_1,X_2)=1`$.

###### Lemma 2 \[2, Lemma 4\]

If the subgroup $`X_1,X_2`$ of $`F_m`$ is non-cyclic and $`v_2(X_1,X_2)=v_2(Y_1,Y_2)`$, then there exists a word $`ZF_m`$ such that

$$Y_1=ZX_1Z^1\text{and}Y_2=ZX_2Z^1.$$

###### Lemma 3

If the subgroup $`X_1,X_2`$ of $`F_m`$ is non-cyclic, then $`v_2(X_1,X_2)^1v_2(Y_1,Y_2)`$ for any words $`Y_1`$, $`Y_2`$.

###### Demonstration Proof

By way of contradiction, suppose that $`v_2(X_1,X_2)^1=v_2(Y_1,Y_2)`$ for some words $`Y_1`$, $`Y_2`$. If $`Y_1,Y_2`$ is cyclic, then it follows from Lemma 1 that $`v_2(Y_1,Y_2)=1`$, so that $`v_2(X_1,X_2)=1`$, i.e., $`X_1,X_2`$ is cyclic. This contradiction to the hypothesis of the lemma allows us to assume that $`Y_1,Y_2`$ is non-cyclic. As in \[2, Lemmas 1–4\], let $`W`$ be a cyclically reduced word that is conjugate to $`v_2(X_1,X_2)`$, and let $`B`$ be a simple word such that $`[X_1^8,X_2^8]`$ is conjugate to $`B`$ (recall from  that a commutator $`[A,B]`$ of two words $`A,B`$ is not a proper power). Then according to \[2, Lemma 2\], $`W`$ has the form

$$WR_1T_1R_2T_2\mathrm{}R_8T_8,$$

where $`R_i`$ are $`B`$-periodic words with $`(i10014)|B|<|R_i|i100|B|`$, $`0|T_i|<6|B|`$, and $`3488|B|<|W|<3648|B|`$. The same holds for $`v_2(Y_1,Y_2)`$ and attach the prime sign  to the notations for $`v_2(Y_1,Y_2)`$. Then the equality $`v_2(X_1,X_2)^1=v_2(Y_1,Y_2)`$ yields that $`W^1`$ is a cyclic permutation of $`W^{}`$, so that $`|W^1|=|W^{}|`$. At this point, apply the arguments in \[2, Lemma 4\] to $`W^1`$, $`W^{}`$ to get $`B^1B^{}`$ and that $`R_i^{}`$ $`B^{}`$-overlaps only with $`R_i^1`$ for each $`i=1,2,\mathrm{},8`$. But this is impossible, for if $`R_i^{}`$ $`B^{}`$-overlapped only with $`R_i^1`$ then $`R_{i+1}^{}`$ would have to $`B^{}`$-overlap only with $`R_{i1}^1`$ (indices modulo 8) by the order of indices in $`W^1T_8^1R_8^1\mathrm{}T_2^1R_2^1T_1^1R_1^1`$ and $`W^{}R_1^{}T_1^{}R_2^{}T_2^{}\mathrm{}R_8^{}T_8^{}`$. $`\mathrm{}`$

We also establish several lemmas concerning properties of the auxiliary word $`u(x_1,x_2)`$ defined by $`(1.1)`$.

###### Lemma 4

If the subgroup $`X_1,X_2`$ of $`F_m`$ is non-cyclic, then $`u(X_1,X_2)`$ is neither equal to the empty word nor a proper power. If $`X_1,X_2`$ is cyclic, then either $`u(X_1,X_2)`$ is equal to the empty word provided $`X_1^6=X_2^5`$ or otherwise $`u(X_1,X_2)`$ is a proper power.

###### Demonstration Proof

The proof of the first part is similar to that of \[2, Lemma 3\], and the second part is immediate from definition $`(1.1)`$ of $`u(x_1,x_2)`$. $`\mathrm{}`$

###### Lemma 5

If the subgroup $`X_1,X_2`$ of $`F_m`$ is non-cyclic and $`u(X_1,X_2)=u(Y_1,Y_2)`$, then there exists a word $`ZF_m`$ such that

$$Y_1=ZX_1Z^1\text{and}Y_2=ZX_2Z^1.$$

###### Demonstration Proof

Applying the same arguments as in \[2, Lemma 4\] to $`u(X_1,X_2)`$ and $`u(Y_1,Y_2)`$, we deduce that $`Y_1^6=ZX_1^6Z^1`$ and $`Y_2^5=ZX_2^5Z^1`$ for some word $`ZF_m`$. Since extraction of roots is unique in a free group, it follows that $`Y_1=ZX_1Z^1`$ and $`Y_2=ZX_2Z^1`$, as required. $`\mathrm{}`$

###### Lemma 6

If the subgroup $`X_1,X_2`$ of $`F_m`$ is non-cyclic, then $`u(X_1,X_2)^1u(Y_1,Y_2)`$ for any words $`Y_1`$, $`Y_2`$.

###### Demonstration Proof

Suppose to the contrary that $`u(X_1,X_2)^1=u(Y_1,Y_2)`$ for some words $`Y_1`$, $`Y_2`$. Then the subgroup $`Y_1,Y_2`$ of $`F_m`$ is non-cyclic, for otherwise the equality $`u(X_1,X_2)^1=u(Y_1,Y_2)`$ would yield that $`u(X_1,X_2)=u(Y_1,Y_2)^1=u(Y_1^1,Y_2^1)`$, contrary to Lemma 4. From here on, follow the proof of Lemma 3 to arrive at a contradiction. $`\mathrm{}`$

###### Lemma 7

If the subgroup $`X_1,X_2`$ of $`F_m`$ is non-cyclic, then, for each $`i=1,\mathrm{\hspace{0.17em}2}`$, the subgroup $`X_i,u(X_1,X_2)`$ of $`F_m`$ is also non-cyclic.

###### Demonstration Proof

Suppose on the contrary that $`X_i,u(X_1,X_2)`$ is cyclic for some $`i=1,\mathrm{\hspace{0.17em}2}`$. Then by Lemma 4 we have

$$X_i=u(X_1,X_2)^{\mathrm{}}$$
$`2.1`$
for some non-zero integer $`\mathrm{}`$. Let $`U`$ be a cyclically reduced word that is conjugate to $`u(X_1,X_2)`$, and let $`C`$ be a simple word such that $`[X_1^{48},X_2^{40}]`$ is conjugate to $`C`$. By $`\overline{X}`$, we denote a cyclically reduced word that is conjugate to a word $`X`$ in $`F_m`$. Then by the same arguments as in \[2, Lemma 1\],

$$\text{max}(|\overline{X_1}|,|\overline{X_2}|)<6|C|,$$

and also by the same arguments as in \[2, Lemma 2\], $`U`$ has the form

$$UQ_1S_1Q_2S_2\mathrm{}Q_8S_8,$$

where $`Q_i`$ are $`C`$-periodic words with $`(i10014)|C|<|Q_i|i100|C|`$, $`0|S_i|<6|C|`$ and $`3488|C|<|U|<3648|C|`$. This yields that

$$|\overline{X_i}|<6|C|<3488|C|<|U|=|\overline{u(X_1,X_2)}||\overline{u(X_1,X_2)^{\mathrm{}}}|,$$

which contradicts equality $`(2.1)`$. $`\mathrm{}`$

In the following lemma which will be useful in Sections 4–6, the word $`v_n(x_1,\mathrm{},x_n)`$ with $`n3`$ is defined by $`(1.3)`$$`(1.4)`$.

###### Lemma 8

If both $`v_2(X_1,X_2)`$ and $`v_n(Y_1,\mathrm{},Y_n)`$ with $`n3`$ are neither equal to the empty word nor proper powers, then the subgroup $`v_2(X_1,X_2),v_n(Y_1,\mathrm{},Y_n)`$ of $`F_m`$ is non-cyclic.

###### Demonstration Proof

Suppose on the contrary that $`v_2(X_1,X_2),v_n(Y_1,\mathrm{},Y_n)`$ is cyclic. It then follows from the hypothesis of the lemma that

$$\text{either}v_2(X_1,X_2)=v_n(Y_1,\mathrm{},Y_n)\text{or}v_2(X_1,X_2)^1=v_n(Y_1,\mathrm{},Y_n).$$

This implies, by definition $`(1.3)`$$`(1.4)`$ of $`v_n(x_1,\mathrm{},x_n)`$, the existence of words $`Z_1`$, $`Z_2`$ in $`F_m`$ such that

$$\text{either}v_2(X_1,X_2)=u(Z_1,Z_2)\text{or}v_2(X_1,X_2)^1=u(Z_1,Z_2).$$

But since a similar argument to that in Lemma 3 shows that the latter equality cannot hold, the former must hold. From here on, follow the arguments in \[2, Lemma 4\] to obtain that

$$B^\alpha \stackrel{~}{X_1}B^\alpha =\stackrel{~}{Z_1^6}\text{and}B^\alpha \stackrel{~}{X_1}^1B^\alpha =\stackrel{~}{Z_1^6},$$

where $`\stackrel{~}{X_i}`$, $`\stackrel{~}{Z_i}`$ are conjugates of $`X_i`$, $`Z_i`$, respectively, and $`B`$ is a simple word such that $`B=[\stackrel{~}{X_1}^8,\stackrel{~}{X_2}^8]`$. This yields $`\stackrel{~}{X_1}^2=1`$, i.e., $`\stackrel{~}{X_1}=1`$, contrary to the hypothesis $`v_2(X_1,X_2)1`$. $`\mathrm{}`$

## 3. The case $`n=3`$

In this section, we prove that $`v_3(x_1,x_2,x_3)`$ is a $`C`$-test word with the additional property that $`v_3(X_1,X_2,X_3)=1`$ if and only if the subgroup $`X_1,X_2,X_3`$ of $`F_m`$ is cyclic. We begin with lemmas that play crucial roles in proving this assertion.

###### Lemma 9

If $`u(v_2(X_1,X_2),v_2(Y_1,Y_2))=1`$, then $`v_2(X_1,X_2)=1`$ and $`v_2(Y_1,Y_2)=1`$.

###### Demonstration Proof

The hypothesis of the lemma implies by Lemma 4 that $`v_2(X_1,X_2)^6=v_2(Y_1,Y_2)^5`$; hence if one of $`v_2(X_1,X_2)`$ and $`v_2(Y_1,Y_2)`$ is equal to the empty word, then so is the other. So assume that $`v_2(X_1,X_2)1`$ and $`v_2(Y_1,Y_2)1`$. Notice that the equality $`v_2(X_1,X_2)^6=v_2(Y_1,Y_2)^5`$ implies that $`v_2(X_1,X_2),v_2(Y_1,Y_2)`$ is cyclic. Hence, in view of Lemmas 1 and 3, we have $`v_2(X_1,X_2)=v_2(Y_1,Y_2)`$. This together with $`v_2(X_1,X_2)^6=v_2(Y_1,Y_2)^5`$ yields that $`v_2(X_1,X_2)=v_2(Y_1,Y_2)=1`$, contrary to our assumption. $`\mathrm{}`$

###### Lemma 10

Suppose that the subgroup $`X_1,X_2,X_3`$ of $`F_m`$ is non-cyclic. Then $`v_3(X_1,X_2,X_3)1`$. Furthermore, either $`v_3(X_1,X_2,X_3)`$ is not a proper power or it has one of the following three forms:

$`(A1)v_3(X_1,X_2,X_3)`$ $`=v_2(X_2,X_3)^{960}`$ $`\text{and}X_1=1;`$
$`(A2)v_3(X_1,X_2,X_3)`$ $`=v_2(X_3,X_1)^{400}`$ $`\text{and}X_2=1;`$
$`(A3)v_3(X_1,X_2,X_3)`$ $`=v_2(X_1,X_2)^{576}`$ $`\text{and}X_3=1.`$
###### Remark

In view of Lemma 1, $`v_2(X_2,X_3)`$, $`v_2(X_3,X_1)`$, $`v_2(X_1,X_2)`$ in $`(A1)`$, $`(A2)`$, $`(A3)`$, respectively, are neither equal to the empty word nor proper powers.

###### Demonstration Proof

Recall from $`(1.3)`$ that

$$v_3(X_1,X_2,X_3)=u(u(v_2(X_1,X_2),v_2(X_2,X_3)),u(v_2(X_2,X_3),v_2(X_3,X_1))).$$

In the case where the subgroup $`u(v_2(X_1,X_2),v_2(X_2,X_3)),u(v_2(X_2,X_3),v_2(X_3,X_1))`$ of $`F_m`$ is non-cyclic, the assertion that $`v_3(X_1,X_2,X_3)`$ is neither equal to the empty word nor a proper power, as desired, follows immediately from Lemma 4. So we only need to consider the case where

$$\text{the subgroup}u(v_2(X_1,X_2),v_2(X_2,X_3)),u(v_2(X_2,X_3),v_2(X_3,X_1))\text{is cyclic.}$$
$`3.1`$
Here, if $`u(v_2(X_1,X_2),v_2(X_2,X_3))=u(v_2(X_2,X_3),v_2(X_3,X_1))=1`$, then Lemma 9 implies that $`v_2(X_1,X_2)=v_2(X_2,X_3)=v_2(X_3,X_1)=1`$; hence, by Lemma 1, $`X_1,X_2`$, $`X_2,X_3`$ and $`X_3,X_1`$ are all cyclic. This yields that $`X_1,X_2,X_3`$ is cyclic, contrary to the hypothesis of the lemma. Thus, at least one of the words $`u(v_2(X_1,X_2),v_2(X_2,X_3))`$ and $`u(v_2(X_2,X_3),v_2(X_3,X_1))`$ has to be not equal to the empty word. We divide this situation into three cases.

###### Case I

$`u(v_2(X_1,X_2),v_2(X_2,X_3))1`$ and $`u(v_2(X_2,X_3),v_2(X_3,X_1))=1`$.

It follows from $`u(v_2(X_2,X_3),v_2(X_3,X_1))=1`$ and Lemma 9 that $`v_2(X_2,X_3)=v_2(X_3,X_1)=1`$; so, by Lemma 1, $`X_2,X_3`$ and $`X_3,X_1`$ are cyclic. Since $`X_1,X_2,X_3`$ is non-cyclic, $`X_3`$ must be equal to the empty word; hence we have

$$\begin{array}{cc}\hfill v_3(X_1,X_2,X_3)& =u(u(v_2(X_1,X_2),1),\mathrm{\hspace{0.17em}1})=u(v_2(X_1,X_2)^{24},1)\hfill \\ & =v_2(X_1,X_2)^{2424}=v_2(X_1,X_2)^{576}.\hfill \end{array}$$

Therefore $`v_3(X_1,X_2,X_3)`$ has form $`(A3)`$ in this case.

###### Case II

$`u(v_2(X_1,X_2),v_2(X_2,X_3))=1`$ and $`u(v_2(X_2,X_3),v_2(X_3,X_1))1`$.

Since $`u(v_2(X_1,X_2),v_2(X_2,X_3))=1`$, we have, by Lemmas 1 and 9, that $`X_1,X_2`$ and $`X_2,X_3`$ are cyclic, so that $`X_2=1`$; thus

$$\begin{array}{cc}\hfill v_3(X_1,X_2,X_3)& =u(1,u(1,v_2(X_3,X_1)))=u(1,v_2(X_3,X_1)^{20})\hfill \\ & =v_2(X_3,X_1)^{2020}=v_2(X_3,X_1)^{400}.\hfill \end{array}$$

Therefore $`v_3(X_1,X_2,X_3)`$ has form $`(A2)`$ in this case.

###### Case III

$`u(v_2(X_1,X_2),v_2(X_2,X_3))1`$ and $`u(v_2(X_2,X_3),v_2(X_3,X_1))1`$.

In this case, we want to prove:

###### Claim

This case is reduced to the following two cases:

$$\begin{array}{cc}& \text{(i)}v_2(X_1,X_2),v_2(X_2,X_3),v_2(X_3,X_1)\text{is cyclic};\hfill \\ & \text{(ii)}\text{both}v_2(X_1,X_2),v_2(X_2,X_3)\text{and}v_2(X_2,X_3),v_2(X_3,X_1)\text{are non-cyclic}.\hfill \end{array}$$

###### Demonstration Proof of the Claim

Assuming at least one of $`v_2(X_1,X_2),v_2(X_2,X_3)`$ and $`v_2(X_2,X_3),v_2(X_3,X_1)`$ is cyclic, we want to show that Case (i) occurs. Let us say that $`v_2(X_1,X_2),v_2(X_2,X_3)`$ is cyclic (the case where $`v_2(X_2,X_3),v_2(X_3,X_1)`$ is cyclic is analogous). If $`v_2(X_2,X_3)=1`$, then $`u(v_2(X_1,X_2),v_2(X_2,X_3))=v_2(X_1,X_2)^{24}`$ and $`u(v_2(X_2,X_3),v_2(X_3,X_1))=v_2(X_3,X_1)^{20}`$. It then follows from $`(3.1)`$ that $`v_2(X_1,X_2),v_2(X_3,X_1)`$ is cyclic, which means that Case (i) occurs. Now let $`v_2(X_2,X_3)1`$. Then since $`v_2(X_1,X_2),v_2(X_2,X_3)`$ is cyclic, $`(3.1)`$ yields by Lemma 7 that $`v_2(X_2,X_3),v_2(X_3,X_1)`$ is also cyclic; hence $`v_2(X_1,X_2),v_2(X_2,X_3),v_2(X_3,X_1)`$ is cyclic, that is, Case (i) occurs as well. $`\mathrm{}`$

Case (i) is again divided into subcases according to the number of non-empty words among $`v_2(X_1,X_2)`$, $`v_2(X_2,X_3)`$ and $`v_2(X_3,X_1)`$. Here, we note that if there exists only one non-empty word, then it has to be $`v_2(X_2,X_3)`$, for otherwise we would have a contradiction to the hypothesis of Case III. Therefore, Case III is decomposed into the following six subcases.

###### Case III.1

$`v_2(X_1,X_2)=v_2(X_3,X_1)=1`$ and $`v_2(X_2,X_3)1`$.

In this case, it follows from Lemma 1 that $`X_1,X_2`$ and $`X_3,X_1`$ are cyclic, so that $`X_1=1`$; hence we have

$$\begin{array}{cc}\hfill v_3(X_1,X_2,X_3)& =u(u(1,v_2(X_2,X_3)),u(v_2(X_2,X_3),1))=u(v_2(X_2,X_3)^{20},v_2(X_2,X_3)^{24})\hfill \\ & =v_2(X_2,X_3)^{2024+2420}=v_2(X_2,X_3)^{960}.\hfill \end{array}$$

Thus, $`v_3(X_1,X_2,X_3)`$ has form $`(A1)`$.

###### Case III.2

$`v_2(X_1,X_2)=1`$ and $`1v_2(X_2,X_3),1v_2(X_3,X_1)`$ is cyclic.

Since $`v_2(X_1,X_2)=1`$, we have by Lemma 1 that $`X_1,X_2`$ is cyclic. Also since $`1v_2(X_2,X_3),1v_2(X_3,X_1)`$ is cyclic, we have $`1v_2(X_2,X_3)=v_2(X_3,X_1)`$ by Lemmas 1 and 3. Apply Lemma 2 to this equality: there exists a word $`SF_m`$ such that

$$X_2=SX_3S^1\text{and}X_3=SX_1S^1,$$

which yields that $`S^1X_2S=SX_1S^1`$, so that $`X_2=S^2X_1S^2`$. It then follows from $`X_1,X_2`$ being cyclic that $`S,X_1,X_2`$ is cyclic. This together with the equality $`X_3=SX_1S^1`$ implies that $`X_1,X_2,X_3`$ is cyclic, contrary to the hypothesis of the lemma. Therefore this case cannot occur.

###### Case III.3

$`v_2(X_2,X_3)=1`$ and $`1v_2(X_1,X_2),1v_2(X_3,X_1)`$ is cyclic.

Repeat a similar argument to that in Case III.2 to conclude that this case cannot occur.

###### Case III.4

$`v_2(X_3,X_1)=1`$ and $`1v_2(X_1,X_2),1v_2(X_2,X_3)`$ is cyclic.

Also repeat a similar argument to that in Case III.2 to conclude that this case cannot occur.

###### Case III.5

$`1v_2(X_1,X_2),1v_2(X_2,X_3),1v_2(X_3,X_1)`$ is cyclic.

In this case, it follows from Lemmas 1 and 3 that

$$1v_2(X_1,X_2)=v_2(X_2,X_3)=v_2(X_3,X_1).$$
$`3.2`$
Applying Lemma 2 to these equalities, we have the existence of words $`T_1`$ and $`T_2`$ in $`F_m`$ such that

$`X_1=T_1X_2T_1^1,X_2=T_1X_3T_1^1;`$ $`3.3`$
$`X_2=T_2X_3T_2^1,X_3=T_2X_1T_2^1.`$
Combining $`(3.2)`$ and $`(3.3)`$ yields that $`T_1^1T_2,X_3`$, $`T_1,v_2(X_2,X_3)`$ and $`T_2,v_2(X_3,X_1)`$ are all cyclic. At this point, we apply Ivanov’s argument (see \[2, pp. 403–404\]) to obtain the following:

###### Claim (Ivanov)

$`T_1=T_2`$.

###### Demonstration Proof of the Claim

Suppose on the contrary that $`T_1T_2`$. It then follows from $`T_1^1T_2,X_3`$ being cyclic that

$$X_3^\mathrm{}_1=(T_1^1T_2)^\mathrm{}_2$$
$`3.4`$
with nonzero integers $`\mathrm{}_1`$ and $`\mathrm{}_2`$. It also follows from $`T_1,v_2(X_2,X_3)`$ and $`T_2,v_2(X_3,X_1)`$ being cyclic that

$$T_1=v_2(X_2,X_3)^\mathrm{}_3\text{and}T_2=v_2(X_3,X_1)^\mathrm{}_4,$$

with integers $`l_3`$ and $`l_4`$ at least one of which is non-zero, so that

$$T_1^1T_2=v_2(X_2,X_3)^\mathrm{}_3v_2(X_3,X_1)^\mathrm{}_4.$$

Hence, by $`(3.4)`$,

$$X_3^\mathrm{}_1=[v_2(X_2,X_3)^\mathrm{}_3v_2(X_3,X_1)^\mathrm{}_4]^\mathrm{}_2.$$
$`3.5`$
Note, by definition $`(1.2)`$ of $`v_2(x_1,x_2)`$, that the right hand side of equality $`(3.5)`$ belongs to the subgroup $`[F_m,𝒩_3]`$, where $`𝒩_3`$ is the normal closure in $`F_m`$ of the word $`X_3`$. So inside the relation module $`\widehat{𝒩}_3=𝒩_3/[𝒩_3,𝒩_3]`$ of the one-relator group

$$G=x_1,\mathrm{},x_mX_3,$$

equality $`(3.5)`$ can be expressed as

$$(\mathrm{}_1P)\widehat{X}_3=0,$$

where $`P`$ is an element of the augmentation ideal of the group ring $`(G)`$ of $`G`$ over the integers and $`\widehat{X}_3`$ is the canonical generator of the relation module $`\widehat{𝒩}_3`$ of $`G`$. By Lyndon’s result on the relation module $``$ of a one-relator group $`x_1,\mathrm{},x_mR`$ (see ) which says that if $`Q\widehat{R}=0`$ in $``$ then $`Q`$ is an element of the augmentation ideal of $`(x_1,\mathrm{},x_mR)`$, we must have $`\mathrm{}_1=0`$. This contradiction to the fact $`\mathrm{}_10`$ completes the proof of the claim. $`\mathrm{}`$

If $`T_1=T_2=1`$, then equalities $`(3.3)`$ yield that $`X_1=X_2=X_3`$, contrary to the hypothesis of the lemma. If $`T_1=T_21`$, then we derive from equalities $`(3.3)`$ that

$$X_1=T_1^3X_1T_1^3,X_2=T_1^3X_2T_1^3\text{and}X_3=T_1^3X_3T_1^3,$$

so that $`T_1,X_1`$, $`T_1,X_2`$ and $`T_1,X_3`$ are all cyclic; therefore, $`X_1,X_2,X_3`$ is cyclic. A contradiction implies that this case cannot occur.

###### Case III.6

Both $`v_2(X_1,X_2),v_2(X_2,X_3)`$ and $`v_2(X_2,X_3),v_2(X_3X_1)`$ are non-cyclic.

In this case, in view of $`(3.1)`$ and Lemmas 4 and 6, we have that

$$u(v_2(X_1,X_2),v_2(X_2,X_3))=u(v_2(X_2,X_3),v_2(X_3,X_1)),$$

so by Lemma 5 that there exists a word $`TF_m`$ such that

$$1v_2(X_1,X_2)=Tv_2(X_2,X_3)T^1\text{and}1v_2(X_2,X_3)=Tv_2(X_3,X_1)T^1.$$
$`3.6`$
Apply Lemma 2 to these equalities: there exist words $`U_1`$ and $`U_2`$ in $`F_m`$ such that

$`X_1=U_1X_2U_1^1,X_2=U_1X_3U_1^1;`$ $`3.7`$
$`X_2=U_2X_3U_2^1,X_3=U_2X_1U_2^1.`$
Combining the equalities in $`(3.6)`$ and $`(3.7)`$, we deduce that $`U_1^1U_2,X_3`$, $`T^1U_1,v_2(X_2,X_3)`$ and $`T^1U_2,v_2(X_3,X_1)`$ are cyclic. Here, apply Ivanov’s argument used in Case III.5 to get $`U_1=U_2`$. Then reasoning as in Case III.5, we conclude that this case cannot occur.

The proof of Lemma 10 is complete. $`\mathrm{}`$

Now we are ready to prove the Theorem for the case $`n=3`$.

###### Demonstration Proof of the Theorem ($`n=3`$)

The additional property that $`v_3(X_1,X_2,X_3)=1`$ if and only if the subgroup $`X_1,X_2,X_3`$ of $`F_m`$ is cyclic follows immediately from definition $`(1.3)`$ of $`v_3(x_1,x_2,x_3)`$ and Lemma 10. So we only need to prove that $`v_3(x_1,x_2,x_3)`$ is a $`C`$-test word, that is, supposing $`1v_3(X_1,X_2,X_3)=v_3(Y_1,Y_2,Y_3)`$, we want to prove the existence of a word $`ZF_m`$ such that

$$Y_i=ZX_iZ^1\text{for}\text{all}i=1,\mathrm{\hspace{0.17em}2},\mathrm{\hspace{0.17em}3}.$$

We begin by dividing into two cases according to whether $`v_3(X_1,X_2,X_3)`$ is a proper power or not.

###### Case I

$`v_3(X_1,X_2,X_3)`$ is a proper power.

Applying Lemma 10 to $`v_3(X_1,X_2,X_3)`$ and $`v_3(Y_1,Y_2,Y_3)`$, we have: $`v_3(X_1,X_2,X_3)`$ has one of three types $`(A1)`$, $`(A2)`$ and $`(A3)`$; besides, by the equality $`v_3(X_1,X_2,X_3)=v_3(Y_1,Y_2,Y_3)`$, $`v_3(Y_1,Y_2,Y_3)`$ has the same type as $`v_3(X_1,X_2,X_3)`$, because the exponents in $`(A1)`$, $`(A2)`$ and $`(A3)`$ are all distinct. This gives us only three possibilities $`(A1)\&(A1)`$, $`(A2)\&(A2)`$ and $`(A3)\&(A3)`$ for the types of $`v_3(X_1,X_2,X_3)\&v_3(Y_1,Y_2,Y_3)`$.

If $`v_3(X_1,X_2,X_3)\&v_3(Y_1,Y_2,Y_3)`$ is of type $`(A1)\&(A1)`$ ($`(A2)\&(A2)`$ or $`(A3)\&(A3)`$ is similar), then

$$X_1=Y_1=1\text{and}1v_2(X_2,X_3)^{960}=v_2(Y_2,Y_3)^{960}.$$

Applying Lemma 2 to the equality $`1v_2(X_2,X_3)=v_2(Y_2,Y_3)`$, we have that two $`2`$-tuples $`(X_2,X_3)`$ and $`(Y_2,Y_3)`$ are conjugate in $`F_m`$, which together with $`X_1=Y_1=1`$ yields that two $`3`$-tuples $`(X_1,X_2,X_3)`$ and $`(Y_1,Y_2,Y_3)`$ are conjugate in $`F_m`$, as desired.

###### Case II

$`v_3(X_1,X_2,X_3)`$ is not a proper power.

In this case, it follows from Lemma 4 that

$$\text{the subgroup}u(v_2(X_1,X_2),v_2(X_2,X_3)),u(v_2(X_2,X_3),v_2(X_3,X_1))\text{of}F_m\text{is non-cyclic}.$$
$`3.8`$
This enables us to apply Lemma 5 to the equality $`v_3(X_1,X_2,X_3)=v_3(Y_1,Y_2,Y_3)`$: for some word $`SF_m`$, we have

$`1u(v_2(X_1,X_2),v_2(X_2,X_3))=Su(v_2(Y_1,Y_2),v_2(Y_2,Y_3))S^1,`$ $`3.9`$
$`1u(v_2(X_2,X_3),v_2(X_3,X_1))=Su(v_2(Y_2,Y_3),v_2(Y_3,Y_1))S^1.`$
Here, we consider two subcases.

###### Case II.1

One of $`v_2(X_1,X_2),v_2(X_2,X_3)`$ and $`v_2(X_2,X_3),v_2(X_3,X_1)`$ is non-cyclic.

Let us say that $`v_2(X_1,X_2),v_2(X_2,X_3)`$ is non-cyclic (the case where $`v_2(X_2,X_3),v_2(X_3,X_1)`$ is non-cyclic is analogous). Then, by Lemma 5, the first equality of $`(3.9)`$ implies the existence of a word $`WF_m`$ such that

$$1v_2(X_1,X_2)=Wv_2(Y_1,Y_2)W^1\text{and}1v_2(X_2,X_3)=Wv_2(Y_2,Y_3)W^1.$$
$`3.10`$
Apply Lemma 2 to these equalities: there exist words $`T_1`$ and $`T_2`$ in $`F_m`$ such that

$`X_1=T_1Y_1T_1^1,X_2=T_1Y_2T_1^1;`$ $`3.11`$
$`X_2=T_2Y_2T_2^1,X_3=T_2Y_3T_2^1.`$
Now applying Ivanov’s argument introduced in Case III.5 of Lemma 10 to equalities $`(3.10)`$$`(3.11)`$, we get $`T_1=T_2`$, by which equalities $`(3.11)`$ yield the desired result.

###### Case II.2

Both $`v_2(X_1,X_2),v_2(X_2,X_3)`$ and $`v_2(X_2,X_3),v_2(X_3,X_1)`$ are cyclic.

In this case, if $`v_2(X_2,X_3)1`$, then the subgroup $`v_2(X_1,X_2),v_2(X_2,X_3),v_2(X_3,X_1)`$ would be cyclic, contrary to $`(3.8)`$. So $`v_2(X_2,X_3)`$ must be equal to the empty word. On the other hand, equalities $`(3.9)`$ imply by Lemma 4 that both $`v_2(Y_1,Y_2),v_2(Y_2,Y_3)`$ and $`v_2(Y_2,Y_3),v_2(Y_3,Y_1)`$ are also cyclic. Then, for the same reason as $`v_2(X_2,X_3)`$, $`v_2(Y_2,Y_3)`$ also has to be equal to the empty word.

Thus, it follows from $`(3.9)`$ that

$$1v_2(X_1,X_2)^{24}=Sv_2(Y_1,Y_2)^{24}S^1\text{and}1v_2(X_3,X_1)^{20}=Sv_2(Y_3,Y_1)^{20}S^1,$$

that is,

$$1v_2(X_1,X_2)=Sv_2(Y_1,Y_2)S^1\text{and}1v_2(X_3,X_1)=Sv_2(Y_3,Y_1)S^1,$$

which is a similar situation to $`(3.10)`$. So from here on, we can follow the proof of Case II.1 to obtain the desired result.

The proof of the Theorem for the case $`n=3`$ is complete. $`\mathrm{}`$

## 4. The base $`n=4`$ of simultaneous induction

In this section, we prove the base step $`n=4`$ of simultaneous induction which we use in Lemmas 11–13 and the Theorem.

###### Lemma 11 (n=4)

If both $`v_2(X_1,X_2)`$ and $`v_3(Y_1,Y_2,Y_3)`$ are neither equal to the empty word nor proper powers, then $`v_2(X_1,X_2),v_3(Y_1,Y_2,Y_3)`$ is non-cyclic.

###### Demonstration Proof

This is a special case of Lemma 8. $`\mathrm{}`$

###### Lemma 12 (n=4)

If $`u(v_3(X_1,X_2,X_3),v_3(Y_1,Y_2,Y_3))=1`$, $`v_3(X_1,X_2,X_3)=v_3(Y_1,Y_2,Y_3)=1`$.

###### Demonstration Proof

By Lemma 4, the hypothesis of the lemma implies that

$$v_3(X_1,X_2,X_3)^6=v_3(Y_1,Y_2,Y_3)^5,$$
$`4.1`$
so that if one of $`v_3(X_1,X_2,X_3)`$ and $`v_3(Y_1,Y_2,Y_3)`$ is equal to the empty word, then so is the other. Hence assume that $`v_3(X_1,X_2,X_3)1`$ and $`v_3(Y_1,Y_2,Y_3)1`$.

If one of $`v_3(X_1,X_2,X_3)`$ and $`v_3(Y_1,Y_2,Y_3)`$ is a proper power, then so is the other by $`(4.1)`$, because $`6`$ and $`5`$ are relatively prime. Hence by Lemma 10 $`v_3(X_1,X_2,X_3)\&v_3(Y_1,Y_2,Y_3)`$ has nine possible types, and we can easily check that $`6`$ times any of $`960`$, $`400`$ and $`576`$ never equals $`5`$ times any of these, which means that equality $`(4.1)`$ cannot hold in any case, a contradiction.

If neither $`v_3(X_1,X_2,X_3)`$ nor $`v_3(Y_1,Y_2,Y_3)`$ is a proper power, then by Lemma 6 we have $`v_3(X_1,X_2,X_3)=v_3(Y_1,Y_2,Y_3)`$, because $`(4.1)`$ implies that $`v_3(X_1,X_2,X_3),v_3(Y_1,Y_2,Y_3)`$ is cyclic. This equality together with $`(4.1)`$ yields that $`v_3(X_1,X_2,X_3)=v_3(Y_1,Y_2,Y_3)=1`$, contrary to our assumption. This completes the proof. $`\mathrm{}`$

###### Lemma 13 (n=4)

Suppose that $`X_1,X_2,X_3,X_4`$ is non-cyclic. Then $`v_4(X_1,X_2,X_3,X_4)1`$. Furthermore, either $`v_4(X_1,X_2,X_3,X_4)`$ is not a proper power or it has one of the following four forms:

$`(B1)v_4(X_1,X_2,X_3,X_4)`$ $`=v_2(X_4,X_3)^{960400}`$ $`\text{and}X_1=X_2=1;`$
$`(B2)v_4(X_1,X_2,X_3,X_4)`$ $`=v_2(X_1,X_4)^{400^2}`$ $`\text{and}X_2=X_3=1;`$
$`(B3)v_4(X_1,X_2,X_3,X_4)`$ $`=v_2(X_3,X_1)^{576400}`$ $`\text{and}X_2=X_4=1;`$
$`(B4)v_4(X_1,X_2,X_3,X_4)`$ $`=v_3(X_1,X_2,X_3)^{1936}`$ $`\text{and}X_1=X_3=X_41.`$
###### Remark

In view of Lemmas 1 and 10, $`v_2(X_4,X_3)`$, $`v_2(X_1,X_4)`$, $`v_2(X_3,X_1)`$ and $`v_3(X_1,X_2,X_3)`$ in $`(B1)`$, $`(B2)`$, $`(B3)`$ and $`(B4)`$, respectively, are neither equal to the empty word nor proper powers.

###### Demonstration Proof

Recall from $`(1.5)`$ that

$$v_4(X_1,X_2,X_3,X_4)=u(u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)),u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1))).$$

If $`u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)),u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1))`$ is non-cyclic, then the assertion that $`v_4(X_1,X_2,X_3,X_4)`$ is neither equal to the empty word nor a proper power, as desired, follows directly from Lemma 4. So we only need to consider the case where

$$u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)),u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1))\text{is cyclic}.$$
$`4.2`$
Here, in order to avoid a contradiction to the hypothesis that $`X_1,X_2,X_3,X_4`$ is non-cyclic, at least one of $`u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4))`$ and $`u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1))`$ has to be not equal to the empty word. So we have three cases to consider.

###### Case I

$`u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4))1`$ and $`u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1))=1.`$

In this case, we have, by Lemma 12 ($`n=4`$) and the Theorem ($`n=3`$), that both $`X_3,X_2,X_4`$ and $`X_4,X_2,X_1`$ are cyclic. Since $`X_1,X_2,X_3,X_4`$ is non-cyclic, $`X_2`$ and $`X_4`$ must be equal to the empty word; hence we have

$$\begin{array}{cc}\hfill v_4(X_1,X_2,X_3,X_4)& =u(u(v_3(X_1,X_2,X_3),1),\mathrm{\hspace{0.17em}1})\hfill \\ & =u(v_3(X_1,X_2,X_3)^{24},1)=v_3(X_1,X_2,X_3)^{2424}\hfill \\ & =v_2(X_3,X_1)^{576400}\text{by form}(A2).\hfill \end{array}$$

Therefore, $`v_4(X_1,X_2,X_3,X_4)`$ has form $`(B3)`$ in this case.

###### Case II

$`u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4))=1`$ and $`u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1))1.`$

In this case, by Lemma 12 ($`n=4`$) and the Theorem ($`n=3`$), we have that both $`X_1,X_2,X_3`$ and $`X_3,X_2,X_4`$ are cyclic, so that $`X_2=X_3=1`$; thus

$$\begin{array}{cc}\hfill v_4(X_1,X_2,X_3,X_4)& =u(1,u(1,v_3(X_4,X_2,X_1)))\hfill \\ & =u(1,v_3(X_4,X_2,X_1)^{20})=v_3(X_4,X_2,X_1)^{2020}\hfill \\ & =v_2(X_1,X_4)^{400400}\text{by form}(A2).\hfill \end{array}$$

Therefore, $`v_4(X_1,X_2,X_3,X_4)`$ has form $`(B2)`$ in this case.

###### Case III

$`u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4))1`$ and $`u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1))1.`$

By reasoning as in Case III of Lemma 10, we break this case into the following six subcases.

###### Case III.1

$`v_3(X_1,X_2,X_3)=v_3(X_4,X_2,X_1)=1`$ and $`v_3(X_3,X_2,X_4)1`$.

It follows from the Theorem ($`n=3`$) that $`X_1,X_2,X_3`$ and $`X_4,X_2,X_1`$ are cyclic, so that $`X_1=X_2=1`$; hence we have

$$\begin{array}{cc}\hfill v_4(X_1,X_2,X_3,X_4)& =u(u(1,v_3(X_3,X_2,X_4)),u(v_3(X_3,X_2,X_4),1))\hfill \\ & =u(v_3(X_3,X_2,X_4)^{20},v_3(X_3,X_2,X_4)^{24})=v_3(X_3,X_2,X_4)^{2024+2420}\hfill \\ & =v_2(X_4,X_3)^{960400}\text{by form}(A2).\hfill \end{array}$$

Thus, $`v_4(X_1,X_2,X_3,X_4)`$ has form $`(B1)`$.

###### Case III.2

$`v_3(X_1,X_2,X_3)=1`$ and $`1v_3(X_3,X_2,X_4),1v_3(X_4,X_2,X_1)`$ is cyclic.

Since $`v_3(X_1,X_2,X_3)=1`$, we have, by the Theorem ($`n=3`$), that

$$X_1,X_2,X_3\text{is}\text{cyclic}.$$
$`4.3`$
Also since $`1v_3(X_3,X_2,X_4),1v_3(X_4,X_2,X_1)`$ is cyclic, in view of Lemmas 10 and 11 ($`n=4`$), this case is reduced to the following two cases:

$$\begin{array}{cc}& \text{(i)}\text{both}v_3(X_3,X_2,X_4)\text{and}v_3(X_4,X_2,X_1)\text{are proper powers};\hfill \\ & \text{(ii)}\text{neither}v_3(X_3,X_2,X_4)\text{nor}v_3(X_4,X_2,X_1)\text{is a proper power.}\hfill \end{array}$$

Case (i) is divided further into subcases according to types of $`v_3(X_3,X_2,X_4)\&v_3(X_4,X_2,X_1)`$ by Lemma 10. Of nine possible types of $`v_3(X_3,X_2,X_4)\&v_3(X_4,X_2,X_1)`$, $`(A3)\&(A1)`$, $`(A3)\&(A2)`$ and $`(A3)\&(A3)`$ cannot occur, for if $`v_3(X_3,X_2,X_4)`$ were of type $`(A3)`$, then $`X_4=1`$, which together with $`(4.3)`$ yields a contradiction to the hypothesis of the lemma. Also, $`(A1)\&(A1)`$ and $`(A2)\&(A1)`$ cannot occur, for if $`v_3(X_4,X_2,X_1)`$ were of type $`(A1)`$, then $`X_4=1`$, again a contradiction. Moreover, $`(A1)\&(A2)`$ cannot occur, for this implies that $`X_3=X_2=1`$, so that $`v_3(X_3,X_2,X_4)=1`$, a contradiction. Also, $`(A2)\&(A3)`$ cannot occur, for this implies that $`X_2=X_1=1`$, so that $`v_3(X_4,X_2,X_1)=1`$, a contradiction as well.

For this reason, in Case (i), we only need to consider $`(A1)\&(A3)`$ and $`(A2)\&(A2)`$ for the types of $`v_3(X_3,X_2,X_4)\&v_3(X_4,X_2,X_1)`$. Therefore, Case III.2 is decomposed into the following three subcases.

###### Case III.2.1

$`v_3(X_3,X_2,X_4)\&v_3(X_4,X_2,X_1)`$ is of type $`(A1)\&(A3)`$.

In this case, it follows from Lemma 10 that $`X_3=X_1=1`$, $`v_3(X_3,X_2,X_4)=v_2(X_2,X_4)^{960}`$ and $`v_3(X_4,X_2,X_1)=v_2(X_4,X_2)^{576}`$. Since $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ is cyclic by the hypothesis of Case III.2, we have that $`v_2(X_2,X_4),v_2(X_4,X_2)`$ is cyclic, so that $`1v_2(X_2,X_4)=v_2(X_4,X_2)`$ by Lemmas 1 and 3. Apply Lemma 2 to this equality: there is a word $`SF_m`$ such that

$$X_2=SX_4S^1\text{and}X_4=SX_2S^1.$$
$`4.4`$
If $`S=1`$, then from $`(4.4)`$ we have $`X_2=X_4`$, which together with $`(4.3)`$ yields a contradiction to the hypothesis of the lemma. Now let $`S1`$. We derive from $`(4.4)`$ that

$$X_2=S^2X_2S^2\text{and}X_4=S^2X_4S^2,$$

so that $`S,X_2`$ and $`S,X_4`$ are cyclic; thus $`X_2,X_4`$ is cyclic. This together with $`(4.3)`$ yields a contradiction as well (because $`X_21`$). Therefore, we conclude that this case cannot occur.

###### Case III.2.2

$`v_3(X_3,X_2,X_4)\&v_3(X_4,X_2,X_1)`$ is of type $`(A2)\&(A2)`$.

It follows from Lemma 10 that $`X_2=1`$, $`v_3(X_3,X_2,X_4)=v_2(X_4,X_3)^{400}`$ and $`v_3(X_4,X_2,X_1)=v_2(X_1,X_4)^{400}`$. Since $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ is cyclic, $`v_2(X_4,X_3),v_2(X_1,X_4)`$ is cyclic, hence, by Lemmas 1 and 3, $`1v_2(X_4,X_3)=v_2(X_1,X_4)`$. Then by Lemma 2 there exists a word $`UF_m`$ such that

$$X_4=UX_1U^1\text{and}X_3=UX_4U^1.$$
$`4.5`$
If $`U=1`$, then it follows from $`(4.5)`$ that $`X_1=X_4=X_3`$, which together with $`(4.3)`$ yields a contradiction to the hypothesis of the lemma. Now let $`U1`$. We have from $`(4.5)`$ that $`UX_1U^1=U^1X_3U`$. This equality implies by $`(4.3)`$ that $`U,X_1,X_2,X_3`$ is cyclic; thus, by the first equality of $`(4.5)`$, we have that $`X_1,X_2,X_3,X_4`$ is cyclic. A contradiction implies that this case cannot occur.

###### Case III.2.3

Neither $`v_3(X_3,X_2,X_4)`$ nor $`v_3(X_4,X_2,X_1)`$ is a proper power.

Since $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ is cyclic, we have, by Lemma 6, that

$$1v_3(X_3,X_2,X_4)=v_3(X_4,X_2,X_1).$$

Apply the Theorem ($`n=3`$) to this equality: there is a word $`TF_m`$ such that

$$X_3=TX_4T^1,X_2=TX_2T^1\text{and}X_4=TX_1T^1.$$
$`4.6`$
The second equality of $`(4.6)`$ implies that $`T,X_2`$ is cyclic; hence, by $`(4.3)`$, $`T,X_1,X_2,X_3`$ is cyclic (because $`X_21`$). Then by the third equality of $`(4.6)`$, we have that $`X_1,X_2,X_3,X_4`$ is cyclic. A contradiction implies that this case cannot occur.

###### Case III.3

$`v_3(X_3,X_2,X_4)=1`$ and $`1v_3(X_1,X_2,X_3),1v_3(X_4,X_2,X_1)`$ is cyclic.

Repeat similar arguments to those in Case III.2 to conclude that this case cannot occur.

###### Case III.4

$`v_3(X_4,X_2,X_1)=1`$ and $`1v_3(X_1,X_2,X_3),1v_3(X_3,X_2,X_4)`$ is cyclic.

Also, repeat similar arguments to those in Case III.2 to conclude that this case cannot occur.

###### Case III.5

$`1v_3(X_1,X_2,X_3),1v_3(X_3,X_2,X_4),1v_3(X_4,X_2,X_1)`$ is cyclic.

In this case, we want to prove:

###### Claim

$`1v_3(X_1,X_2,X_3)=v_3(X_3,X_2,X_4)=v_3(X_4,X_2,X_1).`$

###### Demonstration Proof of the Claim

If none of these is a proper power, then the assertion follows immediately from Lemma 6. So assume one of these is a proper power. Then, in view of Lemmas 10 and 11 ($`n=4`$), the other two also have to be proper powers; thus two of $`X_1`$, $`X_3`$ and $`X_4`$ must be equal to the empty word, unless $`X_2=1`$. However, if two of $`X_1`$, $`X_3`$ and $`X_4`$ were equal to the empty word, then we would have a contradiction to the non-triviality of $`v_3(X_1,X_2,X_3)`$, $`v_3(X_3,X_2,X_4)`$ or $`v_3(X_4,X_2,X_1)`$. Hence we must have $`X_2=1`$. Then

$$v_3(X_1,X_2,X_3)=v_2(X_3,X_1)^{400},v_3(X_3,X_2,X_4)=v_2(X_4,X_3)^{400},v_3(X_4,X_2,X_1)=v_2(X_1,X_4)^{400};$$
$`4.7`$
hence the hypothesis of Case III.5 implies that $`v_2(X_3,X_1),v_2(X_4,X_3),v_2(X_1,X_4)`$ is cyclic. It then follows from Lemmas 1 and 3 that $`v_2(X_3,X_1)=v_2(X_4,X_3)=v_2(X_1,X_4)`$, which together with $`(4.7)`$ proves the claim. $`\mathrm{}`$

Now apply the Theorem ($`n=3`$) to the equalities in the Claim: there exist words $`Z_1`$ and $`Z_2`$ in $`F_m`$ such that

$`X_1=Z_1X_3Z_1^1,X_2=Z_1X_2Z_1^1,X_3=Z_1X_4Z_1^1;`$ $`4.8`$
$`X_3=Z_2X_4Z_2^1,X_2=Z_2X_2Z_2^1,X_4=Z_2X_1Z_2^1.`$
We deduce from these equalities that $`Z_1,X_2`$, $`Z_2,X_2`$, $`Z_1Z_2^2,Z_1^2Z_2,X_1`$, $`Z_1Z_2^2,Z_1^2Z_2,X_3`$ and $`Z_1Z_2^2,Z_1^2Z_2,X_4`$ are all cyclic. Here, if either $`Z_1Z_2^21`$ or $`Z_1^2Z_21`$, then we would have that $`X_1,X_2,X_3,X_4`$ is cyclic, a contradiction. Hence we must have that $`Z_1Z_2^2=Z_1^2Z_2=1`$, that is, $`Z_1=Z_2=1`$; thus, by $`(4.8)`$,

$$X_1=X_3=X_4.$$

In addition, it follows from the Claim that

$$\begin{array}{cc}\hfill v_4(X_1,X_2,X_3,X_4)& =u(u(v_3(X_1,X_2,X_3),v_3(X_1,X_2,X_3)),u(v_3(X_1,X_2,X_3),v_3(X_1,X_2,X_3)))\hfill \\ & =u(v_3(X_1,X_2,X_3)^{44},v_3(X_1,X_2,X_3)^{44})\hfill \\ & =v_3(X_1,X_2,X_3)^{4424+4420}\hfill \\ & =v_3(X_1,X_2,X_3)^{1936}.\hfill \end{array}$$

Therefore, in this case, $`v_4(X_1,X_2,X_3,X_4)`$ has form $`(B4)`$.

###### Case III.6

Both $`v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)`$ and $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ are non-cyclic.

In view of $`(4.2)`$ and Lemmas 4 and 6, we have that

$$u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4))=u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)).$$

Then by Lemma 5 applied to this equality, there is a word $`WF_m`$ such that

$$1v_3(X_1,X_2,X_3)=Wv_3(X_3,X_2,X_4)W^1\text{and}1v_3(X_3,X_2,X_4)=Wv_3(X_4,X_2,X_1)W^1.$$

Applying the Theorem ($`n=3`$) to these equalities yields the existence of words $`V_1`$ and $`V_2`$ in $`F_m`$ such that

$`X_1=V_1X_3V_1^1,X_2=V_1X_2V_1^1,X_3=V_1X_4V_1^1;`$
$`X_3=V_2X_4V_2^1,X_2=V_2X_2V_2^1,X_4=V_2X_1V_2^1.`$
This is the same situation as $`(4.8)`$; hence, reasoning as in Case III.5, we have $`X_1=X_3=X_4`$. But then $`v_3(X_1,X_2,X_3)=v_3(X_3,X_2,X_4)=v_3(X_4,X_2,X_1)`$, which yields a contradiction to the hypothesis of Case III.6. Therefore, we conclude that this case cannot occur.

The proof of Lemma 13 ($`n=4`$) is now complete. $`\mathrm{}`$

###### Demonstration Proof of the Theorem ($`n=4`$)

The additional property that $`v_4(X_1,X_2,X_3,X_4)=1`$ if and only if the subgroup $`X_1,X_2,X_3,X_4`$ of $`F_m`$ is cyclic is immediate from definition $`(1.5)`$ of $`v_4(x_1,x_2,x_3,x_4)`$ and Lemma 13 ($`n=4`$). Now we want to prove that $`v_4(x_1,x_2,x_3,x_4)`$ is a $`C`$-test word, that is, supposing $`1v_4(X_1,X_2,X_3,X_4)=v_4(Y_1,Y_2,Y_3,Y_4)`$, we want to prove the existence of a word $`Z`$ in $`F_m`$ such that

$$Y_i=ZX_iZ^1\text{for}\text{all}i=1,\mathrm{\hspace{0.17em}2},\mathrm{\hspace{0.17em}3},\mathrm{\hspace{0.17em}4}.$$

We consider two cases corresponding to whether $`v_4(X_1,X_2,X_3,X_4)`$ is a proper power or not.

###### Case I

$`v_4(X_1,X_2,X_3,X_4)`$ is a proper power.

Apply Lemma 13 ($`n=4`$) to $`v_4(X_1,\mathrm{},X_4)`$ and $`v_4(Y_1,\mathrm{},Y_4)`$: $`v_4(X_1,\mathrm{},X_4)`$ has one of the four types $`(B1)`$$`(B4)`$; besides, by the equality $`v_4(X_1,\mathrm{},X_4)=v_4(Y_1,\mathrm{},Y_4)`$, $`v_4(Y_1,\mathrm{},Y_4)`$ has the same type as $`v_4(X_1,\mathrm{},X_4)`$, since the exponents in $`(B1)`$$`(B4)`$ are all distinct. This gives us only four possibilities $`(B1)\&(B1),\mathrm{},(B4)\&(B4)`$ for the types of $`v_4(X_1,\mathrm{},X_4)\&v_4(Y_1,\mathrm{},Y_4)`$.

If $`v_4(X_1,\mathrm{},X_4)\&v_4(Y_1,\mathrm{},Y_4)`$ is of type $`(B1)\&(B1)`$ ($`(B2)\&(B2)`$ or $`(B3)\&(B3)`$ is analogous), then

$$X_1=X_2=Y_1=Y_2=1\text{and}1v_2(X_4,X_3)^{960400}=v_2(Y_4,Y_3)^{960400}.$$

Applying Lemma 2 to the equality $`1v_2(X_4,X_3)=v_2(Y_4,Y_3)`$, we have that two 2-tuples $`(X_4,X_3)`$ and $`(Y_4,Y_3)`$ are conjugate in $`F_m`$, which together with $`X_1=X_2=Y_1=Y_2=1`$ yields the desired result.

If $`v_4(X_1,\mathrm{},X_4)\&v_4(Y_1,\mathrm{},Y_4)`$ is of type $`(B4)\&(B4)`$, then

$$X_1=X_3=X_4,Y_1=Y_3=Y_4\text{and}1v_3(X_1,X_2,X_3)^{1936}=v_3(Y_1,Y_2,Y_3)^{1936}.$$

The equality $`1v_3(X_1,X_2,X_3)=v_3(Y_1,Y_2,Y_3)`$ yields, by the Theorem ($`n=3`$), that two $`3`$-tuples $`(X_1,X_2,X_3)`$ and $`(Y_1,Y_2,Y_3)`$ are conjugate in $`F_m`$. Then the result follows from $`X_1=X_3=X_4`$ and $`Y_1=Y_3=Y_4`$.

###### Case II

$`v_4(X_1,X_2,X_3,X_4)`$ is not a proper power.

In view of Lemma 4, it follows that

$$u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)),u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)\text{is non-cyclic}.$$
$`4.9`$
This enables us to apply Lemma 5 to the equality $`v_4(X_1,\mathrm{},X_4)=v_4(Y_1,\mathrm{},Y_4)`$: there exists a word $`SF_m`$ such that

$`1u(v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4))=Su(v_3(Y_1,Y_2,Y_3),v_3(Y_3,Y_2,Y_4))S^1,`$ $`4.10`$
$`1u(v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1))=Su(v_3(Y_3,Y_2,Y_4),v_3(Y_4,Y_2,Y_1))S^1.`$
Here, we have four subcases to consider.

###### Case II.1

Both $`v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)`$ and $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ are non-cyclic.

The hypothesis of this case enables us to apply Lemma 5 to equalities $`(4.10)`$: there exist words $`T_1`$ and $`T_2`$ in $`F_m`$ such that

$`1v_3(X_1,X_2,X_3)=T_1v_3(Y_1,Y_2,Y_3)T_1^1,1v_3(X_3,X_2,X_4)=T_1v_3(Y_3,Y_2,Y_4)T_1^1;`$ $`4.11`$
$`1v_3(X_3,X_2,X_4)=T_2v_3(Y_3,Y_2,Y_4)T_2^1,1v_3(X_4,X_2,X_1)=T_2v_3(Y_4,Y_2,Y_1)T_2^1.`$
Then by the Theorem ($`n=3`$) applied to $`(4.11)`$, there exist words $`U_1`$, $`U_2`$ and $`U_3`$ such that

$`X_1=U_1Y_1U_1^1,X_2=U_1Y_2U_1^1,X_3=U_1Y_3U_1^1;`$ $`4.12`$
$`X_3=U_2Y_3U_2^1,X_2=U_2Y_2U_2^1,X_4=U_2Y_4U_2^1;`$
$`X_4=U_3Y_4U_3^1,X_2=U_3Y_2U_3^1,X_1=U_3Y_1U_3^1.`$
Here, if one of $`U_1=U_2`$, $`U_2=U_3`$ and $`U_3=U_1`$ is true, then the required result follows directly from $`(4.12)`$. So assume that $`U_1`$, $`U_2`$ and $`U_3`$ are pairwise distinct. Combining the equalities in $`(4.12)`$, we deduce that $`U_3^1U_1,X_1`$, $`U_1^1U_2,X_2`$, $`U_2^1U_3,X_2`$, $`U_3^1U_1,X_2`$, $`U_1^1U_2,X_3`$ and $`U_2^1U_3,X_4`$ are all cyclic, so that $`X_1,X_2`$, $`X_3,X_2`$ and $`X_4,X_2`$ are cyclic. Since $`X_1,\mathrm{},X_4`$ is non-cyclic (this follows from $`v_4(X_1,\mathrm{},X_4)1`$), we must have $`X_2=1`$; so, by $`(4.12)`$, $`Y_2=1`$. Then by Lemma 10, the equalities on the first line of $`(4.11)`$ yield that

$$1v_2(X_3,X_1)^{400}=T_1v_2(Y_3,Y_1)^{400}T_1^1,1v_2(X_4,X_3)^{400}=T_1v_2(Y_4,Y_3)^{400}T_1^1,$$

namely,

$$1v_2(X_3,X_1)=T_1v_2(Y_3,Y_1)T_1^1,1v_2(X_4,X_3)=T_1v_2(Y_4,Y_3)T_1^1.$$
$`4.13`$
This is a similar situation to $`(3.10)`$, so from here on, we can follow the proof of Case II.1 of the Theorem ($`n=3`$) to obtain that two 3-tuples $`(X_1,X_3,X_4)`$ and $`(Y_1,Y_3,Y_4)`$ are conjugate in $`F_m`$. Since $`X_2=Y_2=1`$, the desired result follows.

###### Case II.2

$`v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)`$ is non-cyclic, and $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ is cyclic.

In this case, we can apply Lemma 5 to the first equality of $`(4.10)`$: there exists a word $`VF_m`$ such that

$$1v_3(X_1,X_2,X_3)=Vv_3(Y_1,Y_2,Y_3)V^1,1v_3(X_3,X_2,X_4)=Vv_3(Y_3,Y_2,Y_4)V^1.$$
$`4.14`$
Then the Theorem ($`n=3`$) applied to $`(4.14)`$ yields the existence of words $`W_1`$ and $`W_2`$ in $`F_m`$ such that

$`X_1=W_1Y_1W_1^1,X_2=W_1Y_2W_1^1,X_3=W_1Y_3W_1^1;`$ $`4.15`$
$`X_3=W_2Y_3W_2^1,X_2=W_2Y_2W_2^1,X_4=W_2Y_4W_2^1.`$
If $`W_1=W_2`$, then the required result follows from $`(4.15)`$. Now assume that $`W_1W_2`$. We deduce from $`(4.15)`$ that $`W_1^1W_2,X_2`$ and $`W_1^1W_2,X_3`$ are cyclic, so that

$$X_2,X_3\text{is}\text{cyclic.}$$
$`4.16`$
On the other hand, since $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ is cyclic by the hypothesis of Case II.2, in view of Lemmas 10 and 11 ($`n=4`$), we have that $`v_3(X_3,X_2,X_4)`$ is a proper power if and only if $`v_3(X_4,X_2,X_1)`$ is a proper power. For this reason, this case is reduced to the following three subcases.

###### Case II.2.1

$`v_3(X_4,X_2,X_1)=1`$ ($`v_3(X_3,X_2,X_4)1`$ by the hypothesis of Case II.2).

It follows from the Theorem ($`n=3`$) that $`X_4,X_2,X_1`$ is cyclic. Since $`X_2,X_3`$ is cyclic by $`(4.16)`$, in order to avoid a contradiction to the fact that $`X_1,\mathrm{},X_4`$ is non-cyclic, we must have

$$X_2=1;$$
$`4.17`$
thus $`Y_2=1`$ by $`(4.15)`$. Then by Lemma 10, equalities $`(4.14)`$ yield that

$$1v_2(X_3,X_1)=Vv_2(Y_3,Y_1)V^1,1v_2(X_4,X_3)=Vv_2(Y_4,Y_3)V^1.$$

This is the same situation as $`(4.13)`$; hence from here on, repeating the proof of Case II.1, we obtain the desired result.

###### Case II.2.2

Both $`v_3(X_3,X_2,X_4)`$ and $`v_3(X_4,X_2,X_1)`$ are proper powers.

In view of Lemma 10, we have nine possibilities for the types of $`v_3(X_3,X_2,X_4)\&v_3(X_4,X_2,X_1)`$. Of these nine possible types, $`(A1)\&(A1)`$, $`(A1)\&(A2)`$, $`(A1)\&(A3)`$, $`(A2)\&(A1)`$, $`(A2)\&(A3)`$, $`(A3)\&(A2)`$ and $`(A3)\&(A3)`$ cannot occur, for if one of these occurred, then two of $`X_1`$, $`X_2`$, $`X_3`$ and $`X_4`$ should be equal to the empty word, which yields a contradiction to the non-triviality of $`v_3(X_1,X_2,X_3)`$, $`v_3(X_3,X_2,X_4)`$ or $`v_3(X_4,X_2,X_1)`$. So only $`(A2)\&(A2)`$ and $`(A3)\&(A1)`$ can actually occur.

If $`v_3(X_3,X_2,X_4)\&v_3(X_4,X_2,X_1)`$ is of type $`(A2)\&(A2)`$, then $`X_2=1`$, which is the same situation as $`(4.17)`$. Hence from here on, following the proof of Case II.2.1, we arrive at the desired result. If $`v_3(X_3,X_2,X_4)\&v_3(X_4,X_2,X_1)`$ is of type $`(A3)\&(A1)`$, then $`X_4=1`$. The result then follows from $`(4.15)`$.

###### Case II.2.3

Neither $`v_3(X_3,X_2,X_4)1`$ nor $`v_3(X_4,X_2,X_1)1`$ is a proper power.

Since $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ is cyclic, it follows from Lemma 6 that $`v_3(X_3,X_2,X_4)=v_3(X_4,X_2,X_1)`$, so from the second equality of $`(4.10)`$ that

$$1v_3(X_4,X_2,X_1)^{44}=Su(v_3(Y_3,Y_2,Y_4),v_3(Y_4,Y_2,Y_1))S^1.$$
$`4.18`$
This equality implies by Lemma 4 that $`v_3(Y_3,Y_2,Y_4),v_3(Y_4,Y_2,Y_1)`$ is also cyclic. We then observe that equality $`(4.18)`$ can hold only when neither $`v_3(Y_3,Y_2,Y_4)`$ nor $`v_3(Y_4,Y_2,Y_1)`$ is a proper power and $`v_3(Y_3,Y_2,Y_4)=v_3(Y_4,Y_2,Y_1)`$, by which $`(4.18)`$ yields that

$$1v_3(X_4,X_2,X_1)^{44}=Sv_3(Y_4,Y_2,Y_1)^{44}S^1,$$

namely,

$$1v_3(X_4,X_2,X_1)=Sv_3(Y_4,Y_2,Y_1)S^1.$$

Now apply the Theorem ($`n=3`$) to this equality: there exists a word $`W_3F_m`$ such that

$$X_4=W_3Y_4W_3^1,X_2=W_3Y_2W_3^1,X_1=W_3Y_1W_3^1.$$

Putting this together with $`(4.15)`$, we have the same situation as $`(4.12)`$ except that we already assumed $`W_1W_2`$ in Case II.2. Therefore, from here on, we can follow the proof of Case II.1 to derive the result.

###### Case II.3

$`v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)`$ is cyclic, and $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ is non-cyclic.

It is sufficient to repeat similar arguments to those in Case II.2 to arrive at the desired result.

###### Case II.4

Both $`v_3(X_1,X_2,X_3),v_3(X_3,X_2,X_4)`$ and $`v_3(X_3,X_2,X_4),v_3(X_4,X_2,X_1)`$ are cyclic.

Arguing as in the proof of Case II.2 of the Theorem ($`n=3`$) replacing $`(3.8)`$ and $`(3.9)`$ by $`(4.9)`$ and $`(4.10)`$, respectively, we deduce that $`v_3(X_3,X_2,X_4)=v_3(Y_3,Y_2,Y_4)=1`$. So

$$X_3,X_2,X_4\text{is}\text{cyclic;}$$
$`4.19`$
moreover, it follows from $`(4.10)`$ that

$$1v_3(X_1,X_2,X_3)^{24}=Sv_3(Y_1,Y_2,Y_3)^{24}S^1,1v_3(X_4,X_2,X_1)^{20}=Sv_3(Y_4,Y_2,Y_1)^{20}S^1,$$

namely,

$$1v_3(X_1,X_2,X_3)=Sv_3(Y_1,Y_2,Y_3)S^1,1v_3(X_4,X_2,X_1)=Sv_3(Y_4,Y_2,Y_1)S^1.$$

Then by the Theorem ($`n=3`$) applied to these equalities, we have the existence of words $`Z_1`$ and $`Z_2`$ in $`F_m`$ such that

$`X_1=Z_1Y_1Z_1^1,X_2=Z_1Y_2Z_1^1,X_3=Z_1Y_3Z_1^1;`$ $`4.20`$
$`X_4=Z_2Y_4Z_2^1,X_2=Z_2Y_2Z_2^1,X_1=Z_2Y_1Z_2^1.`$
If $`Z_1=Z_2`$, then the result follows from $`(4.20)`$. Now assume that $`Z_1Z_2`$. Then equalities $`(4.20)`$ yield that $`Z_1^1Z_2,X_1`$ and $`Z_1^1Z_2,X_2`$ are cyclic, so that $`X_1,X_2`$ is cyclic. Since $`X_3,X_2,X_4`$ is cyclic by $`(4.19)`$, we must have $`X_2=1`$, which is the same situation as $`(4.17)`$. Thus, from here on, we can follow the proof of Case II.2.1 to get the required result.

The Theorem ($`n=4`$) is now completely proved. $`\mathrm{}`$

## 5. The inductive step

In this section, we prove the inductive step of simultaneous induction which we use in Lemmas 11–13 and the Theorem. Let $`n5`$ throughout this section.

###### Lemma 11

If both $`v_{n2}(X_1,\mathrm{},X_{n2})`$ and $`v_{n1}(Y_1,\mathrm{},Y_{n1})`$ are neither equal to the empty word nor proper powers, then $`v_{n2}(X_1,\mathrm{},X_{n2}),v_{n1}(Y_1,\mathrm{},Y_{n1})`$ is non-cyclic.

###### Demonstration Proof

By way of contradiction, suppose that $`v_{n2}(X_1,\mathrm{},X_{n2}),v_{n1}(Y_1,\mathrm{},Y_{n1})`$ is cyclic. Since both $`v_{n2}(X_1,\mathrm{},X_{n2})`$ and $`v_{n1}(Y_1,\mathrm{},Y_{n1})`$ are non-proper powers, it follows from Lemma 6 that

$$v_{n2}(X_1,\mathrm{},X_{n2})=v_{n1}(Y_1,\mathrm{},Y_{n1}),$$

so from $`(1.3)`$$`(1.4)`$ and Lemmas 4 and 5 that there exists a word $`SF_m`$ such that

$`u(v_{n3}(X_1,\mathrm{},X_{n3}),v_{n3}(X_{n3},\mathrm{},X_{n2}))`$ $`=Su(v_{n2}(Y_1,\mathrm{},Y_{n2}),v_{n2}(Y_{n2},\mathrm{},Y_{n1}))S^1,`$ $`5.1`$
$`u(v_{n3}(X_{n3},\mathrm{},X_{n2}),v_{n3}(X_{n2},\mathrm{},X_1))`$ $`=Su(v_{n2}(Y_{n2},\mathrm{},Y_{n1}),v_{n2}(Y_{n1},\mathrm{},Y_1))S^1.`$
We first assume that $`v_{n3}(X_1,\mathrm{},X_{n3}),v_{n3}(X_{n3},\mathrm{},X_{n2})`$ is non-cyclic. This enables us to apply Lemma 5 to the first equality of $`(5.1)`$: there exists a word $`TF_m`$ such that

$`v_{n3}(X_1,\mathrm{},X_{n3})`$ $`=Tv_{n2}(Y_1,\mathrm{},Y_{n2})T^1`$ $`5.2`$
$`v_{n3}(X_{n3},\mathrm{},X_{n2})`$ $`=Tv_{n2}(Y_{n2},\mathrm{},Y_{n1})T^1.`$
If both sides of the first equality of $`(5.2)`$ are non-proper powers, then this equality yields a contradiction to the induction hypothesis Lemma 11; if both sides of the first equality of $`(5.2)`$ are proper powers, then we see from Lemma 10 and the induction hypothesis of Lemma 13 that they cannot be the same proper powers (because the exponents in both sides cannot be identical), a contradiction as well.

We next assume that $`v_{n3}(X_1,\mathrm{},X_{n3}),v_{n3}(X_{n3},\mathrm{},X_{n2})`$ is cyclic. Then the first equality of $`(5.1)`$ yields by Lemma 4 that

$$\begin{array}{c}v_{n3}(X_1,\mathrm{},X_{n3}),v_{n3}(X_{n3},\mathrm{},X_{n2}),\hfill \\ \hfill Sv_{n2}(Y_1,\mathrm{},Y_{n2})S^1,Sv_{n2}(Y_{n2},\mathrm{},Y_{n1})S^1\text{is}\text{cyclic.}\end{array}$$
$`5.3`$
Here, in view of the induction hypothesis of Lemma 13, we see that there are only two ways to avoid a contradiction to Lemma 8 and the induction hypothesis of Lemma 11: (i) any non-trivial word of $`Sv_{n2}(Y_1,\mathrm{},Y_{n2})S^1`$ and $`Sv_{n2}(Y_{n2},\mathrm{},Y_{n1})S^1`$ is of type $`(B4)`$; (ii) any non-trivial word in $`(5.3)`$ is of one of types $`(B1)`$, $`(B2)`$ and $`(B3)`$. (For $`n=5`$, there is only one way: any non-trivial word of $`Sv_{n2}(Y_1,\mathrm{},Y_{n2})S^1`$ and $`Sv_{n2}(Y_{n2},\mathrm{},Y_{n1})S^1`$ is of one of types $`(A1)`$, $`(A2)`$ and $`(A3)`$.) However, in either case, we can observe that equalities $`(5.2)`$ cannot hold. This contradiction completes the proof. $`\mathrm{}`$

###### Lemma 12

If $`u(v_{n1}(X_1,\mathrm{},X_{n1}),v_{n1}(Y_1,\mathrm{},Y_{n1}))=1`$, then $`v_{n1}(X_1,\mathrm{},X_{n1})=1`$ and $`v_{n1}(Y_1,\mathrm{},Y_{n1})=1`$.

###### Demonstration Proof

By Lemma 4, the hypothesis of the lemma yields that

$$v_{n1}(X_1,\mathrm{},X_{n1})^6=v_{n1}(Y_1,\mathrm{},Y_{n1})^5.$$
$`5.4`$
If one of $`v_{n1}(X_1,\mathrm{},X_{n1})`$ and $`v_{n1}(Y_1,\mathrm{},Y_{n1})`$ is equal to the empty word, then by $`(5.4)`$ there is nothing to prove. So assume that $`v_{n1}(X_1,\mathrm{},X_{n1})1`$ and $`v_{n1}(Y_1,\mathrm{},Y_{n1})1`$. Since $`6`$ and $`5`$ are relatively prime, equality $`(5.4)`$ implies that both $`v_{n1}(X_1,\mathrm{},X_{n1})`$ and $`v_{n1}(Y_1,\mathrm{},Y_{n1})`$ are either proper powers or non-proper powers. If both are proper powers, then a contradiction to equality $`(5.4)`$ follows from the induction hypothesis of Lemma 13, for $`6`$ times any of $`960400^{(n4)}`$, $`400^{(n3)}`$, $`576400^{(n4)}`$ and $`1936`$ cannot be equal to $`5`$ times any of these. If both are non-proper powers, then, since $`v_{n1}(X_1,\mathrm{},X_{n1}),v_{n1}(Y_1,\mathrm{},Y_{n1})`$ is cyclic, we have by Lemma 6 that $`v_{n1}(X_1,\mathrm{},X_{n1})=v_{n1}(Y_1,\mathrm{},Y_{n1})`$. This together with $`(5.4)`$ yields that $`v_{n1}(X_1,\mathrm{},X_{n1})=v_{n1}(Y_1,\mathrm{},Y_{n1})=1`$. This contradiction to our assumption completes the proof. $`\mathrm{}`$

###### Lemma 13

Suppose that $`X_1,\mathrm{},X_n`$ is non-cyclic. Then $`v_n(X_1,\mathrm{},X_n)1`$. Furthermore, either $`v_n(X_1,\mathrm{},X_n)`$ is not a proper power or it has one of the following four forms:

$`(B1)v_n(X_1,\mathrm{},X_n)`$ $`=\{\begin{array}{cc}v_2(X_n,X_{n1})^{960400^{(n3)}}\text{and}X_1=X_2=\mathrm{}=X_{n2}=1,\hfill & \text{for }n\text{ even}\hfill \\ v_2(X_{n1},X_n)^{960400^{(n3)}}\text{and}X_1=X_2=\mathrm{}=X_{n2}=1,\hfill & \text{for }n\text{ odd};\hfill \end{array}`$
$`(B2)v_n(X_1,\mathrm{},X_n)`$ $`=\{\begin{array}{cc}v_2(X_1,X_n)^{400^{(n2)}}\text{and}X_2=X_3=\mathrm{}=X_{n1}=1,\hfill & \text{for }n\text{ even}\hfill \\ v_2(X_n,X_1)^{400^{(n2)}}\text{and}X_2=X_3=\mathrm{}=X_{n1}=1,\hfill & \text{for }n\text{ odd};\hfill \end{array}`$
$`(B3)v_n(X_1,\mathrm{},X_n)`$ $`=\{\begin{array}{cc}v_2(X_{n1},X_1)^{576400^{(n3)}}\text{and}X_2=\mathrm{}=X_{n2}=X_n=1,\hfill & \text{for }n\text{ even}\hfill \\ v_2(X_1,X_{n1})^{576400^{(n3)}}\text{and}X_2=\mathrm{}=X_{n2}=X_n=1,\hfill & \text{for }n\text{ odd};\hfill \end{array}`$
$`(B4)v_n(X_1,\mathrm{},X_n)`$ $`=v_{n1}(X_1,X_2,\mathrm{},X_{n1})^{1936}\text{and}X_1=X_{n1}=X_n1.`$
###### Remark

In view of Lemma 1 and the induction hypothesis of Lemma 13, $`v_2(X_n,X_{n1})`$ and $`v_2(X_{n1},X_n)`$ in $`(B1)`$, $`v_2(X_1,X_n)`$ and $`v_2(X_n,X_1)`$ in $`(B2)`$, $`v_2(X_{n1},X_1)`$ and $`v_2(X_1,X_{n1})`$ in $`(B3)`$, and $`v_{n1}(X_1,X_2,\mathrm{},X_{n1})`$ in $`(B4)`$ are neither equal to the empty word nor proper powers.

###### Demonstration Proof

Closely follow the proof of Lemma 13 ($`n=4`$) replacing references to Lemmas 10, 11 ($`n=4`$), 12 ($`n=4`$) and the Theorem ($`n=3`$) by references to the induction hypothesis of Lemma 13, Lemmas 8 and 11, Lemma 12 and the induction hypothesis of the Theorem, respectively. Different situations from Lemma 13 ($`n=4`$) can possibly occur only in Case III.2 and Case III.5, which we reconsider below.

###### Case III.2

$`1v_{n1}(X_{n1},X_2,X_3,\mathrm{},X_{n2},X_n),1v_{n1}(X_n,X_2,X_3,\mathrm{},X_{n2},X_1)`$ is cyclic, and $`v_{n1}(X_1,X_2,\mathrm{},X_{n1})=1`$.

Since $`v_{n1}(X_1,X_2,\mathrm{},X_{n1})=1`$, we have, by the induction hypothesis of the Theorem, that

$$X_1,X_2,\mathrm{},X_{n1}\text{is}\text{cyclic}.$$
$`5.5`$
Also since $`1v_{n1}(X_{n1},X_2,\mathrm{},X_{n2},X_n),1v_{n1}(X_n,X_2,\mathrm{},X_{n2},X_1)`$ is cyclic, in view of Lemmas 8 and 11 and the induction hypothesis of Lemma 13, this case is reduced to the following two cases:

$$\begin{array}{cc}& \text{(i)}\text{both}v_{n1}(X_{n1},X_2,\mathrm{},X_{n2},X_n)\text{and}v_{n1}(X_n,X_2,\mathrm{},X_{n2},X_1)\text{are proper powers};\hfill \\ & \text{(ii)}\text{neither}v_{n1}(X_{n1},X_2,\mathrm{},X_{n2},X_n)\text{nor}v_{n1}(X_n,X_2,\mathrm{},X_{n2},X_1)\text{is a proper power.}\hfill \end{array}$$

Case (i) is divided further into subcases according to types of $`v_{n1}(X_{n1},X_2,\mathrm{},X_{n2},X_n)`$ $`\&`$ $`v_{n1}(X_n,X_2,\mathrm{},X_{n2},X_1)`$ by the induction hypothesis of Lemma 13. However, the former word cannot be of type $`(B3)`$ nor $`(B4)`$, for this type together with $`(5.5)`$ yields a contradiction to the hypothesis of Lemma 13. For the same reason, the latter cannot be of type $`(B1)`$ nor $`(B4)`$. Also $`(B1)\&(B2)`$ and $`(B2)\&(B3)`$ cannot occur, for these types yield a contradiction to the non-triviality of $`v_{n1}(X_{n1},X_2,\mathrm{},X_{n2},X_n)`$ and $`v_{n1}(X_n,X_2,\mathrm{},X_{n2},X_1)`$, respectively. Thus, in Case (i), only $`(B1)\&(B3)`$ and $`(B2)\&(B2)`$ need to be considered. This allows us to follow the proof of Lemma 13 ($`n=4`$) from here on.

###### Case III.5

$`1v_{n1}(X_1,X_2,\mathrm{},X_{n1}),1v_{n1}(X_{n1},X_2,X_3,\mathrm{},X_{n2},X_n),`$ $`1v_{n1}(X_n,X_2,X_3,\mathrm{},X_{n2},X_1)`$ is cyclic.

In this case, in order to be able to keep following the proof of Lemma 13 ($`n=4`$), it is sufficient prove the following:

###### Claim

$`1v_{n1}(X_1,X_2,\mathrm{},X_{n1})=v_{n1}(X_{n1},\mathrm{},X_{n2},X_n)=v_{n1}(X_n,\mathrm{},X_{n2},X_1)`$.

###### Demonstration Proof of the Claim

If none of these is a proper power, then the assertion follows immediately from Lemma 6. So assume that one of these is a proper power. Then, in view of the induction hypothesis of Lemma 13 and Lemmas 8 and 11, the other two also have to be proper powers. Here, in order to avoid a contradiction to the non-triviality of these words, all of these words must have the same type either $`(B2)`$ or $`(B4)`$. The treatment of $`(B2)`$ is the same as in the Theorem ($`n=4`$); if all of these words are of type $`(B4)`$, then we have $`X_1=X_{n2}=X_{n1}=X_n1`$, which proves the claim. $`\mathrm{}`$

The proof of Lemma 13 is complete. $`\mathrm{}`$

###### Demonstration Proof of the Theorem

The additional property that $`v_n(X_1,\mathrm{},X_n)=1`$ if and only if the subgroup $`X_1,\mathrm{},X_n`$ of $`F_m`$ is cyclic follows immediately from definition $`(1.4)`$ of $`v_n(x_1,\mathrm{},x_n)`$ and Lemma 13. Now supposing $`1v_n(X_1,\mathrm{},X_n)=v_n(Y_1,\mathrm{},Y_n)`$, we want to prove that there exists a word $`ZF_m`$ such that

$$Y_i=ZX_iZ^1\text{for}\text{all}i=1,\mathrm{},n,$$

that is, we want to show that $`v_n(x_1,\mathrm{},x_n)`$ is a $`C`$-test word. From here on, repeat the proof of the Theorem ($`n=4`$) replacing references to Lemmas 10, 11 ($`n=4`$), 13 ($`n=4`$) and the Theorem ($`n=3`$) by references to Lemma 13, Lemmas 8 and 11, Lemma 13 and the induction hypothesis of the Theorem, respectively. A different situation from the Theorem ($`n=4`$) can possibly occur only in Case II.2.2, which we reconsider below.

###### Case II.2.2

Both $`v_{n1}(X_{n1},X_2,X_3,\mathrm{},X_{n2},X_n)`$ and $`v_{n1}(X_n,X_2,X_3,\mathrm{},X_{n2},X_1)`$ are proper powers.

In view of Lemma 13, $`v_{n1}(X_{n1},X_2,\mathrm{},X_{n2},X_n)`$ $`\&`$ $`v_{n1}(X_n,X_2,\mathrm{},X_{n2},X_1)`$ has 16 possible types, of which it suffices to consider the types involving $`(B4)`$, namely, $`(B1)\&(B4)`$, $`(B2)\&(B4)`$, $`(B3)\&(B4)`$, $`(B4)\&(B4)`$, $`(B4)\&(B1)`$, $`(B4)\&(B2)`$ and $`(B4)\&(B3)`$, since the consideration for the remaining types is the same as in the proof of the Theorem ($`n=4`$). However, none of these types except for $`(B4)\&(B4)`$ can actually occur, for these types except for $`(B4)\&(B4)`$ together with the hypothesis of Case II.2 that $`v_{n1}(X_{n1},X_2,\mathrm{},X_{n2},X_n),v_{n1}(X_n,X_2,\mathrm{},X_{n2},X_1)`$ is cyclic yield a contradiction to Lemma 8.

If $`(B4)\&(B4)`$ occurs, then the equality corresponding to the second one of $`(4.10)`$, namely,

$$\begin{array}{c}1u(v_{n1}(X_{n1},X_2,\mathrm{},X_{n2},X_n),v_{n1}(X_n,X_2,\mathrm{},X_{n2},X_1))\hfill \\ \hfill =Su(v_{n1}(Y_{n1},Y_2,\mathrm{},Y_{n2},Y_n),v_{n1}(Y_n,Y_2,\mathrm{},Y_{n2},Y_1))S^1\end{array}$$

forces $`v_{n1}(Y_{n1},Y_2,\mathrm{},Y_{n2},Y_n)\&v_{n1}(Y_n,Y_2,\mathrm{},Y_{n2},Y_1)`$ to have type $`(B4)\&(B4)`$ as well. Thus, we have

$$X_1=X_{n2}=X_{n1}=X_n1\text{and}Y_1=Y_{n2}=Y_{n1}=Y_n1,$$

which together with

$$X_{n1}=W_2Y_{n1}W_2^1,X_2=W_2Y_2W_2^1,\mathrm{},X_{n2}=W_2Y_{n2}W_2^1,X_n=W_2Y_nW_2^1$$

corresponding to the equalities on the second line of $`(4.15)`$ implies the desired result. This completes Case II.2.2. $`\mathrm{}`$

## 6. Proof of Corollary 2

We are now in a position to prove Corollary 2.

###### Demonstration Proof of Corollary 2

Let $`\varphi `$ and $`\psi `$ be endomorphisms of $`F_m`$ with non-cyclic images. Take

$$u_1=v_m(x_1,x_2,\mathrm{},x_m)\text{and}u_2=v_{m+1}(x_{m1},x_{m2},\mathrm{},x_1,x_m,x_1).$$

Supposing $`\varphi (u_i)=\psi (u_i)`$, for $`i=1,2`$, we want to prove $`\varphi =\psi `$. By Corollary 1, the equality $`\varphi (u_1)=\psi (u_1)`$ implies that

$$\varphi =\tau _S\psi ,\text{where }S,\psi (u_1)\text{ is  cyclic.}$$
$`6.1`$
Here, it is sufficient to show $`S=1`$ to draw the desired result. By $`(6.1)`$, the other equality $`\varphi (u_2)=\psi (u_2)`$ yields that

$$\psi (u_2)=\varphi (u_2)=S\psi (u_2)S^1,$$

so that $`S,\psi (u_2)`$ is cyclic. Then $`S=1`$ follows obviously from the following:

###### Claim

$`\psi (u_1),\psi (u_2)`$ is non-cyclic.

###### Demonstration Proof of the Claim

Putting $`X_i=\psi (x_i)`$, for all $`i=1,2,\mathrm{},m`$, the claim is equivalent to

$$v_m(X_1,X_2,\mathrm{},X_m),v_{m+1}(X_{m1},X_{m2},\mathrm{},X_1,X_m,X_1)\text{is  non-cyclic}.$$

Since $`\psi `$ has non-cyclic image, $`X_1,X_2,\mathrm{},X_m`$ is non-cyclic. This implies by the Theorem that

$$v_m(X_1,X_2,\mathrm{},X_m)1\text{and}v_{m+1}(X_{m1},X_{m2},\mathrm{},X_1,X_m,X_1)1.$$

We treat two cases separately.

###### Case I

$`v_{m+1}(X_{m1},X_{m2},\mathrm{},X_1,X_m,X_1)`$ is not a proper power.

In this case, $`v_m(X_1,X_2,\mathrm{},X_m)`$ cannot be of form $`(B4)`$, for if $`v_m(X_1,X_2,\mathrm{},X_m)`$ were of form $`(B4)`$ then $`X_1=X_{m1}=X_m1`$, which forces $`v_{m+1}(X_{m1},X_{m2},\mathrm{},X_1,X_m,X_1)`$ to be a proper power of form $`(B4)`$, a contradiction. Then the claim follows from Lemmas 8 and 11.

###### Case II

$`v_{m+1}(X_{m1},X_{m2},\mathrm{},X_1,X_m,X_1)`$ is a proper power.

This case can occur only when $`m3`$, for if $`v_3(X_1,X_2,X_1)`$ were a proper power, then we should have $`X_2=1`$, hence $`X_1,X_2`$ is cyclic, contrary to our assumption that $`\psi `$ has non-cyclic image. It then follows from Lemma 13 that $`v_{m+1}(X_{m1},X_{m2},\mathrm{},X_1,X_m,X_1)`$ has one of four types $`(B1)`$$`(B4)`$. Of these types, $`(B1)`$ cannot occur, for $`(B1)`$ implies $`X_{m1}=X_{m2}=\mathrm{}=X_1=1`$, contrary to the fact that $`X_1,X_2,\mathrm{},X_m`$ is non-cyclic. For a similar reason, $`(B2)`$ cannot occur, either. On the other hand, $`(B4)`$ cannot occur when $`m=3`$, for $`(B4)`$ together with $`m=3`$ implies $`X_2=X_3=X_11`$, contrary to $`X_1,X_2,X_3`$ being non-cyclic. When $`m4`$, $`(B4)`$ implies that $`X_{m1}=X_m=X_11`$, so that $`v_m(X_1,X_2,\mathrm{},X_m)`$ has type $`(B4)`$ as well. Then the claim follows from Lemma 11.

It remains to consider type $`(B3)`$. If $`v_{m+1}(X_{m1},X_{m2},\mathrm{},X_1,X_m,X_1)`$ has type $`(B3)`$, then we have that

$$\begin{array}{c}v_{m+1}(X_{m1},X_{m2},\mathrm{},X_1,X_m,X_1)=\{\begin{array}{cc}v_2(X_{m1},X_m)^{576400^{(m2)}},\hfill & \text{for }m\text{ even}\hfill \\ v_2(X_m,X_{m1})^{576400^{(m2)}},\hfill & \text{for }m\text{ odd},\hfill \end{array}\\ \text{and}X_{m2}=X_{m3}=\mathrm{}=X_1=1.\end{array}$$
$`6.2`$
Then $`(6.2)`$ forces $`v_m(X_1,X_2,\mathrm{},X_m)`$ to have type $`(B1)`$; hence

$$v_m(X_1,X_2,\mathrm{},X_m)=\{\begin{array}{cc}v_2(X_m,X_{m1})^{960400^{(m3)}},\hfill & \text{for }m\text{ even}\hfill \\ v_2(X_{m1},X_m)^{960400^{(m3)}},\hfill & \text{for }m\text{ odd}.\hfill \end{array}$$

Now, by way of contradiction, suppose the contrary of the claim. It then follows that

$$v_2(X_{m1},X_m),v_2(X_m,X_{m1})\text{is  cyclic,}$$

so by Lemmas 1 and 3 that

$$1v_2(X_{m1},X_m)=v_2(X_m,X_{m1}).$$

Applying Lemma 2 to this equality yields the existence of $`TF_m`$ such that

$$X_{m1}=TX_mT^1\text{and}X_m=TX_{m1}T^1.$$
$`6.3`$
Combining these equalities, we see that both $`X_{m1},T`$ and $`X_m,T`$ are cyclic. Here, if $`T1`$, then $`X_{m1},X_m`$ is cyclic; if $`T=1`$, then $`X_{m1}=X_m`$ by $`(6.3)`$. This together with $`(6.2)`$ yields a contradiction to the fact that $`X_1,X_2,\mathrm{},X_m`$ is non-cyclic, which completes the proof of the claim. $`\mathrm{}`$

The proof of Corollary 2 is completed. $`\mathrm{}`$

## Acknowledgements

The author would like to express her sincere thanks to Professor S. V. Ivanov at the University of Illinois at Urbana-Champaign for his valuable comments and kind encouragement. She also thanks the referee for many helpful comments.

## References