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.
Constant fibre polynomial does not give flatness over a nonreduced base
Statement refuted
Every closed subscheme of finite presentation in a projective family whose geometric fibres have one fixed Hilbert polynomial defines a member of that fixed-polynomial Hilbert functor.
Facts & Assumptions
Given: AC and DC, a field , , , and defined by the homogeneous ideal in coordinates .
Hilbert families require base-flatness as well as finite presentation (Hilbert functor of flat finitely presented projective families). Universal flattening uses scheme structure, not merely a partition of the points (Universal scheme theoretic flattening by Hilbert polynomial).
Counterexample
The scheme is supported in and there has algebra . Its inclusion has finite presentation. The base has one geometric fibre, and after any extension of its residue field that fibre is one reduced point. Its Hilbert polynomial is therefore the constant polynomial .
Nevertheless is not flat over : tensoring the inclusion with gives the zero map from the nonzero module to . Tensoring has destroyed injectivity. Thus is excluded from the Hilbert functor by [F1]. Its flattening locus for polynomial is the closed subscheme , since after a map the quotient is locally free of rank one exactly when maps to zero; a surjection of locally free rank-one modules must be an isomorphism. The stratum and the base have the same underlying point but different scheme structures.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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.