Jump to content

Symmetric polynomial

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 05:12, 28 January 2005 (Initated stub. More needs to be written about applications of these. Unfortunately, it has been so long ago that I forgot (Galois theory or something?)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, a symmetric polynomial is a polynomial in n variables , such that if some of the variables get interchanged, the polynomial stays the same.

Examples

are all symmetric. The polynomial is not symmetric, since if we exchange and we get the polynomial which is not the same thing.

The building blocks for symmetric polynomials

For each n, there exist n so-called elementary symmetric polynomials in . They are the building blocks for all symmetric polynomials in these variables, meaning that any symmetric polynomial in n variables can be obtained from the elementary symmetric polynomials via several multiplications and additions. More precisely: any symmetric polynomial in n variables is a polynomial of the n elementary symmetric polynomials in these variables. For example, for n=2, there are only two elementary symmetric polynomials, and . The first polynomial in the list of examples above can then be written as