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.

A finite graded module over a standard graded algebra has rational Hilbert series and eventual polynomial growth

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let A be an Artinian commutative ring, let S=A[x1,…,xr]/J be a standard graded A-algebra with deg⁡xi=1, and let M=⨁n∈ZMn be a finite graded S-module. Then:

  1. the Hilbert series HS⁡M(t) is a rational function of the form HS⁡M(t)=p(t)(1−t)r for some Laurent polynomial p(t)∈Z[t,t−1];
  2. the Hilbert function n↦ℓA(Mn) agrees for all sufficiently large n with a polynomial in n with rational coefficients.

Facts & Assumptions

Given: The Axiom of Choice, an Artinian ring A, a standard graded A-algebra S=A[x1,…,xr]/J with deg⁡xi=1, and a finite graded S-module M=⨁Mn.

[L1]

A twist satisfies M(−1)n=Mn−1, hence HS⁡M(−1)(t)=tHS⁡M(t) (Nonnegatively graded rings and modules, homogeneous elements, and twists, The Hilbert function and formal Hilbert series of a graded module with finite-length pieces).

[L2]

Length is additive in short exact sequences of finite-length modules (Module length is additive in short exact sequences).

[L4]

A polynomial ring in finitely many variables over a Noetherian ring is Noetherian, as are its quotients; a finite module over a Noetherian ring is Noetherian, so its submodules are finitely generated (If R is Noetherian then R[x1,…,xn] is Noetherian for every n∈N, Finitely generated modules over a left Noetherian ring are Noetherian).

Proof

technique · direct
1.1L3givenbase

Induct on r. If r=0, the standard grading makes S=A concentrated in degree zero. Choose a finite homogeneous generating list for M by splitting any finite generating list into its finitely many homogeneous components. Only the finitely many degrees of those generators occur in M, and each such degree piece is finite over A, hence has finite length by [L3]. Therefore HS⁡M(t) is a Laurent polynomial and its coefficients are zero for all sufficiently large n. Both conclusions hold in this base case.

1.2L3L4givenih

Assume r>0 and the assertion for standard graded algebras presented using r−1 variables. By [L3] and [L4], S is Noetherian; hence the kernel of multiplication by xr on the finite module M(−1) is finite, as is its cokernel. Write S′=A[x1,…,xr−1]/(J∩A[x1,…,xr−1]). Multiplication by the degree-one class of xr gives an exact sequence of graded S-modules 0→K→M(−1)→xrM→C→0. Both K and C are annihilated by xr and are therefore finite graded modules over the r−1-variable algebra S′: split their finite S-generating lists into homogeneous components, and the same lists generate after the action factors through S/(xr), a quotient of S′.

2.1L1L2L3step 1.2

Every degree piece of M, K, and C is a finite A-module: finite homogeneous generators and finitely many monomials of any fixed degree suffice. By [L3], it has finite length. Taking degree-n pieces in the exact sequence of step 1.2 and using [L2] yields ℓA(Cn)−ℓA(Kn)=ℓA(Mn)−ℓA(Mn−1) for every n. In Hilbert-series form this is (1−t)HS⁡M(t)=HS⁡C(t)−HS⁡K(t) by [L1].

3.1ihstep 1.2step 2.1

The induction hypothesis applies to the finite graded S′-modules K and C from step 1.2. Their series have Laurent-polynomial numerators over (1−t)r−1. Equation 2.1 therefore writes HS⁡M(t) with a Laurent-polynomial numerator over (1−t)r.

4.1step 3.1algebra

Write the numerator from step 3.1 as p(t)=∑j=abcjtj with finite integers cj. For r>0, the coefficient of tn in tj(1−t)−r is (n−j+r−1r−1) for n≥j. For all n≥b, the Hilbert function is therefore ∑j=abcj(n−j+r−1r−1), a polynomial in n with rational coefficients.

5.1step 1.1step 1.2step 3.1step 4.1discharge-induction∎

The base case is step 1.1, and steps 1.2 through 4.1 prove the induction step. Thus both claims hold for every finite number of variables.

Depends on

Used by

Dependency tree · two levels

28 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