Kazhdan-Lusztig theory and Ariki’s Theorem
C´edric Bonnaf´e
(joint work with Nicolas Jacon)
CNRS (UMR 6623) - Universit´e de Franche-Comt´e (Besan¸con)
Oberwolfach, March 2009
(Wn,Sn) Weyl group of type Bn Sn ={t,s1,s2, . . . ,sn−1}
i i i · · · i
t s1 s2 sn−1
`:Wn→N={0,1,2, . . .}length function R =Z[Q,Q−1,q,q−1], Q, q indeterminates
Hn=HR(Wn,Sn,Q,q): Hecke algebra of type Bn with parametersQ and q. Hn =⊕w∈WnRTw
TxTy =Txy if `(xy) =`(x) +`(y) (Tt−Q)(Tt+Q−1) =0
(Tsi −q)(Tsi +q−1) =0 if 16i 6n−1
(Wn,Sn) Weyl group of type Bn Sn ={t,s1,s2, . . . ,sn−1}
i i i · · · i
t s1 s2 sn−1
`:Wn→N={0,1,2, . . .}length function R =Z[Q,Q−1,q,q−1], Q, q indeterminates
Hn=HR(Wn,Sn,Q,q): Hecke algebra of type Bn with parametersQ and q. Hn =⊕w∈WnRTw
TxTy =Txy if `(xy) =`(x) +`(y) (Tt−Q)(Tt+Q−1) =0
(Tsi −q)(Tsi +q−1) =0 if 16i 6n−1
(Wn,Sn) Weyl group of type Bn Sn ={t,s1,s2, . . . ,sn−1}
i i i · · · i
t s1 s2 sn−1
`:Wn→N={0,1,2, . . .}length function
R =Z[Q,Q−1,q,q−1], Q, q indeterminates
Hn=HR(Wn,Sn,Q,q): Hecke algebra of type Bn with parametersQ and q. Hn =⊕w∈WnRTw
TxTy =Txy if `(xy) =`(x) +`(y) (Tt−Q)(Tt+Q−1) =0
(Tsi −q)(Tsi +q−1) =0 if 16i 6n−1
(Wn,Sn) Weyl group of type Bn Sn ={t,s1,s2, . . . ,sn−1}
i i i · · · i
t s1 s2 sn−1
`:Wn→N={0,1,2, . . .}length function R =Z[Q,Q−1,q,q−1], Q, q indeterminates
Hn=HR(Wn,Sn,Q,q): Hecke algebra of type Bn with parametersQ and q.
Hn =⊕w∈WnRTw
TxTy =Txy if `(xy) =`(x) +`(y) (Tt−Q)(Tt+Q−1) =0
(Tsi −q)(Tsi +q−1) =0 if 16i 6n−1
(Wn,Sn) Weyl group of type Bn Sn ={t,s1,s2, . . . ,sn−1}
i i i · · · i
t s1 s2 sn−1
`:Wn→N={0,1,2, . . .}length function R =Z[Q,Q−1,q,q−1], Q, q indeterminates
Hn=HR(Wn,Sn,Q,q): Hecke algebra of type Bn with parametersQ and q. Hn =⊕w∈WnRTw
TxTy =Txy if `(xy) =`(x) +`(y) (Tt−Q)(Tt+Q−1) =0
(Tsi −q)(Tsi +q−1) =0 if 16i 6n−1
(Wn,Sn) Weyl group of type Bn Sn ={t,s1,s2, . . . ,sn−1}
i i i · · · i
t s1 s2 sn−1
`:Wn→N={0,1,2, . . .}length function R =Z[Q,Q−1,q,q−1], Q, q indeterminates
Hn=HR(Wn,Sn,Q,q): Hecke algebra of type Bn with parametersQ and q. Hn =⊕w∈WnRTw
TxTy =Txy if `(xy) =`(x) +`(y) (Tt−Q)(Tt+Q−1) =0
(Tsi −q)(Tsi +q−1) =0 if 16i 6n−1
K =Frac(R),KHn=K ⊗R Hn split semisimple
IrrKHn={Vλ |λ∈Bip(n)}, whereBip(n) ={bipartitions of n}.
Q0,q0 ∈C×, specialization −→CHn =C⊗R Hn
R0(CHn) := Grothendieck group of CHn 'ZIrrCHn decomposition mapdn:R0(KHn)−→R0(CHn)
Hypothesis and notation Q02 = −q02d, d ∈Z e =order of q02, e >2.
K =Frac(R),KHn=K ⊗R Hn split semisimple IrrKHn={Vλ |λ∈Bip(n)}, whereBip(n) ={bipartitions of n}.
Q0,q0 ∈C×, specialization −→CHn =C⊗R Hn
R0(CHn) := Grothendieck group of CHn 'ZIrrCHn decomposition mapdn:R0(KHn)−→R0(CHn)
Hypothesis and notation Q02 = −q02d, d ∈Z e =order of q02, e >2.
K =Frac(R),KHn=K ⊗R Hn split semisimple IrrKHn={Vλ |λ∈Bip(n)}, whereBip(n) ={bipartitions of n}.
Q0,q0 ∈C×, specialization −→CHn =C⊗R Hn
R0(CHn) := Grothendieck group of CHn 'ZIrrCHn decomposition mapdn:R0(KHn)−→R0(CHn)
Hypothesis and notation Q02 = −q02d, d ∈Z e =order of q02, e >2.
K =Frac(R),KHn=K ⊗R Hn split semisimple IrrKHn={Vλ |λ∈Bip(n)}, whereBip(n) ={bipartitions of n}.
Q0,q0 ∈C×, specialization −→CHn =C⊗R Hn
R0(CHn) := Grothendieck group of CHn 'ZIrrCHn
decomposition mapdn:R0(KHn)−→R0(CHn) Hypothesis and notation
Q02 = −q02d, d ∈Z e =order of q02, e >2.
K =Frac(R),KHn=K ⊗R Hn split semisimple IrrKHn={Vλ |λ∈Bip(n)}, whereBip(n) ={bipartitions of n}.
Q0,q0 ∈C×, specialization −→CHn =C⊗R Hn
R0(CHn) := Grothendieck group of CHn 'ZIrrCHn decomposition mapdn:R0(KHn)−→R0(CHn)
Hypothesis and notation Q02 = −q02d, d ∈Z e =order of q02, e >2.
K =Frac(R),KHn=K ⊗R Hn split semisimple IrrKHn={Vλ |λ∈Bip(n)}, whereBip(n) ={bipartitions of n}.
Q0,q0 ∈C×, specialization −→CHn =C⊗R Hn
R0(CHn) := Grothendieck group of CHn 'ZIrrCHn decomposition mapdn:R0(KHn)−→R0(CHn)
Hypothesis and notation Q02 = −q02d, d ∈Z e =order of q02, e >2.
Fock space:
Bip= a
n>0
Bip(n), r >0, v indeterminate Fock space: Fr := ⊕
λ∈BipC(v) |λ,ri
Fr is endowed with an action of Uv( ^sle) depending on r Uglovhas constructed an involution¯:Fr →Fr and there exists a unique G(λ,r)∈Fr such that
G(λ,r) =G(λ,r)
G(λ,r)≡|λ,ri mod vC[v] Write G(µ,r) = X
λ∈Bip
dλµr (v) |λ,ri (note thatdλλr (v) =1). (|λ,ri)λ∈Bip is called thestandard basis
(G(λ,r))λ∈Bip is called theKashiwara-Lusztig canonical basis
Fock space:
Bip= a
n>0
Bip(n), r >0, v indeterminate
Fock space: Fr := ⊕
λ∈BipC(v) |λ,ri
Fr is endowed with an action of Uv( ^sle) depending on r Uglovhas constructed an involution¯:Fr →Fr and there exists a unique G(λ,r)∈Fr such that
G(λ,r) =G(λ,r)
G(λ,r)≡|λ,ri mod vC[v] Write G(µ,r) = X
λ∈Bip
dλµr (v) |λ,ri (note thatdλλr (v) =1). (|λ,ri)λ∈Bip is called thestandard basis
(G(λ,r))λ∈Bip is called theKashiwara-Lusztig canonical basis
Fock space:
Bip= a
n>0
Bip(n), r >0, v indeterminate Fock space: Fr := ⊕
λ∈BipC(v) |λ,ri
Fr is endowed with an action of Uv( ^sle) depending on r Uglovhas constructed an involution¯:Fr →Fr and there exists a unique G(λ,r)∈Fr such that
G(λ,r) =G(λ,r)
G(λ,r)≡|λ,ri mod vC[v] Write G(µ,r) = X
λ∈Bip
dλµr (v) |λ,ri (note thatdλλr (v) =1). (|λ,ri)λ∈Bip is called thestandard basis
(G(λ,r))λ∈Bip is called theKashiwara-Lusztig canonical basis
Fock space:
Bip= a
n>0
Bip(n), r >0, v indeterminate Fock space: Fr := ⊕
λ∈BipC(v) |λ,ri Fr is endowed with an action of Uv( ^sle)
depending on r Uglovhas constructed an involution¯:Fr →Fr and there exists a unique G(λ,r)∈Fr such that
G(λ,r) =G(λ,r)
G(λ,r)≡|λ,ri mod vC[v] Write G(µ,r) = X
λ∈Bip
dλµr (v) |λ,ri (note thatdλλr (v) =1). (|λ,ri)λ∈Bip is called thestandard basis
(G(λ,r))λ∈Bip is called theKashiwara-Lusztig canonical basis
Fock space:
Bip= a
n>0
Bip(n), r >0, v indeterminate Fock space: Fr := ⊕
λ∈BipC(v) |λ,ri
Fr is endowed with an action of Uv( ^sle) depending on r
Uglovhas constructed an involution¯:Fr →Fr and there exists a unique G(λ,r)∈Fr such that
G(λ,r) =G(λ,r)
G(λ,r)≡|λ,ri mod vC[v] Write G(µ,r) = X
λ∈Bip
dλµr (v) |λ,ri (note thatdλλr (v) =1). (|λ,ri)λ∈Bip is called thestandard basis
(G(λ,r))λ∈Bip is called theKashiwara-Lusztig canonical basis
Fock space:
Bip= a
n>0
Bip(n), r >0, v indeterminate Fock space: Fr := ⊕
λ∈BipC(v) |λ,ri
Fr is endowed with an action of Uv( ^sle) depending on r Uglovhas constructed an involution¯:Fr →Fr and there exists a unique G(λ,r)∈Fr such that
G(λ,r) =G(λ,r)
G(λ,r)≡|λ,ri mod vC[v]
Write G(µ,r) = X
λ∈Bip
dλµr (v) |λ,ri (note thatdλλr (v) =1). (|λ,ri)λ∈Bip is called thestandard basis
(G(λ,r))λ∈Bip is called theKashiwara-Lusztig canonical basis
Fock space:
Bip= a
n>0
Bip(n), r >0, v indeterminate Fock space: Fr := ⊕
λ∈BipC(v) |λ,ri
Fr is endowed with an action of Uv( ^sle) depending on r Uglovhas constructed an involution¯:Fr →Fr and there exists a unique G(λ,r)∈Fr such that
G(λ,r) =G(λ,r)
G(λ,r)≡|λ,ri mod vC[v] Write G(µ,r) = X
λ∈Bip
dλµr (v)|λ,ri (note thatdλλr (v) =1).
(|λ,ri)λ∈Bip is called thestandard basis
(G(λ,r))λ∈Bip is called theKashiwara-Lusztig canonical basis
Fock space:
Bip= a
n>0
Bip(n), r >0, v indeterminate Fock space: Fr := ⊕
λ∈BipC(v) |λ,ri
Fr is endowed with an action of Uv( ^sle) depending on r Uglovhas constructed an involution¯:Fr →Fr and there exists a unique G(λ,r)∈Fr such that
G(λ,r) =G(λ,r)
G(λ,r)≡|λ,ri mod vC[v] Write G(µ,r) = X
λ∈Bip
dλµr (v)|λ,ri (note thatdλλr (v) =1).
(|λ,ri)λ∈Bip is called the standard basis
(G(λ,r))λ∈Bip is called the Kashiwara-Lusztig canonical basis
Ariki’s Theorem (Ariki, Uglov, Geck-Jacon). Assume that r ≡d mod e. There exists a subset Bipe,r(n) of Bip(n) and a bijection
Bipe,r(n) −→ IrrCHn
λ 7−→ Dλe,r
such that
Uv( ^sle) |∅,ri= ⊕
λ∈Bipe,rC(v) G(λ,r), where Bipe,r = a
n>0
Bipe,r(n)
If λ∈Bip(n), then dn[Vλ] = X
µ∈Bipe,r(n)
dλµr (1) [Dµe,r]
Remark - dλµr (v) is “computable”
Ariki’s Theorem (Ariki, Uglov, Geck-Jacon). Assume that r ≡d mod e. There exists a subset Bipe,r(n) of Bip(n) and a bijection
Bipe,r(n) −→ IrrCHn
λ 7−→ Dλe,r
such that
Uv( ^sle) |∅,ri= ⊕
λ∈Bipe,rC(v) G(λ,r), where Bipe,r = a
n>0
Bipe,r(n)
If λ∈Bip(n), then dn[Vλ] = X
µ∈Bipe,r(n)
dλµr (1) [Dµe,r]
Remark - dλµr (v) is “computable”
Ariki’s Theorem (Ariki, Uglov, Geck-Jacon). Assume that r ≡d mod e. There exists a subset Bipe,r(n) of Bip(n) and a bijection
Bipe,r(n) −→ IrrCHn
λ 7−→ Dλe,r
such that
Uv( ^sle) |∅,ri= ⊕
λ∈Bipe,rC(v) G(λ,r), where Bipe,r = a
n>0
Bipe,r(n)
If λ∈Bip(n), then dn[Vλ] = X
µ∈Bipe,r(n)
dλµr (1) [Dµe,r]
Remark - dλµr (v) is “computable”
Ariki’s Theorem (Ariki, Uglov, Geck-Jacon). Assume that r ≡d mod e. There exists a subset Bipe,r(n) of Bip(n) and a bijection
Bipe,r(n) −→ IrrCHn
λ 7−→ Dλe,r
such that
Uv( ^sle) |∅,ri= ⊕
λ∈Bipe,rC(v) G(λ,r), where Bipe,r = a
n>0
Bipe,r(n)
If λ∈Bip(n), then dn[Vλ] = X
µ∈Bipe,r(n)
dλµr (1) [Dµe,r]
Remark - dλµr (v) is “computable”
Comments:
|Bipe,r(n)|=|Bipe,r+ke(n)| if k ∈Z (for a bijection, see Jacon, Jacon-Lecouvey)
If r >n−1,Bipe,r(n) ={Kleshchev bipartitions} (see Ariki: it is related to the Dipper-James-Mathas or to the Graham-Lehrer cellular structure).
Bipd
0,e(n) ={FLOTW bipartitions} (Jacon). Here, d0 ≡d mod e and d0 ∈{0,1,2, . . . ,e−1}.
Comments:
|Bipe,r(n)|=|Bipe,r+ke(n)| if k ∈Z (for a bijection, see Jacon, Jacon-Lecouvey)
If r >n−1,Bipe,r(n) ={Kleshchev bipartitions} (see Ariki: it is related to the Dipper-James-Mathas or to the Graham-Lehrer cellular structure).
Bipd
0,e(n) ={FLOTW bipartitions} (Jacon). Here, d0 ≡d mod e and d0 ∈{0,1,2, . . . ,e−1}.
Comments:
|Bipe,r(n)|=|Bipe,r+ke(n)| if k ∈Z (for a bijection, see Jacon, Jacon-Lecouvey)
If r >n−1,Bipe,r(n) ={Kleshchev bipartitions} (see Ariki: it is related to the Dipper-James-Mathas or to the Graham-Lehrer cellular structure).
Bipd
0,e(n) ={FLOTW bipartitions} (Jacon). Here, d0 ≡d mod e and d0 ∈{0,1,2, . . . ,e−1}.
R =Z[Z2]
= ⊕
γ∈Z2
Zeγ. Q =e(1,0), q =e(0,1).
For Kazhdan-Lusztig theory (with unequal parameters) you need another ingredient: a total orderon Z2 (compatible with addition).
Fix θ∈R+,irrational (!): let 6θ be the total order on Z2 defined by
(m,n)6θ (m0,n0)⇐⇒mθ+n6m0θ+n0 (roughly speaking, “Q =qθ”...)
Let¯:Hn →Hn, Tw 7→Tw−1−1, Q 7→Q−1, q7→q−1 (i.e. eγ7→e−γ) antilinear involution.
R<θ0 = ⊕
γ∈Z2<θ0
Zeγ, H<nθ0 = ⊕
w∈Wn
R<θ0Tw.
R =Z[Z2] = ⊕
γ∈Z2
Zeγ. Q =e(1,0), q =e(0,1).
For Kazhdan-Lusztig theory (with unequal parameters) you need another ingredient: a total orderon Z2 (compatible with addition).
Fix θ∈R+,irrational (!): let 6θ be the total order on Z2 defined by
(m,n)6θ (m0,n0)⇐⇒mθ+n6m0θ+n0 (roughly speaking, “Q =qθ”...)
Let¯:Hn →Hn, Tw 7→Tw−1−1, Q 7→Q−1, q7→q−1 (i.e. eγ7→e−γ) antilinear involution.
R<θ0 = ⊕
γ∈Z2<θ0
Zeγ, H<nθ0 = ⊕
w∈Wn
R<θ0Tw.
R =Z[Z2] = ⊕
γ∈Z2
Zeγ. Q =e(1,0), q =e(0,1).
For Kazhdan-Lusztig theory (with unequal parameters) you need another ingredient: a total orderon Z2 (compatible with addition).
Fix θ∈R+,irrational (!): let 6θ be the total order on Z2 defined by
(m,n)6θ (m0,n0)⇐⇒mθ+n6m0θ+n0 (roughly speaking, “Q =qθ”...)
Let¯:Hn →Hn, Tw 7→Tw−1−1, Q 7→Q−1, q7→q−1 (i.e. eγ7→e−γ) antilinear involution.
R<θ0 = ⊕
γ∈Z2<θ0
Zeγ, H<nθ0 = ⊕
w∈Wn
R<θ0Tw.
R =Z[Z2] = ⊕
γ∈Z2
Zeγ. Q =e(1,0), q =e(0,1).
For Kazhdan-Lusztig theory (with unequal parameters) you need another ingredient: a total orderon Z2 (compatible with addition).
Fix θ∈R+,irrational (!): let 6θ be the total order on Z2 defined by
(m,n)6θ (m0,n0)⇐⇒mθ+n 6m0θ+n0
(roughly speaking, “Q =qθ”...)
Let¯:Hn →Hn, Tw 7→Tw−1−1, Q 7→Q−1, q7→q−1 (i.e. eγ7→e−γ) antilinear involution.
R<θ0 = ⊕
γ∈Z2<θ0
Zeγ, H<nθ0 = ⊕
w∈Wn
R<θ0Tw.
R =Z[Z2] = ⊕
γ∈Z2
Zeγ. Q =e(1,0), q =e(0,1).
For Kazhdan-Lusztig theory (with unequal parameters) you need another ingredient: a total orderon Z2 (compatible with addition).
Fix θ∈R+,irrational (!): let 6θ be the total order on Z2 defined by
(m,n)6θ (m0,n0)⇐⇒mθ+n 6m0θ+n0 (roughly speaking, “Q =qθ”...)
Let¯:Hn →Hn, Tw 7→Tw−1−1, Q 7→Q−1, q7→q−1 (i.e. eγ7→e−γ) antilinear involution.
R<θ0 = ⊕
γ∈Z2<θ0
Zeγ, H<nθ0 = ⊕
w∈Wn
R<θ0Tw.
R =Z[Z2] = ⊕
γ∈Z2
Zeγ. Q =e(1,0), q =e(0,1).
For Kazhdan-Lusztig theory (with unequal parameters) you need another ingredient: a total orderon Z2 (compatible with addition).
Fix θ∈R+,irrational (!): let 6θ be the total order on Z2 defined by
(m,n)6θ (m0,n0)⇐⇒mθ+n 6m0θ+n0 (roughly speaking, “Q =qθ”...)
Let¯:Hn→Hn, Tw 7→Tw−1−1, Q 7→Q−1, q7→q−1 (i.e.
eγ7→e−γ) antilinear involution.
R<θ0 = ⊕
γ∈Z2<θ0
Zeγ, H<nθ0 = ⊕
w∈Wn
R<θ0Tw.
R =Z[Z2] = ⊕
γ∈Z2
Zeγ. Q =e(1,0), q =e(0,1).
For Kazhdan-Lusztig theory (with unequal parameters) you need another ingredient: a total orderon Z2 (compatible with addition).
Fix θ∈R+,irrational (!): let 6θ be the total order on Z2 defined by
(m,n)6θ (m0,n0)⇐⇒mθ+n 6m0θ+n0 (roughly speaking, “Q =qθ”...)
Let¯:Hn→Hn, Tw 7→Tw−1−1, Q 7→Q−1, q7→q−1 (i.e.
eγ7→e−γ) antilinear involution.
R<θ0 = ⊕
γ∈Z2<θ0
Zeγ,
H<nθ0 = ⊕
w∈Wn
R<θ0Tw.
R =Z[Z2] = ⊕
γ∈Z2
Zeγ. Q =e(1,0), q =e(0,1).
For Kazhdan-Lusztig theory (with unequal parameters) you need another ingredient: a total orderon Z2 (compatible with addition).
Fix θ∈R+,irrational (!): let 6θ be the total order on Z2 defined by
(m,n)6θ (m0,n0)⇐⇒mθ+n 6m0θ+n0 (roughly speaking, “Q =qθ”...)
Let¯:Hn→Hn, Tw 7→Tw−1−1, Q 7→Q−1, q7→q−1 (i.e.
eγ7→e−γ) antilinear involution.
R<θ0 = ⊕
γ∈Z2<θ0
Zeγ, H<nθ0 = ⊕
w∈Wn
R<θ0Tw.
Theorem (Kazhdan-Lusztig, 1979). For each w ∈Wn, there exists a uniqueCwθ ∈ Hn such that
Cθw =Cwθ
Cwθ ≡Tw mod Hn<θ0
Case n=2 (write s =s1)
C1θ = 1, Ctθ =Tt+Q−1, Csθ=Ts+q−1 Cstθ = Tst +Q−1Ts+q−1Tt+Q−1q−1 Ctsθ = Tts +Q−1Ts+q−1Tt+Q−1q−1 Cstsθ = Tsts +q−1(Tst +Tts) +
q−2Tt+Q−1q−1(1+q2)(Ts+q−1) if θ >1
Q−1q−1Ts+Q−1q−1(1−Q2)(Tt+Q−1) if 0< θ <1 Ctstθ = Ttst +Q−1(Tst +Tts) +
Q−1q−1Ts+Q−1q−1(1−q2)(Tt+Q−1) ifθ >1 Q−1q−1Tt+Q−1q−1(1+q2)(Ts +q−1) if 0< θ <1 Cwθ0 = Tw0+Q−1Tsts+q−1Ttst +Q−1q−1(Tst +Tts)
+Q−2q−1Ts+Q−1q−2Tt+Q−2q−2
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ VCθ =I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−:
it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ VCθ =I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ VCθ =I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ VCθ =I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ VCθ =I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ
I<θ
LC = ⊕
x<θLC
RCxθ VCθ =I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ
VCθ =I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ VCθ=I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ VCθ=I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module
: VCθ is called the left cell representation associated toC.
If x, y ∈W, we write x ←L,θ−y if there existsh ∈ Hn such that Cxθ occurs inhCyθ
Let6θL be the transitive closure of ←L,θ−: it is a preorder (reflexive and transitive)
Let∼θL be the equivalence relation associated to 6θL (i.e. x ∼θL y if and only ifx 6L y and y 6θL x)
Definition
Aθ-left cell is an equivalence class for the relation ∼θL.
If C is a θ-left cell, we set
I6θ
LC = ⊕
x6θLC
RCxθ I<θ
LC = ⊕
x<θLC
RCxθ VCθ=I6θ
LC/I<θ
LC
By construction, I6θ
LC and I<θ
LC are left ideals of Hn and VCθ is a leftHn-module: VCθ is called the left cell representation associated toC.
Theorem (B., Geck, Iancu, Jacon, Lam, Lusztig, Pietraho, Taskin)
Assume that Lusztig’s conjectures P1, P2,..., P15 hold. Then :
If C is a θ-left cell of Wn, then KVCθ ∈IrrKHn. We denove by λ(C) the bipartition such that KVCθ 'Vλ(C).
If KVCθ 'KVCθ0, then VCθ 'VCθ0. We write Sλθ =VCθ isλ(C) =λ. Sλθ is endowed with an “Hn-invariant” bilinear form φθλ. We set
Dλθ =CSλθ/KerCφθλ. LetBipθ(n) ={λ∈Bip(n) |Dλθ 6=0}. Then
IrrCHn ={Dλθ | λ∈Bipθ(n)}.
Theorem (B., Geck, Iancu, Jacon, Lam, Lusztig, Pietraho, Taskin)
Assume that Lusztig’s conjectures P1, P2,..., P15 hold. Then : If C is a θ-left cell of Wn, then KVCθ ∈IrrKHn.
We denove by λ(C) the bipartition such that KVCθ 'Vλ(C).
If KVCθ 'KVCθ0, then VCθ 'VCθ0. We write Sλθ =VCθ isλ(C) =λ. Sλθ is endowed with an “Hn-invariant” bilinear form φθλ. We set
Dλθ =CSλθ/KerCφθλ. LetBipθ(n) ={λ∈Bip(n) |Dλθ 6=0}. Then
IrrCHn ={Dλθ | λ∈Bipθ(n)}.
Theorem (B., Geck, Iancu, Jacon, Lam, Lusztig, Pietraho, Taskin)
Assume that Lusztig’s conjectures P1, P2,..., P15 hold. Then : If C is a θ-left cell of Wn, then KVCθ ∈IrrKHn. We denove by λ(C) the bipartition such that KVCθ 'Vλ(C).
If KVCθ 'KVCθ0, then VCθ 'VCθ0. We write Sλθ =VCθ isλ(C) =λ. Sλθ is endowed with an “Hn-invariant” bilinear form φθλ. We set
Dλθ =CSλθ/KerCφθλ. LetBipθ(n) ={λ∈Bip(n) |Dλθ 6=0}. Then
IrrCHn ={Dλθ | λ∈Bipθ(n)}.
Theorem (B., Geck, Iancu, Jacon, Lam, Lusztig, Pietraho, Taskin)
Assume that Lusztig’s conjectures P1, P2,..., P15 hold. Then : If C is a θ-left cell of Wn, then KVCθ ∈IrrKHn. We denove by λ(C) the bipartition such that KVCθ 'Vλ(C).
If KVCθ 'KVCθ0, then VCθ 'VCθ0.
We write Sλθ =VCθ isλ(C) =λ. Sλθ is endowed with an “Hn-invariant” bilinear form φθλ. We set
Dλθ =CSλθ/KerCφθλ. LetBipθ(n) ={λ∈Bip(n) |Dλθ 6=0}. Then
IrrCHn ={Dλθ | λ∈Bipθ(n)}.
Theorem (B., Geck, Iancu, Jacon, Lam, Lusztig, Pietraho, Taskin)
Assume that Lusztig’s conjectures P1, P2,..., P15 hold. Then : If C is a θ-left cell of Wn, then KVCθ ∈IrrKHn. We denove by λ(C) the bipartition such that KVCθ 'Vλ(C).
If KVCθ 'KVCθ0, then VCθ 'VCθ0. We write Sλθ =VCθ isλ(C) =λ.
Sλθ is endowed with an “Hn-invariant” bilinear form φθλ. We set Dλθ =CSλθ/KerCφθλ.
LetBipθ(n) ={λ∈Bip(n) |Dλθ 6=0}. Then IrrCHn ={Dλθ | λ∈Bipθ(n)}.