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.

Representation theory in the G=GLn(𝔽q) case

This chapter examines the representation theory of unipotent Hecke algebras when G=GLn(𝔽q). The combinatorics associated with the representation theory of GLn(𝔽q) generalizes the tableaux combinatorics of the symmetric group, and one of the main results of this chapter is to also give a generalization of the RSK correspondence (see Section 2.3.4).

Fix a homomorphism ψ:𝔽q+→ℂ*. Recall that for any composition μ⊨n, ℋμ is a unipotent Hecke algebra (see Chapter 4). A fundamental result concerning Gelfand-Graev Hecke algebras is

([GGr1962],[Yok1968],[Ste1967]). For all n>0, ℋ(n) is commutative.

and it will follow from Theorem 5.7, via the representation theory of unipotent Hecke algebras.

The representation theory of ℋμ

Let 𝒮 be a set. An 𝒮-partition λ=(λ(s1),λ(s2),…) is a sequence of partitions indexed by the elements of 𝒮. Let 𝒫𝒮= {𝒮-partitions}. (5.1) The following discussion defines two sets Θ and Φ, so that Θ-partitions index the irreducible characters of G and Φ-partitions index the conjugacy classes of G.

Let Ln=Hom(𝔽qn*,ℂ*) be the character group of 𝔽qn*. If γ∈Lm, then let γ(r): 𝔽qmr* ⟶ ℂ* x ⟼ γ(x1+qr+q2r+⋯+qm(r-1)) Thus if n=mr, then we may view Lm⊆Ln by identifying γ∈Lm with γ(r)∈Ln. Define L=⋃n≥0Ln. The Frobenius maps are F: 𝔽‾q ⟶ 𝔽‾q x ⟼ xq and F: L ⟶ L γ ⟼ γq , where 𝔽‾q is the algebraic closure of 𝔽q.

The map {F-orbits of 𝔽‾q*} ⟶ {f∈𝔽q[t] | f is monic, irreducible, and f(0)≠0} {x,xq,xq2,…,xqk-1} ⟼ fx=∏i=1k-1(t-xqi),where xqk=x∈𝔽‾q* is a bijection such that the size of the F-orbit of x equals the degree d(fx) of fx. Let Φ={f∈ℂ[t] | f is monic, irreducible and f(0)≠0} andΘ={F-orbits in L}. (5.2) If η is a Φ-partition and λ is a Θ-partition, then let ∣η∣=∑f∈Φ d(f)∣η(f)∣ and∣λ∣= ∑φ∈Θ∣φ∣ ∣λ(φ)∣ be the size of η and λ, respectively. Let the sets 𝒫Φ and 𝒫Θ be as in (5.1) and let 𝒫nΦ={η∈𝒫Φ | ∣η∣=n} and𝒫nΘ= {λ∈𝒫Θ | ∣λ∣=n}. (5.3)

(Green [Gre1955]). Let Gn=GLn(𝔽q). (a) 𝒫nΦ indexes the conjugacy classes Kη of Gn, (b) 𝒫nΘ indexes the irreducible Gn-modules Gnλ.

Suppose λ∈𝒫Θ. A column strict tableau P=(P(φ1),P(φ2),…) of shape λ is a column strict filling of λ by positive integers. That is, P(φ) is a column strict tableau of shape λ(φ). Write sh(P)=λ. The weight of P is the composition wt(P)=(wt(P)1,wt(P)2,…) given by wt(P)i= ∑φ∈Θ∣φ∣ (numbers of i in P(φ)).

If λ∈𝒫Θ and μ is a composition, then let ℋˆμλ= {column strict tableaux P | sh(P)=λ, wt(P)=μ} (5.4) and ℋˆμ= {λ∈𝒫Θ | ℋˆμλ is not empty}. (5.5)

The following theorem is a consequence of Theorem 2.3 and a theorem proved by Zelevinsky [Zel1981-2] (see Theorem 5.5). A proof of Zelevinsky’s theorem is in Section 5.3.

The set ℋˆμ indexes the irreducible ℋμ-modules ℋμλ and dim(ℋμλ)= ∣ℋˆμλ∣.

A generalization of the RSK correspondence

For a composition μ⊨n, let Nμ be as in (4.11) and Mμ as in (4.12).

