Fundamental theorem of algebra


The fundamental theorem of algebra states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomials with real coefficients, since every real number is a complex number with its imaginary part equal to zero.
Equivalently, the theorem states that the field of complex numbers is algebraically closed.
The theorem is also stated as follows: every non-zero, single-variable, degree n polynomial with complex coefficients has, counted with multiplicity, exactly n complex roots. The equivalence of the two statements can be proven through the use of successive polynomial division.
In spite of its name, there is no purely algebraic proof of the theorem, since any proof must use some form of the analytic completeness of the real numbers, which is not an algebraic concept. Additionally, it is not fundamental for modern algebra; its name was given at a time when algebra was synonymous with theory of equations.

History

Peter Roth, in his book Arithmetica Philosophica, wrote that a polynomial equation of degree n may have n solutions. Albert Girard, in his book L'invention nouvelle en l'Algèbre, asserted that a polynomial equation of degree n has n solutions, but he did not state that they had to be real numbers. Furthermore, he added that his assertion holds "unless the equation is incomplete", by which he meant that no coefficient is equal to 0. However, when he explains in detail what he means, it is clear that he actually believes that his assertion is always true; for instance, he shows that the equation although incomplete, has four solutions : 1, and
As will be mentioned again below, it follows from the fundamental theorem of algebra that every non-constant polynomial with real coefficients can be written as a product of polynomials with real coefficients whose degrees are either 1 or 2. However, in 1702 Leibniz erroneously said that no polynomial of the type can be written in such a way. Later, Nikolaus Bernoulli made the same assertion concerning the polynomial, but he got a letter from Euler in 1742 in which it was shown that this polynomial is equal to
with
Also, Euler pointed out that
A first attempt at proving the theorem was made by d'Alembert in 1746, but his proof was incomplete. Among other problems, it assumed implicitly a theorem, which would not be proved until more than a century later and using the fundamental theorem of algebra. Other attempts were made by Euler, de Foncenex, Lagrange, and Laplace. These last four attempts assumed implicitly Girard's assertion; to be more precise, the existence of solutions was assumed and all that remained to be proved was that their form was a + bi for some real numbers a and b. In modern terms, Euler, de Foncenex, Lagrange, and Laplace were assuming the existence of a splitting field of the polynomial p.
At the end of the 18th century, two new proofs were published which did not assume the existence of roots, but neither of which was complete. One of them, due to James Wood and mainly algebraic, was published in 1798 and it was totally ignored. Wood's proof had an algebraic gap. The other one was published by Gauss in 1799 and it was mainly geometric, but it had a topological gap, only filled by Alexander Ostrowski in 1920, as discussed in Smale. The first rigorous proof was published by Argand in 1806 ; it was also here that, for the first time, the fundamental theorem of algebra was stated for polynomials with complex coefficients, rather than just real coefficients. Gauss produced two other proofs in 1816 and another incomplete version of his original proof in 1849.
The first textbook containing a proof of the theorem was Cauchy's Cours d'analyse de l'École Royale Polytechnique. It contained Argand's proof, although Argand is not credited for it.
None of the proofs mentioned so far is constructive. It was Weierstrass who raised for the first time, in the middle of the 19th century, the problem of finding a constructive proof of the fundamental theorem of algebra. He presented his solution, that amounts in modern terms to a combination of the Durand–Kerner method with the homotopy continuation principle, in 1891. Another proof of this kind was obtained by Hellmuth Kneser in 1940 and simplified by his son Martin Kneser in 1981.
Without using countable choice, it is not possible to constructively prove the fundamental theorem of algebra for complex numbers based on the Dedekind real numbers. However, Fred Richman proved a reformulated version of the theorem that does work.

Proofs

All proofs below involve some analysis, or at least the topological concept of continuity of real or complex functions. Some also use differentiable or even analytic functions. This fact has led to the remark that the Fundamental Theorem of Algebra is neither fundamental, nor a theorem of algebra.
Some proofs of the theorem only prove that any non-constant polynomial with real coefficients has some complex root. This is enough to establish the theorem in the general case because, given a non-constant polynomial p with complex coefficients, the polynomial
has only real coefficients and, if z is a zero of q, then either z or its conjugate is a root of p.
A large number of non-algebraic proofs of the theorem use the fact that an n-th degree polynomial function p whose dominant coefficient is 1 behaves like zn when |z| is large enough. A more precise statement is: there is some positive real number R such that:
when |z| > R.

Complex-analytic proofs

