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 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∈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]

Let G be a finite group and H≤G. Then ∣G∣=[G:H] ∣H∣. Consequently, under the canonical embedding ι:N→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⊕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⊕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∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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