Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

A classical affine variety has a domain as its coordinate ring, and conversely

Statement

Let k be an algebraically closed field and let XAkn be a nonempty affine algebraic set. Then X is a classical affine variety if and only if its coordinate ring k[X] is an integral domain.

Facts & Assumptions

Given: An algebraically closed field k and a nonempty affine algebraic set XAkn.

[L1]

The coordinate ring of X is k[X]=k[x1,,xn]/I(X) (The coordinate ring of an affine algebraic set).

[L2]

A nonempty affine algebraic set is irreducible exactly when its vanishing ideal is prime (Affine algebraic sets correspond to radical ideals, and irreducible ones to prime ideals).

[L3]

For a commutative ring R and ideal P, the quotient R/P is an integral domain if and only if P is prime (R/P is an integral domain if and only if P is a prime ideal).

Proof

technique · direct
1.1

By [L2], the set X is a classical affine variety exactly when I(X) is a prime ideal of k[x1,,xn].

L2given
1.2

By [L1] and [L3], the coordinate ring k[X] is an integral domain exactly when the ideal I(X) is prime.

L1L3
2.1

Steps 1.1 and 1.2 prove that X is a classical affine variety if and only if k[X] is an integral domain.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

14 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