Skip to content

Algebraically Closed Field

Definition

A field F\mathbb{F} is algebraically closed if every nonconstant polynomial in F[x]\mathbb{F}[x] (that is, with coefficients in F\mathbb{F}) has a root in F\mathbb{F}.


Interpretation

A field is algebraically closed when polynomial equations never force us to leave it: every equation p(x)=0p(x)=0 with pp a nonconstant polynomial with coefficients in F\mathbb{F} already has a solution in F\mathbb{F}.

The definition asks for one root, but this gives all of them. If p(λ)=0p(\lambda)=0, then polynomial long division by x−λx-\lambda leaves remainder 00, so p(x)=(x−λ)q(x)p(x)=(x-\lambda)q(x) with deg⁡q=deg⁡p−1\deg q=\deg p-1. If qq is nonconstant, it has a root as well, and repeating the step splits pp completely. So over an algebraically closed field, a polynomial of degree n≥1n\ge1 is a constant times a product of nn linear factors x−λ1,…,x−λnx-\lambda_1,\ldots,x-\lambda_n, where some λi\lambda_i may coincide.

The word closed does not refer to the field operations; every field is closed under addition and multiplication. It refers to solving equations: in R\mathbb{R} the equation x2+1=0x^2+1=0 has no solution, and in Q\mathbb{Q} the equation x2−2=0x^2-2=0 has none either. Enlarging R\mathbb{R} by i\mathrm{i} is enough to repair this for every polynomial at once, which is the content of the fundamental theorem of algebra: the complex numbers form an algebraically closed field.

This is one reason why complex numbers appear in linear algebra. Later, the eigenvalues of a square matrix turn out to be roots of a polynomial, so over C\mathbb{C} they always exist, even when the matrix has only real entries.


Key Results


Examples

  • x2+1x^2+1 has no root in R\mathbb{R}, but has roots i\mathrm{i} and −i-\mathrm{i} in C\mathbb{C}.
  • Q\mathbb{Q} is not algebraically closed: x2−2x^2-2 has no rational root.

Prerequisites

Sources

Aliases: algebraically closed Symbols: complex numbers, lambda, rational numbers, real numbers

Last updated: 20 October 2026 03:02