Affine Varieties and the Nullstellensatz

Hilbert's Nullstellensatz establishes a precise dictionary between geometry (algebraic subsets of affine space over an algebraically closed field) and algebra (radical ideals of the polynomial ring). One-line statement: over an algebraically closed field

k

I (V (a)) = a

for every ideal

a \subseteq k [x_{1}, \dots, x_{n}]

. Applies throughout classical and modern algebraic geometry, commutative algebra, and elimination theory. Proved by David Hilbert in 1893.

An affine variety is the common zero locus in $A_{k}^{n}$ of a collection of polynomials. The central problem is to understand the correspondence between such geometric loci and the ideals of the polynomial ring $k [x_{1}, \dots, x_{n}]$ that cut them out. The Nullstellensatz ("theorem of zeros") resolves this in the cleanest possible way over an algebraically closed field: it shows that vanishing-set and vanishing-ideal operations are mutually inverse bijections between affine algebraic sets and radical ideals. The surprising fact is that purely geometric nonemptiness of a zero set is governed by a purely algebraic condition (an ideal being proper) — geometry forces algebra to behave. This single result underpins the entire correspondence between algebra and geometry that defines the subject.

The Core Insight

Polynomials see zeros, but they cannot distinguish a function $f$ from its powers $f^{m}$ when only the set of zeros matters: $f$ and $f^{m}$ vanish at exactly the same points. Hence the only algebraic information recoverable from a zero set is the ideal up to radical. The Nullstellensatz says this is the only obstruction — over $\overset{ˉ}{k}$ , the radical is a complete invariant. Geometry remembers exactly the radical ideal, nothing more, nothing less.

Formal Statement

Affine space and the Zariski correspondence

Let $k$ be a field with algebraic closure $\overset{ˉ}{k}$ , and fix $n \geq 1$ . Affine $n$ -space is the set $A_{k}^{n} = k^{n}$ of $n$ -tuples of elements of $k$ . Write $R = k [x_{1}, \dots, x_{n}]$ for the polynomial ring.

For a subset $S \subseteq R$ , the vanishing set is

V (S) = {p \in A_{k}^{n} : f (p) = 0 for all f \in S} .

⟳This is the simultaneous solution locus; since

V (S) = V (⟨ S ⟩)

, we lose nothing by taking

S

to be an ideal.

For a subset $X \subseteq A_{k}^{n}$ , the vanishing ideal is

I (X) = {f \in R : f (p) = 0 for all p \in X} .

⟳Closure under sums and

R

-multiples is immediate from the pointwise definition, so

I (X)

is genuinely an ideal.

A subset $X \subseteq A_{k}^{n}$ is an (affine) algebraic set if $X = V (S)$ for some $S$ . An affine variety is (in the classical convention) an irreducible algebraic set; many authors use "variety" for any algebraic set, so we state results in terms of algebraic sets.

Radical of an ideal

The radical of an ideal $a \subseteq R$ is

a = {f \in R : f^{m} \in a for some m \geq 1} .

⟳That

a

is itself an ideal follows from the binomial theorem applied to

(f + g)^{m + n}

when

f^{m}, g^{n} \in a

An ideal is radical if $a = a$ . Equivalently, $R / a$ is reduced (has no nonzero nilpotents).

Hilbert's Nullstellensatz — Weak Form

Let $k$ be algebraically closed and $a \subseteq k [x_{1}, \dots, x_{n}]$ an ideal. Then

V (a) = \emptyset ⟺ a = (1) = R .

⟳One direction is trivial (

V (R) = \emptyset

); the content is that a proper ideal always has a common zero, equivalent to every maximal ideal of

R

having residue field

k

Hilbert's Nullstellensatz — Strong Form

Let $k$ be algebraically closed. For every ideal $a \subseteq R$ ,

I (V (a)) = a .

⟳

a \subseteq I (V (a))

is elementary; the reverse inclusion is extracted from the weak form via the Rabinowitsch trick.

Consequently the maps $V$ and $I$ restrict to mutually inverse, inclusion-reversing bijections

{radical ideals of R} I, V {algebraic subsets of A_{k}^{n}} .

⟳

V (I (X)) = X

for algebraic

X

