1
$\begingroup$

Problem statement: if $G$ is a group and $a,b\in G$, prove that if $|ab|=k$, then $|ba|=k$.

I'm going to assume one thing: that $|a|$ means $|\langle a \rangle|$, that is, the size of the subgroup generated by $a$.

I argued that the size of each subgroup is less than or equal to the size of the other subgroup, and that therefore, their sizes are equal.

($|ba|\leq |ab|$) Every element $g\in \langle ba \rangle$ has the form $(ba)^n$, where $n\in \mathbb{Z}$. This element can be generated by $n+1$ compositions of $ab$: $(ab)^{n+1}= a(ba)^nb$. This means that every element in $\langle ba\rangle$ can be generated in $\langle ab\rangle$ and that therefore $\langle ab\rangle$ must have at least as many elements as $\langle ba\rangle$.

I used the same reasoning to conclude $|ab|\leq |ba|$.

What is wrong with this reasoning (if at all)?

  • 1
    You can't write "every element $a\in \left$" since $a$ is already bound. You can write "every element $g\in\left$."2012-10-17
  • 0
    Woops, yes, that was a typo. I'm looking for bigger mistakes.2012-10-17
  • 3
    It is not true that every element of $\left$ can be "generated in $\left$." The two subgroups are not necessarily the same, they are just the same size. If you want to prove they are the same size, find a $1-1$ and onto map between these two sets. Or just show that if $(ab)^k=1$ then $(ba)^k=1$. Note that you can define $|g|$ to be the least positive $k$ such that $g^k=1$. That's the more traditional definition, although your definition is equivalent.2012-10-17
  • 0
    You've only shown that if $g\in\left$ then $g=(ab)^k$ for some $k$ and hence $(ab)^{k+1}=agb$. That doesn't show that $g\in\left$2012-10-17
  • 0
    Even more is true: $ab$ and $ba$ are always conjugate, thus they have the same order.2012-10-17

2 Answers 2