• Keine Ergebnisse gefunden

Webs and q-Howe dualities in types BCD

N/A
N/A
Protected

Academic year: 2022

Aktie "Webs and q-Howe dualities in types BCD"

Copied!
67
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Webs and q -Howe dualities in types BCD

Or: A story about “howe” I failed Daniel Tubbenhauer

5 8

3 4

3 9

3 6

3 1

1 1 1 1

7 -web

A-web new part

1 1

2 3 2

2 2

7 9

2 2

6 5

6 4

1 2

-web

A-web new part

Joint work with Antonio Sartori

(2)

1 The typeAstory

Classical Schur-Weyl duality Howe’s dualities in typeA

2 The typeBCD story

Classical Schur-Weyl-Brauer duality Howe’s dualities in typesBCD

3 The quantum story Various quantizations Concluding remarks

(3)

A pioneer of representation theory

Schur’s remarkable relationship between glnand the symmetric groupSk:

Schur∼1901. LetV=Vgl =Cn. There are commuting actions U(gln)

V⊗ · · · ⊗V

| {z }

ktimes

C[Sk]

generating each other’s centralizer. TheU(gln)-C[Sk]-bimodule decomposes as M

λ∈P

L(gln, λ)⊗L(Sk, λT).

Theλ’s are partitions (Young diagrams) of k with at mostnrows.

First statement

Second statement Third statement

The precise form does not matter for today. It is only important that one can make it explicit.

(4)

A pioneer of representation theory

Schur’s remarkable relationship between glnand the symmetric groupSk:

Schur∼1901. LetV=Vgl =Cn. There are commuting actions U(gln)

V⊗ · · · ⊗V

| {z }

ktimes

C[Sk]

generating each other’s centralizer. TheU(gln)-C[Sk]-bimodule decomposes as M

λ∈P

L(gln, λ)⊗L(Sk, λT).

Theλ’s are partitions (Young diagrams) of k with at mostnrows.

First statement

Second statement Third statement

The precise form does not matter for today. It is only important that one can make it explicit.

(5)

A pioneer of representation theory

Schur’s remarkable relationship between glnand the symmetric groupSk:

Schur∼1901. LetV=Vgl =Cn. There are commuting actions U(gln)

V⊗ · · · ⊗V

| {z }

ktimes

C[Sk]

generating each other’s centralizer. TheU(gln)-C[Sk]-bimodule decomposes as M

λ∈P

L(gln, λ)⊗L(Sk, λT).

Theλ’s are partitions (Young diagrams) of k with at mostnrows.

First statement

Second statement

Third statement

The precise form does not matter for today. It is only important that one can make it explicit.

(6)

A pioneer of representation theory

Schur’s remarkable relationship between glnand the symmetric groupSk:

Schur∼1901. LetV=Vgl =Cn. There are commuting actions U(gln)

V⊗ · · · ⊗V

| {z }

ktimes

C[Sk]

generating each other’s centralizer. TheU(gln)-C[Sk]-bimodule decomposes as M

λ∈P

L(gln, λ)⊗L(Sk, λT).

Theλ’s are partitions (Young diagrams) of k with at mostnrows.

First statement

Second statement Third statement

The precise form does not matter for today. It is only important that one can make it explicit.

(7)

A pioneer of representation theory

Schur’s remarkable relationship between glnand the symmetric groupSk:

Schur∼1901. LetV=Vgl =Cn. There are commuting actions U(gln)

V⊗ · · · ⊗V

| {z }

ktimes

C[Sk]

generating each other’s centralizer. TheU(gln)-C[Sk]-bimodule decomposes as M

λ∈P

L(gln, λ)⊗L(Sk, λT).

Theλ’s are partitions (Young diagrams) of k with at mostnrows.

First statement

Second statement Third statement

The precise form does not matter for today. It is only important that one can make it explicit.

(8)

The diagrammatic presentation machine

U(gln)

V⊗ · · · ⊗V

| {z }

ktimes

C[Sk]

fix use

Schur’sfirst statementgives a functor

S Φ Rep(gln)

Categorical version of the symmetric group

