Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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 R for module length. If C is a bounded homological complex of R-modules and every Hi(C) has finite length, its Euler characteristic is χ(C)=iZ(1)iR(Hi(C)). Boundedness makes the sum finite. The terms of C themselves need not have finite length. For a cochain complex use n(1)nR(Hn(C)); reindexing Cn=Cn preserves this number.

Let (R,m) be a commutative Noetherian local ring and M a finite R-module. Call I a module-relative ideal of definition if R(M/IM)<, allowing I=R. The unique eventual polynomial PI,M(n)=R(M/In+1M)(n0) exists by The module-relative Hilbert–Samuel polynomial exists without a dimension theorem. For each integer j0 define the degree-indexed coefficient ej(I,M)=j![Tj]PI,M(T). Here [Tj] means the coefficient of Tj, and 0!=1. Set PI,0=0, PR,M=0 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 n+1 convention; this definition does not identify the index with support dimension.

For a finite ordered sequence f, K(f;M) denotes Koszul Complex Of A Sequence With Coefficients. Its Euler characteristic is defined whenever its homology has finite length. For the empty sequence I=0 and K(;M)=M[0]. The module-relative hypothesis then says M has finite length, and P0,M is the constant R(M).

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 n+1 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

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