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 polynomial of a finite scheme is its length
Statement
Assume AC and DC. For a finite scheme over a field , of length , and any invertible sheaf on , for every integer . Thus its Hilbert polynomial for every polarization is the constant polynomial . Nonreduced schemes, non-rational closed points, and the empty scheme are included.
Facts & Assumptions
Given: The hypotheses in the statement and AC and DC, inherited from the scheme, cohomology, and finite-module suppliers (The Axiom of Choice, The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Affine quasi-coherent higher cohomology vanishes (Affine acyclicity of quasi-coherent sheaves). Nakayama's lemma is Assuming the Axiom of Choice, Nakayama's lemma.
Proof
The algebra is finite-dimensional over , hence Artinian, and decomposes as a finite product of Artinian local rings. On each local factor an invertible module is free of rank one: lift a generator from its residue field, use Nakayama for surjectivity, and use the local rank-one trivialization to see that the map is an isomorphism. Consequently every power has a section module isomorphic, as a -module, to , and therefore of -dimension .
The finite scheme is affine, so [F1] makes all positive cohomology vanish. Euler characteristic is therefore for each , including negative powers and . When is empty all modules and dimensions are zero and the same argument gives polynomial zero.
Depends on
Used by
Dependency tree · two levels
23 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
- Nitin Nitsure, Construction of Hilbert and Quot Schemes, Sections 2–5 (standard reference, not scraped)
- Alexander Grothendieck, Les schémas de Hilbert, Bourbaki 221, Sections 2–3 (standard reference, not scraped)