Sturm's theorem

In mathematics, Sturm's theorem yields a symbolic procedure to count the number of distinct real roots of a polynomial located in an interval. It was named for Jacques Charles François Sturm. Whereas the fundamental theorem of algebra readily yields the overall number of complex roots, counted with multiplicity, Sturm's theorem gives information about their location, albeit limited only to the real roots and without counting multiplicity.

Sturm chains

A Sturm chain or Sturm sequence is a finite sequence of polynomials

$p_{0},p_{1},\dots ,p_{m}$

of decreasing degree with these following properties:

• $p_{0}=p$ is square free (no square factors, i.e., no repeated roots);
• if $p(\xi )=0$, then $\operatorname {sign} (p_{1}(\xi ))=\operatorname {sign} (p'(\xi ));$
• if $p_{i}(\xi )=0$ for $0<i<m$ then $\operatorname {sign} (p_{i-1}(\xi ))=-\operatorname {sign} (p_{i+1}(\xi ));$
• $p_{m}$ does not change its sign.

To obtain a Sturm chain, Sturm himself proposed to choose the intermediary results when applying Euclid's algorithm to p and its derivative:

${\begin{aligned}p_{0}(x)&:=p(x),\\p_{1}(x)&:=p'(x),\\p_{2}(x)&:=-{\rm {rem}}(p_{0},p_{1})=p_{1}(x)q_{0}(x)-p_{0}(x),\\p_{3}(x)&:=-{\rm {rem}}(p_{1},p_{2})=p_{2}(x)q_{1}(x)-p_{1}(x),\\&{}\ \ \vdots \\0&=-{\text{rem}}(p_{m-1},p_{m}).\end{aligned}}$

That is, successively take the remainders with polynomial division and change their signs. Since $\operatorname {deg} (p_{i+1})<\operatorname {deg} (p_{i})$ for $0\leq i<m$, the algorithm terminates. The final polynomial, p_m, is the greatest common divisor of p and its derivative. If p is square free, it shares no roots with its derivative, hence p_m will be a non-zero constant polynomial. The Sturm chain, called the canonical Sturm chain, then is

$p_{0},p_{1},p_{2},\ldots ,p_{m}.\,$

If p is not square-free, this sequence does not formally satisfy the definition of a Sturm chain above, nevertheless it still satisfies the conclusion of Sturm's theorem (see below).

Statement

Let $p_{0}=p,p_{1},\dots ,p_{m}$ be a Sturm chain, where p is a square-free polynomial, and let σ(ξ) denote the number of sign changes (zeroes are not counted) in the sequence

$p_{0}(\xi ),p_{1}(\xi ),p_{2}(\xi ),\ldots ,p_{m}(\xi ).\,\!$

Sturm's theorem then states that for two real numbers a < b, the number of distinct roots of p in the half-open interval (a,b] is σ(a) − σ(b).

The non-square-free case

Let $p_{0}=p,p_{1},\dots ,p_{m}$ be the canonical Sturm sequence of a polynomial p, not necessarily square-free. Then σ(a) − σ(b) is the number of distinct roots of p in (a,b] whenever a < b are real numbers such that neither a nor b is a multiple root of p.

Proof

Polynomials are continuous functions, and any sign change must occur at a root, so consider the behavior of a Sturm chain around the roots of its constituent polynomials.

First, note that two adjacent polynomials can share a common root only when it is a multiple root of p (in which case it is a root of every p_i). Indeed, if p_i and p_i−1 are both zero at $\xi$, then p_i+1 also have to be zero at $\xi$, since $\operatorname {sign} (p_{i-1}(\xi ))=-\operatorname {sign} (p_{i+1}(\xi ))$. The zero then propagates recursively up and down the chain, so that $\xi$ is a root of all the polynomials p₀, ..., p_m.

Next, consider roots of polynomials in the interior (i.e., $0<i<m$) of the Sturm chain that are not multiple roots of p. If $p_{i}(\xi )=0$, then we know from the previous paragraph that $p_{i-1}(\xi )\neq 0$ and $p_{i+1}(\xi )\neq 0$. Furthermore, $\operatorname {sign} (p_{i-1}(\xi ))=-\operatorname {sign} (p_{i+1}(\xi ))$, so in the vicinity of $\xi$ we've got a single sign change across p_i−1, p_i, p_i+1. In other words, sign changes in the interior of the Sturm chain do not affect the total number of sign changes across the chain.

So only roots of the original polynomial, at the top of the chain, can affect the total number of sign changes. Consider a root $\xi$, so $p(\xi )=0$, and assume first that it is a simple root. Then p's derivative, which is p₁, must be non-zero at $\xi$, so p must be either increasing or decreasing at $\xi$. If it's increasing, then its sign is changing from negative to positive as we move from left to right while its derivative (again, p₁) is positive, so the total number of sign changes decreases by one. Conversely, if it's decreasing, then its sign changes from positive to negative while its derivative is negative, so again the total number of sign changes decreases by one.

Finally, let $\xi$ be a multiple root of p, and let p₀, ..., p_m be the canonical Sturm chain. Let d = gcd(p,p'), q = p/d, and let q₀, ..., q_m' be the canonical Sturm chain of q. Then m = m' and p_i = q_id for every i. In particular, σ(x) is the same for both chains whenever x is not a root of d. Then the number of sign changes (in either chain) around $\xi$ decreases by one, since $\xi$ is a simple root of q.

In summary, only sign changes at roots of the original polynomial affect the total number of sign changes across the chain, and the total number of sign changes always decreases by one as we pass a root. The theorem follows directly.

Applications

Bounds

This can be used to compute the total number of real roots a polynomial has (to use, for example, as an input to a numerical root finder) by choosing a and b appropriately. For example, a bound due to Cauchy says that all real roots of a polynomial with coefficients a_i are in the interval [−M, M], where

$M=1+{\frac {\max _{i=0}^{n-1}|a_{i}|}{|a_{n}|}}.\,\!$

Alternatively, we can use the fact that for large x, the sign of

$p(x)=a_{n}x^{n}+\cdots \,\!$

is ${\text{sign}}(a_{n})$, whereas ${\text{sign}}(p(-x))$ is $(-1)^{n}a_{n}$.

In this way, simply counting the sign changes in the leading coefficients in the Sturm chain readily gives the number of distinct real roots of a polynomial.

We can also determine the multiplicity of a given root, say ξ, with the help of Sturm's theorem. Indeed, suppose we know a and b bracketing ξ, with σ(a) − σ(b) = 1. Then, ξ has multiplicity k precisely when ξ is a root with multiplicity k − 1 of p_m (since it is the GCD of p and its derivative).

Quotient

The remainder is needed to compute the chain using Euclid's algorithm. For two polynomials $p(x)=\sum _{k=0}^{i}p_{k}x^{k}$ and ${\tilde {p}}(x)=\sum _{k=0}^{i-1}{\tilde {p}}_{k}x^{k}$ this is accomplished (for non-vanishing ${\tilde {p}}_{i-1}$) by

${\rm {rem}}(p,{\tilde {p}})={\tilde {p}}_{i-1}\cdot p(x)-p_{i}\cdot {\tilde {p}}(x)\left(x+{\frac {p_{i-1}}{p_{i}}}-{\frac {{\tilde {p}}_{i-2}}{{\tilde {p}}_{i-1}}}\right),$

where the quotient is built solely of the first two leading coefficients.

Generalized Sturm chains

Let ξ be in the compact interval [a,b]. A generalized Sturm chain over [a,b] is a finite sequence of real polynomials (X₀,X₁,…,X_r) such that:

1. X(a)X(b) ≠ 0
2. sign(X_r) is constant on [a,b]
3. If X_i(ξ) = 0 for 1 ≤ i ≤ r−1, then X_i−1(ξ)X_i+1(ξ) < 0.

One can check that each Sturm chain is indeed a generalized Sturm chain.

See also

• Routh–Hurwitz theorem
• Hurwitz's theorem (complex analysis)
• Descartes' rule of signs
• Rouché's theorem
• Properties of polynomial roots
• Gauss–Lucas theorem
• Turán's inequalities
• D.G. Hook and P.R. McAree, "Using Sturm Sequences To Bracket Real Roots of Polynomial Equations" in Graphic Gems I (A. Glassner ed.), Academic Press, p. 416–422, 1990.

References

• Sylvester, J. J. (1853). "On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm's functions, and that of the greatest algebraical common measure". Phil. Trans. Roy. Soc. London. 143: 407–548. JSTOR 108572.
• Thomas, Joseph Miller (1941). "Sturm's theorem for multiple roots". National Mathematics Magazine. 15 (8): 391–394. JSTOR 3028551. MR 0005945.
• Heindel, Lee E. (1971), "Integer arithmetic algorithms for polynonial real zero determination", Proc. SYMSAC '71: 415, doi:10.1145/800204.806312, MR 0300434
• Collins, George E.; Akritas, Alkiviadis G. (1976), "Polynomial real root isolationusing Descarte's rule of signs", Proc. SYMSAC '76: 272, doi:10.1145/800205.806346
• Panton, Don B.; Verdini, William A. (1981). "A fortran program for applying Sturm's theorem in counting internal rates of return". J. Financ. Quant. Anal. 16 (3): 381–388. JSTOR 2330245.
• Akritas, Alkiviadis G. (1982). "Reflections on a pair of theorems by Budan and Fourier". Math. Mag. 55 (5): 292–298. JSTOR 2690097. MR 0678195.
• Petersen, Paul (1991). "Multivariate Sturm theory". Lecture Notes in Comp. Science. 539: 318–332. doi:10.1007/3-540-54522-0_120. MR 1229329.
• Yap, Chee (2000). Fundamental Problems in Algorithmic Algebra. Oxford University Press. ISBN 0-19-512516-9. {{cite book}}: Cite has empty unknown parameter: |1= (help)

External links

• C code from Graphic Gems by D.G. Hook and P.R. McAree.