Math 2.0

definition

Elementary symmetric polynomials

Definition

Let RR be a commutative ring and let n≥1n \ge 1. For 0≤k≤n0 \le k \le n, the kk-th elementary symmetric polynomial in x1,…,xnx_1, \dots, x_n is ek=∑1≤i1<i2<⋯<ik≤nxi1xi2⋯xik∈R[x1,…,xn].e_k = \sum_{1 \le i_1 < i_2 < \dots < i_k \le n} x_{i_1} x_{i_2} \cdots x_{i_k} \in R[x_1, \dots, x_n].

Remarks

So e0=1e_0 = 1, e1=x1+⋯+xne_1 = x_1 + \dots + x_n and en=x1x2⋯xne_n = x_1 x_2 \cdots x_n. One sets ek=0e_k = 0 for k>nk > n. In three variables, e2=x1x2+x1x3+x2x3e_2 = x_1 x_2 + x_1 x_3 + x_2 x_3. The generating identity is ∏i=1n(t+xi)=∑k=0nektn−k\prod_{i=1}^n (t + x_i) = \sum_{k=0}^n e_k t^{n-k}. Each eke_k is symmetric and homogeneous of degree kk.

Explanations

L1 human

The elementary symmetric polynomials are the simplest symmetric polynomials: the sum of the variables, the sum of their products in pairs, and so on. Up to sign, they are the coefficients of the polynomial whose roots are the variables.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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 7 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

What depends on this

4 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Elementary_symmetric_polynomial, Definition