Sturm's theorem

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, the Sturm's sequence of a polynomial p is a sequence of polynomials associated to p and its derivative by a variant of Euclid's algorithm for polynomials. Sturm's theorem expresses the number of distinct real roots of p located in an interval in terms of the number of changes of signs of the values of the Sturm's sequence at the bounds of the interval. Applied to the interval of all the real numbers, it gives the total number of real roots of p.

Whereas the fundamental theorem of algebra readily yields the overall number of complex roots, counted with multiplicity, Sturm's theorem yields the number of distinct real roots and locates them in intervals. By subdividing the intervals containing some roots, it allows eventually to isolate the roots in arbitrary small intervals each containing exactly one root. This yields a symbolic root finding algorithm, that is available in most computer algebra systems, although some more efficient methods are now usually preferred (see below).

Sturm's sequence and Sturm's theorems are named after Jacques Charles François Sturm.

Sturm chains[edit]

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:

  • p0 = p is square free (no square factors, i.e., no repeated roots);
  • if p(ξ) = 0, then sign(p1(ξ)) = sign(p′(ξ));
  • if pi(ξ) = 0 for 0 < i < m then sign(pi−1(ξ)) = −sign(pi+1(ξ));
  • pm does not change its sign.

It can be noted that Sturm's sequence is a modification of Fourier's sequence.

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

\begin{align}
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{align}

where rem(pi, pj) and qi are the remainder and the quotient of the polynomial long division of pi by pj, and where m is the minimal number of polynomial divisions (never greater than deg(p)) needed to obtain a zero remainder. That is, successively take the remainders with polynomial division and change their signs. Since deg(pi+1) < deg(pi) for 0 ≤ i < m, the algorithm terminates. The final polynomial, pm, is the greatest common divisor of p and its derivative. If p is square free, it shares no roots with its derivative, hence pm 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[edit]

Let p = p0, ..., pm be a Sturm chain, where p is a square-free polynomial, and let σ(ξ) denote the number of sign changes (ignoring zeroes) 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[edit]

Let p = p0, ..., pm 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.

Example[edit]

Suppose we wish to find the number of roots in some range for the polynomial p(x)=x^4+x^3-x-1. So

\begin{align} p_0(x) &=p(x)=x^4+x^3-x-1 \\
p_1(x)&=p'(x)=4x^3+3x^2-1
\end{align}

Using polynomial long division to divide p0 by p1 gives the remainder -\tfrac{3}{16}x^2-\tfrac{3}{4}x-\tfrac{15}{16}, and upon multiplying this remainder by −1 we obtain p_2(x)=\tfrac{3}{16}x^2+\tfrac{3}{4}x+\tfrac{15}{16}. Next dividing p1 by p2 and multiplying the remainder by −1, we obtain p_3(x)=-32x-64. And dividing p2 by p3 and multiplying the remainder by −1, we obtain p_4(x)=-\tfrac{3}{16}.

Thus the complete chain of Sturm polynomials is:

p_0(x) = x^4+x^3-x-1
p_1(x) = 4x^3+3x^2-1
p_2(x) = \tfrac{3}{16}x^2+\tfrac{3}{4}x+\tfrac{15}{16}
p_3(x) = -32x-64
p_4(x) = -\tfrac{3}{16}

To find the number of roots between −∞ and , first evaluate p0, p1, p2, p3, and p4 at −∞ and note the sequence of signs of the results: + − + + −, which contains three sign changes (+ to , then to +, then + to ). The same procedure for gives the sign sequence + + + − −, which contains just one sign change. Hence the number of roots of the original polynomial between −∞ and is 3 − 1 = 2. That this is correct can be seen by noting that p(x) = x4 + x3x − 1 can be factored as (x2 − 1)(x2 + x + 1), where it is readily verifiable that x2 − 1 has the two roots −1 and 1 while x2 + x + 1 has no real roots. In more complicated examples in which there is no advance knowledge of the roots because factoring is either impossible or impractical, one can experiment with various finite bounds for the range to be considered, thus narrowing down the locations of the roots.

