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.

Finite-dimensional projective space is proper over every base

Statement

Assume the Axiom of Choice. Let S be a scheme and let n≥0. Then the structure morphism π:PSn⟶S is proper. No Noetherian, field, reducedness or nonemptiness hypothesis is imposed on S, and the empty base is included.

Facts & Assumptions

Given: A scheme S, an integer n≥0, the projection π:PSn→S of the relative projective space of Relative projective space from standard charts, and the Axiom of Choice.

[F1]

The standard charts UiS for i=0,…,n are affine over S and form an open cover of PSn; over an affine base S=Spec⁡A one has UiA=Spec⁡A[xℓ(i):ℓ≠i], the overlap UiA∩UmA is the distinguished open D(xm(i))⊆UiA, and on it xℓ(m)=xℓ(i)/xm(i) for every ℓ≠m, with the convention xi(i)=1 (so that xi(m)=1/xm(i)). The charts, their overlaps and these transitions commute with base change, and π−1(V)=PVn for an open subscheme V⊆S. (Relative projective space from standard charts)

[F2]

For every scheme S and every n≥0 the diagonal ΔPSn/S is a closed immersion; hence PSn→S is separated. (The relative projective-space diagonal is closed)

[F3]

For every scheme S and every n≥0 the projection PSn→S is of finite type. (Projective space is of finite type over its base)

[F4]

A morphism is of finite type exactly when it is locally of finite type and quasi-compact. (Locally finite type and finite type morphisms)

[F5]

Assume AC. Let f:X→S be a quasi-compact morphism. Then f is universally closed if and only if every valuative diagram for f over every valuation ring R⊆K has a lift Spec⁡R→X. (Valuation lifts detect universal closedness)

[F6]

A valuative diagram for f:X→S consists of a valuation ring R⊆K with fraction field K, a morphism Spec⁡K→X and a morphism Spec⁡R→S forming a commutative square; a lift is a morphism Spec⁡R→X making both triangles commute. (Valuative uniqueness diagram)

[F7]

A subring V⊆K is a valuation ring of K if for every x∈K× at least one of x and x−1 belongs to V (Valuation rings); a valuation ring is local and its nonunits form its unique maximal ideal (A valuation ring is local).

[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]

A morphism j:U→X is an open immersion if it identifies U isomorphically with an open subscheme of X; in particular a morphism whose image lies in an open subscheme factors through it. (Open immersions of schemes)

[F10]

For commutative unital rings A,B the assignment φ↦Spec⁡(φ) gives a natural bijection Hom⁡CRing(A,B)≅Hom⁡LRS(Spec⁡B,Spec⁡A). (Affine schemes are contravariantly equivalent to commutative rings)

[F11]

Iterating the universal property of a polynomial ring gives a unique unital ring homomorphism ev⁡:R[x1,…,xm]→A extending a prescribed map R→A and sending each xi to a prescribed element ai∈A. (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras)

[F12]

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

[F13]

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

[F14]

In the spectrum of a ring, a point q is a specialization of p exactly when p⊆q. (Specialisation in a prime spectrum is reverse inclusion)

[F15]

A morphism of schemes is a morphism of the underlying locally ringed spaces, so its underlying map is continuous. (Morphisms of schemes)

Proof

technique · direct: finite type and separatedness come from the standard charts and the diagonal; existence of valuative lifts is the homogeneous-coordinate computation, with the largest coordinate selected by the valuation-ring dichotomy
1.1F2F3F4

By [F3] the morphism π is of finite type, hence by [F4] it is locally of finite type and quasi-compact, and by [F2] it is separated.

1.2F1F6F7F8F9F14F15

