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.
Finite type need not mean finite presentation
Statement refuted
Every finite-type morphism is of finite presentation.
Facts & Assumptions
Given: Let be a field, , and . The ideal is not finitely generated: a finite list of its elements involves only finitely many variables and cannot generate a later variable.
A finite-type morphism is locally defined by finite-type ring maps Locally finite type and finite type morphisms.
A locally finite-presentation morphism is locally defined by finitely presented ring maps Locally finite presentation morphisms.
Counterexample
The quotient map is generated as an -algebra by the empty set, so it is of finite type and its affine scheme morphism is finite type.
The source is the single point corresponding to . Every affine target neighbourhood contains some with . Modulo , such an is a nonzero scalar. The vector space has basis given by the classes of the , and localization at leaves it infinite-dimensional because acts on it by that nonzero scalar. Hence is not finitely generated over , so itself is not finitely generated. Thus is not finitely presented on any target neighbourhood of the source point. By [F2], the affine morphism is not locally of finite presentation and therefore not of finite presentation.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- The Stacks Project, Morphisms of Schemes, Section 22 (standard reference, not scraped)