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.
polynomial local regularity fibre step
Statement
For a prime with contraction , the closed fibre of is localized at a prime. That prime is either zero, giving a field, or generated by an irreducible polynomial, giving a DVR. In both cases the fibre is regular.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
embedding dimension and regular local ring: A nonzero Noetherian local ring is regular when .
Every Euclidean domain is a principal ideal domain: Every Euclidean domain is a principal ideal domain.
For every field , is a Euclidean domain with degree as Euclidean function: For every field , the ring is a Euclidean domain with Euclidean function on nonzero polynomials.
Proof
Localize first at , quotient by , and then localize at the image of . Fractions and the quotient relation identify the fibre with . Over this field the polynomial ring is Euclidean and hence a PID.
In the PID , every nonzero prime is generated by an irreducible polynomial and is maximal. Localization at it is a nonfield local PID with maximal ideal and dimension one. Since by cancellation, its cotangent space is one-dimensional over the residue field, so the localization is regular by [F1]; it is a DVR by the powers-of- valuation. The zero-prime localization is the rational function field, which has zero maximal ideal and dimension zero and is regular by [F1].
Depends on
Used by
Dependency tree · two levels
14 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
- Proposition 12.36 proof, p.124 (standard reference, not scraped)