This week, we present a guest post by Chu-Wee Lim on Group Theory.

How would you prove the following?

\(G\) is a group such that for every element \( g \in G \), we have \( g^2 = e \). Prove that \(G\) is abelian.

No vote yet

12 votes

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestLet \(a,b \in G\). Note that \((ab)^2 = e\) because \(ab \in G\). So \[e = (ab)^2 = abab\] Hence \[aeb = a(abab)b\] \[ab = (aa)(ba)(bb)\] \[ab = a^2bab^2\] \[ab = ebae\] \[ab = ba\] for all \(a,b \in G\), that is to say \(G\) is abelian.

Log in to reply

We can see it more easily as follows.

The given condition implies \(g=g^{-1}, \forall g \in G\) . Hence

\(ab= (ab)^{-1} = b^{-1}a^{-1}=ba \hspace{5pt} \blacksquare \)

Log in to reply

Yes this is a good exercise but here is another one: let \(G\) be a finite abelian group \(G\) is cyclic \(\Longleftrightarrow |G| = ord(G)\). \( ord(G) =\) the least positive integer \(n\) such that \( g \in G \Longrightarrow g^{n} = e\).

Log in to reply

It says that

\[ g^{m+n} = g^mg^n = (g^m)^n, \]

which isn't true. Apart from that, great post. :)

Log in to reply

Tim, can you clarify what you mean? I do not see that equation written anywhere.

The only relevant statement that I see is the third box, which states that:

This is a correct statement, and different from what you quoted.

Log in to reply

At the time I posted my comment, it said

I remember the strange height difference of the exponents, due to the use of normal brackets as opposed to

`\left(`

and`\right)`

.Log in to reply

"The order of a group G, is the number of elements in G, which we denote by ∣G∣ like in set notation." This holds only if G is finite

Log in to reply

Not necessarily. The post clearly gives examples of groups of infinite cardinality. A group is just like a set, but with a special metric on the set.

Log in to reply

a special metric? please clarify

Log in to reply

Wait; for the extension problem (see below) the problem tells us that \(G\) is cyclic, so the smallest \(g\) such that \(g^n=e\) would be \(2\) right?

Log in to reply