Symmetric Function(redirected from Fundamental theorem of symmetric functions)
symmetric function[sə′me·trik ′fəŋk·shən]
a function of two or more variables that remains unchanged under all permutations of the variables. Examples are and 4x1x2x3
Of particular importance in algebra are symmetric polynomials, especially elementary symmetric polynomials—that is, the functions
where the summations are extended over all combinations of unequal numbers k, l, …. The sums are linear in each of the variables. According to the Vieta formulas, x1, x2,…,xn are the roots of the equation
xn – f1 xn-1 + f2 xn-2 – … + (–1)nfn = 0
The fundamental theorem of the theory of symmetric polynomials states that any symmetric polynomial can be represented in one, and only one, way as a polynomial in the elementary symmetric polynomials: F (x1, x2,…. xn) = G (f1, f2,…, fn). If all the coefficients of Fare integers, then so are the coefficients of G. Thus, every symmetric polynomial with integer coefficients on the roots of an equation can be expressed as a polynomial with integer coefficients on the coefficients of that equation; for example.
Another important class of symmetric functions are the power sums
The relation between such power sums and elementary symmetric polynomials is given by the Newton formulas:
These formulas permit the fk to be expressed successively in terms of the sm, and vice versa.
A function is said to be skew-symmetric, or alternating, if it remains unchanged under even permutations of x1, x2, …., xn and changes sign under odd permutations. Such functions can be rationally expressed in terms of f1, f2,…, fn and the product (seeDISCRIMINANT)
the square of which is a symmetric function and thus can be rationally expressed in terms of f1, f2,…,fn