Unipotent Hecke algebras: the structure, representation theory, and combinatorics

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last updated: 26 March 2015

This is an excerpt of the PhD thesis Unipotent Hecke algebras: the structure, representation theory, and combinatorics by F. Nathaniel Edgar Thiem.

The representation theory of the Yokonuma algebra

General type

Let 1:U→ℂ* be the trivial character, and let e1=1∣U∣ ∑u∈Uu∈ℂG (6.1) be the idempotent so that IndUG(1)≅ℂGe1. Then the Yokonuma algebra ℋ1=EndℂG (ℂGe1)≅ e1ℂGe1 has a basis {e1ve1 | v∈N}, indexed byN=⟨ξi,h | i=1,2,…,ℓ, h∈T⟩, where ξi=wi(1)=xi(1)x-αi(-1)xi(1), and T=⟨hH(t) | H∈𝔥ℤ⟩. Recall that hi(t)=hHαi(t).

The map ℂT ⟶ ℋ1 h ⟼ e1he1 is an injective algebra homomorphism (see Chapter 3 (E3)). For v∈N, write Tv=e1ve1 ∈ℋ1,with Ti=Tξi,and h=Th,h∈T.

(Yokonuma). ℋ1 is generated by Ti, i=1,…,ℓ, and h∈T with relations Tih = si(h)Ti, Ti2 = q-1hi(-1) +q-1∑t∈𝔽q* hi(t)Ti, TiTjTi⋯ ⏟mij = TjTiTj⋯ ⏟mij , where mij  is the order of sisj  in W, ThTk = Thk,h,k∈T.

Proof.

Consider the product ξiξj∈N for i≠j. Note that e1ξiξje1 = e1(∏α≠αieα) ξiξjeαie1 (by (3.17)) = e1ξi (∏α≠αieα) eαieξje1 (by Chapter 3, (E1)) = e1ξie1ξje1 = (e1ξie1) (e1ξje1). Thus, if v=v1v2⋯vrvT∈N decomposes according to si1si2⋯sir∈W (see (3.4)), then Tv=e1v1 v2⋯vrvTe1 =Ti1Ti2⋯ TirvT. (6.2) The Yokonuma algebra is therefore generated by Ti, i=1,2,…,ℓ, and h∈T.

The necessity of the relations is a direct consequence of (6.2), (N3), (UN3), and (N2) (the last three are from Chapter 3). For sufficiency, use a similar argument to the one used in the proof of Theorem 3.5 in [IMa1965].

□

A reduction theorem

Let Tˆ index the irreducible ℂT-modules. Since T is abelian, all the irreducible modules are one-dimensional, and we may identify the label γ∈Tˆ of Vγ=ℂ-span{vγ} with the homomorphism γ:T→ℂ* given by hvγ=γ(h) vγ,for h∈T. Suppose V is an ℋ1-module. As a T-module V=⨁γ∈Tˆ Vγ,where Vγ ={v∈V | hv=γ(h)v, h∈T}.

Note that ℋ1=⨁γ∈Tˆ ℋ1τγ,where τγ=1∣T∣ ∑h∈Tγ(h-1)h. (6.3) Recall the surjection π:N→W of (3.3). Use this map to identify w=si1si2⋯ sir∈W⟷ w=ξi1ξi2⋯ ξir∈N,for  r minimal. (6.4) Thus, the W-action on Tˆ (wγ)(h)= γ(w-1(h)), for w∈W, h∈T , and γ∈Tˆ, implies that for γ∈Tˆ, vγ∈Vγ, hTwvγ=Tww-1 (h)vγ=γ (w-1h)Twvγ for all h∈T. Thus, Tw(Vγ)⊆ Vwγ. (6.5) Let Wγ= {w∈W | w(γ)=γ} and 𝒯γ=τγ ℋ1τγ=ℂ -span{τγTwτγ | w∈Wγ}. (6.6)

