Added to Favorites

Related Searches

Definitions

Nearby Words

In mathematics, a symmetric polynomial is a polynomial P(X_{1}, X_{2}, …, X_{n}) in n variables, such that if any of the variables are interchanged, one obtains the same polynomial. Formally, P is a symmetric polynomial, if for any permutation σ of the subscripts 1, 2, ..., n one has P(X_{σ(1)}, X_{σ(2)}, …, X_{σ(n)}) = P(X_{1}, X_{2}, …, X_{n}).## Examples

## Relation with the roots of a monic univariate polynomial

## Special kinds of symmetric polynomials

### Elementary symmetric polynomials

For each nonnegative integer k, the elementary symmetric polynomial e_{k}(X_{1}, …, X_{n}) is the sum of all distinct products of k distinct variables (some authors denote it by σ_{k} instead). For k = 0 there is only the empty product so e_{0}(X_{1}, …, X_{n}) = 1, while for k > n, no products at all can be formed, so e_{k}(X_{1}, X_{2}, …, X_{n}) = 0 in these cases. The remaining n elementary symmetric polynomials are building blocks for all symmetric polynomials in these variables: as mentioned above, any symmetric polynomial in the variables considered can be obtained from these elementary symmetric polynomials using multiplications and additions only. In fact one has the following more detailed facts:### Monomial symmetric polynomials

_{α} = m_{β} when β is a permutation of α, so one usually considers only those m_{α} for which α_{1} ≥ α_{2} ≥ … ≥ α_{n}, in other words for which α is a partition.
These monomial symmetric polynomials form a vector space basis: every symmetric polynomial P can be written as a linear combination of the monomial symmetric polynomials; to do this it suffices to separate the different types of monomials occurring in P. In particular if P has integer coefficients, then so will the linear combination.### Power-sum symmetric polynomials

For each integer k ≥ 1, the monomial symmetric polynomial m_{(k,0,…,0)}(X_{1}, …, X_{n}) is of special interest, and called the power sum symmetric polynomial p_{k}(X_{1}, …, X_{n}), so
_{k}(X_{1}, …, X_{n}) for k > n can be so expressed in the first n power sum polynomials; for instance
_{3} to zero), but since it involves p_{3}, it could not be used to illustrate the statement for n = 2. The example shows that whether or not the expression for a given monomial symmetric polynomial in terms of the first n power sum polynomials involves rational coefficients may depend on n. But rational coefficients are always needed to express elementary symmetric polynomials (except the constant ones, and e_{1} which coincides with the first power sum) in terms of power sum polynomials. The Newton identities provide an explicit method to do this; it involves division by integers up to n, which explains the rational coefficients. Because of these divisions, the mentioned statement fails in general when coefficients are taken in a field of finite characteristic; however it is valid with coefficients in any ring containing the rational numbers.
### Complete homogeneous symmetric polynomials

For each nonnegative integer k, the complete homogeneous symmetric polynomial h_{k}(X_{1}, …, X_{n}) is the sum of all distinct monomials of degree k in the variables X_{1}, …, X_{n}. For instance
_{k}(X_{1}, …, X_{n}) is also the sum of all distinct monomial symmetric polynomials of degree k in X_{1}, …, X_{n}, for instance for the given example
_{1}(X_{1},X_{2}) = X_{1}+X_{2}), and h_{2}(X_{1},X_{2}) = X_{1}^{2}+X_{1}X_{2}+X_{2}^{2}. The first polynomial in the list of examples above can then be written as
_{n}(X_{1}, …, X_{n}), allowing them to be expressed in the ones up to that point; again the resulting identities become invalid when the number of variables is increased._{0}(X_{1}, …, X_{n}) and h_{0}(X_{1}, …, X_{n}) are both equal to 1, one can isolate either the first or the last terms of these summations; the former gives a set of equations that allows to recursively express the successive complete homogeneous symmetric polynomials in terms of the elementary symmetric polynomials, and the latter gives a set of equations that allows doing the inverse. This implicitly shows that any symmetric polynomial can be expressed in terms of the h_{k}(X_{1}, …, X_{n}) with 1 ≤ k ≤ n: one first expresses the symmetric polynomial in terms of the elementary symmetric polynomials, and then expresses those in terms of the mentioned complete homogeneous ones.
### Schur polynomials

