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.

Unipotent Hecke algebras

The algebras

Important subgroups of a Chevalley group

Let G=GV be a Chevalley group defined with a 𝔤-module V as in Section 2.2.2. Recall that R+ is the set of positive roots according to some fixed set of simple roots {α1,α2,…,αℓ} of 𝔤 (Section 2.2.1). The group G contains a subgroup U given by U=⟨xα(t) | α∈R+,t∈𝔽q⟩, which decomposes as U=∏α∈R+Uα, whereUα= ⟨xα(t) | t∈𝔽q⟩, with uniqueness of expression for any fixed ordering of the positive roots [Ste1967, Lemma 18]. For each α∈R+, the map Uα ⟶∼ 𝔽q+ xα(t) ⟼ t is a group homomorphism.

For α∈R, define the maps sα: 𝔥* ⟶ 𝔥* γ ⟼ γ-γ(Hα)α, (3.1) sα: 𝔥 = Z(𝔤)⊕𝔥s ⟶ 𝔥 H+Hβ ⟼ H+Hβ-β(Hα)Hα, for β∈R. (3.2)

The Weyl group of G is W=⟨sα | α∈R⟩ and has a presentation given by W= ⟨ s1,s2,…,sℓ  | si2=1, (sisj)mij =1,1≤i≠j≤ℓ ⟩ ,mij∈ℤ>0, si=sαi. If w=si1si2⋯sir with r minimal, then the length of w is ℓ(w)=r.

Let 𝔥ℤ be as in (2.3). If q>3, then the subgroup T= ⟨ hH(t) |  H∈𝔥ℤ,t∈𝔽q* ⟩ has its normalizer in G given by N= ⟨ wα(t),h |  α∈R,h∈T,t∈𝔽q* ⟩ ,where wα(t)= xα(t)x-α (-t-1)xα(t). If α∈R, then hHα(t)=wα(t)wα(1)-1. Write hα(t)=hHα(t) and hi(t)=hαi(t).

There is a natural surjection from N onto the Weyl group W with kernel T given by π: N ⟶ W wα(t) ⟼ sα, for α∈R,t∈𝔽q*, h ⟼ 1, for h∈T. (3.3) Suppose v∈N. Then for each minimal expression π(v)= si1si2 ⋯sir, with ℓ(π(v)) =r, there is a unique decomposition of v as v=v1v2⋯ vrvT, where vk= wik(1)  and vT∈T. (3.4) Write ξi=wi(1). (3.5)

Unipotent Hecke algebras

Let G be a finite Chevalley group. Fix a nontrivial homomorphism ψ:𝔽q+→ℂ*. If μ: R+ ⟶ 𝔽q α ⟼ μα satisfies μα=0  for all α not simple, (3.6) then the map ψμ: U ⟶ ℂ* xα(t) ⟼ ψ(μαt) (3.7) is a linear character of U. In fact, with the exception of a few degenerate special cases of G (which can be avoided if q>3), all linear characters of U are of this form [Yok1969, Theorem 1].

The unipotent Hecke algebra ℋ(G,U,ψμ) is ℋμ=EndℂG (IndUG(ψμ)). (3.8) Using the anti-isomorphism (2.2), view ℋμ as the subset of ℂG ℋμ=eμℂG eμ,where eμ=1∣U∣ ∑u∈Uψμ (u-1)u. (3.9)

The choices μ and ψ

This section assumes all linear characters of U are of the form ψμ for some nontrivial homomorphismψ:𝔽q+→ℂ* and μ as in (3.6).

The group T normalizes Uα, since hxα(t)h-1 =xα(α(h)t), for α∈R+,t∈ 𝔽q,h∈T,α(h) ∈𝔽q*. Thus, if χ:U→ℂ* is a linear character, then hχ: U ⟶ ℂ* xα(t) ⟼ χ(hxα(t)h-1) is a linear character for every h∈T.

Suppose χ:U→ℂ* is a linear character. For every h∈T, IndUG(χ)= IndUG(hχ).

Proof.

Recall that IndUG(hψμ) (g)=1∣U∣ ∑x∈Gxgx-1∈U hψμ(xgx-1)= 1∣U∣ ∑x∈Gxgx-1∈U ψμ(hxgx-1h-1). Since T normalizes U, the sum over all x∈G such that xgx-1∈U is the same as the sum over hx∈G such that hxgx-1h-1∈U. Thus, IndUG(hψμ) (g)=1∣U∣ ∑x′∈Gx′gx′-1∈U ψμ(x′gx′-1) =IndUG(ψμ)(g).

□

The type of a linear character χ:U→ℂ* is the set J⊆{α1,α2,…,αℓ} such that χ(xαi(t))≠ 1 for all t∈𝔽qif and only if αi∈J. A unipotent Hecke algebra ℋ(G,U,χ) has type J if χ has type J.

