Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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 first element reduction

Statement

Assume AC. Let (R,m) be a commutative Noetherian local ring, M a finite R-module, J=(y1,,ys) and R(M/(x,J)M)<. Put C=M/xM and T=0:Mx. Then C/JC and T/JT have finite length, all homology modules in the following formula have finite length, and χ(K(x,y1,,ys;M))=χ(K(y1,,ys;C))χ(K(y1,,ys;T)). The sequence y may be empty. This does not assert that T itself has finite length.

Facts & Assumptions

Given: AC, a commutative Noetherian local ring (R,m), finite M, J=(y1,,ys), and R(M/(x,J)M)<. Set C=M/xM and T=0:Mx.

[A1]
[F1]

For finite modules, closed-point support is equivalent to finite length; Supp(L/JL)=Supp(L)V(J); finite-colength sequences have finite-length Koszul homology: koszul homology finite length for an ideal of definition.

[F2]

Euler characteristic is additive for short exact bounded complexes with finite-length homology, and a shift reverses its sign: bounded finite length complex euler identities.

[F3]

A short exact sequence of complexes gives the homology LES: The long exact sequence in homology.

[F4]
[F5]

Localization of modules is exact: Localisation of modules is exact.

[F6]

Under AC, Nakayama applies to finite modules and ideals in the Jacobson radical: Assuming the Axiom of Choice, Nakayama's lemma.

[F7]

Concatenation is the signed tensor Koszul complex: Koszul Complex Concatenation Tensor Isomorphism.

[F8]

Finite modules over a Noetherian ring have finite submodules: Finitely generated modules over a left Noetherian ring are Noetherian.

Proof

technique · direct
1.1

The modules C and T are finite, the latter as a submodule of M. Direct quotienting gives C/JC=M/(x,J)M, of finite length by hypothesis. Further, xT=0 and TM, so Supp(T)Supp(M)V(x): the first inclusion follows by exact localization of the injection and the second by the annihilator formula.

F4F5F8given
1.2

Let B=[MxM] in degrees 1,0. It contains the subcomplex T[1], with T only in degree one. Its quotient is Q=[M/TxˉM], where xˉ(m+T)=xm. This is well-defined and injective: xm=0 holds exactly for mT. The map QC[0], zero in degree one and quotient in degree zero, is onto with kernel D=[M/TxˉxM]. This differential is an isomorphism, since every element of xM is xm and its kernel is zero. Thus D is acyclic.

givenalgebra
2.1

For a prime pm containing (x,J), the finite-length hypothesis makes Mp/(x,J)pMp=0. Here the local ring Rp has maximal ideal pRp containing (x,J)p and Mp is finite. Nakayama under AC gives Mp=0, hence Tp=0. If p does not contain x, Tp=0 because x is an invertible annihilator; if it does not contain J, then (T/JT)p=0. These cases cover every pm, so T/JT has closed-point support and finite length. Consequently all three Koszul complexes in the statement have finite-length homology.

A1F1F5F6step 1.1
2.2

Put P=K(y;R). Define the total tensor differential on BiPj by dB1+(1)i1dP. Identifying m(exw) with the corresponding ordered wedge places the x term first. Deleting that first factor gives xmw, and deleting a y factor has the extra sign (1)i from passing the i x-factors. Thus this total complex is K(x,y;M), as in the concatenation interface (the coefficient M may be moved between tensor factors via m(aw)a(wm)).

F7step 1.2
3.1

Every Pj is finite free. Tensoring either 0T[1]BQ0 or 0DQC[0]0 with Pj gives a finite direct sum of that exact sequence. Taking finite sums in each total degree therefore preserves exactness, yielding short exact total complexes. No flatness of T or M/T is needed.

step 1.2step 2.2
4.1

To prove DP acyclic, filter it by columns jk for k=1,0,,s. The differential in D preserves j, and that in P lowers it, so these are subcomplexes. The initial subcomplex is zero. The quotient at stage k is DPk shifted in total degree by k, with only the D differential. It is a finite direct sum of the two-term isomorphism D, and hence acyclic. The LES at each of the finitely many stages shows that the total complex is acyclic. Applying the LES to the second tensor exact sequence gives Hi(QP)Hi(K(y;C)).

F3step 1.2step 3.1
5.1

The first tensor exact sequence has left complex T[1]P=K(y;T)[1]: in its terms the total differential on P is dP, exactly the shift convention. The middle complex is K(x,y;M) and the right has the homology just computed. All these homologies have finite length by the earlier support calculation. Euler additivity and the shift sign give precisely χ(K(x,y;M))=χ(K(y;C))χ(K(y;T)).

F2step 2.1step 2.2step 3.1step 4.1
6.1

If s=0, then P=R[0], and the calculation reads χ([MxM])=R(C)R(T); their lengths are finite by the support argument. If M=0, every complex is zero. If (x,J)=R, the same support cases prove the required finiteness and the tensor argument still applies; no step required this ideal to be proper. If x is a unit, then C=T=0 and B is an isomorphism complex. If x=0, then C=T=M and the formula gives zero by cancellation. Thus all asserted cases are included.

step 2.1step 1.2step 5.1algebra

Remarks

Source locator: Hochster, Math 615, printed p.165, Proposition and Corollary comparing the quotient and annihilator when the last element is removed. The displayed formula here removes the first element; the signed tensor calculation proves that convention explicitly. The acyclic-kernel argument and finite column filtration replace any generic two-row spectral-sequence appeal.

Depends on

Used by

Dependency tree · two levels

39 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