Proof[edit]

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 pi). Indeed, if pi(ξ) = pi−1 (ξ) = 0, then pi+1(ξ) = 0, since sign(pi−1(ξ)) = −sign(pi+1(ξ)). The zero then propagates recursively up and down the chain, so that ξ is a root of all the polynomials p0, ..., pm.

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 pi(ξ) = 0, then from the previous paragraph it is true that pi−1(ξ) ≠ 0 and pi+1(ξ) ≠ 0. Furthermore, sign(pi−1(ξ)) = −sign(pi+1(ξ)). Since pi−1 and pi+1 are continuous, sign(pi+1(x)) = −sign(pi−1(x)) for every x in the vicinity of ξ. Similarly, the sign of pi(x) is constant before and after ξ, and changes as x is crossing ξ. Thus, whenever x is crossing ξ, moving from left to right, the part pi−1, pi, pi+1 of the Sturm chain looses a sign change at one side, and acquires a new sign change at the other side. Consequently, the total number of sign changes is never affected by the polynomial variations in the interior of the chain, and only roots of the original polynomial, at the top of the chain, can affect the total number of sign changes.

Consider a root ξ, so p(ξ), and assume first that it is a simple root. Then the derivative of p, which is p1, must be non-zero at ξ, so p must be either increasing or decreasing at ξ. If it's increasing, then its sign is changing from negative to positive when moving from left to right while its derivative (again, p1) 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 ξ be a multiple root of p, and let p0, ..., pm be the canonical Sturm chain. Let d = gcd(p,p′), q = p/d, and let q0, ..., qm′ be the canonical Sturm chain of q. Then m = m′ and pi = qid 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 ξ decreases by one, since ξ 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 roots are passed. The theorem follows directly.

History section and other related methods[edit]

For counting and isolating the real roots, other methods are usually preferred, because they are computationally more efficient; these methods all use Descartes' rule of signs (just like Fourier[1] did back in 1820) and Vincent's theorem. Interestingly, the very first one of those methods[2] was initially called "modified Uspensky's algorithm" by its inventors, but it was later shown that there is no Uspensky's method;[3] afterwards, people started calling it either "Collins-Akritas method"[4] or "Descartes' method" only to be shown that there is no Descartes' method[4] either. Finally, François Boulier, of the University of Lille,[5] p. 24, gave it the name "Vincent-Collins-Akritas" (VCA for short) to also give credit to Vincent. VCA is a bisection method; there exists also a continued fractions method based on Vincent's theorem namely, the Vincent-Akritas-Strzeboński (VAS) method.[6]

VAS is based on Budan's theorem whereas Sturm's method has been inspired by Fourier's theorem. In fact Sturm himself,[7] p. 108, acknowledges the great influence Fourier's theorem had on him: « C'est en m'appuyant sur les principes qu'il a posés, et en imitant ses démonstrations, que j'ai trouvé les nouveaux théorèmes que je vais énoncer. » which translates to "It is by relying upon the principles he has laid out and by imitating his proofs that I have found the new theorems which I am about to announce."

Applications[edit]

Number of real roots[edit]

Sturm's theorem can be used to compute the total number of real roots of a polynomial.

This may be done by choosing a = b = M where M is larger than the absolute value of every root. For example, a bound due to Cauchy says that all real roots of a polynomial with coefficients ai are in the interval [−M, M], where

M = 1 + \frac{\max_{i=0}^{n-1} |a_i|}{|a_n|}.

Although theoretically the above approach is the simplest, in practice bounds on the positive (only) roots of polynomials are used and the positive roots are isolated and evaluated first; the negative roots are treated by first substituting x by −x, then compute a new (positive root) bound to isolate and evaluate the negative roots. Sturm's method and VCA need to compute only one bound to isolate the positive roots. By contrast, to isolate the positive roots VAS needs to compute various positive bounds, for the various polynomials that appear in the process. Efficient bounds on the values of the positive roots are described in P. S. Vigklas' Ph.D. Thesis[8] and in.[9]

Another method is computationally simpler. One can use the fact that for large x, the sign of

