Alphabeta Math
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.

✓ 9 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

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.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The lexicographic reduction algorithm in three variables

Example

Let

P=∑symx3+2∑symx2y+3xyz,

where the first sum is x3+y3+z3 and the second is the sum of the six distinct monomials with exponent pattern (2,1,0). Then

P=e13−e1e2.

Facts & Assumptions

Given: The polynomial P above, with lexicographic order x>y>z.

[L1]

Lexicographic reduction cancels the leading partition by the corresponding monomial in e1,e2,e3 and strictly decreases the leading multidegree (Every symmetric polynomial over a commutative ring is a polynomial in the elementary symmetric polynomials).

[L2]

Lexicographic order compares exponent tuples at their first differing coordinate (Lexicographic order on exponent tuples and the multidegree of a nonzero polynomial).

Verification

technique · direct
1.1givenL1L2algebra

The leading multidegree of P is (3,0,0) with coefficient 1, so [L1] first subtracts e13. Its expansion is ∑symx3+3∑symx2y+6xyz.

2.1step 1.1L1L2algebra

The remainder is −∑symx2y−3xyz, whose leading multidegree is (2,1,0). Since e1e2=∑symx2y+3xyz, the next prescribed subtraction is −e1e2 and the remainder becomes zero.

3.1step 2.1algebra∎

Therefore P=e13−e1e2. Direct expansion verifies the equality and exhibits both lexicographic decreases.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A fixed unbalanced one-variable substitution need not preserve lexicographic leading terms

Statement refuted

A fixed substitution x1=tw1,…,xn=twn with positive weights always turns the lexicographically leading monomial of a polynomial into its highest power of t.

Facts & Assumptions

Given: Lexicographic order on exponent pairs and the substitution x=t, y=t100.

[L1]

In lexicographic order, exponent tuples are compared at the first coordinate where they differ (Lexicographic order on exponent tuples and the multidegree of a nonzero polynomial).

Counterexample

technique · direct
1.1givenL1

For f(x,y)=x2+xy100, the tuple (2,0) is lexicographically larger than (1,100), so x2 is the leading monomial.

2.1step 1.1algebra

Under x=t and y=t100, the polynomial becomes t2+t10001, whose highest power comes from xy100, not from x2.

3.1step 2.1∎

Thus the fixed weighted substitution reverses these two terms and does not detect the lexicographic leader. Degree-dependent separated weights can encode any one finite support, but this fixed choice cannot replace lexicographic descent.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Newton's identities through p4 in three variables

Example

For three variables, Newton's identities give

p1=e1,

p2=e12−2e2,

p3=e13−3e1e2+3e3,

p4=e14−4e12e2+2e22+4e1e3.

If 6 is invertible in the coefficient ring, the first three equations can be solved recursively for e1,e2,e3.

Facts & Assumptions

Given: Three variables over a commutative ring.

[L1]

Newton's identities are kek=∑i=1k(−1)i−1ek−ipi, with e0=1 and ek=0 for k>3 (Newton's identities: kek=∑i=1k(−1)i−1ek−ipi).

[L2]

If 3! is invertible, then p1,p2,p3 freely generate the symmetric-polynomial ring (If n! is invertible, then p1,…,pn freely generate the symmetric-polynomial ring).

Verification

technique · direct
1.1L1algebra

At k=1, [L1] gives e1=p1. At k=2, it gives 2e2=e1p1−p2, hence p2=e12−2e2.

2.1step 1.1L1algebra

At k=3, [L1] gives 3e3=e2p1−e1p2+p3; substituting step 1.1 yields p3=e13−3e1e2+3e3.

3.1step 1.1step 2.1L1algebra

At k=4, e4=0, so [L1] gives 0=e3p1−e2p2+e1p3−p4. Substitution from steps 1.1 and 2.1 gives the displayed formula for p4.

4.1L2algebra∎

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

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Power sums need not generate the symmetric ring in characteristic two

Statement refuted

For every field and every number of variables, the first n power sums generate the symmetric-polynomial ring.

Facts & Assumptions

Given: Two variables over F2.

[L1]

Newton's identities include p1=e1 and p2=e1p1−2e2 (Newton's identities: kek=∑i=1k(−1)i−1ek−ipi).

[L2]

The elementary symmetric polynomials e1,e2 are algebraically independent over the coefficient field (The elementary symmetric polynomials are algebraically independent over the coefficient ring).

[L3]

For every prime p, the ring Z/p is a field (For every prime p, the two operations on Z/p make it a field).

Counterexample

technique · direct
1.1givenL1L3algebra

Over F2, [L1] gives p1=e1 and p2=e1p1=e12, because 2=0.

2.1step 1.1

Hence every polynomial in p1,p2 belongs to the proper subring F2[e1].

3.1step 2.1L2

The element e2 is not in F2[e1], since an equality e2=Q(e1) would be a nonzero polynomial relation between e1 and e2, contrary to [L2].

4.1step 3.1∎

Thus p1,p2 do not generate the two-variable symmetric ring over F2, refuting the universal statement and showing why the factorial-unit hypothesis is necessary.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Complete homogeneous symmetric polynomials and their recurrence in two variables

Example

In two variables x,y,

