The Fundamental Theorem of Algebra: Why Every Polynomial Has a Root

A polynomial is a sum of multiplied-out powers of $x$, with constant coefficients in front. A quadratic, $x^2 - 5x + 6$, factors into $(x-2)(x-3)$, and its roots are $2$ and $3$. A cubic, $x^3 - x$, factors as $x(x-1)(x+1)$, giving roots $0, 1, -1$. The pattern looks promising — write down a polynomial, look for roots, factor it. But push to higher degree and the pattern starts to stutter. Where are the roots of $x^2 + 1$? There is no real number whose square is $-1$. The polynomial refuses to factor over the real numbers; it has no real root at all.

The Fundamental Theorem of Algebra says, with one stroke, that this refusal disappears the moment we step into the complex numbers. Every polynomial of degree $n \geq 1$ with complex coefficients has at least one complex root — and once one root is found and divided out, the remaining polynomial has degree $n - 1$ and again has a complex root, and so on. The theorem in its strongest form is therefore:

Every polynomial of degree $n$ with complex coefficients has exactly $n$ complex roots, counted with multiplicity.

No exceptions. No conditions. A polynomial of degree one billion has, somewhere in the complex plane, one billion roots. This article is about why the statement is true, and about how a single new number — the imaginary unit $i$ — closes the algebraic universe so neatly.

Why the reals are not enough

The reals fail because they are ordered: every real number is positive, negative, or zero, and the square of any number on that line is non-negative. So an equation like $x^2 = -1$ has no real solution. Trying to plug the leak by adding one extra number, $i$, with the defining property $i^2 = -1$, gives the complex numbers $a + bi$. This is a small change, in the sense that it adds only one new ingredient — but the consequences are enormous. Every polynomial of every degree is suddenly factorable. The price for fixing one quadratic was, miraculously, the fixing of all polynomials, of all degrees, all at once. This phenomenon does not have an obvious cause and was not anticipated when complex numbers were first reluctantly introduced in the 16th century to handle quirky cubic-equation arithmetic.

A concrete case: the roots of unity

Before talking about the proof, it is worth seeing the theorem in action on the simplest non-trivial family of polynomials: $z^n - 1 = 0$. The solutions are called the $n$-th roots of unity, and the theorem guarantees there are exactly $n$ of them. They form a beautiful pattern: a regular $n$-gon inscribed in the unit circle of the complex plane.

For $n = 5$, the five roots are $1, e^{2\pi i/5}, e^{4\pi i/5}, e^{6\pi i/5}, e^{8\pi i/5}$ — the five corners of a regular pentagon.

Every other $n$ produces an analogous picture, with the roots equally spaced around the circle. This is no coincidence: the equation $z^n = 1$ becomes, in polar form, “find $z$ whose $n$-th power has length $1$ and angle a multiple of $2\pi$,” which forces $z$ itself to have length $1$ and angle a multiple of $2\pi/n$. The Fundamental Theorem of Algebra is, in this case, almost visual: you can just see the $n$ solutions sitting on a unit circle.

A topological glimpse of why the theorem must be true

The deepest reason the theorem is true is a topological one, and it can be sketched without much machinery. Take a polynomial $p(z) = z^n + a_{n-1}z^{n-1} + \cdots + a_0$ with complex coefficients. For each radius $R > 0$, consider what $p$ does to the circle $|z| = R$. The output is a closed curve in the complex plane — the image of the circle under the map $p$.

When $R$ is very large, the leading term $z^n$ dominates everything else, and the image curve looks roughly like the curve $z^n$, which wraps around the origin exactly $n$ times. When $R$ is very small, $p(z) \approx p(0) = a_0$; the image curve is a tiny loop near the constant value $a_0$, and it does not wrap around the origin at all (it does not even reach it, unless $a_0 = 0$).

So as you shrink $R$ continuously from large to small, the winding number of the output curve around the origin drops from $n$ to $0$. But the winding number is an integer — it cannot change continuously without jumping. The only way for it to jump is for the output curve to pass through the origin at some intermediate radius. At that radius, some point $z_0$ on the circle has $p(z_0) = 0$. That is a root.

This is the winding-number proof, and it is the most pictorial of the standard arguments. It uses no algebra; it uses the fact that the complex numbers form a continuous plane and that integers cannot change by stealth. Other proofs use complex analysis (the elegant one-liner via Liouville’s theorem, that a bounded entire function must be constant) or differential topology (degree theory for smooth maps of the sphere). All of them ultimately rest on the continuity of the complex plane and the unboundedness of $|p(z)|$ for large $|z|$ — properties that have nothing to do with algebra in the narrow sense and everything to do with the geometry of $\mathbb{C}$.

