Time for another gemstone from symmetric function theory! (I am studying for my Ph.D. qualifying exam at the moment, and as a consequence, the next several posts will feature yet more gemstones from symmetric function theory. You can refer back to this post for the basic definitions.)
Start with a polynomial $p(x)$ that factors as \[p(x)=(x-\alpha_1)(x-\alpha_2)\cdots(x-\alpha_n).\] The coefficients of $p(x)$ are symmetric functions in $\alpha_1,\ldots,\alpha_n$ - in fact, they are, up to sign, the elementary symmetric functions in $\alpha_1,\ldots,\alpha_n$.
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:
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.
These two concepts go together in a very natural way. Prepare for a breathtaking real-world application of Euclidean geometry!
Suppose you have two identical long wires side by side, parallel to each other and connected to each other at one end, and a current is flowing through one wire and back through the other in the other direction. As in this video, each wire generates a magnetic field, and the magnetic field forces the two wires towards each other. The question is, just before the wires start to move towards each other, what does the magnetic field look like?
Last week, I sat down to compute the character table of $S_5$ for the first time in several years.
My first instinct, following what I learned five years ago, was to use the standard tricks for computing character tables: compute the characters of some easily constructed representations, use the fact that the sum of the squares of the dimensions of the irreducible characters is $|S_5|=120$, and use the orthogonality of the rows and columns of the character table to finish it off.
This, however, is rather tedious for a group as large as $S_5$. But I had recently learned that the irreducible representations of the symmetric group are completely classified, and can be constructed using group actions on standard Young tableaux. Was there a way to use this theory to compute each entry of the character table directly?