Classification of Finite Abelian Groups

Core Idea

Every finite abelian group is isomorphic to a direct product of cyclic groups. The primary decomposition uniquely writes any finite abelian group as a p-group product. This classification theorem completely describes all finite abelian group structures.

Explainer

You know two kinds of groups: cyclic groups Z_n (integers mod n under addition, or equivalently groups generated by a single element of order n), and direct products G × H, which combine two groups into a larger one by operating componentwise. The Fundamental Theorem of Finite Abelian Groups says that these two constructions are all you ever need — every finite abelian group is isomorphic to a direct product of cyclic groups of prime-power order.

To see why this is powerful, consider the question: how many distinct abelian groups of order 36 are there, up to isomorphism? Since 36 = 2² · 3², you handle each prime separately. For the prime 2 and p-power 4, you can partition 2 in two ways: as 2 (giving Z₄) or as 1+1 (giving Z₂ × Z₂). For the prime 3 and p-power 9, you similarly get Z₉ or Z₃ × Z₃. The full group is a product of one choice at 2 and one choice at 3, giving four groups total: Z₄ × Z₉, Z₄ × Z₃ × Z₃, Z₂ × Z₂ × Z₉, and Z₂ × Z₂ × Z₃ × Z₃. The theorem guarantees these four are distinct (non-isomorphic) and that there are no others of order 36.

This decomposition is called the primary decomposition: for each prime p dividing the group order, you collect all elements whose order is a power of p into the p-primary component, and the whole group splits as a direct product of its p-primary components. Within each p-primary component, you further decompose into cyclic p-power groups Z_{p^k} in a way determined by the partition of the exponent in the prime factorization.

The uniqueness of the decomposition is as important as its existence. Two abelian groups are isomorphic if and only if they have identical lists of cyclic factors (the invariant factors, or equivalently the elementary divisors). This gives a complete, checkable criterion for isomorphism: to determine whether two finite abelian groups are the same, compute both sets of elementary divisors and compare them. Without this theorem, comparing two large groups could require checking every possible isomorphism. With it, the classification reduces to comparing two lists of integers.