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.
A localization of the integers at p need not be Henselian
Example
The local ring is not Henselian.
Facts & Assumptions
Given: The localization and the polynomial .
The localization at the prime is a local ring ( is local with unique maximal ideal ).
Its residue field is ( is the residue field at , For every prime , the two operations on make it a field).
In a Henselian local ring, every simple residue root lifts (A local ring is Henselian exactly when simple residue roots lift uniquely).
Verification
By [L1] and [L2], the ring is local with residue field . In that field, so is a simple residue root.
Suppose with satisfies . Then in . The -adic valuation of the left side is even, while the valuation of the right side is odd, impossible. Hence has no square root in , and therefore no root in .
The simple residue root from step 1.1 does not lift, so [L3] shows that cannot be Henselian.
Depends on
- A local ring is Henselian exactly when simple residue roots lift uniquely
- $R_{\mathfrak p}$ is local with unique maximal ideal $\mathfrak pR_{\mathfrak p}$
- $R_{\mathfrak p}/\mathfrak pR_{\mathfrak p}\cong\operatorname{Frac}(R/\mathfrak p)$ is the residue field at $\mathfrak p$
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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
- Allen B. Altman and Steven L. Kleiman, A Term of Commutative Algebra, 13th ed., Chapter 22 (standard reference, not scraped)