(9)

The diagrammatic presentation machine

U(gln)

V⊗ · · · ⊗V

| {z }

ktimes

C[Sk]

fix use

Schur’ssecond statementgives a full functor

S Φ Rep(gln) full

Categorical version of the symmetric group

(10)

The diagrammatic presentation machine

U(gln)

V⊗ · · · ⊗V

| {z }

ktimes

C[Sk]

fix use

Schur’sthird statement gives a full functor

S Rep(gln)

S/“ ker(Φ)” Rep(gln) Φ

full

Φ fully faithful

whose “kernel ker(Φ)” can be calculated.

Hence, up to taking duals and Karoubi closures,Schur gave us a diagrammatic

presentation of the representation categoryRep(gln) ofgln.

Categorical version of the symmetric group

(11)

“Thick” Schur-Weyl duality

One of Howe’s remarkable relationships betweenglnandglk: Howe∼1975. LetV=Cn. There are commuting actions

U(gln) VV⊗ · · · ⊗VV

| {z }

ktimes

U(glk)

generating each other’s centralizer, andVa1V⊗ · · · ⊗VakV is the (a1, . . . ,ak)th weight space as regardsU(glk). TheU(gln)-U(glk)-bimodule decomposes as

M

λP

L(gln, λ)⊗L(glk, λT).

Theλ’s are partitions with at mostk columns and nrows.

11/2th statement

(12)

“Thick” Schur-Weyl duality

One of Howe’s remarkable relationships betweenglnandglk: Howe∼1975. LetV=Cn. There are commuting actions

U(gln) VV⊗ · · · ⊗VV

| {z }

ktimes

U(glk)

generating each other’s centralizer, andVa1V⊗ · · · ⊗VakV is the (a1, . . . ,ak)th weight space as regardsU(glk). TheU(gln)-U(glk)-bimodule decomposes as

M

λP

L(gln, λ)⊗L(glk, λT).

Theλ’s are partitions with at mostk columns and nrows.

11/2th statement

(13)

Again: The diagrammatic presentation machine

U(gln) VV⊗ · · · ⊗VV

| {z }

ktimes

U(glk)

fix use

Howe’sfirst statementgives a functor

U(gl˙ k) ΦextA Rep(gln)

Dot version generated by weight space idempotents 1λ,

and Eiand Fi

(14)

Again: The diagrammatic presentation machine

U(gln) VV⊗ · · · ⊗VV

| {z }

ktimes

U(glk)

fix use

Howe’ssecond statementgives a full functor

U(gl˙ k) ΦextA Rep(gln) full

Dot version generated by weight space idempotents 1λ,

and Eiand Fi

(15)

Again: The diagrammatic presentation machine

U(gln) VV⊗ · · · ⊗VV

| {z }

ktimes

U(glk)

fix use

Howe’sthird statementgives a full functor

U(gl˙ k) Rep(gln)

U(gl˙ k)/“ ker(ΦextA )” Rep(gln) ΦextA

full

ΦextA fully faithful whose “kernel ker(ΦextA )” we can calculate.

Dot version generated by weight space idempotents 1λ,

and Eiand Fi

(16)

Again: The diagrammatic presentation machine

U(gln) VV⊗ · · · ⊗VV

| {z }

ktimes

U(glk)

fix use

Howe’s11/2th statement defines a diagrammatic categoryWeb such that

U(gl˙ k) Rep(gln)

S Web

ΦextA full

ΓextA full βA

fully faithful

commutes. In particular,Web is a thick version of the symmetric group.

Dot version generated by weight space idempotents 1λ,

and Eiand Fi

(17)

The presentation functor

Observe that there are (up to scalars) uniqueU(gln)-intertwiners

a+b

a,b :VaV⊗VbVVa+bV, a,ba+b: Va+bV,→VaV⊗VbV given by projection and inclusion.

The presentation functor is

ΓextA :Web →Rep(gln), a7→Va

V,

a a+b

b

7→ a+ba,b ,

a

a+b b

7→ a,ba+b