Remarks 1. Since the identity of ℋ1 is e1 and the identity of 𝒯γ is τγ, the algebra 𝒯γ is not a subalgebra of ℋ1. In fact, 𝒯γ≅Endℋ1(IndℂTℋ1(γ)). 2. If V is an ℋ1-module, then τγV=Vγ, and so𝒯γV= 𝒯γVγ. In particular, Vγ is an 𝒯γ-module.

Let V be an irreducible ℋ1-module such that Vγ≠0. Then (a) Vγ is an irreducible 𝒯γ-module; (b) if M is an irreducible 𝒯γ-module, then ℋ1⊗𝒯γM is an irreducible ℋ1-module; (c) the map Ind𝒯γℋ1(Vγ) = ℋ1⊗𝒯γVγ ⟶∼ V Tw⊗vγ ⟼ Twvγ is an ℋ1-module isomorphism.

Proof.

(a) Let 0≠vγ∈Vγ. The irreducibility of V implies that ℋ1vγ=V, so for any v∈Vγ, there exist elements cw,ν∈ℂ such that v = ∑w∈Wν∈Tˆ cw,νTwτνvγ (by (6.3)) = ∑w∈Wcw,γ Twτγvγ (by the orthogonality of characters of T) = ∑w∈Wγcw,γ τγTwτγvγ. (by (6.5) and since v∈Vγ) Since an arbitrarily chosen v is contained in 𝒯γvγ, we have 𝒯γvγ=Vγ, making Vγ an irreducible 𝒯γ-module.

(b) Suppose M is an irreducible 𝒯γ-module. Let V = Ind𝒯γℋ1(M) = ℋ1⊗𝒯γM = ℂ-span { Twτν⊗v |  w∈W,ν≠γ∈Tˆ,v∈M } = ℂ-span { Tw⊗v | w∈W/ Wγ,v∈M } where the last equality follows from τν⊗v=τν⊗ τγv=τντγ ⊗v=0⊗v,for  ν≠γ. Note that Vγ=ℂ-span{e1⊗v | v∈M}≅M. In particular, Vγ is an irreducible 𝒯γ-module and ℋ1Vγ=V.

Suppose V has a nontrivial ℋ1-submodule V′. Since V is induced from Vγ, there must by some Tw∈ℋ1 such that Tw(V′)∩ Vγ≠0. But V′ is an ℋ1-module, so V′∩Vγ≠0. As an irreducible 𝒯γ-module Vγ⊆V′, and by the construction of V, ℋ1V′⊇ ℋ1Vγ=V. Therefore, V contains no nontrivial, proper submodules, making V an irreducible ℋ1-module.

(c) Follows from the proof of (b).

□

Let Tˆ/W be the set of W-orbits in Tˆ. Identify Tˆ/W with a set of orbit representatives, and for γ∈Tˆ/W, let Tˆγ index the irreducible modules of 𝒯γ.

The map {Irreducible ℋ1-modules} ⟷ {Pairs (γ,λ),γ∈Tˆ/W,λ∈𝒯ˆγ} Ind𝒯γℋ1(𝒯γλ) ↔ (γ,λ) is a bijection.

The algebras 𝒯γ

Let B=UT be a Borel subgroup of G. Since B ⟶ T uh ⟼ h is a surjective homomorphism, γ:T→ℂ* extends to a linear character γ of B given by γ(uh)=γ(h). Note that e1τγ=1∣B∣ ∑b∈Bγ(b-1)b (e1 as in (6.1)). Thus, 𝒯γ=τγe1 ℂGe1τγ≅ EndℂG(IndBG(γ)) =ℋ(G,B,γ), where if γ is the trivial character 1B, then ℋ(G,B,1B) is the Iwahori-Hecke algebra.

