Folioby Interconnected
Log InSign Up

The Structure of Finite Abelian Groups

We prove the fundamental theorem of finite abelian groups: every finite abelian group is isomorphic to a direct product of cyclic groups. The two canonical forms --- elementary divisors and invariant factors --- are developed, and the classification procedure is illustrated with explicit examples.

FO
Folio Official
March 1, 2026

1 Goal

Our objective is to determine the structure of every finite abelian group completely. Specifically, we will show that every finite abelian group is isomorphic to a direct product of cyclic groups, and that this decomposition is essentially unique.

2 Basic Properties of Cyclic Groups

Proposition 1.
If gcd(m,n)=1, then Z/mnZ≅Z/mZ×Z/nZ.
Proof.
Define φ:Z/mnZ→Z/mZ×Z/nZ by φ(a)=(amodm,amodn). This is a homomorphism. If φ(a)=(0,0), then m∣a and n∣a; since gcd(m,n)=1, we get mn∣a, so a=0 in Z/mnZ. Thus φ is injective, and since ∣Z/mnZ∣=mn=∣Z/mZ×Z/nZ∣, it is an isomorphism. □
Corollary 2.
If n=p1a1​​p2a2​​⋯prar​​ is the prime factorization of n, then
Z/nZ≅Z/p1a1​​Z×Z/p2a2​​Z×⋯×Z/prar​​Z.​

3 Decomposition ofp-Groups

Lemma 3.
Let G be a finite abelian p-group (i.e., ∣G∣=pn). If g∈G is an element of maximal order, then ⟨g⟩ is a direct factor of G: there exists a subgroup H such that G=⟨g⟩×H.

The proof of this lemma proceeds by induction on ∣G∣. The key idea is as follows.

Proof.
Let ∣g∣=pk. We induct on ∣G∣=pn. If k=n, then G=⟨g⟩ and the result is trivial. Suppose k<n.

Let π:G→G/⟨g⟩ be the natural projection. By induction, G/⟨g⟩ decomposes as a direct product of cyclic groups.

For each cyclic direct factor ⟨hˉ⟩ of G/⟨g⟩ (where hˉ=π(h)), we can choose the lift h so that ord(h)=ord(hˉ); this is possible because g has maximal order. Repeating this process yields G=⟨g⟩×H. □
Theorem 4 (Decomposition of finite abelian p-groups).
Every finite abelian p-group G is isomorphic to a direct product of cyclic p-groups:
G≅Z/pa1​Z×Z/pa2​Z×⋯×Z/par​Z,a1​≥a2​≥⋯≥ar​≥1.​
Proof.
By induction on ∣G∣. The preceding lemma gives G=⟨g⟩×H where ∣g∣=pa1​ and ∣H∣<∣G∣. Applying the induction hypothesis to H yields H≅Z/pa2​Z×⋯×Z/par​Z. Since g has maximal order, a1​≥a2​. □

4 Primary Decomposition

Theorem 5 (Primary decomposition).
Let G be a finite abelian group with ∣G∣=p1n1​​p2n2​​⋯prnr​​. Writing Gpi​​ for the Sylow pi​-subgroup of G,
G=Gp1​​×Gp2​​×⋯×Gpr​​.​
Proof.
Since G is abelian, each Sylow subgroup Gpi​​ is unique, hence normal. We have ∣Gpi​​∣=pini​​. Since gcd(pini​​,∏j=i​pjnj​​)=1, it follows that Gpi​​∩∏j=i​Gpj​​={e}. As ∏i​∣Gpi​​∣=∣G∣, we conclude G=Gp1​​×⋯×Gpr​​. □

5 The Fundamental Theorem of Finite Abelian Groups

Combining the results of the previous sections:

Theorem 6 (Fundamental theorem — elementary divisor form).
Every finite abelian group G is isomorphic to a direct product of cyclic groups:
G≅Z/p1a1​​Z×Z/p2a2​​Z×⋯×Z/psas​​Z​
where the pi​ are primes (not necessarily distinct) and ai​≥1. This decomposition is unique up to reordering. The prime powers p1a1​​,…,psas​​ are called the elementary divisors of G.
Proof.
By the primary decomposition theorem, G=Gp1​​×Gp2​​×⋯×Gpr​​ where each Gpi​​ is the Sylow pi​-subgroup. Each Gpi​​ is a finite abelian pi​-group, so by the decomposition theorem for p-groups,
Gpi​​≅Z/piai,1​​Z×Z/piai,2​​Z×⋯×Z/piai,ri​​​Z.
Collecting these factors across all primes gives the desired decomposition. Uniqueness follows from the uniqueness of the decomposition of each p-component (proved below). □
Theorem 7 (Fundamental theorem — invariant factor form).
Every finite abelian group G can be written as
G≅Z/d1​Z×Z/d2​Z×⋯×Z/dt​Z,d1​∣d2​∣⋯∣dt​,di​≥2.​
This decomposition is unique. The integers d1​,…,dt​ are called the invariant factors of G.
Proof.
Starting from the elementary divisor decomposition, we construct the invariant factors as follows. For each prime p, list its elementary divisors in decreasing order: pa1​≥pa2​≥⋯≥parp​​ where a1​≥a2​≥⋯≥arp​​≥1.

Set t=maxp​rp​ (the maximum number of factors across all primes). For j=1,…,t, define
dj​=p∏​paj​(p)
where aj​(p) is the j-th exponent for the prime p (with aj​(p)=0 when j>rp​).

Since a1​(p)≥a2​(p)≥⋯ for each p, we have d1​∣d2​∣⋯∣dt​. By the Chinese Remainder Theorem (gcd(m,n)=1 implies Z/mnZ≅Z/mZ×Z/nZ),
Z/dj​Z≅p∏​Z/paj​(p)Z,
so ∏j​Z/dj​Z agrees with the original elementary divisor decomposition. Uniqueness follows from that of the elementary divisors. □

