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.

Maps to projective space equal generating line-bundle data

Statement

Assume the Axiom of Choice as inherited from the projective-space and sheaf constructions (The Axiom of Choice). Let S be a scheme, X an S-scheme and n≥0. For an S-morphism φ:X→PSn put φ⟼(φ∗O(1); φ∗x0,…,φ∗xn), where x0,…,xn∈Γ(PSn,O(1)) are the universal coordinate sections (Relative projective space from standard charts, Relative very ampleness in the finite projective-space convention). Then this assignment is a natural bijection between

  • the set of S-morphisms φ:X→PSn, and
  • the set of isomorphism classes of pairs (L;s0,…,sn) consisting of an invertible OX-module L together with global sections s0,…,sn which generate L (Global generation by the evaluation map),

where (L;si)≅(L′;si′) means an isomorphism L→L′ carrying si to si′ for all i. Naturality means compatibility with base change X′→X and with morphisms S′→S. The case n=0 is included: both sides are singletons over each X-component, corresponding to the trivial line bundle with its unit section.

Facts & Assumptions

Given: A scheme S, an S-scheme X, an integer n≥0, the relative projective space PSn with its standard charts Ui, and the Axiom of Choice as inherited.

[A1]

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

[F1]

The sheaf O(1) on PSn has global sections x0,…,xn, the universal coordinate sections: on the chart Ui with frame ei one has xi∣Ui=ei and xj∣Ui=xj(i)ei for j≠i, and these local sections glue by the transition formulas ej=xj(i)ei, equivalently ei=xi(j)ej; they generate O(1) because xi is a frame on Ui. (Relative projective space from standard charts, Relative very ampleness in the finite projective-space convention)

[F2]

(Universal property.) For an S-scheme X, an invertible OX-module L and generating sections s0,…,sn∈Γ(X,L), there is a unique S-morphism φ:X→PSn with φ∗O(1)≅L under an isomorphism carrying φ∗xi to si, and with φ−1(D+(xi))=Xsi; on Xsi∩Xsj the ratios satisfy xj(i)∘φ=sj/si. (Generating line-bundle sections define a morphism to projective space)

[F3]

Two S-morphisms X→PSn agree if they agree on an open cover of X, and a morphism is determined by its restrictions. (Morphisms of schemes are local on compatible open covers)

[F5]

Pullback of sections is functorial: for φ:X→Y, sections t∈Γ(Y,M) and an open V⊆Y one has φ∗(t∣V)=(φ∗t)∣φ−1(V), and pullback of invertible sheaves is invertible. (Relative projective space from standard charts)

Proof

technique · direct: pull back the universal data along a morphism, apply the universal property to produce a morphism from data, and verify that the two constructions are inverse by comparing chart ratios and using localness of morphism equality
1.1F1F5algebra

Data attached to a morphism. Let φ:X→PSn be an S-morphism. Then Lφ:=φ∗O(1) is an invertible OX-module and the pullbacks si:=φ∗xi∈Γ(X,Lφ), i=0,…,n, generate Lφ: on φ−1(Ui) the section si is the pullback of the frame xi∣Ui=ei, hence a frame there, and the sets φ−1(Ui) cover X.

1.2F2construct

The universal property in the reverse direction. Conversely, given an invertible L and generating sections s0,…,sn, [F2] supplies an S-morphism Φ(L;s):X→PSn with Φ∗xi corresponding to si under an isomorphism Φ∗O(1)≅L and with Φ−1(D+(xi))=Xsi. The construction depends only on the isomorphism class of (L;si): an isomorphism α:L→L′ with α(si)=si′ transports a trivialisation of Φ∗O(1) by L into one by L′.

1.3F4cases: n=0

The case n=0. Here PS0≅S by [F4], so the left side is the singleton {structure morphism X→S}. On the right side, a pair (L;s0) with s0 generating L has s0 a global frame: the evaluation map OX→L is an isomorphism. Mapping (L;s0) to the isomorphism class of the trivialisation it defines identifies all such pairs with the single class of (OX;1), so both sides are singletons; the unique morphism X→PS0 corresponds to the unit section of OX.

2.1F2step 1.1step 1.2

The two constructions are inverse: data-to-morphism-to-data. Start with data (L;s0,…,sn) and let φ=Φ(L;s). Then the data attached to φ in step 1.1 are (φ∗O(1);φ∗x0,…,φ∗xn), which by [F2] is isomorphic to (L;s0,…,sn) under the very isomorphism used to define Φ; hence the composite data ↦ morphism ↦ data is the identity on isomorphism classes.

2.2F2F3step 1.1step 1.2

The two constructions are inverse: morphism-to-data-to-morphism. Let φ:X→PSn be an S-morphism and let (Lφ;si=φ∗xi) be its data as in step 1.1. Let ψ=Φ(Lφ;s) be the morphism supplied by step 1.2. Then ψ−1(D+(xi))=Xsi=φ−1(D+(xi)) and on Xsi the chart coordinates agree: xj(i)∘ψ=sj/si=φ∗(xj)/φ∗(xi)=xj(i)∘φ by [F2] and the definitions. Since the open sets Xsi cover X, [F3] gives ψ=φ.

2.3F2step 1.1step 1.2

Naturality. For a morphism g:X′→X the data of φ∘g are the pullbacks along g of the data of φ, and Φ is compatible with this operation because the universal property [F2] is: the morphism associated to the pulled-back data is Φ(L;s)∘g, by uniqueness in [F2]. The same uniqueness gives compatibility with base change S′→S.

3.1

Conclusion. Step 1.1 attaches generating line-bundle data to every morphism, step 1.2 produces a morphism from data, steps 2.1 and 2.2 show the two operations are mutually inverse on isomorphism classes, step 2.3 gives naturality, and step 1.3 covers n=0. The Axiom of Choice [A1] is inherited from the projective-space and sheaf constructions; no choice is made here. [A1, step 1.2, step 2.1, step 2.2, step 2.3, step 1.3] \qed

Depends on

Used by

Dependency tree · two levels

27 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