Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

Modulo a parameter preserves the top Hilbert-Samuel multiplicity up to the finite-annihilator correction

Statement

Assume the Axiom of Choice.

Let (R,m) be a Noetherian local ring, let M0 be a finite R-module, and put d=dimSupp(M). Assume d1 and let x,x2,,xd be a system of parameters for M. Put Q=(x,x2,,xd) and Q=(x2,,xd). For a finite module N on which J is an ideal of definition, and for an integer r0 with either N=0 or rdegPJ,N, write eJ[r](N):=r![nr]PJ,N(n), with value 0 when N=0 or degPJ,N<r. Then

eQ[d](M)=eQ[d1](M/xM)eQ[d1](0:Mx).

In particular, if x is M-regular, then

eQ(M)=eQ(M/xM).

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian local ring (R,m), a nonzero finite R-module M of support dimension d1, and a system of parameters x,x2,,xd as above.

[L1]

The support dimension is the least number of generators of an ideal of definition (For a finite module, the dimension is the least size of an ideal of definition, and such tuples are systems of parameters).

[L2]

The degree of a nonzero finite module's Hilbert-Samuel polynomial equals its support dimension (The degree of the Hilbert-Samuel polynomial equals the dimension of the support).

[F1]

For an ideal of definition generated by r elements, its dimension-r multiplicity is the Euler characteristic of the corresponding Koszul complex (Stacks Project, Theorem 43.15.5).

[F2]

The Koszul complex on (x,x2,,xd) is the tensor product of the two-term complex on x with the Koszul complex on Q. The two-term complex has homology M/xM in degree 0 and (0:Mx) in degree 1.

[F3]

For a finite module T, the quotient T/JT has finite length exactly when its support is contained in the closed point (Stacks Project, Remark 43.15.6).

Proof

technique · direct
1.1

Put K=(0:Mx) and C=M/xM. Multiplication by x gives the exact complex 0KMxMC0. One has C/QC=M/QM, so Q is an ideal of definition for C. Also xK=0, hence QK=QK. Every prime in Supp(K/QK) lies in Supp(M)V(Q)={m}, so [F3] makes K/QK finite length and Q an ideal of definition for K. By [L1], each nonzero one of C and K has support dimension at most d1, and [L2] therefore gives degPQ,C, degPQ,Kd1 whenever the polynomial is nonzero.

L1L2F3givenalgebra
2.1

By [L2] and [F1], eQ[d](M) is the Euler characteristic of the Koszul complex on (x,x2,,xd). Using the tensor decomposition in [F2] and taking homology first in the two-term x direction gives the Q-Koszul complex on C in homological degree 0 and that on K in degree 1. Euler characteristic is unchanged by this finite spectral sequence, so step 1.1 and [F1] give eQ[d](M)=eQ[d1](C)eQ[d1](K).

L2F1F2step 1.1algebra
3.1

If x is M-regular, then K=0. By [L2], degPQ,M=d, so eQ[d](M)=eQ(M)0. Step 2.1 therefore makes eQ[d1](C) nonzero. The degree bound in step 1.1 forces degPQ,C=d1, and hence eQ[d1](C)=eQ(C). This proves eQ(M)=eQ(M/xM).

L2step 1.1step 2.1algebra
4.1

Therefore the parameter-reduction formula holds.

step 2.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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