A topic in the Open Knowledge Graph — a free, open map of 15,495 topics and the order to learn them in.

Hilbert's Nullstellensatz

Research Depth 104 in the knowledge graph ☐ I know this ☆ Set as goal
468prerequisites beneath it
See this on the map →
Noether NormalizationPrime and Maximal Ideals+2 more→
commutative-algebra nullstellensatz algebraic-geometry maximal-ideals radical-ideals affine-varieties

Core Idea

Hilbert's Nullstellensatz ("theorem of zeros") links ideals in a polynomial ring to the sets of points where polynomials vanish. Let k be an algebraically closed field and R = k[x₁, ..., xₙ]. The weak form says every maximal ideal of R has the form (x₁ - a₁, ..., xₙ - aₙ) for a point (a₁, ..., aₙ) in kⁿ; equivalently, a system of polynomial equations with no common solution generates the unit ideal. The strong form says that if a polynomial f vanishes on the common zero set V(J) of an ideal J, then some power of f lies in J, so I(V(J)) = √J. This sets up an inclusion-reversing bijection between radical ideals of R and algebraic subsets of kⁿ.

How It's Best Learned

Begin in one variable, where the theorem reduces to the fact that every nonconstant polynomial over k has a root, and see how it fails over ℝ with x² + 1. Prove the weak form from Zariski's lemma (a field that is finitely generated as a k-algebra is a finite extension of k), which follows from Noether normalization. Then derive the strong form with the Rabinowitsch trick of adjoining a new variable y and the polynomial 1 - yf. Use small examples such as J = (x², y) to see why the radical appears.

Common Misconceptions

Explainer

Algebraic geometry studies the sets of solutions of polynomial equations. For an ideal J in R = k[x₁, ..., xₙ], let V(J) be the set of points in kⁿ where every polynomial in J vanishes. For a set X of points, let I(X) be the ideal of all polynomials that vanish on X. The Nullstellensatz, due to David Hilbert, describes exactly how these two operations relate when k is algebraically closed, for example k = ℂ.

The weak Nullstellensatz. Every maximal ideal of R has the form (x₁ - a₁, ..., xₙ - aₙ). Equivalently, if J ≠ R, then V(J) is nonempty. In plain terms, a system of polynomial equations has a solution unless the equations can be combined, with polynomial coefficients, to give 1 = 0. In one variable this is the fact that every nonconstant polynomial has a root in k.

The proof rests on Zariski's lemma. If m is a maximal ideal, then R/m is a field that is finitely generated as a k-algebra. Noether normalization shows such a field is a finite, hence algebraic, extension of k. Since k is algebraically closed, R/m = k. Each xᵢ then equals some aᵢ modulo m, so m contains (x₁ - a₁, ..., xₙ - aₙ). That ideal is already maximal, so the two are equal.

The strong Nullstellensatz. For any ideal J, I(V(J)) = √J, the set of f with fᵐ ∈ J for some m. One inclusion is easy: if fᵐ vanishes on V(J), so does f. For the other, suppose f vanishes on V(J). In n + 1 variables, the ideal generated by J and 1 - yf has no zeros, since at any zero of J we have f = 0 and 1 - yf = 1. By the weak form, 1 = Σ gᵢhᵢ + g(1 - yf) with hᵢ ∈ J. Substituting y = 1/f and multiplying through by a high power of f shows fᵐ ∈ J.

The result is a dictionary. Radical ideals of R correspond one-to-one with algebraic subsets of kⁿ, larger ideals giving smaller sets. Prime ideals correspond to irreducible sets, and maximal ideals correspond to points. The hypothesis on k matters. Over ℝ, the ideal (x² + 1) is maximal in ℝ[x], yet x² + 1 has no real root.

This correspondence motivates defining Spec R as the set of prime ideals with the Zariski topology. Through Noether normalization, it also ties the Krull dimension of R/J to the geometric dimension of V(J).

Practice Questions 4 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Combining Small Groups Within 5 → Number Bonds Within 5 → Number Bonds to 10 → Tens and Ones Place Value → Reading and Writing Three-Digit Numbers → Comparing Three-Digit Numbers → Comparing and Ordering Three-Digit Quantities → Comparing and Ordering Whole Numbers → Comparing Numbers 1 to 20 → Ordering Numbers to 20 → Number Line 0 to 20 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Opposites and Additive Inverses → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Integral Extensions → Noether Normalization → Hilbert's Nullstellensatz

Longest path: 105 steps · 468 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.