Let $a$ be a group element of order $n$. Prove the order of $a^{-1}$ is $n$.

Prove the following: The order of $a^{-1}$ is the same as the order of $a$.

Would this be the correct proof?

$a^n=e$ then

$e=(a^{-1})^n$ and let $m=$ord$(a^{-1})$. Then $m \le n$.

and $(a^{-1})^m = e$ then $e=a^m$. It must be that $n \le m$. In conclusion $m=n$.

• This is correct. – alex Mar 4 '14 at 21:47
• I feel like you could add a bit of extra detail explaining why $a^n=e$ implies $(a^{-1})^n=e$. – Joshua Pepper Mar 4 '14 at 21:48
• What happened to $b$ and $c$? – alex Mar 4 '14 at 21:49
• The tag "order theory" has nothing to do with the order of an element in a group. – amWhy Mar 4 '14 at 22:00

Let $d$ be the order of $a^{-1}$.

First, $a$ and $a^{-1}$ commute. So, as $aa^{-1} = e$: $$e = (aa^{-1})^n = a^n (a^{-1})^n$$ This proves that $d|n$.

As $(a^{-1})^{-1} = a$, by symetry we get $n|d$.

Conclusion: $d=n$.

$$a^n=e$$ $$a^{n-1}=a^{-1}$$ $$(a^{-1})^n=a^{n(n-1)}=e^{n-1}=e$$

Here I have used some basic group operation identities.

• You only showed that the order of $a^{-1}$ divides $n$. – Joshua Pepper Mar 4 '14 at 22:01