Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

The module-relative Hilbert–Samuel polynomial exists without a dimension theorem

Statement

Let (R,m) be a commutative Noetherian local ring, M a finitely generated R-module, and I an ideal such that ℓR(M/IM)<∞. For every integer n≥0, M/In+1M has finite length. There is a unique P∈Q[T] with P(n)=ℓR(M/In+1M) for all sufficiently large integers n. If I=R or M=0, then P=0. No degree/dimension assertion is part of this lemma.

Facts & Assumptions

Given: A commutative Noetherian local ring (R,m), a finite module M, and an ideal I with ℓR(M/IM)<∞.

[F1]

Associated graded pieces and their multiplication are defined in The associated graded ring and associated graded module of an ideal-adic filtration.

[F2]

Length counts simple factors, including length zero for the zero module: Composition series and length of a module.

[F3]

Finite length passes to submodules and quotients and is additive in short exact sequences: Module length is additive in short exact sequences.

[F4]

Polynomial extension preserves Noetherianity: Hilbert basis theorem: if R is Noetherian then R[x] is Noetherian.

[F5]

A finite module over a Noetherian ring is Noetherian (every submodule is finite): Finitely generated modules over a left Noetherian ring are Noetherian.

[F6]
[F7]

The local ring has unique maximal ideal m and residue field k=R/m: A local ring is a nonzero commutative ring with a unique maximal ideal.

Proof

technique · direct
1.1F2givenalgebra

If I=R or M=0, every quotient in the statement is zero, giving the polynomial zero. More generally put N=M/IM. If N=0, then M=IM implies M=IaM by repeated multiplication for every a≥1, so again all quotients are zero. Uniqueness in these cases follows from the polynomial argument at the end. Henceforth I≠R and c=ℓR(N)>0.

2.1F2F7step 1.1

For a simple R-module S and 0≠s∈S, Rs=S; the map R→S taking a to as is onto and its kernel is maximal, since a nontrivial intermediate ideal would give a nontrivial submodule. Thus the kernel is m and S≅k. A composition series 0=N0⊂⋯⊂Nc=N therefore satisfies mNj⊆Nj−1. Iteration gives mcN=0.

3.1F3F6F8step 2.1

Set A=R/mc, a Noetherian ring. Each mj/mj+1 for 0≤j<c is generated by finitely many elements and killed by m, hence is a finite-dimensional k-space. Indeed a finite spanning list can be reduced, by deleting any member in the span of the others, to a basis; the flag of initial basis spans has simple factors k. Its R-length is its dimension. Applying length additivity to the finite m-adic filtration gives ℓR(A)<∞.

4.1F1F3F8step 2.1step 3.1

Choose generators f1,…,fs of I. For each j≥0, multiplication by the finitely many monomials fα with ∣α∣=j gives a surjection from copies of N onto Gj=IjM/Ij+1M: coefficients modulo IM suffice because fαIM⊆Ij+1M. In particular every Gj has finite length and is killed by mc. The actions Ximˉ=fim‾ commute, and define G=⨁j≥0Gj as a finite graded module over A[X1,…,Xs], generated by a finite generating list of N in degree zero.

4.2F3step 3.1

For any finite graded A[X1,…,Xs]-module V, replacing a finite generating list by all its homogeneous components gives homogeneous generators. Their degrees have a lower bound. Each Vj is a quotient of finitely many copies of A, indexed by monomials of the required degree times these generators. Thus HV(t)=∑jℓR(Vj)tj is a well-defined formal Laurent series. When s=0, only the finitely many generator degrees can occur, so HV is a Laurent polynomial.

5.1F4F5step 3.1step 4.2

Suppose s>0 and rationality with denominator (1−t)s−1 has been proved for every finite graded module over A[X1,…,Xs−1]. Put V(−1)j=Vj−1, U=ker⁡(Xs:V(−1)→V) and W=V/XsV. Iterating polynomial extension from the Noetherian ring A makes A[X1,…,Xs] Noetherian. Consequently U is finite as a submodule of finite V(−1); W is finite as a quotient. Both are killed by Xs, so their same finite generators generate them over the ring with s−1 variables.

6.1F3step 4.2step 5.1

In degree j, the exact sequence 0→Uj→Vj−1→XsVj→Wj→0, split at its image, yields ℓR(Vj)−ℓR(Vj−1)=ℓR(Wj)−ℓR(Uj). Hence (1−t)HV=HW−HU. The induction hypothesis gives a Laurent polynomial numerator divided by (1−t)s. Together with the base case this proves that form for all s.

7.1F3step 4.1step 6.1

The filtration of M/In+1M has successive factors G0,…,Gn, so its length is h(n)=∑j=0nℓR(Gj). Its generating series is HG(t)/(1−t)=Q(t)/(1−t)s+1 for a Laurent polynomial Q(t)=∑aqata. The geometric series and repeated convolution give the coefficient (n−a+ss) of tn in ta/(1−t)s+1 when n≥a. One can count the convolution terms as nonnegative (s+1)-tuples with sum n−a, separated by s dividers. Thus for n beyond the finite set of exponents of Q, h(n)=∑aqa(n−a+ss), a rational polynomial in n. For s=0 the binomial is 1, as required for I=0.

8.1step 1.1step 7.1algebra∎

If two rational polynomials eventually equal h(n), their difference vanishes at infinitely many distinct integers. Division by T−a at a root lowers the degree by one, so a nonzero polynomial of degree d has at most d distinct roots. The difference is therefore zero. This also proves the uniqueness left open in the zero cases.

Remarks

Source locators: Stacks Project, Section 10.58, Lemmas 10.58.5–6 and Proposition 10.58.7; Section 10.59, opening Hilbert functions and Proposition 10.59.5. The proof gives its own kernel/cokernel induction and extends the proper ring-ideal convention to module-relative finite colength. Only choice-free clauses of the Noetherian interfaces are used.

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