Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-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.

Construction of the fixed-polynomial Hilbert scheme of projective space

Statement

Assume AC and DC. For Noetherian S, n≥0, and fixed P, the functor Hilb⁡PSn/SP,O(1) on all S-schemes is represented by a locally closed finitely presented subscheme HP of one relative Grassmannian. It has a universal closed flat finitely presented family. The Grassmannian map recovers every family scheme theoretically from its quotient of sections in one uniformly fixed degree.

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 N-indexed chain).

[F1]

Uniform kernel and quotient regularity is Uniform regularity for all quotients with a fixed Hilbert polynomial. The relative generation and arbitrary base-change result is Relative regularity, generation, and arbitrary base change. Flat successive kernels are finitely presented, including over arbitrary base algebras, by A fixed presentation computes sections after every flat-family pullback; apply it locally to a twist presentation descended to a Noetherian stage.

[F2]

The relative Grassmannian is Relative Grassmannian of finite locally free quotients. Universal flattening with arbitrary test schemes is Universal scheme theoretic flattening by Hilbert polynomial.

Proof

1.1F1F2construct

Choose r large enough that every kernel and quotient of OPkn↠OZ with polynomial P, over every field, is r-regular. For any Hilbert family on T, its ideal I and quotient are base-flat: the ambient structure sheaf is base-flat, so the Tor sequence gives this for I. They are finitely presented, locally by descent to a flat Noetherian stage as in [F1]. Thus the section sequence is an exact sequence of vector bundles 0→π∗I(r)→WT→π∗OZ(r)→0, with W=H0(PSn,O(r)) and quotient rank P(r), compatible with every base change. If the rank is impossible the functor is empty. Otherwise it gives a natural map to G=Gr⁡S(W,P(r)).

2.1F1F2step 1.1construct

On G, let K be the kernel of its universal quotient. On PGn form F=coker⁡(π∗K⊗O(−r)→O), with the map obtained by evaluation. Since the image is an ideal, F is the structure sheaf of a closed finitely presented subscheme. Let HP⊆G be its polynomial-P universal flattening stratum from [F2]. For every Hilbert family, evaluation generates I(r) by [F1], so the cokernel reconstruction is exactly its structure sheaf and the map to G factors through HP.

3.1F1step 1.1step 2.1algebra∎

Conversely a map T→HP gives a flat family with polynomial P. The universal rank-P(r) quotient J of WT maps to its section module because evaluation kills KT. That map is surjective by [F1] applied to the reconstructed ideal and structure sheaf. Both source and target are locally free of the same rank, so it is an isomorphism. Thus the recovered Grassmannian quotient is the original one. These two constructions are inverse for every T, and commute with every pullback. This proves representability and the universal-family assertion, including nonreduced test schemes.

Depends on

Used by

Dependency tree · two levels

32 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