The (co)associativity relations say thatVV is a (co)algebra with (co)multiplication a+ba,b ( a,ba+b).

We can play the game the other way around as well by defining Howe’s action via:

a a+1

b b−1

E =

a a+1

1 b−1

b−1

a

a 1 b−1

VaV⊗VbV→VaV⊗V⊗Vb−1V→Va+1b V⊗Vb−1V etc.

(18)

The presentation functor

Observe that there are (up to scalars) uniqueU(gln)-intertwiners

a+b

a,b :VaV⊗VbVVa+bV, a,ba+b: Va+bV,→VaV⊗VbV given by projection and inclusion.

The presentation functor is

ΓextA :Web →Rep(gln), a7→Va

V,

a a+b

b

7→ a+ba,b ,

a

a+b b

7→ a,ba+b

The (co)associativity relations say thatVV is a (co)algebra with (co)multiplication a+ba,b ( a,ba+b).

We can play the game the other way around as well by defining Howe’s action via:

a a+1

b b−1

E =

a a+1

1 b−1

b−1

a

a 1 b−1

VaV⊗VbV→VaV⊗V⊗Vb−1V→Va+1b V⊗Vb−1V etc.

(19)

The presentation functor

Observe that there are (up to scalars) uniqueU(gln)-intertwiners

a+b

a,b :VaV⊗VbVVa+bV, a,ba+b: Va+bV,→VaV⊗VbV given by projection and inclusion.

The presentation functor is

ΓextA :Web →Rep(gln), a7→Va

V,

a a+b

b

7→ a+ba,b ,

a

a+b b

7→ a,ba+b

The (co)associativity relations say thatVV is a (co)algebra with (co)multiplication a+ba,b ( a,ba+b).

We can play the game the other way around as well by defining Howe’s action via:

a a+1

b b−1

E =

a a+1

1 b−1

b−1

a

a 1 b−1

VaV⊗VbV→VaV⊗V⊗Vb−1V→Va+1b V⊗Vb−1V etc.

(20)

Another pioneer of representation theory

Brauer’s remarkable relationship betweengn=son,spnand the Brauer algebraBrkn:

Brauer∼1937. LetV=Cn. There are commuting actions U(gn)

V⊗ · · · ⊗V

| {z }

ktimes

Brkn

generating each other’s centralizer. TheU(gn)-Brkn-bimodule decomposes as M

λ∈P

L(gn, λ)⊗L(Brkn, λT).

Theλ’s are partitions ofk,k−2,k−4, . . . whose precise form depend ongn.

Be careful: One needs to work withonin typeD. Today, I silently stay withson, and thus, in typeB.

(21)

Another pioneer of representation theory

Brauer’s remarkable relationship betweengn=son,spnand the Brauer algebraBrkn:

Brauer∼1937. LetV=Cn. There are commuting actions U(gn)

V⊗ · · · ⊗V

| {z }

ktimes

Brkn

generating each other’s centralizer. TheU(gn)-Brkn-bimodule decomposes as M

λ∈P

L(gn, λ)⊗L(Brkn, λT).

Theλ’s are partitions ofk,k−2,k−4, . . . whose precise form depend ongn.

Be careful: One needs to work withonin typeD.

Today, I silently stay withson, and thus, in typeB.

(22)

The diagrammatic presentation machine – it still works fine

U(gn)

V⊗ · · · ⊗V

| {z }

ktimes

Brkn

fix use

As usual, Brauer’s insights give a full functor

Brn Rep(gn)

Brn/“ ker(Φ)” Rep(gn)

Φ full

Φ fully faithful

whose “kernel ker(Φ)” can be calculated.

Hence, up to Spin’s and Karoubi closures,Brauer gave us a diagrammatic

Categorical version of the Brauer algebra

(23)

“Thick” Schur-Weyl-Brauer duality

Another one of Howe’s remarkable relationships:

Howe∼1975. LetV=Cn. There are commuting actions U(son) VV⊗ · · · ⊗VV

| {z }

ktimes

U(so2k)

generating each other’s centralizer, andVa1V⊗ · · · ⊗VakV is the (a1, . . . ,ak)th weight space ofU(so2k). TheU(son)-U(so2k)-bimodule decomposes as

