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.

Morphisms from a proper scheme to a separated one are proper

Statement

Assume the Axiom of Choice. Let f:X→S be proper and let g:Y→S be separated. Then every S-morphism h:X→Y is proper. No Noetherian, reducedness or nonemptiness hypothesis is used, and the empty source is included.

Facts & Assumptions

Given: The Axiom of Choice, a proper morphism f:X→S, a separated morphism g:Y→S and an S-morphism h:X→Y.

[F1]

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

[F2]

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

[F3]

For an S-morphism u:X→Y the graph morphism is Γu=(id⁡X,u):X→X×SY; its first projection is the identity and its second projection is u, and the definition alone does not assert that its image is closed. (The graph morphism over a base)

[F4]

For an S-morphism u:X→Y, with H=(upr⁡X,pr⁡Y):X×SY→Y×SY, the square with top arrow Γu, bottom arrow ΔY/S, left arrow u and right arrow H is Cartesian; thus Γu is the base change of ΔY/S along H. (The graph is a pullback of the diagonal)

[F5]

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

[F6]

Assume AC. Every closed immersion is finite, hence proper; the empty closed immersion is included. (Closed immersions are proper)

[F7]

For a morphism S′→S and an S-scheme X→S, the base change is X×SS′ with structure map the second projection. (Base change of objects, morphisms and properties)

[F8]

Assume AC. Properness survives arbitrary base change. (Properness survives arbitrary base change)

[F9]

Assume AC. A composite of proper morphisms is proper. (Properness survives composition)

[F10]

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

Proof

technique · direct: the graph of $h$ is the base change of the closed diagonal of the separated target, hence a closed immersion and therefore proper; the second projection of the fibre product is the base change of the proper morphism $f$, hence proper; and $h$ is their composite
1.1F2

Since g is separated, [F2] makes the diagonal ΔY/S:Y→Y×SY a closed immersion.

1.2F7F8

Let p:X×SY→Y be the second projection. By [F7] the fibre product X×SY with its projection p to Y is the base change of f:X→S along g:Y→S; since f is proper, the AC-qualified [F8] makes p proper.

2.1F3F4F5step 1.1

Put H=(hpr⁡X,pr⁡Y):X×SY→Y×SY, and let Γh:X→X×SY be the graph of h. By [F4] the square with top arrow Γh, bottom arrow ΔY/S, left arrow h and right arrow H is Cartesian, so Γh is the base change of ΔY/S along H. By step 1.1 the diagonal is a closed immersion, so the AC-qualified [F5] makes Γh a closed immersion.

2.2F3step 1.2

By [F3] the second projection of the graph Γh is h, so p∘Γh=h.

3.1F6step 2.1

By the AC-qualified [F6] the closed immersion Γh is finite, hence proper.

4.1F9step 3.1step 1.2step 2.2

Thus h is the composite of the proper morphism Γh of step 3.1 with the proper morphism p of step 1.2; by the AC-qualified [F9] the S-morphism h is proper.

5.1F1F6F10step 2.1step 4.1∎

The Axiom of Choice [F10] is assumed and is used only through the four AC-qualified suppliers [F5], [F6], [F8] and [F9], in steps 2.1, 3.1, 1.2 and 4.1; the diagonal, graph and pullback identifications of steps 1.1, 2.1 and 2.2 are choice-free. If X=∅ then Γh and h are empty morphisms and the same steps apply, the cited results allowing the empty fibred and zero-ring charts; if Y=∅ then X=∅ because h maps into Y; if h=id⁡X then Y=X and g=f, so the conclusion is the properness of f itself. No Noetherian, reducedness or nonemptiness hypothesis is used.

Depends on

Used by

Dependency tree · two levels

55 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