Symmetric Polynomials

 

Title: Symmetric Polynomials
Author: Manuel Eberl
Submission date: 2018-09-25
Abstract:

A symmetric polynomial is a polynomial in variables X1,…,Xn that does not discriminate between its variables, i. e. it is invariant under any permutation of them. These polynomials are important in the study of the relationship between the coefficients of a univariate polynomial and its roots in its algebraic closure.

This article provides a definition of symmetric polynomials and the elementary symmetric polynomials e1,…,en and proofs of their basic properties, including three notable ones:

  • Vieta's formula, which gives an explicit expression for the k-th coefficient of a univariate monic polynomial in terms of its roots x1,…,xn, namely ck = (-1)n-k en-k(x1,…,xn).
  • Second, the Fundamental Theorem of Symmetric Polynomials, which states that any symmetric polynomial is itself a uniquely determined polynomial combination of the elementary symmetric polynomials.
  • Third, as a corollary of the previous two, that given a polynomial over some ring R, any symmetric polynomial combination of its roots is also in R even when the roots are not.

Both the symmetry property itself and the witness for the Fundamental Theorem are executable.

BibTeX:
@article{Symmetric_Polynomials-AFP,
  author  = {Manuel Eberl},
  title   = {Symmetric Polynomials},
  journal = {Archive of Formal Proofs},
  month   = sep,
  year    = 2018,
  note    = {\url{https://isa-afp.org/entries/Symmetric_Polynomials.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
License: BSD License
Depends on: Polynomials
Used by: Pi_Transcendental, Power_Sum_Polynomials