M

λ∈P

L(son, λ)⊗L(so2k,Pk

j=1Tjn/2j).

Theλ’s again satisfy certain explicit conditions andai =ai+n/2.

Note that the action ofU(so2k) is not as clear as it was forU(glk)!

(24)

“Thick” Schur-Weyl-Brauer duality

Another one of Howe’s remarkable relationships:

Howe∼1975. LetV=Cn. There are commuting actions U(son) VV⊗ · · · ⊗VV

| {z }

ktimes

U(so2k)

generating each other’s centralizer, andVa1V⊗ · · · ⊗VakV is the (a1, . . . ,ak)th weight space ofU(so2k). TheU(son)-U(so2k)-bimodule decomposes as

M

λ∈P

L(son, λ)⊗L(so2k,Pk

j=1Tjn/2j).

Theλ’s again satisfy certain explicit conditions andai =ai+n/2.

Note that the action ofU(so2k) is not as clear as it was forU(glk)!

(25)

Still alive: The diagrammatic presentation machine

U(gln) VV⊗ · · · ⊗VV U(glk) U(son) VV⊗ · · · ⊗VV

| {z }

ktimes

U(so2k)

⊂ ⊃=

fix use

Howe’s11/2th statement defines a diagrammatic categoryWeb such that

U(so˙ 2k) Rep(son)

Brn Web ΦextBD

full

ΓextBD full fully faithful

β

commutes. In particular,Web is a thick version of the Brauer algebra.

Restricting the action on one side

Increases the centralizer on the other Hence, we get

“old diagram generators” and

“new diagram generators”

(26)

Still alive: The diagrammatic presentation machine

U(gln) VV⊗ · · · ⊗VV U(glk) U(son) VV⊗ · · · ⊗VV

| {z }

ktimes

U(so2k)

⊂ ⊃=

fix use

Howe’s11/2th statement defines a diagrammatic categoryWeb such that

U(so˙ 2k) Rep(son)

Brn Web ΦextBD

full

ΓextBD full fully faithful

β

commutes. In particular,Web is a thick version of the Brauer algebra.

Restricting the action on one side

Increases the centralizer on the other Hence, we get

“old diagram generators” and

“new diagram generators”

(27)

Still alive: The diagrammatic presentation machine

U(gln) VV⊗ · · · ⊗VV U(glk) U(son) VV⊗ · · · ⊗VV

| {z }

ktimes

U(so2k)

⊂ ⊃=

fix use

Howe’s11/2th statement defines a diagrammatic categoryWeb such that

U(so˙ 2k) Rep(son)

Brn Web ΦextBD

full

ΓextBD full fully faithful

β

commutes. In particular,Web is a thick version of the Brauer algebra.

Restricting the action on one side

Increases the centralizer on the other

Hence, we get

“old diagram generators” and

“new diagram generators”

(28)

Still alive: The diagrammatic presentation machine

U(gln) VV⊗ · · · ⊗VV U(glk) U(son) VV⊗ · · · ⊗VV

| {z }

ktimes

U(so2k)

⊂ ⊃=

fix use

Howe’s11/2th statement defines a diagrammatic categoryWeb such that

U(so˙ 2k) Rep(son)

Brn Web ΦextBD

full

ΓextBD full fully faithful

β

commutes. In particular,Web is a thick version of the Brauer algebra.

Restricting the action on one side

Increases the centralizer on the other Hence, we get

“old diagram generators”

and

“new diagram generators”

(29)

Some delicate quantizations

U(gln) V

V ⊗ · · · ⊗V

V U(glk) U(son) VV ⊗ · · · ⊗VV

| {z }

ktimes

U(so2k)

⊂ ⊃=

Quantum skew Howe duality: Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n]. The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB2web relations∼1995. We wanted to

generalize Kuperberg’s results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do. Using a coideal

subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(30)

Some delicate quantizations

U(gln) V

qVq⊗ · · · ⊗V

qVq U(glk) U(son) V

qVq⊗ · · · ⊗V qVq

