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

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

Statement

If G≅Cn1×⋯×Cnr with 1<n1∣⋯∣nr, then ∣G∣=n1⋯nr and exp⁡(G)=nr. For the empty list, ∣G∣=exp⁡(G)=1.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

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. (Fundamental theorem of finite abelian groups: invariant-factor form).

[L2]

For a finite group G, its exponent is exp⁡(G)=min⁡{n∈N:n>0 and gn=e for every g∈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. (The exponent of a finite group).

[L3]

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

[L4]

Let ι:N→Z be the canonical embedding. If g∈G and h∈H have finite orders m,n≥1, then in the external direct product ord⁡(g,h)=lcm⁡(m,n). (If g and h have finite orders m and n, then ι(ord⁡(g,h))=lcm⁡(ι(m),ι(n)) in G×H).

Proof

technique · direct
1.1

The finite-product order formula gives ∣G∣=∏ini, 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 ni∣nr, every element order divides nr, while an element generating the last factor has order nr.

step 1.1
3.1

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

step 2.1∎

Depends on

Used by

Dependency tree · two levels

18 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