Find a closed disk D of radius r centered at the origin such that |p| > |p| whenever |z| ≥ r. The minimum of |p| on D, which must exist since D is compact, is therefore achieved at some point z0 in the interior of D, but not at any point of its boundary. The Maximum modulus principle implies then that p = 0. In other words, z0 is a zero of p.
A variation of this proof does not require the use of the maximum modulus principle. If we assume by contradiction that a := p ≠ 0, then, expanding p in powers of z − z0 we can write
Here, the cj are simply the coefficients of the polynomial z → p, and we let k be the index of the first coefficient following the constant term that is non-zero. But now we see that for z sufficiently close to z0 this has behavior asymptotically similar to the simpler polynomial,
in the sense that the function
is bounded by some positive constant M in some neighborhood of z0. Therefore if we define and let, then for any sufficiently small positive number r, using the triangle inequality we see that
When r is sufficiently close to 0 this upper bound for |p| is strictly smaller than |a|, in contradiction to the definition of z0. smaller in absolute value than |p
Another analytic proof can be obtained along this line of thought observing that, since |p| > |p| outside D, the minimum of |p| on the whole complex plane is achieved at z0. If |p| > 0, then 1/p is a bounded holomorphic function in the entire complex plane since, for each complex number z, |1/p| ≤ |1/p|. Applying Liouville's theorem, which states that a bounded entire function must be constant, this would imply that 1/p is constant and therefore that p is constant. This gives a contradiction, and hence p = 0.
Yet another analytic proof uses the argument principle. Let R be a positive real number large enough so that every root of p has absolute value smaller than R; such a number must exist because every non-constant polynomial function of degree n has at most n zeros. For each r > R, consider the number
where c is the circle centered at 0 with radius r oriented counterclockwise; then the argument principle says that this number is the number N of zeros of p in the open ball centered at 0 with radius r, which, since r > R, is the total number of zeros of p. On the other hand, the integral of n/z along c divided by 2πi is equal to n. But the difference between the two numbers is
The numerator of the rational expression being integrated has degree at most n − 1 and the degree of the denominator is n + 1. Therefore, the number above tends to 0 as r → +∞. But the number is also equal to N − n and so N = n.
Still another complex-analytic proof can be given by combining linear algebra with the Cauchy theorem. To establish that every complex polynomial of degree n > 0 has a zero, it suffices to show that every complex square matrix of size n > 0 has a eigenvalue. The proof of the latter statement is by contradiction.
Let A be a complex square matrix of size n > 0 and let In be the unit matrix of the same size. Assume A has no eigenvalues. Consider the resolvent function
which is a meromorphic function on the complex plane with values in the vector space of matrices. The eigenvalues of A are precisely the poles of R. Since, by assumption, A has no eigenvalues, the function R is an entire function and Cauchy theorem implies that
On the other hand, R expanded as a geometric series gives:
This formula is valid outside the closed disc of radius . Let Then
. This is a contradiction, and so A has an eigenvalue.
Finally, Rouché's theorem gives perhaps the shortest proof of the theorem.

Topological proofs

Suppose the minimum of |p| on the whole complex plane is achieved at z0; it was seen at the proof which uses Liouville's theorem that such a number must exist. We can write p as a polynomial in z − z0: there is some natural number k and there are some complex numbers ck, ck + 1,..., cn such that ck ≠ 0 and:
If p is nonzero, it follows that if a is a kth root of −p/ck and if t is positive and sufficiently small, then |p| < |p|, which is impossible, since |p| is the minimum of |p| on D.
For another topological proof by contradiction, suppose that the polynomial p has no roots, and consequently is never equal to 0. Think of the polynomial as a map from the complex plane into the complex plane. It maps any circle |z| = R into a closed loop, a curve P. We will consider what happens to the winding number of P at the extremes when R is very large and when R = 0. When R is a sufficiently large number, then the leading term zn of p dominates all other terms combined; in other words,
When z traverses the circle once counter-clockwise then winds n times counter-clockwise around the origin, and P likewise. At the other extreme, with |z| = 0, the curve P is merely the single point p, which must be nonzero because p is never zero. Thus p must be distinct from the origin, which denotes 0 in the complex plane. The winding number of P around the origin is thus 0. Now changing R continuously will deform the loop continuously. At some R the winding number must change. But that can only happen if the curve P includes the origin for some R. But then for some z on that circle |z| = R we have p = 0, contradicting our original assumption. Therefore, p has at least one zero.

Algebraic proofs