Another class of symmetric polynomials is that of the Schur polynomials, which are of fundamental importance in the applications of symmetric polynomials to representation theory. They are however not as easy to describe as the other kinds of special symmetric polynomials; see the main article for details.
## Symmetric polynomials in algebra

Symmetric polynomials are important to linear algebra, representation theory, and Galois theory. They are also important in combinatorics, where they are mostly studied through the ring of symmetric functions, which avoids having to carry around a fixed number of variables all the time.
## See also

## References

Symmetric polynomials arise naturally in the study of the relation between the roots of a polynomial in one variable and its coefficients, since the coefficients can be given by polynomial expressions in the roots, and all roots play a similar role in this setting. From this point of view the elementary symmetric polynomials are the most fundamental symmetric polynomials. A theorem states that any symmetric polynomial can be expressed in terms of elementary symmetric polynomials, which implies that every symmetric polynomial expression in the roots of a monic polynomial can alternatively be given as a polynomial expression in the coefficients of the polynomial.

Symmetric polynomials also form an interesting structure by themselves, independently of any relation to the roots of a polynomial. In this context other collections of specific symmetric polynomials, such as complete homogeneous, power sum, and Schur polynomials play important roles alongside the elementary ones. The resulting structures, and in particular the ring of symmetric functions, are of great importance in combinatorics and in representation theory.

In two variables X_{1}, X_{2} one has symmetric polynomials like

- $X\_1^3+\; X\_2^3-7$
- $4\; X\_1^2X\_2^2\; +X\_1^3X\_2\; +\; X\_1X\_2^3\; +(X\_1+X\_2)^4$

and in three variables X_{1}, X_{2}, X_{3} one has for instance

- $X\_1\; X\_2\; X\_3\; -\; 2\; X\_1\; X\_2\; -\; 2\; X\_1\; X\_3\; -\; 2\; X\_2\; X\_3\; ,$

There are many ways to make specific symmetric polynomials in any number of variables, see the various types below. An example of a somewhat different flavor is

- $left(prod\_\{i=1\}^\{n-1\}prod\_\{j=i+1\}^n(X\_i-X\_j)right)^2$

where first a polynomial is constructed that changes sign under every exchange of variables, and taking the square renders it completely symmetric (if the variables represent the roots of a monic polynomial, this polynomial gives its discriminant).

On the other hand the polynomials in two variables

- $X\_1\; -\; X\_2\; ,$

is not symmetric, since if one exchanges $X\_1$ and $X\_2$ one gets a different polynomial, $X\_2\; -\; X\_1$. Similarly in three variables

- $X\_1^4X\_2^2X\_3\; +\; X\_1X\_2^4X\_3^2\; +\; X\_1^2X\_2X\_3^4$

has only symmetry under cyclic permutations of the three variables, which is not sufficient to be a symmetric polynomial.

Consider a monic polynomial in t of degree n

- $P=t^n+a\_\{n-1\}t^\{n-1\}+cdots+a\_2t^t+a\_1t+a\_0$

with coefficients a_{i} in some field k. There exist n roots x_{1},…,x_{n} of P in some possibly larger field (for instance if k is the field of real numbers, the roots will certainly exist in the field of complex numbers); some of the roots might be equal, but the fact that one has all roots is expressed by the relation

- $P=t^n+a\_\{n-1\}t^\{n-1\}+cdots+a\_2t^2+a\_1t+a\_0=(t-x\_1)(t-x\_2)cdots(t-x\_n).$

By comparison of the coefficients one finds

- $begin\{align\}$

These are in fact just instances of Viète's formulas. They show that all coefficients of the polynomial are given in terms of the roots by a symmetric polynomial expression: although for a given polynomial P there may be qualitative differences between the roots (like lying in the base field k or not, being simple or multiple roots), none of this affects the way the roots occur in these expressions.

