Alphabeta Math
LemmaStatement: 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 survives arbitrary base change

Statement

Assume the Axiom of Choice (AC). For every proper morphism f:X→S and every morphism S′→S, the base-changed morphism fS′:X×SS′⟶S′ is proper.

Facts & Assumptions

Given: AC, a proper morphism f:X→S, and an arbitrary morphism S′→S of schemes.

[F1]

A morphism is proper exactly when it is separated, of finite type, and universally closed. (Proper morphisms)

[F2]

Arbitrary base change preserves finite-type morphisms. No Noetherian or flatness hypothesis is required. (Finite type under base change and products over a field)

[F3]

A morphism is separated exactly when its diagonal is a closed immersion. (Separated morphism of schemes)

[F4]

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)

[F5]

Assume AC. Every base change of a closed immersion is a closed immersion. (Closed immersions are affine quotients and survive base change)

[F6]

A morphism is universally closed exactly when every base change along a scheme over its target is a closed map. (Universally closed morphisms)

[F7]

Iterated base changes are canonically isomorphic, compatibly with their induced morphisms. (Iterated base change)

[F8]

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

1.1F1F3

By [F1], f is separated, of finite type, and universally closed; in particular, its diagonal ΔX/S is a closed immersion by [F3].

1.2F1F2

By [F2], the base change fS′ is of finite type.

1.3F3F4F5F8

By [F4], the diagonal ΔXS′/S′ is the base change of ΔX/S. By the AC-qualified [F5] it is a closed immersion, so [F3] makes fS′ separated. This is the only use of AC in the argument.

1.4F1F6F7

Let T→S′ be any morphism. By [F7], the base change of fS′ to T is canonically isomorphic, compatibly with its projection to T, to the base change of f along the composite T→S′→S. Since f is universally closed by [F1], [F6] says this latter map is closed. Thus every base change of fS′ is closed, and [F6] makes fS′ universally closed.

2.1F1step 1.2step 1.3step 1.4∎

The morphism fS′ 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 X is empty its pullback is empty; if S is empty then S′ and X are empty. Zero-ring affine charts remain empty under base change. For the identity S′=S, the assertion returns f. Nonreduced schemes and arbitrary bases are covered without additional hypotheses. There are no endpoint or equivalence cases.

Depends on

Used by

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