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.
Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Reducing a symmetric polynomial in two variables to a polynomial in and
Example
For
the lexicographic reduction algorithm gives
where and .
Facts & Assumptions
Given: The symmetric polynomial above over .
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).
In two variables, and (The elementary symmetric polynomials ).
Verification
The leading monomial of is . The elementary monomial prescribed by [L1] is , and .
Subtracting gives , whose leading multidegree is smaller than .
Hence in . Both sides have integer coefficients, so expanding the right side recovers the original polynomial over every commutative ring; there the remainder of step 2.1 may itself vanish, as it does in characteristic , in which case the algorithm halts one step earlier at the same answer.
The lexicographic reduction algorithm in three variables
Example
Let
where the first sum is and the second is the sum of the six distinct monomials with exponent pattern . Then
Facts & Assumptions
Given: The polynomial above, with lexicographic order .
Lexicographic reduction cancels the leading partition by the corresponding monomial in and strictly decreases the leading multidegree (Every symmetric polynomial over a commutative ring is a polynomial in the elementary symmetric polynomials).
Lexicographic order compares exponent tuples at their first differing coordinate (Lexicographic order on exponent tuples and the multidegree of a nonzero polynomial).
Verification
The leading multidegree of is with coefficient , so [L1] first subtracts . Its expansion is .
The remainder is , whose leading multidegree is . Since , the next prescribed subtraction is and the remainder becomes zero.
Therefore . Direct expansion verifies the equality and exhibits both lexicographic decreases.
A fixed unbalanced one-variable substitution need not preserve lexicographic leading terms
Statement refuted
A fixed substitution with positive weights always turns the lexicographically leading monomial of a polynomial into its highest power of .
Facts & Assumptions
Given: Lexicographic order on exponent pairs and the substitution , .
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
For , the tuple is lexicographically larger than , so is the leading monomial.
Under and , the polynomial becomes , whose highest power comes from , not from .
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.
Newton's identities through in three variables
Example
For three variables, Newton's identities give
If is invertible in the coefficient ring, the first three equations can be solved recursively for .
Facts & Assumptions
Given: Three variables over a commutative ring.
Newton's identities are , with and for (Newton's identities: ).
If is invertible, then freely generate the symmetric-polynomial ring (If is invertible, then freely generate the symmetric-polynomial ring).
Verification
At , [L1] gives . At , it gives , hence .
At , [L1] gives ; substituting step 1.1 yields .
At , , so [L1] gives . Substitution from steps 1.1 and 2.1 gives the displayed formula for .
When is invertible, so are , and the first three Newton identities recursively solve for the , as asserted by [L2].
Power sums need not generate the symmetric ring in characteristic two
Statement refuted
For every field and every number of variables, the first power sums generate the symmetric-polynomial ring.
Facts & Assumptions
Given: Two variables over .
Newton's identities include and (Newton's identities: ).
The elementary symmetric polynomials are algebraically independent over the coefficient field (The elementary symmetric polynomials are algebraically independent over the coefficient ring).
For every prime , the ring is a field (For every prime , the two operations on make it a field).
Counterexample
Over , [L1] gives and , because .
Hence every polynomial in belongs to the proper subring .
The element is not in , since an equality would be a nonzero polynomial relation between and , contrary to [L2].
Thus do not generate the two-variable symmetric ring over , refuting the universal statement and showing why the factorial-unit hypothesis is necessary.
Complete homogeneous symmetric polynomials and their recurrence in two variables
Example
In two variables ,
For they satisfy
and , .
Facts & Assumptions
Given: Two variables over a commutative ring.
The identity gives the coefficient recurrence among the and (The generating-series identity ).
The complete homogeneous polynomials freely generate the two-variable symmetric-polynomial ring (The complete homogeneous symmetric polynomials freely generate the symmetric-polynomial ring).
Verification
Listing all monomials of total degrees gives the displayed values of .
Here . Comparing the coefficient of in [L1] gives for .
At the same identity gives , and at it gives , hence . This explicitly realizes the free-generation statement [L2].
The discriminant of and its double-root criterion
Example
For over a field,
This vanishes exactly when has a repeated root, in every characteristic.
Facts & Assumptions
Given: A field , a monic quadratic , and roots in a splitting field.
The discriminant of a split monic quadratic is and vanishes exactly for a repeated root (The discriminant is and vanishes exactly when a monic polynomial has a repeated root).
Verification
Expand .
Substitute [L2] into step 1.1 to get , and apply [L1] to identify this with .
By [L1], this element vanishes exactly when . In characteristic two the formula becomes , while , so the same repeated-root criterion remains valid; completing a square is a separate issue.
The discriminant of is
Example
For the monic polynomial over any field,
The formula is an integer polynomial identity, so its specializations in characteristics two and three are included.
Facts & Assumptions
Given: A field , the polynomial , and roots in a splitting field.
For a monic cubic, (For monic of degree , ).
Vieta's formulas give , , and (Vieta's formulas identify the coefficients of a split monic polynomial with elementary symmetric functions of its roots).
Verification
Since , the root-product formula inside [L1] gives .
Expanding this product gives .
By [L2], and , while . Substitution in step 2.1 gives .
Apply [L1] to obtain . Every calculation used integer coefficients, so reduction to any field characteristic is valid.
Computing the monic resultant of two quadratics from roots and coefficients
Example
For
over a field,
Facts & Assumptions
Given: Monic quadratics and roots of in a splitting field.
The monic resultant is and vanishes exactly when the two polynomials have a common root (For monic , and it vanishes exactly when and have a common root).
Verification
Since and , put and to obtain and .
Multiply and use [L2]: .
Substitution of and gives the displayed formula, and [L1] identifies it as the resultant.
For and the formula gives , as the shared root predicts. For the same and it gives , so over the polynomials have no common root.
Sources
Standard references
Recommended treatments; not extraction sources.
- K. Conrad, Symmetric Polynomials, Section 2
- K. Conrad, Symmetric Polynomials, Section 3
- D. Grinberg, An Introduction to Algebraic Combinatorics, Chapter 7, Section 7.1
- J. S. Milne, Fields and Galois Theory, discriminant discussion
- J. S. Milne, Fields and Galois Theory, Example 4.37
- J. S. Milne, Fields and Galois Theory, Proposition 4.35