{
  "id": "vietas-formulas",
  "title": "Vieta's Formulas",
  "lang": "en",
  "source_lang": "en",
  "summary": "Vieta’s formulas relate a polynomial’s coefficients to sums and products of its roots, counted with multiplicity.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Viète’s formulas",
    "Vieta’s relations",
    "Viète’s relations"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/vietas-formulas/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/vietas-formulas/",
      "json": "https://aiwiki.page/zh/vietas-formulas.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Vieta’s formulas are identities connecting the coefficients of a polynomial with sums and products of its roots. For a polynomial of degree \\(n\\), they express each coefficient, after division by the leading coefficient, as a signed elementary symmetric sum of the \\(n\\) 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."
    },
    {
      "heading": "General statement",
      "text": "Let\n\n\\[P(x)=a_nx^n+a_{n-1}x^{n-1}+\\cdots+a_1x+a_0, \\qquad a_n\\ne 0,\\]\n\nand suppose that\n\n\\[P(x)=a_n\\prod_{i=1}^{n}(x-r_i).\\]\n\nThe roots \\(r_1,\\ldots,r_n\\) are listed with multiplicity: a root corresponding to a factor \\((x-r)^m\\) appears \\(m\\) times.\n\nVieta’s formulas state that, for \\(1\\le k\\le n\\),\n\n\\[\\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} }.\\]\n\nIn particular,\n\n\\[r_1+\\cdots+r_n=-\\frac{a_{n-1}}{a_n},\\]\n\n\\[\\sum_{i<j}r_ir_j=\\frac{a_{n-2}}{a_n},\\]\n\nand\n\n\\[r_1r_2\\cdots r_n=(-1)^n\\frac{a_0}{a_n}.\\]\n\nThe left-hand sides are the elementary symmetric polynomials in the roots. Writing these as \\(e_k\\), with \\(e_0=1\\), the factorization becomes\n\n\\[P(x)=a_n\\left( x^n-e_1x^{n-1}+e_2x^{n-2}-\\cdots+(-1)^ne_n \\right).\\]\n\nEach sum includes every choice of \\(k\\) distinct root positions exactly once. Equal root values still occupy separate positions when their multiplicities exceed one."
    },
    {
      "heading": "Why the formulas hold",
      "text": "The formulas follow by expanding\n\n\\[a_n(x-r_1)(x-r_2)\\cdots(x-r_n)\\]\n\nand comparing coefficients.\n\nTo obtain a term of degree \\(n-k\\), one selects the constant term \\(-r_i\\) from exactly \\(k\\) factors and selects \\(x\\) from all remaining factors. Each selection contributes\n\n\\[(-1)^k r_{i_1}\\cdots r_{i_k}x^{n-k}.\\]\n\nAdding all such contributions gives\n\n\\[a_{n-k} = a_n(-1)^k \\sum_{i_1<\\cdots<i_k}r_{i_1}\\cdots r_{i_k},\\]\n\nwhich yields the stated identity.\n\nThe 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 \\(k\\)-th sum: there are \\(\\binom{n}{k}\\).\n\nDomain of validity\n\nFor polynomials with complex coefficients, the fundamental theorem of algebra guarantees a factorization into linear factors over the complex numbers. Thus a degree-\\(n\\) complex polynomial always has \\(n\\) roots counted with multiplicity.\n\nMore generally, if the coefficients belong to a field \\(F\\), 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.\n\nOver 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."
    },
    {
      "heading": "Low-degree cases",
      "text": "Quadratic polynomials\n\nFor the quadratic equation\n\n\\[ax^2+bx+c=0,\\qquad a\\ne 0,\\]\n\nwith roots \\(r\\) and \\(s\\),\n\n\\[r+s=-\\frac ba, \\qquad rs=\\frac ca.\\]\n\nFor example,\n\n\\[2x^2-7x+3=0\\]\n\nhas roots \\(3\\) and \\(\\tfrac12\\), satisfying\n\n\\[3+\\frac12=\\frac72, \\qquad 3\\cdot\\frac12=\\frac32.\\]\n\nThese 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.\n\nThe formulas also give\n\n\\[(r-s)^2=(r+s)^2-4rs =\\frac{b^2-4ac}{a^2},\\]\n\nconnecting the difference of the roots with the discriminant.\n\nCubic polynomials\n\nFor\n\n\\[ax^3+bx^2+cx+d=0\\]\n\nwith roots \\(r,s,t\\),\n\n\\[r+s+t=-\\frac ba,\\]\n\n\\[rs+rt+st=\\frac ca,\\]\n\n\\[rst=-\\frac da.\\]\n\nFor example,\n\n\\[x^3-6x^2+11x-6 =(x-1)(x-2)(x-3),\\]\n\nso the elementary symmetric sums are \\(6\\), \\(11\\), and \\(6\\), respectively.\n\nQuartic polynomials\n\nFor\n\n\\[ax^4+bx^3+cx^2+dx+e=0\\]\n\nwith roots \\(r,s,t,u\\),\n\n\\[r+s+t+u=-\\frac ba,\\]\n\n\\[rs+rt+ru+st+su+tu=\\frac ca,\\]\n\n\\[rst+rsu+rtu+stu=-\\frac da,\\]\n\n\\[rstu=\\frac ea.\\]\n\nThe 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."
    },
    {
      "heading": "Applications",
      "text": "Constructing polynomials from roots\n\nGiven 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 \\(1\\)—with roots \\(r_1,\\ldots,r_n\\) is\n\n\\[\\prod_{i=1}^{n}(x-r_i).\\]\n\nFor instance, roots \\(2\\), \\(2\\), and \\(-1\\) give\n\n\\[(x-2)^2(x+1)=x^3-3x^2+4.\\]\n\nHere\n\n\\[2\\cdot2+2(-1)+2(-1)=0,\\]\n\nwhich explains the missing \\(x\\)-term.\n\nConversely, if a list of \\(n\\) numbers satisfies all \\(n\\) Vieta relations for a given degree-\\(n\\) polynomial, expanding the corresponding product reproduces that polynomial. The list is therefore exactly its roots, including multiplicities.\n\nEvaluating symmetric expressions\n\nMany expressions involving roots can be evaluated without finding the roots individually. For a quadratic,\n\n\\[r^2+s^2=(r+s)^2-2rs =\\frac{b^2-2ac}{a^2}.\\]\n\nIf neither root is zero,\n\n\\[\\frac1r+\\frac1s=\\frac{r+s}{rs}=-\\frac bc.\\]\n\nMore generally, when \\(a_0\\ne0\\),\n\n\\[\\sum_{i=1}^{n}\\frac1{r_i} =\\frac{e_{n-1}}{e_n} =-\\frac{a_1}{a_0}.\\]\n\nThe fundamental theorem of symmetric polynomials states that every symmetric polynomial in the roots can be expressed as a polynomial in \\(e_1,\\ldots,e_n\\). Vieta’s formulas therefore translate such expressions into formulas involving the coefficients.\n\nPower sums and Newton’s identities\n\nThe sums\n\n\\[p_m=\\sum_{i=1}^{n}r_i^m\\]\n\nare related to the elementary symmetric sums by Newton’s identities. The first three relations are\n\n\\[p_1=e_1,\\]\n\n\\[p_2=e_1p_1-2e_2,\\]\n\n\\[p_3=e_1p_2-e_2p_1+3e_3,\\]\n\nwhere \\(e_k=0\\) for \\(k>n\\).\n\nFor a monic polynomial\n\n\\[x^n+c_1x^{n-1}+\\cdots+c_n,\\]\n\nthe power sums satisfy\n\n\\[p_m+c_1p_{m-1}+\\cdots+c_{m-1}p_1+mc_m=0\\]\n\nfor \\(1\\le m\\le n\\). For \\(m>n\\), they satisfy the recurrence relation\n\n\\[p_m+c_1p_{m-1}+\\cdots+c_np_{m-n}=0.\\]\n\nThese identities allow sums of high powers of roots to be computed directly from the coefficients.\n\nInteger and rational constraints\n\nIn number theory, Vieta’s formulas constrain possible integer or rational roots.\n\nFor example, integer roots of\n\n\\[x^2-Sx+P=0\\]\n\nmust form a pair whose sum is \\(S\\) and whose product is \\(P\\). Searching among divisor pairs of \\(P\\) can therefore determine whether integer roots exist.\n\nIn 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.\n\nEigenvalues of matrices\n\nFor an \\(n\\times n\\) matrix \\(A\\), its characteristic polynomial is\n\n\\[\\chi_A(t)=\\det(tI-A).\\]\n\nIts roots are the eigenvalues \\(\\lambda_1,\\ldots,\\lambda_n\\), counted with algebraic multiplicity. Vieta’s formulas yield\n\n\\[\\sum_{i=1}^{n}\\lambda_i=\\operatorname{tr}(A), \\qquad \\prod_{i=1}^{n}\\lambda_i=\\det(A),\\]\n\nrelating eigenvalues to the trace and determinant. These identities do not require the matrix to be diagonalizable."
    },
    {
      "heading": "Limitations and common errors",
      "text": "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.\n\nSeveral qualifications are important:\n\n- All roots must be included. Using only the real roots of a polynomial with nonreal roots generally gives incorrect coefficient relations.\n- Multiplicity matters. A repeated root must appear as often as its factor occurs.\n- The leading coefficient must be accounted for. The coefficient ratios simplify to coefficients themselves only for monic polynomials.\n- Signs alternate. The sum of roots is \\(-a_{n-1}/a_n\\), while their product is \\((-1)^na_0/a_n\\).\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.\n\nThe 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."
    },
    {
      "heading": "Historical context",
      "text": "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.\n\nThe 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."
    }
  ],
  "links": [
    "polynomial",
    "binomial-coefficient",
    "complex-number",
    "fundamental-theorem-of-algebra",
    "field-mathematics",
    "field-extension",
    "real-number",
    "quadratic-equation",
    "discriminant",
    "recurrence-relation",
    "number-theory",
    "integer",
    "rational-number",
    "diophantine-equation",
    "matrix",
    "characteristic-polynomial",
    "eigenvalues-and-eigenvectors",
    "matrix-trace",
    "determinant",
    "numerical-stability"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}