(by definition of algebraic set plus monotonicity), and

I (V (a)) = a

is the strong form; restricting domains gives a bijection.

Zariski's Lemma — the algebraic engine

Let $k$ be any field and $L$ a field that is finitely generated as a $k$ -algebra. Then $L$ is a finite (hence algebraic) field extension of $k$ .

L = k [a_{1}, \dots, a_{m}] a field ⟹ [L : k] < \infty.

⟳If some

a_{i}

were transcendental, a Noether normalization argument shows

L

could not be a finitely generated module over a polynomial subring while being a field; the integral closure forces algebraicity.

Why It Holds / Derivation

Weak Nullstellensatz from Zariski's Lemma

We prove the weak form, then deduce the strong form.

Step 1 — Reduce to a maximal ideal. Suppose

a ⊊ R

is proper. Since

R

is Noetherian (Hilbert Basis Theorem),

a

is contained in some maximal ideal

m

. It suffices to find a point

p

with

m \subseteq I ({p})

, i.e. a common zero of

m

; that point lies in

V (a) \supseteq V (m)

too... more precisely

V (a) \supseteq V (m) ∋ p

. Step 2 — Form the residue field. Let

L = R / m

. This is a field, and it is generated as a

k

-algebra by the images

\overset{x}{ˉ}_{1}, \dots, \overset{x}{ˉ}_{n}

. Thus

L

is a finitely generated

k

-algebra that is a field. Step 3 — Apply Zariski's Lemma. By [7],

L

is a finite extension of

k

. Since

k

is algebraically closed, the only finite extension is

k

itself: the canonical map

k \to L

is an isomorphism. Step 4 — Read off the point. Let

a_{i} \in k

be the unique preimage of

\overset{x}{ˉ}_{i}

under

k \sim L

. Set

p = (a_{1}, \dots, a_{n}) \in A_{k}^{n}

. For any

f \in m

, the image of

f

L

f (a_{1}, \dots, a_{n}) = f (p)

, which is

0

since

f \in m

. Hence

p \in V (m) \subseteq V (a)

, so

V (a) \neq = \emptyset

■

This also shows every maximal ideal of $R$ has the form $m_{p} = (x_{1} - a_{1}, \dots, x_{n} - a_{n})$ .

Strong Nullstellensatz via the Rabinowitsch trick

We show $I (V (a)) = a$ .

Step 1 — Easy inclusion. If

f \in a

, say

f^{m} \in a

, then for any

p \in V (a)

we have

f (p)^{m} = (f^{m}) (p) = 0

, so

f (p) = 0

. Thus

f \in I (V (a))

, giving

a \subseteq I (V (a))

. Step 2 — Set up the trick. Suppose

f \in I (V (a))

. Since

R

is Noetherian,

a = (g_{1}, \dots, g_{r})

. Introduce a new variable

y

and work in

