• Keine Ergebnisse gefunden

Web bases and categorification

N/A
N/A
Protected

Academic year: 2022

Aktie "Web bases and categorification"

Copied!
40
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Web bases and categorification

Daniel Tubbenhauer

Joint work with Marco Mackaay and Weiwei Pan

October 2013

(2)

1 Categorification

What is categorification?

2 Webs and representations ofUq(sl3) sl3-webs

Connection to representation theory Webs andq-skew Howe duality

3 The Categorification An algebra of foams A graded cellular basis Harvest time

Daniel Tubbenhauer October 2013 2 / 39

(3)

What is categorification?

Forced to reduce this presentation to one sentence, the author would choose:

Interesting integers are shadows of richer structures in categories.

The basic idea can be seen as follows. Take a“set-based”structureS and try to find a“category-based”structureC such thatS is just a shadow ofC.

Categorification, which can be seen as“remembering” or “inventing”information, comes with an “inverse” process calleddecategorification, which is more like

“forgetting” or “identifying”.

Note that decategorification should beeasy.

(4)

Exempli gratia

Examples of the pair categorification/decategorification are:

Bettinumbers of a manifoldM categorify //

decat=rank(·)

oo Homology groups

Polynomials inZ[q,q−1] categorify //

decat=χgr(·)

oo complexes of gr.VS

The integersZ

categorify

//

decat=K0(·)

oo K−vector spaces

AnA−module categorify //

decat=K0(·)⊗ZA

oo additive category

Usually thecategorified worldis much moreinteresting.

Today categorification = Grothendieck group!

Daniel Tubbenhauer What is categorification? October 2013 4 / 39

(5)

Kuperberg’s sl

3

-webs

Definition(Kuperberg)

Asl3-webw is anoriented trivalent graph, such that all vertices are either sinks or sources. The boundary∂w ofw is asign stringS = (s1, . . . ,sn)under the conventionsi= + iff the orientation is pointing in andsi =−iff the orientation is pointing out.

Example

+ − + − + + +

(6)

Kuperberg’s sl

3

-webs

Definition(Kuperberg)

TheC(q)-web spaceWS for a given sign stringS = (±, . . . ,±) is generated by {w |∂w =S}, wherew is a web, subject to the relations

= [3]

= [2]

= +

Here [a] = qq−qa−q−1−a =qa−1+qa−3+· · ·+q−(a−1) is thequantum integer.

Daniel Tubbenhauer sl3-webs October 2013 6 / 39

(7)

Kuperberg’s sl

3

-webs

Example

0 0 0 0 0 +1 −1

Webs can becolouredwith flow lines. At the boundary, the flow lines can be represented by astate stringJ. By convention, at thei-th boundary edge, we set ji =±1 if the flow line is oriented downward/upward andji = 0, if there is no flow line. SoJ = (0,0,0,0,0,+1,−1) in the example.

Given a web with a flowwf, attribute aweightto each trivalent vertex and each

(8)

The quantum algebra U

q

(sl

n

)

Definition

Forn∈N>1thequantum special linear algebraUq(sln) is the associative, unital C(q)-algebra generated byKi±1andEi andFi, fori= 1, . . . ,n−1, subject to the relations

KiKj =KjKi, KiKi−1=Ki−1Ki = 1, EiFj−FjEii,j

Ki−Ki−1 q−q−1 , KiEj =qij)EjKi, KiFj =q−(ǫij)FjKi,

Ei2Ej−(q+q−1)EiEjEi+EjEi2= 0, if |i−j|= 1, Fi2Fj−(q+q−1)FiFjFi+FjFi2= 0, if |i−j|= 1.

Daniel Tubbenhauer Connection to representation theory October 2013 8 / 39

(9)

Representation theory of U

q

(sl

3

)

A sign stringS = (s1, . . . ,sn) corresponds to tensors VS =Vs1⊗ · · · ⊗Vsn,

whereV+ is the fundamentalUq(sl3)-representation andV is its dual, and webs correspond tointertwiners.

Theorem(Kuperberg)

WS ∼=HomUq(sl3)(C(q),VS)∼=InvUq(sl3)(VS)

In fact, the so-called spider category of all webs modulo the Kuperberg relations is equivalentto the representation category ofUq(sl3).

