Questions: Classification of Finite Abelian Groups

Question 1

How many non-isomorphic abelian groups of order 36 exist, according to the Classification Theorem?

• A. 2, corresponding to the cyclic group Z/36Z and one non-cyclic option
• B. 3, one for each prime divisor of 36
• C. 4, obtained by independently choosing the structure of the 2-primary and 3-primary parts
• D. 6, one for each divisor of 36 greater than 1

Answer: (C)

36 = 2² × 3². For each prime, we count abelian groups of that prime-power order. For the 2-primary part (order 4): either Z/4Z or Z/2Z × Z/2Z — two choices. For the 3-primary part (order 9): either Z/9Z or Z/3Z × Z/3Z — two choices. The full group is the direct product of these independent parts: 2 × 2 = 4 non-isomorphic abelian groups. The key technique is factoring the order into prime powers and counting the integer partitions of each exponent, independently for each prime.

Question 2

Two finite abelian groups both have order 12. Group G has elementary divisors {4, 3} and group H has elementary divisors {2, 2, 3}. According to the Classification Theorem:

• A. G and H are isomorphic, because isomorphic groups must have the same order and both have order 12
• B. G and H are non-isomorphic, because they have different elementary divisors
• C. We cannot determine isomorphism without knowing their generating sets
• D. G and H are isomorphic if and only if they have the same number of elements of each order

Answer: (B)

The uniqueness clause of the Classification Theorem is the key: two finite abelian groups are isomorphic if and only if they have identical multisets of elementary divisors. G ≅ Z/4Z × Z/3Z ≅ Z/12Z (cyclic, has an element of order 12). H ≅ Z/2Z × Z/2Z × Z/3Z ≅ Z/2Z × Z/6Z (not cyclic — its maximum element order is 6). Same order, different structure. Equal order is necessary but not sufficient for isomorphism; identical elementary divisors are both necessary and sufficient.

Question 3

Two finite abelian groups are isomorphic if and only if they have the same order.

• T. True
• F. False

Answer: False

Order is necessary but not sufficient. The canonical counterexample: Z/4Z and Z/2Z × Z/2Z both have order 4 but are not isomorphic. Z/4Z has an element of order 4; Z/2Z × Z/2Z has no element of order greater than 2. Their elementary divisors differ — {4} versus {2, 2} — which is what the Classification Theorem uses to distinguish them. Among finite abelian groups, the complete isomorphism invariant is the multiset of elementary divisors, not just the order.

Question 4

Every finite abelian group is isomorphic to a direct product of cyclic groups of prime power order, and this decomposition is unique up to the ordering of the factors.

• T. True
• F. False

Answer: True

This is the Classification Theorem itself. Existence: every finite abelian group decomposes into prime-power cyclic factors (via its p-primary components). Uniqueness: the multiset of those prime-power factors is completely determined by the group — two decompositions of the same group must yield the same factors up to reordering. Together, these clauses give a complete, non-redundant classification: to check if two finite abelian groups are isomorphic, compute their elementary divisors and compare the lists.

Question 5

Why does the uniqueness part of the Classification Theorem matter? What would be missing if we only knew that every finite abelian group is a product of prime-power cyclic groups, without knowing the decomposition is unique?

Model answer: Without uniqueness, the theorem would confirm that every group can be built from cyclic prime-power pieces, but it couldn't tell us whether two different-looking decompositions represent the same group or different ones. The classification would be a list of possibilities with no guarantee of completeness or non-redundancy. Uniqueness makes the decomposition a complete isomorphism invariant: two finite abelian groups are isomorphic if and only if their elementary divisors agree. This gives a decision procedure — compare two lists — and guarantees the catalog is both exhaustive (every group appears) and non-redundant (no group appears twice).

The analogy is prime factorization of integers: knowing every integer has a prime factorization is useful, but the fundamental theorem of arithmetic — that it is unique — is what makes prime factorization a complete description of multiplicative structure. Without uniqueness, 12 = 4 × 3 = 2 × 6 would leave open whether these represent the same number or different structures. Uniqueness in the group classification plays exactly the same role.