Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Reducing a symmetric polynomial in two variables to a polynomial in e1 and e2

Example

For

f(x,y)=x3+y3+x2y+xy2,

the lexicographic reduction algorithm gives

f=e13−2e1e2,

where e1=x+y and e2=xy.

Facts & Assumptions

Given: The symmetric polynomial f above over Z.

[L1]

Every symmetric polynomial is a polynomial in the elementary symmetric polynomials, obtained by cancelling its leading monomial lexicographically (Every symmetric polynomial over a commutative ring is a polynomial in the elementary symmetric polynomials).

[L2]

In two variables, e1=x+y and e2=xy (The elementary symmetric polynomials e0,e1,…,en).

Verification

technique · direct
1.1givenL1L2algebra

The leading monomial of f is x3. The elementary monomial prescribed by [L1] is e13, and e13=x3+3x2y+3xy2+y3.

2.1step 1.1L2algebra

Subtracting gives f−e13=−2x2y−2xy2=−2xy(x+y)=−2e1e2, whose leading multidegree is smaller than (3,0).

3.1step 2.1algebra∎

Hence f=e13−2e1e2 in Z[x,y]. Both sides have integer coefficients, so expanding the right side recovers the original polynomial over every commutative ring; there the remainder −2e1e2 of step 2.1 may itself vanish, as it does in characteristic 2, in which case the algorithm halts one step earlier at the same answer.

Depends on

Used by

Nothing in the library uses this result yet.

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