Finitely Generated Abelian Groups - Structure Theorems

In abstract algebra, the study of groups is a fundamental area. Abelian groups, where the group operation is commutative, hold a special place due to their simpler structure. When we consider abelian groups that are "finitely generated," meaning every element can be expressed as a combination of a finite set of generators, we enter a realm where profound structure theorems reveal their organization completely. These theorems are crucial for understanding the nature of such groups and have wide-ranging applications in various branches of mathematics, including number theory and algebraic topology.

1. Definitions and Preliminaries

Before diving into the structure theorems, it's essential to be clear about the definitions.

1.1 Abelian Group

An abelian group is a set G equipped with a binary operation '*' such that:

• Closure: For any a, b in G, a * b is in G.
• Associativity: For any a, b, c in G, (a * b) * c = a * (b * c).
• Identity Element: There exists an element e in G such that for any a in G, a * e = e * a = a.
• Inverse Element: For each a in G, there exists an element a^-1 in G such that a * a^-1 = a^-1 * a = e.
• Commutativity: For any a, b in G, a * b = b * a.

The most common examples are the additive group of integers $(\mathbb{Z}, +)$ and the additive group of rational numbers $(\mathbb{Q}, +)$.

1.2 Finitely Generated Group

A group G is called finitely generated if there exists a finite subset S = {g₁, g₂, ..., g_n} of G such that every element g in G can be expressed as a product of elements from S and their inverses. For an abelian group, this means every element can be written as $g = g_{1}^{k_1} * g_{2}^{k_2} * \dots * g_{n}^{k_n}$ for some integers $k_1, k_2, \dots, k_n$.

For abelian groups, the order of generators does not matter due to commutativity. If the group operation is addition, an element g is written as $g = k_1 g_1 + k_2 g_2 + \dots + k_n g_n$.

1.3 Subgroup

A subset H of a group G is a subgroup if H itself forms a group under the same operation as G.

1.4 Order of an Element

The order of an element g in a group G is the smallest positive integer n such that gⁿ = e (the identity element). If no such positive integer exists, the element has infinite order.

1.5 Cyclic Group

A cyclic group is a group that can be generated by a single element. For example, $(\mathbb{Z}, +)$ is a cyclic group generated by 1 (or -1).

2. The Fundamental Theorem of Finitely Generated Abelian Groups

This theorem is the cornerstone for understanding the structure of any finitely generated abelian group. It states that any such group can be decomposed into a direct product of cyclic groups. There are two common, but equivalent, ways to state this theorem.

2.1 First Isomorphism Theorem Statement (Invariant Factor Form)

Every finitely generated abelian group G is isomorphic to a direct product of cyclic groups of the form: $G \cong \mathbb{Z}_{n_1} \times \mathbb{Z}_{n_2} \times \dots \times \mathbb{Z}_{n_k} \times \mathbb{Z} \times \mathbb{Z} \times \dots \times \mathbb{Z}$ where $n_1, n_2, \dots, n_k$ are integers greater than 1, and each $n_i$ divides $n_{i+1}$ for $i = 1, \dots, k-1$. The integers $n_1, n_2, \dots, n_k$ are called the invariant factors of G, and the number of $\mathbb{Z}$ factors is the rank of G.

The sequence of invariant factors (and the rank) is unique for each group G. This uniqueness is crucial because it means we can classify finitely generated abelian groups up to isomorphism.

2.2 Second Isomorphism Theorem Statement (Primary Decomposition Form)

Every finitely generated abelian group G is isomorphic to a direct product of cyclic groups of the form: $G \cong \mathbb{Z}_{p_1^{a_{11}}} \times \dots \times \mathbb{Z}_{p_1^{a_{1r_1}}} \times \mathbb{Z}_{p_2^{a_{21}}} \times \dots \times \mathbb{Z}_{p_2^{a_{2r_2}}} \times \dots \times \mathbb{Z}_{p_m^{a_{m1}}} \times \dots \times \mathbb{Z}_{p_m^{a_{mr_m}}} \times \mathbb{Z}^d$ where:

• $p_1, p_2, \dots, p_m$ are distinct prime numbers.
• $a_{ij}$ are positive integers.
• The $p_i^{a_{ij}}$ terms are the elementary divisors of G.
• $d$ is the rank of G (the number of infinite cyclic factors).

The set of elementary divisors $\{p_i^{a_{ij}}\}$ is unique for each group G. This form is particularly useful for understanding the torsion subgroup of G.

