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.
The spectrum of a localisation is the subspace of primes disjoint from the denominator set
Statement
Let be a commutative ring, let be multiplicative, and let be the localisation map. Then contraction along is a homeomorphism from onto the subspace
Facts & Assumptions
Given: A commutative ring , a multiplicative subset , and the localization map .
Contraction along is an inclusion-preserving bijection from onto , with inverse (Prime ideals of a localization are exactly the primes disjoint from the denominator set).
In a Zariski spectrum, the closed sets are precisely the vanishing sets (The vanishing sets define the Zariski topology on the prime spectrum).
If and , then .
A subset of is closed in the subspace topology exactly when it has the form for some ideal .
Proof
By [L1], contraction gives a bijection .
Let . If has contraction , then the inverse description in [L1] gives . Therefore and hence
By [L2], every closed subset of has the form for some ideal . With , assumption [A1] gives , so step 1.2 shows that sends every closed subset of to a closed subset of .
Conversely, if is closed, then [A2] gives for some ideal . Step 1.2 then yields so also preserves closed sets.
The bijection and its inverse both preserve closed sets, so is a homeomorphism from onto the subspace .
Depends on
Used by
Dependency tree · two levels
6 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, A Primer of Commutative Algebra, v4.03, §14 (standard reference, not scraped)
- The Stacks Project, Lemma 10.17.5 (standard reference, not scraped)