Incubator escapee wiki

Sturm's theorem

Article Discussion

Template:Short description In mathematics, the Sturm sequence of a univariate polynomial Template:Mvar is a sequence of polynomials associated with Template:Mvar and its derivative by a variant of Euclid's algorithm for polynomials. Sturm's theorem expresses the number of distinct real roots of Template:Mvar located in an interval in terms of the number of changes of signs of the values of the Sturm 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 Template:Mvar.<ref name=bpr>Template:Harv</ref>

Whereas the fundamental theorem of algebra readily yields the overall number of complex roots, counted with multiplicity, it does not provide a procedure for calculating them. Sturm's theorem counts the number of distinct real roots and locates them in intervals. By subdividing the intervals containing some roots, it can isolate the roots into arbitrarily small intervals, each containing exactly one root. This yields the oldest real-root isolation algorithm, and arbitrary-precision root-finding algorithm for univariate polynomials.

For computing over the reals, Sturm's theorem is less efficient than other methods based on Descartes' rule of signs. However, it works on every real closed field, and, therefore, remains fundamental for the theoretical study of the computational complexity of decidability and quantifier elimination in the first order theory of real numbers.

The Sturm sequence and Sturm's theorem are named after Jacques Charles François Sturm, who discovered the theorem in 1829.<ref>Template:MacTutor Biography</ref>

The theoremEdit

The Sturm chain or Sturm sequence of a univariate polynomial Template:Math with real coefficients is the sequence of polynomials <math>P_0, P_1, \ldots,</math> such that

<math>\begin{align}

P_0&=P,\\ P_1&=P',\\ P_{i+1}&=-\operatorname{rem}(P_{i-1},P_i), \end{align}</math> for Template:Math, where Template:Math is the derivative of Template:Mvar, and <math>\operatorname{rem}(P_{i-1},P_i)</math> is the remainder of the Euclidean division of <math>P_{i-1}</math> by <math>P_{i}.</math> The length of the Sturm sequence is at most the degree of Template:Mvar.

The number of sign variations at Template:Mvar of the Sturm sequence of Template:Mvar is the number of sign changes (ignoring zeros) in the sequence of real numbers

<math>P_0(\xi), P_1(\xi),P_2(\xi),\ldots.</math>

This number of sign variations is denoted here Template:Math.

Sturm's theorem states that, if Template:Mvar is a square-free polynomial, the number of distinct real roots of Template:Mvar in the half-open interval Template:Math is Template:Math (here, Template:Mvar and Template:Mvar are real numbers such that Template:Math).<ref name="bpr" />

The theorem extends to unbounded intervals by defining the sign at Template:Math of a polynomial as the sign of its leading coefficient (that is, the coefficient of the term of highest degree). At Template:Math the sign of a polynomial is the sign of its leading coefficient for a polynomial of even degree, and the opposite sign for a polynomial of odd degree.

In the case of a non-square-free polynomial, if neither Template:Mvar nor Template:Mvar is a multiple root of Template:Mvar, then Template:Math is the number of distinct real roots of Template:Mvar.

The proof of the theorem is as follows: when the value of Template:Mvar increases from Template:Mvar to Template:Mvar, it may pass through a zero of some <math>P_i</math> (Template:Math); when this occurs, the number of sign variations of <math>(P_{i-1}, P_i, P_{i+1})</math> does not change. When Template:Mvar passes through a root of <math>P_0=P,</math> the number of sign variations of <math>(P_0, P_1)</math> decreases from 1 to 0. These are the only values of Template:Mvar where some sign may change.

ExampleEdit

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

<math>\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}</math>

The remainder of the Euclidean division of Template:Math by Template:Math is <math>-\tfrac{3}{16}x^2-\tfrac{3}{4}x-\tfrac{15}{16};</math> multiplying it by Template:Math we obtain

<math>p_2(x)=\tfrac{3}{16}x^2+\tfrac{3}{4}x+\tfrac{15}{16}</math>.

Next dividing Template:Math by Template:Math and multiplying the remainder by Template:Math, we obtain

<math>p_3(x)=-32x-64</math>.

Now dividing Template:Math by Template:Math and multiplying the remainder by Template:Math, we obtain

<math>p_4(x)=-\tfrac{3}{16}</math>.

As this is a constant, this finishes the computation of the Sturm sequence.

To find the number of real roots of <math>p_0</math> one has to evaluate the sequences of the signs of these polynomials at Template:Math and Template:Math, which are respectively Template:Math and Template:Math. Thus

<math>V(-\infty)-V(+\infty) = 3-1=2,</math>

where Template:Mvar denotes the number of sign changes in the sequence, which shows that Template:Mvar has two real roots.

This can be verified by noting that Template:Math can be factored as Template:Math, where the first factor has the roots Template:Math and Template:Math, and second factor has no real roots. This last assertion results from the quadratic formula, and also from Sturm's theorem, which gives the sign sequences Template:Math at Template:Math and Template:Math at Template:Math.

GeneralizationEdit

Sturm sequences have been generalized in two directions. To define each polynomial in the sequence, Sturm used the negative of the remainder of the Euclidean division of the two preceding ones. The theorem remains true if one replaces the negative of the remainder by its product or quotient by a positive constant or the square of a polynomial. It is also useful (see below) to consider sequences where the second polynomial is not the derivative of the first one.

A generalized Sturm sequence is a finite sequence of polynomials with real coefficients

<math>P_0, P_1, \dots, P_m</math>

such that

The last condition implies that two consecutive polynomials do not have any common real root. In particular the original Sturm sequence is a generalized Sturm sequence, if (and only if) the polynomial has no multiple real root (otherwise the first two polynomials of its Sturm sequence have a common root).