(a) Fix a nontrivial homomorphism ψ:𝔽q+→ℂ*. If ψ′:𝔽q+→ℂ* is a homomorphism, then there exists k∈𝔽q such that ψ′(t)= ψ(kt), for all t∈𝔽q+. (b) The linear characters χ:U→ℂ* and hχ:U→ℂ* have the same type for any h∈T. (c) Let J⊆{α1,α2,…,αℓ} and 𝒮J={type J linear characters of U}. Then the number of T-orbits of 𝒮J is ∣ZJ∣(q-1)∣J∣∣T∣, where ZJ= { h∈T | α(h) =1,for α∈J } . (d) The number of distinct (nonisomorphic) type J unipotent Hecke algebras is at most ∣ZJ∣(q-1)∣J∣∣T∣.

Proof.

(a) The map 𝔽q+ ⟶ Hom(𝔽q+,ℂ*) k ⟼ ψk: 𝔽q+ ⟶ ℂ* t ⟼ ψ(kt) is a group homomorphism, and the kernel is trivial because ψ is nontrivial. Since ∣Hom(𝔽q+,ℂ)∣=q, the map is also surjective.

(b) Since Uα≅𝔽q+, the restriction of χ to Uα gives a linear character of 𝔽q+. Part (a) implies that for every α∈R+ there exists kα∈𝔽q such that χ(xα(t))= ψ(kαt) Furthermore, if χ has type J, then kα≠0 if and only if α∈J. Write χ=ψ(k1,…,kℓ) where ki=kαi. Since hxα(t)h-1=xα(α(h)t) for h∈T, hχ= ψ(α1(h)k1,…,αℓ(h)kℓ), and α(h)kα≠0 if and only if kα≠0 if and only if α∈J. Thus, the action of T preserves the type of χ.

(c) Suppose a group K acts on a set 𝒮. Then by [Isa1994, Theorem 4.18] the number of orbits of the K action is 1∣K∣ ∑g∈KCard {s∈𝒮 | g(s)=s}. In this case, K=T acts on the set 𝒮=𝒮J= { ψ(k1,k2,…,kℓ)  | ki=0, unless αi∈J } . Furthermore, hψ(k1,k2,…,kℓ) =ψ(k1,k2,…,kℓ) if and only ifαi(h)=1  for all αi∈J. Finally, ∣𝒮J∣=(q-1)∣J∣.

□

Examples. 1. If J=∅, then ∣J∣=0 and ∣ZJ∣=∣T∣, so there is a unique unipotent Hecke algebra of type J; in this case, ψμ is trivial and ℋμ is the Yokonuma algebra. 2. A character is in general position if it has type J={α1,α2,…,αℓ}. In this case, ZJ is the center of G, and ∣J∣=ℓ, so the number of type J unipotent Hecke algebras is at most ∣Z(G)∣(q-1)ℓ∣T∣ .

A natural basis

The group G has a double-coset decomposition G=⨆v∈NUvU, [Ste1967, Theorem 4 and B=UT] (3.10) and if Nμ = {v∈N | eμveμ≠0} = { v∈V | u,vuv-1 ∈U implies ψμ(u) =ψμ(vuv-1) } (3.11) then the set {eμveμ | v∈Nμ} is a basis for ℋμ [CRe1981, Prop. 11.30].

Theorem 3.7 gives a set of relations similar to those of the Yokonuma algebra (Example 1, below) for evaluating the product (eμueμ) (eμveμ), with u,v∈Nμ in any unipotent Hecke algebra ℋμ.

Examples.

1. The Yokonuma Hecke algebra. If μα=0 for all positive roots α, then ψμ=1 is the trivial character and N1=N. Let Tv=e1ve1 for v∈N, with Ti=Tξi (ξi as in (3.5)) and TH(t)=ThH(t). If v∈N has a decomposition v=v1v2⋯vrVT (as in (3.4)), then Tv=Ti1Ti2⋯ TirTvT(See Chapter 6). Thus, the Yokonuma algebra ℋ1 has generators Ti, Th for 1≤i≤ℓ, h∈T (see [Yok1969-2]) with relations, Ti2 = q-1THαi (-1)+q-1 ∑t∈𝔽q* THαi (t-1)Ti, 1≤i≤ℓ, TiTjTi⋯ ⏟mij terms = TjTiTj⋯ ⏟mij terms , (sish)mij=1, TiTh = TsijTi, h∈T, ThTk = Thk, h,k∈T. These relations give an “efficient” way to compute arbitrary products (e1ue1)(e1ve1) in ℋ1. There is a surjective map from the Yokonuma algebra onto the Iwahori-Hecke algebra that sends Th↦1 for all h∈T. “Setting Th=1” in the Yokonuma algebra relations recovers relations for the Iwahori-Hecke algebra, Ti2=q-1+ q-1(q-1) Ti, TiTj⋯ ⏟mij terms = TjTi⋯ ⏟mij terms . Furthermore, there is a surjective map from the Iwahori Hecke algebra onto the Weyl group given by mapping Ti↦si and q↦1. Thus, by “setting Ti=si and q=1” we retrieve the Coxeter relations of W, si2=1, sisjsj⋯ ⏟mij terms = sjsisj⋯ ⏟mij terms . For a more detailed discussion of the Yokonuma algebra, see Chapter 6.