p(x)=a_n x^n+\cdots

is sign(an), whereas sign(p(−x)) is (−1)nan. 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.

Sturm's theorem allows also to determine the multiplicity of a given root, say ξ. Indeed, suppose that a < ξ < b, with σ(a) − σ(b) = 1. Then, ξ has multiplicity k precisely when ξ is a root with multiplicity k − 1 of pm (since it is the GCD of p and its derivative). Thus the multiplicity of ξ may be computed by recursively applying Sturm's theorem to pm. However, this method is rarely used, as square-free factorization is computationally more efficient for this purpose.

Quotient[edit]

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, \qquad \widetilde{p}(x)=\sum_{k=0}^{i-1}\widetilde{p}_k x^k, \quad \widetilde{p}_{i-1} \neq 0,

this is accomplished by

\text{rem} \left (p, \widetilde{p} \right )= \widetilde{p}_{i-1}\cdot p(x)- p_i\cdot\widetilde{p}(x)\left(x+\frac{p_{i-1}}{p_i}-\frac{\widetilde{p}_{i-2}}{\widetilde{p}_{i-1}}\right),

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

Generalized Sturm chains[edit]

Let ξ be in the compact interval [a, b]. A generalized Sturm chain over [a, b] is a finite sequence of real polynomials (X0, X1, ..., Xr) such that:

  1. X(a)X(b) ≠ 0
  2. sign(Xr) is constant on [a, b]
  3. If Xi(ξ) = 0 for 1 ≤ ir − 1, then Xi−1(ξ)Xi+1(ξ) < 0.

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

See also[edit]

References[edit]

  1. ^ Fourier, Jean Baptiste Joseph (1820). "Sur l'usage du théorème de Descartes dans la recherche des limites des racines". Bulletin des Sciences, par la Société Philomatique de Paris: 156–165. 
  2. ^ Collins, George E.; Alkiviadis G. Akritas (1976). Polynomial Real Root Isolation Using Descartes' Rule of Signs. SYMSAC '76, Proceedings of the third ACM symposium on Symbolic and algebraic computation. Yorktown Heights, NY, USA: ACM. pp. 272–275. 
  3. ^ Akritas, Alkiviadis G. (1986). There is no "Uspensky's Method". In: Proceedings of the fifth ACM Symposium on Symbolic and Algebraic Computation (SYMSAC '86, Waterloo, Ontario, Canada), pp. 88–90. 
  4. ^ a b Akritas, Alkiviadis G. (2008). There is no "Descartes' method". In: M.J.Wester and M. Beaudin (Eds), Computer Algebra in Education, AullonaPress, USA, pp. 19-35. 
  5. ^ Boulier, François (2010). Systèmes polynomiaux : que signifie " résoudre " ?. Université Lille 1. 
  6. ^ Akritas, Alkiviadis G.; A.W. Strzeboński, P.S. Vigklas (2008). "Improving the performance of the continued fractions method using new bounds of positive roots". Nonlinear Analysis: Modelling and Control 13: 265–279. 
  7. ^ Hourya, Benis-Sinaceur (1988). "Deux moments dans l'histoire du Théorème d'algèbre de Ch. F. Sturm". In: Revue d'histoire des sciences 41 (2): 99–132. 
  8. ^ Vigklas, Panagiotis, S. (2010). Upper bounds on the values of the positive roots of polynomials. Ph.D. Thesis, University of Thessaly, Greece. 
  9. ^ Akritas, Alkiviadis, G. (2009). "Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials". Journal of Universal Computer Science 15 (3): 523–537. 
  • Sturm, Jacques Charles François (1829). "Mémoire sur la résolution des équations numériques". Bulletin des Sciences de Férussac 11: 419–425. 
  • 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. doi:10.1098/rstl.1853.0018. 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 polynomial real zero determination, Proc. SYMSAC '71: 415, doi:10.1145/800204.806312, MR 0300434 
  • 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. 
  • 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. Zbl 1072.30006. 
  • Baumol, William. Economic Dynamics, section "Sturm's Theorem"

External links[edit]

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