The Fundamental Theorem of Finite Abelian Groups

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-11Open item page →

Internal direct products of finitely many normal subgroups

Definition

Let $G$ be a group and let $N_{0}, \dots, N_{r - 1}$ be normal subgroups, where $r \in N$ . They form an internal direct product when they generate $G$ and, for each $i < r$ , $N_{i} \cap ⟨ N_{j} : j < r, j \neq i ⟩ = {e} .$ The empty family is an internal direct product of the trivial group. For two subgroups of an abelian group this says $G = H K$ and $H \cap K = {e}$ ; in additive notation one writes $G = H \oplus K$ . Normal subgroups and generated subgroups are those of Normal subgroup: invariance under conjugation and The subgroup $⟨ S ⟩$ generated by a subset, the cyclic subgroup $⟨ g ⟩$ , and cyclic groups, and the comparison product is The external direct product $G \times H$ with componentwise multiplication.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Internal direct products are external direct products, equivalently every element has a unique factorisation

Statement

Let $N_{0}, \dots, N_{r - 1} ⊴ G$ . The following are equivalent: the $N_{i}$ form an internal direct product of $G$ ; every $g \in G$ has a unique expression $g = n_{0} \dots n_{r - 1}$ with $n_{i} \in N_{i}$ ; and the multiplication map $μ : \prod_{i < r} N_{i} \to G$ is an isomorphism. These statements include the empty family and the one-factor case.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let $G$ be a group and let $N_{0}, \dots, N_{r - 1}$ be normal subgroups, where $r \in N$ . They form an internal direct product when they generate $G$ and, for each $i < r$ , $N_{i} \cap ⟨ N_{j} : j < r, j \neq i ⟩ = {e} .$ The empty family is an internal direct product of the trivial group. For two subgroups of an abelian group this says $G = H K$ and $H \cap K = {e}$ ; in additive notation one writes $G = H \oplus K$ . Normal subgroups and generated subgroups are those of def-normal-subgroup and def-generated-subgroup, and the comparison product is def-external-direct-product-of-groups. (Internal direct products of finitely many normal subgroups).

[L2]

For groups $G$ and $H$ , the componentwise operation of def-external-direct-product-of-groups makes $G \times H$ a group. Its identity is $(e_{G}, e_{H})$ , and $(g, h)^{- 1} = (g^{- 1}, h^{- 1}) .$ Moreover the coordinate maps $π_{G} (g, h) = g$ and $π_{H} (g, h) = h$ are group homomorphisms. ( $G \times H$ is a group with identity $(e_{G}, e_{H})$ , coordinatewise inverses, and homomorphic coordinate projections).

[L3]

Let $(M, \cdot, e)$ and $(M^{'}, \cdot^{'}, e^{'})$ be monoids (def-semigroup-and-monoid). A monoid homomorphism from $M$ to $M^{'}$ is a function $f : M \to M^{'}$ such that - (H1) $f (x \cdot y) = f (x) \cdot^{'} f (y)$ for all $x, y \in M$ ; - (H2) $f (e) = e^{'}$ . Let $G$ and $G^{'}$ be groups (def-group). A group homomorphism from $G$ to $G^{'}$ is a function $f : G \to G^{'}$ satisfying (H1) alone: $f (x y) = f (x) f (y) for all x, y \in G .$ Condition (H2) is not imposed for groups because it follows: a group homomorphism automatically satisfies $f (e) = e^{'}$ and $f (x^{- 1}) = f (x)^{- 1}$ (lem-group-homomorphism-basic-properties). For monoids it does not follow and must be assumed, which is why the two definitions differ. A homomorphism from a structure to itself is an endomorphism. The identity map of $M$ is a monoid homomorphism, and a composite of monoid homomorphisms is one, since $(g \circ f) (x y) = g (f (x) f (y)) = g (f (x)) g (f (y))$ and $(g \circ f) (e) = g (e^{'}) = e^{''}$ ; the same computation, without the second clause, shows a composite of group homomorphisms is a group homomorphism. (Monoid homomorphism and group homomorphism).

[L4]

A group homomorphism is injective if and only if its kernel is trivial. For a group homomorphism $f : G \to H$ , $f$ is injective exactly when $\ker f = {e_{G}}$ . (A group homomorphism is injective if and only if its kernel is trivial).

[L5]

If $H \leq G$ and $N ⊴ G$ , then $H N$ is a subgroup and $H \cap N ⊴ H$ . Here $H N : = {h n : h \in H, n \in N}$ . (If $H \leq G$ and $N ⊴ G$ , then $H N$ is a subgroup and $H \cap N ⊴ H$ ).

Proof

technique · direct

1.1

The internal intersection condition gives $N_{i} \cap N_{j} = {e}$ for $i \neq j$ . Unique factorisation gives the same conclusion, since an element of $N_{i} \cap N_{j}$ has expressions supported in either coordinate. In either case normality puts $[N_{i}, N_{j}]$ inside $N_{i} \cap N_{j}$ , so distinct factors commute and the multiplication map $μ ((n_{i})) = n_{0} \dots n_{r - 1}$ is a homomorphism.

givenL1L2L3

1.2

Conversely, suppose that $μ$ is an isomorphism. Coordinate subgroups in the external product commute, so their images $N_{i}$ commute, and surjectivity says that the factors generate $G$ . If $x \in N_{i} \cap ⟨ N_{j} : j \neq i ⟩$ , the commuting factors express $x$ as an ordered product of elements from the other $N_{j}$ . The tuple supported at $i$ and this tuple supported away from $i$ have the same image, so injectivity gives $x = e$ . Hence the factors form an internal direct product.

givenL1L2L3L4L5

2.1

Under the internal-product condition, the image of $μ$ is the subgroup generated by the factors, hence is all of $G$ . If $μ ((n_{i})) = e$ , then each $n_{i}$ is the inverse of a product of the other factors and so lies in $N_{i} \cap ⟨ N_{j} : j \neq i ⟩$ ; therefore every $n_{i} = e$ . Thus $μ$ is an isomorphism.

step 1.1L1L4L5

2.2

Under unique factorisation, every element has exactly one preimage under the homomorphism $μ$ . Thus $μ$ is bijective and hence is an isomorphism.

step 1.1L3L4

3.1

For the empty family, each condition says that $G$ is trivial. For one factor, each says that $N_{0} = G$ , and the multiplication map is then the identity after identifying the one-fold product with $N_{0}$ .

givenL1L2∎

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-11Open item page →

The p-primary component of an abelian group

Definition

Let $G$ be an abelian group and $p$ a prime. Its $p$ -primary component is $G (p) = {g \in G : g^{p^{k}} = e for some k \in N} .$ Thus the identity is included by $k = 0$ . In additive notation, $G (p) = {g : p^{k} g = 0 for some k \in N}$ . Powers and element orders use Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ and The order $∣ G ∣$ of a finite group and the order $ord (g)$ of an element, with $ord (g) = \infty$ when no positive power of $g$ is the identity. No finiteness or maximality is part of the definition.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Cauchy's theorem for finite abelian groups

Statement

Let $G$ be a finite abelian group and let $p$ be a prime dividing $∣ G ∣$ . Then $G$ contains an element, and hence a subgroup, of order $p$ .

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let $P$ be a property of naturals such that for every $n \in N$ , if $P (m)$ holds for all $m < n$ then $P (n)$ . Then $P (n)$ holds for all $n \in N$ . (At $n = 0$ the hypothesis is vacuous, so $P (0)$ is forced.) (Strong (complete) induction).

[L2]

