Representation Theory

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

𝔰𝔩2 Crystals

Start with B(a)= {,} with operators e and f given by e() = , e() = 0, f() = 0, f() = . f e Tensor products are by concatenation B() B() = { , , , } , B() B() B() = { , , , , , , , } . If B1 and B2 are 𝔰𝔩2-crystals then f acts on B1B2={pq|pB1,qB2} by f(pq)= { fpq, if (last occurrence of) most negative point ofpq is inp, pfq, if (last occurrence of) most negative point ofpq is inq, and the action of e is given by eb= { b, ifb=fb, 0, otherwise.

Decomposing Bk where B=B()

B()B()= { , , , } with 0 e fe fe f 0 0 e f 0 So B() B()= B() B(), where B()= { , , } andB()= { } . Then B3 = (B()B())B() = ( B() B() ) B() = ( B() B() ) (B()B()) f f f B() B() B() B() f and f B() B() B() where B()= { , , , } . So far we have B() B() B() B() B() B() B0 B1 B2 B3

A crystal is a subset of B closed under the action of e and f.

The crystal graph of a crystal B is the graph with vertices B and edges p-fp.

A crystal is irreducible if its crystal graph is connected.

Let B be a crystal. The character of B is ch(B)=pB xwt(p), where wt(p) is the endpoint of p.

A highest weight path is a path which is always 0.

If b is a highest weight path then ep=0.

Our examples

B=B()= { f } has char(B())=x+x-1. Then B2=BB= { , , , } has character char(BB)= (x+x-1)2= x2+2+x-2. Next B()= { f f } has character char(B())= x2+1+x-2=x2+ x0+x-2. B()={} has character char(B())=x0=1 and B2B() B()and and are the highest weight paths in BB. B()= { fe f f } has character char(B()) =x3+x+x-1+x-3 and B3B() B()B() has highest weight paths ,, and char(B3)= (x+x-1)3= (x3+x+x-1+x-3)+ (x+x-1)+(x+x-1).

Classification of irreducible 𝔰𝔩2-crystals

(a) The irreducible 𝔰𝔩2-crystals are B(k)= { f f f f } with char(B(k))= xk+xk-2++ x-(k-2)+x-k.
(b) Every crystal is a disjoint union of irreducible crystals.
(c) Each irreducible crystal B has a unique highest weight path and BB(k) , if p ends at k.

𝔰𝔩3-crystals

For 𝔰𝔩3-crystals the picture 𝔰𝔩2 -4 -3 -2 -1 0 1 2 3 4 𝔥α with e and f is replaced by 𝔰𝔩3 𝔥α1 𝔥α2 ω1 ω2 with operators e1,e2,f1,f2.

Some examples:

B()= { f1 f2 } has character char(B())=x1+x2+x3. Let B=B(). Then B2 = B()B() = f1 f1 f2 f2 f1 f2 f2 f1 = B() B(). The points of the positive/dominant chamber P+= { kω1±+ω2 |k,0 } are in bijection with partitions with 2 rows. P+ 1-1 {partitions with2rows} kω1+ω2 k We have char(B2) = (x1+x2+x3)2 = ( x12+x1x2+ x3x1+x22+ x3x2+x32 ) + (x1x2+x1x3+x2x3) , with char(B()) = x12+x1x2+ x1x3+x22+ x2x3+x32 = 1ij3 xixj, and char(B()) = x1x2+ x1x3+ x2x3 = 1i<j3 xixj. Now compute B3 = B() B() B() = B() B() B() B().

Three realizations of B()

Inside B()B(): f1 f2 f2 f1 f1 f2 f2 f1 Inside B()B(): f1 f2 f2 f1 f1 f2 f2 f1 With the straight line path as highest weight path: f1 f2 f1 f2 f1 f2 f2f1

Definitions

A 𝔰𝔩3-crystal is a collection of paths closed under the root operators e1,e2,f1,f2. The root operators e1,f1 act like the 𝔰𝔩2-crystal operators e,f in the (𝔥α1) projection 𝔥α1 p f1p and e2,f2 act like the 𝔰𝔩2-crystal operators e,f in the (𝔥α2) projection.

A highest weight path is a path p contained in C=(positive halfspaces)= A path p is highest weight if and only if e1p=0 and e2p=0.

The crystal graph has edges labeled f1 and f2.

The crystal graph is irreducible if the crystal graph is connected.

(a) The irreducible 𝔰𝔩3-crystals are indexed by the points in P+= {kω1+ω2|k,0}
(b) Every 𝔰𝔩3 crystal is a disjoint union of irreducible crystals.
(c) Each irreducible crystal B has a unique highest weight path p and BB ( k ) if p ends at kω1+ω2.

A column strict tableau of shape λ= k is a filling of the boxes of λ from {1,2,3} such that

(a) the rows weakly increase (left to right)
(b) the columns strictly increase (top to bottom).
1 1 1 2 2 2 3 2 2 3 3 Let p1=,p2=,p3=. Let λ=kω1+ω2and p= p1p1p1k+ p2p2p2p2k. There is a bijection from B=(the irreducible crystal with highest weight pathp) to B(λ)= { column strict tableaux of shapeλ filled from{1,2,3} } given by reading the tableau in arabic reading order and taking the corresponding word in p1,p2,p3.

f1 f2 f2 f1 f1 f2 f2 f1 1 1 2 f1 f2 1 2 2 1 1 3 f2 f1 1 3 2 1 2 3 f1 f2 2 2 3 1 3 3 f2 f1 2 3 3

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.

page history