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.

Fundamental theorem of finite abelian groups: invariant-factor form

Statement

For every finite abelian group G there is a unique list 1<n1∣⋯∣nr such that G≅Cn1×⋯×Cnr. Moreover ∣G∣=n1⋯nr. 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<n1∣n2∣⋯∣nr together with an isomorphism G≅Cn1×⋯×Cnr. 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×H∣=∣G∣ ∣H∣. (For finite groups G and H, ∣G×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∣=∏ini; for the empty list this product is 1, the order of the trivial group.

step 1.1∎

Depends on

Used by

Dependency tree · two levels

16 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