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 survive base change and composition
Statement
Assume the Axiom of Choice (AC) for the base-change assertion. For every finite morphism and every morphism , the projection is finite. Finite morphisms are closed under composition, and that composition assertion uses no AC.
Facts & Assumptions
Given: Schemes and morphisms as in the statement; AC is assumed only for the base-change assertion.
A morphism is finite when, for every affine open , its inverse image is affine and is a finite -module (Finite morphisms of schemes).
Assuming AC, a morphism is finite if there is an affine open cover of its target on which inverse images are affine and the coordinate ring maps are module-finite (Finite is affine and local on its target).
Every point of a scheme has an affine open neighbourhood; this also applies to an open subscheme (Schemes).
Every diagram of schemes has a fibre product (Existence of all scheme fibre products).
If and are ring maps, then is , with the projection induced by (Affine fibre products are spectra of tensor products).
The inverse image represents ; restricting a fibre product to opens mapping into a common open base gives the corresponding fibre product over that open (Restricting fibre products to open subschemes).
Module-finite means finitely generated as a module over the stated ring (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).
AC says every family of nonempty sets has a choice function. In this item it is used only to apply the converse local criterion [F2] (The Axiom of Choice).
Proof
Let be finite and any morphism; the fibre product exists by [F4]. Index a family by all pairs where is affine, is affine open, and . These opens cover : for each , an affine neighbourhood of exists, and the open subscheme has an affine neighbourhood of by [F3]. Taking all such pairs makes no simultaneous pointwise choice.
Let be finite, without assuming AC, and fix an arbitrary affine open . By [F1], write with finite over . This is an affine open of , so [F1] applied to gives with finite over . Fix finite module generating lists for and for . The products generate over : for , write each to obtain . Thus the inverse image of every affine is affine and finite over , so [F1] proves finite. Only two finite generating lists are fixed, with no choice from an arbitrary family.
Fix one pair from step 1.1, with and . By [F1], write with finite over . The inverse image identifies with by [F6], and hence with by [F5]. If generate as an -module, then generate as an -module, since if with , then , where is the base-change map, and every tensor is a finite sum of pure tensors. Thus the pullback over each is affine and finite.
The affine opens from step 1.1 cover , and step 2.1 verifies the affine and module-finite conditions on every member. Assuming AC, the converse in [F2] therefore shows that is finite. This is the only choice-dependent step in the base-change assertion.
If , then and the base-changed map is finite. On an empty affine chart or a chart whose pullback is empty, the coordinate ring is , generated as a module by the empty set; tensoring with the zero ring again gives zero. Identity maps are finite because their affine chart module is generated by , and the composition argument includes identity factors. There is no endpoint parameter or iff claim. The base-change conclusion carries AC exactly as stated, while the composition proof is choice-free. [F1, F5, step 1.2, step 2.1, step 3.1]
Depends on
- Finite morphisms of schemes
- Finite is affine and local on its target
- Existence of all scheme fibre products
- The Axiom of Choice
- Affine fibre products are spectra of tensor products
- Restricting fibre products to open subschemes
- Schemes
- Subalgebra generated by a subset, algebras of finite type, and module-finite algebras
Used by
Dependency tree · two levels
37 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
- Stacks Project, Morphisms of Schemes, Lemmas 29.45.5–29.45.6 (standard reference, not scraped)
- Stacks Project, Algebra, Lemma 10.7.3 (standard reference, not scraped)
- Stacks Project, Algebra, Lemma 10.36.13 (standard reference, not scraped)