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
Let be an Artinian commutative ring, let
be a standard graded -algebra with , and let be a finite graded -module. Then:
- the Hilbert series is a rational function of the form for some Laurent polynomial ;
- the Hilbert function agrees for all sufficiently large with a polynomial in with rational coefficients.
Facts & Assumptions
Given: An Artinian ring , a standard graded -algebra with , and a finite graded -module .
Length is additive in short exact sequences of finite-length modules (Module length is additive in short exact sequences).
Proof
If , then and the finite graded -module has only finitely many nonzero homogeneous pieces. Hence is a Laurent polynomial, so both conclusions hold.
Assume and write . Multiplication by the degree-one class of gives an exact sequence of graded -modules where and are annihilated by and therefore are finite graded -modules.
Taking degree- pieces in algebra and using [L2] yields for every . In Hilbert-series form this is by [L1].
By the algebra hypothesis applied to the finite graded -modules and , the two series on the right side of algebra have denominator dividing . Therefore has denominator dividing .
Any rational function with denominator a power of expands for large as a finite -linear combination of binomial coefficients , hence its coefficients agree eventually with a polynomial. Applying this to algebra proves the eventual polynomial behaviour of .
Steps 1.1 through 1.5 prove both claims.
Depends on
Used by
Dependency tree · two levels
6 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
- Stacks Project, Proposition 10.58.7 (standard reference, not scraped)
- Allen B. Altman and Steven L. Kleiman, A Term of Commutative Algebra, Corollary (20.8) (standard reference, not scraped)