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.
associated graded polynomial map singular kernel
Example
For the cusp local ring with maximal ideal , the associated graded ring is . Thus the polynomial map defined by the cotangent classes has kernel exactly .
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.
associated graded polynomial surjection: Let be nonzero Noetherian local and let lift a basis of . There is a surjective graded -algebra map , determined by , with every variable of degree one.
Verification
In the ambient coordinate local ring , the associated graded ring is : a rational function with denominator of nonzero constant term has initial form equal to its numerator initial form divided by that constant. This identifies each graded piece and respects products. Therefore orders add on products of nonzero elements of . In particular for , , and for every nonzero .
The degree- kernel of consists of classes of with . Write with . If its degree- class is nonzero, it is exactly the initial form of , hence a multiple of . Conversely every homogeneous multiple of is the initial form of a polynomial multiple of . Thus the graded kernel is exactly and the surjective polynomial map of the cotangent-basis lemma has the stated quotient.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Lecture 25, Proposition 25.6 and its graded-map proof, p.67 (standard reference, not scraped)