Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 p:S′→S be an fpqc covering morphism in the page-local convention, so that p is flat, surjective and quasi-compact, let f:X→S be a morphism of schemes, and let f′:X×SS′⟶S′ be its base change along p. Then f is proper if and only if f′ is proper.

Facts & Assumptions

Given: AC, an fpqc covering morphism p:S′→S in the page-local convention, a morphism f:X→S, and its base change f′:X×SS′→S′ along p.

[F1]

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)

[F2]

On this page an fpqc covering morphism is a flat, surjective and quasi-compact morphism p:S′→S, and the singleton family of such a morphism is an fpqc cover in the family convention. (Fpqc covering morphisms)

[F3]

Assume AC. For every fpqc covering morphism p:S′→S and every morphism f:X→S, each of quasi-compactness, finite type, separatedness and universal closedness holds for f if and only if it holds for the base change X×SS′→S′; in particular each of these properties descends along p. (Fpqc descent of properness components)

[F4]

Assume AC. Every base change of a proper morphism is proper. (Properness survives arbitrary base change)

[F5]

The base change of f:X→S along p:S′→S is the second projection X×SS′→S′, 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)

[F6]

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

technique · direct
1.1F2F5

Put X′=X×SS′ and let f′:X′→S′ be the second projection, so that f′ is the base change of f along p in the sense of [F5]. By [F2] the morphism p 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 p, f and f′. The fibre product exists for arbitrary schemes, so f′ is defined for every f and every p.

2.1F1F4step 1.1

Suppose first that f is proper. The morphism f′ is a base change of f along the arbitrary morphism p, so [F4] applies with hypothesis exactly the assumed properness of f, and f′ is proper. Unfolding [F1], this says that f′ is separated, of finite type and universally closed. This proves the forward implication.

2.2F1F3step 1.1

Conversely, suppose that f′ is proper. By [F1], f′ is separated, of finite type and universally closed. Since f′ is the base change of f along the fpqc covering morphism p (step 1.1), [F3] applies to p and f and shows that f likewise has each of these three properties: f is separated, of finite type and universally closed. This proves the reverse implication.

3.1F1step 2.1step 2.2

By [F1], the three properties established in step 2.2 make f proper. Together with step 2.1 this shows that f is proper if and only if f′ is proper, which is the claim.

4.1F1F3F4F6step 2.1step 2.2∎

Degenerate cases and choice accounting. If S is empty then S′ and X are empty as well, and both f and f′ are the empty morphism, which is separated, of finite type and universally closed vacuously, hence proper by [F1]; if X is empty the same holds with X′ empty. If p is the identity of S, then f′=f 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