Proving the Theorem
History, other proofs and scope
Two centuries of proofs
| Date | Author | Contribution |
|---|---|---|
| Roth, Girard | conjectural statement: roots for degree | |
| d'Alembert | first attempt, with an analytic gap | |
| Gauss | doctoral thesis, topological argument | |
| Argand | the proof via the minimum of the modulus | |
| Gauss | second and third proofs | |
| Gauss | fourth proof, case of complex coefficients |
Gauss would give four proofs during his lifetime, the last one fifty years after the first. The French name of the theorem preserves both contributions: d'Alembert for the idea, Gauss for the rigor.
Other routes
Through complex analysis. This is the shortest proof. If never vanished, the function would be holomorphic on the whole of and bounded, since . Liouville's theorem would make it constant, and hence too — which contradicts .
Through topology. We look at the image under of the circle of radius . For large , this curve winds times around the origin; for , it is reduced to a point. A root must appear when the winding number changes.
Through algebra and analysis. Laplace's proof, recast by Artin using Galois theory, uses from analysis only the intermediate value theorem, through the fact that every real polynomial of odd degree has a real root. Everything else is field theory.
What the theorem makes possible
| Field | Consequence |
|---|---|
| Reduction of endomorphisms | every complex endomorphism is triangularizable |
| Integration | partial fraction decomposition of rational functions |
| Linear differential equations | roots of the characteristic polynomial, hence solutions |
| Signal processing | factorization of filters into poles and zeros |
| Arithmetic | irreducibles in : degrees and only |
The first row has the weightiest consequences: it is because the characteristic polynomial always has a root in that every endomorphism of a complex space has an eigenvalue, and hence that the Jordan normal form exists.
What the theorem does not give
It provides no explicit root. Abel and Ruffini showed that no general formula in radicals exists beyond degree , and Galois theory explains why: the permutation group of the roots becomes non-solvable.
In practice, then, roots are computed numerically — Newton's method, the Durand–Kerner algorithm, eigenvalues of the companion matrix — relying on the theorem to know that there really is something to find.
Classic pitfall
Using the theorem to claim that a polynomial with real coefficients factors into factors of degree over . The complete factorization into linear factors takes place in ; over , the quadratic factors with negative discriminant remain. Always check over which set you are asked to factor.

