Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Dominant maps pull back function fields functorially

Statement

Assume the Axiom of Choice, inherited from the Nullstellensatz route. A dominant rational map Φ:XY of affine varieties induces a canonical injective k-homomorphism Φ:k(Y)k(X). It agrees with pullback of regular functions wherever defined, is independent of representatives, preserves identities, and reverses composition of dominant rational maps.

Facts & Assumptions

Given: AC, affine varieties X,Y over algebraically closed k, and a dominant rational map Φ:XY.

[F1]

Function fields are fraction fields of coordinate domains (The function field of an irreducible classical affine variety).

[F2]

Regular functions on a nonempty open embed faithfully into the ambient function field (Regular functions on a nonempty open embed in the affine function field).

[F3]

Dominant maps have dense images and remain dominant on nonempty open restrictions (Dominant classical morphisms and rational maps).

[F4]

An injective domain map to a field extends uniquely to an injective map of fraction fields (Every injective ring map from a domain into a field factors uniquely through its field of fractions).

[F5]

Dominant rational maps compose independently of representatives (Dominant rational maps compose on nonempty open domains).

[F6]

Morphisms pull back regular functions on target opens (A classical morphism pulls Zariski closed sets back to closed sets).

[F7]

Polynomial functions identify faithfully with coordinate-ring elements (Polynomial functions on an affine algebraic set are its coordinate ring).

[F8]

The zero set of a polynomial function is closed (Classical affine zero loci form the Zariski closed sets).

Proof

technique · direct
1.1

Take a representative ϕ:UY. Pullback maps B=k[Y] into OX(U), and F2 embeds the latter into K=k(X). If b has zero image, F2 says bϕ is the zero function on U. Its closed zero locus in Y contains the dense image of ϕ, so b vanishes everywhere on Y and is zero as a coordinate function. Thus the composite BK is injective and fixes k.

F1F2F3givenF7F8
2.1

F4 extends that injection uniquely to Φ:k(Y)K by a/bϕ(a)/ϕ(b). Here b0 has nonzero pullback by step 1.1, so the quotient is defined. If two representatives agree on a nonempty open, each pulled-back coordinate function agrees there; restriction compatibility and injectivity in F2 make their images in K equal. Uniqueness in F4 then identifies their field maps.

F2F4step 1.1algebra
3.1

Let s be regular on a nonempty target open W, with a quotient expression s=a/b on a nonempty subopen. By F3 the inverse image of that subopen is nonempty open. F6 pulls s back regularly there, and its value is (aϕ)/(bϕ). F2 identifies this fraction with the field element in step 2.1. By restriction compatibility, this also proves agreement on the whole nonempty inverse-image domain.

F2F3F6step 2.1algebra
4.1

For a composable dominant rational map Ψ:YZ, F5 supplies a nonempty composition domain. For a coordinate function c on Z, substitution there gives c(ψϕ)=(cψ)ϕ. Step 3.1 identifies the right side with Φ(Ψ(c)). F2 gives equality in k(X), and F4 extends it from coordinate-ring elements to all fractions. Thus (ΨΦ)=ΦΨ. Identity pullback fixes every fraction.

F2F4F5step 3.1algebra

Sources

Source comparison: Milne, Algebraic Geometry, v6.10, §5k and Proposition 5.38, pp. 116–117. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.

Depends on

Used by

Dependency tree · two levels

37 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