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 morphisms of classical varieties
Definition
Let be an algebraically closed field and let be a morphism of classical varieties over in the reduced, separated, finite-type register of Classical algebraic prevarieties, regular maps, and varieties, allowing reducible and empty varieties. Here an affine open means an open subspace isomorphic to a reduced affine algebraic set with its regular-function sheaf; it need not be irreducible or be one particular principal open. In the irreducible case this agrees with Integral classical varieties in the compatible affine-atlas register and Morphisms of classical affine varieties. The empty affine model has the zero coordinate ring and is allowed as an inverse image.
An affine open subset is finite for when is affine and the pullback homomorphism of regular functions presents the coordinate ring as a finite -module (Affine open subsets of a classical affine variety, A classical affine variety, Affine morphisms are contravariantly equivalent to coordinate-ring homomorphisms, Subalgebra generated by a subset, algebras of finite type, and module-finite algebras, Generated submodule, cyclic and finitely generated modules, module basis and free module).
The morphism is finite when admits a finite cover by affine open subsets that are finite for .
Affine-locality, recorded with the definition. The condition does not depend on the chosen cover: if some finite affine cover consists of subsets finite for , then every affine open subset is finite for . On an affine target this is the affine-communication computation of Milne's Lemma 8.19: if is a -algebra and the localisations are finite modules over for elements generating the unit ideal, then finitely many of those local generators, cleared of denominators, generate as an -module. The passage to an arbitrary affine open of a general is Milne's Proposition 8.21, whose proof embeds into a product of finitely many affine coordinate rings and compares the canonical morphism with over the members of the cover. Consequently finiteness is affine-local on the target: it may be tested on the members of any one finite affine cover of by affine opens.
Restriction. Finiteness is preserved by restriction to open subvarieties of the target: if is finite and is open, then the restriction is finite, because an affine open subset of is an affine open subset of .
Depends on
- Classical algebraic prevarieties, regular maps, and varieties
- Morphisms of classical affine varieties
- Integral classical varieties in the compatible affine-atlas register
- A classical affine variety
- Subalgebra generated by a subset, algebras of finite type, and module-finite algebras
- Generated submodule, cyclic and finitely generated modules, module basis and free module
- Affine open subsets of a classical affine variety
- Affine morphisms are contravariantly equivalent to coordinate-ring homomorphisms
Used by
- Birational quasi-finite maps to normal targets are open immersions Corollary
- Finite fibres and an open immersion do not make a map finite Counterexample
- The cusp normalization is bijective but not an isomorphism Counterexample
- The normalization of an irreducible affine variety Definition
- A finite birational morphism onto a normal variety is an isomorphism Lemma
- Finite morphisms are closed with finite fibres Theorem
- Zariski's Main Theorem: open immersion followed by a finite morphism Theorem
Dependency tree · two levels
36 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
- J. S. Milne, Algebraic Geometry (2025 version), Ch. 8 §c: Definition 8.17, Lemma 8.19, Proposition 8.21 and Summary 8.22 (standard reference, not scraped)