Defining Individual Symmetric Functions
It should be noted that the name "symmetric function" for elements of Λ_{R} is a misnomer: in neither construction the elements are functions, and in fact, unlike symmetric polynomials, no function of independent variables can be associated to such elements (for instance e_{1} would be the sum of all infinitely many variables, which is not defined unless restrictions are imposed on the variables). However the name is traditional and well established; it can be found both in (Macdonald, 1979), which says (footnote on p. 12)
The elements of Λ (unlike those of Λ_{n}) are no longer polynomials: they are formal infinite sums of monomials. We have therefore reverted to the older terminology of symmetric functions.
(here Λ_{n} denotes the ring of symmetric polynomials in n indeterminates), and also in (Stanley, 1999).
To define a symmetric function one must either indicate directly a power series as in the first construction, or give a symmetric polynomial in n indeterminates for every natural number n in a way compatible with the second construction. An expression in an unspecified number of indeterminates may do both, for instance
can be taken as the definition of an elementary symmetric function if the number of indeterminates is infinite, or as the definition of an elementary symmetric polynomial in any finite number of indeterminates. Symmetric polynomials for the same symmetric function should be compatible with the morphisms ρ_{n} (decreasing the number of indeterminates is obtained by setting some of them to zero, so that the coefficients of any monomial in the remaining indeterminates is unchanged), and their degree should remain bounded. (An example of a family of symmetric polynomials that fails both conditions is ; the family fails only the second condition.) Any symmetric polynomial in n indeterminates can be used to construct a compatible family of symmetric polynomials, using the morphisms ρ_{i} for i < n to decrease the number of indeterminates, and φ_{i} for i ≥ n to increase the number of indeterminates (which amounts to adding all monomials in new indeterminates obtained by symmetry from monomials already present).
The following are fundamental examples of symmetric functions.
 The monomial symmetric functions m_{α}, determined by monomial Xα (where α = (α_{1},α_{2},…) is a sequence of natural numbers); m_{α} is the sum of all monomials obtained by symmetry from Xα. For a formal definition, consider such sequences to be infinite by appending zeroes (which does not alter the monomial), and define the relation "~" between such sequences that expresses that one is a permutation of the other; then

 This symmetric function corresponds to the monomial symmetric polynomial m_{α}(X_{1},…,X_{n}) for any n large enough to have the monomial Xα. The distinct monomial symmetric functions are parametrized by the integer partitions (each m_{α} has a unique representative monomial Xλ with the parts λ_{i} in weakly decreasing order). Since any symmetric function containing any of the monomials of some m_{α} must contain all of them with the same coefficient, each symmetric function can be written as an Rlinear combination of monomial symmetric functions, and the distinct monomial symmetric functions form a basis of Λ_{R} as Rmodule.
 The elementary symmetric functions e_{k}, for any natural number k; one has e_{k} = m_{α} where . As a power series, this is the sum of all distinct products of k distinct indeterminates. This symmetric function corresponds to the elementary symmetric polynomial e_{k}(X_{1},…,X_{n}) for any n ≥ k.
 The power sum symmetric functions p_{k}, for any positive integer k; one has p_{k} = m_{(k)}, the monomial symmetric function for the monomial X_{1}k. This symmetric function corresponds to the power sum symmetric polynomial p_{k}(X_{1},…,X_{n}) = X_{1}k+…+X_{n}k for any n ≥ 1.
 The complete homogeneous symmetric functions h_{k}, for any natural number k; h_{k} is the sum of all monomial symmetric functions m_{α} where α is a partition of k. As a power series, this is the sum of all monomials of degree k, which is what motivates its name. This symmetric function corresponds to the complete homogeneous symmetric polynomial h_{k}(X_{1},…,X_{n}) for any n ≥ k.
 The Schur functions s_{λ} for any partition λ, which corresponds to the Schur polynomial s_{λ}(X_{1},…,X_{n}) for any n large enough to have the monomial Xλ.
There is no power sum symmetric function p_{0}: although it is possible (and in some contexts natural) to define as a symmetric polynomial in n variables, these values are not compatible with the morphisms ρ_{n}. The "discriminant" is another example of an expression giving a symmetric polynomial for all n, but not defining any symmetric function. The expressions defining Schur polynomials as a quotient of alternating polynomials are somewhat similar to that for the discriminant, but the polynomials s_{λ}(X_{1},…,X_{n}) turn out to be compatible for varying n, and therefore do define a symmetric function.
Read more about this topic: Ring Of Symmetric Functions, The Ring of Symmetric Functions
Famous quotes containing the words functions, defining and/or individual:
“When Western people train the mind, the focus is generally on the left hemisphere of the cortex, which is the portion of the brain that is concerned with words and numbers. We enhance the logical, bounded, linear functions of the mind. In the East, exercises of this sort are for the purpose of getting in tune with the unconscious—to get rid of boundaries, not to create them.”
—Edward T. Hall (b. 1914)
“Art, if one employs this term in the broad sense that includes poetry within its realm, is an art of creation laden with ideals, located at the very core of the life of a people, defining the spiritual and moral shape of that life.”
—Ivan Sergeevich Turgenev (1818–1883)
“A name pronounced is the recognition of the individual to whom it belongs. He who can pronounce my name aright, he can call me, and is entitled to my love and service.”
—Henry David Thoreau (1817–1862)