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.

Affine algebraic sets correspond to radical ideals, and irreducible ones to prime ideals

Statement

Assume the Axiom of Choice.

Let k be an algebraically closed field.

  1. The assignments X⟼I(X),J⟼V(J) induce mutually inverse inclusion-reversing correspondences between affine algebraic sets X⊆Akn and radical ideals J⊆k[x1,…,xn].

  2. Under this correspondence, nonempty irreducible affine algebraic sets correspond exactly to prime ideals.

Facts & Assumptions

Given: An algebraically closed field k and the Axiom of Choice.

[L1]

For every subset X⊆kn and ideal J⊆k[x1,…,xn], X⊆V(J)⟺J⊆I(X), so in particular X⊆V(I(X)) and J⊆I(V(J)) (Vanishing ideals and zero loci form a Galois connection).

[L2]

For every ideal J⊆k[x1,…,xn], I(V(J))=J (Strong Nullstellensatz: I(V(I)) equals the radical of I).

[L3]

For ideals I,J one has V(I)∪V(J)=V(IJ) (Zero loci in affine space are the closed sets of the classical Zariski topology).

Proof

technique · direct
1.1L1given

Let X⊆kn be affine algebraic, say X=V(S) for some set S⊆k[x1,…,xn]. Then X⊆V(I(X)) by [L1]. The reverse inclusion holds because every element of S vanishes on X, so S⊆I(X) and therefore V(I(X))⊆V(S)=X by [L1]. Hence X=V(I(X)).

1.2L1L3givenalgebra

Conversely, assume X is nonempty and irreducible, and let fg∈I(X). Then every point of X annihilates fg, so X⊆V(fg)=V(f)∪V(g) by [L3]. Irreducibility gives X⊆V(f) or X⊆V(g), and then [L1] yields f∈I(X) or g∈I(X). Also 1∉I(X) because X≠∅. Therefore I(X) is prime.

2.1L2step 1.1

Let J⊆k[x1,…,xn] be an ideal. Then [L2] gives I(V(J))=J. Therefore J is radical exactly when I(V(J))=J. Together with step 1.1, this makes X↦I(X) and J↦V(J) inverse correspondences between algebraic sets and radical ideals.

2.2L1L2L3choosealgebra

Let X be a nonempty algebraic set. If I(X) is prime and X=Y∪Z with algebraic subsets Y=V(J) and Z=V(K), then [L3] gives X=V(JK). Applying step 1.1 and then [L2], I(X)=I(V(JK))=JK. Hence JK⊆I(X). If neither J nor K were contained in I(X), we could choose f∈J∖I(X) and g∈K∖I(X), and then fg∈JK⊆I(X) would contradict primality of I(X). So J⊆I(X) or K⊆I(X), which by [L1] means X⊆Y or X⊆Z. Since Y,Z⊆X, one has X=Y or X=Z. Thus X is irreducible.

3.1step 2.1step 2.2step 1.2∎

Steps 2.2 and 1.2 identify the irreducible algebraic sets precisely with the prime ideals under the correspondence from step 2.1.

Depends on

Used by

Dependency tree · two levels

10 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