2. The Gelfand-Graev Hecke algebra. By definition, if μα≠0 for all simple roots α, then ψμ is in general position. In this case, the Gelfand-Graev character IndUG(ψμ) is multiplicity free as a G-module ([Yok1968],[Ste1967, Theorem 49]). The corresponding Hecke algebra ℋμ is therefore commutative. However, decomposing the product (eμueμ)(eμveμ) into basis elements is more challenging than in the Yokonuma case [Cha1976, Cur1988, Rai2002].

Parabolic subalgebras of ℋμ

Let ψμ:U→G be as in (3.7). Fix a subset J⊆{α1,α2,…,αℓ} such that if μαi≠0, then  αi∈J. For example, if ψμ is in general position, then J={α1,α2,…,αℓ}, but if ψμ is trivial, then J could be any subset.

Let WJ=⟨si∈W | αi∈J⟩, PJ=⟨U,T,WJ⟩ andRJ=ℤ-span {αi∈J}∩R. Then PJ has subgroups LJ=⟨T,WJ,Uα | α∈RJ⟩ andUJ=⟨Uα | α∈R+-RJ⟩ (3.12) (a Levi subgroup and the unipotent radical of PJ, respectively). Note that UJLJ=PJ, UJ∩LJ=1,and, in fact, PJ=UJ⋊LJ.

Define the idempotents of ℂU, eμJ=1∣LJ∩U∣ ∑u∈LJ∩U ψμ(u-1)u andeJ′= 1∣UJ∣ ∑u∈UJu, (3.13) so that eμ=eμJeJ′.

The group homomorphisms PJ ⟶ LJ lu ⟼ l and PJ ⟶ G lu ⟼ lu for l∈LJ,u∈UJ, induce maps InfLJPJ: {LJ-modules} ⟶ {PJ-modules} M ⟼ eJ′M, IndPJG: {PJ-modules} ⟶ {G-modules} M′ ⟼ ℂG⊗ℂPJM′ whose composition is the map IndfLJG. Note that in the special case when ℂLJe is an irreducible LJ-module with corresponding idempotent e, then IndfLJG: {LJ-modules} ⟶ {G-modules} ℂLJe ⟼ ℂGeeJ′.

The map ψμ:U→ℂ* restricts to a linear character ResU∩LJU(ψμ):LJ∩U→ℂ*. To make the notation less heavy-handed, write ψμ:LJ∩U→ℂ*, for ResU∩LJU(ψμ).

Let ψμ be as in (3.7). Then IndUG(ψμ)≅ IndfLJG (IndU∩LJLJ(ψμ)).

Proof.

Recall IndUG(ψμ)≅ℂGeμ. On the other hand, IndU∩LJLJ (ψμ)≅ℂ LJeμJimplies IndfLJG (IndU∩LJLJ(ψμ)) ≅ℂGeμJeJ′, where eμJ is as in (3.13). But eμJeJ′=eμ, so IndUG(ψμ)≅ ℂGeμ≅ ℂeμJeJ′≅ IndfLJG(IndU∩LJLJ(ψμ)).

□

The map θ: EndℂLJ(IndU∩LJLJ(ψμ)) ⟶ ℋμ eμJveμJ ⟼ eμveμ, for v∈LJ∩Nμ, is an injective algebra homomorphism.

Proof.

Let v∈N∩LJ. Since eμJveμJ∈ℂLJ, eJ′∈ℂUJ and LJ∩UJ=1, eμJveμJ=0 if and only ifeJ′ eμJveμJ=0. Because LJ normalizes UJ, both eμJ and v commute with eJ′. Therefore, eμJveμJ=0 if and only ifeJ′eμJ veJ′eμJ= eμveμ=0, and {eμJveμJ≠0} if and only ifv∈Nμ∩LJ. Consequently, θ is both well-defined and injective.

Consider θ(eμJueμJ) θ(eμJveμJ)= eμueμ eμveμ= eμJeJ′u eμJeJ′v eJ′eμJ. Since u commutes with eJ′, θ(eμJueμJ) θ(eμJveμJ) = eμJeJ′u eμJveJ′ eμJ = eμueμJv eμ = θ(eμJueμJveμJ), and so θ is an algebra homomorphism.

□

Write ℒJ=θ (EndℂLJ(IndU∩LJLJ(ψμ))) ⊆ℋμ (3.14) The ℒJ are “parabolic” subalgebras of ℋμ in that they have a similar relationship to the representation theory of ℋμ as parabolic subgroups PJ have with the representation theory of G.

