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

The indecomposable finite abelian groups are exactly the nontrivial cyclic groups of prime-power order

Statement

The indecomposable finite abelian groups are exactly the nontrivial cyclic groups of prime-power order.

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]

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).

[L3]

Let G be a finite abelian group and let p be a prime dividing ∣G∣. Then G contains an element, and hence a subgroup, of order p. (Cauchy's theorem for finite abelian groups).

[L4]

Every subgroup H of a cyclic group G=⟨g⟩ is cyclic. If H≠{e}, then the least positive integer d for which gd∈H satisfies H=⟨gd⟩. (Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator).

[L5]

Let G be a finite group such that the positive integer ∣G∣ is prime. Then every g≠e has order ∣G∣, satisfies ⟨g⟩=G, and hence generates G. In particular, G is cyclic. (A finite group of prime order is cyclic and every nonidentity element generates it).

Proof

technique · direct
1.1

The elementary-divisor theorem writes any nontrivial finite abelian group as a product of nontrivial cyclic prime-power factors. Indecomposability forces exactly one factor.

givenL1L2L3L4L5
2.1

Conversely, if Cpa=B⊕C with both factors nontrivial, Cauchy's theorem gives an order-p subgroup in each factor. Their images are distinct, but a cyclic group has a unique subgroup of each possible order. Hence no such decomposition exists.

step 1.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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