As a matter of fact, thesl3-webs without internal circles, digons and squares form abasisBS, calledweb-basis, ofWS!

(10)

Representation theory of U

q

(sl

3

)

Theorem(Khovanov, Kuperberg)

Pairs of signS and a state stringsJ correspond to the coefficients of the web basis relative totensors of the standard basis{e−1± ,e0±,e+1±} ofV±.

Example

wt=−2

0 0 0 0 0 +1 −1

+ − + − + + +

wt=−4

0 0 0 0 0 +1 −1

+ − + − + + +

wS =· · ·+ (q−2+q−4)(e0+⊗e0⊗e0+⊗e0⊗e0+⊗e−1+ ⊗e+1+)± · · ·.

Daniel Tubbenhauer Connection to representation theory October 2013 10 / 39

(11)

Skew Howe-duality

The natural actions ofGLk andGLnon

^p

(Ck ⊗Cn) areHowe dual(skew Howe duality).

Thisimpliesthat

InvSLkp1(Ck)⊗ · · · ⊗Λpn(Ck))∼=W(p1, . . . ,pn),

whereW(p1, . . . ,pn) denotes the (p1, . . . ,pn)-weight space of the irreducible GLn-moduleW(k), ifn=kℓ.

(12)

The idempotent version

For eachλ∈Zn−1 adjoin anidempotent1λ (think: projection to theλ-weight space!) toUq(sln) and add the relations

1λ1µλ,ν1λ, Ei1λ= 1λ+αiEi, Fi1λ= 1λ−αiFi,

K±i1λ=q±λi1λ (noKs anymore!).

Definition

Theidempotented quantum special linear algebrais defined by U(sl˙ n) = M

λ,µ∈Zn

1λUq(sln)1µ.

Daniel Tubbenhauer Webs andq-skew Howe duality October 2013 12 / 39

(13)

En(c)hanced sign strings

Definition

Anenhanced sign sequenceis a sequenceS = (s1, . . . ,sn) withsi∈ {◦,−,+,×}, for alli= 1, . . . ,n. The correspondingweightµ=µS ∈Λ(n,d) is given by the rules

µi =









0, ifsi =◦, 1, ifsi = +, 2, ifsi =−, 3, ifsi =×.

Let Λ(n,d)3⊂Λ(n,d) be the subset of weights with entries between 0 and 3.

Note that 1 corresponds to the ˙U(sl3)-representationV+, 2 to its dualV and 0,3 to the trivial ˙U(sl3)-representation.

(14)

The sl

3

-webs form a ˙ U(sl

n

)-module

Wedefinedan actionφof ˙U(sln) onW(3)=L

S∈Λ(n,n)3WS by

1λ7→

λ1 λ2 λn

Ei1λ, Fi1λ7→

λ1 λi−1 λi λi+1

λi±1 λi+1∓1

λi+2 λn

We use the convention that vertical edges labeled 1 are oriented upwards, vertical edges labeled 2 are oriented downwards and edges labeled 0 or 3 are erased. The hard part was to show that this iswell-defined.

Daniel Tubbenhauer Webs andq-skew Howe duality October 2013 14 / 39

(15)

Exempli gratia

E11(22)7→

2 2

3 1

F2E11(121)7→

1 2 1

2 0 2

(16)

Very nice bases of W

(3)

The ˙U(sln)-moduleW(3) has different bases. But there are two particularnice ones, called Lusztig-Kashiwara’slower and upper global crystal basisBT ={bT} andBT ={bT}(sometimes also calledcanonical and dual canonicalbasis), indexed by standard tableauxT ∈Std((3)). One of its nice properties is for example

bT =xT+X

τ≺T

δτT(q)

| {z }

Z[q]

xτ

Thisgives, underq-skew Howe duality, a upper and lower global crystal basis of the invariantUq(sl3)-tensors.

In contrast to the tensor basisxT, which iseasyto write down, butlacksa good behavior, the lower and upper global crystal bases arehardto write down, but havea good behavior.

Daniel Tubbenhauer Webs andq-skew Howe duality October 2013 16 / 39

(17)

An intermediate crystal basis

Leclerc and Toffin gave anintermediatecrystal basis of ˙U(sln)-modules, denoted byLTT ={AT}, by the rule

