Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-24 (gpt-6-sol)
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 Hilbert-Samuel function agrees eventually with a rational polynomial in binomial form

Statement

Assume the Axiom of Choice (The Axiom of Choice).

Let (R,m) be a Noetherian local ring, let M be a finite R-module, and let I⊂R be an ideal of definition for M. Then the Hilbert-Samuel function χI,M(n)=ℓR(M/In+1M) agrees for all sufficiently large n with a polynomial in Q[n]. Equivalently, there are integers a0,…,ad such that for large n, χI,M(n)=∑j=0daj(n+jj).

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian local ring (R,m), a finite R-module M, and an ideal of definition I⊂R for M.

[L1]

The associated graded objects gr⁡I(R)=⨁n≥0In/In+1,gr⁡I(M)=⨁n≥0InM/In+1M are graded, and χI,M(n)=∑j=0nℓR(IjM/Ij+1M) (The associated graded ring and associated graded module of an ideal-adic filtration, The Hilbert-Samuel function and eventual Hilbert-Samuel polynomial of a finite local module).

[L2]

Under the Axiom of Choice, Hilbert-Serre gives a rational Hilbert series and eventual polynomial growth for finite graded modules over standard graded algebras (A finite graded module over a standard graded algebra has rational Hilbert series and eventual polynomial growth).

Proof

technique · direct
1.1L1L3givenalgebra

Every simple module over the local ring R is R/m: a nonzero element generates a simple module, whose annihilator is a maximal ideal, necessarily m. Along a composition series of the finite-length module M/IM, each multiplication by m moves into the preceding term. Thus mc(M/IM)=0 for some c≥1, or mcM⊆IM. Multiplying by In gives mcInM⊆In+1M for every n≥0. The quotient A:=R/mc is Artinian: m is finitely generated by [L3], so each factor mi/mi+1 for 0≤i<c is a finite-dimensional vector space over R/m; their finite filtration gives A finite length as an R-module. Each graded piece InM/In+1M is naturally an A-module.

1.2L1L3givenchoose

By [L3], choose generators x1,…,xr of I, and choose generators m1,…,ms of M. The classes of the mj in degree 0 generate gr⁡I(M) over the standard graded A-algebra A[T1,…,Tr], where Ti acts by multiplication with the class of xi. Indeed every class in InM/In+1M is represented by a finite sum of monomials xi1⋯xinmj.

2.1L1L2step 1.1step 1.2

Length over R and over A=R/mc agree on each module InM/In+1M, because that quotient is annihilated by mc and has the same submodules in either category. Applying [L2] to the finite graded A[T1,…,Tr]-module gr⁡I(M), the function n⟼ℓR(InM/In+1M) agrees for large n with a polynomial Q(n). Equivalently, the Hilbert series of gr⁡I(M) is rational with denominator a power of (1−t).

3.1L1L2step 2.1algebra

By [L1], the Hilbert-Samuel function is the cumulative sum of these graded-piece lengths: χI,M(n)=∑j=0nφI,M(j). The rational Hilbert series in [L2] has an integral Laurent numerator and denominator (1−t)r; cumulative summation divides it by (1−t). Its large-degree coefficients are therefore integer linear combinations of shifted binomial polynomials (n−k+rr). The finite-difference identity for integer-valued polynomials expresses each such shift as an integer linear combination of (n+jj), 0≤j≤r. Thus χI,M(n) is eventually a polynomial in the claimed binomial form.

4.1step 3.1∎

Hence the Hilbert-Samuel polynomial exists.

Depends on

Used by

Dependency tree · two levels

24 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