Geometrical properties of polynomial roots

Short description: Geometry of the location of polynomial roots

In mathematics, a univariate polynomial of degree n with real or complex coefficients has n complex roots, if counted with their multiplicities. They form a multiset of n points in the complex plane. This article concerns the geometry of these points, that is the information about their localization in the complex plane that can be deduced from the degree and the coefficients of the polynomial.

Some of these geometrical properties are related to a single polynomial, such as upper bounds on the absolute values of the roots, which define a disk containing all roots, or lower bounds on the distance between two roots. Such bounds are widely used for root-finding algorithms for polynomials, either for tuning them, or for computing their computational complexity.

Some other properties are probabilistic, such as the expected number of real roots of a random polynomial of degree n with real coefficients, which is less than [math]\displaystyle{ 1+\frac 2\pi \ln (n) }[/math] for n sufficiently large.

In this article, a polynomial that is considered is always denoted

[math]\displaystyle{ p(x)=a_0 + a_1 x + \cdots + a_n x^n, }[/math]

where [math]\displaystyle{ a_0, \dots, a_n }[/math] are real or complex numbers and [math]\displaystyle{ a_n \neq 0 }[/math]; thus n is the degree of the polynomial.

Continuous dependence on coefficients

The n roots of a polynomial of degree n depend continuously on the coefficients. For simple roots, this results immediately from the implicit function theorem. This is true also for multiple roots, but some care is needed for the proof.

