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.
Localizing a PID at a nonzero prime
Example
Let be a principal ideal domain and let be a nonzero prime ideal. Then the localisation is a discrete valuation ring with uniformiser .
Facts & Assumptions
Given: A principal ideal domain and a nonzero prime ideal .
In a PID every ideal is principal, and the ring is a domain (Principal ideal domain).
A prime ideal is proper (Prime ideals and maximal ideals in a commutative ring).
Localisation at means inverting the complement (Localisation at a prime ideal: ).
Every principal ideal domain is Noetherian (Every principal ideal domain is Noetherian).
A nonfield domain is a DVR exactly when it is a local PID with nonzero maximal ideal (Equivalent characterizations of a DVR).
Verification
Let be nonzero. If , then because . If , divide by again, and continue. This process stops, for otherwise would be a strict ascending chain of principal ideals, contradicting [L1]. Thus with , a unit of , and .
Every nonzero element of is therefore with and . Since both and are in the denominator set, is a unit of . Hence is local with nonzero maximal ideal generated by , and every ideal is principal by the same minimum-exponent argument as in a DVR.
The ring is not a field because lies in its maximal ideal and is not a unit. So [L2] applies and shows that is a discrete valuation ring with uniformiser .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
25 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
- M. Mustata, Commutative Algebra, Example 8.10 (standard reference, not scraped)
- Allen B. Altman and Steven L. Kleiman, A Term of Commutative Algebra, 13th ed., Theorem (23.10) (standard reference, not scraped)