Alphabeta Math
CorollaryStatement: 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.

Finite morphisms are proper

Statement

Assume the Axiom of Choice. Every finite morphism of schemes is proper. No Noetherian, reducedness or nonemptiness hypothesis is used, the empty morphism and the zero ring are included, and the Axiom of Choice enters only through the universal closedness of finite morphisms.

Facts & Assumptions

Given: The Axiom of Choice and a finite morphism f:X→S.

[F1]

A morphism f:X→S is finite when for every affine open U=Spec⁡A⊆S the inverse image is affine, f−1(U)=Spec⁡B, and the induced A-algebra B is module-finite over A; the zero ring is allowed. (Finite morphisms of schemes)

[F2]

Every finite morphism is affine; the finite-to-affine implication follows directly from the definition and is choice-free. (Finite is affine and local on its target)

[F3]

Every affine morphism of schemes is separated. (Affine morphisms are separated)

[F4]

If b1,…,bn generate an R-algebra A as an R-module then R[b1,…,bn], being a subring containing ηA(R) and every bi, contains every R-linear combination ∑iηA(ri)bi and hence all of A; so A=R[b1,…,bn] is of finite type over R. (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras)

[F5]

f is locally of finite type if every point of X has an affine open neighbourhood U with f(U) contained in an affine open V=Spec⁡A⊆S such that U=Spec⁡B and A→B is of finite type; f is of finite type if it is locally of finite type and quasi-compact. (Locally finite type and finite type morphisms)

[F6]

Every affine scheme is quasi-compact. (Every affine scheme is quasi-compact)

[F7]

A morphism f:X→S is quasi-compact if and only if the inverse image of every affine open of S is quasi-compact, and equivalently if and only if some affine open cover of S has quasi-compact inverse images. (Quasi-compactness is local on the target and survives base change)

[F8]

A scheme is a locally ringed space in which every point has an open neighbourhood which, with the restricted structure sheaf, is an affine scheme. (Schemes)

[F9]

Assume AC. Every finite morphism is universally closed. (Finite morphisms are integral and universally closed)

[F10]

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

[F11]

The Axiom of Choice states that every family of nonempty sets has a choice function. (The Axiom of Choice)

Proof

technique · direct: finiteness gives affineness and separatedness, the affine charts give local finite typeness, affineness over affine opens gives quasi-compactness, and the finite-integral theorem gives universal closedness
1.1F1F2

By [F2] the morphism f is affine: for every affine open U=Spec⁡A⊆S the inverse image f−1(U) is affine. This implication uses only the definition of finiteness and no choice.

1.2F1F4F5F8

The morphism f is locally of finite type. Let x∈X. By [F8] the point f(x) has an affine open neighbourhood V=Spec⁡A⊆S; then U:=f−1(V) is affine, say U=Spec⁡B, and contains x, and B is module-finite over A by [F1]. Hence B is of finite type over A by [F4], and f(U)⊆V; so x has a finite-type affine chart over an affine open of S, and since x was arbitrary, f is locally of finite type by [F5].

1.3F1F6F7

The morphism f is quasi-compact. For every affine open V⊆S the inverse image f−1(V) is affine by [F1] and hence quasi-compact by [F6]; by the criterion [F7] this makes f quasi-compact.

2.1F3step 1.1

By [F3] the affine morphism f is separated.

2.2F5step 1.2step 1.3

By [F5] the morphism f is of finite type, being locally of finite type by step 1.2 and quasi-compact by step 1.3.

2.3F9step 1.1

By [F9] the finite morphism f is universally closed; this is the only step that uses the Axiom of Choice.

3.1F1F2F9F10F11step 2.1step 2.2step 2.3∎

Steps 2.1, 2.2 and 2.3 give separatedness, finite typeness and universal closedness, so f is proper by [F10]. The Axiom of Choice [F11] enters exactly through [F9], whose proof uses lying over for the integral maps A→B; the finite-to-affine implication of [F2] used in step 1.1 is choice-free by its statement, and no further selection occurs. The empty morphism is included: if X=∅ then f−1(U)=∅=Spec⁡0 over any affine U, and the zero ring is module-finite over A by [F1], so f is finite and the same argument applies; the finite-type chart condition of step 1.2 is vacuous in that case and the criterion of step 1.3 is satisfied by the empty scheme, which is affine and hence quasi-compact.

Depends on

Used by

Dependency tree · two levels

49 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