Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Universal property of the normalization

Statement

Assume the Axiom of Choice. Let X be an irreducible classical variety over an algebraically closed field with normalization ν ⁣:Xν→X. If f ⁣:Y→X is a dominant birational morphism from an irreducible normal variety Y, then there is a unique morphism g ⁣:Y→Xν with ν∘g=f. In the affine case the corresponding ring statement is: if A⊆B⊆Frac⁡(A) with B integrally closed, then the integral closure of A lies in B.

Facts & Assumptions

Given: AC, the algebraically closed field k, the irreducible variety X with normalization ν ⁣:Xν→X, the irreducible normal variety Y, the dominant birational morphism f ⁣:Y→X, and a finite affine cover of X by affine charts Ui with normalizations Uiν=ν−1(Ui) and coordinate rings Ai↪Bi⊆k(X).

[F1]

The normalization restricts over each affine chart to the affine normalization: Ai⊆Bi⊆k(X) with Bi the integral closure of Ai in k(X), and k[Uiν]=Bi (The normalization of an irreducible affine variety, Normalization of a classical variety by gluing affine normalizations).

[F3]

Normality of Y means every local ring OY,y is an integrally closed domain, and an integrally closed domain contains every element of its fraction field integral over it (Normal points and normal varieties, Integral closure in an extension ring and integrally closed domains).

Proof

1.1F3given

The affine ring statement: let A⊆B⊆Frac⁡(A) with B integrally closed, and let A′ be the integral closure of A in Frac⁡(A). Every a′∈A′ is integral over A⊆B, hence integral over B, and lies in Frac⁡(A)=Frac⁡(B); since B is integrally closed, a′∈B. Thus A′⊆B, and the inclusion A′↪B is a k-algebra map extending A↪B.

1.2F1F2F3F4given

Local construction. Let Ui be a chart of X and put Yi=f−1(Ui), an open subvariety of the irreducible normal variety Y, hence normal. Read the pullback of functions in the common function fields: f birational gives k(Y)=k(X)=k(Ui), and fi=f∣Yi is dominant. For b∈Bi⊆k(X)=k(Y) the element b is integral over Ai; its pullback lies in k(Y), and at every point y∈Yi the pullback of Ai is contained in the local ring OY,y (pullback of functions regular at f(y) is regular at y). The local ring OY,y is an integrally closed domain [F3], so b∈OY,y for every y∈Yi; hence b is a regular function on Yi. The resulting k-algebra map Bi→OY(Yi) extending Ai→OY(Yi) defines, on each affine chart of Yi, a morphism by the anti-equivalence [F4]; these morphisms agree by their pullback maps and glue by [F4] to a morphism gi ⁣:Yi→Uiν with ν∘gi=f∣Yi.

2.1F1F2F4step 1.1step 1.2∎

Gluing and uniqueness. On an overlap Yi∩Yj, the morphisms gi and gj have the same pullback on the common function field k(X), because both are determined by the identifications k[Uiν]=Bi⊆k(X)=k(Y); hence they agree on the dense open intersection by [F4], and they glue to a morphism g ⁣:Y→Xν over X with ν∘g=f. If g′ is another such morphism, then g and g′ have the same pullback on rational functions on Xν (both equal the given identification k(Xν)=k(X)→k(Y)), so they agree on a dense open and hence everywhere by the equality lemma [F4]; this proves uniqueness. The affine statement of step 1.1 is the chartwise content of the construction, and the morphism Xν→X is the normalization by [F1].

Depends on

Used by

Dependency tree · two levels

66 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