AT =Fi(rss)· · ·Fi(r11)vΛ, withF(k) = Fk [k]!,

where the string ofFs is obtained by an explicit, combinatorial algorithm from the tableauT. They showed that the crystal basesbT and the tensor basisxT are related by aunitriangularmatrix

AT =xT+X

τ≺T

ατT(q)xτ andbT =AT+X

S≺T

βST(q)AS,

with certain coefficientsατT(q)∈N[q,q−1] andβST(q)∈Z[q,q−1].

(18)

An intermediate crystal basis

Proposition(Mackaay, T)

The Kuperberg web basisBS is Leclerc-Toffin’s intermediate crystal basis under q-skew Howe duality, i.e.

LTT ={Fi(rss)· · ·Fi(r11)v3 |T ∈Std((3))}7−→sHDLTS. (NoK’s andE’s anymore!)

Thus, theBS is agoodcandidate for categorification (can be written down explicitlyandhas (some) good properties!).

Daniel Tubbenhauer Webs andq-skew Howe duality October 2013 18 / 39

(19)

Exempli gratia

Example

w = ! T =

1 2 4 2 3 5 4 6 6

FormT we obtain the string

LT(w) =F1F2F3(2)F2F1F4F3F2F5(2)F4(2)F3(2).

(20)

Exempli gratia

LT(w)v(33) =F1F2F3(2)F2F1F4F3F2F5(2)F4(2)F3(2)v(33)

F1

1 2 1 2 1 2

F2

2 1 1 2 1 2

F3(2)

2 2 0 2 1 2

F2

2 2 2 0 1 2

F1

2 3 1 0 1 2

F4

3 2 1 0 1 2

F3(2)

3 3 1 2 0 0

F4(2)

3 3 1 0 2 0

F5(2)

3 3 1 0 0 2

F2

3 2 2 0 0 2

F3

3 2 1 1 0 2

3 3 3 0 0 0

Daniel Tubbenhauer Webs andq-skew Howe duality October 2013 20 / 39

(21)

Please, fasten your seat belts!

Let’scategorifyeverything!

(22)

sl

3

-foams

Apre-foamis a cobordism with singular arcs between two webs. Composition consists of placing one pre-foam ontopof the other. The following are called the zipand theunziprespectively.

They havedotsthat can movefreelyabout the facet on which they belong, but we donotallow dot to cross singular arcs.

Afoamis a formalC-linear combination of isotopy classes of pre-foams modulo the following relations.

Daniel Tubbenhauer An algebra of foams October 2013 22 / 39

(23)

The foam relations ℓ = (3 D , NC , S , Θ)

= 0 (3D)

=− − − (NC)

= = 0, =−1 (S)

α β

δ =





1, (α, β, δ) = (1,2,0) or a cyclic permutation,

−1, (α, β, δ) = (2,1,0) or a cyclic permutation, 0, else.

(Θ)

(24)

Involution on webs and closed webs

Definition

There is aninvolution on the webs.

Aclosed webis defined by closing of two webs.

Aclosed foamis a foam from∅ to a closed web.

Daniel Tubbenhauer An algebra of foams October 2013 24 / 39

(25)

The sl

3

-foam category

Foam3is thecategory of foams, i.e.objectsare websw andmorphismsare foams F between webs. The category isgradedby theq−degree

qdeg(F) =χ(∂F)−2χ(F) + 2d+b,

whered is the number of dots andb is the number of vertical boundary components. Thefoam homologyof a closed webw is defined by

F(w) =Foam3(∅,w).

F(w) is a graded, complex vector space, whoseq-dimension can be computed by theKuperberg bracket(that is counting all flows onw and their weights).

(26)

The sl

3

-web algebra

Definition(MPT)

LetS = (s1, . . . ,sn). Thesl3-web algebraKS is defined by KS = M

u,v∈BS

uKv,

with

uKv =F(uv){n}, i.e. all foams : ∅ →uv.

Multiplication is defined as follows.

uKv1v2KwuKw

is zero, ifv16=v2. Ifv1=v2, use themultiplication foammv, e.g.

Daniel Tubbenhauer An algebra of foams October 2013 26 / 39

(27)

The sl

3

