Difference between revisions of "Symmetric sum"

(See also)
(Made latex look better.)
Line 1: Line 1:
 
A '''symmetric sum''' is any sum in which any [[permutation]] of the variables leaves the sum unchanged.
 
A '''symmetric sum''' is any sum in which any [[permutation]] of the variables leaves the sum unchanged.
  
One way to generate symmetric sums is using symmetric sum notation. If <math>f(x_1, x_2, x_3, \dots, x_n)</math> is a function of <math>n</math> variables then the symmetric sum <math>\sum_{sym} f(x_1, x_2, x_3, \dots, x_n) = \sum_{\sigma} f(x_{\sigma(1)}, {x_\sigma(2)}, {x_\sigma(3)}, \dots, x_{\sigma(n)})</math>, where <math>\sigma</math> ranges over all permutations of <math>(1, 2, 3, \dots, n)</math>.
+
One way to generate symmetric sums is using symmetric sum notation. If <math>f(x_1, x_2, x_3, \dots, x_n)</math> is a function of <math>n</math> variables then the symmetric sum <math>\sum_{sym} f(x_1, x_2, x_3, \dots, x_n) = \sum_{\sigma} f(x_{\sigma(1)}, x_{\sigma(2)}, x_{\sigma(3)}, \dots, x_{\sigma(n)})</math>, where <math>\sigma</math> ranges over all permutations of <math>(1, 2, 3, \dots, n)</math>.
  
 
All symmetric sums can be written as a polynomial of [[elementary symmetric sum]]s.  
 
All symmetric sums can be written as a polynomial of [[elementary symmetric sum]]s.  

Revision as of 07:52, 21 October 2017

A symmetric sum is any sum in which any permutation of the variables leaves the sum unchanged.

One way to generate symmetric sums is using symmetric sum notation. If $f(x_1, x_2, x_3, \dots, x_n)$ is a function of $n$ variables then the symmetric sum $\sum_{sym} f(x_1, x_2, x_3, \dots, x_n) = \sum_{\sigma} f(x_{\sigma(1)}, x_{\sigma(2)}, x_{\sigma(3)}, \dots, x_{\sigma(n)})$, where $\sigma$ ranges over all permutations of $(1, 2, 3, \dots, n)$.

All symmetric sums can be written as a polynomial of elementary symmetric sums.

See also

This article is a stub. Help us out by expanding it.