Consider the polynomial $x^2 + 1 \in \mathbb{Q}[x]$. Over $\mathbb{Q}$, this polynomial has no roots — there is no rational number whose square is $-1$. The same failure occurs in $\mathbb{R}$: the equation $x^2 + 1 = 0$ is simply unsolvable. This is not a minor inconvenience. It means that $\mathbb{R}[x]$ contains polynomials that refuse to factor into linear factors, and this algebraic incompleteness forces us to work with irreducible polynomials of arbitrarily high degree, making the structure of $\mathbb{R}[x]$ considerably more complicated than it could be.

The passage to $\mathbb{C}$ fixes this particular failure. But it raises a more fundamental question: does $\mathbb{C}$ itself have the same problem? Could there be a polynomial with complex coefficients that has no complex root? The Fundamental Theorem of Algebra asserts that no such polynomial exists — every non-constant polynomial in $\mathbb{C}[x]$ splits completely into linear factors over $\mathbb{C}$. This property is not accidental; it is the defining feature of an algebraically closed field.

The theory of algebraic closures asks: given any field $k$, can we always find a "big enough" extension that is algebraically closed? And if so, is this extension unique in any reasonable sense? The answers — yes and yes, up to isomorphism — are among the most beautiful results in abstract algebra. The construction requires tools from both field theory and set theory (specifically, Zorn's lemma), and the resulting object, the algebraic closure $\overline{k}$, plays the same role for $k$ that $\mathbb{C}$ plays for $\mathbb{R}$: it is the smallest algebraically closed field containing $k$, and every polynomial over $k$ splits completely within it.

[example: Factoring a Quadratic over Various Fields] The polynomial $f(x) = x^2 + 1$ behaves differently depending on the base field. Over $\mathbb{Q}$, it is irreducible: there is no $a \in \mathbb{Q}$ with $a^2 = -1$, since $-1$ is not a perfect square in $\mathbb{Q}$. Over $\mathbb{R}$, it remains irreducible for the same reason. Over $\mathbb{C}$, it factors as $(x - i)(x + i)$ where $i^2 = -1$. Over the field $\mathbb{F}_5 = \mathbb{Z}/5\mathbb{Z}$, we check: $1^2 + 1 = 2$, $2^2 + 1 = 5 = 0$. So $x = 2$ is a root, and $f(x) = (x - 2)(x - 3)$ in $\mathbb{F}_5[x]$, since $3^2 + 1 = 10 = 0$ as well. Over $\mathbb{F}_3$, we check: $0^2 + 1 = 1$, $1^2 + 1 = 2$, $2^2 + 1 = 5 = 2$. None are zero, so $x^2 + 1$ is irreducible over $\mathbb{F}_3$. The pattern here is subtle: whether $-1$ is a square in $\mathbb{F}_p$ depends on whether $p \equiv 1 \pmod{4}$ (by quadratic reciprocity). This example illustrates that algebraic closure is not a property of a polynomial in isolation — it depends entirely on the ambient field. [/example]

## Definition

The central notion is the idea of a field in which every polynomial has a root. This might seem like a modest requirement, but it turns out to be remarkably strong: if every polynomial has at least one root, then every polynomial splits completely.

The field $\mathbb{Q}$ does not have this property. The polynomial $x^2 - 2$ has no root in $\mathbb{Q}$. But even $\mathbb{Q}(\sqrt{2})$ fails: the polynomial $x^2 + 1$ has no root there. The process of adjoining roots one by one never terminates for $\mathbb{Q}$ using finite extensions alone — there are always new polynomials without roots. The algebraically closed fields are precisely those for which this iterative process is unnecessary.

[definition: Algebraically Closed Field] A field $k$ is **algebraically closed** if every non-constant polynomial $f \in k[x]$ has at least one root in $k$. [/definition]

Equivalently, $k$ is algebraically closed if and only if every non-constant polynomial $f \in k[x]$ factors completely into linear factors:

\begin{align*} f(x) = a(x - \alpha_1)(x - \alpha_2) \cdots (x - \alpha_n) \end{align*}

where $a, \alpha_1, \ldots, \alpha_n \in k$ and $n = \deg f$.

The equivalence between these two characterizations is itself a theorem: if every polynomial has a root, then by induction on degree, every polynomial splits into linear factors. If $f \in k[x]$ has degree $n \geq 1$, take a root $\alpha_1 \in k$; then $f(x) = (x - \alpha_1)g(x)$ for some $g \in k[x]$ of degree $n-1$, and the process continues.

[remark: The Constant Polynomials] The restriction to non-constant polynomials is necessary. The polynomial $f(x) = c$ for a nonzero constant $c \in k$ has no roots by definition (the equation $c = 0$ has no solution), so including constant polynomials in the requirement would make the definition vacuously impossible to satisfy. [/remark]

The notion of algebraic closure of a specific field $k$ is distinct from the notion of an algebraically closed field. We want not just any algebraically closed field, but the smallest one containing $k$.

The intuition here is closure under algebraic operations. Every element of $\overline{k}$ should be reachable from $k$ by taking roots of polynomials. If we also added transcendental elements — elements with no polynomial relation to $k$ — we would produce a field larger than necessary.

[definition: Algebraic Closure] Let $k$ be a field. An **algebraic closure** of $k$ is a field $\overline{k}$ satisfying: 1. $\overline{k}$ is an algebraic extension of $k$, meaning every element $\alpha \in \overline{k}$ is algebraic over $k$: there exists a non-zero polynomial $f \in k[x]$ with $f(\alpha) = 0$. 2. $\overline{k}$ is algebraically closed. [/definition]

Condition (1) ensures $\overline{k}$ contains no "unnecessary" transcendental elements. Condition (2) ensures $\overline{k}$ is large enough that every polynomial over $k$ (or even over $\overline{k}$ itself) has roots. Together, they pin down $\overline{k}$ as tightly as possible.

The notation $\overline{k}$ for the algebraic closure is standard (see §18.3 of the Notation Standards). In the important special case $k = \mathbb{Q}$, the algebraic closure $\overline{\mathbb{Q}}$ is the field of all algebraic numbers — complex numbers that satisfy a polynomial equation with rational coefficients. This is a countable field properly contained in $\mathbb{C}$.

[explanation: Why Both Conditions Are Needed] Each condition alone is insufficient. A field satisfying only condition (1) — algebraic over $k$ — need not be algebraically closed. For example, $\mathbb{Q}(\sqrt{2})$ is algebraic over $\mathbb{Q}$, but $x^2 + 1$ has no root there.

A field satisfying only condition (2) — algebraically closed — might be far larger than necessary. The field $\mathbb{C}(t)$ of rational functions over $\mathbb{C}$ is not algebraically closed (the polynomial $x^2 - t$ has no root in $\mathbb{C}(t)$), but its algebraic closure contains many transcendental elements over $\mathbb{Q}$. Even $\mathbb{C}$ itself, while algebraically closed, is not algebraic over $\mathbb{Q}$: it contains transcendental numbers like $\pi$ and $e$.