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.
regular local hilbert samuel multiplicity one
Statement
For a regular local ring of dimension and every integer , . Consequently .
Facts & Assumptions
Given: The objects and hypotheses in the statement. We work with the Axiom of Choice; cited dependent-choice and resolution-existence hypotheses are retained.
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 .
Hilbert-Samuel multiplicity as the factorial-scaled leading coefficient: Let be a Noetherian local ring, let be a finite -module, and let be an ideal of definition for . If , define If , let be the eventual Hilbert-Samuel polynomial from thm-existence-of-hilbert-samuel-polynomial, and let . Because and , Nakayama's lemma makes nonzero for every , so is not the zero polynomial and is defined. The Hilbert-Samuel multiplicity of with respect to is Equivalently, when and then is the integer scaling the top term.
Proof
The filtration of has factors for . The graded polynomial description identifies their total dimension with the number of monomials in variables of degree at most . Introducing a slack exponent identifies these with -tuples of nonnegative integers summing to , counted by .
The leading coefficient is , so multiplying it by gives multiplicity one. If , the only monomial is , and the constant polynomial has leading coefficient one and . The formula also gives length one at .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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, monomial-count consequence (standard reference, not scraped)