Algebra

Commutative algebra

The study of commutative rings, providing the algebraic backbone of algebraic geometry.

IntuitionShapes as solutions, functions as coordinates

A commutative ring $R$ is a set with addition and multiplication satisfying the usual rules, where $ab=ba$ for all $a,b \in R$ — the polynomial ring $k[x_1,\ldots,x_n]$ over a field $k$ is the flagship example, because a polynomial is exactly a function-like recipe for computing a number from coordinates $(x_1,\ldots,x_n)$ . Commutative algebra studies such rings through their ideals: subsets $I \subseteq R$ closed under addition and absorbing multiplication ( $r \in R,\ a \in I \implies ra \in I$ ). Geometrically, an ideal $J \subseteq k[x_1,\ldots,x_n]$ names a shape $V(J)$ — the common zero set of every polynomial in $J$ — so algebraic questions about ideals translate into geometric questions about shapes, and vice versa. The network below visualizes the prime ideals of a small ring ordered by inclusion, mirroring how points, curves, and the whole space nest inside one another geometrically.

Nodes represent prime ideals of a small ring, edges point from a smaller prime up to a prime that contains it — this inclusion order is exactly the geometric nesting of a point inside a curve inside the whole space.

SchoolFrom divisibility in the integers to ideals in any ring

Definition: Prime ideal and maximal ideal

In $\mathbb{Z}$ , the multiples of $n$ form the ideal $(n)$ , and $(n)$ is prime exactly when $n$ is a prime number — divisibility of integers is just the inclusion order of these ideals. In a general commutative ring $R$ , a proper ideal $\mathfrak{p} \subsetneq R$ is prime if $ab \in \mathfrak{p}$ forces $a \in \mathfrak{p}$ or $b \in \mathfrak{p}$ , and a proper ideal $\mathfrak{m} \subsetneq R$ is maximal if no ideal sits strictly between $\mathfrak{m}$ and $R$ .

\mathfrak{p} \subsetneq R \text{ is prime} \iff \big(ab \in \mathfrak{p} \implies a \in \mathfrak{p} \text{ or } b \in \mathfrak{p}\big)

For example, in $\mathbb{Z}$ the ideal $(6)$ is not prime, since $2 \cdot 3 \in (6)$ yet neither $2$ nor $3$ lies in $(6)$ ; but $(2)$ and $(3)$ are both prime, and in fact maximal, because $\mathbb{Z}/(p)$ is a field exactly when $p$ is prime. This equivalence is general: $\mathfrak{p}$ is prime exactly when the quotient ring $R/\mathfrak{p}$ is an integral domain, and $\mathfrak{m}$ is maximal exactly when $R/\mathfrak{m}$ is a field — every maximal ideal is automatically prime, since every field is an integral domain.

Prime ideals versus maximal ideals
Property	Prime ideal $\mathfrak{p}$	Maximal ideal $\mathfrak{m}$
Quotient ring	$R/\mathfrak{p}$ is an integral domain	$R/\mathfrak{m}$ is a field
Example in $\mathbb{Z}$	$(0)$ or $(p)$ for a prime $p$	$(p)$ for a prime $p$
Geometric picture in $k[x_1,\ldots,x_n]$	irreducible subvariety $V(\mathfrak{p})$	a single point (when $k$ is algebraically closed)

UndergraduateFiniteness and dimension: Noetherian rings and Krull dimension

Definition: Noetherian ring

A ring $R$ is Noetherian if every ideal of $R$ is finitely generated, equivalently if every ascending chain of ideals stabilizes (the ascending chain condition, ACC): there is no infinite strictly increasing sequence of ideals. Named after Emmy Noether, this single finiteness condition is what makes commutative algebra computationally and structurally tractable.

I_1 \subseteq I_2 \subseteq I_3 \subseteq \cdots \implies \exists\, N,\ I_N = I_{N+1} = I_{N+2} = \cdots

Theorem: Hilbert's Basis Theorem

If $R$ is a Noetherian ring, then the polynomial ring $R[x]$ is also Noetherian. Consequently $k[x_1,\ldots,x_n]$ is Noetherian for every field $k$ , so every ideal $J \subseteq k[x_1,\ldots,x_n]$ is generated by finitely many polynomials.

Why is it true?

A priori a system of infinitely many polynomial equations could define a shape that no finite system can — Hilbert's theorem says this never happens: every algebraic variety is cut out by finitely many equations. This is exactly what makes symbolic computation (Gröbner bases, elimination) and algebraic geometry (varieties as finite data) possible at all.

Proof

Step 1 (leading-coefficient ideals). Let $I \subseteq R[x]$ be an ideal. For each degree $n \ge 0$ , let $L_n$ be the set of leading coefficients of degree- $n$ elements of $I$ , together with $0$ . Multiplying a degree- $n$ polynomial by $x$ shows $L_n \subseteq L_{n+1}$ , and each $L_n$ is an ideal of $R$ (closure under addition and absorption of $R$ -multiples follows directly from $I$ being an ideal).