Let $G$ be a finite group and $H \leq G$ . Then $∣ G ∣ = [G : H] ∣ H ∣ .$ Consequently, under the canonical embedding $ι : N \to Z$ , $∣ H ∣$ divides $∣ G ∣$ . (Lagrange's theorem: $∣ G ∣ = [G : H] ∣ H ∣$ for every subgroup $H$ of a finite group $G$ ).

[L3]

Let $N ⊴ G$ . If $[G : N]$ is finite, then the quotient group $G / N$ is finite and $∣ G / N ∣ = [G : N] .$ In particular, if $G$ is finite, then $∣ G / N ∣ = \frac{∣ G ∣}{∣ N ∣} .$ (If $[G : N]$ is finite then $∣ G / N ∣ = [G : N]$ ; for finite $G$ this equals $∣ G ∣ / ∣ N ∣$ ).

[L4]

If $G$ is abelian and $N ⊴ G$ , then $G / N$ is abelian. (Every quotient group of an abelian group is abelian).

[L5]

Let $G$ be a group and let $N ⊴ G$ be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, $G / N$ has the left cosets $G / N : = {g N : g \in G}$ as its elements (def-coset, def-index), with product $(g N) (h N) : = g h N .$ Independence of the chosen representatives is proved in thm-coset-multiplication-well-defined-iff-normal, and the group axioms are proved in thm-quotient-group-laws. (The quotient group $G / N$ and coset product $(g N) (h N) = g h N$ ).

[L6]

Let $G$ be a finite group such that the positive integer $∣ G ∣$ is prime. Then every $g \neq e$ has order $∣ G ∣$ , satisfies $⟨ g ⟩ = G$ , and hence generates $G$ . In particular, $G$ is cyclic. (A finite group of prime order is cyclic and every nonidentity element generates it).

[L7]

Let $G$ be a group, $g \in G$ , and let orders be as in def-order-in-a-group. Throughout, a natural number written where an integer is expected means its image under the embedding $ι : N \to Z$ of lem-nat-embeds-int. Finite order. Suppose $ord (g) = n$ with $n \in N$ , $n \geq 1$ . Then: 1. for every $k \in Z$ , $g^{k} = e$ if and only if $k = q n$ for some $q \in Z$ , that is, if and only if $n ∣ k$ (thm-division-algorithm-in-z); 2. the powers $g^{0}, g^{1}, \dots, g^{n - 1}$ are pairwise distinct: if $i, j \in N$ with $i < n$ , $j < n$ and $g^{i} = g^{j}$ , then $i = j$ ; 3. $⟨ g ⟩ = {g^{s} : s \in N, s < n}$ and $⟨ g ⟩ \approx n$ ; so $⟨ g ⟩$ is finite with $∣ ⟨ g ⟩ ∣ = n = ord (g)$ . Infinite order. If $ord (g) = \infty$ then for $j, k \in Z$ , $g^{j} = g^{k}$ implies $j = k$ ; so the integer powers of $g$ are pairwise distinct and $⟨ g ⟩$ is not finite. (If $ord (g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$ , the powers $g^{0}, \dots, g^{n - 1}$ are distinct, and $⟨ g ⟩$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$ ).

[L8]

If $G = ⟨ g ⟩$ is cyclic, then exactly one of the following applies: - if $g$ has infinite order, $G ≅ (Z, +)$ ; - if $g$ has finite order $n$ , necessarily $n \geq 1$ , then $G ≅ (Z / n, +)$ . (Every cyclic group is isomorphic to $(Z, +)$ or to $(Z / n, +)$ for its finite order $n \geq 1$ ).

Proof

technique · induction

1.1

For strong induction on $∣ G ∣$ , the trivial group has no relevant prime divisor, and if $∣ G ∣ = p$ then $G$ is cyclic of order $p$ .

basegivenL1L2L3L4L5L6L7L8

2.1

Fix the induction hypothesis for every finite abelian group of order smaller than $∣ G ∣$ . Choose $x \neq e$ . If $⟨ x ⟩ = G$ , cyclic-group classification supplies $x^{∣ G ∣ / p}$ of order $p$ . Otherwise put $H = ⟨ x ⟩$ , a nontrivial proper subgroup.

ihstep 1.1

3.1

If $p ∣ ∣ H ∣$ , the induction hypothesis in $H$ gives an element of order $p$ . If $p ∤ ∣ H ∣$ , then $p ∣ ∣ G / H ∣$ and the induction hypothesis in the smaller finite abelian quotient gives a coset $y H$ of order $p$ .

step 2.1

4.1

In the latter case $y^{p} \in H$ . Let $q$ be the order of $y^{p}$ ; then $q ∣ ∣ H ∣$ and $p ∤ q$ . Since the coset of $y$ has order $p$ , the order of $y$ is $p q$ , so $y^{q}$ has order $p$ .

step 3.1

5.1

Every branch supplies an element of order $p$ , completing the strong induction.

step 4.1discharge-induction∎

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A p-primary component has the full p-power order and is the unique subgroup of that order

Statement

Let $G$ be finite abelian and write $∣ G ∣ = p^{a} m$ with $p ∤ m$ . Then $G (p)$ is a subgroup of order $p^{a}$ . It is the unique subgroup of $G$ having that order. In particular, if $p ∤ ∣ G ∣$ , then $G (p) = {e}$ .

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let $G$ be an abelian group and $p$ a prime. Its $p$ -primary component is $G (p) = {g \in G : g^{p^{k}} = e for some k \in N} .$ Thus the identity is included by $k = 0$ . In additive notation, $G (p) = {g : p^{k} g = 0 for some k \in N}$ . Powers and element orders use def-group-power and def-order-in-a-group. No finiteness or maximality is part of the definition. (The p-primary component of an abelian group).

[L2]

Let $G$ be a finite abelian group and let $p$ be a prime dividing $∣ G ∣$ . Then $G$ contains an element, and hence a subgroup, of order $p$ . (Cauchy's theorem for finite abelian groups).

[L3]

Let $G$ be a finite group and $H \leq G$ . Then $∣ G ∣ = [G : H] ∣ H ∣ .$ Consequently, under the canonical embedding $ι : N \to Z$ , $∣ H ∣$ divides $∣ G ∣$ . (Lagrange's theorem: $∣ G ∣ = [G : H] ∣ H ∣$ for every subgroup $H$ of a finite group $G$ ).

[L4]

Let $N ⊴ G$ . If $[G : N]$ is finite, then the quotient group $G / N$ is finite and $∣ G / N ∣ = [G : N] .$ In particular, if $G$ is finite, then $∣ G / N ∣ = \frac{∣ G ∣}{∣ N ∣} .$ (If $[G : N]$ is finite then $∣ G / N ∣ = [G : N]$ ; for finite $G$ this equals $∣ G ∣ / ∣ N ∣$ ).

[L5]

Correspondence theorem: subgroups of $G / N$ correspond to subgroups of $G$ containing $N$ , with normality preserved. For $N ⊴ G$ , the maps $H \mapsto H / N$ and $K \mapsto π^{- 1} (K)$ are inverse inclusion-preserving bijections between subgroups $H$ with $N \leq H \leq G$ and subgroups $K \leq G / N$ ; they preserve normality. (Correspondence theorem: subgroups of $G / N$ correspond to subgroups of $G$ containing $N$ , with normality preserved).

[L6]

Second isomorphism theorem for groups: $H / (H \cap N) ≅ H N / N$ . If $H \leq G$ and $N ⊴ G$ , then $H / (H \cap N) ≅ H N / N .$ (Second isomorphism theorem for groups: $H / (H \cap N) ≅ H N / N$ ).

[L7]

If $G$ is abelian and $N ⊴ G$ , then $G / N$ is abelian. (Every quotient group of an abelian group is abelian).

[L8]

Let $G$ be a group (def-group) with identity $e$ , let $g, h \in G$ , and let powers be as in def-group-power. For all $m, n \in Z$ : 1. $g^{m + n} = g^{m} g^{n}$ ; 2. $g^{- m} = (g^{m})^{- 1}$ ; 3. $(g^{m})^{n} = g^{m n}$ ; 4. $g^{m} g^{n} = g^{n} g^{m}$ : any two powers of one element commute; 5. if $g h = h g$ then $(g h)^{n} = g^{n} h^{n}$ . Claim 5 is false in general without its hypothesis: in a group in which $g$ and $h$ do not commute the equation can fail already at $n = 2$ , and a witness is recorded on the companion page. Claims 1 and 3 hold in any monoid (def-semigroup-and-monoid) for exponents in $N$ , and so does claim 5 for exponents in $N$ under the same commuting hypothesis; only the extension to negative exponents needs inverses. (Exponent laws in a group: $g^{m + n} = g^{m} g^{n}$ and $(g^{m})^{n} = g^{m n}$ for all $m, n \in Z$ , and $(g h)^{n} = g^{n} h^{n}$ when $g$ and $h$ commute).

Proof

technique · direct

1.1

If $x^{p^{r}} = y^{p^{s}} = e$ and $t = \max {r, s}$ , commutativity and the power laws give $(x y)^{p^{t}} = e$ and $(x^{- 1})^{p^{t}} = e$ , so $G (p)$ is a subgroup. If a prime $q$ divides $∣ G (p) ∣$ , Cauchy's theorem in $G (p)$ gives an element of order $q$ ; the definition of $G (p)$ forces $q = p$ . Hence $∣ G (p) ∣ = p^{b}$ for some $b \leq a$ .

givenL1L2L3L4L5L6L7L8

2.1

If $b < a$ , then $p$ divides $∣ G / G (p) ∣$ . Cauchy's theorem in this abelian quotient gives a nonidentity coset $x G (p)$ of order $p$ .

step 1.1

3.1

Then $x^{p} \in G (p)$ , so $(x^{p})^{p^{k}} = e$ for some $k$ and therefore $x \in G (p)$ , contradicting the choice of a nonidentity coset. Hence $b = a$ .

step 2.1

4.1

If $H \leq G$ has order $p^{a}$ , Lagrange applied inside $H$ makes every $h \in H$ have $p$ -power order, so $H \subseteq G (p)$ ; equal finite orders give $H = G (p)$ . The case $a = 0$ gives the trivial subgroup.

step 3.1∎

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A finite abelian group is the internal direct product of its primary components

Statement

If $G$ is finite abelian and $∣ G ∣ = \prod_{i < r} p_{i}^{a_{i}}$ is its prime factorisation, then the subgroups $G (p_{i})$ form an internal direct product of $G$ . Thus $G ≅ \prod_{i < r} G (p_{i}) .$ For the trivial group, this is the empty product.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let $G$ be finite abelian and write $∣ G ∣ = p^{a} m$ with $p ∤ m$ . Then $G (p)$ is a subgroup of order $p^{a}$ . It is the unique subgroup of $G$ having that order. In particular, if $p ∤ ∣ G ∣$ , then $G (p) = {e}$ . (A p-primary component has the full p-power order and is the unique subgroup of that order).

[L2]

Let $N_{0}, \dots, N_{r - 1} ⊴ G$ . The following are equivalent: the $N_{i}$ form an internal direct product of $G$ ; every $g \in G$ has a unique expression $g = n_{0} \dots n_{r - 1}$ with $n_{i} \in N_{i}$ ; and the multiplication map $μ : \prod_{i < r} N_{i} \to G$ is an isomorphism. These statements include the empty family and the one-factor case. (Internal direct products are external direct products, equivalently every element has a unique factorisation).

[L3]

Powers are the natural powers of def-group-power and finite products those of def-monoid-finite-product, both taken in the commutative monoid $(Z, \cdot, 1)$ of lem-units-of-z. Call $p : r \to Z$ an injective list of primes when every $p_{i}$ is prime (def-prime) and $p_{i} = p_{j}$ forces $i = j$ (def-injection-surjection-bijection). Let $n \in Z$ with $n \geq 1$ and let $p : r \to Z$ be an injective list of primes such that every prime divisor of $n$ equals $p_{i}$ for some $i < r$ . Then, with $v_{q}$ as in def-p-adic-valuation: 1. $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; 2. $v_{q} (n) = 0$ for every prime $q$ that is not among $p_{0}, \dots, p_{r - 1}$ ; 3. the exponents are determined by $n$ : if $e : r \to N$ and $n = \prod_{i < r} p_{i}^{e_{i}}$ , then $e_{j} = v_{p_{j}} (n)$ for every $j < r$ . Clause 3 needs only injectivity of the list, not the covering hypothesis. (For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list).

[L4]

Let $a, b \in Z$ , not both $0$ , and put $I : = {a x + b y : x, y \in Z} .$ Then $I$ contains a positive element, and its least positive element is $\gcd (a, b)$ (def-common-divisor-and-gcd). In particular there are integers $x_{0}, y_{0}$ with $a x_{0} + b y_{0} = \gcd (a, b),$ so the equation $a x + b y = \gcd (a, b)$ is solvable in $Z$ . (Bézout's identity: for integers $a, b$ not both zero, $\gcd (a, b)$ is the least positive element of ${a x + b y : x, y \in Z}$ ; in particular $a x + b y = \gcd (a, b)$ has an integer solution).

[L5]

If $G$ and $H$ are finite groups, then their external direct product is finite and has order $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ . (For finite groups $G$ and $H$ , $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ ).

[L6]

Let $G$ be a finite group and $H \leq G$ . Then $∣ G ∣ = [G : H] ∣ H ∣ .$ Consequently, under the canonical embedding $ι : N \to Z$ , $∣ H ∣$ divides $∣ G ∣$ . (Lagrange's theorem: $∣ G ∣ = [G : H] ∣ H ∣$ for every subgroup $H$ of a finite group $G$ ).

Proof

technique · direct

1.1

Each $G (p_{i})$ has order $p_{i}^{a_{i}}$ , and the product of these orders is $∣ G ∣$ . Distinct primary components have trivial intersection because an element in both has order dividing powers of two distinct primes.

givenL1L2L3L4L5L6

2.1

Multiplication from the external product of the primary components to $G$ is injective: a tuple in its kernel would place each component in the intersection with the product of the others, whose order is both a power of $p_{i}$ and coprime to $p_{i}$ .

step 1.1

3.1

The external product has order $\prod_{i} p_{i}^{a_{i}} = ∣ G ∣$ . Its injective multiplication map therefore has image of order $∣ G ∣$ and is surjective.

step 2.1

4.1

The internal-direct-product recognition theorem gives the displayed isomorphism. When $G$ is trivial the prime list is empty and both sides are the trivial group.

step 3.1∎

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A nontrivial finite abelian p-group with a unique subgroup of order p is cyclic

Statement

Let $G$ be a nontrivial finite abelian $p$ -group. If $G$ has exactly one subgroup of order $p$ , then $G$ is cyclic.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let $G$ be a finite abelian group and let $p$ be a prime dividing $∣ G ∣$ . Then $G$ contains an element, and hence a subgroup, of order $p$ . (Cauchy's theorem for finite abelian groups).

[L2]

Let $G$ be a group and let $N ⊴ G$ be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, $G / N$ has the left cosets $G / N : = {g N : g \in G}$ as its elements (def-coset, def-index), with product $(g N) (h N) : = g h N .$ Independence of the chosen representatives is proved in thm-coset-multiplication-well-defined-iff-normal, and the group axioms are proved in thm-quotient-group-laws. (The quotient group $G / N$ and coset product $(g N) (h N) = g h N$ ).

[L3]

If $G$ is abelian and $N ⊴ G$ , then $G / N$ is abelian. (Every quotient group of an abelian group is abelian).

[L4]

Let $N ⊴ G$ . If $[G : N]$ is finite, then the quotient group $G / N$ is finite and $∣ G / N ∣ = [G : N] .$ In particular, if $G$ is finite, then $∣ G / N ∣ = \frac{∣ G ∣}{∣ N ∣} .$ (If $[G : N]$ is finite then $∣ G / N ∣ = [G : N]$ ; for finite $G$ this equals $∣ G ∣ / ∣ N ∣$ ).

[L5]

Let $G$ be a group and $g \in G$ , with integer powers as in def-group-power. Then $⟨ g ⟩ = {g^{n} : n \in Z},$ the cyclic subgroup generated by $g$ (def-generated-subgroup) being exactly the set of integer powers of $g$ . Consequently every cyclic group is abelian, and so is every cyclic subgroup of any group. ( $⟨ g ⟩ = {g^{n} : n \in Z}$ , and every cyclic group is abelian).

[L6]

Let $G$ be a group, $g \in G$ , and let orders be as in def-order-in-a-group. Throughout, a natural number written where an integer is expected means its image under the embedding $ι : N \to Z$ of lem-nat-embeds-int. Finite order. Suppose $ord (g) = n$ with $n \in N$ , $n \geq 1$ . Then: 1. for every $k \in Z$ , $g^{k} = e$ if and only if $k = q n$ for some $q \in Z$ , that is, if and only if $n ∣ k$ (thm-division-algorithm-in-z); 2. the powers $g^{0}, g^{1}, \dots, g^{n - 1}$ are pairwise distinct: if $i, j \in N$ with $i < n$ , $j < n$ and $g^{i} = g^{j}$ , then $i = j$ ; 3. $⟨ g ⟩ = {g^{s} : s \in N, s < n}$ and $⟨ g ⟩ \approx n$ ; so $⟨ g ⟩$ is finite with $∣ ⟨ g ⟩ ∣ = n = ord (g)$ . Infinite order. If $ord (g) = \infty$ then for $j, k \in Z$ , $g^{j} = g^{k}$ implies $j = k$ ; so the integer powers of $g$ are pairwise distinct and $⟨ g ⟩$ is not finite. (If $ord (g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$ , the powers $g^{0}, \dots, g^{n - 1}$ are distinct, and $⟨ g ⟩$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$ ).

Proof

technique · contradiction

1.1

Assume for contradiction that $G$ is not cyclic. Choose $a \in G$ of maximal order $p^{m}$ and put $A = ⟨ a ⟩$ , which is then proper.

assume-contragivenL1L2L3L4L5L6

2.1

Cauchy's theorem in $G / A$ gives $b + A$ of order $p$ . Thus $p b = s a$ in additive notation for some integer $s$ , while $b \notin A$ .

step 1.1

3.1

Maximality gives $p^{m} b = 0$ , so $p^{m - 1} s a = 0$ . Since $a$ has order $p^{m}$ , the integer $s$ is divisible by $p$ , say $s = p t$ .

step 2.1

4.1

Then $c = b - t a$ is nonzero, lies outside $A$ , and satisfies $p c = 0$ . Its order- $p$ subgroup differs from the unique order- $p$ subgroup inside $A$ , contradicting the hypothesis. Therefore $G$ is cyclic.

step 3.1discharge-contradiction∎

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A maximal-order cyclic subgroup splits off a finite abelian p-group

Statement

Let $G$ be a finite abelian $p$ -group and let $a \in G$ have maximal element order. Then there is a subgroup $H \leq G$ such that $G = ⟨ a ⟩ \oplus H .$

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let $G$ be a nontrivial finite abelian $p$ -group. If $G$ has exactly one subgroup of order $p$ , then $G$ is cyclic. (A nontrivial finite abelian p-group with a unique subgroup of order p is cyclic).

[L2]

Let $G$ be a finite abelian group and let $p$ be a prime dividing $∣ G ∣$ . Then $G$ contains an element, and hence a subgroup, of order $p$ . (Cauchy's theorem for finite abelian groups).

[L3]

Let $P$ be a property of naturals such that for every $n \in N$ , if $P (m)$ holds for all $m < n$ then $P (n)$ . Then $P (n)$ holds for all $n \in N$ . (At $n = 0$ the hypothesis is vacuous, so $P (0)$ is forced.) (Strong (complete) induction).

[L4]

Let $G$ be a group and let $N ⊴ G$ be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, $G / N$ has the left cosets $G / N : = {g N : g \in G}$ as its elements (def-coset, def-index), with product $(g N) (h N) : = g h N .$ Independence of the chosen representatives is proved in thm-coset-multiplication-well-defined-iff-normal, and the group axioms are proved in thm-quotient-group-laws. (The quotient group $G / N$ and coset product $(g N) (h N) = g h N$ ).

[L5]

Correspondence theorem: subgroups of $G / N$ correspond to subgroups of $G$ containing $N$ , with normality preserved. For $N ⊴ G$ , the maps $H \mapsto H / N$ and $K \mapsto π^{- 1} (K)$ are inverse inclusion-preserving bijections between subgroups $H$ with $N \leq H \leq G$ and subgroups $K \leq G / N$ ; they preserve normality. (Correspondence theorem: subgroups of $G / N$ correspond to subgroups of $G$ containing $N$ , with normality preserved).

[L6]

Let $N ⊴ G$ . If $[G : N]$ is finite, then the quotient group $G / N$ is finite and $∣ G / N ∣ = [G : N] .$ In particular, if $G$ is finite, then $∣ G / N ∣ = \frac{∣ G ∣}{∣ N ∣} .$ (If $[G : N]$ is finite then $∣ G / N ∣ = [G : N]$ ; for finite $G$ this equals $∣ G ∣ / ∣ N ∣$ ).

[L7]

Let $G$ be a group and $g \in G$ , with integer powers as in def-group-power. Then $⟨ g ⟩ = {g^{n} : n \in Z},$ the cyclic subgroup generated by $g$ (def-generated-subgroup) being exactly the set of integer powers of $g$ . Consequently every cyclic group is abelian, and so is every cyclic subgroup of any group. ( $⟨ g ⟩ = {g^{n} : n \in Z}$ , and every cyclic group is abelian).

[L8]

Let $G$ be a group and let $N_{0}, \dots, N_{r - 1}$ be normal subgroups, where $r \in N$ . They form an internal direct product when they generate $G$ and, for each $i < r$ , $N_{i} \cap ⟨ N_{j} : j < r, j \neq i ⟩ = {e} .$ The empty family is an internal direct product of the trivial group. For two subgroups of an abelian group this says $G = H K$ and $H \cap K = {e}$ ; in additive notation one writes $G = H \oplus K$ . Normal subgroups and generated subgroups are those of def-normal-subgroup and def-generated-subgroup, and the comparison product is def-external-direct-product-of-groups. (Internal direct products of finitely many normal subgroups).

[L9]

Let $G$ be a group, $g \in G$ , and let orders be as in def-order-in-a-group. Throughout, a natural number written where an integer is expected means its image under the embedding $ι : N \to Z$ of lem-nat-embeds-int. Finite order. Suppose $ord (g) = n$ with $n \in N$ , $n \geq 1$ . Then: 1. for every $k \in Z$ , $g^{k} = e$ if and only if $k = q n$ for some $q \in Z$ , that is, if and only if $n ∣ k$ (thm-division-algorithm-in-z); 2. the powers $g^{0}, g^{1}, \dots, g^{n - 1}$ are pairwise distinct: if $i, j \in N$ with $i < n$ , $j < n$ and $g^{i} = g^{j}$ , then $i = j$ ; 3. $⟨ g ⟩ = {g^{s} : s \in N, s < n}$ and $⟨ g ⟩ \approx n$ ; so $⟨ g ⟩$ is finite with $∣ ⟨ g ⟩ ∣ = n = ord (g)$ . Infinite order. If $ord (g) = \infty$ then for $j, k \in Z$ , $g^{j} = g^{k}$ implies $j = k$ ; so the integer powers of $g$ are pairwise distinct and $⟨ g ⟩$ is not finite. (If $ord (g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$ , the powers $g^{0}, \dots, g^{n - 1}$ are distinct, and $⟨ g ⟩$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$ ).

Proof

technique · induction

1.1

For induction on $∣ G ∣$ , the trivial and cyclic cases hold with the evident complement.

basegivenL1L2L3L4L5L6L7L8L9

2.1

Fix the induction hypothesis for smaller finite abelian $p$ -groups, assume $G$ is noncyclic, and put $A = ⟨ a ⟩$ .

ihstep 1.1

3.1

Write $∣ A ∣ = p^{m}$ . If $a^{r}$ has order $p$ , then $a^{p r} = e$ , so the order characterisation gives $p^{m - 1} ∣ r$ ; hence $A$ has the unique order- $p$ subgroup $⟨ a^{p^{m - 1}} ⟩$ . The preceding lemma and Cauchy's theorem therefore give an order- $p$ subgroup $B$ of $G$ different from it, and $A \cap B = {0}$ .

step 2.1

4.1

In $G / B$ the image of $a$ has the same order as $a$ because $A \cap B = {0}$ . It is still of maximal order: if $y + B$ had order larger than $p^{m}$ , then $(y + B)^{p^{m}} \neq B$ , so $y^{p^{m}} \neq 0$ and $y$ would have order larger than that of $a$ .

step 3.1

5.1

Induction in $G / B$ gives $G / B = (A + B) / B \oplus H^{'} / B$ for some subgroup $H^{'} \geq B$ . Pulling back yields $G = A + H^{'}$ , while $A \cap H^{'} \subseteq A \cap B = {0}$ .

step 4.1

6.1

Thus $H = H^{'}$ is the required complement. The order- $p$ and one-factor boundaries are included in the cyclic case, completing the induction.

step 5.1discharge-induction∎

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Every finite abelian p-group is a direct product of cyclic p-groups

Statement

Every finite abelian $p$ -group is isomorphic to a finite direct product of cyclic groups of prime-power order. The trivial $p$ -group is the empty product.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let $G$ be a finite abelian $p$ -group and let $a \in G$ have maximal element order. Then there is a subgroup $H \leq G$ such that $G = ⟨ a ⟩ \oplus H .$ (A maximal-order cyclic subgroup splits off a finite abelian p-group).

[L2]

Let $P$ be a property of naturals such that for every $n \in N$ , if $P (m)$ holds for all $m < n$ then $P (n)$ . Then $P (n)$ holds for all $n \in N$ . (At $n = 0$ the hypothesis is vacuous, so $P (0)$ is forced.) (Strong (complete) induction).

[L3]

Let $N_{0}, \dots, N_{r - 1} ⊴ G$ . The following are equivalent: the $N_{i}$ form an internal direct product of $G$ ; every $g \in G$ has a unique expression $g = n_{0} \dots n_{r - 1}$ with $n_{i} \in N_{i}$ ; and the multiplication map $μ : \prod_{i < r} N_{i} \to G$ is an isomorphism. These statements include the empty family and the one-factor case. (Internal direct products are external direct products, equivalently every element has a unique factorisation).

[L4]

If $G = ⟨ g ⟩$ is cyclic, then exactly one of the following applies: - if $g$ has infinite order, $G ≅ (Z, +)$ ; - if $g$ has finite order $n$ , necessarily $n \geq 1$ , then $G ≅ (Z / n, +)$ . (Every cyclic group is isomorphic to $(Z, +)$ or to $(Z / n, +)$ for its finite order $n \geq 1$ ).

Proof

technique · induction

1.1

For induction on $∣ G ∣$ , the trivial group gives the empty product.

basegivenL1L2L3L4

2.1

Fix the induction hypothesis for smaller finite abelian $p$ -groups. If $G$ is nontrivial, choose $a$ of maximal order and split $G = ⟨ a ⟩ \oplus H$ .

ihstep 1.1

3.1

The cyclic factor $⟨ a ⟩$ has prime-power order. If $H$ is nontrivial then $∣ H ∣ < ∣ G ∣$ , so the induction hypothesis decomposes $H$ into cyclic $p$ -groups.

step 2.1

4.1

Concatenating that decomposition with $⟨ a ⟩$ and applying internal-product recognition gives the asserted external direct product, completing the induction.

step 3.1discharge-induction∎

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-11Open item page →

Elementary-divisor data for a finite abelian group

Definition

An elementary-divisor decomposition of a finite abelian group $G$ is an isomorphism $G ≅ C_{q_{0}} \times \dots \times C_{q_{r - 1}},$ where every $q_{i} > 1$ is a prime power. The unordered multiset of the $q_{i}$ , counted with multiplicity, is the elementary-divisor data. The cyclic factors and product use Every cyclic group is isomorphic to $(Z, +)$ or to $(Z / n, +)$ for its finite order $n \geq 1$ and The external direct product $G \times H$ with componentwise multiplication. The data records factor isomorphism types, not distinguished internal subgroups; the trivial group has empty data.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

The successive quotients p^iG/p^{i+1}G recover the cyclic summand multiplicities of a finite abelian p-group

Statement

Suppose $G ≅ \prod_{j < r} C_{p^{e_{j}}}$ with $e_{j} \geq 1$ , and in additive notation write $p^{i} G = {p^{i} g : g \in G}$ . Define $d_{i}$ by $∣ p^{i} G / p^{i + 1} G ∣ = p^{d_{i}}$ . Then $d_{i} = ∣ {j : e_{j} \geq i + 1} ∣ .$ Consequently, for every $k \geq 1$ , the number of summands of order $p^{k}$ is $d_{k - 1} - d_{k}$ , so the elementary divisors are intrinsic. The restriction to $k \geq 1$ is the whole content of the hypothesis $e_{j} \geq 1$ : no summand has order $p^{0} = 1$ , and $d_{- 1}$ is not defined.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

An elementary-divisor decomposition of a finite abelian group $G$ is an isomorphism $G ≅ C_{q_{0}} \times \dots \times C_{q_{r - 1}},$ where every $q_{i} > 1$ is a prime power. The unordered multiset of the $q_{i}$ , counted with multiplicity, is the elementary-divisor data. The cyclic factors and product use thm-classification-of-cyclic-groups and def-external-direct-product-of-groups. The data records factor isomorphism types, not distinguished internal subgroups; the trivial group has empty data. (Elementary-divisor data for a finite abelian group).

[L2]

Every finite abelian $p$ -group is isomorphic to a finite direct product of cyclic groups of prime-power order. The trivial $p$ -group is the empty product. (Every finite abelian p-group is a direct product of cyclic p-groups).

[L3]

Natural exponents, in a monoid. Let $(M, \cdot, e)$ be a monoid (def-semigroup-and-monoid) and $g \in M$ . By the recursion theorem (thm-recursion), applied with the set $M$ , the element $e$ and the function $x \mapsto x \cdot g$ from $M$ to $M$ , there is exactly one function $N \to M$ , written $n \mapsto g^{n}$ , with $g^{0} = e, g^{σ (n)} = g^{n} \cdot g (n \in N) .$ In particular $g^{0} = e$ for every $g$ , including $g = e$ , and $g^{1} = g^{σ (0)} = e \cdot g = g$ . Since $N$ contains $0$ (def-natural-numbers), the exponent $0$ is a genuine value of the definition and not a separate convention. Integer exponents, in a group. Let $G$ be a group (def-group) and $g \in G$ . Write $ι : N \to Z$ for the embedding $k = [(k, 0)]$ of lem-nat-embeds-int, which is injective, preserves addition, multiplication and order, and has as image exactly the nonnegative integers. For $x \in Z$ define - $g^{x} : = g^{k}$ , the natural power, when $0 \leq x$ and $x = k$ ; - $g^{x} : = (g^{k})^{- 1}$ when $x < 0$ and $- x = k$ . Why this is well defined. The order on $Z$ is total and antisymmetric (thm-int-ordered-ring, def-int-order), so exactly one of $0 \leq x$ and $x < 0$ holds and the two clauses never both apply. In the first clause $x$ is nonnegative, so $x = k$ for some $k \in N$ , and $k$ is unique because $ι$ is injective. In the second clause $x < 0$ gives $0 = x + (- x) < 0 + (- x) = - x$ by compatibility of the order with addition (thm-int-ordered-ring, def-int-operations), so $- x$ is a positive integer and again $- x = k$ for a unique $k$ . The inverse $(g^{k})^{- 1}$ is a single determined element by lem-inverse-unique and def-invertible-element. Finally the two readings of $g^{k}$ , as a natural power and as an integer power, agree by construction, so no ambiguity is introduced. Abbreviation. In an exponent we write $k$ for the integer $k$ when a natural number $k$ is used where an integer is expected; this is unambiguous because $ι$ is injective and preserves the arithmetic and the order, and because the two readings of $g^{k}$ agree as just noted. Additive notation. When the group is written additively the same object is written $n g$ or $n \cdot g$ rather than $g^{n}$ , with $0 g = 0$ and $σ (n) g = n g + g$ ; the definitions are identical, only the symbols differ. (Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ ).

[L4]

Let $G$ be a group and let $N ⊴ G$ be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, $G / N$ has the left cosets $G / N : = {g N : g \in G}$ as its elements (def-coset, def-index), with product $(g N) (h N) : = g h N .$ Independence of the chosen representatives is proved in thm-coset-multiplication-well-defined-iff-normal, and the group axioms are proved in thm-quotient-group-laws. (The quotient group $G / N$ and coset product $(g N) (h N) = g h N$ ).

[L5]

Let $N ⊴ G$ . If $[G : N]$ is finite, then the quotient group $G / N$ is finite and $∣ G / N ∣ = [G : N] .$ In particular, if $G$ is finite, then $∣ G / N ∣ = \frac{∣ G ∣}{∣ N ∣} .$ (If $[G : N]$ is finite then $∣ G / N ∣ = [G : N]$ ; for finite $G$ this equals $∣ G ∣ / ∣ N ∣$ ).

[L6]

If $G$ and $H$ are finite groups, then their external direct product is finite and has order $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ . (For finite groups $G$ and $H$ , $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ ).

[L7]

For every $n \in N$ , view $n$ as its canonical nonnegative integer and put $n Z : = {n k : k \in Z}$ . Then the left cosets of $n Z$ in $(Z, +)$ are exactly the congruence classes modulo $n$ , and coset addition is the published addition of congruence classes. Thus $(Z, +) / n Z = (Z / n, +)$ as the same group on the same underlying set. This includes $n = 0$ and $n = 1$ . (For every $n \in N$ , the congruence-class group $(Z / n, +)$ is the quotient group $(Z, +) / n Z$ ).

Proof

technique · direct

1.1

On a cyclic factor $C_{p^{e}}$ , the quotient $p^{i} C_{p^{e}} / p^{i + 1} C_{p^{e}}$ is trivial when $i \geq e$ and has order $p$ when $i < e$ .

givenL1L2L3L4L5L6L7

2.1

Taking direct products componentwise therefore gives $∣ p^{i} G / p^{i + 1} G ∣ = p^{d_{i}}$ with $d_{i}$ equal to the number of exponents at least $i + 1$ .

step 1.1

3.1

The number of exponents equal to $k$ is the number at least $k$ minus the number at least $k + 1$ , namely $d_{k - 1} - d_{k}$ .

step 2.1

4.1

Each subgroup $p^{i} G$ and quotient $p^{i} G / p^{i + 1} G$ is defined intrinsically, and the sequence terminates at zero, so these differences uniquely recover all summands.

step 3.1∎

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Fundamental theorem of finite abelian groups: elementary-divisor form

Statement

Every finite abelian group is isomorphic to a finite direct product of cyclic groups of prime-power order. The multiset of their orders is uniquely determined by the group, up to permutation of the factors.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

If $G$ is finite abelian and $∣ G ∣ = \prod_{i < r} p_{i}^{a_{i}}$ is its prime factorisation, then the subgroups $G (p_{i})$ form an internal direct product of $G$ . Thus $G ≅ \prod_{i < r} G (p_{i}) .$ For the trivial group, this is the empty product. (A finite abelian group is the internal direct product of its primary components).

[L2]

Every finite abelian $p$ -group is isomorphic to a finite direct product of cyclic groups of prime-power order. The trivial $p$ -group is the empty product. (Every finite abelian p-group is a direct product of cyclic p-groups).

[L3]

An elementary-divisor decomposition of a finite abelian group $G$ is an isomorphism $G ≅ C_{q_{0}} \times \dots \times C_{q_{r - 1}},$ where every $q_{i} > 1$ is a prime power. The unordered multiset of the $q_{i}$ , counted with multiplicity, is the elementary-divisor data. The cyclic factors and product use thm-classification-of-cyclic-groups and def-external-direct-product-of-groups. The data records factor isomorphism types, not distinguished internal subgroups; the trivial group has empty data. (Elementary-divisor data for a finite abelian group).

[L4]

Suppose $G ≅ \prod_{j < r} C_{p^{e_{j}}}$ with $e_{j} \geq 1$ , and in additive notation write $p^{i} G = {p^{i} g : g \in G}$ . Define $d_{i}$ by $∣ p^{i} G / p^{i + 1} G ∣ = p^{d_{i}}$ . Then $d_{i} = ∣ {j : e_{j} \geq i + 1} ∣ .$ Consequently, for every $k \geq 1$ , the number of summands of order $p^{k}$ is $d_{k - 1} - d_{k}$ , so the elementary divisors are intrinsic. (The successive quotients p^iG/p^{i+1}G recover the cyclic summand multiplicities of a finite abelian p-group).

[L5]

If $G = ⟨ g ⟩$ is cyclic, then exactly one of the following applies: - if $g$ has infinite order, $G ≅ (Z, +)$ ; - if $g$ has finite order $n$ , necessarily $n \geq 1$ , then $G ≅ (Z / n, +)$ . (Every cyclic group is isomorphic to $(Z, +)$ or to $(Z / n, +)$ for its finite order $n \geq 1$ ).

Proof

technique · direct

1.1

Primary decomposition separates $G$ into its intrinsic $p$ -primary components, and cyclic decomposition expresses each component as a product of cyclic $p$ -groups. This proves existence.

givenL1L2L3L4L5

2.1

For a fixed prime $p$ , the successive quotients $p^{i} G (p) / p^{i + 1} G (p)$ recover the multiplicity of every cyclic order $p^{k}$ .

step 1.1

3.1

Doing this independently for each prime proves uniqueness of the multiset of elementary divisors. The assertion concerns factor isomorphism types, not uniqueness of internal complements.

step 2.1∎

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-11Open item page →

Invariant-factor data for a finite abelian group

Definition

An invariant-factor list for a finite abelian group $G$ is a finite list of integers $1 < n_{1} ∣ n_{2} ∣ \dots ∣ n_{r}$ together with an isomorphism $G ≅ C_{n_{1}} \times \dots \times C_{n_{r}}$ . The cyclic factors and product use Every cyclic group is isomorphic to $(Z, +)$ or to $(Z / n, +)$ for its finite order $n \geq 1$ and The external direct product $G \times H$ with componentwise multiplication. Unit factors are omitted. The trivial group has the empty list.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Elementary divisors regroup uniquely into invariant factors

Statement

Every multiset of prime-power elementary divisors regroups in exactly one way into an invariant-factor list.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

An elementary-divisor decomposition of a finite abelian group $G$ is an isomorphism $G ≅ C_{q_{0}} \times \dots \times C_{q_{r - 1}},$ where every $q_{i} > 1$ is a prime power. The unordered multiset of the $q_{i}$ , counted with multiplicity, is the elementary-divisor data. The cyclic factors and product use thm-classification-of-cyclic-groups and def-external-direct-product-of-groups. The data records factor isomorphism types, not distinguished internal subgroups; the trivial group has empty data. (Elementary-divisor data for a finite abelian group).

[L2]

An invariant-factor list for a finite abelian group $G$ is a finite list of integers $1 < n_{1} ∣ n_{2} ∣ \dots ∣ n_{r}$ together with an isomorphism $G ≅ C_{n_{1}} \times \dots \times C_{n_{r}}$ . The cyclic factors and product use thm-classification-of-cyclic-groups and def-external-direct-product-of-groups. Unit factors are omitted. The trivial group has the empty list. (Invariant-factor data for a finite abelian group).

[L3]

Let $n_{0}, \dots, n_{r - 1}$ be a finite pairwise-coprime list of positive integers and let $N : = \prod_{i < r} n_{i}$ . The map $Φ : Z / N ⟶ \prod_{i < r} Z / n_{i}, [x]_{N} ⟼ ([x]_{n_{i}})_{i < r},$ is a bijection. It preserves addition, multiplication, $[0]$ , and $[1]$ componentwise. For the empty list, $N = 1$ and both sides have one element. (Chinese remainder theorem for a finite pairwise-coprime list: simultaneous residues determine one class modulo the product, and the resulting bijection preserves addition and multiplication).

[L4]

Let $ι : N \to Z$ be the canonical embedding. If $g \in G$ and $h \in H$ have finite orders $m, n \geq 1$ , then in the external direct product $ord (g, h) = lcm (m, n) .$ (If $g$ and $h$ have finite orders $m$ and $n$ , then $ι (ord (g, h)) = lcm (ι (m), ι (n))$ in $G \times H$ ).

[L5]

If $G = ⟨ g ⟩$ is cyclic, then exactly one of the following applies: - if $g$ has infinite order, $G ≅ (Z, +)$ ; - if $g$ has finite order $n$ , necessarily $n \geq 1$ , then $G ≅ (Z / n, +)$ . (Every cyclic group is isomorphic to $(Z, +)$ or to $(Z / n, +)$ for its finite order $n \geq 1$ ).

[L6]

Powers are the natural powers of def-group-power and finite products those of def-monoid-finite-product, both taken in the commutative monoid $(Z, \cdot, 1)$ of lem-units-of-z. Call $p : r \to Z$ an injective list of primes when every $p_{i}$ is prime (def-prime) and $p_{i} = p_{j}$ forces $i = j$ (def-injection-surjection-bijection). Let $n \in Z$ with $n \geq 1$ and let $p : r \to Z$ be an injective list of primes such that every prime divisor of $n$ equals $p_{i}$ for some $i < r$ . Then, with $v_{q}$ as in def-p-adic-valuation: 1. $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; 2. $v_{q} (n) = 0$ for every prime $q$ that is not among $p_{0}, \dots, p_{r - 1}$ ; 3. the exponents are determined by $n$ : if $e : r \to N$ and $n = \prod_{i < r} p_{i}^{e_{i}}$ , then $e_{j} = v_{p_{j}} (n)$ for every $j < r$ . Clause 3 needs only injectivity of the list, not the covering hypothesis. (For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list).

Proof

technique · direct

1.1

For each prime $p$ , sort its exponents increasingly. Left-pad the shorter prime lists with zeros until all have the same length, then multiply the prime powers columnwise to obtain $n_{1}, \dots, n_{r}$ .

givenL1L2L3L4L5

2.1

The aligned exponents are nondecreasing, so $n_{1} ∣ \dots ∣ n_{r}$ . The Chinese remainder theorem identifies each column product of coprime cyclic groups with $C_{n_{i}}$ .

step 1.1

3.1

Conversely, canonical prime factorisation of each $n_{i}$ recovers every padded exponent column and hence the original elementary divisors.

step 2.1L6

4.1

The empty multiset gives the empty list, so uniqueness includes the trivial group.

step 3.1∎

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Fundamental theorem of finite abelian groups: invariant-factor form

Statement

For every finite abelian group $G$ there is a unique list $1 < n_{1} ∣ \dots ∣ n_{r}$ such that $G ≅ C_{n_{1}} \times \dots \times C_{n_{r}}$ . Moreover $∣ G ∣ = n_{1} \dots n_{r}$ . The trivial group corresponds to the empty list and empty product.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Every finite abelian group is isomorphic to a finite direct product of cyclic groups of prime-power order. The multiset of their orders is uniquely determined by the group, up to permutation of the factors. (Fundamental theorem of finite abelian groups: elementary-divisor form).

[L2]

Every multiset of prime-power elementary divisors regroups in exactly one way into an invariant-factor list. (Elementary divisors regroup uniquely into invariant factors).

[L3]

An invariant-factor list for a finite abelian group $G$ is a finite list of integers $1 < n_{1} ∣ n_{2} ∣ \dots ∣ n_{r}$ together with an isomorphism $G ≅ C_{n_{1}} \times \dots \times C_{n_{r}}$ . The cyclic factors and product use thm-classification-of-cyclic-groups and def-external-direct-product-of-groups. Unit factors are omitted. The trivial group has the empty list. (Invariant-factor data for a finite abelian group).

[L4]

If $G$ and $H$ are finite groups, then their external direct product is finite and has order $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ . (For finite groups $G$ and $H$ , $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ ).

Proof

technique · direct

1.1

The elementary-divisor theorem supplies a unique multiset of prime powers, and the regrouping lemma converts it into a unique invariant-factor list.

givenL1L2L3L4

2.1

The order formula for finite direct products gives $∣ G ∣ = \prod_{i} n_{i}$ ; for the empty list this product is $1$ , the order of the trivial group.

step 1.1∎

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Converse of Lagrange for finite abelian groups: every divisor occurs as a subgroup order

Statement

Let $G$ be finite abelian and let $d$ be a positive divisor of $∣ G ∣$ . Then $G$ has a subgroup of order $d$ .

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let $d, a \in Z$ (def-integers). We say $d$ divides $a$ , and write $d ∣ a$ , when $a = d q for some q \in Z,$ the product being that of def-int-operations. We write $d ∤ a$ when this fails. In this situation $d$ is called a divisor, or a factor, of $a$ , and $a$ is called a multiple of $d$ . This is the relation the library already has, not a second one. The published thm-division-algorithm-in-z introduces it in its own Statement, in these words: "We say $b$ divides $a$ , written $b ∣ a$ , when $a = q b$ for some $q \in Z$ ." Since multiplication on $Z$ is commutative (thm-int-comm-ring), $a = q d$ and $a = d q$ are the same condition, so the definition above is that relation verbatim and the two usages agree everywhere. The theorem defined it for use on its own page and left the systematic theory to a later page; this is that page, and this item records the agreement rather than introducing a rival notion. The remainder test. For $b > 0$ the same Statement records that $b ∣ a$ holds exactly when the remainder $r$ in $a = q b + r$ , $0 \leq r < b$ , is $0$ . Boundary values. Each is one line from the ring axioms, and each is used below, so all three are recorded here rather than assumed: - $d ∣ 0$ for every integer $d$ , including $d = 0$ , since $0 = d \cdot 0$ ; - $0 ∣ a$ only for $a = 0$ , since $a = 0 \cdot q$ forces $a = 0$ ; - $1 ∣ a$ and $a ∣ a$ for every $a$ , since $a = 1 \cdot a$ and $a = a \cdot 1$ . (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L2]

The order of a finite group. Let $G$ be a group (def-group) whose underlying set is finite (def-countable), so that $G \approx n$ for some $n \in N$ (def-equinumerous). That natural number is unique: if $G \approx n$ and $G \approx n^{'}$ then $n \approx n^{'}$ , since $\approx$ is symmetric and transitive, and then $n = n^{'}$ by claim 3 of lem-pigeonhole. The order of $G$ is that unique natural number, written $∣ G ∣$ . A group is infinite when its underlying set is not finite, and $∣ G ∣$ is then not defined. The order of an element. Let $G$ be any group and $g \in G$ , with natural powers as in def-group-power. Put $S_{g} : = {k \in N : k \geq 1 and g^{k} = e} \subseteq N .$ - If $S_{g} \neq \emptyset$ , the order of $g$ is its least element, $ord (g) : = \min S_{g} \in N,$ which exists by the well-ordering principle (thm-well-ordering-principle): every nonempty subset of $N$ has a least element, and that element is unique, being $\leq$ every element of $S_{g}$ and a member of it. We then say $g$ has finite order. - If $S_{g} = \emptyset$ we say $g$ has infinite order and write $ord (g) = \infty$ , where $\infty$ is a symbol reserved for this case and is not a natural number. No arithmetic is performed with it here. By construction $ord (g) \geq 1$ whenever it is finite, and $ord (g) = 1$ exactly when $g = e$ , since $g^{1} = g$ . Every element of a finite group has finite order. If $G$ is finite then $S_{g} \neq \emptyset$ for every $g \in G$ , by lem-order-of-element-exists, so $ord (g)$ is a natural number. (The order $∣ G ∣$ of a finite group and the order $ord (g)$ of an element, with $ord (g) = \infty$ when no positive power of $g$ is the identity).

[L3]

Let $P$ be a property of naturals such that for every $n \in N$ , if $P (m)$ holds for all $m < n$ then $P (n)$ . Then $P (n)$ holds for all $n \in N$ . (At $n = 0$ the hypothesis is vacuous, so $P (0)$ is forced.) (Strong (complete) induction).

[L4]

Let $n \in Z$ with $n > 1$ , and put $S : = {d \in Z : d ∣ n and d > 1}$ (def-divides-in-z). Then $S$ is nonempty and has a least element $q$ , and $q$ is prime (def-prime). In particular every integer greater than $1$ has a prime divisor. (Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime).

[L5]

Let $G$ be a finite abelian group and let $p$ be a prime dividing $∣ G ∣$ . Then $G$ contains an element, and hence a subgroup, of order $p$ . (Cauchy's theorem for finite abelian groups).

[L6]

Let $G$ be a group and let $N ⊴ G$ be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, $G / N$ has the left cosets $G / N : = {g N : g \in G}$ as its elements (def-coset, def-index), with product $(g N) (h N) : = g h N .$ Independence of the chosen representatives is proved in thm-coset-multiplication-well-defined-iff-normal, and the group axioms are proved in thm-quotient-group-laws. (The quotient group $G / N$ and coset product $(g N) (h N) = g h N$ ).

[L7]

If $G$ is abelian and $N ⊴ G$ , then $G / N$ is abelian. (Every quotient group of an abelian group is abelian).

[L8]

Let $N ⊴ G$ . If $[G : N]$ is finite, then the quotient group $G / N$ is finite and $∣ G / N ∣ = [G : N] .$ In particular, if $G$ is finite, then $∣ G / N ∣ = \frac{∣ G ∣}{∣ N ∣} .$ (If $[G : N]$ is finite then $∣ G / N ∣ = [G : N]$ ; for finite $G$ this equals $∣ G ∣ / ∣ N ∣$ ).

[L9]

Correspondence theorem: subgroups of $G / N$ correspond to subgroups of $G$ containing $N$ , with normality preserved. For $N ⊴ G$ , the maps $H \mapsto H / N$ and $K \mapsto π^{- 1} (K)$ are inverse inclusion-preserving bijections between subgroups $H$ with $N \leq H \leq G$ and subgroups $K \leq G / N$ ; they preserve normality. (Correspondence theorem: subgroups of $G / N$ correspond to subgroups of $G$ containing $N$ , with normality preserved).

Proof

technique · direct

1.1

Use strong induction on $∣ G ∣$ . If $d = 1$ , take the trivial subgroup; this also settles the trivial group.

givenL1L2L3L4L5L6L7L8L9

2.1

For $d > 1$ , choose a prime $p ∣ d$ . Cauchy's theorem gives a subgroup $H \leq G$ of order $p$ , and $G / H$ is finite abelian of order $∣ G ∣ / p$ .

step 1.1

3.1

The integer $d / p$ divides $∣ G / H ∣$ , so induction gives a subgroup $K / H \leq G / H$ of order $d / p$ .

step 2.1

4.1

By correspondence its full preimage $K \leq G$ has $∣ K ∣ = ∣ H ∣ ∣ K / H ∣ = d$ . The case $d = ∣ G ∣$ returns $K = G$ .

step 3.1∎

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-11Open item page →

The exponent of a finite group

Definition

For a finite group $G$ , its exponent is $\exp (G) = \min {n \in N : n > 0 and g^{n} = e for every g \in G} .$ The set is nonempty by $g^{∣ G ∣} = e$ for every element $g$ of a finite group $G$ , and The well-ordering principle gives its least member; powers use Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ . Thus the definition is well-defined. For the trivial group $\exp (G) = 1$ .

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Invariant factors determine the order and exponent of a finite abelian group

Statement

If $G ≅ C_{n_{1}} \times \dots \times C_{n_{r}}$ with $1 < n_{1} ∣ \dots ∣ n_{r}$ , then $∣ G ∣ = n_{1} \dots n_{r}$ and $\exp (G) = n_{r}$ . For the empty list, $∣ G ∣ = \exp (G) = 1$ .

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

For every finite abelian group $G$ there is a unique list $1 < n_{1} ∣ \dots ∣ n_{r}$ such that $G ≅ C_{n_{1}} \times \dots \times C_{n_{r}}$ . Moreover $∣ G ∣ = n_{1} \dots n_{r}$ . The trivial group corresponds to the empty list and empty product. (Fundamental theorem of finite abelian groups: invariant-factor form).

[L2]

For a finite group $G$ , its exponent is $\exp (G) = \min {n \in N : n > 0 and g^{n} = e for every g \in G} .$ The set is nonempty by cor-g-to-the-group-order-is-identity, and thm-well-ordering-principle gives its least member; powers use def-group-power. Thus the definition is well-defined. For the trivial group $\exp (G) = 1$ . (The exponent of a finite group).

[L3]

If $G$ and $H$ are finite groups, then their external direct product is finite and has order $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ . (For finite groups $G$ and $H$ , $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ ).

[L4]

Let $ι : N \to Z$ be the canonical embedding. If $g \in G$ and $h \in H$ have finite orders $m, n \geq 1$ , then in the external direct product $ord (g, h) = lcm (m, n) .$ (If $g$ and $h$ have finite orders $m$ and $n$ , then $ι (ord (g, h)) = lcm (ι (m), ι (n))$ in $G \times H$ ).

Proof

technique · direct

1.1

The finite-product order formula gives $∣ G ∣ = \prod_{i} n_{i}$ , including the empty product.

givenL1L2L3L4

2.1

The order of an element of the product is the least common multiple of its component orders. Because $n_{i} ∣ n_{r}$ , every element order divides $n_{r}$ , while an element generating the last factor has order $n_{r}$ .

step 1.1

3.1

The least common annihilating exponent is therefore $n_{r}$ when the list is nonempty, and is $1$ for the trivial group.

step 2.1∎

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A nontrivial finite abelian group is cyclic if and only if it has one invariant factor

Statement

A nontrivial finite abelian group is cyclic if and only if its invariant-factor list has exactly one entry.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

For every finite abelian group $G$ there is a unique list $1 < n_{1} ∣ \dots ∣ n_{r}$ such that $G ≅ C_{n_{1}} \times \dots \times C_{n_{r}}$ . Moreover $∣ G ∣ = n_{1} \dots n_{r}$ . The trivial group corresponds to the empty list and empty product. (Fundamental theorem of finite abelian groups: invariant-factor form).

[L2]

If $G ≅ C_{n_{1}} \times \dots \times C_{n_{r}}$ with $1 < n_{1} ∣ \dots ∣ n_{r}$ , then $∣ G ∣ = n_{1} \dots n_{r}$ and $\exp (G) = n_{r}$ . For the empty list, $∣ G ∣ = \exp (G) = 1$ . (Invariant factors determine the order and exponent of a finite abelian group).

[L3]

If $G = ⟨ g ⟩$ is cyclic, then exactly one of the following applies: - if $g$ has infinite order, $G ≅ (Z, +)$ ; - if $g$ has finite order $n$ , necessarily $n \geq 1$ , then $G ≅ (Z / n, +)$ . (Every cyclic group is isomorphic to $(Z, +)$ or to $(Z / n, +)$ for its finite order $n \geq 1$ ).

Proof

technique · direct

1.1

A one-entry invariant-factor decomposition is an isomorphism with one cyclic group, so $G$ is cyclic.

givenL1L2L3

2.1

Conversely a nontrivial finite cyclic group is isomorphic to $C_{∣ G ∣}$ , giving the one-entry list; uniqueness of invariant factors rules out any different list.

step 1.1∎

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-11Open item page →

Indecomposable and decomposable nontrivial finite abelian groups

Definition

A nontrivial finite abelian group is indecomposable if it is not an internal direct product of two nontrivial subgroups in the sense of Internal direct products of finitely many normal subgroups. It is decomposable if such a product exists. The trivial group is assigned neither label.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Every nontrivial finite abelian group is an internal direct product of indecomposable subgroups

Statement

Every nontrivial finite abelian group is an internal direct product of finitely many indecomposable subgroups.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

A nontrivial finite abelian group is indecomposable if it is not an internal direct product of two nontrivial subgroups in the sense of def-internal-direct-product-of-subgroups. It is decomposable if such a product exists. The trivial group is assigned neither label. (Indecomposable and decomposable nontrivial finite abelian groups).

[L2]

Let $P$ be a property of naturals such that for every $n \in N$ , if $P (m)$ holds for all $m < n$ then $P (n)$ . Then $P (n)$ holds for all $n \in N$ . (At $n = 0$ the hypothesis is vacuous, so $P (0)$ is forced.) (Strong (complete) induction).

[L3]

Let $N_{0}, \dots, N_{r - 1} ⊴ G$ . The following are equivalent: the $N_{i}$ form an internal direct product of $G$ ; every $g \in G$ has a unique expression $g = n_{0} \dots n_{r - 1}$ with $n_{i} \in N_{i}$ ; and the multiplication map $μ : \prod_{i < r} N_{i} \to G$ is an isomorphism. These statements include the empty family and the one-factor case. (Internal direct products are external direct products, equivalently every element has a unique factorisation).

[L4]

Let $G$ be a finite group and $H \leq G$ . Then $∣ G ∣ = [G : H] ∣ H ∣ .$ Consequently, under the canonical embedding $ι : N \to Z$ , $∣ H ∣$ divides $∣ G ∣$ . (Lagrange's theorem: $∣ G ∣ = [G : H] ∣ H ∣$ for every subgroup $H$ of a finite group $G$ ).

Proof

technique · induction

1.1

For strong induction on $∣ G ∣$ , the order-one case is vacuous because the only group of that order is trivial.

basegivenL1L2L3L4

2.1

Fix a nontrivial $G$ and assume the result for every nontrivial finite abelian group of smaller order. If $G$ is indecomposable, the one-factor product is the required decomposition.

ihstep 1.1

3.1

If $G$ is decomposable, write $G = B \oplus C$ with $B$ and $C$ nontrivial. Lagrange gives $∣ B ∣, ∣ C ∣ < ∣ G ∣$ , so the induction hypothesis decomposes each into indecomposable factors.

step 2.1

4.1

Unique factorisation in $B \oplus C$ and in the two inductive products combines to unique factorisation by all the smaller factors; internal-product recognition completes the induction.

step 3.1discharge-induction∎

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

The indecomposable finite abelian groups are exactly the nontrivial cyclic groups of prime-power order

Statement

The indecomposable finite abelian groups are exactly the nontrivial cyclic groups of prime-power order.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

A nontrivial finite abelian group is indecomposable if it is not an internal direct product of two nontrivial subgroups in the sense of def-internal-direct-product-of-subgroups. It is decomposable if such a product exists. The trivial group is assigned neither label. (Indecomposable and decomposable nontrivial finite abelian groups).

[L2]

Every finite abelian group is isomorphic to a finite direct product of cyclic groups of prime-power order. The multiset of their orders is uniquely determined by the group, up to permutation of the factors. (Fundamental theorem of finite abelian groups: elementary-divisor form).

[L3]

Let $G$ be a finite abelian group and let $p$ be a prime dividing $∣ G ∣$ . Then $G$ contains an element, and hence a subgroup, of order $p$ . (Cauchy's theorem for finite abelian groups).

[L4]

Every subgroup $H$ of a cyclic group $G = ⟨ g ⟩$ is cyclic. If $H \neq {e}$ , then the least positive integer $d$ for which $g^{d} \in H$ satisfies $H = ⟨ g^{d} ⟩$ . (Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator).

[L5]

Let $G$ be a finite group such that the positive integer $∣ G ∣$ is prime. Then every $g \neq e$ has order $∣ G ∣$ , satisfies $⟨ g ⟩ = G$ , and hence generates $G$ . In particular, $G$ is cyclic. (A finite group of prime order is cyclic and every nonidentity element generates it).

Proof

technique · direct

1.1

The elementary-divisor theorem writes any nontrivial finite abelian group as a product of nontrivial cyclic prime-power factors. Indecomposability forces exactly one factor.

givenL1L2L3L4L5

2.1

Conversely, if $C_{p^{a}} = B \oplus C$ with both factors nontrivial, Cauchy's theorem gives an order- $p$ subgroup in each factor. Their images are distinct, but a cyclic group has a unique subgroup of each possible order. Hence no such decomposition exists.

step 1.1∎

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-11Open item page →

Partitions of a positive integer

Definition

For $n > 0$ , a partition of $n$ is a finite nondecreasing list of positive integers $(e_{1}, \dots, e_{r})$ with $e_{1} + \dots + e_{r} = n$ , using finite natural sums as in Finite sums and finite products of natural numbers, $\sum_{k < n} a_{k}$ and $\prod_{k < n} a_{k}$ in $N$ and naturals as in The natural numbers $N$ (von Neumann). Equality is equality of these lists. The nondecreasing convention removes permutations from the data.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Isomorphism classes of abelian groups of order p^n are counted by partitions of n

Statement

For a prime $p$ and $n > 0$ , isomorphism classes of abelian groups of order $p^{n}$ are in bijection with partitions of $n$ . For $n = 0$ , the unique group is the trivial group and corresponds separately to the empty partition.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Every finite abelian group is isomorphic to a finite direct product of cyclic groups of prime-power order. The multiset of their orders is uniquely determined by the group, up to permutation of the factors. (Fundamental theorem of finite abelian groups: elementary-divisor form).

[L2]

For $n > 0$ , a partition of $n$ is a finite nondecreasing list of positive integers $(e_{1}, \dots, e_{r})$ with $e_{1} + \dots + e_{r} = n$ , using finite natural sums as in def-nat-finite-sum-and-product and naturals as in def-natural-numbers. Equality is equality of these lists. The nondecreasing convention removes permutations from the data. (Partitions of a positive integer).

[L3]

If $G$ and $H$ are finite groups, then their external direct product is finite and has order $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ . (For finite groups $G$ and $H$ , $∣ G \times H ∣ = ∣ G ∣ ∣ H ∣$ ).

Proof

technique · direct

1.1

The elementary-divisor theorem writes such a group uniquely as $C_{p^{e_{1}}} \times \dots \times C_{p^{e_{r}}}$ with the positive exponents arranged nondecreasingly. The product-order formula gives $e_{1} + \dots + e_{r} = n$ .

givenL1L2L3

2.1

Thus the exponents form a partition of $n$ , and every partition constructs a group of order $p^{n}$ . Uniqueness of elementary divisors makes the two constructions inverse.

step 1.1∎

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

The number of finite abelian groups of order n is the product of the partition numbers of the prime exponents of n

Statement

Let $n \geq 1$ , and write its canonical prime factorisation as $n = \prod_{i < r} p_{i}^{a_{i}}$ , with the $p_{i}$ distinct and $a_{i} > 0$ . Then the number of isomorphism classes of abelian groups of order $n$ is $\prod_{i < r} P (a_{i}),$ where $P (a)$ is the number of partitions of $a$ . For $n = 1$ one has $r = 0$ , so the empty product is $1$ .

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

If $G$ is finite abelian and $∣ G ∣ = \prod_{i < r} p_{i}^{a_{i}}$ is its prime factorisation, then the subgroups $G (p_{i})$ form an internal direct product of $G$ . Thus $G ≅ \prod_{i < r} G (p_{i}) .$ For the trivial group, this is the empty product. (A finite abelian group is the internal direct product of its primary components).

[L2]

For a prime $p$ and $n > 0$ , isomorphism classes of abelian groups of order $p^{n}$ are in bijection with partitions of $n$ . For $n = 0$ , the unique group is the trivial group and corresponds separately to the empty partition. (Isomorphism classes of abelian groups of order p^n are counted by partitions of n).

[L3]

Powers are the natural powers of def-group-power and finite products those of def-monoid-finite-product, both taken in the commutative monoid $(Z, \cdot, 1)$ of lem-units-of-z. Call $p : r \to Z$ an injective list of primes when every $p_{i}$ is prime (def-prime) and $p_{i} = p_{j}$ forces $i = j$ (def-injection-surjection-bijection). Let $n \in Z$ with $n \geq 1$ and let $p : r \to Z$ be an injective list of primes such that every prime divisor of $n$ equals $p_{i}$ for some $i < r$ . Then, with $v_{q}$ as in def-p-adic-valuation: 1. $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; 2. $v_{q} (n) = 0$ for every prime $q$ that is not among $p_{0}, \dots, p_{r - 1}$ ; 3. the exponents are determined by $n$ : if $e : r \to N$ and $n = \prod_{i < r} p_{i}^{e_{i}}$ , then $e_{j} = v_{p_{j}} (n)$ for every $j < r$ . Clause 3 needs only injectivity of the list, not the covering hypothesis. (For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list).

[L4]

Let $(M, \cdot, e)$ be a monoid (def-semigroup-and-monoid) and let $g : N \to M$ be a family of elements of $M$ , written $g_{i} : = g (i)$ . There is exactly one function $P_{g} : N \to M$ satisfying $P_{g} (0) = e, P_{g} (σ (n)) = P_{g} (n) \cdot g_{n} (n \in N),$ and we write $\prod_{i < n} g_{i} : = P_{g} (n), also written g_{0} g_{1} \dots g_{n - 1} .$ In particular the empty product is $\prod_{i < 0} g_{i} = e$ , and $\prod_{i < 1} g_{i} = e \cdot g_{0} = g_{0}$ . Why the recursion is legitimate. The clause $P_{g} (σ (n)) = P_{g} (n) \cdot g_{n}$ consults $n$ as well as $P_{g} (n)$ , so thm-recursion does not apply to it directly. Apply that theorem instead with the set $A = N \times M$ , the element $a = (0, e)$ , and the function $F : A \to A$ given by $F (n, x) = (σ (n), x \cdot g_{n})$ : it yields a unique $H : N \to N \times M$ with $H (0) = (0, e)$ and $H (σ (n)) = F (H (n))$ . Writing $H (n) = (H_{1} (n), H_{2} (n))$ , induction (thm-induction-principle) gives $H_{1} (n) = n$ for every $n$ , since $H_{1} (0) = 0$ and $H_{1} (σ (n)) = σ (H_{1} (n))$ . Hence $H (σ (n)) = (σ (n), H_{2} (n) \cdot g_{n})$ , so $P_{g} : = H_{2}$ satisfies the two displayed equations. It is the only such function: if $Q$ satisfies them too, then ${n : P_{g} (n) = Q (n)}$ contains $0$ and is closed under $σ$ , hence is all of $N$ by induction. The value depends only on $g_{0}, \dots, g_{n - 1}$ . If $g, g^{'} : N \to M$ satisfy $g_{i} = g_{i}^{'}$ for every $i < n$ , then $P_{g} (n) = P_{g^{'}} (n)$ . Indeed the set of $n$ for which this implication holds contains $0$ , both products then being $e$ ; and if it holds at $n$ , and $g, g^{'}$ agree at every $i < σ (n)$ , then they agree at every $i < n$ and also at $n$ itself, because $i < σ (n)$ is equivalent to $i \leq n$ (lem-nat-order-is-membership), so $P_{g} (σ (n)) = P_{g} (n) \cdot g_{n} = P_{g^{'}} (n) \cdot g_{n}^{'} = P_{g^{'}} (σ (n))$ . Induction finishes it. This is what makes the notation $g_{0} g_{1} \dots g_{n - 1}$ unambiguous: it names a value determined by the first $n$ terms alone, and a finite list $u$ of length $n$ , that is a function $u : n \to M$ on the von Neumann natural $n = {0, \dots, n - 1}$ (def-natural-numbers), determines the product $\prod_{i < n} u_{i} : = P_{\tilde{u}} (n)$ computed from any extension $\tilde{u} : N \to M$ of $u$ . (The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity).

Proof

technique · direct

1.1

Primary decomposition makes an abelian group of order $n$ the product of one abelian $p_{i}$ -group of order $p_{i}^{a_{i}}$ for each $i < r$ .

givenL1L2L3L4

2.1

The choices for distinct primes are independent and the preceding corollary counts the $i$ th choice by $P (a_{i})$ , so the product rule gives the formula. The empty prime factorisation of $1$ gives one choice.

step 1.1∎

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-11Open item page →

Squarefree positive integers

Definition

A positive integer $n$ is squarefree if no square of a prime divides $n$ . Equivalently, every exponent in its canonical prime factorisation is $0$ or $1$ . The integer $1$ is squarefree by the empty factorisation.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Every abelian group of order n is cyclic if and only if n is squarefree

Statement

For a positive integer $n$ , every abelian group of order $n$ is cyclic if and only if $n$ is squarefree.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

A positive integer $n$ is squarefree if no square of a prime divides $n$ . Equivalently, every exponent in its canonical prime factorisation is $0$ or $1$ . The integer $1$ is squarefree by the empty factorisation. (Squarefree positive integers).

[L2]

Every finite abelian group is isomorphic to a finite direct product of cyclic groups of prime-power order. The multiset of their orders is uniquely determined by the group, up to permutation of the factors. (Fundamental theorem of finite abelian groups: elementary-divisor form).

[L3]

If $G$ is finite abelian and $∣ G ∣ = \prod_{i < r} p_{i}^{a_{i}}$ is its prime factorisation, then the subgroups $G (p_{i})$ form an internal direct product of $G$ . Thus $G ≅ \prod_{i < r} G (p_{i}) .$ For the trivial group, this is the empty product. (A finite abelian group is the internal direct product of its primary components).

[L4]

Let $n_{0}, \dots, n_{r - 1}$ be a finite pairwise-coprime list of positive integers and let $N : = \prod_{i < r} n_{i}$ . The map $Φ : Z / N ⟶ \prod_{i < r} Z / n_{i}, [x]_{N} ⟼ ([x]_{n_{i}})_{i < r},$ is a bijection. It preserves addition, multiplication, $[0]$ , and $[1]$ componentwise. For the empty list, $N = 1$ and both sides have one element. (Chinese remainder theorem for a finite pairwise-coprime list: simultaneous residues determine one class modulo the product, and the resulting bijection preserves addition and multiplication).

[L5]

Let $ι : N \to Z$ be the canonical embedding. If $g \in G$ and $h \in H$ have finite orders $m, n \geq 1$ , then in the external direct product $ord (g, h) = lcm (m, n) .$ (If $g$ and $h$ have finite orders $m$ and $n$ , then $ι (ord (g, h)) = lcm (ι (m), ι (n))$ in $G \times H$ ).

Proof

technique · direct

1.1

If $n$ is squarefree, each primary component of an abelian group of order $n$ has prime order and is cyclic. The Chinese remainder theorem combines the cyclic factors of pairwise coprime orders into a cyclic group of order $n$ .

givenL1L2L3L4L5

2.1

If $p^{2} ∣ n$ , write $n = p^{a} m$ with $a \geq 2$ and $(p, m) = 1$ . The abelian group $C_{p} \times C_{p} \times C_{p^{a - 2}} \times C_{m}$ , omitting trivial factors, has order $n$ but exponent strictly below $n$ , so it is not cyclic.

step 1.1

3.1

For $n = 1$ the sole group is trivial and cyclic, agreeing with squarefreeness of $1$ .

step 2.1∎

The Fundamental Theorem of Finite Abelian Groups

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

Internal direct products of finitely many normal subgroups

Definition

Internal direct products are external direct products, equivalently every element has a unique factorisation

Statement

Facts & Assumptions

Proof

The p-primary component of an abelian group

Definition

Cauchy's theorem for finite abelian groups

Statement

Facts & Assumptions

Proof

A p-primary component has the full p-power order and is the unique subgroup of that order

Statement

Facts & Assumptions

Proof

A finite abelian group is the internal direct product of its primary components

Statement

Facts & Assumptions

Proof

A nontrivial finite abelian p-group with a unique subgroup of order p is cyclic

Statement

Facts & Assumptions

Proof

A maximal-order cyclic subgroup splits off a finite abelian p-group

Statement

Facts & Assumptions

Proof

Every finite abelian p-group is a direct product of cyclic p-groups

Statement

Facts & Assumptions

Proof

Elementary-divisor data for a finite abelian group

Definition

The successive quotients p^iG/p^{i+1}G recover the cyclic summand multiplicities of a finite abelian p-group

Statement

Facts & Assumptions

Proof

Fundamental theorem of finite abelian groups: elementary-divisor form

Statement

Facts & Assumptions

Proof

Invariant-factor data for a finite abelian group

Definition

Elementary divisors regroup uniquely into invariant factors

Statement

Facts & Assumptions

Proof

Fundamental theorem of finite abelian groups: invariant-factor form

Statement

Facts & Assumptions

Proof

Converse of Lagrange for finite abelian groups: every divisor occurs as a subgroup order

Statement

Facts & Assumptions

Proof

The exponent of a finite group

Definition

Invariant factors determine the order and exponent of a finite abelian group

Statement

Facts & Assumptions

Proof

A nontrivial finite abelian group is cyclic if and only if it has one invariant factor

Statement

Facts & Assumptions

Proof

Indecomposable and decomposable nontrivial finite abelian groups

Definition

Every nontrivial finite abelian group is an internal direct product of indecomposable subgroups

Statement

Facts & Assumptions

Proof

The indecomposable finite abelian groups are exactly the nontrivial cyclic groups of prime-power order

Statement

Facts & Assumptions