2.3 Rank of a Finitely Generated Abelian Group

The rank of a finitely generated abelian group G is the number of $\mathbb{Z}$ factors in its direct product decomposition. It is also equal to the dimension of the vector space $G \otimes_{\mathbb{Z}} \mathbb{Q}$ over $\mathbb{Q}$. Intuitively, it represents the number of "independent directions" in the group that are not "torsion."

For a finitely generated abelian group G, its rank is the same as the rank of any subgroup H, provided that the index of H in G is finite.

2.4 Torsion Subgroup

For any finitely generated abelian group G, we can decompose it as $G = T \oplus F$, where T is the torsion subgroup and F is a free abelian group (a direct product of $\mathbb{Z}$ factors).

The torsion subgroup T consists of all elements of finite order in G. If T is trivial (contains only the identity element), then G is a free abelian group.

The rank of G is the rank of F. The structure of T is determined by the elementary divisors.

3. Proof Sketch of the Fundamental Theorem (Invariant Factor Form)

The proof is constructive and relies on induction or a process of reducing a matrix of relations. Here's a simplified outline:

3.1 Case 1: G is free abelian

If G is finitely generated and free, it is isomorphic to $\mathbb{Z}^d$ for some $d \ge 0$. This is the base case.

3.2 Case 2: G is not free abelian

Suppose G is generated by $\{g_1, \dots, g_n\}$. We can express G as a quotient of a free abelian group. Let $F = \mathbb{Z}^n$ be a free abelian group with basis $\{e_1, \dots, e_n\}$. We can define a surjective homomorphism $\phi: F \to G$ by $\phi(e_i) = g_i$.

By the First Isomorphism Theorem for groups, $G \cong F / \ker(\phi)$. The kernel, $\ker(\phi)$, is a subgroup of F. Since F is finitely generated, and any subgroup of a free abelian group of finite rank is also free abelian, $\ker(\phi)$ is also free abelian. Let $\ker(\phi) \cong \mathbb{Z}^m$.

So, $G \cong \mathbb{Z}^n / \mathbb{Z}^m$. This is where the reduction process comes in. We can choose a basis for $\mathbb{Z}^n$ and $\mathbb{Z}^m$ such that the generators of $\mathbb{Z}^m$ are related to the generators of $\mathbb{Z}^n$ in a specific way, leading to the invariant factor decomposition.

Alternatively, using the primary decomposition: Let G be a finitely generated abelian group. Let $T$ be its torsion subgroup. Then $T$ is also finitely generated and is a finite direct product of cyclic groups of prime power order. $G/T$ is a free abelian group of finite rank $d$. So, $G \cong T \oplus \mathbb{Z}^d$. The torsion subgroup $T$ can be written as $T \cong \mathbb{Z}_{n_1} \times \dots \times \mathbb{Z}_{n_k}$, where $n_i > 1$. Combining these, $G \cong \mathbb{Z}_{n_1} \times \dots \times \mathbb{Z}_{n_k} \times \mathbb{Z}^d$. The uniqueness of this decomposition (up to isomorphism) is proven using properties of modules over principal ideal domains, specifically $\mathbb{Z}$.

4. Examples and Applications

4.1 Example 1: A simple abelian group

Consider the abelian group $G = \mathbb{Z}_4 \times \mathbb{Z}_6$. This group is finitely generated.

Using Primary Decomposition: $\mathbb{Z}_4 \cong \mathbb{Z}_{2^2}$ $\mathbb{Z}_6 \cong \mathbb{Z}_2 \times \mathbb{Z}_3$ So, $G \cong \mathbb{Z}_{2^2} \times \mathbb{Z}_2 \times \mathbb{Z}_3$. Combining the factors with the same prime base: $G \cong (\mathbb{Z}_{2^2} \times \mathbb{Z}_2) \times \mathbb{Z}_3$ The torsion subgroup part $\mathbb{Z}_{2^2} \times \mathbb{Z}_2$ can be further decomposed. The elementary divisors are $2^2=4$ and $2$. So, $G \cong \mathbb{Z}_4 \times \mathbb{Z}_2 \times \mathbb{Z}_3$. Here, the elementary divisors are 4, 2, and 3. The rank is 0 (no $\mathbb{Z}$ factors).

