Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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-units of Q

Example

Assume the Axiom of Choice. Let S={p1,…,pm} be a finite set of primes, let M={p1e1⋯pmem:e1,…,em∈N} be the multiplicative subset of Z generated by S (the empty product gives 1, so that M={1} when m=0), and let Z[S−1]=M−1Z be the localisation of Z at M. Then, under the canonical embedding of Z[S−1] in Q, Z[S−1]×={±p1n1⋯pmnm:n1,…,nm∈Z}≅{±1}×Zm, the group law on the right being addition of the exponent vector. This agrees with the S-unit theorem for K=Q: applied to the finite set SQ={(p1),…,(pm)} of nonzero prime ideals of OQ=Z it gives OQ,SQ×≅μ(Q)×Zm, of rank r1+r2−1+∣SQ∣=1+0−1+m=m.

Facts & Assumptions

Given: The Axiom of Choice, a finite set S={p1,…,pm} of primes (Prime and composite integers: p is prime when p>1 and its only positive divisors are 1 and p), the multiplicative subset M⊆Z generated by S, and the localisation R:=Z[S−1]=M−1Z (Multiplicative subsets and the localisation S−1R as equivalence classes of fractions).

[F1]

M is multiplicative and its elements are exactly the products p1e1⋯pmem with all ei∈N, including the empty product 1. Elements of R are classes a/b with a∈Z, b∈M, with a/b+a′/b′=(ab′+a′b)/(bb′) and (a/b)(a′/b′)=(aa′)/(bb′); two classes are equal, a/b=a′/b′, exactly when u(ab′−a′b)=0 for some u∈M; the localisation map a↦a/1 is a ring homomorphism, and every s∈M maps to a unit, (s/1)−1=1/s (Multiplicative subsets and the localisation S−1R as equivalence classes of fractions).

[F2]

A product of two nonzero integers is nonzero, so ut=0 with u,t∈Z and u≠0 forces t=0; since 0∉M, the equality criterion of [F1] reduces to ab′=a′b (The integers have no zero divisors; multiplicative cancellation).

[F5]

For every prime q the principal ideal (q)=qZ is a nonzero prime ideal of Z, indeed a maximal one: Z/(q) is a field (For every prime p, the two operations on Z/p make it a field) and a quotient ring is a field exactly when the ideal is maximal (R/M is a field if and only if M is a maximal ideal), while a maximal ideal is prime (Every maximal ideal of a commutative ring is prime); the ideal is nonzero because q≠0 and proper because q>1. Distinct primes give distinct ideals, since q∈(q′) forces q′=q. The localisation Z(q) of Z at the prime ideal (q) consists of the fractions m/n with q∤n, and every element of Z outside (q) becomes a unit there (Localisation at a prime ideal: Rp=(R∖p)−1R, Multiplicative subsets and the localisation S−1R as equivalence classes of fractions). Moreover, assuming the Axiom of Choice, Z=OQ is a Dedekind domain (Rings of integers are Dedekind domains), each localisation Zp at a nonzero prime is a discrete valuation ring (Localizing a Dedekind domain at a nonzero prime gives a DVR), and every nonzero fractional ideal I carries prime-ideal valuations defined by Ip=pvp(I)Zp (Fractional ideals, Prime-ideal valuations on fractional ideals); the nonzero ideals of the discrete valuation ring Zp are the powers pnZp with n≥0 (Ideals in a DVR are powers of the maximal ideal), and for a nonzero rational the principal fractional ideal (x)=xZ localises to (x)p=xZp (Localisation of a module at a multiplicative subset).

[F6]

For a number field K (Number field) and a finite set S of nonzero prime ideals of OK, OK,S={0}∪{x∈K×:vp(x)≥0 for every nonzero prime p∉S} consists of zero and the nonzero elements whose principal fractional ideal involves no prime outside S in a denominator, and OK,S×={x∈K×:vp(x)=0 for every nonzero prime p∉S}; no infinite place belongs to S, and the rank formula is r1+r2−1+∣S∣ (S-integers and S-units of a number field).

