Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 cyclic group of order six in elementary-divisor and invariant-factor forms

Example

The Chinese remainder isomorphism gives C6≅C2×C3. Thus the elementary divisors are 2 and 3, while the invariant-factor list is the single entry 6.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

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

[L2]

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

[L3]

Let n0,…,nr−1 be a finite pairwise-coprime list of positive integers and let N:=∏i<rni. The map Φ:Z/N⟶∏i<rZ/ni,[x]N⟼([x]ni)i<r, is a bijection. It preserves addition, multiplication, [0], and [1] componentwise. For the empty list, N=1 and both sides have one element. (Chinese remainder theorem for a finite pairwise-coprime list: simultaneous residues determine one class modulo the product, and the resulting bijection preserves addition and multiplication).

[L4]

For every n∈N, view n as its canonical nonnegative integer and put nZ:={nk:k∈Z}. Then the left cosets of nZ in (Z,+) are exactly the congruence classes modulo n, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+) as the same group on the same underlying set. This includes n=0 and n=1. (For every n∈N, the congruence-class group (Z/n,+) is the quotient group (Z,+)/nZ).

Verification

technique · direct
1.1

The residue map [x]6↦([x]2,[x]3) is an isomorphism by the Chinese remainder theorem.

givenL1L2L3L4
2.1

The factors C2,C3 have prime-power orders, so {2,3} is the elementary-divisor multiset; regrouping the coprime factors gives the invariant factor 6.

step 1.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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