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.

Proper birational normal curves agree off finitely many points

Statement

Assume the Axiom of Choice. Let k be a field and let f:X⟶Y be a proper birational morphism of integral k-schemes of finite type whose underlying spaces have chain dimension 1 (Chain dimension and the empty-space convention), with Y normal, meaning that every local ring OY,y is an integrally closed domain (normal noetherian ring, Integral closure in an extension ring and integrally closed domains). Then there is a finite set F of closed points of Y such that the restriction of f to the open subscheme f−1(Y∖F)⊆X is an isomorphism onto Y∖F.

Facts & Assumptions

Given: A field k, integral finite-type k-schemes X,Y of chain dimension 1 with generic points ηX,ηY (Generic points of irreducible closed subsets), a proper birational morphism f:X→Y with Y normal, and the Axiom of Choice.

[F1]

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

[F2]

Finite type means locally of finite type together with quasi-compactness; locally of finite type requires compatible affine charts with a finite-type ring map. (Locally finite type and finite type morphisms)

[F3]

A proper morphism is closed, and the same holds after arbitrary base change; in particular the image of every closed subset of the source is closed in the target. (Proper morphisms are closed)

[F4]

A morphism f:X→Y of integral finite-type k-schemes is birational when f(ηX)=ηY and the stalk map OY,ηY→OX,ηX is an isomorphism. (Birational morphisms of integral finite-type schemes)

[F5]

A birational morphism of integral finite-type k-schemes that is locally of finite type admits nonempty affine charts U=Spec⁡A⊆X and V=Spec⁡B⊆Y with f(U)⊆V and an element σ∈B∖{0} such that f−1(D(σ))∩U=D(φ(σ))→D(σ) is an isomorphism. (Birational morphisms restrict to isomorphisms between principal affine opens)

[F6]

Assume AC. Let X be an integral finite-type k-scheme of chain dimension 1. Then every proper closed subset of X is a finite set of closed points of X, and every point other than the generic point is closed. (Proper closed subsets of a curve are finite)

[F7]

An integral scheme is nonempty, reduced and irreducible; every nonempty affine open is the spectrum of a domain. (Integral schemes)

[F8]

For g in a commutative ring R, the principal distinguished subset is D(g)={p∈Spec⁡(R):g∉p}, the complement of V((g)). (Principal distinguished subsets of the prime spectrum)

[F9]

A morphism j:U→X is an open immersion when it identifies U isomorphically with an open subscheme of X. (Open immersions of schemes)

[F10]

A Noetherian ring R is normal when every prime localisation Rp is an integrally closed domain. (normal noetherian ring)

[F11]

An integrally closed domain is a domain integrally closed in its fraction field. (Integral closure in an extension ring and integrally closed domains)

[F12]

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

Proof

technique · direct: shrink a birational morphism to an isomorphism over a principal open, and absorb the two finite complements plus the image of the closed complement into a finite set of closed points
1.1F1F2F4F5

By [F1] the morphism f is of finite type, hence locally of finite type by [F2]; since f is birational in the sense of [F4] and X,Y are integral finite-type k-schemes of dimension 1, the principal-open result [F5] applies. It provides nonempty affine open subschemes U=Spec⁡A⊆X and V=Spec⁡B⊆Y with f(U)⊆V, the induced ring map φ:B→A, an element σ∈B∖{0}, and the conclusion that, with U0:=D(φ(σ))=f−1(D(σ))∩U,V0:=D(σ), the restriction f∣U0:U0→V0 is an isomorphism.

1.2F6F7F8

By [F7] the rings A and B are domains, so φ(σ)≠0 in A and σ≠0 in B; hence (0)∈D(φ(σ)) and (0)∈D(σ) by [F8], which means that U0 contains the generic point ηX of X and V0 contains the generic point ηY of Y. Consequently X∖U0 and Y∖V0 are proper closed subsets of the curves X and Y, so by [F6] both are finite sets of closed points of X, respectively Y.

2.1F3step 1.2

Put F:=f(X∖U0)∪(Y∖V0)⊆Y. This is a finite set: it is the union of the finite set Y∖V0 with the image of the finite set X∖U0. Every point of F is a closed point of Y: points of Y∖V0 are closed by step 1.2, and for z∈X∖U0 the singleton {z} is closed in X by step 1.2, so its image under the closed map f of [F3] is closed in Y; that image is {f(z)}, so f(z) is a closed point of Y.

3.1F9step 1.1step 2.1

Let y∈Y∖F. Then y∈V0, because F contains the complement Y∖V0, and y∉f(X∖U0). If x∈X satisfies f(x)=y, then x∉X∖U0 and therefore x∈U0; hence f−1(Y∖F)⊆U0. Since f(U0)=V0 and Y∖F⊆V0, the scheme f−1(Y∖F) is the inverse image under the isomorphism f∣U0:U0→V0 of the open subscheme Y∖F of V0 (Open immersions of schemes [F9]), so the restriction of f∣U0 to it is an isomorphism f−1(Y∖F)→Y∖F.

4.1F6F10F11F12step 2.1step 3.1

Steps 2.1 and 3.1 exhibit the finite set F of closed points of Y whose removal makes f an isomorphism, which is the claim. The normality hypothesis of [F10] and [F11] is not used in the argument: the chart computation of [F5] only needs Y reduced, which integrality provides, and normality is a stronger hypothesis than the statement requires. The Axiom of Choice [F12] is used exactly through the curve lemma [F6] at step 1.2, whose proof assumes it; the remaining steps select nothing from an infinite family. If F=∅ the conclusion says that f is already an isomorphism, and the argument still applies because the displayed sets may be empty. ∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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