Proving Order of Cyclic Group with Elements a & b is Finite

  • Thread starter Thread starter Metahominid
  • Start date Start date
  • Tags Tags
    Cyclic Group
Metahominid
Messages
22
Reaction score
0

Homework Statement


G is a group. Let a,b be elements of G. If order(ab) is a finite number n, show order(ba) = n as well.


Homework Equations


order(a) = order(<a>) where <a> is the cyclic group generated by a.


The Attempt at a Solution


I do not know. I thought it may be related to how that if a finite cyclic group has order n it is isomorphic to (Zn,+n). Any hints would be good.
 
Physics news on Phys.org
For an elementary proof, you could use this trick:

(ab)(ab)...(ab) = a(ba)(ba)...(ba)b

k parenthesized terms on the left side <--> k-1 on the right
 
If ab has order 3 then (ab)(ab)(ab)=e. Regroup that as a(ba)(ba)b=e. Think about that.
 
Hey, sorry it took me so long to reply. Thank you so much. I chose (ba)^n+1 = b((ab)^n)a = b(e)a =ba, so I took the inverse and got (ba)^n = e. I know I need to prove that n is the smallest integer s.t. that is true, so I assumed there was a k < n s.t. (ba)^k = e. Then I know this implies that (ab)^k = e as well, which is a contradiction so therefore k = n. Thanks again.
 
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