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.
dvrs as regular local rings
Example
A DVR with uniformizer and residue field is regular local of dimension one, with regular system and .
Facts & Assumptions
Given: The objects and hypotheses in the example. We work with the Axiom of Choice; cited dependent-choice and resolution-existence hypotheses are retained.
one dimensional regular local rings are dvrs: A nonzero Noetherian local ring of dimension one is regular if and only if it is a discrete valuation ring. Fields are excluded from the term DVR.
associated graded ring of a regular local ring: If is regular local of dimension , any cotangent basis induces a graded isomorphism . Conversely, if the associated graded ring of a nonzero Noetherian local ring is isomorphic as a graded -algebra to with standard grading, then is regular of dimension .
Verification
The DVR equivalence gives dimension-one regularity. Its maximal ideal is and , since otherwise cancellation would make the nonunit a unit. Thus its cotangent basis is the class of .
For every , multiplication by identifies with : injectivity follows by cancellation and surjectivity by principality. Products of these classes are powers of the degree-one class, so the graded map is an isomorphism, also as given by the regular graded theorem.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- Example 12.10, p.116 (standard reference, not scraped)