Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last updated: 2 October 2014
Lecture 6
Crystals
Start with
with operators and given by
Tensor products are by concatenation
If and are
then acts on
by
and the action of is given by
Decomposing where
with
So
where
Then
where
So far we have
A crystal is a subset of closed under the action of
and
The crystal graph of a crystal is the graph with vertices and edges
A crystal is irreducible if its crystal graph is connected.
Let be a crystal. The character of is
where is the endpoint of
A highest weight path is a path which is always
If is a highest weight path then
Our examples
has
Then
has character
Next
has character
has character
and
are the highest weight paths in
has character
and
has highest weight paths
and
Classification of irreducible
(a)
The irreducible are
with
(b)
Every crystal is a disjoint union of irreducible crystals.
(c)
Each irreducible crystal has a unique highest weight path and
if ends at
For the picture
with and is replaced by
with operators
Some examples:
has character
Let Then
The points of the positive/dominant chamber
are in bijection with partitions with rows.
We have
with
and
Now compute
Three realizations of
Inside
Inside
With the straight line path as highest weight path:
Definitions
A is a collection of paths
closed under the root operators
The root operators
act like the operators
in the
projection
and
act like the operators
in the
projection.
A highest weight path is a path contained in
A path is highest weight if and only if
and
The crystal graph has edges labeled and
The crystal graph is irreducible if the crystal graph is connected.
(a)
The irreducible
are indexed by the points in
(b)
Every crystal is a disjoint union of irreducible crystals.
(c)
Each irreducible crystal has a unique highest weight path and
if ends at
A column strict tableau of shape
is a filling of the boxes of from
such that
(a)
the rows weakly increase (left to right)
(b)
the columns strictly increase (top to bottom).
Let
Let
There is a bijection from
to
given by reading the tableau in arabic reading order and taking the corresponding word in
Notes and References
These are a typed copy of Lecture 6 from a series of handwritten lecture notes for the class Representation Theory given on September 2, 2008.