Now one may change the point of view, by taking the roots rather than the coefficients as basic parameters for describing P, and considering them as indeterminates rather than as constants in an appropriate field; the coefficients a_{i} then become just the particular symmetric polynomials given by the above equations. Those polynomials, without the sign $(-1)^\{n-i\}$, are known as the elementary symmetric polynomials in x_{1},…,x_{n}. A basic fact, known as the fundamental theorem of symmetric polynomials states that any symmetric polynomial in n variables can be given by a polynomial expression in terms of these elementary symmetric polynomials. It follows that any symmetric polynomial expression in the roots of a monic polynomial can be expressed as a polynomial in the coefficients of the polynomial, and in particular that its value lies in the base field k that contains those coefficients. Thus, when working only with such symmetric polynomial expressions in the roots, it is unnecessary to know anything particular about those roots, or to compute in any larger field than k in which those roots may lie. In fact the values of the roots themselves become rather irrelevant, and the necessary relations between coefficients and symmetric polynomial expressions can be found by computations in terms of symmetric polynomials only. An example of such relations are Newton's identities, which express the sum of any fixed power of the roots in terms of the elementary symmetric polynomials.

There are a few types of symmetric polynomials in the variables X_{1}, X_{2}, …, X_{n} that are fundamental.

- any symmetric polynomial P in X
_{1}, …, X_{n}can be written as a polynomial expression in the polynomials e_{k}(X_{1}, …, X_{n}) with 1 ≤ k ≤ n; - this expression is unique up to equivalence of polynomial expressions;
- if P has integral coefficients, then the polynomial expression also has integral coefficients.

For example, for n = 2, the relevant elementary symmetric polynomials are e_{1}(X_{1}, X_{2}) = X_{1}+X_{2}, and e_{2}(X_{1}, X_{2}) = X_{1}X_{2}. The first polynomial in the list of examples above can then be written as

- $X\_1^3+X\_2^3-7=e\_1(X\_1,ldots,X\_n)^3-3e\_2(X\_1,ldots,X\_n)e\_1(X\_1,ldots,X\_n)-7$

Powers and products of elementary symmetric polynomials work out to rather complicated expressions. If one seeks basic additive building blocks for symmetric polynomials, a more natural choice is to take those symmetric polynomials that contain only one type of monomial, with only those copies required to obtain symmetry. Any monomial in X_{1}, …, X_{n} can be written as X_{1}^{α1}…X_{n}^{αn} where the exponents α_{i} are natural numbers (possibly zero); writing α = (α_{1},…,α_{n}) this can be abbreviated to X^{α}. The monomial symmetric polynomial m_{α}(X_{1}, …, X_{n}) is defined as the sum of all monomials x^{β} where β ranges over all distinct permutations of (α_{1},…,α_{n}). For instance one has

- $m\_\{(3,1,1)\}(X\_1,X\_2,X\_3)=X\_1^3X\_2X\_3+X\_1X\_2^3X\_3+X\_1X\_2X\_3^3$,

- $m\_\{(3,2,1)\}(X\_1,X\_2,X\_3)=X\_1^3X\_2^2X\_3+X\_1^3X\_2X\_3^2+X\_1^2X\_2^3X\_3+X\_1^2X\_2X\_3^3+X\_1X\_2^3X\_3^2+X\_1X\_2^2X\_3^3$.

The elementary symmetric polynomials are particular cases of monomial symmetric polynomials: for 0 ≤ k ≤ n one has

- $e\_k(X\_1,ldots,X\_n)=m\_alpha(X\_1,ldots,X\_n)$ where α is the partition of k into k parts 1 (followed by n − k zeros).

- $p\_k(X\_1,ldots,X\_n)\; =\; X\_1^k\; +\; X\_2^k\; +\; cdots\; +\; X\_n^k\; .$

