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 is affine-local on source and target
Statement
Being locally of finite type is affine-local on both source and target. A quasi-compact morphism locally of finite type is of finite type; equivalently, over each affine target open it may be tested on a finite affine source cover.
Facts & Assumptions
Given: A morphism and affine source and target covers.
Proof
Restricting a finite-type ring map to distinguished affine opens localizes the map and retains a finite generating set, so the condition survives affine refinement.
Conversely, let be an affine target and an affine source open. If a source cover already verifies local finite type, quasi-compactness of and the principal-open refinement lemma give a finite distinguished cover for which every is a finite-type -algebra. Choose finitely many localized generators on each member and clear their finitely many denominators. Since , the standard finite-localization criterion then shows that is finite type over . This is the ring argument in Stacks Project, Tag 01T2.
Refining target overlaps by distinguished opens gives the same argument on the target side. Finally, quasi-compactness of supplies a finite affine source subcover over each affine target open, so locally finite type plus quasi-compactness is exactly finite type.
Depends on
Used by
Dependency tree · two levels
16 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, Lemma 15.2 (standard reference, not scraped)