Let a valuative diagram for π be given: a valuation ring R⊆K with fraction field K, morphisms a:Spec⁡K→PSn and b:Spec⁡R→S, and j:Spec⁡K→Spec⁡R with π∘a=b∘j [F6]. Let sR∈Spec⁡R be the point corresponding to the unique maximal ideal of R, which exists by [F7]. For every p∈Spec⁡R we have p⊆mR, so sR is a specialization of p by [F14]. Continuity of b [F15] shows that b(sR) is a specialization of b(p). Choose an affine open V=Spec⁡A⊆S containing b(sR) [F8]. Since V is open and contains the specialization b(sR), it contains every generalization b(p): otherwise its closed complement would contain b(p) and hence its closure, including b(sR). Thus the image of b lies in V and b factors through V [F9]. Since π(a(η))=b(j(η))∈V, the map a factors through the open subscheme π−1(V)=PAn⊆PSn [F1, F9]. Replacing S by V, it suffices to construct a lift over the affine base A; when S=∅ there is no morphism Spec⁡R→S at all, so assume from here on that the diagram exists.

2.1F1F9F10step 1.2

Over the affine base the charts UiA=Spec⁡A[xℓ(i):ℓ≠i], i=0,…,n, form an open cover of PAn [F1], so the point a(η) lies in some chart UiA, which we fix; then a factors through UiA [F9]. By [F10] the morphism from Spec⁡K to the affine chart UiA corresponds to an A-algebra homomorphism ψ:A[xℓ(i):ℓ≠i]→K. Put aℓ:=ψ(xℓ(i))∈K for ℓ≠i and ai:=1∈K.

3.1F7step 2.1

The tuple a0,…,an has ai=1, so some entry is nonzero. We claim that there is an index m with am≠0 and aj/am∈R for every j. Start with m:=i and process the indices j≠i one at a time, maintaining the invariant that am≠0 and aj′/am∈R for every already processed j′. If aj=0, then aj/am=0∈R and m is kept. If aj≠0, apply [F7] to x=aj/am∈K×: either aj/am∈R, and m is kept, or am/aj∈R, and we replace m by j; in the second case aj′/aj=(aj′/am)(am/aj)∈R for every processed j′, so the invariant is preserved. At the end aj/am∈R for all j, as claimed.

4.1F1F9F10step 3.1

Since am=ψ(xm(i))≠0, the point a(η) lies in the distinguished open D(xm(i))=UiA∩UmA [F1], so a factors through the open subscheme UmA [F9]. By the transition formula xℓ(m)=xℓ(i)/xm(i) of [F1], the restriction of a to UmA corresponds by [F10] to the A-algebra homomorphism A[xℓ(m):ℓ≠m]→K sending xℓ(m) to cℓ:=aℓ/am, and cℓ∈R for every ℓ≠m by step 3.1.

5.1F10F11step 4.1

Define φ:A[xℓ(m):ℓ≠m]→R to be the A-algebra homomorphism with φ(xℓ(m))=cℓ; it exists and is unique with these values and the prescribed restriction to A by the iterated universal property of polynomial rings [F11], and its composite with A→A[x(m)] is the structure map A→R encoded by b. Let c:Spec⁡R→UmA⊆PAn⊆PSn be the morphism corresponding to φ under [F10].

6.1F10step 5.1

The composite π∘c corresponds under [F10] to the ring map A→A[x(m)]→R, which is the structure map encoded by b; hence π∘c=b.

6.2F10step 4.1step 5.1

The composite c∘j:Spec⁡K→UmA corresponds under [F10] to the A-algebra map A[x(m)]→K sending xℓ(m) to cℓ, and by step 4.1 this is the same map that the restriction of a to UmA corresponds to; hence c∘j=a.

7.1F5F12F13step 1.1step 6.2∎

Steps 1.2 through 6.2 produce a lift for an arbitrary valuative diagram for π over an arbitrary valuation ring. Since π is quasi-compact by step 1.1, [F5] shows that π is universally closed. By [F12] a separated, finite-type, universally closed morphism is proper; with steps 1.1 and 1.2 this proves that π:PSn→S is proper. The Axiom of Choice [F13] enters exactly through [F5]; the construction chose an affine open V, one chart among the finitely many, and the index m by a finite induction, so no other selection is made.

Depends on

Used by

Dependency tree · two levels

68 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