-web algebra

Theorem(s)(MPT)

The multiplication iswell-defined, associative and unital. The multiplication foam mv hasq-degreen. Hence,KS is a finite dimensional, unital and graded algebra.

Moreover, it is agraded Frobenius algebra.

(28)

Higher representation theory

Moreover, forn=d= 3k we define

W(3k) = M

µs∈Λ(n,n)3

WS

on thelevelof webs and on the levelof foams we define W(3(p)k)= M

µs∈Λ(n,n)3

KS−(p)Modgr.

With this constructions we obtain our firstcategorificationresult.

Theorem(MPT)

K0(W(3k))⊗Z[q,q−1]Q(q)∼=W(3k) andK0(W(3pk))⊗Z[q,q−1]Q(q)∼=W(3k).

Daniel Tubbenhauer An algebra of foams October 2013 28 / 39

(29)

Cellular algebras have a “simple” representation theory

Definition(Graham-Lehrer, Hu-Mathas)

Agraded cellular basiscstλ of a graded algebraAis a basis withnicestructure coefficients (and otherniceproperties that we do not need today), i.e.

acstλ = X

u∈T(λ)

ra(s,u)cutλ (modAλ),

where theλ’s are from a poset (P,⊲) andT(λ) is finite for allλ∈P.

Theorem(Graham-Lehrer, Hu-Mathas)

Forλ∈P one canexplicitly(using the structure coefficients) define the graded cell moduleCλ. SetDλ=Cλ/rad(Cλ) and P0={λ∈P|Dλ6= 0}. Then the set{Dλ{k} |λ∈P0, k ∈Z}is acompleteset of pairwisenon-isomorphic

(30)

The approach

Recall that the intermediate crystal basis satisfies AT =xT+X

τ≺T

ατT(q)xτ andbT=AT+X

S≺T

βST(q)AS.

Idea: Ifq-skew Howe duality can be used to obtain from the ˙U(sln)-moduleW(3) the intermediate crystal basis on the level of webs, then categorifiedq-skew Howe duality can be used to obtain a cellular basis from acategorifiedintermediate crystal basis on thelevel of foams!

Daniel Tubbenhauer A graded cellular basis October 2013 30 / 39

(31)

Connection to U

q

(sl

n

)

Khovanov and Lauda’s diagrammatic categorification of ˙Uq(sln), denoted U(sln), is alsorelatedto our framework! Roughly, it consist of string diagrams of the form

i j

λ:EiEj1λ⇒ EjEi1λ{(αi, αj)},

i

λ−αi λ:Fi1λ⇒ Fi1λii}

with a weightλ∈Zn−1and suitable shifts and relations like

i j

λ =

i j

λ and

i j

λ =

i j

λ, ifi6=j.

(32)

sl

3

-foamation

We define a 2-functor

Ψ :U(sln)→ W(3(p)k)

calledfoamation, in the following way.

On objects:The functor is defined by sending anslk-weightλ= (λ1, . . . , λk−1) to an object Ψ(λ) ofW(3(p)k) by

Ψ(λ) =S, S = (a1, . . . ,ak),ai ∈ {0,1,2,3}, λi =ai+1−ai, Xk

i=1

ai= 3k.

On morphisms:The functor on morphisms is by glueing the ladder webs from before on top of thesl3-webs inW(3k).

Daniel Tubbenhauer A graded cellular basis October 2013 32 / 39

(33)

sl

3

-foamation

On 2-cells:We define

i,λ

7→

λi

λi+1

i,λ

7→

λi

λi+1

i,i,λ

7→ −

λi

λi+1

i,i+1,λ

7→ (−1)λi+1

λi

λi+1

λi+2

i+1,i,λ

7→

λi

λi+1

λi+2

(34)

The idea!

Letλ∈Λ(n,n)+ be a dominant weight. Define thecyclotomic KL-R algebraRλ

to be the subquotient ofU(sln) defined by the subalgebra ofonly downward (only F’s!)pointing arrows modulo the so-calledcyclotomic relationsand set

Vλ=Rλ−(p)Modgr. The cyclotomic KL-R algebraRλ is isomorphic to a certain cyclotomic Hecke algebraHλ of typeA.

Theorem(s)(MPT)

