Budan's theorem explained

In mathematics, Budan's theorem is a theorem for bounding the number of real roots of a polynomial in an interval, and computing the parity of this number. It was published in 1807 by François Budan de Boislaurent.

A similar theorem was published independently by Joseph Fourier in 1820. Each of these theorems is a corollary of the other. Fourier's statement appears more often in the literature of the 19th century and has been referred to as Fourier's, Budan–Fourier, Fourier–Budan, and even Budan's theorem.

Budan's original formulation is used in fast modern algorithms for real-root isolation of polynomials.

Sign variation

Let

c _{0,} c _{1,} c _{2,} \ldots c _{k} be a finite sequence of real numbers. A sign variation or sign change in the sequence is a pair of indices such that c _{ic} _{j} < 0 , and either or c _{k} = 0 for all such that .

In other words, a sign variation occurs in the sequence at each place where the signs change, when ignoring zeros.

For studying the real roots of a polynomial, the number of sign variations of several sequences may be used. For Budan's theorem, it is the sequence of the coefficients. For the Fourier's theorem, it is the sequence of values of the successive derivatives at a point. For Sturm's theorem it is the sequence of values at a point of the Sturm sequence.

Descartes' rule of signs

See main article: Descartes' rule of signs.

All results described in this article are based on Descartes' rule of signs.

If is a univariate polynomial with real coefficients, let us denote by the number of its positive real roots, counted with their multiplicity,^[1] and by the number of sign variations in the sequence of its coefficients. Descartes's rule of signs asserts that

is a nonnegative even integer.

In particular, if, then one has .

Budan's statement

Given a univariate polynomial with real coefficients, let us denote by the number of real roots, counted with their multiplicities, of in a half-open interval (with real numbers). Let us denote also by the number of sign variations in the sequence of the coefficients of the polynomial . In particular, one has with the notation of the preceding section.

Budan's theorem is the following:

v _{\ell(p)-v} _{r(p)-\#} _{(\ell,r]} is a nonnegative even integer.

As

\# _{(\ell,r]} is non negative, this implies v _{\ell(p)\ge} v _{r(p).}

This is a generalization of Descartes' rule of signs, as, if one chooses sufficiently large, it is larger than all real roots of, and all the coefficients of

p _{r(x)} are positive, that is v _{r(p)=0.} Thus v _{0(p)=} v _{0(p)-} v _{r(p),} and \# _{+} = \# _{(0,r)} , which makes Descartes' rule of signs a special case of Budan's theorem.

As for Descartes' rule of signs, if

v _{\ell(p)-v} _{r(p)\le} 1 , one has \# _{(\ell,r]} = v _{\ell(p)-v} _{r(p).} This means that, if v _{\ell(p)-v} _{r(p)\le} 1 one has a "zero-root test" and a "one-root test".

Examples

1. Given the polynomial

p(x) = x ^{3} -7 x + 7 , and the open interval ( 0 , 2 ) , one has\begin{align}p(x +0 )& = p(x) = x ^{3} -7 x + 7 \\ p(x +2 )& = (x +2 ) ^{3} -7 (x +2 ) + 7= x ^{3+6x} ^{2+5x+1 \end{align}.}

Thus,

v _{0(p)-v} _{2(p)=} 2-0=2 , and Budan's theorem asserts that the polynomial p(x) has either two or zero real roots in the open interval ( 0 , 2 ).

2. With the same polynomial

p(x) = x ^{3} -7 x + 7 one hasp(x +1 ) = (x +1 ) ^{3} -7 (x +1 ) + 7= x ^{3+3x} ^{2-4x+1.} Thus, v _{0(p)-v} _{1(p)=} 2-2=0 , and Budan's theorem asserts that the polynomial p(x) has no real root in the open interval ( 0 , 1 ). This is an example of the use of Budan's theorem as a zero-root test.

Fourier's statement

Fourier's theorem on polynomial real roots, also called Fourier–Budan theorem or Budan–Fourier theorem (sometimes just Budan's theorem) is exactly the same as Budan's theorem, except that, for and, the sequence of the coefficients of is replaced by the sequence of the derivatives of at .

p(x) = \sum ^{\deg p} _{i =0} (p ^{(i)} (h))/(i!) (x - h) ^{i} of the polynomial at, which implies that the coefficient of in is the quotient of p ^{(i)} (h) by, a positive number. Thus the sequences considered in Fourier's theorem and in Budan's theorem have the same number of sign variations.

This strong relationship between the two theorems may explain the priority controversy that occurred in 19th century, and the use of several names for the same theorem. In modern usage, for computer computation, Budan's theorem is generally preferred since the sequences have much larger coefficients in Fourier's theorem than in Budan's, because of the factorial factor.

Proof

As each theorem is a corollary of the other, it suffices to prove Fourier's theorem.

Proof:

Let

n be the degree of f , so that f, f', ..., f ^{(n-1)} are nonconstant polynomials, f ^{(n)} is a nonzero constant, and f ^{(n+1)} , ... are all identically zero.

As a function of

t, the sign variation v _{t(f)} can only varies at a root of at least one of f, f', ..., f ^{(n-1)} .

If

v _{t(f)} varies at t = r , then for some k , f ^{(k)} (x) has a root at t , and each of f, f', ..., f ^{(k-1)} has no root at t .

