Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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 group is a quotient of (Z/n)k for some n and k

Statement

For every finite abelian group G there are positive integers n and k and a surjective group homomorphism

(Z/n)kG,

where (Z/n)k denotes the set of k-tuples of classes in Z/n, with componentwise addition, for the additive group Z/n (The congruence class [a]n and the quotient set Z/n, For every natural n, (Z/n,+) is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold). Equivalently, G(Z/n)k/H for a subgroup H (The quotient group G/N and coset product (gN)(hN)=ghN, First isomorphism theorem for groups: G/kerfimf).

Facts & Assumptions

Given: A finite abelian group G.

[L1]

For every finite abelian group G there is a unique list 1<n1n2nr with GCn1××Cnr; the trivial group corresponds to the empty list (Fundamental theorem of finite abelian groups: invariant-factor form, Invariant-factor data for a finite abelian group).

[L2]

A cyclic group of finite order m is isomorphic to (Z/m,+) (Every cyclic group is isomorphic to (Z,+) or to (Z/n,+) for its finite order n1).

[L4]

For a homomorphism f:AB, the rule akerff(a) is an isomorphism A/kerfimf (First isomorphism theorem for groups: G/kerfimf, The quotient group G/N and coset product (gN)(hN)=ghN).

Proof

technique · cases
1.1

In the case that the invariant-factor list of [L1] is empty, G is trivial; take n=1 and k=1, so that (Z/1)1 is a one-element group and the unique map to G is a surjective homomorphism.

assume-case trivialL1
1.2

In the case r1, put n:=nr and k:=r. Each ni divides n, the list being a divisibility chain by [L1].

assume-case nontrivialL1
2.1

For each i the rule [a]n[a]ni is a well-defined surjective group homomorphism Z/nZ/ni: if [a]n=[b]n then nab, hence niab because nin, so [a]ni=[b]ni by [L3]; it respects addition by [L3]; and every class [a]ni is the image of [a]n.

step 1.2L3
3.1

Let P:=(Z/n)r and Q:=(Z/n1)××(Z/nr), both with componentwise addition. By [L3] each coordinate (Z/n,+) and (Z/ni,+) is an abelian group, so P and Q are abelian groups under these coordinatewise operations. Define π ⁣:PQ by π([a1]n,,[ar]n):=([a1]n1,,[ar]nr). Step 2.1 gives each coordinate map Z/nZ/ni as a well-defined surjective homomorphism, so π is a well-defined surjective group homomorphism. Fact [L2] identifies each coordinate group (Z/ni,+) with Cni, and [L1] identifies Cn1××Cnr with G up to isomorphism. Composing with that isomorphism gives a surjective homomorphism (Z/n)kG.

step 1.2step 2.1L1L2L3
4.1

The two cases are exhaustive, the invariant-factor list being empty or not, so such n and k exist for every finite abelian G; and [L4] turns any such surjection into an isomorphism G(Z/n)k/H with H its kernel.

step 1.1step 3.1L4cases-exhaustive

Remarks

  • Why the invariant-factor form is convenient. The invariant factors form a divisibility chain, so the single modulus n=nr works immediately. A primary decomposition also proves the statement: take n to be the least common multiple of the finitely many prime-power orders and reduce Z/n onto each cyclic factor. The invariant-factor form simply avoids that extra choice of modulus.

Depends on

Used by

Dependency tree · two levels

38 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