kirillov-reshetikhin crystals and cacti · kirillov-reshetikhin crystals and cacti introduction...

24
Kirillov-Reshetikhin Crystals and Cacti Kirillov-Reshetikhin Crystals and Cacti Bal ´ azs Elek Cornell University, Department of Mathematics 8/1/2018

Upload: buidien

Post on 15-Jun-2019

221 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Kirillov-Reshetikhin Crystals and Cacti

Balazs Elek

Cornell University,Department of Mathematics

8/1/2018

Page 2: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Introduction

Representations

Let g = sln(C) be the Lie algebra of trace 0 matrices andV = Cn. The standard basis vectors v1, . . . ,vn form a basis forV that has several favorable properties:

1 Each basis vector is an eigenvector for the action of thesubalgebra of diagonal matrices h, i.e.diag(t1, . . . tn) · vk = tkvk

2 The matrices Eij = (emn) s.t. emn =

{1 if (m,n) = (i , j)0 else

for i 6= j “almost permute” these vectors, i.e. Eij · vj = viand Eij · vk = 0 for k 6= j .

3 In fact we only need to use the matrices Fi = Ei+1 i toreach any basis vector from v1.

We say that this is a good basis.

Page 3: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Introduction

Representations

Thus we can encode the representation as a colored directedgraph, for example, sl3 acting on C3 could be represented likethis:

v1F1→ v2

F2→ v3

Our aim is to generalize this idea and we’d hope that the goodbasis is compatible with tensor product decompositions andbranching.

Page 4: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Introduction

Representations

This works splendidly only as long as each weight space isone-dimensional. We already run into trouble with the adjointrepresentation of sl3, as ker F1, ker F2, im F1, im F2 are alldifferent subspaces of h.

E13

F1

##

F2

{{E12

F1 ##

E23

F2{{h =?⊕?

F2

##

F1

{{E21

F2 ##

E32

F1{{E31

Page 5: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Introduction

Quantized enveloping algebras

1 Consider the quantized enveloping algebra

g Uq(g)

V Vq

2 For g = sln, Date, Jimbo and Miwa [2] considered V = Cn

with {v1, . . . ,vn}, and computed tensor productdecompositions of (Vq)

⊗n.3 Kashiwara later developed crystals by going to the q → 0

limit in the general case.

Page 6: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

Ordinary crystals

What is the benefit of crystals? Combinatorics. Forg = sl2-crystals, tensor product decompositions are given by:

Page 7: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

Ordinary crystals

We know that for an irreducible sln-representation Vλ of highestweight λ, dim(Vλ) = #SSYT (λ) with entries up to n. Thecrystal of Vλ has a realization as tableaux, for example, here isthe crystal of the adjoint representation of sl3

Page 8: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

Ordinary crystals

The lowering operators fi work as follows:1 Read the entries of the tableau from bottom to top, left to

right, ignoring all numbers except i and i + 1.2 Replace i + 1→ ( and i →),3 Turn the rightmost unmatched ( into an i + 1

Example: applying f2

1 2 2 42 3 44 4

→ 442341224→)())→ 2323→ 1 2 3 42 3 44 4

Page 9: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

KR-crystals

Now consider the affine Lie algebra g. This is a centralextension of the loop algebra g⊗ C[t , t−1], we may considerU(g) and Uq(g).

Conjecture 1 (Hatayama et al. [4])

Certain finite-dimensional U(g)-modules, calledKirillov-Reshetikhin modules would have crystal bases. AKR-module W (r)

s is determined by a choice of a non-affine node(r) of the Dynkin diagram and a positive integer s.

Page 10: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

sl n KR-crystals

As before, the situation is simplest for sln. It turns out that inthis case, each KR-module stays irreducible when restricted tosln, for example, for Uq(sl3), W 1

1 is the standard representation,and the KR crystal is

Page 11: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

sl n KR-crystals

Question: can we extend the tableau model to the KR setting?We want to give a combinatorial description of the f0 operator.Shimozono’s [6] method for sln: use Schutzenberger’spromotion operator on tableaux.If T is an SSYT, then pr(T ) is obtained by the followingprocedure:

1 Erase all entries n from the tableau.2 Jeu-de-taquin the other boxes to the Southeast.3 Fill the empty boxes in the Northwest with zeros.4 Add one to each entry.

Page 12: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

sl n KR-crystals

1 2 2 42 3 44 4

erase 4→1 2 22 3

jdt→ 1 2 22 3

fill & increment→1 1 1 12 3 33 4

Page 13: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

sl n KR-crystals

The promotion operator shifts the content of the tableaucyclically, and it is in fact cyclic of order n for rectangulartableaux, but not in general. Notice how pr interacts with thelowering operators for rectangular tableaux:

1 12 3

pr→1 22 3

f2→1 23 3

pr−1

→1 22 3

and1 12 3

f1→1 22 3

Page 14: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Crystals

sl n KR-crystals

So the promotion operator realizes the cyclic symmetry of theaffine type A Dynkin diagram, at least for rectangular tableaux.

Theorem 2 (Shimozono)

f0 = pr−1 ◦ f1 ◦ pr

One would think that this is a phenomenon specific to type Abecause of the cyclic symmetry, but there exist tableaux modelsfor other types, where the KR crystals were shown to exist on acase-by-case basis by finding a suitable analog of thepromotion operator [3].

Page 15: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Cacti

The cactus group

The cactus group Jg was introduced by Henriques andKamnitzer [8] in the context of coboundary categories. It has

1 Generators: sJ for J a connected subdiagram of g’s Dynkindiagram.

2 Relations:1 s2

J = 1 ∀J.2 sJsJ′ = sJ′sJ if J ∪ J ′ is not connected.3 sJsJ′ = sθJ (J′)sJ for J ′ ⊂ J.

where θJ is the Dynkin diagram automorphism −wJ0 of J.

It surjects onto Wg by sJ 7→ wJ0 .

Page 16: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Cacti

The cactus group

Halacheva [7] showed that there is an action of Jg on anyg-crystal, which we now describe.The Schutzenberger involution on a crystal Bλ of an irrep Vλ

is the unique map ξλ : Bλ → Bλ on the vertices satisfying1 ei(ξλ(b)) = ξλ(fθ(i)(b))2 fi(ξλ(b)) = ξλ(eθ(i)(b))3 wt(ξλ(b)) = w0 · (wt(b))

So, in effect, it flips the crystal upside down.

Page 17: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Cacti

The cactus group

For sln-crystals, the operation is given by evacuation ontableaux, which is the following procedure:

1 Rotate the tableau 180◦.2 Complement the entries i → n + 1− i .3 Jeu-de-taquin the tableau back to the original shape.

Page 18: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Cacti

The cactus group

Halacheva [7] showed that Jg acts o a g-crystal B by

sJ(b) = ξBJ (b)

where ξBJ is the Schutzenberger involution on the restrictedcrystal using only the lowering operators in J. For example, onthe adjoint representation of sl3,

Page 19: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Main result

Main theorem

Our main result is the following:

Theorem 3For a KR-module corresponding to a cominuscule fundamentalweight (k), let J be the subset of g’s Dynkin diagramcomplementary to {k}. Then

f−10 = e0 = sJ fksJ .

In fact, sJ corresponds to

Page 20: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Main result

An example

Page 21: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Main result

About the proof

Stembridge [9]:1 Check that sJeksJ is a lowering operator.2 See how sJeksJ interacts with the other lowering operators

(e.g. f1(sJeksJ)2f1(b) = (sJeksJ)f 2

1 (sJeksJ)(b) undercertain local conditions).

3 By the uniqueness of crystals, we are done.

Page 22: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

Main result

Remarks

1 Even though our method may be less ad hoc than trying toextend pr to other types, it only works for W (r)

s for (r)cominuscule.

2 We are only using a single element of the cactus group,what do others do?

3 When are other representations of g also representationsof some Kac-Moody algebra containing g?

4 What does this say about promotion and evacuation onYoung tableaux?

Page 23: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

References

[1] Chari, V; Pressley, A., Quantum affine algebras and theirrepresentations Representations of groups, CMS Conf. Proc. 16, Amer.Math. Soc., Providence, RI (1995) 59-78.

[2] Date, E.; Jimbo, M.; Miwa, T., R-matrix for cyclic representations ofUq(sl(3,C) at q3 = 1. Phys. Lett. A 148 (1990), no. 1-2, 4549.

[3] Fourier, Ghislain; Okado, Masato; Schilling, Anne, Kirillov-Reshetikhincrystals for nonexceptional types. Adv. Math. 222 (2009), no. 3,10801116. 17B37 (17B10 17B67)

[4] Hatayama, Goro; Kuniba, Atsuo; Okado, Masato; Takagi, Taichiro;Tsuboi, Zengo, Paths, crystals and fermionic formulae. MathPhysodyssey, 2001, 205272, Prog. Math. Phys., 23, Birkhuser Boston,Boston, MA, 2002. 17B37 (81R10 82B23)

[5] Littelmann, P., Paths and root operators in representation theory Ann.of Math. (2) 142 (1995), no. 3, 499-525

[6] Shimozono, Mark Affine type A crystal structure on tensor products ofrectangles, Demazure characters, and nilpotent varieties. J. AlgebraicCombin. 15 (2002), no. 2, 151187. 17B10 (05E10)

Page 24: Kirillov-Reshetikhin Crystals and Cacti · Kirillov-Reshetikhin Crystals and Cacti Introduction Representations Thus we can encode the representation as a colored directed graph,

Kirillov-Reshetikhin Crystals and Cacti

References

[7] Halacheva, Iva Alexander Type Invariants of Tangles, Skew HoweDuality for Crystals and The Cactus Group. Thesis (Ph.D.)University ofToronto (Canada). 2016. 88 pp. ISBN: 978-1369-67293-0

[8] Henriques, Andre; Kamnitzer, Joel Crystals and coboundarycategories. Duke Math. J. 132 (2006), no. 2, 191216. 17B37 (17B1018D10 18D50)

[9] Stembridge, John R. A local characterization of simply-laced crystals.Trans. Amer. Math. Soc. 355 (2003), no. 12, 48074823. 17B37 (05E15)