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.

Classical affine points are maximal ideals

Statement

Assume the Axiom of Choice, inherited from the Nullstellensatz route. For every affine algebraic set X and A=k[X], the map xmx=ker(evx:Ak) is a bijection from X to the maximal ideals of A. Its residue-field map A/mxk is the canonical k-isomorphism given by evaluation. Both sets are empty when X is empty.

Facts & Assumptions

Given: AC, an algebraically closed field k, and an affine algebraic set X with coordinate ring A.

[F2]

Evaluation in the polynomial ring has maximal kernel (xiai)i (Evaluation at a point has kernel (x_1-a_1, ..., x_n-a_n)).

[F3]

Ideals of the quotient correspond to ideals upstairs containing I(X) (Correspondence theorem: ideals of R/I correspond to ideals of R containing I).

[F4]

Maximal ideals upstairs are uniquely the coordinate-point ideals (Over an algebraically closed field, every maximal ideal is an evaluation ideal).

Proof

technique · direct
1.1

At xX, evaluation on R kills I(X) and hence defines evaluation on A; constants make it surjective. Its kernel is maximal by the same argument as F2, or by correspondence with the maximal evaluation ideal upstairs. Two points with equal kernels have equal inverse images upstairs, and F4 makes the points equal.

F1F2F3F4given
2.1

If M is maximal in A, its inverse image in R is maximal by F3. F4 identifies it with the evaluation ideal at a unique x. Since it contains I(X), xV(I(X))=X. Thus M=mx. Evaluation induces a bijection A/mxk: equality of values is exactly equality modulo the kernel, and every constant is attained. It preserves all operations. For X=, A=0 has no proper, hence no maximal, ideals.

F1F3F4step 1.1F5

Sources

Source comparison: Milne, Algebraic Geometry, v6.10, Example 2.13, 2.20, and §3e, pp. 41, 43, 65. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.

Depends on

Used by

Dependency tree · two levels

23 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