Step 2 (use that $R$ is Noetherian, twice). The chain $L_0 \subseteq L_1 \subseteq L_2 \subseteq \cdots$ stabilizes at some $L_N$ by the ACC. Since $R$ is Noetherian, each of $L_0,\ldots,L_N$ is finitely generated; choose finitely many generators of each $L_n$ ( $n=0,\ldots,N$ ) and, for each generator, a polynomial $f_{n,i} \in I$ of degree $n$ realizing it as leading coefficient. This gives one finite list $\{f_{n,i}\}$ in total.

Step 3 (reduction by induction on degree). We claim $I$ is generated by this finite list. Take any $f \in I$ of degree $d$ ; we induct on $d$ . If $d \le N$ , the leading coefficient of $f$ lies in $L_d$ , so it is an $R$ -combination of the leading coefficients of the $f_{d,i}$ ; subtracting the matching $R$ -combination of the $f_{d,i}$ from $f$ cancels the degree- $d$ term, producing an element of $I$ of strictly smaller degree, and we induct. If $d > N$ , the leading coefficient of $f$ lies in $L_d = L_N$ , so it is an $R$ -combination of the leading coefficients of the $f_{N,i}$ ; subtracting the same combination of $x^{\,d-N} f_{N,i}$ again cancels the leading term and strictly lowers the degree.

Step 4 (conclusion). Repeating Step 3 eventually produces the zero polynomial, so $f$ is an $R[x]$ -combination of the finite list $\{f_{n,i}\}$ . Hence every ideal of $R[x]$ is finitely generated, i.e. $R[x]$ is Noetherian. Applying this inductively $n$ times starting from the Noetherian ring $k$ shows $k[x_1,\ldots,x_n] = k[x_1][x_2]\cdots[x_n]$ is Noetherian.

Definition: Localization $S^{-1}R$

Given a multiplicative subset $S \subseteq R$ (containing $1$ , closed under products, with no zero), the localization $S^{-1}R$ formally adjoins inverses of every element of $S$ , exactly like building $\mathbb{Q}$ from $\mathbb{Z}$ by inverting every nonzero integer. Localizing $R$ at the complement of a prime ideal $\mathfrak{p}$ produces the local ring $R_\mathfrak{p}$ , a ring with a unique maximal ideal — the algebraic analogue of zooming into a single point of a geometric shape.

S^{-1}R = \left\{ \dfrac{a}{s} : a \in R,\ s \in S \right\}, \qquad \dfrac{a}{s} = \dfrac{a'}{s'} \iff \exists\, u \in S,\ u(as' - a's) = 0

Definition: Krull dimension

The Krull dimension $\dim R$ of a ring $R$ is the supremum length of a strictly increasing chain of prime ideals. For $k[x_1,\ldots,x_n]$ over a field $k$ , $\dim k[x_1,\ldots,x_n] = n$ , matching the geometric intuition that affine $n$ -space has $n$ dimensions; more generally Krull's principal ideal theorem says that adding one polynomial equation to a Noetherian ring drops the dimension by at most $1$ .

\dim R = \sup\big\{\, n : \mathfrak{p}_0 \subsetneq \mathfrak{p}_1 \subsetneq \cdots \subsetneq \mathfrak{p}_n,\ \mathfrak{p}_i \text{ prime} \,\big\}

Theorem: Hilbert's Nullstellensatz

Let $k$ be an algebraically closed field and $J \subseteq k[x_1,\ldots,x_n]$ an ideal. Writing $I(V(J))$ for the ideal of all polynomials vanishing on $V(J)$ and $\sqrt{J} = \{ f : f^m \in J \text{ for some } m \ge 1\}$ for the radical of $J$ , the strong Nullstellensatz states $I(V(J)) = \sqrt{J}$ . In particular, when $J$ is already a radical ideal ( $J = \sqrt{J}$ ), this identity rearranges to $\sqrt{I(V(J))} = J$ .

Why is it true?

This is the precise dictionary entry translating between algebra and geometry: it says the ideal of functions vanishing on a shape recovers exactly the radical of the ideal that cut the shape out, with no information lost beyond multiplicities. Algebraic closure is essential — over $\mathbb{R}$ , the ideal $(x^2+1) \subseteq \mathbb{R}[x]$ is proper yet $V((x^2+1)) = \emptyset$ , so $I(V((x^2+1))) = \mathbb{R}[x] \ne \sqrt{(x^2+1)}$ , and the dictionary breaks down.

Proof

