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 be a finite set of primes, let be the multiplicative subset of generated by (the empty product gives , so that when ), and let be the localisation of at . Then, under the canonical embedding of in , the group law on the right being addition of the exponent vector. This agrees with the -unit theorem for : applied to the finite set of nonzero prime ideals of it gives , of rank .
Facts & Assumptions
Given: The Axiom of Choice, a finite set of primes (Prime and composite integers: is prime when and its only positive divisors are and ), the multiplicative subset generated by , and the localisation (Multiplicative subsets and the localisation as equivalence classes of fractions).
is multiplicative and its elements are exactly the products with all , including the empty product . Elements of are classes with , , with and ; two classes are equal, , exactly when for some ; the localisation map is a ring homomorphism, and every maps to a unit, (Multiplicative subsets and the localisation as equivalence classes of fractions).
A product of two nonzero integers is nonzero, so with and forces ; since , the equality criterion of [F1] reduces to (The integers have no zero divisors; multiplicative cancellation).
Every positive integer is a finite product of primes, and the factorisation is unique up to order; a prime is an integer whose only positive divisors are and (The fundamental theorem of arithmetic: every integer is a product of primes, and the factorisation is unique up to order — if with every and prime, then and for some , Prime and composite integers: is prime when and its only positive divisors are and ).
The units of are exactly and ( is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
For every prime the principal ideal is a nonzero prime ideal of , indeed a maximal one: is a field (For every prime , the two operations on make it a field) and a quotient ring is a field exactly when the ideal is maximal ( is a field if and only if is a maximal ideal), while a maximal ideal is prime (Every maximal ideal of a commutative ring is prime); the ideal is nonzero because and proper because . Distinct primes give distinct ideals, since forces . The localisation of at the prime ideal consists of the fractions with , and every element of outside becomes a unit there (Localisation at a prime ideal: , Multiplicative subsets and the localisation as equivalence classes of fractions). Moreover, assuming the Axiom of Choice, is a Dedekind domain (Rings of integers are Dedekind domains), each localisation 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 carries prime-ideal valuations defined by (Fractional ideals, Prime-ideal valuations on fractional ideals); the nonzero ideals of the discrete valuation ring are the powers with (Ideals in a DVR are powers of the maximal ideal), and for a nonzero rational the principal fractional ideal localises to (Localisation of a module at a multiplicative subset).
For a number field (Number field) and a finite set of nonzero prime ideals of , consists of zero and the nonzero elements whose principal fractional ideal involves no prime outside in a denominator, and for every nonzero prime ; no infinite place belongs to , and the rank formula is (S-integers and S-units of a number field).
Assume the Axiom of Choice. For a number field of signature and a finite set of nonzero prime ideals, (S-unit theorem).
: the ring of integers is the integral closure of in (Ring of integers), a rational number integral over is an integer (The rational algebraic integers are exactly the integers), and every integer is a root of the monic polynomial . Also has a single archimedean place, which is real, so its signature is (Archimedean embeddings and signature).
For a field and , and is the group of all roots of unity in , the union of the (The group of -th roots of unity in a field, and primitive -th roots of unity).
The Axiom of Choice is assumed. It is used through the -unit theorem [F7] and through the Dedekind structure of 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
The localisation embeds in by : the map is well defined because if in , then for some by [F1] and hence by [F2], so the two rationals agree; it respects the fraction arithmetic of [F1], which is the arithmetic of the field ; and it is injective, since forces , and then gives by [F1]. Hence is identified with the subring of , in which is the inverse of for every .
Fix and write its prime factorisation as 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 in lowest terms. Writing in lowest terms with and fixing a prime , one has ; if this is the nonnegative integer , while if then and by coprimality, so . Thus if and only if .
For a prime , the localisation consists of the fractions with by [F5], so for in lowest terms with one has if and only if : if then has the required form, while if with , then , and would give and hence , contradicting coprimality.
For a nonzero prime ideal of and , [F5] writes as the unique integer with . The powers with are exactly the ideals of the discrete valuation ring , and for the fractional ideal properly contains ; hence if and only if , that is, if and only if .
An element lies in if and only if for every prime . If with and , then has no prime divisor outside , so for one has , where the exponents are those of the factorisations of and ; conversely, if for all and is in lowest terms with , then a prime satisfies and , so ; hence every prime divisor of lies in , that is , and .
For the comparison with the -unit theorem, evaluate its torsion factor and its signature input. is a number field with signature and by [F8]; the roots of unity in are , since in lowest terms with gives , whence and, by uniqueness of prime factorisation, , while coprimality forces ; conversely are roots of unity. Thus by [F9].
The same group is obtained from the -unit theorem. By [F5] the ideals are nonzero prime ideals of by [F8], so is a finite set of nonzero prime ideals. The two rings agree on , and both contain . Indeed, let with and , and let be a nonzero prime ideal: then , because otherwise some prime with lies in , so , and maximality of with proper forces , a contradiction. Hence is a unit of and , so by step 1.4 and . Conversely, let be in lowest terms with , and suppose a prime divides ; then is a nonzero prime ideal of and by the distinctness in [F5], so and step 1.4 gives , contradicting step 1.3. Therefore every prime divisor of lies in , that is and . Thus as subrings of , and their unit groups inside coincide: .
Consequently an element is a unit of if and only if for every prime : a unit of lies in together with its inverse, so step 2.1 gives and for , and conversely the two inequalities , for place both and in .
Therefore for all : for the first description, an element with vanishing exponents outside has prime factorisation involving only primes of and a sign, and conversely a monomial has all exponents outside equal to zero; the sign and the exponents in such an expression are unique by the uniqueness clause of [F3].
The assignment is an isomorphism : it is a group homomorphism because the exponents add, it is surjective by step 4.1, and it is injective because forces and by the uniqueness of the factorisation of the positive integer obtained after moving negative exponents to the other side.
By the -unit theorem [F7] applied to and , of rank . Combined with step 2.3 this agrees with the explicit computation of steps 4.1 and 5.1, and the generators are the classes of .
Scope and boundary cases: for the set and , and the computation returns by [F4], while has rank ; for the exponents range over and negative exponents are allowed, the generators being units because has inverse in . Choice enters through the -unit theorem [F7] and through the AC-qualified Dedekind interface of [F5]; the identification of with a subring of , the exponent bookkeeping and the enumeration of signs use no choice.
Depends on
- Archimedean embeddings and signature
- The Axiom of Choice
- Multiplicative subsets and the localisation $S^{-1}R$ as equivalence classes of fractions
- Number field
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
- Prime-ideal valuations on fractional ideals
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- S-integers and S-units of a number field
- Every maximal ideal of a commutative ring is prime
- The rational algebraic integers are exactly the integers
- Rings of integers are Dedekind domains
- Fractional ideals
- Localisation at a prime ideal: $R_{\mathfrak p}=(R\setminus\mathfrak p)^{-1}R$
- Localisation of a module at a multiplicative subset
- Ring of integers
- Localizing a Dedekind domain at a nonzero prime gives a DVR
- Ideals in a DVR are powers of the maximal ideal
- $R/M$ is a field if and only if $M$ is a maximal ideal
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- The integers have no zero divisors; multiplicative cancellation
- $(\mathbb{Z}, \cdot, 1)$ is a commutative monoid whose group of units is $\{1, -1\}$; equivalently $u \mid 1$ holds exactly for $u = 1$ and $u = -1$
- The fundamental theorem of arithmetic: every integer $n \ge 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i<r} p_i = \prod_{j<s} q_j$ with every $p_i$ and $q_j$ prime, then $r = s$ and $q_i = p_{\pi(i)}$ for some $\pi \in \operatorname{Sym}(r)$
- S-unit theorem
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
- J. S. Milne, Algebraic Number Theory v3.08 (standard reference, not scraped)
- Jurgen Neukirch, Algebraic Number Theory (Springer, 1999) (standard reference, not scraped)