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 surjection
Statement
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.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
The associated graded ring and associated graded module of an ideal-adic filtration: Let be a commutative ring, let be an ideal, and let be an -module. The associated graded ring of the -adic filtration is Multiplication is induced by multiplication in : The associated graded module is viewed as a graded -module by
Proof
The degree-zero part is . On the action of factors through , since . The graded multiplication therefore defines the displayed polynomial map. Altering a representative by changes a product of degrees by , so multiplication and the map are well-defined.
For , every element of is a sum of classes of products with each . In , express the class of each as a -linear combination of the given basis classes . Replacing one factor by such a combination changes the product only by an element of . Expanding therefore expresses every degree- class as a -linear combination of monomials in the , all in the image of . Degree zero is by step 1.1. This argument also covers : the empty degree-one basis makes every positive-degree quotient zero, so the map is surjective.
Depends on
Used by
Dependency tree · two levels
2 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
- 10.106.1, first proof paragraph (standard reference, not scraped)