| {z }

ktimes

U(so2k)

⊂ ⊃=

Quantum skew Howe duality: Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n]. The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB2web relations∼1995. We wanted to

generalize Kuperberg’s results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do. Using a coideal

subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(31)

Some delicate quantizations

Uq(gln) V

qVq⊗ · · · ⊗V

qVq Uq(glk) U(son) V

qVq⊗ · · · ⊗V qVq

| {z }

ktimes

U(so2k)

=

Quantum skew Howe duality:

Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n]. The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB2web relations∼1995. We wanted to

generalize Kuperberg’s results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do. Using a coideal

subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(32)

Some delicate quantizations

Uq(gln) V

qVq⊗ · · · ⊗V

qVq Uq(glk) Uq(son) V

qVq⊗ · · · ⊗V qVq

| {z }

ktimes

Uq(so2k)

6⊂ ⊃=

Quantum skew Howe duality: Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n]. The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB2web relations∼1995. We wanted to

generalize Kuperberg’s results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do. Using a coideal

subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(33)

Some delicate quantizations

Uq(gln) V

qVq⊗ · · · ⊗V

qVq Uq(glk) Uq(son) V

qVq⊗ · · · ⊗V qVq

| {z }

ktimes

Uq(so2k)

6 ???

6⊂ ⊃=

Quantum skew Howe duality: Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n]. The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB2web relations∼1995. We wanted to

generalize Kuperberg’s results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do. Using a coideal

subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(34)

Some delicate quantizations

Uq(gln) V

qVq⊗ · · · ⊗V

qVq Uq(glk) Uq(son) V

qVq⊗ · · · ⊗V qVq

| {z }

ktimes

Uq(so2k)

6 ???

6⊂ ⊃=

Quantum skew Howe duality: Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n].

The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB web relations∼1995.

We wanted to generalize Kuperberg’s

results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do. Using a coideal

subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(35)

Some delicate quantizations

Uq(gln) V

qVq⊗ · · · ⊗V

qVq Uq(glk) Uq(son) V

qVq⊗ · · · ⊗V qVq

| {z }

ktimes

Uq(so2k)

6 ???

6⊂ ⊃=

Quantum skew Howe duality: Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n].

The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB web relations∼1995.

We wanted to generalize Kuperberg’s

results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do.

Using a coideal subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(36)

Some delicate quantizations

Uq(gln) V

qVq⊗ · · · ⊗V

qVq Uq(glk) U0q(son) V

qVq⊗ · · · ⊗V qVq

| {z }

ktimes

Uq(so2k)

⊂ ⊃=

Quantum skew Howe duality: Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n]. The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB2web relations∼1995. We wanted to

generalize Kuperberg’s results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do.

Using a coideal subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(37)

Some delicate quantizations

Uq(gln) V

qVq⊗ · · · ⊗V

qVq Uq(glk) U0q(son) V

qVq⊗ · · · ⊗V qVq

| {z }

ktimes

Uq(so2k)

⊂ ⊃=

Using aq-monoidal diagrammatic category Webq,qn we can define a full Howe functor ΦextBD such that we get a commuting diagram

q(so2k) Rep0q(son)

Brq,qn Webq,qn

ΦextBD

ΓextBD fully faithful

β

define

Quantum skew Howe duality: Lehrer–Zhang–Zhang∼2009.

(But its quite easy and not their main point.)

Does not quantize! Quantizes easily

No action at all. Action unclear.

The quantum dimension ofVglq is [n]. The quantum dimension ofVsoq is [n−1]+1.

Hence,Vsoq does not come fromVglq ! This “flaw” propagates all the way through:Va

qVsoq have “weird” quantum dimensions.

The quantum dimension ofVso5

q

Above: Kuperberg’sB2web relations∼1995. We wanted to

generalize Kuperberg’s results. We failed because quantization

is hard outside of typeA.

But let me explain what we can do. Using a coideal

subalgebra does the trick.

The action is constructed using

the unquantized diagrammatics.

(38)

Further directions

Uq(gln) V

qVglq ⊗ · · · ⊗V

