Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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

Statement

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

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let GG be a finite abelian pp-group and let aGa\in G have maximal element order. Then there is a subgroup HGH\le G such that G=aH.G=\langle a\rangle\oplus H. (A maximal-order cyclic subgroup splits off a finite abelian p-group).

[L2]

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

[L3]

Let N0,,Nr1GN_0,\ldots,N_{r-1}\trianglelefteq G. The following are equivalent: the NiN_i form an internal direct product of GG; every gGg\in G has a unique expression g=n0nr1g=n_0\cdots n_{r-1} with niNin_i\in N_i; and the multiplication map μ:i<rNiG\mu:\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=gG=\langle g\rangle is cyclic, then exactly one of the following applies: - if gg has infinite order, G(Z,+)G\cong(\mathbb Z,+); - if gg has finite order nn, necessarily n1n\ge1, then G(Z/n,+)G\cong(\mathbb Z/n,+). (Every cyclic group is isomorphic to (Z,+)(\mathbb Z,+) or to (Z/n,+)(\mathbb Z/n,+) for its finite order n1n\ge1).

Proof

technique · induction
1.1

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

basegivenL1L2L3L4
2.1

Fix the induction hypothesis for smaller finite abelian pp-groups. If GG is nontrivial, choose aa of maximal order and split G=aHG=\langle a\rangle\oplus H.

ihstep 1.1
3.1

The cyclic factor a\langle a\rangle has prime-power order. If HH is nontrivial then H<G|H|<|G|, so the induction hypothesis decomposes HH into cyclic pp-groups.

step 2.1
4.1

Concatenating that decomposition with a\langle a\rangle and applying internal-product recognition gives the asserted external direct product, completing the induction.

step 3.1discharge-induction

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 81 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources