CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Vieta's formulas identify the coefficients of a split monic polynomial with elementary symmetric functions of its roots

Statement

Let $f (t) = t^{n} + a_{1} t^{n - 1} + \dots + a_{n} \in R [t]$ be monic and suppose that in a commutative $R$ -algebra $S$ it splits as

$f (t) = \prod_{i = 1}^{n} (t - α_{i}),$

with roots repeated according to multiplicity. Then

$a_{k} = (- 1)^{k} e_{k} (α_{1}, \dots, α_{n}) (1 \leq k \leq n) .$

The assertion includes the monic constant polynomial, for which there are no coefficient equations.

Facts & Assumptions

Given: A split monic polynomial $f$ as in the Statement.

[L1]

The universal Vieta expansion is $\prod_{i = 1}^{n} (t - x_{i}) = \sum_{k = 0}^{n} (- 1)^{k} e_{k} t^{n - k}$ (Vieta expansion: $\prod_{i = 1}^{n} (t - x_{i}) = \sum_{k = 0}^{n} (- 1)^{k} e_{k} t^{n - k}$ ).

[L2]

A polynomial splits over an extension when it is a product of linear factors there, with roots listed with multiplicity (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

Proof

technique · direct

1.1givenL1L2

Substitute $x_{i} = α_{i}$ in [L1] inside $S [t]$ to obtain $f (t) = \sum_{k = 0}^{n} (- 1)^{k} e_{k} (α_{1}, \dots, α_{n}) t^{n - k}$ .

2.1step 1.1algebra∎

Equality of polynomials is coefficientwise, so comparison with $f (t) = t^{n} + a_{1} t^{n - 1} + \dots + a_{n}$ gives the displayed formula for every $k$ . If $n = 0$ , the comparison has no positive index.

Depends on

Used by

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

K. Conrad, Symmetric Polynomials, Section 1 (standard reference, not scraped)