Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck 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 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∈G have maximal element order. Then there is a subgroup H≤G such that G=⟨a⟩⊕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∈N, if P(m) holds for all m<n then P(n). Then P(n) holds for all n∈N. (At n=0 the hypothesis is vacuous, so P(0) is forced.) (Strong (complete) induction).

[L3]

Let N0,…,Nr−1⊴G. The following are equivalent: the Ni form an internal direct product of G; every g∈G has a unique expression g=n0⋯nr−1 with ni∈Ni; and the multiplication map μ:∏i<rNi→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≥1, then G≅(Z/n,+). (Every cyclic group is isomorphic to (Z,+) or to (Z/n,+) for its finite order n≥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⟩⊕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∎

Depends on

Used by

Dependency tree · two levels

25 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources