Elements of odd-order abelian groups are squares.

Click For Summary

Homework Help Overview

The discussion revolves around a problem concerning finite abelian groups, specifically focusing on the assertion that every element of such a group is a square when the group's order is odd. Participants are exploring the implications of the group's properties and the necessity of the abelian condition in the context of the problem.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants discuss the proof structure, questioning the necessity of the abelian property for the original assertion and its implications for a related problem involving surjectivity of a mapping in groups. They also consider the implications of Lagrange's theorem and the nature of cyclic subgroups.

Discussion Status

The discussion is active, with participants providing feedback on each other's reasoning and exploring different interpretations of the problem's requirements. Some guidance has been offered regarding the relationship between abelian groups and the general case, but no consensus has been reached on the necessity of the abelian condition for the second question.

Contextual Notes

There are mentions of potential typos in the original problem statement and the need for clarification on the role of abelian properties in the second assertion, which is not explicitly stated in the problem but is implied by the context.

Kreizhn
Messages
714
Reaction score
1

Homework Statement


Let G be a finite abelian group, and assume that |G| is odd. Show that every element of G is a square.

The Attempt at a Solution



So we want to show that [itex]\forall g \in G, \exists h \in G, g = h^2[/itex]. Let [itex]g \in G[/itex] be arbitary, and consider the subgroup generated by g, denoted <g>. By Lagrange's theorem, [itex]|<g>| \big| |G|[/itex] and so the order of g (which I will denote by |g|) must also divide |G|. Since |G| is odd, this means that |g| is also odd. In particular, choose [itex]n \in \mathbb N[/itex] such that |g| = 2n+1. Then
[tex]g^{2n+1} = g^{2n} g = (g^n)^2 g = e.[/tex]
Define [itex]h=g^{-n}[/itex] so that this becomes
[tex](h^{-1})^2 g = h^{-2} g = e[/tex]
so that the result follows.

Now I can't see where I've used the fact that G is abelian, which makes me think I've done something wrong. Can anyone point out the error, if there is one?

Edit: Fixed mistake, [itex]h = g^{-n}[/itex].
 
Last edited:
Physics news on Phys.org
Hi Kreizhn! :smile:

Your proof looks good. In fact, you proved the slightly more general theorem


if g is an element of group G and if g has odd order, then g is a square.​

I don't quite see why they assume G to be abelian, though. In fact, the theorem for abelian groups implies the theorem for general groups. Indeed, take g in a general group G with odd order, then <g> is abelian with odd order and the theorem applies...
 
A little pedantry:

Kreizhn;3345909 By Lagrange's theorem said:
<g> \big| |G| [/itex]

This should be |<g>| | |G|.
 
micromass said:
A little pedantry:
This should be |<g>| | |G|.

Thanks, I fixed it. That's what I thought. I wonder if maybe the author didn't just get overzealous or make a funny mistake. The next question in the book I'm working through is a generalization of that question, and I think abelianism might be needed there.

Let G be a finite (abelian) group with order |G| = n, and take k any integer coprime to n. Show that the mapping [itex]g \mapsto g^k[/itex] is surjective.

I haven't finished it yet, but we need the group to be abelian for [itex]g \mapsto g^k[/itex] to be a group homomorphism and I figure that's going to be important.

In an interesting note, he actually puts abelian in the first question, but NOT in the second. I have his errata in front of me, which is how I know (abelian) is supposed to show up for the generalization. Maybe he just put abelian in the wrong spot :smile:
 
Wait a tick. I don't think we need abelian in the second question either.

micromass said:
I don't quite see why they assume G to be abelian, though. In fact, the theorem for abelian groups implies the theorem for general groups. Indeed, take g in a general group G with odd order, then <g> is abelian with odd order and the theorem applies...

Is the point here that we can write
[tex]G = \bigcup_{g \in G} \langle g \rangle[/tex]?
If this is the case, then we again need only show that [itex]g \mapsto g^k[/itex] is surjective on the cyclic subgroups.
 
Hmm, the books seems to contain a lot of typos :smile:
I'm not even sure if abelianness is needed for the second assertion. We need it for being a homomorphism, but perhaps not for surjectivity...
 
Kreizhn said:
Wait a tick. I don't think we need abelian in the second question either.



Is the point here that we can write
[tex]G = \bigcup_{g \in G} \langle g \rangle[/tex]?
If this is the case, then we again need only show that [itex]g \mapsto g^k[/itex] is surjective on the cyclic subgroups.

Yes, that's what I had in mind :smile:
 
This is what I have.

Since [itex]\gcd(k,n) = 1[/itex] it is necessary that [itex]\exists a,b \in \mathbb Z[/itex] such that ak + bn = 1. Let [itex]g \in G[/itex] be an arbitary element, and consider the cyclic subgroup [itex]\langle g \rangle[/itex]. By Lagrange's theorem, [itex]\exists m \in \mathbb Z[/itex] such that n = |g| m and so
[tex]ak + bm|g| = 1.[/tex]
Now we claim that [itex]\phi: G \to G, g \mapsto g^k[/itex] is surjective. Since the cyclic subgroup is abelian, [itex]\phi\bigg|_{\langle g \rangle}[/itex] is a homomorphism. We want to show that [itex]\phi\bigg|_{\langle g \rangle}[/itex] is surjective on [itex]\langle g \rangle[/itex]. Indeed, let [itex]g^r \in \langle g \rangle[/itex], then

[tex]\phi(g^{ar}) = g^{akr} = g^{r-bm|g|r} = g^r (g^{|g|})^{bmr} = g^r[/tex]

and so the function is surjective on cyclic subgroups.

Here's the only thing that jumps in my head. Hopefully it's trivial. Since [itex]\phi\bigg|_{\langle g \rangle}[/itex] is surjective on all cyclic subgroups, it's surjective as a set mapping on the entire group G. However, it needn't be a homomorphism. Luckily, we were never asked that it be a homomorphism.
 
Seems ok! :smile:
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
2
Views
1K