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 and degree indexed multiplicity
Definition
Write for module length. If is a bounded homological complex of -modules and every has finite length, its Euler characteristic is Boundedness makes the sum finite. The terms of themselves need not have finite length. For a cochain complex use ; reindexing preserves this number.
Let be a commutative Noetherian local ring and a finite -module. Call a module-relative ideal of definition if , allowing . The unique eventual polynomial exists by The module-relative Hilbert–Samuel polynomial exists without a dimension theorem. For each integer define the degree-indexed coefficient Here means the coefficient of , and . Set , and their coefficients equal to zero, consistently with that lemma. A coefficient above the degree is zero. Coefficients below the degree depend on the fixed convention; this definition does not identify the index with support dimension.
For a finite ordered sequence , denotes Koszul Complex Of A Sequence With Coefficients. Its Euler characteristic is defined whenever its homology has finite length. For the empty sequence and . The module-relative hypothesis then says has finite length, and is the constant .
Remarks
Source locators: Hochster, Math 615 (Winter 2012), printed pp.104–108; Stacks 43.15.1 and 43.15.6. Our definition extends coefficient indexing to every nonnegative integer and uses the fixed variable convention. Polynomial existence is an earlier prerequisite, so there is no circular well-definedness reference to the later bridge theorem.
Depends on
Used by
- koszul euler characteristic annihilator correction Example
- koszul euler characteristic empty sequence Example
- koszul euler characteristic redundant zero generator Example
- bounded finite length complex euler identities Lemma
- koszul homology finite length for an ideal of definition Lemma
- degree-r Hilbert–Samuel coefficient as Koszul Euler characteristic Theorem
Dependency tree · two levels
16 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)