Using Invariant Factors: We need to express $G \cong \mathbb{Z}_{n_1} \times \dots \times \mathbb{Z}_{n_k} \times \mathbb{Z}^d$ with $n_i | n_{i+1}$. From the primary decomposition $G \cong \mathbb{Z}_4 \times \mathbb{Z}_2 \times \mathbb{Z}_3$. We can see that $n_1$ must be the largest prime power factor, which is 4. The remaining factors are $\mathbb{Z}_2$ and $\mathbb{Z}_3$. We need to combine them to form the next invariant factor. The product of the remaining elementary divisors is $2 \times 3 = 6$. So, $G \cong \mathbb{Z}_6 \times \mathbb{Z}_4$. Here, $n_1 = 4$ and $n_2 = 6$. Check the divisibility condition: $n_1 | n_2$? Does $4 | 6$? No. This is not the invariant factor form. Let's re-examine the primary decomposition: $G \cong \mathbb{Z}_{2^2} \times \mathbb{Z}_2 \times \mathbb{Z}_3$. The elementary divisors are $4, 2, 3$. To get invariant factors, we group by primes: Prime 2: $2^2, 2$ Prime 3: $3$ We need to form the largest possible invariant factor first. Largest prime power factor is $2^2=4$. So $n_k=4$. Next largest is $3^1=3$. So $n_{k-1}=3$. Next largest is $2^1=2$. So $n_{k-2}=2$. This gives $\mathbb{Z}_4 \times \mathbb{Z}_3 \times \mathbb{Z}_2$. The invariant factors should be ordered $n_1 | n_2 | \dots$. Let's try forming invariant factors directly. $G = \mathbb{Z}_4 \times \mathbb{Z}_6$. We can express $\mathbb{Z}_6$ as $\mathbb{Z}_2 \times \mathbb{Z}_3$. So $G = \mathbb{Z}_4 \times \mathbb{Z}_2 \times \mathbb{Z}_3$. To find invariant factors, we can think of this as a matrix problem or use the prime power decomposition. The prime powers dividing the orders of elements are $2^2, 2, 3$. The highest power of 2 is $2^2=4$. The highest power of 3 is $3^1=3$. So, the invariant factors are $n_1=4$ and $n_2=3$? No, the condition is $n_i | n_{i+1}$. Let's use the property that $G \cong \mathbb{Z}_{n_1} \times \dots \times \mathbb{Z}_{n_k}$ if and only if $n_1 | n_2 | \dots | n_k$ and the prime factorization of $n_1 \dots n_k$ corresponds to the product of elementary divisors. From $G \cong \mathbb{Z}_{2^2} \times \mathbb{Z}_2 \times \mathbb{Z}_3$, the elementary divisors are $\{4, 2, 3\}$. The invariant factors are obtained by taking the highest power of each prime that divides any elementary divisor, and then ensuring the divisibility condition. Highest power of 2: $4$. Highest power of 3: $3$. So, potential invariant factors are 4 and 3. But $3 \nmid 4$. Let's use the formal procedure: The group is generated by $(1,0)$ and $(0,1)$ with relations $4(1,0)=(0,0)$ and $6(0,1)=(0,0)$. This corresponds to the matrix $\begin{pmatrix} 4 & 0 \\ 0 & 6 \end{pmatrix}$. We want to bring this matrix to diagonal form by elementary row and column operations over $\mathbb{Z}$. $\begin{pmatrix} 4 & 0 \\ 0 & 6 \end{pmatrix} \to \begin{pmatrix} 2 & 0 \\ 0 & 12 \end{pmatrix}$ (multiply second row by 2, first column by 1/2 - not allowed, must use integer ops). Use GCD. GCD(4,6) = 2. $\begin{pmatrix} 4 & 0 \\ 0 & 6 \end{pmatrix} \xrightarrow{R_1 \leftarrow R_1 - R_2} \begin{pmatrix} 4 & 0 \\ -2 & 6 \end{pmatrix} \xrightarrow{C_1 \leftrightarrow C_2} \begin{pmatrix} 0 & 4 \\ 6 & -2 \end{pmatrix} \xrightarrow{R_1 \leftrightarrow R_2} \begin{pmatrix} 6 & -2 \\ 0 & 4 \end{pmatrix}$ $\xrightarrow{R_1 \leftarrow R_1 + R_2} \begin{pmatrix} 6 & 2 \\ 0 & 4 \end{pmatrix} \xrightarrow{R_1 \leftarrow R_1 - R_2} \begin{pmatrix} 6 & -2 \\ 0 & 4 \end{pmatrix}$ Let's use Euclidean algorithm on the entries. $\begin{pmatrix} 4 & 0 \\ 0 & 6 \end{pmatrix}$. GCD(4,6)=2. We can transform this to $\begin{pmatrix} 2 & 0 \\ 0 & 12 \end{pmatrix}$ using column operations. $C_2 \leftarrow C_2 - C_1$. $\begin{pmatrix} 4 & 0 \\ 0 & 6 \end{pmatrix} \xrightarrow{C_2 \leftarrow C_2 - C_1} \begin{pmatrix} 4 & -4 \\ 0 & 6 \end{pmatrix}$. This is not leading to diagonal form easily. The standard procedure is to find the GCD of all entries. Let $d_1 = \text{gcd}(4,0,0,6) = 2$. Then find the GCD of all $2 \times 2$ submatrices. $\text{gcd}(4 \times 6 - 0 \times 0) = 24$. The invariant factors $n_1, \dots, n_k$ are such that $n_1$ is the gcd of all entries, $n_2$ is the gcd of the determinants of $2 \times 2$ submatrices divided by $n_1$, etc. This approach is complex. Let's stick to the elementary divisors. $G \cong \mathbb{Z}_{2^2} \times \mathbb{Z}_2 \times \mathbb{Z}_3$. Elementary divisors are $\{4, 2, 3\}$. To get invariant factors $n_1 | n_2 | \dots$: Take the highest prime power factor: 4. So, $n_k=4$. The remaining factors are 2 and 3. The product is 6. So, we could have $n_1=6, n_2=4$? No, $6 \nmid 4$. We need $n_1 | n_2 | \dots | n_k$. The set of elementary divisors is $\{p_1^{a_{11}}, \dots, p_m^{a_{mr_m}}\}$. For $G \cong \mathbb{Z}_4 \times \mathbb{Z}_6$: $G \cong \mathbb{Z}_{2^2} \times (\mathbb{Z}_2 \times \mathbb{Z}_3)$. Elementary divisors are $\{4, 2, 3\}$. To form invariant factors $n_1 | n_2 | \dots$: The largest invariant factor $n_k$ must be the product of the highest power of each prime present in the elementary divisors. Here, $4 \times 3 = 12$. So $n_k=12$. The next largest invariant factor must divide $n_k$. Let's list the prime powers: $2^2, 2, 3$. To get $n_1 | n_2 | \dots | n_k$: Group by prime: Prime 2: $2^2, 2$. Prime 3: $3$. The largest invariant factor is the product of the highest powers: $n_k = 2^2 \times 3 = 12$. The next largest invariant factor is obtained by taking the next highest powers for each prime, such that divisibility holds. If $n_k=12$, then $n_{k-1}$ must divide 12. The elementary divisors are $\{4, 2, 3\}$. We need to form $n_1 | n_2 | \dots$. The set of invariant factors will have a product equal to the product of elementary divisors: $4 \times 2 \times 3 = 24$. Possible invariant factors: If $k=1$, $n_1=24$. Then $G \cong \mathbb{Z}_{24}$. This is not true, as $\mathbb{Z}_{24}$ has elements of order 24, while $\mathbb{Z}_4 \times \mathbb{Z}_6$ does not. The maximum order of an element is lcm(4,6)=12. If $k=2$, $n_1 | n_2$, and $n_1 n_2 = 24$. Pairs $(n_1, n_2)$ with $n_1 | n_2$ and $n_1 n_2 = 24$: $(1, 24), (2, 12), (3, 8), (4, 6)$. We need to match the prime power structure. $G \cong \mathbb{Z}_{2^2} \times \mathbb{Z}_2 \times \mathbb{Z}_3$. The highest power of 2 is $2^2=4$. The highest power of 3 is $3^1=3$. So, the invariant factors must contain these highest powers. Try $(n_1, n_2) = (4, 6)$: $4 | 6$ is False. Try $(n_1, n_2) = (3, 8)$: $3 | 8$ is False. Try $(n_1, n_2) = (2, 12)$: $2 | 12$ is True. Product $2 \times 12 = 24$. Does $\mathbb{Z}_2 \times \mathbb{Z}_{12}$ have the same prime power decomposition as $\mathbb{Z}_4 \times \mathbb{Z}_2 \times \mathbb{Z}_3$? $\mathbb{Z}_{12} \cong \mathbb{Z}_4 \times \mathbb{Z}_3$. So $\mathbb{Z}_2 \times \mathbb{Z}_{12} \cong \mathbb{Z}_2 \times (\mathbb{Z}_4 \times \mathbb{Z}_3) \cong \mathbb{Z}_4 \times \mathbb{Z}_2 \times \mathbb{Z}_3$. Yes! So, the invariant factor decomposition is $G \cong \mathbb{Z}_2 \times \mathbb{Z}_{12}$. The invariant factors are 2 and 12.

