Horrible problem about abelian groups

  • Thread starter Thread starter Oster
  • Start date Start date
  • Tags Tags
    Groups
Oster
Messages
84
Reaction score
0
G is a group and for all elements a,b in G,
(ab)^i = (a^i)(b^i) holds for 3 consecutive positive integers.
Show that G is abelian.

I know how to prove that if (ab)^2 = (a^2)(b^2) then G is abelian. I was thinking that you could reduce the given equality integer by integer till 2 or something like that, but all I have been able to do so far is use the cancellation laws to get some gibberish. HAALP!
 
Physics news on Phys.org
OK, we can do this all formally, but it's best to do with an example. Let's assume that

aaaabbbb = abababab

aaaaabbbbb = ababababab

aaaaaabbbbbb = abababababab

Let's deal with the first two equalities first. Substitute abababab=aaaabbbb into aaaaabbbbb.
Can you use this to prove that abababab = babababa ??
 
baabaa black sheep
 
starting with the 2nd equation, using the left and right cancellation laws on a and b you get
aaaabbbb =babababa. Using this is with the first equation yields babababa=abababab
 
OK, now do the same with the second and the third equation.
 
3rd equation => aaaaabbbbb=bababababa
plugging into the 2nd gives bababababa=ababababab
then plug in babababa=abababab to cancel and get ab=ba
=D
thank you@!
 
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