A small change of coefficients may induce a dramatic change of the roots, including the change of a real root into a complex root with a rather large imaginary part (see Wilkinson's polynomial). A consequence is that, for classical numeric root-finding algorithms, the problem of approximating the roots given the coefficients is ill-conditioned for many inputs.

Conjugation

The complex conjugate root theorem states that if the coefficients of a polynomial are real, then the non-real roots appear in pairs of the form (a + ib, a – ib).

It follows that the roots of a polynomial with real coefficients are mirror-symmetric with respect to the real axis.

This can be extended to algebraic conjugation: the roots of a polynomial with rational coefficients are conjugate (that is, invariant) under the action of the Galois group of the polynomial. However, this symmetry can rarely be interpreted geometrically.

Bounds on all roots

Upper bounds on the absolute values of polynomial roots are widely used for root-finding algorithms, either for limiting the regions where roots should be searched, or for the computation of the computational complexity of these algorithms.

Many such bounds have been given, and the sharper one depends generally on the specific sequence of coefficient that are considered. Most bounds are greater or equal to one, and are thus not sharp for a polynomial which have only roots of absolute values lower than one. However, such polynomials are very rare, as shown below.

Any upper bound on the absolute values of roots provides a corresponding lower bound. In fact, if [math]\displaystyle{ a_n\ne 0, }[/math] and U is an upper bound of the absolute values of the roots of

[math]\displaystyle{ a_0 + a_1 x + \cdots + a_n x^n, }[/math]

then 1/U is a lower bound of the absolute values of the roots of

[math]\displaystyle{ a_n + a_{n-1} x + \cdots + a_0 x^n, }[/math]

since the roots of either polynomial are the multiplicative inverses of the roots of the other. Therefore, in the remainder of the article lower bounds will not be given explicitly.

Lagrange's and Cauchy's bounds

Lagrange and Cauchy were the first to provide upper bounds on all complex roots. Lagrange's bound is

[math]\displaystyle{ \max\left\{1,\sum_{i=0}^{n-1} \left|\frac{a_i}{a_n}\right|\right\}, }[/math]

and Cauchy's bound is

[math]\displaystyle{ 1+\max\left\{ \left|\frac{a_{n-1}}{a_n}\right|, \left|\frac{a_{n-2}}{a_n}\right|, \ldots, \left|\frac{a_0}{a_n}\right|\right\} }[/math]

Lagrange's bound is sharper (smaller) than Cauchy's bound only when 1 is larger than the sum of all [math]\displaystyle{ \left|\frac{a_i}{a_n}\right| }[/math] but the largest. This is relatively rare in practice, and explains why Cauchy's bound is more widely used than Lagrange's.

Both bounds result from the Gershgorin circle theorem applied to the companion matrix of the polynomial and its transpose. They can also be proved by elementary methods.

Proof of Lagrange's and Cauchy's bounds

If z is a root of the polynomial, and |z| ≥ 1 one has [math]\displaystyle{ |a_n||z^n| = \left|\sum_{i=0}^{n-1}a_iz^i\right| \le \sum_{i=0}^{n-1}|a_iz^i| \le \sum_{i=0}^{n-1}|a_i||z|^{n-1}. }[/math] Dividing by [math]\displaystyle{ |a_n||z|^{n-1}, }[/math] one gets [math]\displaystyle{ |z|\le \sum_{i=0}^{n-1}\frac{|a_i|}{|a_n|}, }[/math] which is Lagrange's bound when there is at least one root of absolute value larger than 1. Otherwise, 1 is a bound on the roots, and is not larger than Lagrange's bound. Similarly, for Cauchy's bound, one has, if |z| ≥ 1, [math]\displaystyle{ |a_n||z^n| = \left|\sum_{i=0}^{n-1}a_iz^i\right| \le \sum_{i=0}^{n-1}|a_iz^i| \le \max |a_i|\sum_{i=0}^{n-1}|z|^i = \frac{|z|^n-1}{|z|-1}\max |a_i| \le \frac{|z|^n}{|z|-1}\max |a_i|. }[/math] Thus [math]\displaystyle{ |a_n|(|z|-1) \le \max |a_i|. }[/math] Solving in |z|, one gets Cauchy's bound if there is a root of absolute value larger than 1. Otherwise the bound is also correct, as Cauchy's bound is larger than 1.

These bounds are not invariant by scaling. That is, the roots of the polynomial p(sx) are the quotient by s of the root of p, and the bounds given for the roots of p(sx) are not the quotient by s of the bounds of p. Thus, one may get sharper bounds by minimizing over possible scalings. This gives

[math]\displaystyle{ \min_{s\in \mathbb R_+}\left(\max\left\{ s,\sum_{i=0}^{n-1} \left|\frac{a_i}{a_n}\right|s^{i-n+1}\right\}\right), }[/math]

and

[math]\displaystyle{ \min_{s\in \mathbb R_+}\left(s+\max_{0\le i\le n-1}\left(\left|\frac{a_i}{a_n}\right| s^{i-n+1}\right)\right), }[/math]

for Lagrange's and Cauchy's bounds respectively.

Another bound, originally given by Lagrange, but attributed to Zassenhaus by Donald Knuth, is

[math]\displaystyle{ 2\max\left\{ \left|\frac{a_{n-1}}{a_n}\right|, \left|\frac{a_{n-2}}{a_{n}}\right|^{1/2}, \ldots, \left|\frac{a_0}{a_n}\right|^{1/n}\right\}. }[/math]

This bound is invariant by scaling.

Proof of the preceding bound

Let A be the largest [math]\displaystyle{ \left|\frac{a_i}{a_n}\right|^\frac 1{n-i} }[/math] for 0 ≤ i < n. Thus one has [math]\displaystyle{ \frac {|a_{i}|}{|a_n|} \le A^{n-i} }[/math] for [math]\displaystyle{ 0\le i \lt n. }[/math] If z is a root of p, one has [math]\displaystyle{ -a_nz^n=\sum_{i=0}^{n-1}a_i z^i, }[/math] and thus, after dividing by [math]\displaystyle{ a_n, }[/math] [math]\displaystyle{ \begin{align} |z|^n&\le\sum_{i=0}^{n-1}A^{n-i}|z|^i\\ &=A\frac{|z|^{n}-A^{n}}{|z|-A}. \end{align} }[/math] As we want to prove |z| ≤ 2A, we may suppose that |z| > A (otherwise there is nothing to prove). Thus [math]\displaystyle{ |z|^n \le A\frac{|z|^n}{|z|-A}, }[/math] which gives the result, since [math]\displaystyle{ |z|\gt A. }[/math]

Lagrange improved this latter bound into the sum of the two largest values (possibly equal) in the sequence

[math]\displaystyle{ \left[ \left|\frac{a_{n-1}}{a_n}\right|, \left|\frac{a_{n-2}}{a_{n}}\right|^{1/2}, \ldots, \left|\frac{a_0}{a_n}\right|^{1/n}\right]. }[/math]

Lagrange also provided the bound

[math]\displaystyle{ \sum_i \left|\frac{a_i}{a_{i+1}}\right|, }[/math]

where [math]\displaystyle{ a_i }[/math] denotes the ith nonzero coefficient when the terms of the polynomials are sorted by increasing degrees.

Using Hölder's inequality

Hölder's inequality allows the extension of Lagrange's and Cauchy's bounds to every h-norm. The h-norm of a sequence

[math]\displaystyle{ s=(a_0, \ldots, a_n) }[/math]

is

[math]\displaystyle{ \|s\|_h = \left(\sum_{i=1}^n |a_i|^h\right)^{1/h}, }[/math]

for any real number h ≥ 1, and

[math]\displaystyle{ \|s\|_\infty = \textstyle{\max_{i=1}^n} |a_i|. }[/math]

If [math]\displaystyle{ \frac 1h+ \frac 1k=1, }[/math] with 1 ≤ h, k ≤ ∞, and 1 / ∞ = 0, an upper bound on the absolute values of the roots of p is

[math]\displaystyle{ \frac 1{|a_n|}\left\|(|a_n|, \left\|(|a_{n-1}|, \ldots, |a_0| \right)\|_h\right)\|_k. }[/math]

For k = 1 and k = ∞, one gets respectively Cauchy's and Lagrange's bounds.

For h = k = 2, one has the bound

[math]\displaystyle{ \frac 1{|a_n|}\sqrt{|a_n|^2+|a_{n-1}|^2+ \cdots +|a_0|^2 }. }[/math]

This is not only a bound of the absolute values of the roots, but also a bound of the product of their absolute values larger than 1; see § Landau's inequality, below.

Proof

Let z be a root of the polynomial [math]\displaystyle{ p(x)=a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x +a_0. }[/math] Setting [math]\displaystyle{ A=\left(\frac{|a_{n-1}|}{|a_n|},\ldots, \frac{|a_1|}{|a_n|},\frac{|a_0|}{|a_n|}\right), }[/math] we have to prove that every root z of p satisfies [math]\displaystyle{ z\le \left\|(1, \left\|A\right\|_h\right)\|_k. }[/math] If [math]\displaystyle{ |z| \le 1, }[/math] the inequality is true; so, one may suppose [math]\displaystyle{ |z| \gt 1 }[/math] for the remainder of the proof. Writing the equation as [math]\displaystyle{ -z^n=\frac{a_{n-1}}{a_n}z^{n-1}+\cdots+\frac{a_1}{a_n}z+\frac{a_0}{a_n}, }[/math] Hölder's inequality implies [math]\displaystyle{ |z|^n\leq \|A\|_h \cdot\left \|(z^{n-1},\ldots,z, 1) \right \|_k. }[/math] If k = ∞, this is [math]\displaystyle{ |z|^n\leq\|A\|_1\max \left \{|z|^{n-1},\ldots,|z|,1 \right \} =\|A\|_1|z|^{n-1}. }[/math] Thus [math]\displaystyle{ |z|\leq \max\{1,\|A\|_1\}. }[/math] In the case 1 ≤ k < ∞, the summation formula for a geometric progression, gives [math]\displaystyle{ |z|^n\leq \|A\|_h \left(|z|^{k(n-1)}+\cdots+|z|^k +1\right)^{\frac{1}{k}}=\|A\|_h \left(\frac{|z|^{kn}-1}{|z|^k-1}\right)^{\frac{1}{k}}\leq\|A\|_h \left(\frac{|z|^{kn}}{|z|^k-1}\right)^\frac{1}{k}. }[/math] Thus [math]\displaystyle{ |z|^{kn}\leq \left(\|A\|_h\right)^k \frac{|z|^{kn}}{|z|^k-1}, }[/math] which simplifies to [math]\displaystyle{ |z|^k\leq 1+\left(\|A\|_h\right)^k. }[/math] Thus, in all cases [math]\displaystyle{ |z|\leq \left \| \left (1,\|A\|_h \right ) \right \|_k, }[/math] which finishes the proof.

Other bounds

Many other upper bounds for the magnitudes of all roots have been given.

Fujiwara's bound

[math]\displaystyle{ 2\, \max \left\{ \left|\frac{a_{n-1}}{a_n}\right|, \left|\frac{a_{n-2}}{a_n}\right|^{\frac{1}{2}}, \ldots, \left|\frac{a_1}{a_n}\right|^\frac{1}{n-1}, \left|\frac{a_0}{2a_n}\right|^\frac 1 n\right\},  }[/math] 

slightly improves the bound given above by dividing the last argument of the maximum by two.

Kojima's bound is

[math]\displaystyle{ 2\,\max \left\{ \left|\frac{a_{n-1}}{a_n}\right|,\left|\frac{a_{n-2}}{a_{n-1}}\right|, \ldots, \left|\frac{a_0}{2a_1}\right|\right\}, }[/math]

where [math]\displaystyle{ a_i }[/math] denotes the ith nonzero coefficient when the terms of the polynomials are sorted by increasing degrees. If all coefficients are nonzero, Fujiwara's bound is sharper, since each element in Fujiwara's bound is the geometric mean of first elements in Kojima's bound.

Sun and Hsieh obtained another improvement on Cauchy's bound. Assume the polynomial is monic with general term a_ixⁱ. Sun and Hsieh showed that upper bounds 1 + d₁ and 1 + d₂ could be obtained from the following equations.

[math]\displaystyle{ d_1 = \tfrac{1}{2} \left((| a_{n-1}| - 1) + \sqrt{(|a_{n-1}| - 1 )^2 + 4a } \right), \qquad a = \max \{ |a_i | \}. }[/math]

d₂ is the positive root of the cubic equation

[math]\displaystyle{ Q(x) = x^3 + (2 - |a_{n-1}|) x^2 + (1 - |a_{n-1}| - |a_{n-2}| ) x - a, \qquad a = \max \{ |a_i | \} }[/math]

They also noted that d₂ ≤ d₁.

Landau's inequality

The previous bounds are upper bounds for each root separately. Landau's inequality provides an upper bound for the absolute values of the product of the roots that have an absolute value greater than one. This inequality, discovered in 1905 by Edmund Landau, has been forgotten and rediscovered at least three times during the 20th century.

This bound of the product of roots is not much greater than the best preceding bounds of each root separately. Let [math]\displaystyle{ z_1, \ldots, z_n }[/math] be the n roots of the polynomial p. If

[math]\displaystyle{ M(p)=|a_n|\prod_{j=1}^n \max(1,|z_j|) }[/math]

is the Mahler measure of p, then

[math]\displaystyle{ M(p)\le \sqrt{\sum_{k=0}^n |a_k|^2}. }[/math]

Surprisingly, this bound of the product of the absolute values larger than 1 of the roots is not much larger than the best bounds of one root that have been given above for a single root. This bound is even exactly equal to one of the bounds that are obtained using Hölder's inequality.

This bound is also useful to bound the coefficients of a divisor of a polynomial with integer coefficients: if

[math]\displaystyle{ q= \sum_{k=0}^m b_k x^k }[/math]

is a divisor of p, then

[math]\displaystyle{ |b_m|\le|a_n|, }[/math]

and, by Vieta's formulas,

[math]\displaystyle{ \frac{|b_i|}{|b_m|}\le \binom mi \frac{M(p)}{|a_n|}, }[/math]

for i = 0, ..., m, where [math]\displaystyle{ \binom mi }[/math] is a binomial coefficient. Thus

[math]\displaystyle{ |b_i|\le \binom mi M(p)\le \binom mi \sqrt{\sum_{k=0}^n |a_k|^2}, }[/math]

and

[math]\displaystyle{ \sum_{i=0}^m |b_k| \le 2^m M(p) \le 2^m \sqrt{\sum_{k=0}^n |a_k|^2}. }[/math]

Discs containing some roots

From Rouché theorem

Rouché's theorem allows defining discs centered at zero and containing a given number of roots. More precisely, if there is a positive real number R and an integer 0 ≤ k ≤ n such that

[math]\displaystyle{ |a_k| R^k \gt |a_0|+\cdots+|a_{k-1}| R^{k-1}+|a_{k+1}| R^{k+1}+\cdots+|a_n| R^n, }[/math]

then there are exactly k roots, counted with multiplicity, of absolute value less than R.

Proof

If [math]\displaystyle{ |z|=R, }[/math] then [math]\displaystyle{ \begin{align} |a_0 &+\cdots+a_{k-1}z^{k-1}+a_{k+1} z^{k+1}+\cdots+a_n z^n|\\ &\le |a_0|+\cdots+|a_{k-1}| R^{k-1}+|a_{k+1}| R^{k+1}+\cdots+|a_n| R^n\\ &\le |a_k| R^k \le |a_k z^k|. \end{align} }[/math] By Rouché's theorem, this implies directly that [math]\displaystyle{ p(z) }[/math] and [math]\displaystyle{ z^k }[/math] have the same number of roots of absolute values less than R, counted with multiplicities. As this number is k, the result is proved.

The above result may be applied if the polynomial

[math]\displaystyle{ h_k(x)=|a_0| +\cdots+|a_{k-1}| x^{k-1}-|a_k|x^k+|a_{k+1}| x^{k+1}+\cdots+|a_n| x^n. }[/math]

takes a negative value for some positive real value of x.

In the remaining of the section, suppose that a₀ ≠ 0. If it is not the case, zero is a root, and the localization of the other roots may be studied by dividing the polynomial by a power of the indeterminate, getting a polynomial with a nonzero constant term.

For k = 0 and k = n, Descartes' rule of signs shows that the polynomial has exactly one positive real root. If [math]\displaystyle{ R_0 }[/math] and [math]\displaystyle{ R_n }[/math] are these roots, the above result shows that all the roots satisfy

[math]\displaystyle{ R_0\le |z| \le R_1. }[/math]

As these inequalities apply also to [math]\displaystyle{ h_0 }[/math] and [math]\displaystyle{ h_n, }[/math] these bounds are optimal for polynomials with a given sequence of the absolute values of their coefficients. They are thus sharper than all bounds given in the preceding sections.

For 0 < k < n, Descartes' rule of signs implies that [math]\displaystyle{ h_k(x) }[/math] either has two positive real roots that are not multiple, or is nonnegative for every positive value of x. So, the above result may be applied only in the first case. If [math]\displaystyle{ R_{k,1}\lt R_{k,2} }[/math] are these two roots, the above result implies that

[math]\displaystyle{ |z| \le R_{k,1} }[/math]

for k roots of p, and that

[math]\displaystyle{ |z| \ge R_{k,2} }[/math]

for the n – k other roots.

Instead of explicitly computing [math]\displaystyle{ R_{k,1} }[/math] and [math]\displaystyle{ R_{k,2}, }[/math] it is generally sufficient to compute a value [math]\displaystyle{ R_k }[/math] such that [math]\displaystyle{ h_k(R_k)\lt 0 }[/math] (necessarily [math]\displaystyle{ R_{k,1}\lt R_k\lt R_{k,2} }[/math]). These [math]\displaystyle{ R_k }[/math] have the property of separating roots in terms of their absolute values: if, for h < k, both [math]\displaystyle{ R_h }[/math] and [math]\displaystyle{ R_k }[/math] exist, there are exactly k – h roots z such that [math]\displaystyle{ R_h \lt |z| \lt R_k. }[/math]

For computing [math]\displaystyle{ R_k, }[/math] one can use the fact that [math]\displaystyle{ \frac{h(x)}{x^k} }[/math] is a convex function (its second derivative is positive). Thus [math]\displaystyle{ R_k }[/math] exists if and only if [math]\displaystyle{ \frac{h(x)}{x^k} }[/math] is negative at its unique minimum. For computing this minimum, one can use any optimization method, or, alternatively, Newton's method for computing the unique positive zero of the derivative of [math]\displaystyle{ \frac{h(x)}{x^k} }[/math] (it converges rapidly, as the derivative is a monotonic function).

One can increase the number of existing [math]\displaystyle{ R_k }[/math]'s by applying the root squaring operation of the Dandelin–Graeffe iteration. If the roots have distinct absolute values, one can eventually completely separate the roots in terms of their absolute values, that is, compute n + 1 positive numbers [math]\displaystyle{ R_0 \lt R_1 \lt \dots \lt R_n }[/math] such there is exactly one root with an absolute value in the open interval [math]\displaystyle{ (R_{k-1},R_k), }[/math] for k = 1, ..., n.

From Gershgorin circle theorem

The Gershgorin circle theorem applies the companion matrix of the polynomial on a basis related to Lagrange interpolation to define discs centered at the interpolation points, each containing a root of the polynomial; see Durand–Kerner method § Root inclusion via Gerschgorin's circles for details.

If the interpolation points are close to the roots of the roots of the polynomial, the radii of the discs are small, and this is a key ingredient of Durand–Kerner method for computing polynomial roots.

Bounds of real roots

For polynomials with real coefficients, it is often useful to bound only the real roots. It suffices to bound the positive roots, as the negative roots of p(x) are the positive roots of p(–x).

Clearly, every bound of all roots applies also for real roots. But in some contexts, tighter bounds of real roots are useful. For example, the efficiency of the method of continued fractions for real-root isolation strongly depends on tightness of a bound of positive roots. This has led to establishing new bounds that are tighter than the general bounds of all roots. These bounds are generally expressed not only in terms of the absolute values of the coefficients, but also in terms of their signs.

Other bounds apply only to polynomials whose all roots are reals (see below).

Bounds of positive real roots

To give a bound of the positive roots, one can assume [math]\displaystyle{ a_n \gt 0 }[/math] without loss of generality, as changing the signs of all coefficients does not change the roots.

Every upper bound of the positive roots of

[math]\displaystyle{ q(x)=a_nx^n + \sum_{i=0}^{n-1} \min(0,a_i)x^i }[/math]

is also a bound of the real zeros of

[math]\displaystyle{ p(x)=\sum_{i=0}^n a_ix^i }[/math].

In fact, if B is such a bound, for all x > B, one has p(x) ≥ q(x) > 0.

Applied to Cauchy's bound, this gives the upper bound

[math]\displaystyle{ 1+{\textstyle\max_{i=0}^{n-1}} \frac{-a_i}{a_n} }[/math]

for the real roots of a polynomial with real coefficients. If this bound is not greater than 1, this means that all nonzero coefficients have the same sign, and that there is no positive root.

Similarly, another upper bound of the positive roots is

[math]\displaystyle{ 2\,{\max_{a_ia_n\lt 0}}\left(\frac{-a_i}{a_n}\right)^{\frac 1{n-i}}. }[/math]

If all nonzero coefficients have the same sign, there is no positive root, and the maximum must be zero.

Other bounds have been recently developed, mainly for the method of continued fractions for real-root isolation.

Polynomials whose roots are all real

If all roots of a polynomial are real, Laguerre proved the following lower and upper bounds of the roots, by using what is now called Samuelson's inequality.

Let [math]\displaystyle{ \sum_{k=0}^n a_k x^k }[/math] be a polynomial with all real roots. Then its roots are located in the interval with endpoints

[math]\displaystyle{ -\frac{a_{n-1}}{na_n} \pm \frac{n-1}{na_n}\sqrt{a^2_{n-1} - \frac{2n}{n-1}a_n a_{n-2}}. }[/math]

For example, the roots of the polynomial [math]\displaystyle{ x^4+5x^3+5x^2-5x-6=(x+3)(x+2)(x+1)(x-1) }[/math] satisfy

[math]\displaystyle{ -3.8118\lt -\frac{5}{4} - \frac{3}{4}\sqrt{\frac{35}{3}}\le x\le -\frac{5}{4} + \frac{3}{4}\sqrt{\frac{35}{3}}\lt 1.3118. }[/math]

Root separation

The root separation of a polynomial is the minimal distance between two roots, that is the minimum of the absolute values of the difference of two roots:

[math]\displaystyle{ \operatorname{sep}(p) = \min\{|\alpha-\beta|\;;\; \alpha \neq \beta \text{ and } p(\alpha)=p(\beta)=0\} }[/math]

The root separation is a fundamental parameter of the computational complexity of root-finding algorithms for polynomials. In fact, the root separation determines the precision of number representation that is needed for being certain of distinguishing distinct roots. Also, for real-root isolation, it allows bounding the number of interval divisions that are needed for isolating all roots.

For polynomials with real or complex coefficients, it is not possible to express a lower bound of the root separation in terms of the degree and the absolute values of the coefficients only, because a small change on a single coefficient transforms a polynomial with multiple roots into a square-free polynomial with a small root separation, and essentially the same absolute values of the coefficient. However, involving the discriminant of the polynomial allows a lower bound.

For square-free polynomials with integer coefficients, the discriminant is an integer, and has thus an absolute value that is not smaller than 1. This allows lower bounds for root separation that are independent from the discriminant.

Mignotte's separation bound is

[math]\displaystyle{ \operatorname{sep}(p) \gt \frac {\sqrt{3|\Delta(p)|}}{n^{(n+1)/2}(\|p\|_2)^{n-1}}, }[/math]

where [math]\displaystyle{ \Delta(p) }[/math] is the discriminant, and [math]\displaystyle{ \textstyle\|p\|_2=\sqrt{a_0^2+a_1^2+\dots+a_n^2}. }[/math]

For a square free polynomial with integer coefficients, this implies

[math]\displaystyle{ \operatorname{sep}(p) \gt \frac {\sqrt 3}{n^{n/2+1}(\|p\|_2)^{n-1}}\gt \frac 1{2^{2s^2}}, }[/math]

where s is the bit size of p, that is the sum of the bitsize of its coefficients.

Gauss–Lucas theorem

The Gauss–Lucas theorem states that the convex hull of the roots of a polynomial contains the roots of the derivative of the polynomial.

A sometimes useful corollary is that, if all roots of a polynomial have positive real part, then so do the roots of all derivatives of the polynomial.

A related result is Bernstein's inequality. It states that for a polynomial P of degree n with derivative P′ we have

[math]\displaystyle{ \max_{|z| \leq 1} \big|P'(z)\big| \le n \max_{|z| \leq 1} \big|P(z)\big|. }[/math]

Statistical distribution of the roots

If the coefficients a_i of a random polynomial are independently and identically distributed with a mean of zero, most complex roots are on the unit circle or close to it. In particular, the real roots are mostly located near ±1, and, moreover, their expected number is, for a large degree, less than the natural logarithm of the degree.

If the coefficients are Gaussian distributed with a mean of zero and variance of σ then the mean density of real roots is given by the Kac formula

[math]\displaystyle{ m( x ) = \frac { \sqrt{ A( x ) C( x ) - B( x )^2 }} {\pi A( x )} }[/math]

where

[math]\displaystyle{ \begin{align} A(x) &= \sigma \sum_{i=0}^{n-1} x^{2i} = \sigma \frac{x^{2n} - 1}{x^2-1}, \\ B(x) &= \frac 1 2 \frac{ d } { dx } A( x ), \\ C(x) &= \frac 1 4 \frac{d^2} {dx^2} A(x) + \frac 1 { 4x } \frac d {dx} A(x). \end{align} }[/math]

When the coefficients are Gaussian distributed with a non-zero mean and variance of σ, a similar but more complex formula is known.

Real roots

For large n, the mean density of real roots near x is asymptotically

[math]\displaystyle{ m( x ) = \frac{ 1 } { \pi | 1 - x^2 | } }[/math]

if [math]\displaystyle{ x^2-1\ne 0, }[/math] and

[math]\displaystyle{ m(\pm 1) = \frac 1 \pi \sqrt {\frac{n^2 - 1}{12}} }[/math]

It follows that the expected number of real roots is, using big O notation

[math]\displaystyle{ N_n = \frac 2 \pi \ln n + C + \frac 2 {\pi n} +O( n^{ -2 } ) }[/math]

where C is a constant approximately equal to 0.6257358072.

In other words, the expected number of real roots of a random polynomial of high degree is lower than the natural logarithm of the degree.

Kac, Erdős and others have shown that these results are insensitive to the distribution of the coefficients, if they are independent and have the same distribution with mean zero. However, if the variance of the ith coefficient is equal to [math]\displaystyle{ \binom ni, }[/math] the expected number of real roots is [math]\displaystyle{ \sqrt n. }[/math]

Geometry of multiple roots

A polynomial [math]\displaystyle{ p }[/math] can be written in the form of

[math]\displaystyle{ p(x) = a (x-z_1)^{m_1} \cdots (x-z_k)^{m_k} }[/math]

with distinct roots [math]\displaystyle{ z_1,\ldots,z_k }[/math] and corresponding multiplicities [math]\displaystyle{ m_1,\ldots,m_k }[/math]. A root [math]\displaystyle{ z_j }[/math] is a simple root if [math]\displaystyle{ m_j=1 }[/math] or a multiple root if [math]\displaystyle{ m_j\ge 2 }[/math]. Simple roots are Lipschitz continuous with respect to coefficients but multiple roots are not. In other words, simple roots have bounded sensitivities but multiple roots are infinitely sensitive if the coefficients are perturbed arbitrarily. As a result, most root-finding algorithms suffer substantial loss of accuracy on multiple roots in numerical computation.

In 1972, William Kahan proved that there is an inherent stability of multiple roots. Kahan discovered that polynomials with a particular set of multiplicities form what he called a pejorative manifold and proved that a multiple root is Lipschitz continuous if the perturbation maintains its multiplicity.

This geometric property of multiple roots is crucial in numerical computation of multiple roots.

See also

• Descartes' rule of signs – Link between the number of positive roots of a polynomial and the signs of its coefficients
• Marden's theorem – On zeros of derivatives of cubic polynomials
• Newton's identities – Relations between power sums and elementary symmetric functions
• Quadratic function
• Real-root isolation – Methods for locating real roots of a polynomial
• Square-free polynomial – Polynomial with no repeated root
• Vieta's formulas – Relating coefficients and roots of a polynomial
• Cohn's theorem relating the roots of a self-inversive polynomial with the roots of the reciprocal polynomial of its derivative.

References

• Rahman, Q. I.; Schmeisser, G. (2002). Analytic theory of polynomials. London Mathematical Society Monographs. New Series. 26. Oxford: Oxford University Press. ISBN 0-19-853493-0. 
• Yap, Chee-Keng (2000). Fundamental problems of algorithmic algebra. Oxford University Press. ISBN 978-0195125160. http://160592857366.free.fr/joe/ebooks/ShareData/Fundamental%20Problems%20in%20Algorithmic%20Algebra%201993%20Yap.pdf. .

External links

• The beauty of the roots, a visualization of the distribution of all roots of all polynomials with degree and integer coefficients in some range.