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.
koszul euler characteristic redundant zero generator
Example
Assume AC. Over a discrete valuation ring with uniformizer and residue field , the sequence on generates and has , , . Thus , although has dimension one and its degree-one leading multiplicity is .
Facts & Assumptions
Given: AC, a DVR with uniformizer and residue field , , and the ordered sequence .
We assume The Axiom of Choice for the comparison lemmas.
A sequence of length computes the coefficient : degree-r Hilbert–Samuel coefficient as Koszul Euler characteristic.
First-element reduction retains quotient minus annihilator: koszul euler characteristic first element reduction.
DVR quotients satisfy : Length and valuation in a DVR.
Every nonzero ideal of the DVR is for a unique : Ideals in a DVR are powers of the maximal ideal.
The ordered deletion differential is fixed in Koszul Complex Of A Sequence With Coefficients.
The coefficients and Euler characteristic are defined in koszul euler characteristic and degree indexed multiplicity.
Finite direct sum lengths add: Module length is additive in short exact sequences.
Verification
In the ordered bases and , the complex is with and , because deletion gives . Their composite is zero. Since is nonzero in a domain, and . Consequently , and .
The length formula gives . Hence both nonzero homology modules have length one, and . The homology has total length by additivity, so its alternating cancellation is not acyclicity.
For we have , so . Thus and . The DVR is Noetherian local, is finite over itself and has finite length. The bridge theorem applies under AC with the actual sequence length , agreeing with .
To identify the dimension without a general Hilbert–Samuel dimension theorem, let be a nonzero prime ideal. It has the form with because it is proper. Since , repeated primality gives . Thus , as is maximal. Also is prime because is a domain, and makes . These are all primes, so the largest number of strict inclusions in a prime chain is one. Therefore the dimension is one, and the coefficient at that dimension is the already calculated.
The first-element identity provides another explicit check: removing gives and since multiplication by on is injective. The remaining sequence is , whose complex on is . It has one copy of in each homology degree, so , whereas is zero. The reduction formula is therefore , with finite length. This confirms that the redundant generator changes the coefficient index, not the generated ideal.
Remarks
Locally calculated design example. Source context: Stacks 43.15.5 and Hochster printed pp.106–108, 165. The ordered two-element differential and the prime-chain calculation are supplied explicitly; no general theorem equating Hilbert degree and support dimension is used.
Depends on
- degree-r Hilbert–Samuel coefficient as Koszul Euler characteristic
- koszul euler characteristic first element reduction
- Length and valuation in a DVR
- The Axiom of Choice
- Ideals in a DVR are powers of the maximal ideal
- Koszul Complex Of A Sequence With Coefficients
- koszul euler characteristic and degree indexed multiplicity
- Module length is additive in short exact sequences
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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
- Stacks Project, 43.15.4–6; local proof with stated module-relative and coefficient conventions (standard reference, not scraped)
- Hochster, Math 615 Winter 2012, pp.104–108: Euler characteristics and the multiplicity theorem (standard reference, not scraped)