When computing the original Sturm sequence by Euclidean division, it may happen that one encounters a polynomial that has a factor that is never negative, such a <math>x^2</math> or <math>x^2+1</math>. In this case, if one continues the computation with the polynomial replaced by its quotient by the nonnegative factor, one gets a generalized Sturm sequence, which may also be used for computing the number of real roots, since the proof of Sturm's theorem still applies (because of the third condition). This may sometimes simplify the computation, although it is generally difficult to find such nonnegative factors, except for even powers of Template:Mvar.

Use of pseudo-remainder sequencesEdit

In computer algebra, the polynomials that are considered have integer coefficients or may be transformed to have integer coefficients. The Sturm sequence of a polynomial with integer coefficients generally contains polynomials whose coefficients are not integers (see above example).

To avoid computation with rational numbers, a common method is to replace Euclidean division by pseudo-division for computing polynomial greatest common divisors. This amounts to replacing the remainder sequence of the Euclidean algorithm by a pseudo-remainder sequence, a pseudo remainder sequence being a sequence <math>p_0, \ldots, p_k</math> of polynomials such that there are constants <math>a_i</math> and <math>b_i</math> such that <math>b_ip_{i+1}</math> is the remainder of the Euclidean division of <math>a_ip_{i-1}</math> by <math>p_i.</math> (The different kinds of pseudo-remainder sequences are defined by the choice of <math>a_i</math> and <math>b_i;</math> typically, <math>a_i</math> is chosen for not introducing denominators during Euclidean division, and <math>b_i</math> is a common divisor of the coefficients of the resulting remainder; see Pseudo-remainder sequence for details.) For example, the remainder sequence of the Euclidean algorithm is a pseudo-remainder sequence with <math>a_i=b_i=1</math> for every Template:Mvar, and the Sturm sequence of a polynomial is a pseudo-remainder sequence with <math>a_i=1</math> and <math>b_i=-1</math> for every Template:Mvar.

Various pseudo-remainder sequences have been designed for computing greatest common divisors of polynomials with integer coefficients without introducing denominators (see Pseudo-remainder sequence). They can all be made generalized Sturm sequences by choosing the sign of the <math>b_i</math> to be the opposite of the sign of the <math>a_i.</math> This allows the use of Sturm's theorem with pseudo-remainder sequences.

Root isolationEdit

For a polynomial with real coefficients, root isolation consists of finding, for each real root, an interval that contains this root, and no other roots.

This is useful for root finding, allowing the selection of the root to be found and providing a good starting point for fast numerical algorithms such as Newton's method; it is also useful for certifying the result, as if Newton's method converge outside the interval one may immediately deduce that it converges to the wrong root.

Root isolation is also useful for computing with algebraic numbers. For computing with algebraic numbers, a common method is to represent them as a pair of a polynomial to which the algebraic number is a root, and an isolation interval. For example <math>\sqrt 2</math> may be unambiguously represented by <math>(x^2-2, [0,2]).</math>

Sturm's theorem provides a way for isolating real roots that is less efficient (for polynomials with integer coefficients) than other methods involving Descartes' rule of signs. However, it remains useful in some circumstances, mainly for theoretical purposes, for example for algorithms of real algebraic geometry that involve infinitesimals.<ref name=mpi>Template:Harv</ref>

For isolating the real roots, one starts from an interval <math>(a,b]</math> containing all the real roots, or the roots of interest (often, typically in physical problems, only positive roots are interesting), and one computes <math>V(a)</math> and <math>V(b).</math> For defining this starting interval, one may use bounds on the size of the roots (see Template:Slink). Then, one divides this interval in two, by choosing Template:Mvar in the middle of <math>(a,b].</math> The computation of <math>V(c)</math> provides the number of real roots in <math>(a,c]</math> and <math>(c,b],</math> and one may repeat the same operation on each subinterval. When one encounters, during this process an interval that does not contain any root, it may be suppressed from the list of intervals to consider. When one encounters an interval containing exactly one root, one may stop dividing it, as it is an isolation interval. The process stops eventually, when only isolating intervals remain.

This isolating process may be used with any method for computing the number of real roots in an interval. Theoretical complexity analysis and practical experiences show that methods based on Descartes' rule of signs are more efficient. It follows that, nowadays, Sturm sequences are rarely used for root isolation.

ApplicationEdit

Generalized Sturm sequences allow counting the roots of a polynomial where another polynomial is positive (or negative), without computing these root explicitly. If one knows an isolating interval for a root of the first polynomial, this allows also finding the sign of the second polynomial at this particular root of the first polynomial, without computing a better approximation of the root.

Let Template:Math and Template:Math be two polynomials with real coefficients such that Template:Mvar and Template:Mvar have no common root and Template:Mvar has no multiple roots. In other words, Template:Mvar and Template:Math are coprime polynomials. This restriction does not really affect the generality of what follows as GCD computations allows reducing the general case to this case, and the cost of the computation of a Sturm sequence is the same as that of a GCD.

Let Template:Math denote the number of sign variations at Template:Mvar of a generalized Sturm sequence starting from Template:Mvar and Template:Math. If Template:Math are two real numbers, then Template:Math is the number of roots of Template:Mvar in the interval <math>(a,b]</math> such that Template:Math minus the number of roots in the same interval such that Template:Math. Combined with the total number of roots of Template:Mvar in the same interval given by Sturm's theorem, this gives the number of roots of Template:Mvar such that Template:Math and the number of roots of Template:Mvar such that Template:Math.<ref name="bpr" />

See alsoEdit

Template:Div col

Template:Div col end

ReferencesEdit

Template:Reflist

Retrieved from "https://zalansite.site/mediawiki/index.php?title=Sturm%27s_theorem&oldid=703623"