Last update: 3 March 2013
The following theorem classifies and constructs all irreducible calibrated representations of the affine Hecke algebra It shows that the theory of standard Young tableaux plays an intrinsic role in the combinatorics of the representations of the affine Hecke algebra. The construction given in Theorem 4.1 is a direct generalization of A. Young’s classical “seminormal construction” of the irreducible representations of the symmetric group [You1931,You1934]. Young’s construction was generalized to Iwahori-Hecke algebras of type A by Hoefsmit [Hoe1974] and Wenzl [Wen1988] independently, to Iwahori-Hecke algebras of types B and D by Hoefsmit [Hoe1974] and to cyclotomic Hecke algebras by Ariki and Koike [AKo1994]. It can be shown that all of these previous generalizations are special cases of the construction for affine Hecke algebras given here. Recently, this construction has been generalized even further [Ram1998], to affine Hecke algebras of arbitrary Lie type. Some parts of Theorem 4.1 are due, originally, to I. Cherednik, and are stated in [Che1987, §3].
Garsia and Wachs [GWa1989] showed that the theory of standard Young tableaux and Young’s constructions play an important role in the combinatorics of the skew representations of the symmetric group. At that time it was not known that these representations are actually irreducible as representations of the affine Hecke algebra!!
Theorem 4.1. Let be a placed skew shape with n boxes. Define an action of on the vector space
by the formulas
where is the same as except that the entries and are interchanged,
and denotes the box of containing the entry
Step 1. The given formulas for the action of define an
Proof. | |
If is a standard tableau then the entries and cannot appear in the same diagonal in Thus, for all standard tableaux and for this reason the constant is always well defined. Let be a standard tableau of shape Then and so The calculations to check the identities (1.1a), (1.1f) and (1.5) are routine. Checking the identity is more involved. One can proceed as follows. According to the formulas for the action, the operators and preserve the subspace spanned by the vectors indexed by the standard tableaux in the set Depending on the relative positions of the boxes containing in this space is either 1, 2, 3 or 6 dimensional. Representative cases are when these boxes are positioned in the following ways. In Case (1) the space is one dimensional and spanned by the vector corresponding to the standard tableau where and The action of and on is given by the matrices respectively. In case (2) the space is two dimensional and spanned by the vectors corresponding to the standard tableaux where and The action of and on is given by the matrices In case (3) the space is three dimensional and spanned by the vectors corresponding to the standard tableaux where and The action of and on is given by the matrices respectively, where and In case (4) the space is six dimensional and spanned by the vectors corresponding to the standard tableaux where and The action of and on is given by the matrices and where In each case we compute directly the products and and verify that they are equal. (This proof of the braid relation is, in all essential aspects, the same as that used by Hoefsmit [Hoe1974], Wenzl [Wen1988] and Ariki and Koike [AKo1994]. For a more elegant but less straightforward proof of this relation see the proof of Theorem 3.1 in [Ram1998].) |
Step 2. The module is irreducible.
Proof. | |
Let be a standard tableaux of shape and define where the second product is over all standard tableaux of shape which are not equal to Then is an element of such that for all standard tableaux of shape This follows from the formula for the action of on and the fact that the sequence completely determines the standard tableau (Lemma 2.2). Let be a nonzero submodule of and let be a nonzero element of Let be a standard tableau such that the coefficient is nonzero. Then and so By Proposition 2.1 we may identify the set with an interval in (under Bruhat order). Under this identification the minimal element is the column reading tableau and there is a chain such that all elements of the chain are standard tableaux of shape Then, by the definition of the for some constant It follows that Let be an arbitrary standard tableau of shape Again, there is a chain of standard tableaux in and we have for some Thus It follows that Thus is irreducible. |
Step 3. The modules are nonisomorphic.
Proof. | |
Each of the modules has a unique basis (up to multiplication of each basis vector by a constant) of simultaneous eigenvectors for the Each basis vector is determined by its weight, the sequence of eigenvalues given by By the definition of the action of the a weight of is equal to for some standard tableau By Lemma 2.2, both the standard tableau and the placed skew shape are determined uniquely by this weight. Thus no two of the modules can be isomorphic. |
Step 4. If is the weight of a calibrated then for some standard tableau of placed skew shape.
Proof. | |
Let be a weight vector in of weight i.e. We want such that We shall show that if for then there exist and such that and This will show that if there are two adjacent boxes of in the same diagonal then these boxes must be contained in a complete block, i.e. if there is a configuration in L of the form This is sufficient to guarantee that is of skew shape. Let be such that and is minimal. The argument is by induction on the value of Case 1: Then and are linearly independent. If they were not we would have which would give Since this equation implies that which is a contradiction. Now the relations (1.1d) and (1.4) show that It follows that is an element of but not an element of This is a contradiction to the fact that is calibrated. So this is not possible, i.e. cannot equal Case 2: Since and is a weight vector, the vector is a weight vector of weight (see (3.7a)). Then and so, by Case 1, This implies that By equation (1.3), all eigenvalues of are either or Thus and so A similar argument shows that must be 0 and thus that From and we get This is impossible since is not a root of unity. So this case is not possible, i.e. cannot equal Induction step. Assume that and are such that and the value is minimal such that this is true. If then the vector is a weight vector of weight and by (3.7b) this vector is nonzero. Since we can apply the induction hypothesis to conclude that there are and with such that and This implies that and Similarly, if then the vector is a weight vector of weight and by (3.7b) this vector is nonzero. Since we can apply the induction hypothesis to conclude that there are and with such that and This implies that and If we are not in either of the previous cases then or and or We cannot have since the and are such that is minimal such that Thus |
Step 5. Suppose that is an irreducible calibrated and that is a weight vector in with weight such that Then
Proof. | |
Assume that Then, by the second identity in Proposition 3.2 (b), Since is irreducible there must be some sequence of such that with Assume that is a minimal length sequence such that this is true. We have Assume that Then there must be such that (because some nontrivial permutation of the fixes Since is of minimal length such that it fixes it must be a transposition for some such that Furthermore there does not exist such that The element switches the and the in In the process of doing this switch by a sequence of simple transpositions there must be some point where and are adjacent and thus there must be some such that Then is a nonzero weight vector in of weight Since it follows that Since is calibrated this is a contradiction to (Case 1 of) step 4. So Let be minimal such that is not reduced. Assume Then we can use the braid relations (the third and fourth lines of Proposition 3.2 (b)) to write for some Then, by the second line of Proposition 3.2 (b), for some This is a contradiction to the minimality of the length of the sequence So and This is a contradiction since the second identity in Proposition 3.2 (b) and the assumption that imply that So |
Step 6. An irreducible calibrated is isomorphic to for some placed skew shape
Proof. | |
Let be a nonzero weight vector in Since is calibrated step 4 implies that there is a placed skew shape and a standard tableau of shape such that Let us write in place of Let be the column reading tableau of shape It follows from Proposition 2.1 that there is a chain of standard tableaux of shape By (3.7b), all of the in this sequence are bijections and so is a nonzero weight vector in Similarly, if is any other standard tableau of shape then there is a chain and so is a nonzero weight vector in Finally, by step 5, if is not standard (since and so the span of the vectors is a submodule of Since is irreducible this must be all of and the map is an isomorphism of |
This completes the proof of Theorem 4.1.
This is an excerpt of the preprint entitled Skew shape representations are irreducible authored by Arun Ram in 1998.
Research supported in part by National Science Foundation grant DMS-9622985, and a Postdoctoral Fellowship at Mathematical Sciences Research Institute.