Math 2.0

Commutative algebra Definition

Hilbert polynomial

Builds on Graded ringPolynomials in several variablesFinitely generated moduleFieldHilbert–Serre theorem

Definition

Let kk be a field and let S=k[x1,…,xr]S = k[x_1, \dots, x_r] be the polynomial ring with each xix_i of degree 11. Let M=⨁n∈ℤMnM = \bigoplus_{n \in \Z} M_n be a finitely generated graded SS-module. The Hilbert function of MM is HM(n)=dim⁡kMnH_M(n) = \dim_k M_n. The Hilbert polynomial of MM is the unique polynomial PM∈ℚ[t]P_M \in \Q[t] such that HM(n)=PM(n)H_M(n) = P_M(n) for all sufficiently large integers nn.

Remarks

Such a polynomial exists by the Hilbert–Serre theorem, and it is unique because two polynomials that agree at infinitely many integers are equal. Example: for M=k[x,y,z]/(f)M = k[x, y, z]/(f) with ff homogeneous of degree dd, the exact sequence 0→S(−d)→S→M→00 \to S(-d) \to S \to M \to 0 gives HM(n)=(n+22)−(n−d+22)H_M(n) = \binom{n+2}{2} - \binom{n-d+2}{2} for n≥dn \ge d, so PM(t)=dt−d(d−3)/2P_M(t) = dt - d(d-3)/2. Non-example: the Hilbert function itself need not be a polynomial on all of ℕ\N; for M=k=S/(x1,…,xr)M = k = S/(x_1, \dots, x_r) one has HM(0)=1H_M(0) = 1 and HM(n)=0H_M(n) = 0 for n≥1n \ge 1, so PM=0P_M = 0 but HM(0)≠PM(0)H_M(0) \neq P_M(0). For M=SM = S, the Hilbert polynomial is (t+r−1r−1)\binom{t + r - 1}{r - 1}, of degree r−1r - 1.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Field concept
  2. Finitely generated module concept
  3. Graded ring concept
  4. Hilbert polynomial concept
  5. Polynomials in several variables concept
  6. Hilbert–Serre theorem statement
  7. Hilbert polynomial definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Hilbert_series_and_Hilbert_polynomial
About this page
Tag5FR6JX04RS
URIm2://5FR6JX04RS
Kinddefinition
WritingW0 stub
MSC13D40, 13A02
DefinesHilbert polynomial
UsesGraded ring, Polynomials in several variables, Finitely generated module, Field, Hilbert–Serre theorem
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.