Abstract Algebra Proof (Cyclic cycles & order)

rtw528
Messages
8
Reaction score
0
Prove that if G is a group and aεG, then o(a-1)=o(a)

This is all I have so far:
Assume G is a group and aεG. Because G is a group a has an inverse in the group, a-1 s.t. aa-1=e, which is also in G.
<a>={an|nεZ}. |<a>| is the number of elements in <a> before it cycles back.

Basically all I've done is write what I know about what is given. I have tried to find <a> and <a-1> from a previous problem to see if there is a pattern but I don't see one.
 
Physics news on Phys.org
Can you prove ##<a> = <a^{-1}>##?
 
Or can you show ##(a^n)^{-1}=(a^{-1})^n## and use that to show ##a^n=e## if and only if ##(a^{-1})^n=e##?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top