Math 2.0

statement theorem

Fundamental theorem of symmetric polynomials

Statement

Let RR be a commutative ring and let f∈R[x1,…,xn]f \in R[x_1, \dots, x_n] be symmetric. Then there is a unique polynomial g∈R[y1,…,yn]g \in R[y_1, \dots, y_n] with f=g(e1,…,en),f = g(e_1, \dots, e_n), where e1,…,ene_1, \dots, e_n are the elementary symmetric polynomials.

Remarks

Equivalently, the map R[y1,…,yn]→R[x1,…,xn]R[y_1, \dots, y_n] \to R[x_1, \dots, x_n], yk↦eky_k \mapsto e_k, is injective, and its image is the ring of symmetric polynomials. One proof is by induction on the leading monomial in the lexicographic order. Each step subtracts a product of the eke_k with the same leading monomial. Example: x12+x22=e12−2e2x_1^2 + x_2^2 = e_1^2 - 2 e_2. So a symmetric expression in the roots of a polynomial over a field KK is an element of KK.

Explanations

L1 human

Every symmetric polynomial can be written in exactly one way using the elementary symmetric polynomials. The coefficients stay in the same ring.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 8 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Polynomial ring definition
  5. Polynomials in several variables definition
  6. Symmetric polynomial definition
  7. Elementary symmetric polynomials definition
  8. Fundamental theorem of symmetric polynomials statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Elementary_symmetric_polynomial, Fundamental theorem of symmetric polynomials