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 six abelian groups of order 360 in both classification forms

Example

Since 360=23⋅32⋅5, there are six abelian groups of order 360. Their elementary-divisor forms are obtained by choosing one of C8, C4×C2, C23 and one of C9, C32, together with C5.

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 n≥1, and write its canonical prime factorisation as n=∏i<rpiai, with the pi distinct and ai>0. Then the number of isomorphism classes of abelian groups of order n is ∏i<rP(ai), where P(a) is the number of partitions of a. For n=1 one has r=0, so the empty product is 1. (The number of finite abelian groups of order n is the product of the partition numbers of the prime exponents of n).

[L4]

Powers are the natural powers of def-group-power and finite products those of def-monoid-finite-product, both taken in the commutative monoid (Z,⋅,1) of lem-units-of-z. Call p:r→Z an injective list of primes when every pi is prime (def-prime) and pi=pj forces i=j (def-injection-surjection-bijection). Let n∈Z with n≥1 and let p:r→Z be an injective list of primes such that every prime divisor of n equals pi for some i<r. Then, with vq as in def-p-adic-valuation: 1. n  =  ∏i<rpi vpi(n); 2. vq(n)=0 for every prime q that is not among p0,…,pr−1; 3. the exponents are determined by n: if e:r→N and n=∏i<rpi ei, then ej=vpj(n) for every j<r. Clause 3 needs only injectivity of the list, not the covering hypothesis. (For n≥1 and any injective list p:r→Z of primes containing every prime divisor of n, one has n=∏i<rpi vpi(n); the exponents are determined by n, and vq(n)=0 for every prime q outside the list).

Verification

technique · direct
1.1

The prime exponents are 3,2,1, whose partition counts are 3,2,1; their product is 6.

givenL1L2L3L4
2.1

The six elementary forms are (C8,C9,C5), (C8,C3,C3,C5), (C4,C2,C9,C5), (C4,C2,C3,C3,C5), (C2,C2,C2,C9,C5), and (C2,C2,C2,C3,C3,C5).

step 1.1
3.1

Columnwise regrouping gives invariant-factor lists (360), (3,120), (2,180), (6,60), (2,2,90), and (2,6,30), respectively.

step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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