Weight space decompositions for ℋμ-modules

An important special case of Theorem 3.4 is when J=Jμ= {αi∈{α1,α2,…,αℓ} | μαi≠0}, so that ψμ has type Jμ. Write Lμ=LJμ, Wμ=WJμ, etc.

The algebra ℒμ is a nonzero commutative subalgebra of ℋμ.

Proof.

As a character of U∩Lμ, ψμ is in general position, so IndLμ∩ULμ(ψμ) is a Gelfand-Graev module and ℒμ is a Gelfand-Graev Hecke algebra (and therefore commutative).

□

Since ℒμ is commutative, all the irreducible modules are one-dimensional; let ℒˆμ be an indexing set for the irreducible modules of ℒμ. Suppose V is an ℋμ-module. As an ℒμ-module, V≅⨁γ∈ℒˆμ VγwhereVγ= {v∈V | xv=γ(x)v,x∈ℒμ}. If γ∈ℒˆμ, then Vγ is the γ-weight space of V, and V has a weight γ if Vγ≠0. See Chapter 6 for an application of this decomposition.

Examples 1. In the Yokonuma algebra ψμ=1, J1=∅ and ℒ1=e1ℂTe1. 2. In the Gelfand-Graev Hecke algebra case, Jμ={α1,α2,…,αℓ} and ℒμ=ℋμ (confirming, but not proving, that ℋμ is commutative).

Multiplication of basis elements

This section examines the decomposition of products in terms of the natural basis (eμueμ) (eμveμ)= ∑v′∈Nμ cuvv′ (eμv′eμ). In particular, Theorem 3.7, below, gives a set of braid-like relations (similar to those of the Yokonuma algebra) for manipulating the products, and Corollary 3.9 gives a recursive formula for computing these products.

Chevalley group relations

The relations governing the interaction between the subgroups N, U, and T will be critical in describing the Hecke algebra multiplication in the following section. They can all be found in [Ste1967].

The subgroup U=⟨xα(t) | α∈R+,t∈𝔽q⟩ has generators {xα(t) | α∈R+,t∈𝔽q}, with relations xα(a) xβ(b) xα(a)-1 xβ(b)-1 = ∏γ=iα+jβ∈R+i,j∈ℤ>0 xγ(zγaibj), (U1) xα(a) xα(b) = xα(a+b), (U2) where zγ∈ℤ depends on i,j,α,β, but not on a,b∈𝔽q [Ste1967]. The zγ have been explicitly computed for various types in [Dem1965, Ste1967] (See also Appendix A).

The subgroup N has generators {ξi,hH(t) | i=1,2,…,ℓ,H∈𝔥ℤ,t∈𝔽q*}, with relations ξi2 = hi(-1), (N1) ξiξjξiξj⋯ ⏟mij terms = ξjξiξjξi⋯ ⏟mij terms , where (sisj)mij =1 in W, (N2) ξihH(t) = hsi(H) (t)ξi, (N3) hH(a) hH(b) = hH(ab), (N4) hH(a) hH′(b) = hH′(b) hH(a), for H,H′∈𝔥, (N5) hH(a) hH′(a) = hH+H′(a), for H,H′∈𝔥, (N6) hH1(t1) hH2(t2)⋯ hHk(tk)=1, if t1λj(H1)⋯ tkλj(Hk)=1  for all 1≤j≤n, (N7) where λj:𝔥→ℂ depends on V as in (2.6).

The double-coset decomposition of G (3.10) implies G=⟨U,N⟩. Thus, G is generated by {xα(a),ξi,hH(b) | α∈R+,a∈𝔽q,i=1,2,…,ℓ,H∈𝔥ℤ,b∈𝔽q*} with relations (U1)-(N7) and ξixα(t) xi-1 = xsi(α) (ciαt), where ciα= ±1 (ciαi =-1) (UN1) hxα(b)h-1 = xα(α(h)b), for h∈T, (UN2) ξixi(t) ξi = xi(t-1) hi(t-1) ξixi(t-1), where xi(t)=xαi (t) and t≠0, (UN3) where for α∈R and hH(t)∈T, α(hH(t))= tα(H). (3.15)

Fix a ψμ:U→ℂ* as in (3.7). For k∈𝔽q, let eα(k)=1q ∑t∈𝔽qψ (-μαkt)xα (t)with the convention eα=eα(1). (3.16) Note that for any given ordering of the positive roots, the decomposition U=∏α∈R+Uα implieseμ=∏α∈R+ eα. (3.17) In particular, given any α∈R+, we may choose the ordering of the positive roots to have eα appear either first or last. Therefore, since eα is an idempotent, eμeα=eμ= eαeμ. (3.18)

If w=si1si2⋯sir∈W with r minimal, then let Rw = {α∈R+ | w(α)∈R-} = { αir, sir (αir-1), …,sirsir-1 ⋯si2(αi1) } , (3.19) where the second equality is in [Bou2002, VI.1, Corollary 2 of Proposition 17].

