Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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.

A nontrivial finite abelian group is cyclic if and only if it has one invariant factor

Statement

A nontrivial finite abelian group is cyclic if and only if its invariant-factor list has exactly one entry.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

For every finite abelian group GG there is a unique list 1<n1nr1<n_1\mid\cdots\mid n_r such that GCn1××CnrG\cong C_{n_1}\times\cdots\times C_{n_r}. Moreover G=n1nr|G|=n_1\cdots n_r. The trivial group corresponds to the empty list and empty product. (Fundamental theorem of finite abelian groups: invariant-factor form).

[L2]

If GCn1××CnrG\cong C_{n_1}\times\cdots\times C_{n_r} with 1<n1nr1<n_1\mid\cdots\mid n_r, then G=n1nr|G|=n_1\cdots n_r and exp(G)=nr\exp(G)=n_r. For the empty list, G=exp(G)=1|G|=\exp(G)=1. (Invariant factors determine the order and exponent of a finite abelian group).

[L3]

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 · direct
1.1

A one-entry invariant-factor decomposition is an isomorphism with one cyclic group, so GG is cyclic.

givenL1L2L3
2.1

Conversely a nontrivial finite cyclic group is isomorphic to CGC_{|G|}, giving the one-entry list; uniqueness of invariant factors rules out any different list.

step 1.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 65 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