- Any symmetric polynomial in X
_{1}, …, X_{n}can be expressed as a polynomial expression with rational coefficients in the power sum symmetric polynomials p_{1}(X_{1}, …, X_{n}), …, p_{n}(X_{1}, …, X_{n}).

- $p\_3(X\_1,X\_2)=textstylefrac32p\_2(X\_1,X\_2)p\_1(X\_1,X\_2)-frac12p\_1(X\_1,X\_2)^3;$

In contrast to the situation for the elementary and complete homogeneous polynomials, a symmetric polynomial in n variables with integral coefficients need not be a polynomial function with integral coefficients of the power sum symmetric polynomials. For an example, for n = 2, the symmetric polynomial

- $m\_\{(2,1)\}(X\_1,X\_2)\; =\; X\_1^2\; X\_2\; +\; X\_1\; X\_2^2$

- $m\_\{(2,1)\}(X\_1,X\_2)=\; textstylefrac12p\_1(X\_1,X\_2)^3-frac12p\_2(X\_1,X\_2)p\_1(X\_1,X\_2).$

- $begin\{align\}m\_\{(2,1)\}(X\_1,X\_2,X\_3)\; \&=\; X\_1^2\; X\_2\; +\; X\_1\; X\_2^2\; +\; X\_1^2\; X\_3\; +\; X\_1\; X\_3^2\; +\; X\_2^2\; X\_3\; +\; X\_2\; X\_3^2$

&= p_1(X_1,X_2,X_3)p_2(X_1,X_2,X_3)-p_3(X_1,X_2,X_3).end{align} The corresponding expression was valid for two variables as well (it suffices to set X

- $h\_3(X\_1,X\_2,X\_3)=X\_1^3+X\_1^2X\_2+X\_1^2X\_3+X\_1X\_2^2+X\_1X\_2X\_3+X\_1X\_3^2+X\_2^3+X\_2^2X\_3+X\_2X\_3^2+X\_3^3.$

- $begin\{align\}$

&=(X_1^3+X_2^3+X_3^3)+(X_1^2X_2+X_1^2X_3+X_1X_2^2+X_1X_3^2+X_2^2X_3+X_2X_3^2)+(X_1X_2X_3).end{align}

All symmetric polynomials in these variables can be built up from complete homogeneous ones: any symmetric polynomial in X_{1}, …, X_{n} can be obtained from the complete homogeneous symmetric polynomials h_{1}(X_{1}, …, X_{n}), …, h_{n}(X_{1}, …, X_{n}) via multiplications and additions. More precisely:

- Any symmetric polynomial P in X
_{1}, …, X_{n}can be written as a polynomial expression in the polynomials h_{k}(X_{1}, …, X_{n}) with 1 ≤ k ≤ n.

- If P has integral coefficients, then the polynomial expression also has integral coefficients.

- $X\_1^3+\; X\_2^3-7=-2h\_1(X\_1,X\_2)^3+3h\_1(X\_1,X\_2)h\_2(X\_1,X\_2)-7.$

An important aspect of complete homogeneous symmetric polynomials is their relation to elementary symmetric polynomial, which can be given as the identities

- $sum\_\{i=0\}^k(-1)^ie\_i(X\_1,ldots,X\_n)h\_\{k-i\}(X\_1,ldots,X\_n)=0$, for all k > 0, and any number of variables n.

- S. Lang (2004), Algebra. Springer-Verlag. ISBN 0-387-95385-X.
- Macdonald, I.G. (1979), Symmetric Functions and Hall Polynomials. Oxford Mathematical Monographs. Oxford: Clarendon Press.
- I.G. Macdonald (1995), Symmetric Functions and Hall Polynomials, second ed. Oxford: Clarendon Press. ISBN 0-19-850450-0 (paperback, 1998).
- Richard P. Stanley (1999), Enumerative Combinatorics, Vol. 2. Camridge: Cambridge University Press. ISBN 0-521-56069-1

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Monday August 11, 2008 at 21:55:32 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Monday August 11, 2008 at 21:55:32 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.