Let v∈N, and let w=π(v) (with π:N→W as in (3.3)). ξieα (k)ξi-1 = esiα (ciαk), for α∈R+, 1≤i≤n-1, (E1) veαv-1 = ewα, for α∉Rw, v∈Nμ, (E2) heα(k) h-1 = eα(kα(h)-1), for h∈T, (E3) eμxα(t) = ψ(μαt)eμ= xα(t)eμ. (E4)

Proof.

(E1) Using relation (UN1), we have ξieα(k) ξi-1 = 1q∑t∈𝔽q ψ(-μαkt) ξixα(t) ξi-1 = 1q∑t∈𝔽q ψ(-μαkt) xsiα (ciαt) = 1q∑t′∈𝔽q ψ(-μαciαkt′) xsiα(t′) = esiα(ciαk). (E2) Suppose α∉Rw. Since v∈Nμ, ψ(μαt) = ψμ(xα(t)) = ψμ(vxα(t)v-1) = ψμ(xwα(kt)) (by (UN1)) = ψ(μwαkt), for some k∈ℤ≠0. In particular, μα=kμwα and we may conclude veαv-1= 1q∑t∈𝔽q ψ(-μαt) xwα(kt)= 1q∑t′∈𝔽q ψ(-μαk-1t′) xwα(t′)= ewα. (E3) Since hxα(t)h-1=xα(α(h)t), we have heα(k)h-1= 1q∑t∈𝔽qψ (-kt)xα(α(h)t) =∑t∈𝔽qψ (-ktα(h)-1) xα(t)=eα (kα(h)-1). (E4) Note that eαxα(t) = 1q∑a∈𝔽q ψ(-μαa) xα(a)xα(t) = 1q∑a∈𝔽q ψ(-μαa)xα (a+t) = 1q∑a′∈𝔽q ψ(-μα(a′-t)) xα(a′) = 1q∑a′∈𝔽q ψ(-μαa′)ψ (μαt)xα(a′) = ψ(μαt)eα. Therefore, by (3.18), eμxα(t)=eμeαxα(t)=ψ(μαt)eμ.

□

Local Hecke algebra relations

Let u=u1u2⋯uruT∈N decompose according to si1si2⋯sir∈W. For 1≤k≤r define constants ck=±1 and roots βk∈R+ by the equation xβk(ckt)= (uk+1⋯ur)-1 xαik(t) (uk+1⋯ur). (3.20) Note that Rπ(u)={β1,β2,…,βr} (see (3.19)). Define fu∈𝔽q[y1,y2,…,yr] by fu=- μβ1c1β1(uT)y1- μβ2c2β2(uT)y2-⋯- μβrcrβr(uT)yr (3.21) and for k=1,2,…,r, let uk(t)=ξik (t),where ξi(t)=ξi xi(t). (3.22)

Let u=u1u2⋯uruT, v=v1v2⋯vsvT∈Nμ decompose according to si1si2⋯sir∈W and sj1sj2⋯sjs∈W, respectively, as in (3.4). Then (a)   (eμueμ) (eμveμ)= 1qr∑t∈𝔽qr (ψ∘fμ)(t) eμ(u1(t1)u2(t2)⋯ur(tr)) (v1v2⋯vs) heμ, where h=vTv-1uTv∈T. (b) The following local relations suffice to compute the product (eμueμ)(eμveμ). ∑t∈𝔽q (ψ∘f)(t) ξi(t)ξi = (ψ∘f)(0) ξi2+ ∑t∈𝔽q* (ψ∘f)(t) xi(t-1) ξihi(t) xi(t-1), (ℋ1) ξixα(t) = xsi(α) (ciαt)ξi, (ℋ2) xα(t)h = hxα(α(h)-1t), (ℋ3) eμxα(t) = ψ(μαt)eμ= xα(t)eμ, (ℋ4) (ψ∘f)(t) (ψ∘g)(t) = (ψ∘(f+g))(t), for f,g∈𝔽q [y1±1,…,yr±1] ,t∈𝔽qr, (ℋ5) hα(t)ξi = ξihsi(α) (t), (ℋ6) ξi(a)xα(b) = ∏γ=mαi+nα∈R+m,n≥0 xsiγ (cisi(γ)zγambn) ξi(a),where  α≠αi, (ℋ7) ∑a∈𝔽qΦ (a)ξi(a) xi(b) = ∑a∈𝔽qΦ (a-b)ξi(a), for some map Φ: 𝔽q→ℂG, (ℋ8) hα(a) hα(b) = hα(ab), (ℋ9) ξiξjξiξj⋯ ⏟mij terms = ξjξiξjξi⋯ ⏟mij terms , where mij  is the order of sisj  in W. (ℋ10)

Proof.

