Thread: G is a group all of whose elements have order two: a^2=1, prove that it is abelian.

Please can you help me with this question?

Let G be a group all of whose elements have order two: a^2=1 for every aEG.

(i) Prove that G is abelian

(ii) If G is finite, prove its order is of power of two.

I know that abelian is another way of saying commutative, which I understand this as being when you apply a group operation to two group elements, that the result does not depend on its order.
However, I do not understand how to apply this to my question, and do not understand where a^2=1 will come into it (unless obviously its for part (ii)).

I don't know where to begin on part(ii) and are unsure if part (i) will help me with this.
Any help will be great
Thanks

Originally Posted by imagenius

Please can you help me with this question?

Let G be a group all of whose elements have order two: a^2=1 for every aEG.

(i) Prove that G is abelian

(ii) If G is finite, prove its order is of power of two.

I know that abelian is another way of saying commutative, which I understand this as being when you apply a group operation to two group elements, that the result does not depend on its order.
However, I do not understand how to apply this to my question, and do not understand where a^2=1 will come into it (unless obviously its for part (ii)).

I don't know where to begin on part(ii) and are unsure if part (i) will help me with this.
Any help will be great
Thanks

let a and b be any two elements in your group. then . As and then...

Originally Posted by imagenius

Please can you help me with this question?

Let G be a group all of whose elements have order two: a^2=1 for every aEG.

(i) Prove that G is abelian

(ii) If G is finite, prove its order is of power of two.

I know that abelian is another way of saying commutative, which I understand this as being when you apply a group operation to two group elements, that the result does not depend on its order.
However, I do not understand how to apply this to my question, and do not understand where a^2=1 will come into it (unless obviously its for part (ii)).

I don't know where to begin on part(ii) and are unsure if part (i) will help me with this.
Any help will be great
Thanks

assume there are more than two elements in G(if there are only two elements then there is nothing to prove).
let be two distinct elements in G. then . hence . (can you justify this?)

for the second part apply cauchy's theorem. the fact that for all will be required.

thanks for your reply. I understand where the 1st thing is coming from but sorry I dont understand the 2nd part you've found what n equals?

Originally Posted by imagenius

thanks for your reply. I understand where the 1st thing is coming from but sorry I dont understand the 2nd part you've found what n equals?

i don't understand what exactly are you asking.... can you please repost?

Originally Posted by abhishekkgp

assume there are more than two elements in G(if there are only two elements then there is nothing to prove).
let be two distinct elements in G. then . hence . (can you justify this?)

for the second part apply cauchy's theorem. the fact that for all will be required.

Ok I understand the 1st bit about how to prove its abelian now. So am I right in saying a^2=1 is used for (ii)?

Originally Posted by imagenius

Ok I understand the 1st bit about how to prove its abelian now. So am I right in saying a^2=1 is used for (ii)?

we had taken two arbitrary distinct elements in G and we showed that they commute. this is what it takes G to be abelian. that's settled.
in the second part we do require that a^2=1 for all a in G. see cauchy's theorem to prove the second part.

suppose q is an odd prime dividing |G|. then (by cauchy's theorem), G has an element of order q. but all the elements of G satisfiy a^2 = e.

so...?