The (ℋμ,ℋμ)-bimodule decomposition ℋμ≅⨁λ∈ℋˆμ ℋμλ⊗ℋμλ implies∣Nμ∣=dim (ℋμ)=∑λ∈ℋˆμ dim(ℋμλ)2= ∑λ∈ℋˆμ ∣ℋˆμλ∣2. Theorem 5.4, below, gives a combinatorial proof of this identity.

Encode each matrix a∈Mμ as a Φ-sequence (a(f1),a(f2),…), fi∈Φ, where a(f)∈Mℓ(μ)(ℤ≥0) is given by aij(f)= highest power of f dividing aij. Note that this is an entry by entry “factorization” of a such that aij=∏f∈Φ faij(f). Recall from Section 2.3.4 the classical RSK correspondence Mℓ(ℤ≥0) ⟶ {Pairs (P,Q) of column strict tableaux of the same shape} b ⟼ (P(b),Q(b)).

For a∈Mμ, let P(a) and Q(a) be the Φ-column strict tableaux given by P(a)=(P(a(f1)),P(a(f2)),…) andQ(a)= (Q(a(f1)),Q(a(f2)),…) for fi∈Φ. Then the map Nμ ⟶ Mμ ⟶ { Pairs (P,Q) of Φ-column strict tableaux of the same shape and weight of μ } v ⟼ av ⟼ (P(av),Q(av)), is a bijection, where the first map is the inverse of the bijection in Theorem 4.2.

By the construction above, the map is well-defined, and since all the steps are invertible, the map is a bijection.

Example. Suppose μ=(7,5,3,2) and f,g,h∈Φ are such that d(f)=1, d(g)=2, and d(h)=3. Then av= ( gf2h11 h1g1 11ff2 g111 ) ∈ M
corresponds to the sequence (av(f1),av(f2),…)= ( ( 0200 0000 0012 0000 ) (f) , ( 1000 0010 0000 1000 ) (g) , ( 0100 1000 0000 0000 ) (h) ) and (P(av),Q(av))= (
2 2 4 3 4
(f)
,
1 1 3
(g)
,
1 2
(h)
)
(
1 1 3 3 3
(f)
,
1 4 2
(g)
,
1 2
(h)
)
.

Zelevinsky’s decomposition of IndUG(ψμ)

This section proves the theorem

(Zelevinsky [Zel1981-2]). Let U be the subgroup of unipotent upper-triangular matrices of G=GLn(𝔽q), μ⊨n and ψμ be as in (4.8). Then IndUG(ψμ)= ⨁λ∈ℋˆμ Card(ℋˆμλ) Gλ.

Theorem 5.3 follows from this theorem and Theorem 2.3. The proof of Theorem 5.5 is in 3 steps. (1) Establish the necessary connection between symmetric functions and the representation theory of G. (2) Prove Theorem 5.5 for the case when ℓ(μ)=1. (3) Generalize (2) to arbitrary μ. The proof below uses the ideas of Zelevinsky’s proof, but explicitly uses symmetric functions to prove the results. Specifically, the following discussion through the proof of Theorem 5.7 corresponds to [Zel1981-2, Sections 9-11] and Theorem 5.5 corresponds to [Zel1981-2, Theorem 12.1].

Preliminaries to the proof (1)

Let μ⊨n and G=Gn. The group Pμ= { ( g1* g2 ⋱ 0gℓ )  | gi∈Gμi =GLμi(𝔽q) } (5.6) has subgroups Lμ=Gμ1⊕ Gμ2⊕⋯⊕ Gμℓand Uμ= { ( Idμ1* Idμ2 ⋱ 0Idμℓ ) } , (5.7) where Idk is the k×k identity matrix. Note that Pμ=LμUμ and Pμ=NG(Uμ). The indflation map is a composition of the inflation map and the induction map, IndfLμG: R[Lμ] ⟶ R[Pμ] ⟶ R[G] χ ⟼ InfLμPμ(χ) ⟼ IndPμG(InfLμPμ(χ)), where InfLμPμ(χ): Pμ ⟶ ℂ lu ⟼ χ(l), for l∈Lμ and  u∈Uμ.