The elementary divisors and invariant factors carry the same information in different packaging. To pass from elementary divisors to invariant factors, one groups the prime powers by prime and multiplies them together in a specific pattern; the reverse conversion is obtained by factoring each invariant factor into prime powers.

6 Proof of Uniqueness

Theorem 8 (Uniqueness).
The elementary divisor decomposition of a finite abelian group is unique up to reordering.
Proof.
Let p be a prime. From the group G, one can read off intrinsic invariants using the subgroups G[p]={g∈G∣gp=e} and Gp={gp∣g∈G}.

If G≅Z/pa1​Z×⋯×Z/par​Z with a1​≥⋯≥ar​≥1, then ∣G[p]∣=pr, which determines r (the number of cyclic factors in the p-component).

Moreover, G/Gp≅(Z/pZ)r, and the Sylow p-subgroup of Gp is isomorphic to Z/pa1​−1Z×⋯×Z/par​−1Z (with factors of exponent 0 dropped). Iterating this procedure determines each ai​ uniquely. □

7 Classification in Practice

Example 9 (Abelian groups of order 8).
We have ∣G∣=8=23. The partitions of 3 are (3), (2,1), and (1,1,1). The corresponding abelian groups are:
  1. Z/8Z (elementary divisors {8}, invariant factors {8}).

  2. Z/4Z×Z/2Z (elementary divisors {4,2}, invariant factors {2,4}).

  3. Z/2Z×Z/2Z×Z/2Z (elementary divisors {2,2,2}, invariant factors {2,2,2}).

Example 10 (Abelian groups of order 36).
We have 36=22⋅32. The partitions of 2 are (2) and (1,1), for both the 2-part and the 3-part. This gives 2×2=4 groups:
  1. Z/4Z×Z/9Z≅Z/36Z (invariant factors {36}).

  2. Z/4Z×Z/3Z×Z/3Z (invariant factors {3,12}).

  3. Z/2Z×Z/2Z×Z/9Z (invariant factors {2,18}).

  4. Z/2Z×Z/2Z×Z/3Z×Z/3Z≅Z/6Z×Z/6Z (invariant factors {6,6}).

Example 11 (Abelian groups of order 72).
We have 72=23⋅32. There are 3 partitions of 3 and 2 partitions of 2, giving 3×2=6 groups:
  1. Z/8Z×Z/9Z≅Z/72Z.

  2. Z/8Z×Z/3Z×Z/3Z.

  3. Z/4Z×Z/2Z×Z/9Z.

  4. Z/4Z×Z/2Z×Z/3Z×Z/3Z.

  5. Z/2Z×Z/2Z×Z/2Z×Z/9Z.

  6. Z/2Z×Z/2Z×Z/2Z×Z/3Z×Z/3Z.

8 Exponent and Rank

Definition 12.
For a finite abelian group G:
  • The exponentexp(G) is the least common multiple of the orders of all elements of G. In the invariant factor form, exp(G)=dt​ (the largest invariant factor).

  • The rank of G is the number of factors in the elementary divisor decomposition.

Proposition 13.
G is cyclic ⇔exp(G)=∣G∣⇔G has exactly one invariant factor.

9 Summary

  • Every finite abelian group decomposes as a direct product of cyclic groups (in both the elementary divisor form and the invariant factor form).

  • The decomposition is unique, providing a complete classification of finite abelian groups.

  • The classification reduces to the prime factorization of the group order: for each prime power, one enumerates partitions.

  • The theory of abelian groups is, in this sense, "complete"— a striking contrast to the vastly more complex structure theory of non-abelian groups.

Group TheoryAlgebraTextbookFinite Abelian GroupsStructure Theorem
FO
Folio Official

Mathematics "between the lines" — exploring the intuition textbooks leave out, written in LaTeX on Folio.

1 followers·107 articles
Group Theory TextbookPart 9 of 11
Previous
Direct and Semidirect Products
Next
Composition Series and the Jordan--Hölder Theorem

Share your expertise with the world

Write articles with LaTeX support, build your audience, and earn from your knowledge.

Start Writing — It's Free

More from Folio Official

Folio Official·March 1, 2026

Cosets and Lagrange's Theorem

Beginning with the definition of cosets of a subgroup, we prove Lagrange's theorem --- the assertion that the order of a subgroup divides the order of the group. As applications, we derive Fermat's little theorem and Euler's theorem, and we exhibit the alternating group A_4 as a counterexample to the converse.

Group TheoryAlgebraTextbook
2
Folio Official·March 1, 2026

Composition Series and the Jordan--Hölder Theorem

We introduce normal series and composition series, establishing the framework for decomposing a group into simple factors. The Jordan--Hölder theorem proves the uniqueness of the composition factors, and we develop the theory of solvable groups with its connections to the derived series.

Group TheoryAlgebraTextbook
1
Folio Official·March 1, 2026

The Homomorphism Theorems

We prove the three isomorphism theorems: the first (the image of a homomorphism is isomorphic to the quotient by its kernel), the second (the diamond isomorphism theorem), and the third (cancellation of nested quotients). Each theorem is illustrated with concrete examples and commutative diagrams.

Group TheoryAlgebraTextbook
Folio Official·March 1, 2026

Group Actions and the Class Equation

We introduce group actions and develop the orbit-stabilizer theorem, Burnside's lemma, and the class equation. Applications include the proof that the center of a p-group is nontrivial, the classification of groups of order p^2, the fixed-point theorem for p-groups, and Cayley's theorem.

Group TheoryAlgebraTextbook