ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

Newton's identities through $p_{4}$ in three variables

Example

For three variables, Newton's identities give

$p_{1} = e_{1},$

$p_{2} = e_{1}^{2} - 2 e_{2},$

$p_{3} = e_{1}^{3} - 3 e_{1} e_{2} + 3 e_{3},$

$p_{4} = e_{1}^{4} - 4 e_{1}^{2} e_{2} + 2 e_{2}^{2} + 4 e_{1} e_{3} .$

If $6$ is invertible in the coefficient ring, the first three equations can be solved recursively for $e_{1}, e_{2}, e_{3}$ .

Facts & Assumptions

Given: Three variables over a commutative ring.

[L1]

Newton's identities are $k e_{k} = \sum_{i = 1}^{k} (- 1)^{i - 1} e_{k - i} p_{i}$ , with $e_{0} = 1$ and $e_{k} = 0$ for $k > 3$ (Newton's identities: $k e_{k} = \sum_{i = 1}^{k} (- 1)^{i - 1} e_{k - i} p_{i}$ ).

[L2]

If $3!$ is invertible, then $p_{1}, p_{2}, p_{3}$ freely generate the symmetric-polynomial ring (If $n!$ is invertible, then $p_{1}, \dots, p_{n}$ freely generate the symmetric-polynomial ring).

Verification

technique · direct

1.1L1algebra

At $k = 1$ , [L1] gives $e_{1} = p_{1}$ . At $k = 2$ , it gives $2 e_{2} = e_{1} p_{1} - p_{2}$ , hence $p_{2} = e_{1}^{2} - 2 e_{2}$ .

2.1step 1.1L1algebra

At $k = 3$ , [L1] gives $3 e_{3} = e_{2} p_{1} - e_{1} p_{2} + p_{3}$ ; substituting step 1.1 yields $p_{3} = e_{1}^{3} - 3 e_{1} e_{2} + 3 e_{3}$ .

3.1step 1.1step 2.1L1algebra

At $k = 4$ , $e_{4} = 0$ , so [L1] gives $0 = e_{3} p_{1} - e_{2} p_{2} + e_{1} p_{3} - p_{4}$ . Substitution from steps 1.1 and 2.1 gives the displayed formula for $p_{4}$ .

4.1L2algebra∎

When $6$ is invertible, so are $1, 2, 3$ , and the first three Newton identities recursively solve for the $e_{i}$ , as asserted by [L2].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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 3 (standard reference, not scraped)

Newton's identities through p4p4​ in three variables