qVglq Uq(glk) U0q(son) V

qVglq ⊗ · · · ⊗V qVglq

| {z }

ktimes

Uq(so2k)

⊂ ⊃=

I Use a similar approach to get the quantum group to work. (Needs probably some mixed Howe duality `a la Queffelec–Sartori.)

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 be useful.

I Coideal subalgebras are amenable to categorification, cf. Ehrig–Stroppel or Bao–Shan–Wang–Webster. Similarly, their representation categories should be amenable to categorification.

I Formulate everything in a “2-q-monoidal language”. (Again, `a la Brundan–Ellis.)

=n−1/2for typeB,

=n/2for typeD.

This should give the quantum group story, but it is much trickier since e.g.

Vsoq ∼=Vglq ⊕(Vqgl)⊕C asUq(gl)-modules in typeB.

Thus, the above is not the usualU(gl)-U(glk) duality.

a a b b

=q

a a b b

q-interchange law

=some power depending ona,b c

b a+b a a+b

+c

Singular cobordisms (“foams”,

`

a la Khovanov–Rozansky and Mackaay–Stoˇsi´c–Vaz) categorify webs.

Theq-monoidal property has to be smartly encoded.

2-q-monoidal foams. (Maybe connected to Beliakova–Putyra–Wehrli

whose pictures I shamelessly stole.)

(39)

Further directions

Uq(gl) V

qVqso⊗ · · · ⊗V

qVsoq Uq(glk) Uq(son) V

qVqso⊗ · · · ⊗V qVsoq

| {z }

ktimes

?U0q(so2k)?

⊃ =

I Use a similar approach to get the quantum group to work. (Needs probably some mixed Howe duality `a la Queffelec–Sartori.)

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 be useful.

I Coideal subalgebras are amenable to categorification, cf. Ehrig–Stroppel or Bao–Shan–Wang–Webster. Similarly, their representation categories should be amenable to categorification.

I Formulate everything in a “2-q-monoidal language”. (Again, `a la Brundan–Ellis.)

=n−1/2for typeB,

=n/2for typeD.

This should give the quantum group story, but it is much trickier since e.g.

Vsoq ∼=Vglq ⊕(Vqgl)⊕C asUq(gl)-modules in typeB.

Thus, the above is not the usualU(gl)-U(glk) duality.

a a b b

=q

a a b b

q-interchange law

=some power depending ona,b c

b a+b a a+b

+c

Singular cobordisms (“foams”,

`

a la Khovanov–Rozansky and Mackaay–Stoˇsi´c–Vaz) categorify webs.

Theq-monoidal property has to be smartly encoded.

2-q-monoidal foams. (Maybe connected to Beliakova–Putyra–Wehrli

whose pictures I shamelessly stole.)

(40)

Further directions

Uq(gln) V

qVglq ⊗ · · · ⊗V

qVglq Uq(glk) U0q(son) V

qVglq ⊗ · · · ⊗V qVglq

| {z }

ktimes

Uq(so2k)

⊂ ⊃=

I Use a similar approach to get the quantum group to work. (Needs probably some mixed Howe duality `a la Queffelec–Sartori.)

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 be useful.

I Coideal subalgebras are amenable to categorification, cf. Ehrig–Stroppel or Bao–Shan–Wang–Webster. Similarly, their representation categories should be amenable to categorification.

I Formulate everything in a “2-q-monoidal language”. (Again, `a la Brundan–Ellis.)

=n−1/2for typeB,

=n/2for typeD.

This should give the quantum group story, but it is much trickier since e.g.

Vsoq ∼=Vglq ⊕(Vqgl)⊕C asUq(gl)-modules in typeB.

Thus, the above is not the usualU(gl)-U(glk) duality.

a a b b

=q

a a b b

q-interchange law

=some power depending ona,b

c b a+b a a+b

+c

