Processing math: 100%
Jump to content

Recommended Posts

Posted

Ok, let's make it more interesting!

 

Let G be a group, and suppose there exist three consecutive integers: n-1, n, n+1 such that: (ab)^{n-1} = a^{n-1} b^{n-1}, (ab)^n = a^n b^n, (ab)^{n+1} = a^{n+1} b^{n+1}, \forall a,b \in G. Show that G is abelian. Also show that such a conclusion needs not hold if the condition is assumed for only two consecutive integers.

Posted

 

  Reveal hidden contents

Any reason you keep posting random problems? I know you say they aren't homework, but it certainly seems like they might be.

Posted
  On 5/23/2011 at 12:03 AM, Obelix said:

Ok, let's make it more interesting!

 

Let G be a group, and suppose there exist three consecutive integers: n-1, n, n+1 such that: (ab)^{n-1} = a^{n-1} b^{n-1}, (ab)^n = a^n b^n, (ab)^{n+1} = a^{n+1} b^{n+1}, \forall a,b \in G. Show that G is abelian. Also show that such a conclusion needs not hold if the condition is assumed for only two consecutive integers.

 

 

Making it interesting would be good. But this isn't interesting -- just parlor tricks.

 

We have (ab)^{n-1} = a^{n-1} b^{n-1}, (ab)^n = a^n b^n, (ab)^{n+1} = a^{n+1} b^{n+1}, \forall a,b \in G and taking inverses (ab)^{1-n} = b^{1-n} a^{1-n}, (ab)^{-n} = b^{-n}n a^{-n}, (ab)^{-n-1} = b^{-n-1} a^{-n-1}, \forall a,b \in G

 

So

 

ab = (ab)^n(ab)^{1-n} = a^nb^nb^{1-n}a^{1-n} = a^nba^{1-n}

 

ab = (ab)^{n+1}(ab)^{-n} = a^{n+1}b^{n+1}b^{-n}a^{-n} = a^{n+1}ba^{-n}

 

Thus a^nba^{1-n} = a^{n+1}ba^{-n} multiplying on the left by a^{-n} and on the right by a^n we have ba=ab . QED

 

 

As to the insufficiency of two of the three conditions, consider a non-abelian group G of order n, for some n. The last two conditions are satisfied. since a^n=1 \ \ \forall a \in G

 

I am about through with this sort of thing.

Posted
!

Moderator Note

moved to homework help. Please read our rules and post threads in their rightful place, Obelix; don't evade our rules by posting homework problems in other forums.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.