Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-30
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.

Hilbert function and Euler characteristic on a projective scheme

Definition

Assume the Axiom of Choice, inherited from the finiteness corollary cited below (The Axiom of Choice). Let k be a field (Field), let n≥0, and let i:X↪Pkn be a closed immersion of schemes (Closed immersions of schemes, Relative projective space from standard charts). Thus the structure morphism X→Spec⁡k (The underlying space of an affine spectrum) is projective over k in the finite-dimensional H-projective convention (Projective morphisms before Proj), and it is proper (Projective morphisms are proper). Put OX(1)  =  i∗OPkn(1), a pullback of the twisting sheaf along the closed immersion (Pullback of a module along a morphism of ringed spaces); it is an invertible OX-module (Invertible sheaves). The embedding i and the sheaf OX(1) are fixed once and for all, and below "projective X/k" always means X together with this fixed embedding.

Twists. For m∈Z and an OX-module F the m-th twist of F is F(m)  =  F⊗OXOX(1)⊗m (Tensor product of sheaves of modules, Twists of a quasi-coherent sheaf), where OX(1)⊗m denotes the m-fold tensor power of OX(1) for m≥0 and the dual of the (−m)-fold tensor power for m<0 (Invertible sheaves).

The two functions. Let F be a coherent OX-module (Coherent module sheaves). Each twist F(m) is then coherent again: coherence is local on X, and on an open set on which the invertible sheaf OX(1) is trivial the twist is isomorphic to F (Invertible sheaves, Coherent module sheaves, Tensor product of sheaves of modules). Since X is proper over the field k, the finiteness corollary Finite-dimensional coherent cohomology over a field shows that every cohomology group Hq(X,F(m)) (Sheaf cohomology as right derived global sections) is a finite-dimensional k-vector space (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis) and that only finitely many of these groups are nonzero; hence the Euler characteristic χ(X,F(m))=∑q≥0(−1)qdim⁡kHq(X,F(m)) of Euler characteristic of a coherent sheaf is a well-defined integer. The Hilbert function of F with respect to the fixed embedding is the function Z⟶Z≥0,m⟼hF(m):=dim⁡kH0(X,F(m)), and the Euler-characteristic function of F is the function Z⟶Z,m⟼PF(m):=χ(X,F(m)).

Relation between the two. Writing hFq(m) for dim⁡kHq(X,F(m)), only finitely many of which are nonzero, the two functions are related by PF(m)=∑q≥0(−1)qhFq(m)=hF(m)−∑q>0(−1)q−1hFq(m). In particular PF(m)=hF(m) whenever the higher cohomology groups Hq(X,F(m)) with q>0 all vanish; the higher groups contribute to the Euler-characteristic function but not to the Hilbert function, and the definition imposes no vanishing of them at any particular m.

Hilbert polynomial. If there is a polynomial p∈Q[t] with p(m)=PF(m)for every m∈Z, then p is called a Hilbert polynomial of F with respect to the fixed embedding, and the notation PF(t) is also used for it once it is known to exist. Existence and uniqueness of such a polynomial are not asserted by this definition.

If X=∅ or F=0, then all groups Hq(X,F(m)) vanish, so hF≡0 and PF≡0, and the zero polynomial is a Hilbert polynomial.

Depends on

Used by

Dependency tree · two levels

72 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