[F7]

Assume the Axiom of Choice. For a number field K of signature (r1,r2) and a finite set S of nonzero prime ideals, OK,S×≅μ(K)×Zr1+r2−1+∣S∣ (S-unit theorem).

[F8]

OQ=Z: the ring of integers OQ is the integral closure of Z in Q (Ring of integers), a rational number integral over Z is an integer (The rational algebraic integers are exactly the integers), and every integer n is a root of the monic polynomial X−n. Also Q has a single archimedean place, which is real, so its signature is (1,0) (Archimedean embeddings and signature).

[F9]

For a field K and n≥1, μn(K)={x∈K:xn=1} and μ(K) is the group of all roots of unity in K, the union of the μn(K) (The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity).

[A1]

The Axiom of Choice is assumed. It is used through the S-unit theorem [F7] and through the Dedekind structure of Z quoted in [F5], where the ring-of-integers corollary is itself AC-qualified; the localisation, exponent and sign computations of the verification use no choice (The Axiom of Choice).

Verification

technique · identify the localisation with a subring of $\mathbb Q$, express membership in it and in its unit group through the exponents of the prime factorisation of a rational, and then compare the resulting monomial group with the $S$-unit theorem applied to $K=\mathbb Q$
1.1F1F2algebra

The localisation R embeds in Q by φ(a/b)=a/b: the map is well defined because if a/b=a′/b′ in R, then u(ab′−a′b)=0 for some u∈M by [F1] and hence ab′=a′b by [F2], so the two rationals agree; it respects the fraction arithmetic of [F1], which is the arithmetic of the field Q; and it is injective, since φ(a/b)=0 forces a=0, and then 1⋅(a⋅1−0⋅b)=0 gives a/b=0/1 by [F1]. Hence R is identified with the subring {a/b∈Q:a∈Z, b∈M} of Q, in which 1/s is the inverse of s for every s∈M.

1.2F3algebra

Fix x∈Q× and write its prime factorisation as x=±∏q primeqeq(x),eq(x)∈Z, with all but finitely many exponents zero; existence and uniqueness of the triple (sign, exponent vector) is [F3], applied to the numerator and denominator of x in lowest terms. Writing x=a/b in lowest terms with b>0 and fixing a prime q, one has eq(x)=vq(a)−vq(b); if q∤b this is the nonnegative integer vq(a), while if q∣b then vq(b)>0 and vq(a)=0 by coprimality, so eq(x)<0. Thus eq(x)≥0 if and only if q∤b.

1.3F5algebra

For a prime q, the localisation Z(q) consists of the fractions m/n with q∤n by [F5], so for x=a/b∈Q× in lowest terms with b>0 one has x∈Z(q) if and only if q∤b: if q∤b then x=a/b has the required form, while if x=a/b=m/n with q∤n, then an=bm, and q∣b would give q∣an and hence q∣a, contradicting coprimality.

1.4F5algebra

For a nonzero prime ideal p of Z and x∈Q×, [F5] writes vp(x)=vp((x)) as the unique integer n with xZp=(x)p=pnZp. The powers pnZp with n≥0 are exactly the ideals of the discrete valuation ring Zp, and for n<0 the fractional ideal pnZp properly contains Zp; hence vp(x)≥0 if and only if xZp⊆Zp, that is, if and only if x∈Zp.

2.1F1F3F5step 1.1step 1.2algebra

An element x∈Q× lies in R if and only if eq(x)≥0 for every prime q∉S. If x=a/b with a∈Z and b∈M, then b has no prime divisor outside S, so for q∉S one has eq(x)=vq(a)−vq(b)=vq(a)−0≥0, where the exponents are those of the factorisations of a and b; conversely, if eq(x)≥0 for all q∉S and x=a/b is in lowest terms with b>0, then a prime q∣b satisfies vq(a)=0 and vq(x)=−vq(b)<0, so q∈S; hence every prime divisor of b lies in S, that is b∈M, and x=a/b∈R.

2.2F3F4F8F9step 1.2algebra

