Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Birational morphisms of integral finite-type schemes

Definition

Let k be a field and let X and Y be integral k-schemes of finite type (Integral schemes, Locally finite type and finite type morphisms). Let ηX and ηY be their generic points (Generic points of irreducible closed subsets) and let K(X)=OX,ηX,K(Y)=OY,ηY be their function fields; by Function field of an integral finite-type scheme these stalks are fields and are canonically identified with the fraction fields of the coordinate rings of every nonempty affine open of X, respectively Y.

A morphism of k-schemes f:X→Y is birational when

  1. f(ηX)=ηY, and
  2. the map on stalks OY,ηY→OX,ηX induced by f (Morphisms of schemes) is an isomorphism.

Conditions (1) and (2) are the form taken by the definition of a birational morphism of schemes (Stacks Project, Definition 29.51.1, tag 01RO) for integral schemes: for such X and Y the generic points ηX and ηY are the generic points of the unique irreducible components, and the local rings at them are the function fields. Thus a birational morphism identifies the function field of Y with the function field of X.

Depends on

Used by

Dependency tree · two levels

28 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