(a) Order the positive roots so that by (3.17) eμueμveμ = eμu (∏α∉Rweα) eβ1eβ2⋯ eβrveμ (definition βk) = eμ(∏α∉Rwewα) ueβ1eβ2⋯ eβrveμ (Lemma 3.6, E2) = eμueβ1 eβ2⋯eβr veμ(Lemma 3.6, E4) = eμu1u2⋯ uruTeβ1 eβ2⋯eβr veμ = eμu1u2⋯ur eβ1(μβ1β1(uT)) eβ2(μβ2β2(uT))⋯ eβr(μβrβr(uT)) uTveμ(Lemma 3.6, E3) = eμ u1eαi1(uβ1c1β1(uT)) u2eαi2(uβ2c2β2(uT))⋯ ureαir(uβrcrβr(uT)) uTveμ(Lemma 3.6, E1) = eμ u1eαi1(uβ1c1β1(uT)) u2eαi2(uβ2c2β2(uT))⋯ ureαir(uβrcrβr(uT)) v1⋯vsvT v-1uTveμ = eμqr ∑t1,…,tr∈𝔽q ψ(-μβ1c1t1β1(uT)) u1(t1)⋯ ψ(-μβrcrtrβr(uT)) ur(tr) v1⋯vsheμ (definition eα) = 1qr∑t∈𝔽qr (ψ∘fu)(t) eμu1(t1)⋯ ur(tr)v1⋯ vsheμ,(by  (ℋ5)) where h=vTv-1uTv∈T, as desired.

(b) First, note that these relations are in fact correct (though not necessarily sufficient): (ℋ1) comes from (UN3); (ℋ2) comes from (UN1); (ℋ3) comes from (UN2); (ℋ4) comes from (E4); (ℋ5) comes from the multiplicativity of ψ; (ℋ6) comes from (N3); (ℋ7) comes from (U1) and (UN1); (ℋ8) comes from (U2); (ℋ9) is (N4); and (ℋ10) is (N2). It therefore remains to show sufficiency.

By (a) we may write (eμueμ) (eμveμ) =1qr ∑t∈𝔽qr (ψ∘f)(t) eμu1(t1) ⋯ur(tr) v1⋯vsheμ for some f∈𝔽q[y1,…,yr] and h∈T. Say tk is resolved if the only part of the sum depending on tk is (ψ∘f). The product is reduced when all the tk are resolved. I will show how to resolve tr and the result will follow by induction.

Use relation (ℋ2) to define the constant d and the root γ∈R by (v1v2⋯vs)-1 xαir(t) (v1v2⋯vs)= xγ(dt) (where ℓ(π(v)) =s). (3.23) There are two possible situations:

Case 1. γ∈R+,

Case 2. γ∈R-.

In Case 1, (eμueμ) (eμveμ) = 1qr∑t∈𝔽qr (ψ∘f)(t) eμu1(t1)⋯ urxir(tr)→ v1⋯vsheμ (by (a)) = 1qr∑t∈𝔽qr (ψ∘f)(t) eμu1(t1)⋯ ur-1(tr-1) urv1⋯vs xγ(dtr)→ heμ(by (ℋ2)) = 1qr∑t∈𝔽qr (ψ∘f)(t) eμu1(t1)⋯ ur-1(tr-1) urv1⋯vsh xγ(dγ(h)-1tr)eμ_ (by (ℋ3)) = 1qr∑t∈𝔽qr (ψ∘f)(t) eμu1(t1)⋯ ur-1(tr-1) urv1⋯vsh ψ(μγdγ(h)-1tr)_ eμ (by (ℋ4)) = 1qr∑t∈𝔽qr (ψ∘f)(t) eμu1(t1)⋯ ur-1(tr-1) urv1⋯vsh (ψ∘μγdγ(h)-1yr)(tr)← eμ = 1qr∑t∈𝔽qr (ψ∘g)(t) eμu1(t1)⋯ ur-1(tr-1) urv1⋯vsheμ, (by (ℋ5)) where g=f+μγdγ(h)-1yr. We have resolved tr in Case 1.