Let γ∈Tˆ be such that Wγ is generated by simple reflections. Then 𝒯γ is presented by generators {Ti | si∈Wγ} with relations Ti2 = { q-1+q-1 (q-1)Ti, if γ(hαi(t)) =1 for all t∈𝔽q*, γ(hαi(-1)) q-1, otherwise, TiTjTi⋯ ⏟mij = TjTiTj⋯ ⏟mij ,where mij is the order of sisj  in W.

Proof.

This follows from Theorem 6.1 and (∑t∈𝔽q*hαi(t)) τγ=∑t∈𝔽q* γ(hαi(t))τγ= { (q-1)τγ, if γ(hαi(t))= 1 for all t∈𝔽q*, 0, otherwise.

□

The G=GLn(𝔽q) case

The Yokonuma algebra and the Iwahori-Hecke algebra

If ψμ=1 is the trivial character of U, then μ=(1n). Let Ti=e1sie1 and recall that hεj(t)=Idj-1⊕(t)⊕Idn-j. In the case G=GLn(𝔽q), ℋ1 has generators Ti, hεj(t), for 1≤i<n, 1≤j≤n and t∈𝔽q* with relations Ti2 = q-1+q-1 hεi(-1) ∑t∈𝔽q* hεi(t) hεi+1 (t-1)Ti, TiTi+1Ti = Ti+1TiTi+1, TiTj=TjTi, ∣i-j∣>1, hεj(t)Ti = Tihεj′(t), where j′=si(j), hεi(a) hεi(b) = hεi(ab), hεi(a) hεj(b)= hεj(b) hεi(a), a,b∈𝔽q*.

The Yokonuma algebra has a decomposition ℋ1=⨁γ∈Tˆ ℋ1τγ,where τγ=1∣T∣ ∑h∈Tγ(h-1)h.

Fix a total ordering ≤ on the set 𝔽ˆq*={φ1,φ2,…,φq-1} of linear characters of 𝔽q*, such that φ1:𝔽q*→ℂ* is the trivial character. Suppose γ∈Tˆ. Since ⟨hεi(t) | t∈𝔽q*⟩≅𝔽q*, γ(h) = γ(hε1(h1)) γ(hε2(h2))⋯ γ(hεn(hn)), where h=diag(h1,h2,…,hn)∈T, = γ1(h1) γ2(h2)⋯ γn(hn), where γi∈𝔽ˆq*. Thus, every γ∈Tˆ can be written γ=φi1⊗φi2⊗⋯⊗φin.

Let ν=(ν1,ν2,…,νn)⊨n with νi≥0. Write γν= φ1⊗⋯⊗φ1 ⏟ν1 terms ⊗ φ2⊗⋯⊗φ2 ⏟ν2 terms ⊗⋯⊗ φn⊗⋯⊗φn ⏟νn terms andτν= τγν. (6.7) Note that the γν are orbit representatives of the W-action in Tˆ. Let Wν = {w∈W | w(γν)=γν}= Wν1⊕Wν2⊕⋯⊕Wνn, 𝒯ν = τνℋ1τν= ℂ-span{τνTwτν | w∈Wν}. Note that Wν is generated by its simple reflections.

If si is in the kth factor of Wν=Wν1⊕Wν2⊕⋯⊕Wνn, then write si∈Wνk.

Let ν⊨n and νTw=τνTwτν for w∈Wν. Then 𝒯ν is presented by generators { νTi |  si∈Wν } with relations νTi2 = q-1+φk (-1)q-1 (q-1)νTi, for si∈Wνk νTiνTi+1 νTi = νTi+1ν TiνTi+1 νTiνTj = νTjνTi, for ∣i-j∣>1.

Proof.

Note that if si∈Wν then γν(hεi(t))=γν(hεi+1(t)). Thus, the lemma follows from the Yokonuma algebra relations.

□

The Iwahori-Hecke algebra 𝒯⊆ℋ1 is the algebra 𝒯n=ℋ(n), (recall φ1 is the trivial character). In 𝒯n, write Ii=τ(n)Ti τ(n).

Let ν=(ν1,…,νn)⊨n. Index the generators Ii of 𝒯νk by {i | si∈Wνk}. Then the map 𝒯ν ⟶∼ 𝒯ν1⊗𝒯ν2⊗⋯⊗𝒯νn νTi ⟼ φk(-1)1⊗⋯⊗1⏟k-1 terms⊗Ii⊗1⊗⋯⊗1⏟n-k terms,for si∈Wνk, is an algebra isomorphism.

Proof.

Let ν(k)= ( 0,…,0⏟k-1 terms, νk, 0,…,0⏟n-k terms ) ⊨νk. Then the map 𝒯ν(k) ⟶ 𝒯νk ν(k)Ti ⟼ φk(-1)Ii is an algebra isomorphism by Lemma 6.5. Corollary 6.6 follows by applying this map to tensor products.

□

The representation theory of 𝒯ν

By Corollary 6.6, understanding the representation theory of 𝒯ν is the same as understanding the representation theory of the Iwahori-Hecke algebras 𝒯νi.

Let μ⊢n be a partition. A standard tableau of shape μ is a column strict tableau of shape μ and weight (1n) (i.e. every number between from 1 to n appears exactly once). Suppose P is a standard tableau of shape μ. Let cP(i) = the content of the box containing i, CP(i) = q-11-qcP(i)-cP(i+1). (6.8)

([Hoe1974, Ram1997, Wen1988]). Let G=GLn(𝔽q). Then (a) The irreducible 𝒯n-modules 𝒯nμ are indexed by partitions μ⊢n, (b) dim(𝒯nμ)=Card{standard tableau P | sh(P)=μ}, (c) Let 𝒯nμ=ℂ-span{vP | sh(P)=μ, wt(P)=(1n)}. Then IivP=q-1CP (i)vP+q-1 (1+CP(i)) vsiP where vsiP=0 if siP is not a column strict tableau.

Recall from Chapter 5, an 𝔽ˆq*-partition λ=(λ(φ1),λ(φ2),…,λ(φq-1)) is a sequence of partitions indexed by 𝔽ˆq*. Let ∣λ∣= ∣λ(φ1)∣+ ∣λ(φ2)∣+⋯+ ∣λ(φq-1)∣= total number of boxes.

Let ν=(ν1,ν2,…,νn)⊨n with νi≥0 γν as in (6.7). A standard ν-tableau Q= ( Q(φ1), Q(φ2),…, Q(φq-1) ) of shape λ is a column strict filling of λ by the numbers 1,2,3,…,n such that (a) each number appears exactly once, (b) j∈Q(φk) if sj∈Wνk. Let 𝒯ˆνλ = {standard ν-tableau Q | sh(Q)=λ}, (6.9) 𝒯ˆν = {𝔽ˆq*-partition λ | 𝒯ˆνλ≠∅} = {𝔽ˆq*-partition λ | ∣λ(φi)∣=∣νi∣}. (6.10)

Example. If ν=(3,0,1,0), then γν=φ1⊗φ1⊗φ1⊗φ3. The set 𝒯ˆν is { (
(φ1)
, ∅(φ2),
(φ3)
, ∅(φ4) )
, (
(φ1)
, ∅(φ2),
(φ3)
, ∅(φ4) )
, (
(φ1)
, ∅(φ2),
(φ3)
, ∅(φ4) )
}
,
and, for example, 𝒯ˆ ν (
(φ1)
,
(φ3)
)
= { (
1 2 3
(φ1)
, ∅(φ2),
4
(φ3)
, ∅(φ4) )
, (
1 3 2
(φ1)
, ∅(φ2),
4
(φ3)
, ∅(φ4) )
}

Let Q∈𝒯ˆνλ. Suppose sj∈Wνk so that j∈Q(φk). Write Qj = φk, (6.11) cQ(j) = the content of the box containing j in  Q(φk), (6.12) CQ(j) = q-11-qcQ(j)-cQ(j+1) (6.13)

Let ν=(ν1,ν2,…,νn)⊨n with νi≥0 and ℓ(ν)=n. Then (a) The irreducible 𝒯ν-modules 𝒯νλ are indexed by λ∈𝒯ˆν. (b) dim(𝒯νλ)=Card(𝒯ˆνλ). (c) Let 𝒯νλ=ℂ-span{vQ | Q∈𝒯ˆνλ}. Then νTivQ=q-1 Qj(-1)CQ(i) vQ+q-1Qj (-1)(1+CQ(i)) vsiQ, where vsiQ=0 if siQ is not a column strict tableau.

Proof.

Transfer the explicit action of Theorem 6.7 across the isomorphism 𝒯ν≅𝒯ν1⊗𝒯ν2⊗⋯⊗𝒯νn of Corollary 6.6.

□

The irreducible modules of ℋ1

The goal of this section is to construct the irreducible ℋ1-modules. According to Corollary 6.3 and (6.7), the map { Pairs (ν,λ), ν⊨n, νi≥0,ℓ(ν)=n,λ∈𝒯ˆν } ⟷ {Irreducibleℋ1-modules} (ν,λ) ↔ Ind𝒯νℋ1(𝒯νλ) (6.14) is a bijection.

Let W/ν be the set of minimal length coset representatives of W/Wν. Then Ind𝒯νℋ1 (𝒯νλ) = ℋ1⊗𝒯ν 𝒯νλ = ℂ-span { Tw⊗vQ  | w∈W/ν, sh (Q)=λ, wt (Q)=γν } . (6.15) Note that the map {Pairs (w,Q),w∈W/ν,Q∈Tˆνλ} ⟶ {tableau Q | sh(Q)=λ, wt(Q)=(1n)} (w,Q) ⟼ wQ (6.16) is a bijection (since w∈W/ν implies w preserves the relative magnitudes of the entries in Q(φ) for all φ). For example, under this bijection (
, (
1 3 2 4
(φ1)
,
5 6
(φ2)
,
7
(φ3)
)
)
⟷ (
2 6 4 7
(φ1)
,
3 5
(φ2)
,
1
(φ3)
)
(since 2<3 in Q(φ1) on the left side, 4<6 in Q(φ1) on the right side). Write vwQ=Tw⊗vQ. If ∣λ∣=n, then let ℋˆ1λ = {tableau Q | sh(Q)=λ, wt(Q)=(1n)}, (6.17) ℋˆ1 = { 𝔽ˆq* -partitions λ |  ∣λ∣=n } . (6.18)

Remarks. 1. In the notation of Chapter 5, ℋˆ1= {Θ-partition λ | ℋˆ1λ≠∅}. 2. The map {Pairs (ν,λ),ν⊨n,νi≥0,ℓ(ν)=n,λ∈𝒯ˆν} ⟷ ℋˆ1 (ν,λ) ↔ λ is a bijection, so by (6.14), ℋˆ1 indexes the irreducible ℋ1-modules.

Suppose Q is a tableau of shape λ and weight (1n). As in (6.11)-(6.13), if Q(φ) has the box containing j, then write Qj = φ, cQ(j) = the content of the box containing j in  Q(φ), CQ(j) = q-11-qcQ(j)-cQ(j+1).

(a) The irreducible ℋ1-modules ℋ1λ are indexed by λ∈ℋˆ1. (b) dim(ℋ1λ)=Card(ℋˆ1λ). (c) Let ℋ1λ=ℂ-span{vQ | Q∈ℋˆ1λ} as in (6.15) and (6.17). Then hvQ = Q1(h1) Q2(h2)⋯ Qn(hn)vQ, for h=diag (h1,h2,…,hn) ∈T, TivQ = { q-1vsiQ, if Qi≻ Qi+1, Qi(-1)q-1 CQ(i)vQ+ Qi(-1)q-1 (1+CQ(i)) vsiQ, if Qi= Qi+1, vsiQ, if Qi ≺Qi+1, where vsiQ=0 if siQ is not a column strict tableau.

Proof.

(a) follows from Remark 2, and (b) follows from (6.15) and (6.17).)

(c) Directly compute the action of ℋ1 on ℋ1λ= Ind𝒯νℋ1 (𝒯νλ)= ℂ-span {Tw⊗vQ | w∈W/λ∼,Q∈𝒯ˆνλ} For 1≤i<n, if ℓ(siw)<ℓ(w), then TiTw⊗vQ = Ti2Tsiw⊗ vQ = q-1Tsiw⊗ vQ+q-1hεi (-1)∑t∈𝔽q* hεi(t) hεi+1 (t-1)Tw⊗vQ = q-1Tsiw⊗vQ +q-1(wQ)i(-1) ∑t∈𝔽q* (wQ)i(t) (wQ)i+1(t-1) Tw⊗vQ Since ℓ(siw)<ℓ(w) can hold only if (wQ)i≠(wQ)i+1, the orthogonality of characters implies TiTw⊗vQ=q-1 Tsiw⊗vQ+0. (6.19) If ℓ(siw)>ℓ(w), then there are two cases:

Case 1: ℓ(siwsj)<ℓ(siw) for some sj∈Wγ∼,

Case 2: ℓ(siwsj)>ℓ(siw) for all sj∈Wγ∼.

In Case 1, TiTw⊗vQ = Tsiw⊗vQ = TsiwsjTj ⊗vQ = Tsiwsj⊗ TjvQ = Tsiwsj⊗ Qj(-1)q-1 CQ(j)vQ+ Qj(-1)q-1 (1+CQ(j)) vsjQ = Qj(-1)q-1 CQ(j)Tsiwsj ⊗vQ+Qj(-1) q-1(1+CQ(j)) Tsiwsj⊗vsjQ. (6.20) In Case 2, TiTw⊗vQ= Tsiw⊗vQ. (6.21) Make the identification of (6.16) in equations (6.19), (6.20), and (6.21) to obtain the ℋ1-action on ℋ1λ.

□

Sample Computations. If n=10 for ℋ1, then T1 v (
3 5 10 4 7
(φ1)
,
1 6 8
(φ2)
,
2 9
(φ3)
)
= v (
3 5 10 4 7
(φ1)
,
2 6 8
(φ2)
,
1 9
(φ3)
)
,
T2 v (
3 5 10 4 7
(φ1)
,
1 6 8
(φ2)
,
2 9
(φ3)
)
= q-1 v (
2 5 10 4 7
(φ1)
,
1 6 8
(φ2)
,
3 9
(φ3)
)
,
T3 v (
3 5 10 4 7
(φ1)
,
1 6 8
(φ2)
,
2 9
(φ3)
)
= -φ1(-1)q-1 v (
3 5 10 4 7
(φ1)
,
1 6 8
(φ2)
,
2 9
(φ3)
)
+0 ,
T4 v (
3 5 10 4 7
(φ1)
,
1 6 8
(φ2)
,
2 9
(φ3)
)
= φ1(-1)q q+1 v (
3 5 10 4 7
(φ1)
,
1 6 8
(φ2)
,
2 9
(φ3)
)
+φ1(-1) (q-1qq+1) v (
3 4 10 5 7
(φ1)
,
1 6 8
(φ2)
,
2 9
(φ3)
)
.

A Character Table ℋ1 for n=2: ℋ1
a b
a b
(
(φi)
)
φi(ab) φi(-ab)
(
(φi)
)
φi(ab) -φi(-ab)q-1
(
(φi)
,
(φi)
)
φi(a)φj(b)+φi(b)φj(a) 0

Notes and References

This is an excerpt of the PhD thesis Unipotent Hecke algebras: the structure, representation theory, and combinatorics by F. Nathaniel Edgar Thiem.

page history