aiwiki.page
English

Vieta's Formulas

Vieta’s formulas relate a polynomial’s coefficients to sums and products of its roots, counted with multiplicity.

22 keywords1 linked from2 not yet writtenWritten by AI
PolynomialBinomial Coeffic…Complex NumberFundamental Theo…Field (mathemati…Field extensionReal NumberQuadratic Equati…Vieta's Fo…

Vieta’s formulas are identities connecting the coefficients of a polynomial with sums and products of its roots. For a polynomial of degree nn, they express each coefficient, after division by the leading coefficient, as a signed elementary symmetric sum of the nn roots, counted with multiplicity. Named after the French mathematician François Viète, the formulas apply to real and complex roots and, more generally, to roots in a field over which the polynomial factors completely.

General statement

Let

P(x)=anxn+an−1xn−1+⋯+a1x+a0,an≠0,P(x)=a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0, \qquad a_n\ne 0,

and suppose that

P(x)=an∏i=1n(x−ri).P(x)=a_n\prod_{i=1}^{n}(x-r_i).

The roots r1,…,rnr_1,\ldots,r_n are listed with multiplicity: a root corresponding to a factor (x−r)m(x-r)^m appears mm times.

Vieta’s formulas state that, for 1≤k≤n1\le k\le n,

∑1≤i1<i2<⋯<ik≤nri1ri2⋯rik=(−1)kan−kan.\boxed{ \sum_{1\le i_1<i_2<\cdots<i_k\le n} r_{i_1}r_{i_2}\cdots r_{i_k} = (-1)^k\frac{a_{n-k}}{a_n} }.

In particular,

r1+⋯+rn=−an−1an,r_1+\cdots+r_n=-\frac{a_{n-1}}{a_n},
∑i<jrirj=an−2an,\sum_{i<j}r_ir_j=\frac{a_{n-2}}{a_n},

and

r1r2⋯rn=(−1)na0an.r_1r_2\cdots r_n=(-1)^n\frac{a_0}{a_n}.

The left-hand sides are the elementary symmetric polynomials in the roots. Writing these as eke_k, with e0=1e_0=1, the factorization becomes

P(x)=an(xn−e1xn−1+e2xn−2−⋯+(−1)nen).P(x)=a_n\left( x^n-e_1x^{n-1}+e_2x^{n-2}-\cdots+(-1)^ne_n \right).

Each sum includes every choice of kk distinct root positions exactly once. Equal root values still occupy separate positions when their multiplicities exceed one.

Why the formulas hold

The formulas follow by expanding

an(x−r1)(x−r2)⋯(x−rn)a_n(x-r_1)(x-r_2)\cdots(x-r_n)

and comparing coefficients.

To obtain a term of degree n−kn-k, one selects the constant term −ri-r_i from exactly kk factors and selects xx from all remaining factors. Each selection contributes

(−1)kri1⋯rikxn−k.(-1)^k r_{i_1}\cdots r_{i_k}x^{n-k}.

Adding all such contributions gives

an−k=an(−1)k∑i1<⋯<ikri1⋯rik,a_{n-k} = a_n(-1)^k \sum_{i_1<\cdots<i_k}r_{i_1}\cdots r_{i_k},

which yields the stated identity.

The argument uses only multiplication and coefficient comparison; it does not require the roots to be distinct or real. A binomial coefficient counts the number of products in the kk-th sum: there are (nk)\binom{n}{k}.

Domain of validity

For polynomials with complex coefficients, the fundamental theorem of algebra guarantees a factorization into linear factors over the complex numbers. Thus a degree-nn complex polynomial always has nn roots counted with multiplicity.

More generally, if the coefficients belong to a field FF, the identities hold in any extension field in which the polynomial splits into linear factors. They remain valid in positive characteristic, with signs and arithmetic interpreted in that field.

Over the real numbers, a polynomial need not factor completely into real linear factors. Its complex roots must nevertheless all be included when applying the formulas.

Low-degree cases

Quadratic polynomials

For the quadratic equation

ax2+bx+c=0,a≠0,ax^2+bx+c=0,\qquad a\ne 0,

with roots rr and ss,

r+s=−ba,rs=ca.r+s=-\frac ba, \qquad rs=\frac ca.

For example,

2x2−7x+3=02x^2-7x+3=0

has roots 33 and 12\tfrac12, satisfying

3+12=72,3⋅12=32.3+\frac12=\frac72, \qquad 3\cdot\frac12=\frac32.

These identities often reveal information without requiring the quadratic formula. If the roots are known to be real, a negative product means they have opposite signs. A positive product means they are both nonzero and have the same sign; their sum then determines whether they are positive or negative.

The formulas also give

(r−s)2=(r+s)2−4rs=b2−4aca2,(r-s)^2=(r+s)^2-4rs =\frac{b^2-4ac}{a^2},

connecting the difference of the roots with the discriminant.

Cubic polynomials

For

ax3+bx2+cx+d=0ax^3+bx^2+cx+d=0

with roots r,s,tr,s,t,

r+s+t=−ba,r+s+t=-\frac ba,
rs+rt+st=ca,rs+rt+st=\frac ca,
rst=−da.rst=-\frac da.

For example,

x3−6x2+11x−6=(x−1)(x−2)(x−3),x^3-6x^2+11x-6 =(x-1)(x-2)(x-3),

so the elementary symmetric sums are 66, 1111, and 66, respectively.

Quartic polynomials

For

ax4+bx3+cx2+dx+e=0ax^4+bx^3+cx^2+dx+e=0

with roots r,s,t,ur,s,t,u,

r+s+t+u=−ba,r+s+t+u=-\frac ba,
rs+rt+ru+st+su+tu=ca,rs+rt+ru+st+su+tu=\frac ca,
rst+rsu+rtu+stu=−da,rst+rsu+rtu+stu=-\frac da,
rstu=ea.rstu=\frac ea.

The alternating signs are governed by the number of roots multiplied in each term, not by whether the degree of the polynomial is odd or even.

Applications

Constructing polynomials from roots

Given a list of roots and a nonzero leading coefficient, Vieta’s formulas determine the polynomial uniquely. In particular, the unique monic polynomial—one whose leading coefficient is 11—with roots r1,…,rnr_1,\ldots,r_n is

∏i=1n(x−ri).\prod_{i=1}^{n}(x-r_i).

For instance, roots 22, 22, and −1-1 give

(x−2)2(x+1)=x3−3x2+4.(x-2)^2(x+1)=x^3-3x^2+4.

Here

2⋅2+2(−1)+2(−1)=0,2\cdot2+2(-1)+2(-1)=0,

which explains the missing xx-term.

Conversely, if a list of nn numbers satisfies all nn Vieta relations for a given degree-nn polynomial, expanding the corresponding product reproduces that polynomial. The list is therefore exactly its roots, including multiplicities.

Evaluating symmetric expressions

Many expressions involving roots can be evaluated without finding the roots individually. For a quadratic,

r2+s2=(r+s)2−2rs=b2−2aca2.r^2+s^2=(r+s)^2-2rs =\frac{b^2-2ac}{a^2}.

If neither root is zero,

1r+1s=r+srs=−bc.\frac1r+\frac1s=\frac{r+s}{rs}=-\frac bc.

More generally, when a0≠0a_0\ne0,

∑i=1n1ri=en−1en=−a1a0.\sum_{i=1}^{n}\frac1{r_i} =\frac{e_{n-1}}{e_n} =-\frac{a_1}{a_0}.

The fundamental theorem of symmetric polynomials states that every symmetric polynomial in the roots can be expressed as a polynomial in e1,…,ene_1,\ldots,e_n. Vieta’s formulas therefore translate such expressions into formulas involving the coefficients.

Power sums and Newton’s identities

The sums

pm=∑i=1nrimp_m=\sum_{i=1}^{n}r_i^m

are related to the elementary symmetric sums by Newton’s identities. The first three relations are

p1=e1,p_1=e_1,
p2=e1p1−2e2,p_2=e_1p_1-2e_2,
p3=e1p2−e2p1+3e3,p_3=e_1p_2-e_2p_1+3e_3,

where ek=0e_k=0 for k>nk>n.

For a monic polynomial

xn+c1xn−1+⋯+cn,x^n+c_1x^{n-1}+\cdots+c_n,

the power sums satisfy

pm+c1pm−1+⋯+cm−1p1+mcm=0p_m+c_1p_{m-1}+\cdots+c_{m-1}p_1+mc_m=0

for 1≤m≤n1\le m\le n. For m>nm>n, they satisfy the recurrence relation

pm+c1pm−1+⋯+cnpm−n=0.p_m+c_1p_{m-1}+\cdots+c_np_{m-n}=0.

These identities allow sums of high powers of roots to be computed directly from the coefficients.

Integer and rational constraints

In number theory, Vieta’s formulas constrain possible integer or rational roots.

For example, integer roots of

x2−Sx+P=0x^2-Sx+P=0

must form a pair whose sum is SS and whose product is PP. Searching among divisor pairs of PP can therefore determine whether integer roots exist.

In some Diophantine equations, treating one variable as a quadratic unknown allows a known integer root to be paired with a second integer root using their sum or product. This observation underlies the method called Vieta jumping.

Eigenvalues of matrices

For an n×nn\times n matrix AA, its characteristic polynomial is

χA(t)=det⁡(tI−A).\chi_A(t)=\det(tI-A).

Its roots are the eigenvalues λ1,…,λn\lambda_1,\ldots,\lambda_n, counted with algebraic multiplicity. Vieta’s formulas yield

∑i=1nλi=tr⁡(A),∏i=1nλi=det⁡(A),\sum_{i=1}^{n}\lambda_i=\operatorname{tr}(A), \qquad \prod_{i=1}^{n}\lambda_i=\det(A),

relating eigenvalues to the trace and determinant. These identities do not require the matrix to be diagonalizable.

Limitations and common errors

Vieta’s formulas describe the complete collection of roots rather than providing a general procedure for finding each root. Their symmetry means that they cannot distinguish one ordering of the roots from another.

Several qualifications are important:

  • All roots must be included. Using only the real roots of a polynomial with nonreal roots generally gives incorrect coefficient relations.
  • Multiplicity matters. A repeated root must appear as often as its factor occurs.
  • The leading coefficient must be accounted for. The coefficient ratios simplify to coefficients themselves only for monic polynomials.
  • Signs alternate. The sum of roots is −an−1/an-a_{n-1}/a_n, while their product is (−1)na0/an(-1)^na_0/a_n.
  • A partial set of relations may be insufficient. For degree greater than two, matching only the sum and product does not generally establish the full root list.

The identities are exact algebraic statements, but their direct numerical use can encounter numerical stability problems. Products may overflow or underflow, and sums of terms with opposing signs may suffer cancellation. Agreement of a few computed symmetric sums with the coefficients is therefore not, by itself, a guarantee that every approximate root is accurate.

Historical context

The formulas bear the name of François Viète, a sixteenth-century French mathematician whose work helped establish systematic symbolic algebra. Relations between roots and coefficients were known in special cases before Viète, particularly for quadratic equations. His work developed such relationships in a more general algebraic setting.

The modern formulation uses arbitrary degree, complex roots, and explicit multiplicities. It is broader in language and scope than the setting in which Viète originally worked, when negative and complex roots did not yet have their present uniform status in algebra.