In Case 2, γ∈R-, so we can no longer move xir(tr) past the vj. Instead, (eμueμ) (eμveμ) = eμqr ∑t∈𝔽qr (ψ∘f)(t)_ u1(t1)⋯ ur-1(tr-1) urxir(tr) urur-1v1⋯ vsheμ = eμqr ∑t′∈𝔽qr-1 u1(t1)⋯ ur-1(tr-1) ∑tr∈𝔽q (ψ∘f)(t′,tr) urxir(tr)ur_ ur-1v1⋯ vsheμ = eμqr ∑t′∈𝔽qr-1 u1(t1)⋯ ur-1(tr-1) (ψ∘f)(t′,0) ur2ur-1_ v1⋯vsheμ (by (ℋ1)) + eμqr ∑t′∈𝔽qr-1 u1(t1)⋯ ur-1(tr-1) ∑tr∈𝔽q* (ψ∘f)(t′,tr) xir(tr-1) hir(tr-1) urxir(tr-1)→ ur-1 v1⋯vsheμ = eμqr ∑t′∈𝔽qr-1 u1(t1)⋯ ur-1(tr-1) (ψ∘f)(t′,0)← ur v1⋯vsheμ + eμqr ∑t′∈𝔽qr-1 u1(t1)⋯ ur-1(tr-1) ∑tr∈𝔽q* (ψ∘g)(t′,tr) xir(tr-1) hir(-tr)→ v1⋯vsheμ, (by (ℋ2,ℋ3,ℋ4)) where g=f-μγdγ(h)-1yr-1 (same as in the analogous steps in Case 1). = eμqr ∑t′∈𝔽qr-1 (ψ∘f)(t′,0) u1(t1)⋯ ur-1(tr-1) ur v1⋯vsheμ + eμqr ∑t′∈𝔽qr-1 u1(t1)⋯ ur-1(tr-1) ∑tr∈𝔽q* (ψ∘g)(t′,tr)xir(tr-1)← v1⋯vshγ (-tr)heμ,  (by (ℋ6)) = eμqr ∑t′∈𝔽qr-1 (ψ∘f)(t′,0) u1(t1)⋯ ur-1(tr-1) ur v1⋯vsheμ + eμqr ∑t′∈𝔽qr-1tr∈𝔽q* (ψ∘φ(g)) (t′,tr) (∏β∈R+xβ(aβ(t,tr))←) u1(t1)⋯ ur-1(tr-1) v1⋯vsh′eμ (by (ℋ7,ℋ8)) where φ:𝔽q[y1,…,yr]→𝔽q[y1,…,yr] catalogues the substitutions to g due to (ℋ8), the aβ(y1,y2,…,yr-1)∈𝔽q[y1,…,yr-1,yr] are determined by repeated applications of (ℋ7) and (ℋ8), and h′=hγ(-tr)h∈T. = 1qr ∑t′∈𝔽qr-1 (ψ∘f) (t′,0) eμ u1(t1)⋯ ur-1(tr-1) urv1⋯vsheμ +1qr∑t′∈𝔽qr-1tr∈𝔽q* (ψ∘φ(g)) (t′,tr)eμ (∏β∈R+ψ(μβaβ(t,tr))←) u1(t1)⋯ ur-1(tr-1) v1⋯vsh′eμ (by (ℋ4)) = 1qr ∑t′∈𝔽qr-1 (ψ∘f) (t′,0) eμ u1(t1)⋯ ur-1(tr-1) urv1⋯vsheμ +1qr∑t′∈𝔽qr-1tr∈𝔽q* (ψ∘g2) (t′,tr)eμ u1(t1)⋯ ur-1(tr-1) v1⋯vsh′eμ (by (ℋ5)) where g2=φ(g)+∑β∈R+μβaβ(y1,…,yr-1,yr-1). Now tr is resolved for Case 2, as desired.

□

(Resolving tk). Let u=u1u2⋯uk∈N decompose according to si1si2⋯sik (with uT=1). Suppose v∈N and f∈𝔽q[y1,y2,…,yk]. Define γ∈R and d∈ℂ by the equation v-1xik(t)v=xγ(dt). Then Case 1 If ℓ(π(ukv))>ℓ(π(v)), then ∑t∈𝔽qk (ψ∘f)(t) eμu1(t1)⋯ uk(tk)veμ= ∑t∈𝔽qk (ψ∘(f+μγdcγyk_)) (t)eμu1(t1) ⋯uk-1(tk-1) ukv_eμ. Case 2 If ℓ(π(ukv))<ℓ(π(v)), then ∑t∈𝔽qk (ψ∘f)(t) eμu1(t1)⋯ uk(tk)veμ = ∑t∈𝔽qk,tk=0_ (ψ∘f)(t)eμ u1(t1)⋯ uk-1(tk-1) ukv_eμ + ∑t∈𝔽qk,tk∈𝔽q*_ (ψ∘(φk(f)-μγdyk-1_)) (t)eμ u1(t1)⋯ uk-1(tk-1) hik(tk-1)v_eμ, where φk:𝔽q[yq±1,…,yk±1]→𝔽q[y1±1,…,yk±1] is given by ∑t∈𝔽qktk∈𝔽q* (ψ∘f)(t)eμ u1(t1)⋯ uk-1(tk-1) xik(tk-1)←= ∑t∈𝔽qktk∈𝔽q* (ψ∘φk(f)_) (t)eμu1(t1) ⋯uk-1(tk-1).

Proof.

This Lemma puts v in the place of uTv in the proof of Theorem 3.7, (b), and summarizes the steps taken in Case 1 and Case 2.

□

Global Hecke algebra relations

