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.

Invariant factors determine the order and exponent of a finite abelian group

Statement

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.

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]

For a finite group GG, its exponent is exp(G)=min{nN:n>0 and gn=e for every gG}.\exp(G)=\min\{n\in\mathbb N:n>0\text{ and }g^n=e\text{ for every }g\in G\}. The set is nonempty by cor-g-to-the-group-order-is-identity, and thm-well-ordering-principle gives its least member; powers use def-group-power. Thus the definition is well-defined. For the trivial group exp(G)=1\exp(G)=1. (The exponent of a finite group).

[L3]

If GG and HH are finite groups, then their external direct product is finite and has order G×H=GH|G\times H|=|G|\,|H|. (For finite groups GG and HH, G×H=GH|G\times H|=|G|\,|H|).

[L4]

Let ι:NZ\iota:\mathbb N\to\mathbb Z be the canonical embedding. If gGg\in G and hHh\in H have finite orders m,n1m,n\ge1, then in the external direct product ord(g,h)=lcm(m,n).\operatorname{ord}(g,h)=\operatorname{lcm}(m,n). (If gg and hh have finite orders mm and nn, then ι(ord(g,h))=lcm(ι(m),ι(n))\iota(\operatorname{ord}(g,h))=\operatorname{lcm}(\iota(m),\iota(n)) in G×HG\times H).

Proof

technique · direct
1.1

The finite-product order formula gives G=ini|G|=\prod_i n_i, including the empty product.

givenL1L2L3L4
2.1

The order of an element of the product is the least common multiple of its component orders. Because ninrn_i\mid n_r, every element order divides nrn_r, while an element generating the last factor has order nrn_r.

step 1.1
3.1

The least common annihilating exponent is therefore nrn_r when the list is nonempty, and is 11 for the trivial group.

step 2.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 76 results over 20 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