R^{'} = k [x_{1}, \dots, x_{n}, y]

. Consider the ideal

b = (g_{1}, \dots, g_{r}, 1 - y f) \subseteq R^{'} .

⟳The hyperplane

1 = y f

excludes precisely the locus

f = 0

A^{n + 1}

, so it kills every common zero of

a

Step 3 — $b$ has no zeros. Any common zero

(p, b) \in A_{k}^{n + 1}

b

would satisfy

g_{i} (p) = 0

(so

p \in V (a)

) and

1 - b f (p) = 0

. But

p \in V (a)

forces

f (p) = 0

(since

f \in I (V (a))

), making

1 - 0 = 0

, a contradiction. So

V (b) = \emptyset

. Step 4 — Apply the weak form. By the weak Nullstellensatz,

b = R^{'}

. Hence there exist

h_{i}, h \in R^{'}

with

1 = i = 1 \sum r h_{i} g_{i} + h (1 - y f) .

⟳This is exactly the statement

1 \in b

Step 5 — Substitute $y = 1/ f$ . Pass to the field of fractions and set

y = 1/ f

(valid where

f \neq = 0

). The last term vanishes, leaving an identity in

k (x_{1}, \dots, x_{n})

1 = i = 1 \sum r h_{i} (x, \frac{1}{f}) g_{i} (x) .

⟳Substitution is a ring homomorphism

R^{'} \to k (x)

sending

1 - y f \mapsto 0

Step 6 — Clear denominators. Each

h_{i} (x, 1/ f)

is a polynomial in the

x_{j}

divided by some power of

f

. Let

m

be the largest such power. Multiplying [10] through by

f^{m}

gives

f^{m} = i = 1 \sum r \tilde{h}_{i} (x) g_{i} (x) \in a,

⟳

f^{m} \cdot h_{i} (x, 1/ f)

becomes an honest polynomial

\tilde{h}_{i} \in R

once

m \geq de g_{y}

-contribution.

with $\tilde{h}_{i} \in R$ . Therefore $f^{m} \in a$ , i.e. $f \in a$ . This proves $I (V (a)) \subseteq a$ , completing the equality. $■$

David Hilbert | 1862–1943

Hilbert proved the Nullstellensatz in his foundational 1893 paper Über die vollen Invariantensysteme, where it appeared as a tool in invariant theory alongside the Basis Theorem and the Syzygy Theorem. His revolutionary move was to abandon explicit computation of invariants in favor of existence arguments — provoking Paul Gordan's famous quip "Das ist nicht Mathematik, das ist Theologie." The Nullstellensatz, the Basis Theorem, and Hilbert's later work on number fields and logic reshaped the foundations of mathematics; the algebra–geometry dictionary it launched matured fully only with Zariski, Weil, and Grothendieck.

Building Intuition

Think of $V$ and $I$ as a "spelling" and "reading" pair. The geometry (a set of points) is what you see; the ideal is the spelling of polynomials that describe it. Many different ideals can describe the same set — for instance $(x)$ and $(x^{2})$ both have zero locus ${x = 0}$ on the line. The radical operation is a normalization: it strips away the spurious multiplicity ( $x^{2} ⇝ x$ ) that the geometry simply cannot detect. The Nullstellensatz guarantees this is the whole discrepancy: once you pass to radicals, ideals and geometry are in perfect bijection.

The weak form is the load-bearing wall. It says "a system of polynomial equations with no algebraic obstruction (i.e. you cannot derive $1 = 0$ from them) actually has a solution" — provided you allow coordinates in an algebraically closed field. This is the multivariate, finite-degree analogue of the Fundamental Theorem of Algebra, which is exactly the case $n = 1$ .

Reading the dictionary physically

A polynomial system is a set of constraints; the variety is the configuration space satisfying them (think kinematic constraints of a linkage, or conserved-quantity level sets). The weak form is a consistency theorem: either the constraints are jointly satisfiable, or you can algebraically combine them to produce the contradiction $1 = 0$ — there is no third option over $\overset{ˉ}{k}$ . The radical captures the idea that physical observables only "see" the actual solution set, not the algebraic redundancy in how you wrote the equations.

The radical collapses multiplicity: $V(x^2)=V(x)$ as point sets, but the ideals differ

Worked Examples

Recovering a radical from a generated ideal

Given:

k = C

R = C [x, y]

, and the ideal

a = (x^{2}, x y)

. Find

V (a)

, then

I (V (a))

, and verify the Nullstellensatz. Step 1 — Compute $V (a)$ . A point

(a, b)

lies in

V (a)

iff

a^{2} = 0

and

ab = 0

, i.e.

a = 0

(and

b

arbitrary). So

V (a) = {(0, b) : b \in C} = V (x) = the y -axis .

⟳

x^{2} = 0 \Rightarrow x = 0

in a field; then

x y = 0

is automatic.

Step 2 — Compute $I (V (a))$ . The vanishing ideal of the

y

-axis is exactly

(x)

, since a polynomial vanishes on all

(0, b)

iff it has no term free of

x

, iff it is divisible by

x

. Step 3 — Compute $a$ directly. Clearly

x \in a

since

x^{2} \in a

. And

a \subseteq (x) = (x)

since

a \subseteq (x)

. Hence

a = (x)

. Step 4 — Verify.

I (V (a)) = (x) = a

. ✓

V (a) = y -axis, I (V (a)) = (x^{2}, x y) = (x) .

Note

a \neq = a

: the original ideal is not radical, and the geometry only recovered its radical.

A system with no solutions — weak form in action

Given:

k = C

, the system

x^{2} + y^{2} = 1

x^{2} + y^{2} = 4

C [x, y]

. Decide solvability and exhibit the algebraic certificate. Step 1 — Form the ideal.

a = (x^{2} + y^{2} - 1, x^{2} + y^{2} - 4)

. Step 2 — Detect inconsistency. Subtract the generators:

(x^{2} + y^{2} - 1) - (x^{2} + y^{2} - 4) = 3 \in a .

⟳An ideal is closed under subtraction; the variables cancel exactly.

Step 3 — Conclude $a = R$ . Since

3 \in a

and

3

is a unit in

C

, we get

1 = \frac{1}{3} \cdot 3 \in a

, so

a = (1)

. Step 4 — Apply the weak Nullstellensatz. By [4],

a = (1) ⟺ V (a) = \emptyset

No common solution exists; certificate: 1 = \frac{1}{3} (g_{1} - g_{2}), g_{i} the generators.

The two "concentric circles of different radii don't meet" is, algebraically, the derivation of

1 = 0

Common Misconceptions

The hypothesis $k = \overset{ˉ}{k}$ is essential — do not drop it. Over a non-algebraically-closed field both forms can fail spectacularly. The map "maximal ideals ↔ points" breaks: there are maximal ideals with residue field a proper extension of

k

. The weak form fails because proper ideals can have empty zero locus in $k^{n}$ while still being proper. Always check the field is algebraically closed before invoking [4] or [5].

A second trap: the Nullstellensatz says $I (V (a)) = a$ , not $I (V (a)) = a$ . Forgetting the radical leads to false claims about ideal equality.

Failure over $\mathbb{R}$

Take $k = R$ , $R = R [x]$ , $a = (x^{2} + 1)$ . Then

V (a) = {a \in R : a^{2} + 1 = 0} = \emptyset,

⟳

x^{2} + 1

has no real root; its complex roots

\pm i \in / R

yet $a = (x^{2} + 1) \neq = (1)$ is a proper (indeed maximal!) ideal. The weak form [4] is violated. Correspondingly, $I (V (a)) = I (\emptyset) = (1) \neq = x^{2} + 1 = (x^{2} + 1)$ , so the strong form fails too. The fix is to pass to $C$ , where $V (x^{2} + 1) = {i, - i} \neq = \emptyset$ .

Why the radical, not the ideal

Over $C$ , take $a = (x^{2}) \subseteq C [x]$ . Then $V (a) = {0}$ and $I (V (a)) = I ({0}) = (x)$ . Here $I (V (a)) = (x) = (x^{2}) ⊋ (x^{2}) = a$ . The double point's scheme structure (the nilpotent $\overset{x}{ˉ}$ in $C [x] / (x^{2})$ ) is invisible to the variety; only scheme theory recovers it. This is precisely why classical varieties lose information that schemes retain.

Connections

The Nullstellensatz is the gateway to the entire algebra–geometry dictionary. Combined with Prime Ideals and Irreducible Varieties, it shows irreducible algebraic sets correspond to prime ideals, and points to maximal ideals. It is the classical shadow of Spectrum of a Ring and Affine Schemes: $Spec R$ replaces the maximal-ideal point set with all prime ideals, eliminating the need for $k = \overset{ˉ}{k}$ and recovering the nilpotent information lost in Reduced Rings and Radicals. The bijection [6] is the affine case of the equivalence between Reduced Finite-Type k-Algebras and affine varieties, an anti-equivalence of categories. Zariski's Lemma [7] connects to Noether Normalization and Integral Extensions, and the Hilbert Basis Theorem (used for Noetherianity) ties to Noetherian Rings. The single-variable case is exactly the Fundamental Theorem of Algebra.

Real-World Applications

Computer algebra & Gröbner bases. Buchberger's algorithm tests ideal membership and solvability of polynomial systems; the weak Nullstellensatz ( $1 \in a$ ) is the termination criterion implemented in Macaulay2, Singular, and Magma.
Robotics & kinematics. Inverse kinematics of robot arms reduces to solving polynomial systems; the Nullstellensatz guarantees when configurations exist (over $C$ ) and bounds solution counts.
Geometric theorem proving. Wu's method and the Gröbner-basis approach mechanically prove Euclidean geometry theorems by reducing them to polynomial-ideal membership, justified by the Nullstellensatz.
Algebraic statistics. Model varieties (e.g. for Markov chains, contingency tables) are defined by polynomial ideals; the radical/variety dictionary identifies the statistically meaningful locus.
Coding theory & cryptography. Decoding algebraic-geometry codes and solving multivariate cryptosystems (e.g. attacking HFE) depend on the solvability theory the Nullstellensatz formalizes.
Control theory. Polynomial optimization and Positivstellensatz/SOS methods (the real-field analogue) certify stability and feasibility, generalizing Nullstellensatz certificates.
Symbolic ODE/PDE analysis. Differential algebra uses differential analogues of the Nullstellensatz (Ritt, Seidenberg) to test consistency of differential polynomial systems.

Historical Development

1799 / 1815 — Gauss proves the Fundamental Theorem of Algebra, the one-variable seed of the Nullstellensatz.
1882 — Kronecker and Dedekind–Weber develop algebraic approaches to curves and the arithmetic of ideals, framing the question of zero loci ideal-theoretically.
1890 — Hilbert proves the Basis Theorem: every ideal in a polynomial ring is finitely generated, supplying the Noetherian foundation.
1893 — Hilbert proves the Nullstellensatz in Über die vollen Invariantensysteme (Math. Ann. 42), as part of his nonconstructive revolution in invariant theory.
1926 — Emmy Noether and her school recast the theorem in fully abstract ideal-theoretic language; Noether normalization (1926) gives the modern algebraic engine.
1947 — Oscar Zariski systematizes the topology and the algebra–geometry correspondence; Zariski's Lemma becomes the standard route to the weak form.
1953 — J. L. Rabinowitsch's one-line "trick" (introducing the variable $y$ ) for deriving the strong form from the weak form becomes textbook standard.
1960s — Grothendieck's Éléments de géométrie algébrique subsumes the Nullstellensatz into scheme theory via $Spec$ , removing the $k = \overset{ˉ}{k}$ hypothesis and recovering nilpotents.
1974 — Brownawell, Kollár, and others (through the 1980s–90s) establish effective Nullstellensatz degree bounds: $f^{m} = \sum h_{i} g_{i}$ with $m$ and $de g h_{i}$ bounded explicitly in terms of degrees and number of variables.

Subtleties & Limits

Effective bounds. Kollár (1988) proved that if

f \in (g_{1}, \dots, g_{r})

with

de g g_{i} \leq d

and

r, n \geq 2

, one may take

m \leq d^{n}

f^{m} \in a

, with matching examples showing

d^{n}

is essentially sharp. Determining optimal constants and degree bounds for the Bézout-type identity [11], and the analogous arithmetic Nullstellensatz controlling the heights (sizes of coefficients) of the multipliers

\tilde{h}_{i}

, remains an active area (Krick–Pardo–Sombra and successors). Real and positive analogues. Over

R

the right framework is the Positivstellensatz (Krivine–Stengle) and the Real Nullstellensatz, where the radical is replaced by the real radical

R a

. Sharp degree bounds for these sum-of-squares certificates, central to polynomial optimization, are far less understood than the complex case. Differential and difference settings. The Ritt–Raudenbush theory provides Nullstellensätze for differential polynomial rings, but effective and constructive versions remain delicate, with connections to decidability questions in model theory.

Affine Varieties and the Nullstellensatz

The Core Insight

Formal Statement

Affine space and the Zariski correspondence

Radical of an ideal

Hilbert's Nullstellensatz — Weak Form

Hilbert's Nullstellensatz — Strong Form

Zariski's Lemma — the algebraic engine

Why It Holds / Derivation

Weak Nullstellensatz from Zariski's Lemma

Strong Nullstellensatz via the Rabinowitsch trick

David Hilbert | 1862–1943

Building Intuition

Reading the dictionary physically

The radical collapses multiplicity: $V(x^2)=V(x)$ as point sets, but the ideals differ

Worked Examples

Recovering a radical from a generated ideal

A system with no solutions — weak form in action

Common Misconceptions

Failure over $\mathbb{R}$

Why the radical, not the ideal

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also

Before this

Where this leads