h0=1,h1=x+y,h2=x2+xy+y2,h3=x3+x2y+xy2+y3.

For k≥2 they satisfy

hk=e1hk−1−e2hk−2,

and e1=h1, e2=h12−h2.

Facts & Assumptions

Given: Two variables over a commutative ring.

[L1]

The identity E(−t)H(t)=1 gives the coefficient recurrence among the ei and hi (The generating-series identity E(−t)H(t)=1).

[L2]

The complete homogeneous polynomials h1,h2 freely generate the two-variable symmetric-polynomial ring (The complete homogeneous symmetric polynomials h1,…,hn freely generate the symmetric-polynomial ring).

Verification

technique · direct
1.1givenalgebra

Listing all monomials of total degrees 0,1,2,3 gives the displayed values of h0,h1,h2,h3.

1.2L1algebra

Here E(−t)=1−e1t+e2t2. Comparing the coefficient of tk in [L1] gives hk−e1hk−1+e2hk−2=0 for k≥2.

2.1step 1.2L1L2algebra∎

At k=1 the same identity gives h1=e1, and at k=2 it gives h2=e1h1−e2, hence e2=h12−h2. This explicitly realizes the free-generation statement [L2].

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The discriminant of x2+bx+c and its double-root criterion

Example

For f(t)=t2+bt+c over a field,

Disc⁡(f)=b2−4c.

This vanishes exactly when f has a repeated root, in every characteristic.

Facts & Assumptions

Given: A field F, a monic quadratic f(t)=t2+bt+c, and roots α,β in a splitting field.

[L1]

The discriminant of a split monic quadratic is (α−β)2 and vanishes exactly for a repeated root (The discriminant is ∏i<j(αi−αj)2 and vanishes exactly when a monic polynomial has a repeated root).

Verification

technique · direct
1.1givenalgebra

Expand (α−β)2=(α+β)2−4αβ.

2.1step 1.1L1L2algebra

Substitute [L2] into step 1.1 to get (α−β)2=b2−4c, and apply [L1] to identify this with Disc⁡(f).

3.1L1algebra∎

By [L1], this element vanishes exactly when α=β. In characteristic two the formula becomes b2, while f′=b, so the same repeated-root criterion remains valid; completing a square is a separate issue.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

The discriminant of x3+px+q is −4p3−27q2

Example

For the monic polynomial f(t)=t3+pt+q over any field,

Disc⁡(f)=−4p3−27q2.

The formula is an integer polynomial identity, so its specializations in characteristics two and three are included.

Facts & Assumptions

Given: A field F, the polynomial f(t)=t3+pt+q, and roots α,β,γ in a splitting field.

[L1]

For a monic cubic, Res⁡(f,f′)=−Disc⁡(f) (For monic f of degree n, Res⁡(f,f′)=(−1)n(n−1)/2Disc⁡(f)).

[L2]

Vieta's formulas give α+β+γ=0, αβ+αγ+βγ=p, and αβγ=−q (Vieta's formulas identify the coefficients of a split monic polynomial with elementary symmetric functions of its roots).

Verification

technique · direct
1.1givenL1algebra

Since f′(t)=3t2+p, the root-product formula inside [L1] gives Res⁡(f,f′)=∏r∈{α,β,γ}(3r2+p).

2.1step 1.1algebra

Expanding this product gives 27(αβγ)2+9p(α2β2+α2γ2+β2γ2)+3p2(α2+β2+γ2)+p3.

3.1step 2.1L2algebra

By [L2], α2+β2+γ2=−2p and α2β2+α2γ2+β2γ2=p2, while (αβγ)2=q2. Substitution in step 2.1 gives Res⁡(f,f′)=4p3+27q2.

4.1step 3.1L1∎

Apply [L1] to obtain Disc⁡(f)=−4p3−27q2. Every calculation used integer coefficients, so reduction to any field characteristic is valid.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Computing the monic resultant of two quadratics from roots and coefficients

Example

For

f(t)=t2+at+b,g(t)=t2+ct+d

over a field,

Res⁡(f,g)=(d−b)2−a(c−a)(d−b)+b(c−a)2.

Facts & Assumptions

Given: Monic quadratics f,g and roots α,β of f in a splitting field.

[L1]

The monic resultant is Res⁡(f,g)=g(α)g(β) and vanishes exactly when the two polynomials have a common root (For monic f, Res⁡(f,g)=∏ig(αi) and it vanishes exactly when f and g have a common root).

Verification

technique · direct
1.1givenalgebra

Since α2=−aα−b and β2=−aβ−b, put u=c−a and v=d−b to obtain g(α)=uα+v and g(β)=uβ+v.

2.1step 1.1L2algebra

Multiply and use [L2]: g(α)g(β)=u2αβ+uv(α+β)+v2=bu2−auv+v2.

3.1step 2.1L1algebra

Substitution of u=c−a and v=d−b gives the displayed formula, and [L1] identifies it as the resultant.

4.1step 3.1L1algebra∎

For f=(t−1)(t−2) and g=(t−2)(t−4) the formula gives 0, as the shared root predicts. For the same f and g=t2+1 it gives 10, so over Q the polynomials have no common root.

Sources