Let $G$ be a free group and $a,b\in G$ be such that $a^n=b^n$ for some $n\in\mathbb{Z}$. Then $a=b$.

I followed following way: if rank(G) is 1, then $G$ will be cyclic, and assertion is true.

Since $\langle a,b\rangle$ is subgroup of a free group, it should be free and we can assume that its rank is 2.

Since $a^n=b^n$, we have $$b^{-1}a^nb=a^n.$$ In $a^n=a.a.\cdots.a$ there is no cancellation. We must have that $b\neq a^{-1}$ (otherwise $b^n=a^n=b^{-n}$ i.e. $b^{2n}=1$, contradiction.) Hence last two terms in LHS do not cancel.

If $a\neq b$ then first two terms on LHS will also not cancel. Hence word on LHS is reduced and with length equal to $n+2$, whereas reduced word on RHS has length $n$, a contradiction. So we must have $a=b$.

Is this argument correct? Please suggest if there are different ways to prove this.

The following may also be a way: $\langle a,b\rangle$ is a subgroup of a free group, it is free. It it is of rank $1$, then there exists $c$ such that $a=c^i$ and $b=c^j$. Then $a^n=b^n$ implies $c^{in}=c^{jn}$ where $\langle c\rangle$ is infinite cyclic. We must have $in=jn$ i.e. $i=j$, hence $a=b$.

If rank of $\langle a,b\rangle$ is $2$ then $a^n=b^n$ should imply $a=b$ otherwise $\langle a,b\rangle$ will not be free. Is this correct?

  • 2
    $\begingroup$ You write "Since $\langle a,b \rangle$ is a subgroup of a free group, it should be free and we can assume that its rank is $2$". That's not true in general, take for example the rank 2 free group $G=\langle x,y \rangle$, $a=x^2$, and $b=x^3$, in which case the subgroup $\langle a,b \rangle$ is of rank 1, generated by $ba^{-1}$. $\endgroup$ – Lee Mosher Sep 23 '15 at 13:59
  • $\begingroup$ An analysis of cancellation is probably the way to go, but not based on false assumptions. $\endgroup$ – Lee Mosher Sep 23 '15 at 14:02

Let $\mathrm{lg}(\cdot)$ denote the word length with respect to some fixed free basis.

Let $a$ and $b$ be two elements of a free group satisfying $a^n=b^n$ for some $n \in \mathbb{Z}$. Write $a=u \bar{a} u^{-1}$ and $b=v\bar{b} v^{-1}$ where $\bar{a}$ and $\bar{b}$ are cyclically reduced (ie. any product $\bar{a}^m$ or $\bar{b}^m$ contains no cancellation). Then

$$\left\{ \begin{array}{l} u \bar{a}^n u^{-1} = v \bar{b}^n v^{-1} \\ u \bar{a}^{2n} u^{-1} = v \bar{b}^{2n} v^{-1} \end{array} \right. \Rightarrow \left\{ \begin{array}{l} n \mathrm{lg}(\bar{a})+2 \mathrm{lg}(u) = n \mathrm{lg}(\bar{b})+2 \mathrm{lg}(v) \\ 2n \mathrm{lg}(\bar{a})+2 \mathrm{lg}(u) = 2n \mathrm{lg}(\bar{b})+2 \mathrm{lg}(v) \end{array} \right. \Rightarrow \left\{ \begin{array} \mathrm{lg}(\bar{a})= \mathrm{lg}(\bar{b}) \\ \mathrm{lg}(u)= \mathrm{lg}(v) \end{array} \right.$$

On the other hand, there are no cancellations in the equality $u \bar{a}^n u^{-1} = v \bar{b}^n v^{-1}$, so reading simultanously the words from the left to the right you deduce that $u=v$ and $\bar{a}=\bar{b}$. Thus, $a=b$.


I would go like this:

The equation $a^n = b^n$ (for some $a,b \neq 1$, otherwise the assertion holds since free groups are torsion free and $n \neq 0$ otherwise it is simply not true and $n \neq \pm 1$ since it is then trivially true) implies (as you already wrote) $$b^{-1} a^n b = b^{-1} b^n b = b^n = a^n.$$ But this is nothing else than $$[b, a^{-n}] = 1.$$ Thus $b$ and $a^{-n}$ are two commuting non-trivial elements in a free group, thus $b, a^{-n} \in \langle c \rangle$ for some non-trivial $c \in G$. In particular $b, a^n \in \langle c \rangle$. Thus looking at the Cayley graph of $G$ and setting $m$ to be minimal such that $a^m \in \langle c \rangle$ (and $m \neq 0$), we see that the "line" $\langle c \rangle$ and the "line" $\langle a \rangle$ cross at $a^m$. But this would give us a circuit (which is forbidden since $G$ "is" a tree) unless $k = 1$, i.e. $a \in \langle c \rangle$. Thus $a = c^k$ and $b = c^l$, i.e. $a^n = b^n$ implies $kn = ln$ hence $k=l$ ($n \neq 0$).

  • 1
    $\begingroup$ How the last statement after Edit:? $\endgroup$ – Groups Sep 23 '15 at 15:39
  • $\begingroup$ Actually I'm not sure anymore :) ... maybe i should remove it. $\endgroup$ – M.U. Sep 23 '15 at 15:56

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.