Summary for $\mathbb{Z}_4 \times \mathbb{Z}_6$: Invariant Factors: $n_1 = 2, n_2 = 12$. So $G \cong \mathbb{Z}_2 \times \mathbb{Z}_{12}$. Elementary Divisors: $4, 2, 3$. So $G \cong \mathbb{Z}_4 \times \mathbb{Z}_2 \times \mathbb{Z}_3$. Rank: 0.

4.2 Example 2: A free abelian group

Consider the group G generated by $g_1, g_2, g_3$ with no relations. This means G is isomorphic to $\mathbb{Z} \times \mathbb{Z} \times \mathbb{Z} = \mathbb{Z}^3$. Invariant Factor Form: $G \cong \mathbb{Z}^3$. Here $k=0$, so no $\mathbb{Z}_n$ factors. The rank is 3. Primary Decomposition Form: $G \cong \mathbb{Z}^3$. Rank is 3. Torsion subgroup is trivial.

4.3 Example 3: A group with torsion and free part

Consider a group G which is the set of all $3 \times 3$ matrices with integer entries, determinant 1, and which can be generated by a finite number of matrices. This is a complex example, but let's consider a simpler abstract example. Suppose $G \cong \mathbb{Z}_6 \times \mathbb{Z}^2$. Invariant Factor Form: Here $n_1=6$, $d=2$. So $G \cong \mathbb{Z}_6 \times \mathbb{Z} \times \mathbb{Z}$. Rank is 2. Primary Decomposition Form: $\mathbb{Z}_6 \cong \mathbb{Z}_2 \times \mathbb{Z}_3$. So $G \cong (\mathbb{Z}_2 \times \mathbb{Z}_3) \times \mathbb{Z} \times \mathbb{Z} \cong \mathbb{Z}_2 \times \mathbb{Z}_3 \times \mathbb{Z} \times \mathbb{Z}$. The elementary divisors are 2 and 3. Rank is 2.