Suppose λ∈𝒫Θ and η∈𝒫Φ (see (5.3)). Let χλ be the irreducible character corresponding to the irreducible G-module Gλ and let κη be the characteristic function corresponding to the conjugacy class Kη (see Theorem 5.2), given by κη(g)= { 1, if g∈Kη, 0, otherwise, for g∈G∣η∣. Define R=⨁n≥0R[Gn] =ℂ-span{χλ | λ∈𝒫Θ} =ℂ-span{κη | η∈𝒫Φ}. The space R has an inner product defined by ⟨χλ,χν⟩ =δλν, and multiplication χλ∘χν= IndfL(r,s)Gr+s (χλ⊗χν), for λ∈𝒫rΘ, ν∈𝒫sΘ. (5.8)

For each φΘ, let {Y1(φ),Y2(φ),…} be an infinite set of variables, and let Λℂ= ⨂φ∈Θ Λℂ(Y(φ)), where Λℂ(Y(φ)) is the ring of symmetric functions in {Y1(φ),Y2(φ),…} (see Section 2.3.3). For each f∈Φ, define an additional set of variables {X1(f),X2(f),…} such that the symmetric functions in the Y variables are related to the symmetric functions in the X variables by the transform pk(Y(φ))= (-1)k∣φ∣-1 ∑x∈𝔽qk∣φ∣* ξ(x)pk∣φ∣d(fx) (X(fx)), (5.9) where ξ∈φ, fx∈Φ is the irreducible polynomial that has x as a root, and pab(X(f))=0 if ab∉ℤ≥0. Then Λℂ=⨂f∈Φ Λℂ(X(f)).

For ν∈𝒫, let sν(Y(φ)) be the Schur function and Pν(X(f);t) be the Hall-Littlewood symmetric function (as in Section 2.3.3). Define sλ=∏φ∈Θ sλ(φ) (Y(φ))and Pη=q-n(η) ∏f∈ΦPη(f) (X(f);q-d(f)), (5.10) where n(η)=∑f∈Θd(f)n(η(f)) and for a composition μ, n(μ)=∑i=1ℓ(μ)(i-1)μi. The ring Λℂ=ℂ-span {sλ | λ∈𝒫Θ} -ℂ-span{Pη | η∈𝒫Φ} has an inner product given by ⟨sλ,sν⟩ =δλν.

(Green [Gre1955],Macdonald [Mac1995]). The linear map ch: R ⟶ Λℂ χλ ⟼ sλ,for λ∈𝒫Θ κη ⟼ Pη,for η∈𝒫Φ, is an algebra isomorphism that preserves the inner product.

A unipotent conjugacy class Kη is a conjugacy class such that η(f)=∅ unless f=t-1. Let 𝒰=ℂ-span {κη | η(f)=∅, unless f=t-1} ⊆R be the subalgebra of unipotent class functions. Note that by (5.10) and Theorem 5.6, ch(𝒰)=Λℂ (X(t-1)). Consider the projection π:R→𝒰 which is an algebra homomorphism given by (πχλ)(g)= { χλ(g), if g∈G is unipotent, 0, otherwise, λ∈𝒫Θ. Then π∼=ch∘π∘ch-1:Λℂ→Λℂ(X(t-1)) is given by π∼(pk(Y(φ))) = π∼ ( (-1)k∣φ∣-1 ∑x∈𝔽qk∣φ∣* ξ(x)pk∣φ∣d(fx) (X(fx)) ) (by (5.9)) = (-1)k∣φ∣-1 ξ(1)pk∣φ∣1 (X(t-1))+0 = (-1)k∣φ∣-1 pk∣φ∣ (X(t-1)). (5.11)

The decomposition of IndUG(ψ(n)) (2)

The representation IndUG(ψ(n)) is the Gelfand-Graev module, and with Theorem 2.3, Theorem 5.7, below, proves that ℋ(n) is commutative.

Let U be the subgroup of unipotent upper-triangular matrices of G=GLn(𝔽q). Then ch(IndUG(ψ(n))) =∑λ∈𝒫nΘht(λ)=1 sλ,where ht(λ)= max{ℓ(λ(φ)) | φ∈Θ}.

Proof.

Let Ψ: R ⟶ ℂ χλ ⟼ ⟨χλ,IndUG(ψ(n))⟩ andΨ∼: Λℂ⟶ch-1 R⟶Ψℂ. (5.12) For any finite group H and γ,χ∈R[H], let 1H: H ⟶ C h ⟼ 1 ,eH=1∣H∣ ∑h∈Hh,and ⟨χ,γ⟩H= 1∣H∣∑h∈H χ(h)γ(h-1).

The proof is in six steps. (a) Ψ∼(ek(Y(1)))=δk1, where 1=1𝔽q*, (b) Ψ(χλ)=dim(e(n)Gλ) for λ∈𝒫Θ, (c) Ψ∼(fg)=Ψ∼(f)Ψ∼(g) for all f,g∈Λℂ(Y(1)), where 1=1𝔽q*. (d) Ψ∘π=Ψ, (e) Ψ∼(f(Y(φ)))=Ψ∼(f(Y(1))) for all f∈Λℂ(Y(φ)), (f) Ψ∼(sλ)=δht(λ)1.

(a) An argument similar to the argument in [Mac1995, pgs. 285-286] shows that ch-1(ek(Y(1))) =1Gk (see [HRa1999, Theorem 4.9 (a)] for details). Therefore, by Frobenius reciprocity and the orthogonality of characters, Ψ∼(ek(Y(1))) =⟨1Gk,IndUG(ψ(n))⟩= ⟨1Uk,ψ(n)⟩Uk= δk1.

(b) Since there exists an idempotent e such that Gλ≅ℂGe and IndUG(ψ(n))≅ℂGe(n), the map e(n)ℂGe ⟶ HomG(Gλ,ℂGe(n)) e(n)ge ⟼ γg: ℂGe ⟶ ℂGe(n) xe ⟼ xege(n) is a vector space isomorphism (using an argument similar to the proof of [CRe1981, (3.18)]). Thus, Ψ(χλ) = ⟨χλ,IndUG(ψ(n))⟩ = dim(HomG(Gλ,IndUG(ψ(n)))) = dim(e(n)ℂGe) = dim(e(n)Gλ).

(c) By (a), Ψ∼(er(Y(1)))Ψ∼(es(Y(1)))=δr1δs1. It therefore suffices to show that Ψ∼(er(Y(1))es(Y(1))) =δr1δs1, (since Λℂ(Y(1))= ℂ[e1(Y(1)),e2(Y(1)),…]). Suppose r+s=n and let P=P(r,s). Then Ψ∼(er(Y(1))es(Y(1)))= Ψ(IndPGn(1P))= dim(e(n)ℂGeP). Since T⊆P, eP=e(1n)eP, G=⨆v∈VUvU, and N=WT, e(n)ℂGeP=e(n) ℂGe(1n)eP=ℂ -span{e(n)we(1n)eP | w∈W}. If there exists 1≤i≤n such that w(i+1)=w(i)+1, then e(n)we(1n)= e(n)wxi,i+1 (t)e(1n)=e(n) xw(i),w(i)+1 (t)we(1n)= ψ(t)e(n)w e(1n). Therefore, e(n)we(1n)=0 unless w=w(n). If r>1 of s>1, then there exists 1≤i≤n such that xi+1,i(t)∈P(r,s), so e(n)w(n)eP= e(n)w(n)xi+1,i (t)eP=e(n) xn-i,n-i+1(t) w(n)eP=ψ(t) e(n)w(n)eP=0. In particular, dim(e(n)ℂGeP)=0. If r=s=1, then P(1,1) is upper-triangular, so e(2)w(2)eP ≠0 and dim(e(2)ℂGeP)=1, giving Ψ∼(er(Y(1))es(Y(1)))=δr1δs1.

(d) By Frobenius reciprocity, ⟨χλ,IndUnGn(ψ(n))⟩ = ⟨ResUnGn(χλ),ψ(n)⟩Un = ⟨ResUnGn(π(χλ)),ψ(n)⟩ = ⟨π(χλ),IndUnGn(ψ(n))⟩, so Ψ=Ψ∘π.

(e) Induct on n, using (c) and the identity (-1)n-1pn (Y(1))=nen (Y(1))- ∑r=1n-1 (-1)r-1pr (Y(1))en-r (Y(1)), [Mac1995, I.2.11′] to obtain Ψ∼(pn(Y(1)))=1. Note that Ψ∼(pn(Y(φ))) = Ψ∼(π(pn(Y(φ)))) = Ψ∼((-1)∣φ∣n-1p∣φ∣n(X(t-1))) = Ψ∼(π(p∣φ∣k(Y(1)))) = Ψ∼(p∣φ∣k(Y(1))) = 1 = Ψ∼(pk(Y(1))). Since Ψ∼ is multiplicative on Λℂ(Y(1)), Ψ∼(pν(Y(φ))) =1=Ψ∼(pν(Y(1))), for all partitions ν. In particular, since Ψ∼ is linear and Λℂ(Y(φ))=ℂ-span{pν(Y(φ))}, Ψ∼(f(Y(φ)))= Ψ∼(f(Y(1))), for all f∈Λℂ(Y(φ)). Note that (e) also implies that Ψ∼ is multiplicative on all of Λℂ.

(f) Note that Ψ∼(sλ)= Ψ∼(∏φ∈Θsλ(φ)(Y(φ)))= Ψ∼(∏φ∈Θsλ(φ)(Y(1)))= ∏φ∈ΘΨ∼ (sλ(φ)(Y(1))), where the last two equalities follow from (e) and (c), respectively. By definition sν(Y(1))=det(eνi′-i+j(Y(1))), so Ψ∼(sν(Y(1)))= { 1, if ℓ(ν)=1, 0, otherwise, implies ch(IndUG(ψ(n))) =∑λ∈𝒫nΘ Ψ∼(sλ)sλ =∑λ∈PSnΘht(λ)=1 sλ.

□

Decmoposition of IndUG(ψμ) (3)

Suppose λ,ν∈𝒫Θ. A column strict tableau P of shape λ and weight ν is a column strict filling of λ such that for each φ∈Θ, sh(P(φ))= λ(φ)and wt(P(φ))= ν(φ). We can now prove the theorem stated at the beginning of this section:

([Zel1981-2]) Let U be the subgroup of unipotent upper-triangular matrices of G=GLn(𝔽q), μ⊨n and ψμ be as in (4.8). Then IndUG(ψμ)= ⨁λ∈ℋˆμ Card(ℋˆμλ) Gλ.

Proof.

Note that IndUPμ(ψμ) ≅ℂPμeμ=ℂ Pμe[μ] e[μ]′, where eμ=1∣U∩Lμ∣ ∑u∈U∩Lμψμ (u-1)uand e[μ]′=1∣Uμ∣ ∑u∈Uμu. (5.13) Thus IndUPμ(ψμ) ≅ InfLμPμ (IndU∩LμLμ(ψμ)) ≅ InfLμPμ ( IndUμ1Gμ1 (ψ(μ1))⊗ IndUμ2Gμ2 (ψ(μ2))⊗⋯⊗ IndUμℓGμℓ (ψ(μℓ)) ) In particular, by the definition of multiplication in R (5.8), Γμ=ch (IndUG(ψμ)) =Γμ1Γμ2 ⋯Γμℓ,where Γμi= ∑λ∈𝒫μiΘ,ht(λ)=1 sλ. Pieri’s rule (2.10) implies that for λ∈𝒫rΘ, ν∈𝒫sΘ and ht(ν)=1, sλsν= ∑γ∈𝒫r+sΘ,∣ℋˆνγ/λ∣≠0 sγ,soΓμ= ∑λ∈𝒫Θ Kλμsλ, where Kλμ = Card { ∅=γ0⊆ γ1⊆γ2⊆ ⋯⊆γℓ= λ |  ∣ℋˆ(μi+1)γi+1/γi∣ =1 } = Card{column strict tableaux of shape λ and weight μ} = ∣ℋˆμλ∣. By Green’s Theorem (Theorem 5.6), ch is an isomorphism, so IndUG(ψμ)= ch-1(Γμ)= ∑λ∈ℋˆμ ∣ℋˆμλ∣ ch-1(sλ)= ⨁λ∈ℋˆμ Card(ℋˆμλ) Gλ.

□

A weight space decomposition of ℋμ-modules

Let μ=(μ1,μ2,…,μℓ)⊨n and let Pμ, Lμ and Uμ be as in (5.6) and (5.7). Recall that eμ=1∣U∣ ∑u∈Uψμ (u-1)u.

For a∈Mμ, let Ta=eμvaeμ with va as in (4.14). Then the map ℋ(μ1)⊗ ℋ(μ2)⊗⋯⊗ ℋ(μℓ) ⟶ ℋμ T(f1)⊗ T(f2)⊗⋯⊗ T(fℓ) ⟼ T(f1)⊕(f2)⊕⋯⊕(fℓ), for (fi)∈M(μi) is an injective algebra homomorphism with image ℒμ=eμPμeμ=eμLμeμ.

Proof.

Note that T(f1)⊗⋯⊗ T(fℓ)= 1∣U∩Lμ∣2 ∑xi,yi∈Uμi (∏i=1ℓψμ(xi-1yi-1)) x1v(f1)y1⊗ ⋯⊗xℓv(fℓ)yℓ. Since U=(Lμ∩U)(Uμ), Lμ∩U≅Uμ1×Uμ2×⋯×Uμℓ, and ψμ is trivial on Uμ, T(f1)⊕(f2)⊕⋯⊕(fℓ) = 1∣U∣2 ∑x,y∈U ψμ(x-1y-1) x(v(f1)⊕v(f2)⊕⋯⊕v(fℓ))y = 1∣U∩Lμ∣2 ∑xi,yi∈Uμi ψμ(x1-1y1-1⊕⋯⊕xℓ-1yℓ-1) e[μ]′x1v(f1) y1⊕⋯⊕xℓ v(fℓ)yℓ e[μ]′, where e[μ]′ is as in (5.13). Since Lμ⊆NG(Uμ), the idempotent e[μ]′ commutes with x1v(f1)y1⊕⋯⊕xℓv(fℓ)yℓ and T(f1)⊕(f2)⊕⋯⊕(fℓ) =e[μ]′∣L∩U∣2 ∑xi,yi∈Uμi (∏i=1ℓψμ(xi-1yi-1)) x1v(f1)y1⊕⋯⊕ xℓv(fℓ)yℓ. Consequently, the map multiplies by e[μ]′ and changes ⊗ to ⊕, so it is an algebra homomorphism. Since the map sends basis elements to basis elements, it is also injective.

□

Remark. This is the GLn(𝔽q) version of Corollary 3.5.

Let ℒμ be as in Theorem 5.8. By Theorem 5.1 each ℋ(μi) is commutative, so ℒμ is commutative and all the irreducible ℒμ-modules ℒμγ are one-dimensional. Theorem 5.3 implies that ℋˆ(μi)= {Θ-partitions λ | ∣λ∣=μi,ht(λ)=1} indexes the irreducible ℋ(μi)-modules. Therefore, the set ℒˆμ= ℋˆ(μ1)× ℋˆ(μ2)×⋯× ℋˆ(μℓ)= {γ=(γ1,γ2,…,γℓ) | γi∈ℋˆ(μi)} (5.14) indexes the irreducible ℒμ-modules. Identify γ∈ℒˆμ with the map γ:ℒμ→ℂ such that yv=γ(y)v, for all y∈ℒμ, v∈ℒμγ.

For γ∈ℒˆμ, the γ-weight space Vγ of an ℋμ-module V is Vγ= { v∈V | yv=γ (y)v, for all y∈ℒμ } . Then V≅⨁γ∈ℒˆμ Vγ.

Let λ∈𝒫Θ and γ∈ℒˆμ. A column strict tableau P of shape λ and weight γ is column strict filling of λ such that for each φ∈Θ, sh(P(φ))= λ(φ)and wt(P(φ))= ( ∣γ1(φ)∣, ∣γ2(φ)∣,…, ∣γℓ(φ)∣ ) , where ∣γi(φ)∣ is the number of boxes in the partition γi(φ) (which has length 1). Let ℋˆγλ= { P∈ℋμλ | sh (P)=λ, wt(P)=γ } .

For example, suppose λ= (
(φ1)
,
(φ2)
,
(φ3)
)
and γ= (
(φ1)
,
(φ2)
,
(φ3)
)
⊗ (
(φ1)
,
(φ3)
)
⊗ (
(φ1)
,
(φ2)
)
⊗ (
(φ2)
)
.
Then ℋˆγλ= { (
1 1 3 2 2
(φ1)
,
1 3 4
(φ2)
,
1 2
(φ3)
)
,
(
1 1 3 2 2
(φ1)
,
1 4 3
(φ2)
,
1 2
(φ3)
)
(
1 1 2 2 3
(φ1)
,
1 3 4
(φ2)
,
1 2
(φ3)
)
,
(
1 1 2 2 3
(φ1)
,
1 4 3
(φ2)
,
1 2
(φ3)
)
}
.

Let ℋμλ be an irreducible ℋμ-module and γ∈ℒˆμ. Then dim(ℋμλ)γ= Card(ℋˆγλ).

Proof.

By Theorem 2.3 and Proposition 2.2, dim((ℋμλ)γ)= ⟨Resℒμℋμ(ℋμλ),ℒμγ⟩= ⟨ResPμG(Gλ),Pμγ⟩= ⟨Gλ,IndPμG(Pμγ)⟩, where Pμγ=InfLμPμ(Lμγ). Therefore, dim((ℋμλ)γ)= cγλ,where sγ1sγ2⋯ sγℓ=∑λ∈𝒫Θ cγλsλ. Pieri’s rule (2.10) implies cγλ=∣ℋˆγλ∣.

□

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