Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

S-unit theorem

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let K be a number field of signature (r1,r2) and let S be a finite set of nonzero prime ideals of OK. Then OK,S×≅μ(K)×Zr1+r2−1+∣S∣; in particular the S-unit group is finitely generated of rank r1+r2−1+∣S∣ with torsion subgroup μ(K).

Facts & Assumptions

Given: The Axiom of Choice, a number field K of signature (r1,r2), and a finite set S of nonzero prime ideals of OK with G:=OK,S× (S-integers and S-units of a number field).

[F1]

G={x∈K×:vp(x)=0 for every nonzero prime p∉S}, where vp(x):=vp((x)) for the principal fractional ideal (x); every vp(x) is an integer (S-integers and S-units of a number field, Prime-ideal valuations on fractional ideals).

[F2]

The unit group satisfies OK×≅μ(K)×Zr1+r2−1, is finitely generated of rank r1+r2−1, and has torsion subgroup μ(K) (Dirichlet unit theorem).

[F3]

The ideal class group Cl⁡(OK) is finite of order h≥1, and the class of a nonzero fractional ideal is its image under cl⁡ (Finiteness of the number-field class group, The ideal class group, The ideal class group quotient is well defined).

[F4]

The principal-divisor sequence 0→OK×→K×→div⁡Div⁡(OK)→cl⁡Cl⁡(OK)→0 is exact, where div⁡(x)=∑pvp((x))[p]; thus ker⁡div⁡=OK× and the principal divisors are exactly the kernel of cl⁡ (The principal-divisor exact sequence for a Dedekind domain).

[F5]

Every nonzero fractional ideal has the unique factorisation I=∏ppvp(I), and vp(IJ)=vp(I)+vp(J) (Unique factorization of nonzero fractional ideals into prime powers, Prime-ideal valuations of a fractional ideal have finite support and add under products); in particular vp(p)=1 and vq(p)=0 for q≠p.

[F6]

Every subgroup of Zn is free of rank at most n, and a finitely generated abelian group has an intrinsic free rank and finite torsion subgroup (Integer abelian structure and rank by finite reduction).

[F7]

An element of K× of finite order is a root of unity, and every root of unity in K lies in OK×; thus μ(K) is exactly the torsion subgroup of OK× and is finite (The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity, Dirichlet unit theorem).

[F8]

If G is a finite group of order h, then gh=1 for every g∈G (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

Proof

technique · measure an $S$-unit by its valuations at the primes in $S$. The kernel of that map is the ordinary unit group, and the image has finite index in $\mathbb Z^S$ because taking $h$-th powers of the prime ideals turns them principal; the image is therefore free of rank $|S|$, so the surjection onto it splits and exposes $G$ as $\mu(K)$ times a free abelian group of rank $r_1+r_2-1+|S|$
1.1F1F5

Define φ:G→ZS by φ(u)=(vp(u))p∈S; it is a group homomorphism because vp(xy)=vp(x)+vp(y) for all nonzero fractional ideals.

1.2F1F4

The kernel of φ is OK×: a unit u∈G has φ(u)=0 exactly when vp(u)=0 for every p∈S, and by definition vp(u)=0 for every p∉S, so φ(u)=0 exactly when div⁡(u)=0, that is u∈ker⁡div⁡=OK×.

1.3F3F4F8

Put h:=∣Cl⁡(OK)∣≥1, a finite number; for p∈S let [p] be its class, so [p]h=1 by [F8], and hence the divisor h[p] lies in the kernel of cl⁡, i.e. is principal: there is πp∈K× with (πp)=ph; since ph is an integral ideal, πp∈OK∖{0}.

2.1F5step 1.3

For p,q∈S one has vq(πp)=vq(ph)=h vq(p)=hδpq, using additivity of valuations and vq(p)=1 for q=p and 0 otherwise.

3.1step 1.1step 2.1

Consequently hZS⊆φ(G), because φ(πp)=h ep for each p∈S and the elements h ep generate hZS.

4.1F6step 3.1

The image M:=φ(G) is a subgroup of ZS, hence free of rank s≤∣S∣; since hZS is a subgroup of M isomorphic to Z∣S∣, the same rank bound gives ∣S∣≤s, so s=∣S∣ and M≅Z∣S∣; also M has finite index in ZS, because it contains hZS.

5.1step 1.2step 4.1

Since M is free abelian, the surjection φ:G↠M splits: choose a Z-basis m1,…,m∣S∣ of M and preimages u1,…,u∣S∣∈G with φ(ui)=mi, and define the homomorphism σ:M→G by σ(mi)=ui; then φ∘σ=idM, and every g∈G is written as g=σ(φ(g))⋅(g σ(φ(g))−1) with g σ(φ(g))−1∈ker⁡φ and σ(φ(g))∈im⁡σ, while ker⁡φ∩im⁡σ={1} because φ(σ(m))=m; hence G≅ker⁡φ×M.

6.1F2step 5.1

By [F2] and step 5.1, G≅(μ(K)×Zr1+r2−1)×Z∣S∣≅μ(K)×Zr1+r2−1+∣S∣, so G is finitely generated, its free rank is r1+r2−1+∣S∣, and the torsion subgroup of G is the torsion subgroup of μ(K)×Zr1+r2−1+∣S∣, namely μ(K).

7.1F2F7step 6.1

Directly: if g∈G⊆K× has finite order then g is a root of unity and so lies in μ(K); conversely every root of unity lies in μ(K)⊆OK×⊆G; hence the torsion subgroup of G is μ(K), finite, in agreement with step 6.1.

8.1F2F3F4F5step 1.3step 5.1∎

Choice accounting: the unit theorem [F2], class-group finiteness input [F3], principal-divisor exact sequence [F4], and ideal-factorisation and valuation inputs [F5] assume AC. The selections performed here are finitely many (the elements πp for p∈S and the lifts ui of a basis of M), so these selections need only finite choice; the splitting is noncanonical because it depends on those lifts.

Depends on

Used by

Dependency tree · two levels

64 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