Symmetric function: Difference between revisions

Revision as of 03:52, 8 November 2014

Revision as of 03:55, 8 November 2014

Line 1:

{{About|general properties of symmetric functions|the ring of symmetric functions in algebraic combinatorics|ring of symmetric functions}}

{{technical|date=March 2013}}

{{unreferenced|date=March 2013}}

In [[mathematics]], a '''symmetric function of ''n'' variables''' is one whose value at any ''n''-[[tuple]] of [[argument of a function|arguments]] is the same as its value at any [[permutation]] of that ''n''-tuple. While this notion can apply to any type of function whose ''n'' arguments live in the same set, it is most often used for [[polynomial function]]s, in which case these are the functions given by [[symmetric polynomials]]. There is very little systematic theory of symmetric non-polynomial functions of ''n'' variables, so this sense is little-used, except as a general definition.

In [[algebra]] and in particular in [[algebraic combinatorics]], the term "symmetric function" is often used instead to refer to elements of the [[ring of symmetric functions]], where that ring is a specific limit of the rings of symmetric polynomials in ''n'' indeterminates, as ''n'' goes to infinity. This ring serves as universal structure in which relations between symmetric polynomials can be expressed in a way independent of the number ''n'' of indeterminates (but its elements are neither polynomials nor functions). Among other things, this ring plays an important role in the [[representation theory of the symmetric group]]s.

For these specific uses, see the corresponding articles; the remainder of this article addresses general properties of symmetric functions in ''n'' variables.

== Symmetrization ==