Viète's formulas Information & Viète's formulas Links at HealthHaven.com

For a method for computing π, see Viète's formula.

In mathematics, more specifically in algebra, Viète's Laws, named after François Viète, are formulas which relate the coefficients of a polynomial to signed sums and products of its roots.

[edit] The Laws

Any general polynomial of degree n ≥ 1,

$p(X)=a_nX^n + a_{n-1}X^{n-1} +\cdots + a_1 X+ a_0 \,$

(with the coefficients being real or complex numbers and a_n ≠ 0) is known by the fundamental theorem of algebra to have n (not necessarily distinct) complex roots x₁, x₂, ..., x_n.

Viète's formulas relate the polynomial's coefficients { a_k } to signed sums and products of its roots { x_i } as follows:

$\begin{cases} x_1 + x_2 + \dots + x_{n-1} + x_n = \tfrac{-a_{n-1}}{a_n} \\ (x_1 x_2 + x_1 x_3+\cdots + x_1x_n) + (x_2x_3+x_2x_4+\cdots + x_2x_n)+\cdots + x_{n-1}x_n = \frac{a_{n-2}}{a_n} \\ {} \quad \vdots \\ x_1 x_2 \dots x_n = (-1)^n \tfrac{a_0}{a_n}. \end{cases}$

Equivalently stated, the (n − k)th coefficient a_n−k is related to a signed sum of all possible subproducts of roots, taken k-at-a-time:

$\sum_{1\le i_1 < i_2 < \cdots < i_k\le n} x_{i_1}x_{i_2}\cdots x_{i_k}=(-1)^k\frac{a_{n-k}}{a_n}$

for k = 1, 2, ..., n (where we wrote the indices i_k in increasing order to ensure each subproduct of roots is used exactly once).

[edit] Generalization to rings

Viète's formulas hold more generally for polynomials with coefficients in any integral domain, as long as the leading coefficient a_n is invertible (so that the divisions make sense) and the polynomial has n distinct roots in that ring. The condition of being an integral domain is needed to assure that a polynomial of degree n cannot have more than n roots, and that is if has n roots then it is determined (up to a scalar) by those roots. However, if one replaces the assumption that x₁, …, x_n are the roots of the polynomial by the simpler requirement that one has the relation

$\begin{align} & {} \quad a_nX^n + a_{n-1}X^{n-1} +\cdots+ a_1 X + a_0 \\ & = a_n(X-x_1)(X-x_2)\cdots(X-x_n), \end{align}$

then Viète's formulas even hold in any commutative ring, and they merely express the way the coefficients on the left hand side are formed when expanding the product on the right. Note that the given relation has to be required even in the case of an integral domain, if one wishes to allow some of the roots to coincide, and therefore needs to specify what multiplicity should be associated to each root.

[edit] Example

Viète's formulas applied to quadratic and cubic polynomial:

For the second degree polynomial (quadratic) $p (X) = a X 2 + b X + c$ , roots $x 1, x 2$ of the equation $p (X) = 0$ satisfy

$x_1 + x_2 = - \frac{b}{a}, \quad x_1 x_2 = \frac{c}{a}$

The first of these equations can be used to find the minimum (or maximum) of p. See second order polynomial.

For the cubic polynomial $p (X) = a X 3 + b X 2 + c X + d$ , roots $x 1, x 2, x 3$ of the equation $p (X) = 0$ satisfy

$x_1 + x_2 + x_3 = - \frac{b}{a}, \quad x_1 x_2 + x_1 x_3 + x_2 x_3 = \frac{c}{a}, \quad x_1 x_2 x_3 = - \frac{d}{a}$

[edit] Proof

Viète's formulas can be proven by expanding the equality

$a_nX^n + a_{n-1}X^{n-1} +\cdots + a_1 X+ a_0 = a_n(X-x_1)(X-x_2)\cdots (X-x_n)$

(which is true since $x_1, x_2, \dots, x_n$ are all the roots of this polynomial), multiplying through the factors on the right-hand side, and identifying the coefficients of each power of $X .$

Formally, if one expands out $(X-x_1)(X-x_2)\cdots(X-x_n),$ the terms are precisely $(-1)^{n-k}x_1^{a_1}\cdots x_n^{a_n} X^k,$ where $a i$ is either 0 or 1, accordingly as whether $x i$ is included in the product or not, and k is the number of $x i$ that are excluded, so the total number of terms in the product is n (counting X_k with multiplicity k) – as there are n binary choices (include $x i$ or X), there are $2 n$ terms – geometrically, these can be understood as the vertices of a hypercube. Grouping these terms by degree of X yields the elementary symmetric polynomials in $x i$ – for X^k, all distinct k-fold products of $x i .$

[edit] History

As reflected in the name, these formulas were discovered by the 16th century French mathematician François Viète, for the case of positive roots.

In the opinion of the 18th century British mathematician Charles Hutton, as quoted in (Funkhouser), the general principle (not only for positive real roots) was first understood by the 17th century French mathematician Albert Girard; Hutton writes:

...[Girard was] the first person who understood the general doctrine of the formation of the coefficients of the powers from the sum of the roots and their products. He was the first who discovered the rules for summing the powers of the roots of any equation.

[edit] See also

[edit] References

Funkhouser, H. Gray (1930). "A short account of the history of symmetric functions of roots of equations". American Mathematical Monthly 37 (7): 357–365. doi:10.2307/2299273.

Vinberg, E. B. (2003). A course in algebra. American Mathematical Society, Providence, R.I. ISBN 0821834134.

Djukić, Dušan, et al. (2006). The IMO compendium: a collection of problems suggested for the International Mathematical Olympiads, 1959-2004. Springer, New York, NY. ISBN 0387242996.

Contents