For the comparison with the S-unit theorem, evaluate its torsion factor and its signature input. Q is a number field with signature (1,0) and OQ=Z by [F8]; the roots of unity in Q are ±1, since x=a/b∈Q× in lowest terms with xn=1 gives an=bn, whence ∣a∣n=∣b∣n and, by uniqueness of prime factorisation, ∣a∣=∣b∣, while coprimality forces ∣a∣=∣b∣=1; conversely ±1 are roots of unity. Thus μ(Q)={±1} by [F9].

2.3F5F6F8step 1.3step 1.4

The same group is obtained from the S-unit theorem. By [F5] the ideals (p1),…,(pm) are nonzero prime ideals of OQ=Z by [F8], so SQ:={(p1),…,(pm)} is a finite set of nonzero prime ideals. The two rings agree on Q×, and both contain 0. Indeed, let 0≠x=a/b∈R with a∈Z and b∈M, and let p∉SQ be a nonzero prime ideal: then b∉p, because otherwise some prime pi with pi∣b lies in p, so (pi)⊆p, and maximality of (pi) with p proper forces p=(pi)∈SQ, a contradiction. Hence b/1 is a unit of Zp and x=(a/1)(b/1)−1∈Zp, so vp(x)≥0 by step 1.4 and x∈OQ,SQ. Conversely, let 0≠x=a/b∈OQ,SQ be in lowest terms with b>0, and suppose a prime q∉S divides b; then (q) is a nonzero prime ideal of Z and (q)∉SQ by the distinctness in [F5], so v(q)(x)≥0 and step 1.4 gives x∈Z(q), contradicting step 1.3. Therefore every prime divisor of b lies in S, that is b∈M and x=a/b∈R. Thus OQ,SQ=R as subrings of Q, and their unit groups inside Q coincide: OQ,SQ×=R×.

3.1F1step 2.1algebra

Consequently an element x∈Q× is a unit of R if and only if eq(x)=0 for every prime q∉S: a unit of R lies in R together with its inverse, so step 2.1 gives eq(x)≥0 and eq(x−1)=−eq(x)≥0 for q∉S, and conversely the two inequalities eq(x)≥0, −eq(x)≥0 for q∉S place both x and x−1 in R.

4.1F3step 3.1algebra

Therefore R×={x∈Q×:eq(x)=0 for all q∉S}={±p1n1⋯pmnm:ni∈Z}: for the first description, an element with vanishing exponents outside S has prime factorisation involving only primes of S and a sign, and conversely a monomial ±p1n1⋯pmnm has all exponents outside S equal to zero; the sign and the exponents in such an expression are unique by the uniqueness clause of [F3].

5.1F3step 4.1algebra

The assignment (ε,n1,…,nm)↦εp1n1⋯pmnm is an isomorphism {±1}×Zm→R×: it is a group homomorphism because the exponents add, it is surjective by step 4.1, and it is injective because εp1n1⋯pmnm=1 forces ε=1 and n1=⋯=nm=0 by the uniqueness of the factorisation of the positive integer obtained after moving negative exponents to the other side.

6.1F7step 5.1step 2.3step 2.2

By the S-unit theorem [F7] applied to K=Q and SQ, OQ,SQ×≅μ(Q)×Zr1+r2−1+∣SQ∣={±1}×Z1+0−1+m={±1}×Zm, of rank m. Combined with step 2.3 this agrees with the explicit computation of steps 4.1 and 5.1, and the m generators are the classes of p1,…,pm.

7.1A1F5F7step 1.1step 5.1∎

Scope and boundary cases: for m=0 the set M={1} and R=Z, and the computation returns Z×={±1}≅{±1}×Z0 by [F4], while SQ=∅ has rank 0; for m≥1 the exponents ni range over Z and negative exponents are allowed, the generators being units because pi/1∈M has inverse 1/pi in R. Choice enters through the S-unit theorem [F7] and through the AC-qualified Dedekind interface of [F5]; the identification of R with a subring of Q, the exponent bookkeeping and the enumeration of signs use no choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

112 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