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.
Equality, vanishing, and the kernel of the localisation map
Statement
Let be a commutative ring and multiplicative. For and , and Consequently The map is injective if and only if every has trivial annihilator. If is nonzero, this is equivalent to and no member of being a zero divisor. Moreover, is the zero ring if and only if .
Facts & Assumptions
Given: A commutative ring , a multiplicative subset , and its localisation map .
Fractions are precisely equivalence classes for the relation for some , and (The localisation relation is an equivalence relation and fraction arithmetic is well defined).
In a nonzero commutative ring, a zero divisor is a nonzero element annihilating some nonzero element; by convention, itself is not called a zero divisor (Zero divisor, and integral domain: a commutative ring with and no zero divisors).
Proof
The equality criterion is the definition of equality of equivalence classes. Taking gives exactly when for some .
If , step 1.1 makes every fraction zero by using . Conversely, if is the zero ring, then , so step 1.1 gives with , whence and .
Since , step 1.1 gives the displayed kernel. Thus is injective exactly when with always forces , which says precisely that every member of has trivial annihilator.
Assume is nonzero. If every member of has trivial annihilator, then , because and , and no is a zero divisor by [F2]. Conversely, if and contains no zero divisor, then is nonzero and forces by [F2].
Depends on
Used by
- If 0∈ S, localisation collapses: S⁻¹R is the zero ring Counterexample
- Localising at a zero divisor need not be injective: inverting 3 in ℤ/6 kills 2 Counterexample
- F[x]₍ₓ₎ is the ring of rational functions defined at 0, with maximal ideal generated by x and residue field F Example
- ℤ₍ₚ₎ consists of rationals with denominator not divisible by p, has maximal ideal pℤ₍ₚ₎, and residue field Fₚ Example
- ℤ[1/6] consists exactly of rationals a/6ⁿ and inverts precisely the primes 2 and 3 Example
- A fraction r/s is a unit in S⁻¹R exactly when ar∈ S for some a∈ R Proposition
- Frac(D) is a field and d↦ d/1 embeds the integral domain D Theorem
- Ideals of S⁻¹R correspond to S-saturated ideals of R, and prime ideals correspond to primes disjoint from S Theorem
- R_mathfrak p is local with unique maximal ideal mathfrak pR_mathfrak p Theorem
- Universal property of localisation: maps that invert S factor uniquely through S⁻¹R Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 17 results over 13 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
- The Stacks Project, Section 10.9: Localization (standard reference, not scraped)