Skip to the Main Content

Note:These pages make extensive use of the latest XHTML and CSS Standards. They ought to look great in any standards-compliant modern browser. Unfortunately, they will probably look horrible in older browsers, like Netscape 4.x and IE 4.x. Moreover, many posts use MathML, which is, currently only supported in Mozilla. My best suggestion (and you will thank me when surfing an ever-increasing number of sites on the web which have been crafted to use the new standards) is to upgrade to the latest version of your browser. If that's not possible, consider moving to the Standards-compliant and open-source Mozilla browser.

November 9, 2007

Geometric Representation Theory (Lecture 9)

Posted by John Baez

Pick some type of structure you can put on an nn-element set. Then the group n!n! — the group of all permutations of this nn-element set — acts on the set XX of all structures of this type. So, we get an action of n!n! on XX, and thus a representation of n!n! on the vector space X\mathbb{C}^X.

My favorite type of structure on an nn-element set is called a ‘DD-flag’. Remember this? DD can be any nn-box Young diagram — that is, any list of natural numbers n 1n k>0n_1 \ge \cdots \ge n_k \gt 0 that add up to nn. A DD-flag on an nn-element set is a way of partitioning it into subsets of sizes n 1,,n kn_1, \dots , n_k.

If XX is the set of DD-flags on our favorite nn-element set, then by what I’ve said, we get a representation of n!n! on X\mathbb{C}^X.

So, any nn-box Young diagram gives a representation of n!n!. These are called flag representations. They’re typically reducible — big and fat. But, just like they say every fat person has a skinny person inside, trying to get out, each of these fat representations has an irreducible representation inside, trying to get out.

This time in the Geometric Representation Theory seminar, James Dolan shows how to get these skinny representations out. The trick is to chop away at the fat ones using Hecke operators. This amounts to a categorified version of the Gram–Schmidt process, where we keep chopping off the components of a vector that point along the previous vectors in our list, until we’re left with orthogonal vectors.

By this method, we get all the irreducible representations of n!n! — one for each nn-box Young diagram!

Near the end of this class, Jim starts discussing Hecke operators between flag representations in more detail. He describes them using certain matrices which will eventually become known as ‘crackpot matrices’… for reasons that will be clear someday.

  • Lecture 9 (Oct. 25) - James Dolan on Hecke operators for the groups n!n!. Each nn-box Young diagram DD gives an action of n!n! on the set of DD-flags on the nn-element set. These actions give permutation representations of n!n! called ‘flag representations’. Flag representations are usually reducible, but we can extract a complete set of irreducible representations using Hecke operators, via a categorified version of Gram–Schmidt orthonormalization. So, we obtain one irreducible representation of n!n! for each nn-box Young diagram. The example of 4!, continued.

    Given an nn-box Young diagram DD with dd rows and an nn-box Young diagram EE with ee rows, we can use “crackpot matrices” — d×ed \times e matrices of natural numbers with specified row and column sums — to give explicit descriptions of all the Hecke operators from one flag representation to another.

Posted at November 9, 2007 5:51 AM UTC

TrackBack URL for this Entry:

0 Comments & 0 Trackbacks

Post a New Comment