Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Normalization of a classical variety by gluing affine normalizations

Statement

Assume the Axiom of Choice. Let X be an irreducible classical variety over an algebraically closed field. Then X has a normalization: a finite, surjective, birational morphism ν ⁣:Xν→X from a normal variety Xν, determined up to unique isomorphism over X. On each affine chart U with coordinate ring A, ν−1(U) is the affine normalization of U; the charts glue by identities inside the common function field, and the construction is independent of the chosen finite affine cover. A reduced reducible variety is normalized by taking the disjoint union of the normalizations of its irreducible components.

Facts & Assumptions

Given: AC, the algebraically closed field k, the irreducible classical variety X with function field k(X), a finite affine cover X=U1∪⋯∪Un by affine charts with coordinate rings Ai=k[Ui], and for each i the integral closure Bi of Ai in k(X) with the affine normalization νi ⁣:Uiν→Ui.

[F1]

Each νi is a finite, surjective, birational morphism of affine varieties, and Uiν is normal with coordinate ring Bi (The normalization of an irreducible affine variety, Normalization is finite, surjective and birational).

[F2]

Normalization commutes with principal localization: for 0≠f∈Ai, the integral closure of (Ai)f in k(X) is (Bi)f, a finite (Ai)f-module, and principal opens form a basis with coordinate ring the localization (Finite normalization commutes with principal localization, Principal opens form a basis for the Zariski topology on an affine variety, Regular functions on a principal open are the principal localization).

[F3]

All charts of X share the one function field k(X), so the integral closures Bi⊆k(X) are subrings of a common field; every open subvariety of X has a finite affine cover and morphisms between varieties agreeing on a dense open agree, while morphisms to an affine target glue over open covers (Compatible affine charts of an integral classical variety have one function field, Classical varieties have finite irreducible decompositions, Morphisms defined on an open source and agreeing on a dense open agree on their common domain, Compatible classical morphisms to an affine target glue over an open cover, Integral classical varieties in the compatible affine-atlas register).

[F4]

Affine morphisms correspond contravariantly to k-algebra homomorphisms, and a rational map to an affine target has a unique maximal representative domain; these are the tools that identify the normalizations computed from different charts (Classical affine morphisms are contravariantly equivalent to coordinate-ring homomorphisms, A rational map to an affine target has a unique maximal open domain, Classical algebraic prevarieties, regular maps, and varieties, Morphisms of classical affine varieties).

Proof

1.1F1given

Chartwise normalization. By [F1] each chart Ui has its affine normalization νi ⁣:Uiν→Ui, finite, surjective and birational, with Uiν normal and k[Uiν]=Bi⊆k(X).

2.1F2F3F4step 1.1

Compatibility on overlaps. Cover Ui∩Uj by opens principal in both charts. To construct them around a point, choose DUi(f)⊆Uj, then DUj(g)⊆DUi(f) containing the point. On DUi(f) write g=a/fm with a∈Ai by [F2]; since DUj(g) is contained there, it equals DUi(fa). Thus each such open has coordinate ring computable as a localization of either chart; by [F2] the integral closure over D(f) computed from the i-side is (Bi)f and from the j-side is the corresponding localization of Bj, and both equal the integral closure of the common ring of D(f) inside the common field k(X), hence agree as subrings of k(X). The anti-equivalence [F4] therefore produces a canonical isomorphism Uiν∣D(f)≅Ujν∣D(f) over D(f); on triple overlaps these identifications satisfy the cocycle condition because all of them are the identity of the common subring of k(X), and different choices of f agree by the same uniqueness.

3.1F1F2F3F4step 2.1

Gluing. Since principal opens cover each overlap and the identifications of step 2.1 are compatible, the varieties Uiν, together with their maps to X, glue along the open overlaps by the standard gluing of compatible classical charts; the maps νi agree on overlaps because they are determined by the inclusions Ai↪Bi in the common field [F3, F4], so they glue to a morphism ν ⁣:Xν→X. The glued variety Xν is normal, since normality is local and each chart is normal [F1]; it is separated because ν is finite, the diagonal over X being affine-locally cut out by the surjection Bi⊗AiBi→Bi; and the morphism ν is finite, surjective and birational because these properties are affine-local on the target and hold on every chart by [F1] and [F2].

4.1F1F2F3F4step 3.1∎

Independence and conclusion. If two finite affine covers are used, refine both to principal opens; on every such principal open the two affine normalizations agree as subrings of k(X) by [F2], so the two glued models agree over a cover and hence are canonically identified over X by [F3, F4]. Thus X has a normalization ν ⁣:Xν→X that is finite, surjective and birational from a normal variety; its uniqueness up to unique isomorphism over X is the universal property proved later on this page, and in the reducible case the disjoint union of the component normalizations is normal, finite, surjective and birational over each component, hence is a normalization of the reduced variety.

Depends on

Used by

Dependency tree · two levels

76 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