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.
Properness survives arbitrary base change
Statement
Assume the Axiom of Choice (AC). For every proper morphism and every morphism , the base-changed morphism is proper.
Facts & Assumptions
Given: AC, a proper morphism , and an arbitrary morphism of schemes.
A morphism is proper exactly when it is separated, of finite type, and universally closed. (Proper morphisms)
Arbitrary base change preserves finite-type morphisms. No Noetherian or flatness hypothesis is required. (Finite type under base change and products over a field)
A morphism is separated exactly when its diagonal is a closed immersion. (Separated morphism of schemes)
Under the canonical fibre-product identification, the diagonal after base change is the base change of the original diagonal. (The diagonal commutes with base change)
Assume AC. Every base change of a closed immersion is a closed immersion. (Closed immersions are affine quotients and survive base change)
A morphism is universally closed exactly when every base change along a scheme over its target is a closed map. (Universally closed morphisms)
Iterated base changes are canonically isomorphic, compatibly with their induced morphisms. (Iterated base change)
AC says that every family of nonempty sets admits a choice function. (The Axiom of Choice)
Exact AC use: AC is used only in [F5], whose affine-quotient proof states AC as a hypothesis. The proof of finite-type stability in [F2] and the universal-closedness argument from [F6]--[F7] do not use AC.
Proof
By [F1], is separated, of finite type, and universally closed; in particular, its diagonal is a closed immersion by [F3].
By [F2], the base change is of finite type.
By [F4], the diagonal is the base change of . By the AC-qualified [F5] it is a closed immersion, so [F3] makes separated. This is the only use of AC in the argument.
Let be any morphism. By [F7], the base change of to is canonically isomorphic, compatibly with its projection to , to the base change of along the composite . Since is universally closed by [F1], [F6] says this latter map is closed. Thus every base change of is closed, and [F6] makes universally closed.
The morphism is separated by step 1.3, of finite type by step 1.2, and universally closed by step 1.4. Hence it is proper by [F1]. If is empty its pullback is empty; if is empty then and are empty. Zero-ring affine charts remain empty under base change. For the identity , the assertion returns . Nonreduced schemes and arbitrary bases are covered without additional hypotheses. There are no endpoint or equivalence cases.
Depends on
Used by
- Euler characteristic in a proper flat family is locally constant Corollary
- Upper semicontinuity of fibre cohomology dimensions Corollary
- Cohomology and base-change map Definition
- Incidence projection has closed determinantal image Example
- Chow lemma for proper Noetherian schemes Lemma
- Fibres of proper morphisms are proper Lemma
- Finite-stage descent of properness for finitely presented schemes Lemma
- Flat field extension commutes with coherent cohomology Lemma
- Morphisms from a proper scheme to a separated one are proper Lemma
- Coherent higher direct images under proper morphisms Theorem
- Cohomology and base change for proper flat coherent families Theorem
- Properness descends through fpqc base change Theorem
Dependency tree · two levels
45 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, Lemma 29.42.5 (tag 01W4) (standard reference, not scraped)