Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The six abelian groups of order 360 in both classification forms

Example

Since 360=23325360=2^3\cdot3^2\cdot5, there are six abelian groups of order 360360. Their elementary-divisor forms are obtained by choosing one of C8C_8, C4×C2C_4\times C_2, C23C_2^3 and one of C9C_9, C32C_3^2, together with C5C_5.

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

[L3]

Let n1n\ge1, and write its canonical prime factorisation as n=i<rpiain=\prod_{i<r}p_i^{a_i}, with the pip_i distinct and ai>0a_i>0. Then the number of isomorphism classes of abelian groups of order nn is i<rP(ai),\prod_{i<r}P(a_i), where P(a)P(a) is the number of partitions of aa. For n=1n=1 one has r=0r=0, so the empty product is 11. (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)(\mathbb{Z},\cdot,1) of lem-units-of-z. Call p:rZp : r \to \mathbb{Z} an injective list of primes when every pip_i is prime (def-prime) and pi=pjp_i = p_j forces i=ji = j (def-injection-surjection-bijection). Let nZn \in \mathbb{Z} with n1n \ge 1 and let p:rZp : r \to \mathbb{Z} be an injective list of primes such that every prime divisor of nn equals pip_i for some i<ri < r. Then, with vqv_q as in def-p-adic-valuation: 1. n  =  i<rpivpi(n)\displaystyle n \;=\; \prod_{i<r} p_i^{\,v_{p_i}(n)}; 2. vq(n)=0v_q(n) = 0 for every prime qq that is not among p0,,pr1p_0,\dots,p_{r-1}; 3. the exponents are determined by nn: if e:rNe : r \to \mathbb{N} and n=i<rpiein = \prod_{i<r} p_i^{\,e_i}, then ej=vpj(n)e_j = v_{p_j}(n) for every j<rj < r. Clause 3 needs only injectivity of the list, not the covering hypothesis. (For n1n \ge 1 and any injective list p:rZp : r \to \mathbb{Z} of primes containing every prime divisor of nn, one has n=i<rpivpi(n)n = \prod_{i<r} p_i^{\,v_{p_i}(n)}; the exponents are determined by nn, and vq(n)=0v_q(n) = 0 for every prime qq outside the list).

Verification

technique · direct
1.1

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

givenL1L2L3L4
2.1

The six elementary forms are (C8,C9,C5)(C_8,C_9,C_5), (C8,C3,C3,C5)(C_8,C_3,C_3,C_5), (C4,C2,C9,C5)(C_4,C_2,C_9,C_5), (C4,C2,C3,C3,C5)(C_4,C_2,C_3,C_3,C_5), (C2,C2,C2,C9,C5)(C_2,C_2,C_2,C_9,C_5), and (C2,C2,C2,C3,C3,C5)(C_2,C_2,C_2,C_3,C_3,C_5).

step 1.1
3.1

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

step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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