Fundamental theorem of algebra

Statement that every non-constant polynomial with complex coefficients has a complex root and therefore factors completely over the complex numbers.

Overview

The fundamental theorem of algebra states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. Equivalently, any polynomial of degree n>0 can be written as a product of n linear factors over the complex numbers when multiplicity is counted. The result explains why the field of complex numbers is algebraically closed and forms a cornerstone connecting algebra, analysis and topology. $f(x)$

Formal statement

For a polynomial p(x) = a_n x^n + a_{n-1} x^{n-1} + ... + a_0 with complex coefficients and a_n ≠ 0, there exists a complex number r such that p(r)=0. More strongly, there are exactly n roots in the complex plane counted with multiplicity. This guarantees complete factorization into linear factors and underlies many constructions in algebraic theory and complex function theory. $n$

Concepts and prerequisites

Key notions used in statements and proofs include degree, root (or zero), multiplicity, and the concept of algebraic closure. Proofs commonly employ ideas from mathematical analysis, properties of the real numbers, and the behaviour of complex-valued functions. The argument often uses limits and continuity of polynomial functions and may invoke topological facts about the plane or complex-analytic tools such as the argument principle; see introductions to limits and complex methods for background. $n>0$

History and proof approaches

The first widely accepted proof is attributed to Carl Friedrich Gauss, who presented arguments in his early work and later refinements. Since Gauss, mathematicians have produced many different proofs: elementary analytic proofs, those using complex analysis (for example via Rouche's theorem or the argument principle), algebraic-topological arguments, and approaches from field theory. Surveys collecting these methods are useful for comparison and deeper study. $f(x)=0$

Consequences and examples

Consequences include the guarantee that any polynomial of degree n has exactly n complex roots when multiplicity is counted, and that there is no algebraic extension of the complex numbers that yields new roots for arbitrary polynomials. For example, a real quadratic always has two complex roots (possibly equal or real). For degrees greater than four, closed-form solutions by radicals are not generally available (see Abel–Ruffini), so the theorem ensures existence but not elementary formulas. Practical computations of roots draw on numerical methods and software; see general introductions to complex numbers and techniques for computing roots. $x$

Applications and remarks

The theorem underpins much of modern algebra, complex analysis and applied areas such as control theory and signal processing, where characteristic polynomials determine system behaviour. It does not specify how to find roots explicitly, only that they exist in the complex plane. Over other fields (for example the real numbers or finite fields) the statement may fail, which highlights the special nature of the complex field. For accessible expositions and historical notes consult standard references and surveys on proofs and development. Further reading and biographical material on Gauss and later commentators provide context for the theorem’s evolution. $n$

Multiplicity: roots counted with multiplicity sum to the degree.
Algebraic closure: the complex numbers are algebraically closed.
Proof diversity: multiple independent proof strategies illustrate links between fields of mathematics; see a comparative survey at an overview of polynomial theory and a focused guide to methods at power and polynomial resources.