Why a root, then $n$ roots

Once you have one root, the rest follow easily. If $r$ is a root of $p(z)$, polynomial division by $(z - r)$ leaves a polynomial $q(z)$ of degree $n - 1$ with no remainder. The Fundamental Theorem applies again to $q$, yielding another root $r'$, and so on. Iterating $n$ times factors $p$ completely:

$p(z) = a_n\,(z - r_1)(z - r_2)\cdots(z - r_n).$

The same root may appear more than once — for example, $p(z) = (z-1)^3$ has only the single root $r = 1$, but counted three times. Multiplicity is exactly what is needed to make the count come out to $n$ always.

This factorisation has practical force. A polynomial is completely determined, up to a scalar, by its roots. Two polynomials with the same roots (and multiplicities) are scalar multiples of each other. Calculations that look hard on the polynomial side — finding common roots, computing greatest common divisors, evaluating definite integrals of rational functions — become geometric questions on the side of the roots. Much of complex analysis, of signal processing, and of algebraic geometry stems from being able to think of polynomials in terms of their root-sets in $\mathbb{C}$ rather than their coefficients.

What it really says about the complex numbers

The cleanest way to phrase the Fundamental Theorem of Algebra is to say that the field $\mathbb{C}$ is algebraically closed: no polynomial equation over $\mathbb{C}$ can lead you outside of $\mathbb{C}$. The reals are not algebraically closed, the rationals are not, the integers are not — but adding just the one new ingredient $i$ to the reals closes the system. Every polynomial equation that anyone could ever write down, of any degree, with any complex coefficients, has its solutions sitting somewhere in the complex plane.

That a single addition should suffice to close such an enormous family of problems is one of the most striking facts in mathematics. The complex numbers, often introduced apologetically as a “device” to handle equations like $x^2 + 1 = 0$, turn out to be the natural and complete arena in which polynomial algebra lives. Gauss, who proved the theorem first and most carefully, recognised this with characteristic clarity, calling the complex numbers “the true and proper” numbers in which the deep structure of arithmetic at last reveals itself. Two centuries on, that judgement still stands.

Frequently asked

Why is it called the 'fundamental' theorem of algebra?

Because it answers, completely and finally, the central question of classical algebra: when does a polynomial equation have a solution? Before the theorem, mathematicians knew quadratics, cubics, and quartics could be solved by explicit formulas, but had no guarantee that higher-degree polynomials had any roots at all. The theorem promises every nonconstant polynomial has a complex root, which means it can be fully factored into linear pieces — closing a chapter that had been open since the Renaissance.

Who first proved it?

Carl Friedrich Gauss gave the first proof generally accepted as rigorous in his 1799 doctoral dissertation, and returned to the theorem several times during his life, eventually producing four distinct proofs. Earlier attempts by d'Alembert (1746), Euler (1749), and Lagrange (1772) had the right idea but contained gaps that 18th-century analysis was not yet equipped to fill. The theorem is sometimes called the d'Alembert–Gauss theorem in honour of both lines of work.

Is the proof algebraic or analytic?

Despite the name, every known proof is fundamentally analytic or topological — it uses ideas from calculus or topology, not from pure algebra. The shortest modern proofs use complex analysis (Liouville's theorem) or topology (the winding number argument). This is no accident: results due to Artin and Schreier show that the theorem cannot be proven from the field axioms alone, since fields satisfying every algebraic axiom but with no completeness property exist where the theorem fails.

What happens if you stay in the real numbers?

Then the theorem fails dramatically. The polynomial x² + 1 has no real root, since x² ≥ 0 for every real x. More generally, a polynomial of odd degree has at least one real root by the intermediate value theorem, but a polynomial of even degree may have none. The complex numbers fix this: they form the smallest field that contains the reals and in which every polynomial has a root. The price for that completeness is just one new number, i, with the property that i² = −1 — and from that single addition, the entire structure falls into place.

Continue reading

Person

Carl Friedrich Gauss

Often called the 'Prince of Mathematicians', Gauss made profound contributions across nearly every mathematical field, from number theory to differential geometry.

Read →Blog

Imaginary Numbers: Why the Square Root of -1 Turned Out to Matter

For two centuries mathematicians treated complex numbers as a useful fiction. Then physics, engineering, and number theory revealed that they describe the universe more accurately than the reals do.

Read →Blog

Galois Theory: Why You Can't Solve the Quintic

A 19-year-old who died in a duel left behind a theory that explained why polynomials of degree five and higher cannot generally be solved by formula. The mathematics took decades to digest.

Read →