Vieta's formulas

Any general polynomial of degree n

${\displaystyle P(x)=a_{n}x^{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 r₁, r₂, ..., r_n. Vieta's formulas relate polynomial's coefficients to signed sums of products of the roots r₁, r₂, ..., r_n as follows:

${\displaystyle {\begin{cases}r_{1}+r_{2}+\dots +r_{n-1}+r_{n}=-{\dfrac {a_{n-1}}{a_{n}}}\\(r_{1}r_{2}+r_{1}r_{3}+\cdots +r_{1}r_{n})+(r_{2}r_{3}+r_{2}r_{4}+\cdots +r_{2}r_{n})+\cdots +r_{n-1}r_{n}={\dfrac {a_{n-2}}{a_{n}}}\\{}\quad \vdots \\r_{1}r_{2}\dots r_{n}=(-1)^{n}{\dfrac {a_{0}}{a_{n}}}.\end{cases}}}$

Vieta's formulas can equivalently be written as

${\displaystyle \sum _{1\leq i_{1}<i_{2}<\cdots <i_{k}\leq n}\left(\prod _{j=1}^{k}r_{i_{j}}\right)=(-1)^{k}{\frac {a_{n-k}}{a_{n}}},}$

for k = 1, 2, ..., n (the indices i_k are sorted in increasing order to ensure each product of k roots is used exactly once.

The left-hand sides of Vieta's formulas are the elementary symmetric functions of the roots.

Vieta's formulas are frequently used with polynomials with coefficients in any integral domain R. Then, the quotients ${\displaystyle a_{i}/a_{n}}$ belong to the ring of fractions of R (and possibly are in R itself if ${\displaystyle a_{n}}$ happens to be invertible in R) and the roots ${\displaystyle r_{i}}$ are taken in an algebraically closed extension. Typically, R is the ring of the integers, the field of fractions is the field of the rational numbers and the algebraically closed field is the field of the complex numbers.

Vieta's formulas are then useful because they provide relations between the roots without having to compute them.

For polynomials over a commutative ring which is not an integral domain, Vieta's formulas are only valid when ${\displaystyle a_{n}}$ is a non zero-divisor and ${\displaystyle P(x)}$ factors as ${\displaystyle a_{n}(x-r_{1})(x-r_{2})\dots (x-r_{n})}$. For example, in the ring of the integers modulo 8, the polynomial ${\displaystyle P(x)=x^{2}-1}$ has four roots: 1, 3, 5, and 7. Vieta's formulas are not true if, say, ${\displaystyle r_{1}=1}$ and ${\displaystyle r_{2}=3}$, because ${\displaystyle P(x)\neq (x-1)(x-3)}$. However, ${\displaystyle P(x)}$ does factor as ${\displaystyle (x-1)(x-7)}$ and as ${\displaystyle (x-3)(x-5)}$, and Vieta's formulas hold if we set either ${\displaystyle r_{1}=1}$ and ${\displaystyle r_{2}=7}$ or ${\displaystyle r_{1}=3}$ and ${\displaystyle r_{2}=5}$.

Vieta's formulas applied to quadratic and cubic polynomial:

The roots ${\displaystyle r_{1},r_{2}}$ of the quadratic polynomial ${\displaystyle P(x)=ax^{2}+bx+c}$ satisfy

${\displaystyle r_{1}+r_{2}=-{\frac {b}{a}},\quad r_{1}r_{2}={\frac {c}{a}}.}$

The first of these equations can be used to find the minimum (or maximum) of P; see Quadratic equation § Vieta's formulas.

The roots ${\displaystyle r_{1},r_{2},r_{3}}$ of the cubic polynomial ${\displaystyle P(x)=ax^{3}+bx^{2}+cx+d}$ satisfy

${\displaystyle r_{1}+r_{2}+r_{3}=-{\frac {b}{a}},\quad r_{1}r_{2}+r_{1}r_{3}+r_{2}r_{3}={\frac {c}{a}},\quad r_{1}r_{2}r_{3}=-{\frac {d}{a}}.}$

Vieta's formulas can be proved by expanding the equality

${\displaystyle a_{n}x^{n}+a_{n-1}x^{n-1}+\cdots +a_{1}x+a_{0}=a_{n}(x-r_{1})(x-r_{2})\cdots (x-r_{n})}$

(which is true since ${\displaystyle r_{1},r_{2},\dots ,r_{n}}$ are all the roots of this polynomial), multiplying the factors on the right-hand side, and identifying the coefficients of each power of ${\displaystyle x.}$

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

As reflected in the name, the 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 by Funkhouser,[1] the general principle (not only for positive real roots) was first understood by the 17th century French mathematician Albert Girard:

...[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.

• Newton's identities
• Elementary symmetric polynomial
• Symmetric polynomial
• Content (algebra)
• Properties of polynomial roots
• Gauss–Lucas theorem
• Rational root theorem

• Hazewinkel, Michiel, ed. (2001) [1994], "Viète theorem", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4
• Funkhouser, H. Gray (1930), "A short account of the history of symmetric functions of roots of equations", American Mathematical Monthly, Mathematical Association of America, 37 (7): 357–365, doi:10.2307/2299273, JSTOR 2299273
• Vinberg, E. B. (2003), A course in algebra, American Mathematical Society, Providence, R.I, ISBN 0-8218-3413-4

• 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 0-387-24299-6