These proofs of the Fundamental Theorem of Algebra must make use of the following two facts about real numbers that are not algebraic but require only a small amount of analysis :
The second fact, together with the quadratic formula, implies the theorem for real quadratic polynomials. In other words, algebraic proofs of the fundamental theorem actually show that if R is any real-closed field, then its extension C = R is algebraically closed.
As mentioned above, it suffices to check the statement "every non-constant polynomial p with real coefficients has a complex root". This statement can be proved by induction on the greatest non-negative integer k such that 2k divides the degree n of p. Let a be the coefficient of zn in p and let F be a splitting field of p over C; in other words, the field F contains C and there are elements z1, z2,..., zn in F such that
If k = 0, then n is odd, and therefore p has a real root. Now, suppose that n = 2km and that the theorem is already proved when the degree of the polynomial has the form 2k − 1m′ with m′ odd. For a real number t, define:
Then the coefficients of qt are symmetric polynomials in the zi with real coefficients. Therefore, they can be expressed as polynomials with real coefficients in the elementary symmetric polynomials, that is, in −a1, a2,..., nan. So qt has in fact real coefficients. Furthermore, the degree of qt is n/2 = 2k−1m, and m is an odd number. So, using the induction hypothesis, qt has at least one complex root; in other words, zi + zj + tzizj is complex for two distinct elements i and j from. Since there are more real numbers than pairs, one can find distinct real numbers t and s such that zi + zj + tzizj and zi + zj + szizj are complex. So, both zi + zj and zizj are complex numbers. It is easy to check that every complex number has a complex square root, thus every complex polynomial of degree 2 has a complex root by the quadratic formula. It follows that zi and zj are complex numbers, since they are roots of the quadratic polynomial z2 − z + zizj.
Joseph Shipman showed in 2007 that the assumption that odd degree polynomials have roots is stronger than necessary; any field in which polynomials of prime degree have roots is algebraically closed. For axiomatization of algebraically closed fields, this is the best possible, as there are counterexamples if a single prime is excluded. However, these counterexamples rely on −1 having a square root. If we take a field where −1 has no square root, and every polynomial of degree n ∈ I has a root, where I is any fixed infinite set of odd numbers, then every polynomial f of odd degree has a root. Mohsen Aliabadi generalized Shipman's result in 2013, providing an independent proof that a sufficient condition for an arbitrary field to be algebraically closed is that it has a root for every polynomial of prime degree.
Another algebraic proof of the fundamental theorem can be given using Galois theory. It suffices to show that C has no proper finite field extension. Let K/C be a finite extension. Since the normal closure of K over R still has a finite degree over C, we may assume without loss of generality that K is a normal extension of R. Let G be the Galois group of this extension, and let H be a Sylow 2-subgroup of G, so that the order of H is a power of 2, and the index of H in G is odd. By the fundamental theorem of Galois theory, there exists a subextension L of K/R such that Gal = H. As = is odd, and there are no nonlinear irreducible real polynomials of odd degree, we must have L = R, thus and are powers of 2. Assuming by way of contradiction that > 1, we conclude that the 2-group Gal contains a subgroup of index 2, so there exists a subextension M of C of degree 2. However, C has no extension of degree 2, because every quadratic complex polynomial has a complex root, as mentioned above. This shows that = 1, and therefore K = C, which completes the proof.

Geometric proofs

There exists still another way to approach the fundamental theorem of algebra, due to J. M. Almira and A. Romero: by Riemannian geometric arguments. The main idea here is to prove that the existence of a non-constant polynomial p without zeros implies the existence of a flat Riemannian metric over the sphere S2. This leads to a contradiction, since the sphere is not flat.
A Riemannian surface is said to be flat if its Gaussian curvature, which we denote by Kg, is identically null. Now, Gauss–Bonnet theorem, when applied to the sphere S2, claims that
which proves that the sphere is not flat.
Let us now assume that n > 0 and
for each complex number z. Let us define
Obviously, p* ≠ 0 for all z in C. Consider the polynomial f = p'p*. Then f ≠ 0 for each z in C. Furthermore,
We can use this functional equation to prove that g, given by
for w in C, and
for w ∈ S2\, is a well defined Riemannian metric over the sphere S'2.
Now, a simple computation shows that
since the real part of an analytic function is harmonic. This proves that Kg'' = 0.

Corollaries

Since the fundamental theorem of algebra can be seen as the statement that the field of complex numbers is algebraically closed, it follows that any theorem concerning algebraically closed fields applies to the field of complex numbers. Here are a few more consequences of the theorem, which are either about the field of real numbers or about the relationship between the field of real numbers and the field of complex numbers:
While the fundamental theorem of algebra states a general existence result, it is of some interest, both from the theoretical and from the practical point of view, to have information on the location of the zeros of a given polynomial. The simpler result in this direction is a bound on the modulus: all zeros ζ of a monic polynomial satisfy an inequality |ζ| ≤ R∞, where
Notice that, as stated, this is not yet an existence result but rather an example of what is called an a priori bound: it says that if there are solutions then they lie inside the closed disk of center the origin and radius R∞. However, once coupled with the fundamental theorem of algebra it says that the disk contains in fact at least one solution. More generally, a bound can be given directly in terms of any p-norm of the n-vector of coefficients that is |ζ| ≤ Rp, where Rp is precisely the q-norm of the 2-vector q being the conjugate exponent of p, for any 1 ≤ p ≤ ∞. Thus, the modulus of any solution is also bounded by
for 1 < p < ∞, and in particular
. The case of a generic polynomial of degree n,
is of course reduced to the case of a monic, dividing all coefficients by an ≠ 0. Also, in case that 0 is not a root, i.e. a0 ≠ 0, bounds from below on the roots ζ follow immediately as bounds from above on, that is, the roots of
Finally, the distance from the roots ζ to any point can be estimated from below and above, seeing as zeros of the polynomial, whose coefficients are the Taylor expansion of P at
Let ζ be a root of the polynomial
in order to prove the inequality |ζ| ≤ Rp we can assume, of course, |ζ| > 1. Writing the equation as
and using the Hölder's inequality we find
Now, if p = 1, this is
thus
In the case 1 < p ≤ ∞, taking into account the summation formula for a geometric progression, we have
thus
and simplifying,
Therefore
holds, for all 1 ≤ p ≤ ∞.

Citations

Historic sources

*