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

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

Statement

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

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

A positive integer n is squarefree if no square of a prime divides n. Equivalently, every exponent in its canonical prime factorisation is 0 or 1. The integer 1 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 G is finite abelian and ∣G∣=∏i<rpiai is its prime factorisation, then the subgroups G(pi) form an internal direct product of G. Thus G≅∏i<rG(pi). 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,…,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).

[L5]

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

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

givenL1L2L3L4L5
2.1

If p2∣n, write n=pam with a≥2 and (p,m)=1. The abelian group Cp×Cp×Cpa−2×Cm, omitting trivial factors, has order n but exponent strictly below n, so it is not cyclic.

step 1.1
3.1

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

step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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