Singular cobordisms (“foams”,

`

a la Khovanov–Rozansky and Mackaay–Stoˇsi´c–Vaz) categorify webs.

Theq-monoidal property has to be smartly encoded.

2-q-monoidal foams. (Maybe connected to Beliakova–Putyra–Wehrli

whose pictures I shamelessly stole.)

(41)

Further directions

Uq(gln) V

qVglq ⊗ · · · ⊗V

qVglq Uq(glk) U0q(son) V

qVglq ⊗ · · · ⊗V qVglq

| {z }

ktimes

Uq(so2k)

⊂ ⊃=

I Use a similar approach to get the quantum group to work. (Needs probably some mixed Howe duality `a la Queffelec–Sartori.)

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 be useful.

I Coideal subalgebras are amenable to categorification, cf. Ehrig–Stroppel or Bao–Shan–Wang–Webster. Similarly, their representation categories should be amenable to categorification.

I Formulate everything in a “2-q-monoidal language”. (Again, `a la Brundan–Ellis.)

=n−1/2for typeB,

=n/2for typeD.

This should give the quantum group story, but it is much trickier since e.g.

Vsoq ∼=Vglq ⊕(Vqgl)⊕C asUq(gl)-modules in typeB.

Thus, the above is not the usualU(gl)-U(glk) duality.

a a b b

=q

a a b b

q-interchange law

=some power depending ona,b

c b a+b a a+b

+c

Singular cobordisms (“foams”,

`

a la Khovanov–Rozansky and Mackaay–Stoˇsi´c–Vaz) categorify webs.

Theq-monoidal property has to be smartly encoded.

2-q-monoidal foams. (Maybe connected to Beliakova–Putyra–Wehrli

whose pictures I shamelessly stole.)

(42)

Further directions

Uq(gln) V

qVglq ⊗ · · · ⊗V

qVglq Uq(glk) U0q(son) V

qVglq ⊗ · · · ⊗V qVglq

| {z }

ktimes

Uq(so2k)

⊂ ⊃=

I Use a similar approach to get the quantum group to work. (Needs probably some mixed Howe duality `a la Queffelec–Sartori.)

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 be useful.

I Coideal subalgebras are amenable to categorification, cf. Ehrig–Stroppel or Bao–Shan–Wang–Webster. Similarly, their representation categories should be amenable to categorification.

I Formulate everything in a “2-q-monoidal language”. (Again, `a la Brundan–Ellis.)

=n−1/2for typeB,

=n/2for typeD.

This should give the quantum group story, but it is much trickier since e.g.

Vsoq ∼=Vglq ⊕(Vqgl)⊕C asUq(gl)-modules in typeB.

Thus, the above is not the usualU(gl)-U(glk) duality.

a a b b

=q

a a b b

q-interchange law

=some power depending ona,b c

b a+b a a+b

+c

Singular cobordisms (“foams”,

`

a la Khovanov–Rozansky and Mackaay–Stoˇsi´c–Vaz) categorify webs.

Theq-monoidal property has to be smartly encoded.

2-q-monoidal foams.

(Maybe connected to Beliakova–Putyra–Wehrli whose pictures I shamelessly stole.)

Referenzen

ÄHNLICHE DOKUMENTE

Theorem: Exploring an unknown graph requires roughly twice as many edge visits than the optimal exploration route for the known graph. DFS requires no more that twice as

To characterize fine-root trait differences between beech and spruce, three functional fine-root categories were distinguished among sampled fi ne-root branches that re fl ect

In the language of algebraic theories (i.e., finitary monads on Set) the above Theorem together with Remark 6.21 tell us that the rational monad is an iterative algebraic theory

It is only natural to apply this strategy to the definition of categories itself, viewing them as objects in a category, where the morphisms are given by functors.... This rule

In the last section we introduce the Schur functor F , relating strict polynomial functors to representations of the symmetric group. We show that F induces an equivalence

In Section 1.3, we introduce compact quantum groups associated to group algebras of discrete groups, which are a key ingredient for the structure description of

1.1. Definitions and basic properties. Homotopy theory of cofibration categories. Cofibration categories of diagrams and homotopy colimits. Homotopy theory of quasicategories.

We give a conceptual description of Iyama & Wemyss [84] stable category of special Cohen–Macaulay modules over rational surface singularities in terms of singularity categories