Fix u=u1u2⋯uruT∈Nμ, decomposed according si1si2⋯sir∈W (see (3.4)). Suppose v′∈Nμ and let v=uTv′.

For 0≤k≤r, let τ=(τ1,τ2,…,τr-k) be such that τi∈{+0,-0,1}, where +0, -0, and 1 are symbols. If τ has r-k elements, then the colength of τ is ℓ∨(τ)=k. For example, if r=10 and τ=(-0,1,+0,+0,1,1), then ℓ∨(τ)=4. For i∈{+0,-0,1}, let (i,τ)= (i,τ1,τ2,⋯,τr-k). By convention, if ℓ∨(τ)=r, then τ=∅.

Suppose ℓ∨(τ)=k. Define Ξτ(u,v)= 1qr∑t∈𝔽qτ (ψ∘fτ)(t) eμu1(t1)⋯ uk(tk)vτ (t)eμ, (3.24) where 𝔽qτ = { t∈𝔽qr |  for k<i≤r, if τi-k=+0, then ti∈𝔽q, if τi-k=-0, then ti=0, if τi-k=1, then ti∈𝔽q*. } ; (3.25) vτ(t) = hik+1 (tk+1)τ1 uk+11-τ1⋯ hir (tr)τr-k ur1-τr-kv, (3.26) with +0=-0=0∈ℤ, 1=1∈ℤ in (3.26); and fτ is defined recursively by f∅=fu = -μβ1c1β1(uT)y1 -μβ2c2β2(uT)y2 -⋯ -μβrcrβr(uT)yr ,(as in (3.21)), (3.27) f(i,τ) = { fτ+μγτ dτyk, if i=±0, φk(fτ)- μγτdτ yk-1, if i=1, (3.28) where (vτ)-1xαik(t)vτ=xγτ(dτt) and the map φk is as in Lemma 3.8, Case 2.

Remarks. 1. By (3.24) and Theorem 3.7 (a), Ξ∅(u,v)=(eμueμ)(eμv′eμ) (recall, v=uTv′). 2. If ℓ∨(τ)=0 so that τ is a string of length r, then (a) Ξτ(u,v)=1qr∑t∈𝔽qτ(ψ∘fτ)(t)eμvτeμ has no remaining factors of the form uk(tk), (b) Ξτ(u,v)=0 unless vτ(t)∈Nμ for some t∈𝔽q.

The following corollary gives relations for expanding Ξτ(u,v) (beginning with Ξ∅(u,v)) as a sum of terms of the form Ξτ′ with ℓ∨(τ′)=ℓ∨(τ)-1. When each term has colength 0 (or length r), then we will have decomposed the product (eμueμ)(eμv′eμ) in terms of the basis elements of ℋμ.

In summary, while we compute fτ recursively by removing elements from τ, we compute the product (eμueμ)(eμv′eμ) by progressively adding elements to τ.

(The Global Alternative). Let u,v′∈Nμ such that u=u1u2⋯uruT decomposes according to a minimal expression in W. Let v=uTv′. Then (a) (eμueμ)(eμv′eμ)=Ξ∅(u,v). (b) If ℓ∨(τ)=k, then Ξτ(u,v)= { Ξ(+0,τ) (u,v), if ℓ(π(ukvτ)) >ℓ(π(vτ)), Ξ(-0,τ) (u,v)+ Ξ(1,τ) (u,v), if ℓ(π(ukvτ)) <ℓ(π(vτ)).

Proof.

(a) follows from Remark 1.

(b) Suppose ℓ∨(τ)=k. Note that Ξτ(u,v) = 1qr∑t∈𝔽qτ (ψ∘fτ) (t)eμu1(t1) ⋯uk(tk)vτeμ = 1qr∑t″∈(𝔽qr-k)τ ∑t′∈𝔽qk (ψ∘fτ) (t′,t″)eμu1 (t1)⋯uk (tk)vτeμ where (𝔽qr-k)τ={(tk+1,…,tr)∈𝔽qr-k | restrictions according to τ} (as in (3.25)). Apply Lemma 3.8 to the inside sum with f≔fτ, v≔vτ. Note that the Lemma relations imply {t′∈𝔽qk} becomes { {t′∈𝔽qk}, if in Case 1, {t′∈𝔽qk | tk=0}, if in Case 2, first sum, {t′∈𝔽qk | tk∈𝔽q*}, if in Case 2, second sum, fτ becomes { f(+0,τ), if in Case 1, f(-0,τ), if in Case 2, first sum, f(1,τ), if in Case 2, second sum, vτ becomes { v(+0,τ), if in Case 1, v(-0,τ), if in Case 2, first sum, v(1,τ), if in Case 2, second sum. Thus Ξτ(u,v)= { Ξ(+0,τ) (u,v), if Case 1, Ξ(-0,τ) (u,v)+ Ξ(1,τ) (u,v), if Case 2, as desired.

□

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