Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The affine-line coordinate, local, and function-field dictionary

Example

Assume the Axiom of Choice, inherited from the Nullstellensatz route. Let k be algebraically closed and X=Ak1 with coordinate t. Then k[X]=k[t], OX,a=k[t](ta) with residue field k, and k(X)=k(t). The principal open D(t)=k{0} has coordinate ring k[t,t1] and the same function field. The morphism ϕ:A1A1, tt2, pulls back the target coordinate u to t2. These calculations hold in every characteristic.

Facts & Assumptions

Given: AC, an algebraically closed field k, the affine line X=Ak1 with coordinate t, and a point ak. Consider also its principal open D(t) and the polynomial map tt2.

[F1]

For the zero ideal in k[t], the vanishing ideal of its locus is its radical (Classical affine algebraic sets correspond to radical ideals, and irreducible sets to prime ideals).

[F2]

Coordinate rings are quotients by vanishing ideals (The coordinate ring of a classical affine algebraic set).

[F3]

The local ring at a point is localization at its evaluation ideal (The classical affine local ring is localization at the point's maximal ideal).

[F4]

The function field is the fraction field (The function field of an irreducible classical affine variety).

[F5]

Principal-open sections identify with principal localization (Regular functions on a principal open are the principal localization).

[F6]
[F7]

Coordinate substitution describes pullback of affine morphisms (Classical affine morphisms are contravariantly equivalent to coordinate-ring homomorphisms).

[F8]

Nonempty affine opens have the same function field (The function field is independent of the chosen nonempty principal affine open).

Verification

technique · direct
1.1

The polynomial ring k[t] is a domain: for two nonzero polynomials the product of their nonzero leading coefficients is the nonzero leading coefficient of their product. Thus its zero ideal is radical. F1 gives I(A1)=(0)=(0), so F2 gives k[X]=k[t]/(0)=k[t]. F4 gives k(X)=Frac(k[t])=k(t).

F1F2F4givenalgebra
2.1

Evaluation at ak has kernel (ta): for p(t)=j=0rcjtj, the identity p(t)p(a)=(ta)j=1rcji=0j1tj1iai proves divisibility when p(a)=0, and the converse follows by evaluation. F3 therefore identifies the local ring with fractions p/q where q(a)0. Its maximal ideal consists of fractions with p(a)=0 and its residue map is p/qp(a)/q(a). Constants make this map onto k.

F3step 1.1algebra
2.2

For f=t, D(t)=k{0} contains 1. F5 and F6 give its coordinate ring as k[t]t={p(t)/tr:r0}=k[t,t1]. The graph realization is (t,z) with tz=1, the inverse of projection being t(t,t1). F8 identifies its fraction field with k(t). For f=0 the open is empty and its function algebra zero; for f=1 the ring is k[t].

F5F6F8step 1.1algebra
3.1

The polynomial map ϕ(t)=t2 is the morphism associated by F7 to k[u]k[t], ut2. Explicitly (jcjuj)=jcjt2j; in particular u=t2, (ua)=t2a, 0=0 and 1=1. No division by 2 occurs, so this verification includes characteristic 2.

F7step 1.1algebra

Sources

Source comparison: Milne, Algebraic Geometry, v6.10, 3.17 pp. 63–64, Proposition 3.32 p. 71 and Proposition 3.26 p. 67. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

43 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