5. Connection to Modules over PID

The Fundamental Theorem of Finitely Generated Abelian Groups is a special case of a more general theorem about modules over a Principal Ideal Domain (PID). The ring of integers $\mathbb{Z}$ is a PID. An abelian group can be viewed as a $\mathbb{Z}$-module.

The general theorem states that if R is a PID, then any finitely generated R-module M is isomorphic to a direct sum of cyclic R-modules: $M \cong R/(a_1) \oplus R/(a_2) \oplus \dots \oplus R/(a_k) \oplus R^d$ where $(a_i)$ are ideals of R, and $a_1 | a_2 | \dots | a_k$.

For R = $\mathbb{Z}$: The ideals are of the form $(n)$ for some integer $n$. $M \cong \mathbb{Z}/(n_1) \oplus \dots \oplus \mathbb{Z}/(n_k) \oplus \mathbb{Z}^d$. $\mathbb{Z}/(n_i)$ is isomorphic to $\mathbb{Z}_{n_i}$. So, $M \cong \mathbb{Z}_{n_1} \oplus \dots \oplus \mathbb{Z}_{n_k} \oplus \mathbb{Z}^d$, with $n_1 | n_2 | \dots | n_k$. This is precisely the invariant factor form of the theorem for finitely generated abelian groups.

The primary decomposition form arises from factoring the ideals $(a_i)$ into prime power ideals in a PID. For $\mathbb{Z}$, this corresponds to factoring integers into prime powers.

6. Significance and Uniqueness

The importance of the structure theorems lies in their ability to completely classify finitely generated abelian groups. Up to isomorphism, there is only one group for each possible combination of invariant factors (or elementary divisors) and rank.

Uniqueness: 1. Invariant Factor Form: For a given finitely generated abelian group G, the sequence of invariant factors $n_1, n_2, \dots, n_k$ (where $n_i > 1$ and $n_1 | n_2 | \dots | n_k$) and the rank $d$ are unique. 2. Primary Decomposition Form: The set of elementary divisors (prime powers $p^a > 1$) and the rank $d$ are unique.

This uniqueness allows mathematicians to study these groups by simply listing their invariant factors or elementary divisors, rather than having to construct concrete examples for each group.