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 descends through fpqc base change
Statement
Assume the Axiom of Choice (AC). Let be an fpqc covering morphism in the page-local convention, so that is flat, surjective and quasi-compact, let be a morphism of schemes, and let be its base change along . Then is proper if and only if is proper.
Facts & Assumptions
Given: AC, an fpqc covering morphism in the page-local convention, a morphism , and its base change along .
A morphism of schemes is proper exactly when it is separated, of finite type, and universally closed; the definition applies to arbitrary schemes and assumes neither Noetherian nor finite-presentation hypotheses. (Proper morphisms)
On this page an fpqc covering morphism is a flat, surjective and quasi-compact morphism , and the singleton family of such a morphism is an fpqc cover in the family convention. (Fpqc covering morphisms)
Assume AC. For every fpqc covering morphism and every morphism , each of quasi-compactness, finite type, separatedness and universal closedness holds for if and only if it holds for the base change ; in particular each of these properties descends along . (Fpqc descent of properness components)
Assume AC. Every base change of a proper morphism is proper. (Properness survives arbitrary base change)
The base change of along is the second projection , and a property of morphisms is stable under arbitrary base change when every pullback of a morphism with that property again has it. (Base change of objects, morphisms and properties)
AC says that every family of nonempty sets has a choice function. (The Axiom of Choice)
Exact AC use: AC is used only through [F3] and [F4], each of which is stated with AC as a hypothesis. Reassembling properness from its three defining properties in steps 2.1, 2.2 and 3.1 is purely logical, and this proof selects no element from any family.
Proof
Put and let be the second projection, so that is the base change of along in the sense of [F5]. By [F2] the morphism is flat, surjective and quasi-compact, so it is an fpqc covering morphism in the page-local convention, and the hypotheses of [F3] and [F4] are satisfied by , and . The fibre product exists for arbitrary schemes, so is defined for every and every .
Suppose first that is proper. The morphism is a base change of along the arbitrary morphism , so [F4] applies with hypothesis exactly the assumed properness of , and is proper. Unfolding [F1], this says that is separated, of finite type and universally closed. This proves the forward implication.
Conversely, suppose that is proper. By [F1], is separated, of finite type and universally closed. Since is the base change of along the fpqc covering morphism (step 1.1), [F3] applies to and and shows that likewise has each of these three properties: is separated, of finite type and universally closed. This proves the reverse implication.
By [F1], the three properties established in step 2.2 make proper. Together with step 2.1 this shows that is proper if and only if is proper, which is the claim.
Degenerate cases and choice accounting. If is empty then and are empty as well, and both and are the empty morphism, which is separated, of finite type and universally closed vacuously, hence proper by [F1]; if is empty the same holds with empty. If is the identity of , then and the equivalence is tautological. None of these cases requires an extra hypothesis, and nonreduced or non-Noetherian schemes are allowed throughout because [F1] imposes no such condition. AC is declared in the statement and is used exactly through [F3] and [F4]; no other step of the argument invokes it. Both directions of the biconditional were proved, the forward one in step 2.1 and the reverse one in step 2.2.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
44 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, Descent, §35.23 (tag 02YJ) (standard reference, not scraped)
- Stacks Project, Descent, Lemma 35.23.16 (tag 02L1) (standard reference, not scraped)