There exists an equivalence of categoricalU(sln)-representations Φ :V(3(p)k) → W(3(p)k).

Idea(T)

Thecombinatoricscan beeasierworked out in the cyclotomic Hecke algebraHλ, while thetopologyis easierin our framework. Use foamation to pull Hu-Mathas graded cellular basis fromHλ toKS.

Daniel Tubbenhauer A graded cellular basis October 2013 34 / 39

(35)

A growth algorithm for foams

Definition(T)

Given a pair of a sign string and a state string (S,J), the corresponding

3-multipartition~λand two Kuperberg websu,v ∈BS that extendJ tofu andfv

receptively. We define afoamby FT(u~~λ

fu),~T(vfv)= Fσu

|{z}

Topology

e(~λ)

|{z}

Idempotent

d(~λ)

| {z }

Dots

Fσv

|{z}

Topology

.

Theorem(T)

The growth algorithm for foams iswell-defined, theonlyinput data are webs and flows on webs, worksinductivelyand gives agraded cellular basis ofKS.

(36)

Exempli gratia

Every web has a graded cellular basisparametrisedby flow lines.

wt=3

wt=1

wt=1

wt=−1

wt=−1

wt=−3

q−deg=0

q−deg=2

q−deg=2

q−deg=4

q−deg=4

q−deg=6

That these foams arereallya graded cellular basis follows from our theorem. Note that the Kuperberg bracket gives [2][3] =q−3+ 2q−1+ 2q+q3.

Daniel Tubbenhauer A graded cellular basis October 2013 36 / 39

(37)

Categorification and crystal bases

Recall our first categorification result, i.e.

K0(W(3k))⊗Z[q,q−1]C(q)∼=W(3k) andK0(W(3pk))⊗Z[q,q−1]C(q)∼=W(3k). A natural question is how do the two nice bases, i.e. the lower{bT} and the upper{bT}global crystal basis, ofW(3k) show upinK0(W(3k))⊗Z[q,q−1]Q(q) or K0(W(3pk))⊗Z[q,q−1]Q(q)?

Recall that a graded cellular basis{cstλ} gives riseto a set of graded cell modules {Cλ}, their simple heads{Dλ=Cλ/rad(Cλ)}and the corresponding projective covers{Cpλ} and{Dpλ}.

(38)

Categorification and crystal bases

Theorem(T)

We haveψ([DT]) =bT andψp([DpT]) =bT under the two isometries

ψ:K0(W(3k))⊗Z[q,q−1]Q(q)→W(3k) andψp:K0(W(3pk))⊗Z[q,q−1]Q(q)→W(3k), that is the simple headsDT of the cell modules CT (who give a complete list of all simpleKS-modules)categorifythe lower global crystal basisbT and their projective coversDpT (who give a complete list of all projective, irreducible KS-modules)categorifythe upper global crystal basisbT.

Daniel Tubbenhauer Harvest time October 2013 38 / 39

(39)

There is stillmuchto do...

(40)

Thanks for your attention!

Daniel Tubbenhauer Harvest time October 2013 39 / 39

Referenzen

ÄHNLICHE DOKUMENTE

utility of wealth under the optimal self-nancing hedging strategy... However, the given example (Example 5.1' in KS99),

This is another main motivation of the author: study the symmetries of categorified quantum groups and related categorifications and apply it to the study of Hecke algebras,

Apex hunting can be done using linear algebra(cellular pairing) Over an algebraically closed field any finite dimensional algebra is sandwich cellular. The point is to find a

For the bottom square, since all arrows are E-module homomorphisms, it suffices to prove the com- mutativity for the generator [1].. Our next job is to construct such an

I q-monoidal categories are probably very useful to study representation categories of coideal subalgebras.. An abstract formulation `a la Brundan–Ellis (“super monoidal”) should

I (2)-q-monoidal categories are potentially useful to study representation categories of coideal subalgebras, and appear in other contexts e.g.. Maybe its a feature rather than

Daniel Tubbenhauer Growing of flows on webs October 2013 20 / 43... Moreover, one can obtain all flows on all webs in this way and deg BKW ( T ~ ) =

Categorification can be easily explained by two basic examples - the categorification of the natural numbers through the category of finite sets FinSet and the categorification of