Alphabeta Math
CorollaryStatement: Literature-sourcedProof: 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.

Every abelian group of order n is cyclic if and only if n is squarefree

Statement

For a positive integer nn, every abelian group of order nn is cyclic if and only if nn is squarefree.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

A positive integer nn is squarefree if no square of a prime divides nn. Equivalently, every exponent in its canonical prime factorisation is 00 or 11. The integer 11 is squarefree by the empty factorisation. (Squarefree positive integers).

[L2]

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

[L3]

If GG is finite abelian and G=i<rpiai|G|=\prod_{i<r}p_i^{a_i} is its prime factorisation, then the subgroups G(pi)G(p_i) form an internal direct product of GG. Thus Gi<rG(pi).G\cong\prod_{i<r}G(p_i). For the trivial group, this is the empty product. (A finite abelian group is the internal direct product of its primary components).

[L4]

Let n0,,nr1n_0,\ldots,n_{r-1} be a finite pairwise-coprime list of positive integers and let N:=i<rniN:=\prod_{i<r}n_i. The map Φ:Z/Ni<rZ/ni,[x]N([x]ni)i<r,\Phi:\mathbb Z/N\longrightarrow\prod_{i<r}\mathbb Z/n_i,\qquad[x]_N\longmapsto([x]_{n_i})_{i<r}, is a bijection. It preserves addition, multiplication, [0][0], and [1][1] componentwise. For the empty list, N=1N=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).

[L5]

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

If nn is squarefree, each primary component of an abelian group of order nn has prime order and is cyclic. The Chinese remainder theorem combines the cyclic factors of pairwise coprime orders into a cyclic group of order nn.

givenL1L2L3L4L5
2.1

If p2np^2\mid n, write n=pamn=p^a m with a2a\ge2 and (p,m)=1(p,m)=1. The abelian group Cp×Cp×Cpa2×CmC_p\times C_p\times C_{p^{a-2}}\times C_m, omitting trivial factors, has order nn but exponent strictly below nn, so it is not cyclic.

step 1.1
3.1

For n=1n=1 the sole group is trivial and cyclic, agreeing with squarefreeness of 11.

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: 118 results over 24 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