Addendum: An alternate proof of the FTSFT

Last week I posted about the Fundamental Theorem of Symmetric Function Theory. Zarathustra Brady pointed me to the following alternate proof in Serge Lang’s book Algebra. While not as direct or useful in terms of changing basis from the $e_\lambda$`s to the $m_\lambda$`s, it is a nice, clean inductive proof that I thought was worth sharing:

Assume for contradiction that the $e_\lambda$`s do not form a basis of the space of symmetric functions. We have shown that they span the space, so there is a dependence relation: some nontrivial linear combination of $e_\lambda$`s, all necessarily of the same degree, is equal to zero. Among all such linear combinations, choose one (say $P$) that holds for the smallest possible number of variables $x_1,\ldots,x_n$. Furthermore, among the possible linear combinations for $n$ variables, choose $P$ to have minimal degree.

If the number of variables is $1$, then the only elementary symmetric functions are $x_1^k$ for some $k$, and so there is clearly no linear dependence relation. So, $n\ge 2$. Furthermore, if $P$ has degree $1$ as a polynomial in the $x_i$`s, then it can involve only $e_1$, and so it cannot be identically zero. So $P$ has degree at least $2$, in at least $2$ variables.

Now, if $P$ is divisible by $x_n$, then by symmetry it is divisible by each of the variables. So, it is divisible by $e_n$, and so we can divide the equation by $e_n$ and get a relation of smaller degree, contradicting our choice of $P$. Otherwise, if $P$ is not divisible by $x_n$, set $x_n=0$. Then we get another nontrivial relation among the $e_\lambda$ in the smaller number of variables $x_1,\ldots,x_n$, again contradicting the choice of $P$. QED!

The Fundamental Theorem of Symmetric Function Theory

This little gemstone is hidden within the folds of algebraic combinatorics, but certainly deserves its name. Just as the Fundamental Theorem of Arithmetic gives us a way of writing common objects (numbers) in a canonical form (prime factorization), the Fundamental Theorem of Symmetric Function Theory allows us to express any symmetric function in a useful canonical form.

First, some background on symmetric functions. Like generating functions, symmetric functions arise naturally in combinatorics, and the coefficients are often the point of interest. In the poetic words of Herbert Wilf in his book generatingfunctionology:

A generating function is a clothesline on which we hang up a sequence of numbers for display.

I claim, and aim to demonstrate here, that

A symmetric function is a web of clotheslines on which we hang up a collection of numbers that are indexed by partitions.

Okay, so the clothesline might be a bit more complicated in this case. But it is much more useful for areas of mathematics in which partitions play an important role.

Let’s be more rigorous. A symmetric function (over $\mathbb{Q}$) is a polynomial or series in many variables with rational coefficients which is invariant (unchanging) under permutations of the variables. For instance, $x^2 + y^2 + z^2 + 2xyz$ is a symmetric function in three variables, but $x^2 y + y^2 z + z^2 x$ is not, because interchanging $x$ and $y$ does not leave the function unchanged.

I find that writing out a symmetric function explicitly as a polynomial, like those above, is similar to expressing a number in base ten – sometimes it is useful, but other times you need its prime factorization. The “primes” of symmetric function theory are the elementary symmetric functions.

First, define $e_n(x_1,\ldots,x_r)=m_{(1^n)}=\sum_{i_1<\cdots<i_n} x_{i_1}\cdots x_{i_n}.$ For instance,
$$e_3(a,b,c,d)=abc+abd+acd+bcd.$$ Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_k)$ be a partition, that is, a finite sequence of positive integers written in nonincreasing order. Then the elementary symmetric function corresponding to $\lambda$ is defined to be the product
$$e_\lambda=e_{\lambda_1}e_{\lambda_2}\cdots e_{\lambda_k}.$$ The remarkable fact is that the symmetric functions $e_\lambda$ form a basis for the $\mathbb{Q}$-module of symmetric functions! In other words:

Fundamental Theorem of Symmetric Function Theory: Every symmetric function can be written uniquely in the form $\sum_{\lambda} c_{\lambda}e_\lambda$, where each $c_\lambda\in \mathbb{Q}$.

So, the $e_\lambda$`s are a clothesline of sorts, indexed by the partitions, on which to hang coefficients.

For example, let’s try to write the symmetric function $x^3+y^3+z^3$ in terms of elementary symmetric functions. We have the functions $e_1=x+y+z$, $e_2=xy+yz+zx$, and $e_3=xyz$ to work with. We can start by cubing $e_1$:
$$e_1^3=x^3+y^3+z^3+3(x^2y+y^2x+x^2z+z^2x+y^2z+z^2y)+6xyz$$ We can replace the $6xyz$ with $6e_3$. We now only need to write the term $3(x^2y+y^2x+x^2z+z^2x+y^2z+z^2y)$ in terms of $e_i$`s. The product $3e_1e_2$ is pretty close, but leaves us with an extra $9xyz$ that we need to subtract out, giving us $3e_1e_2-9e_3$ for the middle term. Putting this all together and solving for $x^3+y^3+z^3$, we find:

$$x^3+y^3+z^3=e_1^3-3e_1e_2+3e_3=e_{(1,1,1)}-3e_{(2,1)}+3e_{(3)}.$$ It is fairly clear that a similar process can be used to express any symmetric function in terms of $e_{\lambda}$`s. But why is it unique?