Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-10-02
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.

Birational smooth proper curves are isomorphic

Statement

Assume the Axiom of Choice. Let C and D be smooth proper geometrically integral curves over a field k. Every birational rational map φ:C⇢D, that is, every dominant rational map whose pullback k(D)→k(C) on function fields is an isomorphism, is represented by a k-isomorphism C→D. In particular every dominant k-morphism C→D which is birational as a morphism of integral finite-type schemes is an isomorphism.

Facts & Assumptions

Given: A field k, smooth proper geometrically integral k-curves C,D, and a birational rational map φ:C⇢D.

[F1]

Under Choice, for smooth proper geometrically integral k-curves the assignment f↦f∗ is a bijection from dominant k-morphisms C→D onto injective k-algebra homomorphisms k(D)↪k(C). (Smooth proper curves, dominant morphisms and function fields)

[F2]

A rational map X⇢Y is an equivalence class of pairs (U,φU) with U nonempty open and φU:U→Y a k-morphism; it is dominant when a representative has dense image; a morphism of integral finite-type k-schemes is birational when it maps the generic point to the generic point and induces an isomorphism on function fields. (Rational maps of integral finite-type schemes, Birational morphisms of integral finite-type schemes)

[F3]

A curve over k is a nonempty geometrically integral, separated, finite-type k-scheme of chain dimension one; a smooth proper curve is smooth and proper over k, in particular separated. (Curves over a field)

[F4]

Under Choice every rational map from a smooth curve to a proper k-scheme extends to a morphism, uniquely. (Rational maps from a smooth curve to a proper scheme are morphisms)

[F5]

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

Proof

technique · direct; transport an isomorphism of function fields through the bijection of the function-field equivalence in both directions and cancel
1.1F1F2F3F4F5given

Let φ:C⇢D be a birational rational map and let α:k(D)→k(C) be the pullback induced by a representative φU:U→D; the definition of birationality makes α an isomorphism of k-algebras [F2]. In particular α is injective, so under Choice [F5] and [F1] there is a unique dominant k-morphism F:C→D with F∗=α, and F represents the rational map φ because F extends the representative and representatives of a rational map with the same generic pullback agree [F2, F4].

2.1F1step 1.1

Similarly α−1:k(C)→k(D) is an injective k-algebra homomorphism, so it is the pullback of a unique dominant k-morphism G:D→C [F1].

3.1F1step 1.1step 2.1

The composites satisfy (F∘G)∗=G∗∘F∗=α−1∘α=idk(D) and (idD)∗=idk(D); both F∘G and idD are dominant k-morphisms D→D with the same pullback, so by the injectivity part of the bijection [F1] they are equal. Symmetrically (G∘F)∗=idk(C) gives G∘F=idC. Hence F is an isomorphism with inverse G, and it represents φ.

4.1F1F2step 3.1

If moreover f:C→D is a dominant k-morphism which is birational in the sense of birational morphisms of integral finite-type schemes, then its pullback f∗:k(D)→k(C) is an isomorphism by definition [F2], so step 3.1 applied to the rational map represented by (C,f) produces an isomorphism representing it; as f and that isomorphism are dominant morphisms with the same pullback, they are equal by [F1], so f itself is an isomorphism.

5.1F1F4F5step 3.1step 4.1∎

Steps 3.1 and 4.1 prove both assertions; the only choice-theoretic inputs are the extension lemma [F4] and the function-field bijection [F1], both used under Choice [F5].

Depends on

Used by

Dependency tree · two levels

81 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