Step 1 (weak Nullstellensatz, used as input). Since $k$ is algebraically closed, every maximal ideal of $k[x_1,\ldots,x_n]$ has the form $(x_1-a_1,\ldots,x_n-a_n)$ for a point $(a_1,\ldots,a_n) \in k^n$ ; this is proved via Zariski's Lemma (a field that is finitely generated as an algebra over $k$ is a finite field extension of $k$ , hence equals $k$ since $k$ is algebraically closed). Consequently, if $J \ne (1)$ then $J$ lies in some maximal ideal, so $V(J) \ne \emptyset$ .

Step 2 (easy inclusion, $\sqrt{J} \subseteq I(V(J))$ ). If $f^m \in J$ for some $m$ , then $f^m$ vanishes at every point of $V(J)$ , forcing $f$ itself to vanish there (a product of field elements is $0$ only if a factor is $0$ ), so $f \in I(V(J))$ .

Step 3 (Rabinowitsch trick for the reverse inclusion). Let $f \in I(V(J))$ . Introduce a new variable $y$ and form $J' = J + (1 - yf) \subseteq k[x_1,\ldots,x_n,y]$ . Any point of $V(J')$ would need to lie in $V(J)$ (to satisfy the generators of $J$ ) and also satisfy $1-yf=0$ ; but $f$ vanishes on all of $V(J)$ , making $1-yf=1$ there, which is never $0$ . Hence $V(J') = \emptyset$ , so by Step 1 (contrapositive), $J' = (1)$ : there exist polynomials with $1 = h(x,y)(1-yf) + \sum_i g_i(x,y) J_i(x)$ for generators $J_i$ of $J$ .

Step 4 (clearing denominators). Substitute $y = 1/f$ formally in this identity (working in $k[x_1,\ldots,x_n][1/f]$ ) — the term with $h$ vanishes since $1-yf$ becomes $0$ , leaving $1 = \sum_i g_i(x,1/f) J_i(x)$ . Multiplying through by a sufficiently high power $f^m$ to clear every denominator $f$ introduced by the $g_i$ yields $f^m = \sum_i \tilde g_i(x) J_i(x) \in J$ for polynomials $\tilde g_i$ , i.e. $f \in \sqrt{J}$ . Combined with Step 2, $I(V(J)) = \sqrt{J}$ , and taking radicals of both sides when $J=\sqrt J$ gives the stated corollary $\sqrt{I(V(J))} = J$ .

UndergraduateReal-World Applications and Worked Examples

Commutative algebra is the computational engine behind solving systems of polynomial equations: robotics uses Gröbner bases (guaranteed to exist and terminate by Hilbert's Basis Theorem) to solve inverse-kinematics equations exactly; error-correcting codes used in satellite and storage systems are literally ideals of a quotient ring; and cryptographic and verification systems use the Nullstellensatz to decide whether a system of polynomial constraints has a solution at all.

Example: Robot arm kinematics and finite generation

A two-link planar robot arm has end-effector position $x = \cos\theta_1 + \cos(\theta_1+\theta_2)$ , $y = \sin\theta_1 + \sin(\theta_1+\theta_2)$ . Introducing $c_i = \cos\theta_i$ , $s_i = \sin\theta_i$ turns this trigonometric system into a polynomial system in $c_1,s_1,c_2,s_2,x,y$ by adjoining $c_i^2+s_i^2=1$ and the addition formulas for $\cos(\theta_1+\theta_2)$ , $\sin(\theta_1+\theta_2)$ . Explain why Hilbert's Basis Theorem guarantees that any elimination procedure (solving for the joint angles given a target $(x,y)$ ) is guaranteed to terminate.

Solution

Step 1: identify the ideal. The four polynomial relations generate an ideal $J$ in $k[c_1,s_1,c_2,s_2,x,y]$ (with $k=\mathbb{R}$ ), and solving inverse kinematics amounts to computing the elimination ideal $J \cap k[x,y,c_1,s_1]$ — eliminating $c_2,s_2$ — via Gröbner basis algorithms such as Buchberger's algorithm.

Step 2: why termination is not automatic in general. Buchberger's algorithm repeatedly replaces generators with new combinations (S-polynomials) that could, in principle, keep introducing new leading terms forever, in the same way a naive search over infinitely many polynomials might never stop.

Step 3: apply Hilbert's Basis Theorem. Because $k[c_1,s_1,c_2,s_2,x,y]$ is Noetherian (Hilbert's Basis Theorem, applied to $6$ variables), the ascending chain of "leading-term ideals" produced during the algorithm must stabilize after finitely many steps — this is exactly the ACC guaranteed by the theorem. Hence Buchberger's algorithm is guaranteed to terminate with a finite Gröbner basis.

Step 4: conclude. Once a finite Gröbner basis for the elimination ideal is found, the joint angles solving the kinematics for a given $(x,y)$ can be read off by solving a univariate polynomial in finitely many steps — finite generation is precisely what turns an a priori infinite search into a finite, implementable algorithm.

Example: Cyclic error-correcting codes as ideals

A cyclic code of length $n$ over a finite field $\mathbb{F}_q$ is, by definition, an ideal of the quotient ring $\mathbb{F}_q[x]/(x^n-1)$ . Since $\mathbb{F}_q[x]$ is a principal ideal domain, every ideal of $\mathbb{F}_q[x]/(x^n-1)$ is generated by a single polynomial $g(x)$ dividing $x^n-1$ . For $q=2$ , $n=7$ , factor $x^7-1 = (x-1)(x^3+x+1)(x^3+x^2+1)$ over $\mathbb{F}_2$ and describe the code generated by $g(x)=x^3+x+1$ .

Solution

Step 1: verify the factorization. One checks directly over $\mathbb{F}_2$ that $(x-1)(x^3+x+1)(x^3+x^2+1) = x^7-1$ (using $x-1=x+1$ and $-1=1$ in characteristic $2$ ), so $\mathbb{F}_2[x]/(x^7-1)$ decomposes according to these three irreducible factors.

Step 2: the ideal generated by $g(x)$ . The ideal $(g(x)) \subseteq \mathbb{F}_2[x]/(x^7-1)$ generated by $g(x)=x^3+x+1$ consists of all multiples of $g(x)$ modulo $x^7-1$ ; as a code, its codewords are the coefficient vectors of $g(x)\cdot m(x)$ for message polynomials $m(x)$ of degree $< 7-3=4$ , giving a $[7,4]$ code — this is exactly the classical Hamming(7,4) code.

Step 3: why the ideal structure matters. Because $g(x) \mid x^7-1$ , multiplying any codeword by $x$ (a cyclic shift of its coefficients) stays inside the ideal, i.e. the code is closed under cyclic shifts — this closure is automatic precisely because ideals absorb multiplication by every ring element, including $x$ .

Step 4: conclude. The commutative-algebra fact "ideals of $\mathbb{F}_q[x]/(x^n-1)$ correspond to divisors of $x^n-1$ " is exactly the classification theorem for cyclic codes: choosing a generator polynomial $g(x) \mid x^n-1$ of degree $n-k$ produces every $[n,k]$ cyclic code, turning a coding-theory design problem into a factorization problem in commutative algebra.

Common mistake. A frequent error is applying the Nullstellensatz over

\mathbb{R}

\mathbb{Q}

: the theorem needs

k

algebraically closed, and fails badly otherwise — the proper ideal

(x^2+1) \subseteq \mathbb{R}[x]

has

V((x^2+1)) = \emptyset

\mathbb{R}^1

, so

I(V((x^2+1)))

is the whole ring, not

\sqrt{(x^2+1)}

. A second common confusion is conflating prime and irreducible elements: an element

p

is irreducible if it cannot be factored into two non-units, while

p

is prime if

(p)

is a prime ideal; these agree in a unique factorization domain like

k[x_1,\ldots,x_n]

, but can differ in general commutative rings, where irreducible elements need not generate prime ideals.

Research frontier as of 2026

The Direct Summand Conjecture, posed by Melvin Hochster in 1973 (proved by Hochster himself when the ring contains a field), asked whether a regular ring $R$ is always a direct summand, as an $R$ -module, of any module-finite extension ring. The mixed-characteristic case resisted proof for over four decades until Yves André's 2018 paper La conjecture du facteur direct, which imported Peter Scholze's theory of perfectoid spaces and a new "perfectoid Abhyankar lemma" to settle it completely; the same circle of ideas produced the existence of big Cohen–Macaulay algebras in mixed characteristic, resolving several other long-standing homological conjectures at once. Active directions now include extending perfectoid and prismatic techniques (Bhatt–Scholze) to further mixed-characteristic questions, and simplifying André's originally intricate argument into more usable forms for commutative algebraists.

Which condition defines a prime ideal $\mathfrak{p} \subsetneq R$ in a commutative ring $R$ ?

Is the ideal $(6) \subseteq \mathbb{Z}$ a prime ideal?

A verification system models a set of polynomial constraints over $\mathbb{C}$ as an ideal $J \subseteq \mathbb{C}[x_1,\ldots,x_n]$ . By the weak Nullstellensatz, $V(J) = \emptyset$ (the constraints are jointly unsatisfiable) exactly when:

What is the Krull dimension of the polynomial ring $k[x,y]$ over a field $k$ ?

References

David Eisenbud (1995). Commutative Algebra: with a View Toward Algebraic Geometry
M. F. Atiyah, I. G. Macdonald (1969). Introduction to Commutative Algebra
Yves André (2018). La conjecture du facteur direct · arXiv:1609.00345
Melvin Hochster (1973). Contracted ideals from integral extensions of regular rings