Read a classification theorem without overextending it

Try

List abelian groups of order sixteen by splitting the exponent four into positive parts. The partitions 4,3+1,2+2,2+1+1,1+1+1+1 suggest five products of cyclic groups. Why do arbitrary factorizations of sixteen not provide a reliable classification? Different product descriptions can represent the same group, and a list needs a completeness theorem.

We use additive notation in this lesson. Multiplying an element by an integer means repeated addition, and zero is the identity.

Predict

Can maximum element order distinguish every abelian group of a fixed size? Compare C₄×C₄ with C₄×C₂×C₂. Both have order sixteen and maximum element order four. Predict a finer invariant: count elements killed by multiplication by two.

Experiment

Count coordinatewise; in C₄, two elements satisfy 2x=0, while in C₂ every element does.

Group	Size	Elements killed by 2
C₁₆	16	2
C₈×C₂	16	4
C₄×C₄	16	4
C₄×C₂×C₂	16	8
C₂⁴	16	16

The middle two groups require another invariant: maximum order distinguishes eight from four. Together, these calculations separate all five candidates. A classification theorem will justify that there are no missing abelian types.

Understand

Every finite abelian group is a direct product of cyclic groups of prime-power order. For each prime p, the multiset of exponents in those cyclic factors is unique. First split G into its p-primary subgroups, the elements killed by some power of p. Commutativity ensures closure. Coprime orders force intersections to be trivial, and Bézout identities applied to the prime-power factors of |G| split each element into primary components.

Here is the key existence argument for an abelian p-group of exponent pᵃ. Choose u of order pᵃ. The identity map from ⟨u⟩ to C_(pᵃ) extends to all of G. To see this, suppose a homomorphism is defined on H containing u and choose x outside H. The order of x+H is pᵏ. Put h=pᵏx∈H. Since pᵃx=0, the image of h is killed by p^(a−k), so in C_(pᵃ) it is divisible by pᵏ. Choose y with pᵏy equal to that image and extend by sending x to y. The relation pᵏx=h guarantees representative independence on H+⟨x⟩. Repeating finitely many times extends the map to G.

Identify its target with ⟨u⟩. The resulting map is a retraction: it fixes u. Every g decomposes as its image plus an element of the kernel, and the intersection is zero. Thus G≅⟨u⟩×ker φ. Induction on group size decomposes the kernel into cyclic prime-power factors, proving existence.

For uniqueness, if A=∏C_(p^λᵢ), the number killed by pᵏ is p^(Σmin(k,λᵢ)). Differences of successive base-p logarithms count factors with λᵢ≥k. Further differences recover how many factors have each exact exponent. These counts are invariant under isomorphism, so the multiset is determined.

Apply

Classify abelian groups of order twelve by splitting the order-four and order-three components. The possibilities are C₄×C₃≅C₁₂ and C₂×C₂×C₃≅C₂×C₆. Explain why the coprime-product rule permits these simplifications.

Audit the existence proof’s extension step: show that if two expressions h+jx agree, their coefficient difference is a multiple of pᵏ, exactly the relation the chosen y respects. This is the nontrivial well-definedness check behind the decomposition, not an optional technicality.

Continue

The theorem classifies finite abelian groups only. Group actions next provide tools for nonabelian groups, where orbit sizes and stabilizers reveal structure that cannot be recovered from cyclic products alone.