Descartes' rule of signs
In mathematics, Descartes' rule of signs, first described by René Descartes in his work La Géométrie, is a technique for determining an upper bound on the number of positive or negative real roots of a polynomial. It is not a complete criterion, because it does not provide the exact number of positive or negative roots.
The rule is applied by counting the number of sign changes in the sequence formed by the polynomial's coefficients. If a coefficient is zero, that term is simply omitted from the sequence.
Descartes' rule of signs
The rule states that if the terms of a single-variable polynomial with real coefficients are ordered by descending variable exponent, then the number of positive roots of the polynomial is either equal to the number of sign differences between consecutive nonzero coefficients, or is less than it by an even number. Multiple roots of the same value are counted separately.
As a corollary of the rule, the number of negative roots is the number of sign changes after multiplying the coefficients of odd-power terms by −1, or fewer than it by an even number. This procedure is equivalent to substituting the negation of the variable for the variable itself. For example, to find the number of negative roots of , we equivalently ask how many positive roots there are for in Using Descartes' rule of signs on gives the number of positive roots of g, and since it gives the number of positive roots of f, which is the same as the number of negative roots of f.
Example: real roots
has one sign change between the second and third terms (the sequence of pairs of successive signs is ++, +−, −−). Therefore it has exactly one positive root. Note that the leading sign needs to be considered although in this particular example it does not affect the answer. To find the number of negative roots, change the signs of the coefficients of the terms with odd exponents, i.e., apply Descartes' rule of signs to the polynomial , to obtain a second polynomial
This polynomial has two sign changes (the sequence of pairs of successive signs is −+, ++, +−), meaning that this second polynomial has two or zero positive roots; thus the original polynomial has two or zero negative roots.
In fact, the factorization of the first polynomial is
so the roots are −1 (twice) and 1.
The factorization of the second polynomial is
So here, the roots are 1 (twice) and −1, the negation of the roots of the original polynomial.
Any nth degree polynomial has exactly n roots in the complex plane, if counted according to multiplicity. So if f(x) is a polynomial which does not have a root at 0 (which can be determined by inspection) then the minimum number of nonreal roots is equal to
where p denotes the maximum number of positive roots, q denotes the maximum number of negative roots (both of which can be found using Descartes' rule of signs), and n denotes the degree of the equation.
Example: zero coefficients, nonreal roots
has one sign change, so the maximum number of positive real roots is 1. From
we can tell that the polynomial has no negative real roots. So the minimum number of nonreal roots is
Since nonreal roots of a polynomial with real coefficients must occur in conjugate pairs, we can see that x3 − 1 has exactly 2 nonreal roots and 1 real (and positive) root.
The subtraction of only multiples of 2 from the maximal number of positive roots occurs because the polynomial may have nonreal roots, which always come in pairs since the rule applies to polynomials whose coefficients are real. Thus if the polynomial is known to have all real roots, this rule allows one to find the exact number of positive and negative roots. Since it is easy to determine the multiplicity of zero as a root, the sign of all roots can be determined in this case.
If the real polynomial P has k real positive roots counted with multiplicity, then for every a > 0 there are at least k changes of sign in the sequence of coefficients of the Taylor series of the function eaxP(x). For a sufficiently large, there are exactly k such changes of sign.
In the 1970s Askold Georgevich Khovanskiǐ developed the theory of fewnomials that generalises Descartes' rule. The rule of signs can be thought of as stating that the number of real roots of a polynomial is dependent on the polynomial's complexity, and that this complexity is proportional to the number of monomials it has, not its degree. Khovanskiǐ showed that this holds true not just for polynomials but for algebraic combinations of many transcendental functions, the so-called Pfaffian functions.
- Sturm's theorem
- Rational root theorem
- Polynomial function theorems for zeros
- Properties of polynomial roots
- Gauss–Lucas theorem
- Budan's theorem
- D.R. Curtiss, Recent extensions of Descartes' rule of signs, Annals of Maths., Vol. 19, No. 4, 1918, 251 - 278.
- Vladimir P. Kostov, A mapping defined by the Schur-Szegő composition, Comptes Rendus Acad. Bulg. Sci. tome 63, No. 7, 2010, 943 - 952.
- Khovanskiǐ, A.G. (1991). Fewnomials. Translations of Mathematical Monographs. Translated from the Russian by Smilka Zdravkovska. Providence, RI: American Mathematical Society. p. 88. ISBN 0-8218-4547-0. Zbl 0728.12002.