Let R be a commutative ring
and consider the polynomial ring R[x1,…,xn].
A polynomial f(x1,…,xn)∈R[x1,…,xn] is symmetric if
f(xσ(1),…,xσ(n))=f(x1,…,xn)for every permutation σ of {1,…,n}.Define the elementary symmetric polynomials
ek(x1,…,xn)=1≤i1<⋯<ik≤n∑xi1⋯xik(k=1,…,n).Theorem (Fundamental theorem of symmetric polynomials). For every symmetric polynomial
f∈R[x1,…,xn], there exists a unique polynomial F∈R[t1,…,tn] such that
f(x1,…,xn)=F(e1(x1,…,xn),…,en(x1,…,xn)).Equivalently, the subring of symmetric polynomials is a polynomial ring:
R[x1,…,xn]sym≅R[e1,…,en].This theorem is a key bridge to Galois groups
: if f∈K[x] splits over a splitting field
as ∏i=1n(x−αi), then the coefficients of f are (up to signs) exactly the elementary symmetric polynomials in the roots αi.
Examples
For n=2, with e1=x1+x2 and e2=x1x2,
x12+x22=(x1+x2)2−2x1x2=e12−2e2.For n=2,
x13+x23=(x1+x2)3−3(x1+x2)(x1x2)=e13−3e1e2.For n=3, with e1=x1+x2+x3 and e2=x1x2+x1x3+x2x3,
x12+x22+x32=e12−2e2.(Note that e3=x1x2x3 is not needed in this particular expression, but it appears in many others.)