Unipotent Hecke algebras: the structure, representation theory, and combinatorics
Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last updated: 26 March 2015
This is an excerpt of the PhD thesis Unipotent Hecke algebras: the structure, representation theory, and combinatorics by F. Nathaniel Edgar Thiem.
Representation theory in the case
This chapter examines the representation theory of unipotent Hecke algebras when
The combinatorics associated with the representation theory of
generalizes the tableaux combinatorics of the symmetric group, and one of the main results of this chapter is to also give a generalization of the RSK correspondence
(see Section 2.3.4).
Fix a homomorphism
Recall that for any composition
is a unipotent Hecke algebra (see Chapter 4). A fundamental result concerning Gelfand-Graev Hecke algebras is
([GGr1962],[Yok1968],[Ste1967]). For all
is commutative.
and it will follow from Theorem 5.7, via the representation theory of unipotent Hecke algebras.
The representation theory of
Let be a set. An
is a sequence of partitions indexed by the elements of Let
The following discussion defines two sets and
so that index the irreducible characters of and
index the conjugacy classes of
Let
be the character group of If
then let
Thus if then we may view
by identifying with
Define
The Frobenius maps are
where is the algebraic closure of
The map
is a bijection such that the size of the of equals the degree
of
Let
If is a and is a
then let
be the size of and respectively. Let the sets
and
be as in (5.1) and let
(Green [Gre1955]). Let
(a)
indexes the conjugacy classes
of
(b)
indexes the irreducible
Suppose A
column strict tableau
of shape is a column strict filling of by positive integers. That is,
is a column strict tableau of shape
Write The
weight of is the composition
given by
If and is a composition, then let
and
The following theorem is a consequence of Theorem 2.3 and a theorem proved by Zelevinsky [Zel1981-2] (see Theorem 5.5). A proof of Zelevinsky’s theorem is in Section 5.3.
The set indexes the irreducible
and
A generalization of the RSK correspondence
For a composition let
be as in (4.11) and as in (4.12).
The
decomposition
Theorem 5.4, below, gives a combinatorial proof of this identity.
Encode each matrix as a
where
is given by
Note that this is an entry by entry “factorization” of such that
Recall from Section 2.3.4 the classical RSK correspondence
For let
and be the
strict tableaux given by
Then the map
is a bijection, where the first map is the inverse of the bijection in Theorem 4.2.
By the construction above, the map is well-defined, and since all the steps are invertible, the map is a bijection.
Example. Suppose and
are such that
and
Then
corresponds to the sequence
and
Zelevinsky’s decomposition of
This section proves the theorem
(Zelevinsky [Zel1981-2]). Let be the subgroup of unipotent upper-triangular matrices of
and be as in (4.8). Then
Theorem 5.3 follows from this theorem and Theorem 2.3. The proof of Theorem 5.5 is in 3 steps.
(1)
Establish the necessary connection between symmetric functions and the representation theory of
(2)
Prove Theorem 5.5 for the case when
(3)
Generalize (2) to arbitrary
The proof below uses the ideas of Zelevinsky’s proof, but explicitly uses symmetric functions to prove the results. Specifically, the following discussion through
the proof of Theorem 5.7 corresponds to [Zel1981-2, Sections 9-11] and Theorem 5.5 corresponds to [Zel1981-2, Theorem 12.1].
Preliminaries to the proof (1)
Let and
The group
has subgroups
where is the identity matrix. Note that
and
The indflation map is a composition of the inflation map and the induction map,
where
Suppose and
(see (5.3)). Let be the irreducible character corresponding to the irreducible
and let
be the characteristic function corresponding to the conjugacy class (see Theorem 5.2), given by
Define
The space has an inner product defined by
and multiplication
For each let
be an infinite set of variables, and let
where
is the ring of symmetric functions in
(see Section 2.3.3). For each define an additional set of variables
such that the symmetric functions in the variables are related to the symmetric functions in the variables by the transform
where
is the irreducible polynomial that has as a root, and
if Then
For let
be the Schur function and
be the Hall-Littlewood symmetric function (as in Section 2.3.3). Define
where
and for a composition
The ring
has an inner product given by
(Green [Gre1955],Macdonald [Mac1995]). The linear map
is an algebra isomorphism that preserves the inner product.
A unipotent conjugacy class is a conjugacy class such that
unless
Let
be the subalgebra of unipotent class functions. Note that by (5.10) and Theorem 5.6,
Consider the projection which is an algebra homomorphism given by
Then
is given by
The decomposition of (2)
The representation
is the Gelfand-Graev module, and with Theorem 2.3, Theorem 5.7, below, proves that
is commutative.
Let be the subgroup of unipotent upper-triangular matrices of
Then
Proof.
Let
For any finite group and
let
The proof is in six steps.
(a)
where
(b)
for
(c)
for all
where
(d)(e)
for all
(f)
(a) An argument similar to the argument in [Mac1995, pgs. 285-286] shows that
(see [HRa1999, Theorem 4.9 (a)] for details). Therefore, by Frobenius reciprocity and the orthogonality of characters,
(b) Since there exists an idempotent such that
and
the map
is a vector space isomorphism (using an argument similar to the proof of [CRe1981, (3.18)]). Thus,
(c) By (a),
It therefore suffices to show that
Suppose and let
Then
Since
and
If there exists such that
then
Therefore,
unless If
of then there exists
such that
so
In particular,
If then
is upper-triangular, so
and
giving
(d) By Frobenius reciprocity,
so
(e) Induct on using (c) and the identity
to obtain
Note that
Since is multiplicative on
In particular, since is linear and
Note that (e) also implies that is multiplicative on all of
(f) Note that
where the last two equalities follow from (e) and (c), respectively. By definition
so
implies
Decmoposition of (3)
Suppose
A column strict tableauof shapeand weight is a column
strict filling of such that for each
We can now prove the theorem stated at the beginning of this section:
([Zel1981-2]) Let be the subgroup of unipotent upper-triangular matrices of
and be as in (4.8). Then
Proof.
Note that
where
Thus
In particular, by the definition of multiplication in (5.8),
Pieri’s rule (2.10) implies that for
and
where
By Green’s Theorem (Theorem 5.6), ch is an isomorphism, so
A weight space decomposition of
Let
and let and
be as in (5.6) and (5.7). Recall that
For let
with as in (4.14). Then the map
is an injective algebra homomorphism with image
Proof.
Note that
Since
and is trivial on
where is as in (5.13). Since
the idempotent commutes with
and
Consequently, the map multiplies by and changes
to so it is an algebra homomorphism. Since the map sends basis elements
to basis elements, it is also injective.
Remark. This is the
version of Corollary 3.5.
Let be as in Theorem 5.8. By Theorem 5.1 each
is commutative, so is commutative and all the irreducible
are one-dimensional. Theorem 5.3 implies that
indexes the irreducible
Therefore, the set
indexes the irreducible Identify
with the map
such that
For the
space
of an is
Then
Let and
A column strict tableauof shapeand weight is
column strict filling of such that for each
where
is the number of boxes in the partition (which has length 1).
Let
For example, suppose
and
Then
Let be an irreducible
and Then
Proof.
By Theorem 2.3 and Proposition 2.2,
where
Therefore,
Pieri’s rule (2.10) implies
Notes and References
This is an excerpt of the PhD thesis Unipotent Hecke algebras: the structure, representation theory, and combinatorics by F. Nathaniel Edgar Thiem.