If

k =0 , then f(x) = (x - r) ^{s} p(x - r) for some s \geq 1 and some polynomial p that satisfies p( 0 ) ≠ 0 . By explicitly computing f, f', ..., f ^{(n)} at r and r - \epsilon for a small \epsilon , we have v _{r(f)} = v _{r-\epsilon} (f) - s - 2 s', \exists s' \geq 0 .

In this equation, the term

- s is due to the signs of f, f', ..., f ^{(s)} changing from ( -1 ) ^{s\operatorname{sign}(p(0)),} ( -1 ) ^{s-1} \operatorname{sign}(p( 0 )), ..., - \operatorname{sign}(p( 0 )), \operatorname{sign}(p( 0 )) to 0 , 0 , ..., 0 , \operatorname{sign}(p( 0 )) . The term - 2 s', \exists s' \geq 0 is due to the higher derivative signs possibly becoming zero.

If

k \geq 1 , then since some derivatives are zeroed at r , but both f ^{(k-1)} (x) and f ^{(n)} (x) remain nonzero, we only lose an even number of sign changes:

$$v\_r(f)\; =\; v\_(f)\; -\; 2s\text{'},\; \backslash quad\; \backslash exists\; s\text{'}\; \backslash geq\; 0$$

If

v _{t(f)} varies at t = l , then arguing similarly, we find that for both cases, we can take a small \epsilon such that v _{l+\epsilon} (f) = v _{l(f)} .

History

The problem of counting and locating the real roots of a polynomial started to be systematically studied only inthe beginning of the 19th century.

In 1807, François Budan de Boislaurent discovered a method for extending Descartes' rule of signs—valid for the interval —to any interval.^[2]

Joseph Fourier published a similar theorem in 1820,^[3] on which he worked for more than twenty years.

Because of the similarity between the two theorems, there was a priority controversy,^{[4] [5]} despite the fact that the two theorems were discovered independently. It was generally Fourier's formulation and proof that were used, during the 19th century, in textbooks on the theory of equations.

Use in 19th century

Budan's and Fourier's theorems were soon considered of a great importance, although they do not solve completely the problem of counting the number of real roots of a polynomial in an interval. This problem was completely solved in 1827 by Sturm.

Although Sturm's theorem is not based on Descartes' rule of signs, Sturm's and Fourier's theorems are related not only by the use of the number of sign variations of a sequence of numbers, but also by a similar approach of the problem. Sturm himself acknowledged having been inspired by Fourier's methods:^[6] « 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 into « 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 present. »

Because of this, during the 19th century, Fourier's and Sturm's theorems appeared together in almost all books on the theory of equations.

Fourier and Budan left open the problem of reducing the size of the intervals in which roots are searched in a way that, eventually, the difference between the numbers of sign variations is at most one, allowing certifying that the final intervals contains at most one root each. This problem was solved in 1834 by Alexandre Joseph Hidulph Vincent.^[7] Roughly speaking, Vincent's theorem consists of using continued fractions for replacing Budan's linear transformations of the variable by Möbius transformations.

Budan's, Fourier's and Vincent theorem sank into oblivion at the end of 19th century. The last author mentioning these theorems before the second half of 20th century Joseph Alfred Serret.^[8] They were introduced again in 1976 by Collins and Akritas, for providing, in computer algebra, an efficient algorithm for real roots isolation on computers.^[9]

See also

• Properties of polynomial roots
• Root-finding algorithm

Notes and References

1. This means that a root of multiplicity is counted as roots.
2. Book: Budan, François D.. Nouvelle méthode pour la résolution des équations numériques. 1807. Courcier. Paris.
3. Fourier. Jean Baptiste Joseph. Sur l'usage du théorème de Descartes dans la recherche des limites des racines. 1820. Bulletin des Sciences, par la Société Philomatique de Paris. 156–165.
4. Akritas. Alkiviadis G.. On the Budan–Fourier Controversy. ACM SIGSAM Bulletin. 1981. 15. 1. 8–10. 10.1145/1089242.1089243. 6086015. free.
5. Akritas. Alkiviadis G.. Reflections on a Pair of Theorems by Budan and Fourier. 2690097. 1982. Mathematics Magazine. 55. 5. 292–298. 10.2307/2690097.
6. 10.3406/rhs.1988.4093 . Deux moments dans l'histoire du Théorème d'algèbre de Ch. F. Sturm . 1988 . Benis-Sinaceur . Hourya . Revue d'Histoire des Sciences . 41 . 2 . 99–132 (p. 108) . 201270382 .
7. Vincent. Alexandre Joseph Hidulph. Mémoire sur la résolution des équations numériques . Mémoires de la Société Royale des Sciences, de l' Agriculture et des Arts, de Lille. 1834. 1–34.
8. Book: Serret, Joseph A.. Cours d'algèbre supérieure. Tome I. 1877. Gauthier-Villars. 363–368.
9. Collins . G. E. . George E. Collins. Akritas . A. G. . Polynomial real root isolation using Descarte's rule of signs . 1976. Proceedings of the 1976 ACM symposium on Symbolic and Algebraic Computation . 272–275. 10.1145/800205.806346 . free .