Representation theory Lecture Notes: Chapter 2

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

Last update: 29 October 2013

The groups G(r,p,n)

Let r,p,n be positive integers such that p divides r. The group G(r,p,n) is the group of n×n matrices such that

(a) There is exactly one nonzero entry in each row and each column,
(b) The nonzero entries are rth roots of unity,
(c) The (r/p)th power of the product of the nonzero entries is 1.
The group G(r,1,n) has order rnn!, since condition (c) is trivially satisfied, there are r choices for each of n roots of unity and there are n! permutation matrices. The group G(r,p,n) is the normal subgroup of G(r,1,n) of index p given by the exact sequence 1 G(r,p,n) ↪ G(r,1,n) ⟶ ℤ/pℤ ⟶ 1 tλw ⟼ λ1+⋯+λn Some special cases of these groups are:
(1) G(r,1,1)=ℤ/rℤ, the cyclic group of order r,
(2) G(r,r,2)=WIr, the dihedral group of order 2r,
(3) G(1,1,n)=Sn=WAn-1, the symmetric group of n×n permutation matrices,
(4) G(2,1,n)=WBn, the hyperoctahedral group, or Weyl group of type Bn,
(5) G(2,2,n)=WDn, the Weyl group of type Dn,
(6) G(r,1,n)= (ℤ/rℤ)≀Sn= (ℤ/rℤ)n⋉Sn, where Sn acts on (ℤ/rℤ)n by permuting the factors.

Let ℤ/rℤ={0,1,…,r-1} and let ξ=e2πi/r. For each λ=(λ1,…,λn)∈ℤ/rℤ, let tλ be the diagonal matrix with diagonal entries (tλ)ii=ξλi. Then G(r,1,n) = { tλσ | λ∈ (ℤ/rℤ)n, σ∈Sn } and G(r,p,n) = { tλσ∈ G(r,1,n) |  λ1+⋯+λn=0  mod p } . where the multiplication in G(r,1,n) is determined by the relations tλtμ = tλ+μ, λ,μ∈(ℤ/rℤ)n, wtλ = twλw,λ∈ (ℤ/rℤ)n,w∈ Sn, where wλ=(λw(1),…,λw(n)) if λ=(λ1,…,λn).

The groups G(r,p,n) are complex reflection groups. The reflections in G(r,1,n) are the elements tiktj-k (i,j),k∈ (ℤ/rℤ), 1≤i<j≤n,and tik= t(0,…,0,k,0,…,0) = ξk ith ⋯ ⋯ ,k∈(ℤ/rℤ), 1≤i≤n. The reflections in G(r,p,n) are those reflections in G(r,1,n) which are also in G(r,p,n). These are tikp,0≤k≤ (r/p)-1,and all tiktj-k (i,j),k∈ (ℤ/rℤ),1≤i <j≤n.

Define t1= ξ ⋯ ,s1= ξ ξ-1 ⋯ , si=(i-1,i)= ⋯ ⋯ ,2≤i≤n.

The group G(r,1,n) can be presented by generators t1,s1,…,sn-1 and relations sisj = sjsi, if  |i-j|>1, sisi+1si = si+1sisi+1, 2≤i≤n-1, t1s1t1s1 = s1t1s1t1, t1r=1and si2=1, 2≤i≤n. (b) The group G(r,p,n) has a presentation by generators t1p,s1,s2,…,sn and relations t1r/p = 1and si2=1, 1≤i≤n, sisj = sjsi, for  |i-j|>1  and i,j≥ 2, sisi+1si = si+1sisi+1, for 2≤i≤n-1, s1s3s1 = s3s1s3,and s1sj=sjs1, for j>3, t1ps2 t1ps2 = s2t1p s2t1p,and s0t1p= t1ps0, for j>2, t1ps1t1ps1⋯ ⏟2(r/p) factors = s1t1ps1t1p⋯ ⏟2(r/p) factors ,and s1s2s1⋯ ⏟r factors = s2s1s2⋯ ⏟r factors ,

Note that only the groups ???? can be generated by n reflections.

Let λ=(λ(0),λ(1),…,λ(r-1)) be a r-tuple of partitions with n boxes total. A standard tableau of shape λ is a filling of the boxes of λ with 1,2,…,n such that, in each partition λ(j),

(a) the rows increase from left to right,
(b) the columns increase from top to bottom.
The rows and columns of each partition λ(j) are numbered as for matrices and T(i) is the box containing i  in T, c(b)=j-i,  if b is in position  (i,j), and s(b)=ξj,  if b is in  λ(j), where ξ=e2πi/r. The numbers c(b) and s(b) are the content and the sign of the box b, respectively.

(a) The irreducible representations Sλ of the group G(r,1,n) are indexed by r-tuples of partitions λ=(λ(0),…,λ(r-1)) with n boxes total.
(b) dim Sλ= # of standard tableaux of shape λ.
(c) The irreducible G(r,1,n)-module Sλ is given by Sλ=ℂ-span { vT | T  is a standard tableau of shape λ } with basis {vT} and with G(r,1,n) action given by s1vT = s(T(1))vT, sivT = (si)TTvT +(1+(si)TT) vsiT,i=2,3, …,n, where (si)TT= { 1c(T(i))-c(T(i-1)), if s(T(i)) =s(T(i-1)), 0, if s(T(i)) ≠s(T(i-1)), c(T(i)) is the content of the box containing i in T,
siT is the same as T except that i and i-1 are switched,
vsiT=0 if siT is not standard.

For each 0≤k≤r-1 the elements tik, 1≤i≤n, form a conjugacy class in G(r,1,n) and the elements tiktj-k(i,j), 1≤i<j≤n, 0≤k≤r-1, form another conjugacy class in G(r,1,n). Thus the elements zs(k)=∑i=1n tik,1≤k≤r-1, andzℓ=1r ∑i<j1≤k≤r-1 tiktj-k (i,j), are elements of Z(ℂG(r,1,n)). So zs(k) and zℓ must act by a constant on any irreducible representation Sλ of G(r,1,n). Define x1=0, xk = ( ∑1≤i<j≤k0≤ℓ≤r-1 tiℓtj-ℓ(i,j) ) - ( ∑1≤i<j≤k-10≤ℓ≤r-1 tiℓtj-ℓ(i,j) ) =1r ∑1≤i<k, 0≤ℓ≤r-1 tiℓtj-ℓ(i,j), for 2≤k≤n, and yk = (∑i=1kti)- (∑i=1k-1ti) =tk,for 1≤k≤n.

The elements x1,…,xn and y1,…,yn all commute with each other and the action of these elements on the irreducible representation Sλ of G(r,1,n) is given by ykvT=s(T(k)) vTand xkvT=c(T(k)) vT, for all standard tableaux T.

Proof.

The proof is by induction on k using the relations xk=skxk-1 sk+∑ℓ=0r-1 yk-1ℓsk yk-1-ℓ andyk=sk yk-1sk. The base cases x1vT=0=c (T(1))vT andy1vT =s(T(1)) vT are immediate from the definitions. Then ykvT = skyk-1sk = sk ( s(T(k-1)) (sk)TT vt+ (1+(sk)TT) s(T(k)) vskT ) = sk ( s(T(k))sk vT+ ( s(T(k-1))- s(T(k)) ) (sk)TTvT ) = s(T(k))vT+0 =s(T(k))vT, and xkvT = ( skxk-1sk+ 1r∑ℓ=0r-1 skyk-1-ℓ ykℓ ) vT = sk ( c(T(k-1)) (sk)TT vT+c(T(k)) (1+(sk)TT) vskT+1r ∑ℓ=0r-1 s(T(k-1))-ℓ s(T(k))ℓvT ) = sk ( c(T(k))skvT+ ( c(T(k-1))- c(T(k)) ) (sk)TTvT+ 1r∑ℓ=0r-1 ( s(T(k))-1 s(T(k)) ) ℓ vT ) = { sk(c(T(k))) skvT+ ((-1)+1)vT, if s(T(k))= s(T(k-1)), sk(c(T(k))) skvT+(0+0) vT, if s(T(k))≠ s(T(k-1)), = c(T(k))vT.

□

The cyclic group of order r

The cyclic group G(r,1,1) of order r is the group generated by a single element g with the relation gr=1. The group G(r,1,1)={1,g,g2,…,gr-1} can be realized as the group ℤ/rℤ={0,1,…,r-1} or as the group of rth roots of unity in ℂ, G(r,1,1)= { e2πik/r |  k=0,1,…,r } . Since G(r,1,1) is abelian every element is in a conjugacy class by itself. Since ℂG(r,1,n) is commutative every irreducible representation is one dimensional. A representation ρ:ℂG(r,1,n)→ℂ is completely determined by the value ρ(g) and the relation gr=1 forces ρ(g)r=1. So ρ is an irreducible representation of ℤ/rℤ if and only if ρ(g) is an rth root of unity. This proves the following theorem.

(a) The irreducible representations Sλ of the cyclic group G(r,1,1) are indexed by 0≤λ≤r-1.
(b) dim Sλ=1, for all λ=0,1,…,r-1.
(c) The irreducible representations (and the irreducible characters) of G(r,1,1) are given by the maps ρk: ℂG(r,1,1) ⟶ ℂ g ⟼ e2πi/r 0≤k≤r-1.
(d) The irreducible G(r,1,1)-module Sλ is given by the one dimensional vector space Sλ=ℂvλ with G(r,1,1)-action given by gkvλ=ξkλ vλ,where ξ=e2πi/r.

Fix u0,…,ur-1∈ℂ. The cyclic algebra Hr,1,1=Hr,1,1(u0,…,ur-1) is the algebra given by a single generator X which satisfies the relation (X-u0) (X-u1)⋯ (X-ur-1) =0, (1.2) i.e. Hr,1,1 is the quotient of the polynomial ring ℂ[X] by the ideal generated by the polynomial in ???. The algebra Hr,1,1 has basis {Xk | 0≤k≤r-1} and, if uk=ξk, where ξ=e2πi/r, then Hr,1,1=ℂG(r,1,1) is the group algebra of the cyclic group.

The proof of the following theorem is exactly the same as the proof of Theorem ???. The hypotheses in the statement are exactly what is needed to guarantee that the maps ρk defined in part (c) are distinct (and nonzero???)

Assume that u0,…,ur-1∈ℂ are all distinct (and nonzero???).

(a) The irreducible representations Hλ of the cyclic algebra Hr,1,1 are indexed by 0≤λ≤r-1.
(b) dim Hλ=1, for all λ=0,1,…,r-1.
(c) The irreducible representations (and the irreducible characters) of Hr,1,1(u0,…,ur-1) are given by the maps ρk: Hr,1,1(u0,…,ur-1) ⟶ ℂ X ⟼ ui 0≤k≤r-1.
(d) The irreducible Hr,1,1-module Hλ is given by the one dimensional vector space Hλ=ℂvλ with Hr,1,1-action given by Xvλ=uλvλ.

The dihedral group G(r,r,2) of order 2r

The dihedral group G(r,r,2) is the group of 2×2 matrices given by G(r,r,2)= { (ξk00ξ-k), (0ξkξ-k0)  | k=0,1,…,r-1 } ,where ξ=e2πi/r. Conjugation by the matrix P=?? shows that G(r,r,2) is isomorphic to the group of matrices G(r,r,2)= { (ξk00ξ-k), (0ξkξ-k0)  | k=0,1,…,r-1 } ,where ξ=e2πi/r. In this form G(r,r,2) is the group of symmetries of a regular r-gon (embedded in ℝ2 with its center at the origin), id s1 s2 s1s2 s2s1 s1s2s1 s2s1s2 s1s2s1s2 with s1 being the reflection in Hα1 and s2 the reflection in Hα2.

(a) The generators t=(ξ00ξ-1) and s=(0110) and the relations tr=1, s2=1, st=t-1s, form a presentation of G(r,r,2).
(b) The generators s1=(0ξξ-10) and s2=(0110) and the relations s1s2s1s2⋯ ⏟m factors = s2s1s2s1⋯ ⏟m factors ,s12=1, s22=1, form a presentation of G(r,r,2).

The conjugacy classes of G(r,r,2) are 𝒞1={1} 𝒞w0= { s1s2s1s2⋯ ⏟r factors } 𝒞s1 = { ⋯s1s2 ⏟k factors s1 s2s1⋯ ⏟k factors  | 0≤k<r/2 } , 𝒞s2 = { ⋯s1s2 ⏟k factors s2 s2s1⋯ ⏟k factors  | 0≤k<r/2 } , and 𝒞k = { (s1s2)k, (s2s1)k } ,1≤k<r/2

The irreducible representations of the dihedral group G(r,r,2) are given as follows. The one dimensional representations ρ++ and ρ-- are given by ρ++(s1) =1,ρ++ (s2)=1and ρ--(s1) =-1,ρ-- (s2)=-1, and, if r is even, there are additional one dimensional representations ρ+- and ρ-+ given by ρ+-(s1)=1, ρ+-(s2)=-1, and ρ-+(s1)=-1, ρ-+(s2)=1. The two dimensional irreducible representations Sλ, 0<λ<r/2, are given by Sλ(s2)= (0110) andSλ (s1)= (0ξλξ-λ0), where ξ= e2πi/r.

Proof.

There are four things to show:

(a) The ρλ are irreducible,
(b) The ρλ are representations of G(r,r,2),
(c) The ρλ are all nonisomorphic, and
(d) The ρλ are complete set of irreducible representations.

(a) It is straightforward to check that ρλ(s1)2=ρλ(s2)2=Id for all the given ρλ. It remains to check that ρλ(s1s2)r=Id. This follows since ρλ (s1s2)r= 1, if r is odd and  ρλ is one dimensional, ρλ (s1s2)r= ±1, if r is even and  ρλ is one dimensional, ρλ(s1s2)= (ξλ00χ-λ) , when ρλ is two dimensional.

(b) All one dimensional representations are irreducible. Let ρλ be a given two dimensional representaitons and let M1, with basis {m1,m2} be the corresponding G(r,r,2) module. Let N be a nonzero submodule of M and let n=c1m1+c2m2 be a nonzero vector in N. Suppose c1≠0. Then ( s1s2-ξ-λ ξλ-ξ-λ ) n=c1m1∈N, and so m1∈N and m2=s2m1∈N. So N=M. So M is irreducible.

(c) Since the values χλ(s1s2)= ξλ+ξ-λ=2 cos(2πλ/r), 1≤λ<r/2, are all distinct, the characters of all the two dimensional representations ρλ, 1≤λ<r/2, are distinct. Thus these representations are nonisomorphic.

(d) If m is odd ∑λdλ2= 12+12+ ∑λ=1r/2-1/2 22=2+4(r/2-1/2) =2r, and, if m is even, ∑λdλ2= 12+12+12+12+ ∑λ=1r/2-1 22=4+4(r/2-1)=2r. In either case ∑λdλ2=|G(r,r,2)|, and so the ρλ are a complete set of inequivalent irreducible representations of G(r,r,2).

□

The Iwahori-Hecke algebra of G(r,r,2)

Let p,q∈ℂ*. The Iwahori-Hecke algebra of the dihedral group Hr,r,2=Hr,r,2(p,q) is the algebra given by generators T1,T2 and relations T1T2T1T2⋯ ⏟r factors = T2T1T2T1⋯ ⏟r factors T12=(p-p-1) T1+1, T22=(q-q-1) T2+1. The last two relations guarantee that T1 and T2 are invertible, T1-1=T1- (p-p-1) andT2-1= T2-(q-q-1). If r is odd then p=q is forced since ( T1T2⋯ ⏟r-1 factors ) -1 T2 ( T1T2⋯ ⏟r-1 factors ) =T1. The elements { 1 , T1T2T1T2⋯ ⏟k factors , T2T1T2T1⋯ ⏟k factors , T1T2T1T2⋯ ⏟r factors  | 1≤k<r } form a basis of Hr,r,2. If p=q=1 then Hr,r,2=ℂG(r,r,2) is the group algebra of the dihedral group of order 2r.

Assume that p,q satisfy ????. The irreducible representations of Hr,r,2(p,q) are given as follows. The one dimensional representations ρ++ and ρ-- are given by ρ++ (T1) = p, ρ++ (T2) = q, and ρ-- (T1) = -p-1, ρ-- (T2) = -q-1, and, if r is even, there are additional one dimensional representations ρ+- and ρ-+ given by ρ+- (T1) = p, ρ+- (T2) = -q-1, and ρ-+ (T1) = -p-1, ρ-+ (T2) = q. The two dimensional irreducible representations ρλ, 0<λ<r/2, are given by ρλ(T2)= (a(1+ad)1d) and ρλ(T1)= ( -dξ(1+ad)ξ ξ-1-aξ-1 ) ,where ξ= e2πi/r, a= (q-q-1)ξ+ (p-p-1) ξ-ξ-1 ,andd- (q-q-1)ξ-1 +(p-p-1) ξ-1-ξ .

Proof.

Instead of repeating the proof of Theorem ??? and trying to mind our p’s and q’s let us give a proof which shows how this result can be derived.

The quadratic relations in ??? are equivalent to (T1-p) (T1+p-1)=0 and (T2-q) (T2+q-1)=0, and these imply that any one dimensional representation χ:Hr,r,2→ℂ must have χ(T1) equal to p or -p-1 and χ(T2) equal to q or -q-1. If r is odd then T1 is conjugate to T2 and so χ(T1)=χ(T2). This determines the one dimensional representations of Hr,r,2.

Let ρ:Hr,r,2→M2(ℂ) be an irreducible two dimensional representation of Hr,r,2. By the relation (T1-ρ)(T1+p-1)=0 the eigenvalues of ρ(T1) are in the set {p,-p-1}. If ρ(T1) has two equal eigenvalues then it is a multiple of the identity. If v is an eigenvector of ρ(T2), and ρ(T1) is a constant multiple of the identity then ℂv is a submodule of ρ and this contradicts the irreducibility of ρ. So ρ(T1) must have eigenvalues p and -p-1. Similarly ρ(T2) must have eigenvalues q and q-1.

By the defining relations T1 T1T2⋯ ⏟m factors = T1 T2T1⋯ ⏟m factors = T1T2⋯ ⏟m factors Ti, where i=1 if r is odd and i=2 if r is even. So T2(T1T2)m= T1 T1T2⋯ ⏟m factors T1T2⋯ ⏟m factors = T1T2⋯ ⏟m factors Ti T1T2⋯ ⏟m factors = T1T2⋯ ⏟m factors T1T2⋯ ⏟m factors T1 =(T1T2)m T1, and similarly one shows that T2(T1T2)m=(T1T2)mT2. So (T1T2)m is in the center of Hr,r,2.

By Schur’s lemma ρ(T1T2)m= cId,for some c∈ℂ. Since ρ(T1) has eigenvalues p and p-1 and ρ(T2) has eigenvalues q and q-1, det(ρ(T1))= det(ρ(T2))= -1 and so det(ρ(T1T2)m) =(-1)2m=1. On the other hand, det(ρ(T1T2)m)=c2 and so c=±1. Since c does not depend on p and q and (s1s2)m=1 in the group G(r,r,2) it follows that c=1. So ρ(T1T2)m=Id.

Thus the eigenvalues of ρ(T1T2) are rth roots of unity. Since det(ρ(T1T2))=(-1)2=1 we can write (possibly after some change of basis in the module ρ) ρ(T1T2)= (ξk00ξ-k) where ξ=e2πi/r  and k∈ℤ. If k=0 or (if r is even and) k=r/2 then ρ(T1T2)=±1 and ρ is not irreducible. So without loss of generality we can assume that 0<k<r/2.

Suppose that ρ(T2)=(abcd). The relation T22=(q-q-1)T2+1 implies that a+d=q-q-1 and ad=bc=1. So we can assume ρ(T2)= (aad+11d) ,with a+d=q-q-1. Then ρ(T1)= ρ(T1T2T2-1) =ρ(T1T2)ρ (T2)-1= (ξk00ξ-k) (-d(ad+1)1-a)= ( -dξk(1+ad)ξk ξ-k-aξ-k ) . Now Tr(ρ(T1))= p-p-1=-d ξk-aξ-k, andTr(ρ(T2)) =q-q-1=a+d, and these equations determine a and d as given in the statement of the theorem.

□

The symmetric group

The symmetric group is the group of permutations of 1,2,…,n, i.e. the group of bijections w:{1,2,…,n}→{1,2,…,n} under the operation of composition. There are multiple notations for permutations:

(1) Two line notation: where w(i) in the second line is below i in the first line. w= ( 123456 416253 )
(2) Cycle notation: Where (i1,i2,…,ir) indicates w(i1)=i2, w(i2)=i3, …, w(ir-1)=ir, w(ir)=i1. Cycles of length 1 are usually dropped from the notation. w=(142)(36)(5) =(142)(36).
(3) Matrix notation: where the w(i)th entry of the ith column is 1 and all other entries are 0. w= ( 010000 000100 000001 100000 000010 001000 )
(4) Diagram notation: where the ith dot in the top row is connected to the w(i)th dot in the bottom row. w=
The symmetric group sn is the group of n×n permutation matrices and Card(Sn)=n!.

The transpositions in Sn are the permutations (i,j), 1≤i<j≤n (in cycle notation). The simple transpositions are si=(i,i+1)= i i+1 ⋯ ⋯ ,1≤i≤n-1.

The symmetric group Sn can relations be presented by generators s1,s2,…,sn-1 and relations sisj = sjsi, if |i-j| >1, sisi+1si = si+1sisi+1, 1≤i≤n-2, si2 = 1, 1≤i≤n-1.

Proof.

There are three things to show:

(a) The simple transpositions in Sn satisfy the given relations.
(b) The simple transpositions generate Sn.
(c) The group given by generators s1,…,sn-1 and relations as in the statement of the theorem has order ≤n!.

(a) The following pictures show that the simple tranpositions si=(i,i+1), 1≤i≤n-2 satisfy the given relations. = = = = =

(b) The diagram of any permutation can be “stretched” to guarantee that no more than two edges cross at any given point. Then w can be written as a product of simple transpositions corresponding to these crossings. w= = =s1s3s5s4s2 s5s3.

(c) Let Gn be the free group generated by sysmbols s1,s2,…,sn-1 modulo the relations in the statement of the theorem. Let Gn-1 be the subgroup generated by s1,s2,…,sn-2. We will show that

(1) Every element w∈Gn can be written in the form w=w1sn-1w2, with w1,w2∈Gn-1.
(2) Every element w∈Gn can be written in the form w=asn-1sn-2…sk, 1≤k≤n, and a∈Gn-1.

(1) Since sn-12=1 every element w∈Gn can be written in the form w=w1sn-1 w2sn-1w3 sn-1⋯wℓ-1 sn-1wℓ, where wj∈Gn-1. By induction, either w2∈Gn-2 or w2=asn-2b where a,b∈Gn-2. In the first case w = w1sn-1 w2sn-1 w3sn-1⋯ wℓ-1sn-1 wℓ = w1w2sn-1 sn-1w3 sn-1⋯ wℓ-1sn-1 wℓ = w1w2sn-1 w3sn-1⋯ wℓ-1sn-1 wℓ, and in the second case w = w1sn-1 w2sn-1 w3sn-1⋯ wℓ-1sn-1 wℓ = w1sn-1a sn-2bsn-1 w3sn-1⋯ wℓ-1sn-1 wℓ = w1asn-1sn-2 sn-1bw3sn-1 ⋯wℓ-1sn-1wℓ = w1asn-2sn-1 sn-2bw3sn-1 ⋯wℓ-1sn-1wℓ = w1′sn-1 w3′sn-1⋯ wℓ-1sn-1wℓ where w1′=w1asn-2∈Gn-1 and w3′=sn-2bw3∈Gn-1. In either case the number of sn-1 factors in the expression of w has been reduced. The statement in (1) follows by induction.

(2) By (1) any element w∈Gn is either an element of Gn-1 or can be written in the form w=w1sn-1w2, with w1,w2∈Gn-1. In the first case w=wsn-1⋯sℓ with ℓ=n and the statement is satisfied. If w=w1sn-1w2 then, by induction, w2=asn-2sn-3…sℓ, for some 1≤ℓ≤n-2 and a∈Gn-2. So w=w1sn-1a sn-2⋯sℓ= w1asn-1⋯ sℓ=w1′ sn-1⋯sℓ, where w1′=w1a∈Gn-1. Statement (2) follows.

From (2) it follows that Card(Gn)≤Card(Gn-1)·n, and, by induction, that Card(Gn)≤n!. Since Sn is a quotient of Gn and Card(Sn)=n! we have Gn≅Sn.

□

A partition of n is a collection of n boxes in a corner (gravity goes up and to the left and pushes the boxes tightly into the corner). λ= (3.2) If λi is the number of boxes in row i then λ=(λ1≥λ2≥…) is a sequence of nonnegative integers and we write λ⊢n. For example, the partition in (??) is λ=(55311) and λ⊢15. A standard tableau of shape λ is a filling T of the boxes of λ with 1,2,…,n such that

(a) the rows of T are increasing left to right,
(b) the columns of T are increasing top to bottom.
For example T= 1 2 3 4 5 3 4 7 12 15 8 9 14 11 16 18 13 17 is a standard tableau of shape λ=(55311). The rows and columns of the partition λ are numbered as for matrices, T(i) is the box containing i  in T, and c(b)=j-i, if  b is in position  (i,j) in  λ. The number c(b) is the content of the box b. 0 1 2 3 4 -1 0 1 2 3 -2 -1 0 -3 -2 -1 -4 -5 Contents of boxes

(a) The irreducible representations Sλ of the symmetric group Sn are indexed by partitions λ with n boxes.
(b) dim Sλ= # of standard tableaux of shape λ.
(c) The irreducible Sn-module Sλ is given by Sλ=ℂ-span { vT | T  is a standard tableau of shape λ } with basis {vT} and with Sn action given by sivT= (1c(T(i+1))-c(T(i))) vT+ (1+1c(T(i+1))-c(T(i))) vsiT, where
si=(i,i+1),
c(T(i)) is the content of the box containing i in T,
siT is the same as T except that i and i+1 are switched,
vsiT=0 if siT is not standard.

Proof.

There are four things to show:

(a) The Sλ are Sn-modules,
(b) The Sλ are nonisomorphic,
(c) The Sλ are all irreducible,
(d) The Sλ, λ⊢n, are all the irreducible Sn-modules.

(a) In order to show that Sλ is an Sn-module there are three relations to check

(a1) si2=1,
(a2) sisj=sjsi, if |i-j|>1,
(a3) sisi+1si= si+1sisi+1.

(a1) The action of si preserves the subspace S spanned by the vectors vQ indexed by the standard tableaux in the set {Q,siQ}. Depending on the relative positions of the boxes containing i and i+1 this space is either one or two dimensional. Case (A) Case (B) Case (C) In case (A) the space S is one dimensional and si acts by the matrix M(si)=1. In Case (B), S is one dimensional and si acts by the matrix M(si)=-1. In case (C), S is two dimensional and si acts on the subspace S by a matrix of the form M(si)= ( 1a-b1+1b-a 1+1a-b1b-a ) In cases (A) and (B) it is immediate that M(si)2=1 and in case (C), since Tr(M(si))=0 and det(M(si))=-1, it follows from the Cayley-Hamilton theorem that M(si)2=Id.

The action of si and sj commute if |i-j|>1 because si only moves i and i+1 in T and sj only moves j and j+1. The condition |i-j|>1 guarantees that {i,i+1} and {j,j+1} do not intersect.

(c) According to the formulas for the action, si and si+1 preserve the subspace S spanned by the vectors vQ indexed by the standard tableaux Q in the set {L,siL,si+1L,sisi+1L,si+1siL,sisi+1siL}. Depending on the relative positions of the boxes containing i, i+1, i+2 in L, this space is either 1, 2, 3 or 6 dimensional. Representative cases are when these boxes are positioned in the following ways. Case (1) Case (2) Case (3) Case (4) In Case (1) the space S is one dimensional and spanned by the vector vQ corresponding to the standard tableau a b c where a=i, b=i+1, and c=i+2. The action of Ti and Ti+1 on S is given by the matrices M(si)=(1), andM(si+1) =(1), respectively. In case (2) the space S is two dimensional and spanned by the vectors vQ corresponding to the standard tableaux a b c a c b where a=i, b=i+1, and c=i+2. The action of Ti and Ti+1 on S is given by the matrices M(si)= (100-1) andM(si+1)= (1/23/21/2-1/2) In case (3) the space S is three dimensional and spanned by the vectors vQ corresponding to the standard tableaux c a b b a c a b c where a=i, b=i+1, and c=i+2. The action of Ti and Ti+1 on S is given by the matrices M(Ti) = ( 1 0 0 0 1x1-x3 1+1x3-x1 0 1+1x1-x3 1x3-x1 ) and ϕS(Ti+1) = ( 1x2-x3 1+1x3-x2 0 1+1x2-x3 1x3-x2 0 0 0 1 ) respectively, where x1=c(L(i)), x2=c(L(i+1)) and x3=c(L(i+2)). In case (4) the space S is six dimensional and spanned by the vectors vQ corresponding to the standard tableaux c b a c a b b c a a c b b a c a b c where a=i, b=i+1, and c=i+2. The action of Ti and Ti+1 on S is given by the matrices M(si)= ( 1x1-x2 1+1x2-x1 0 0 0 0 1+1x1-x2 1x2-x1 0 0 0 0 0 0 1x1-x3 1+1x3-x1 0 0 0 0 1+1x1-x3 1x3-x1 0 0 0 0 0 0 1x2-x3 1+1x3-x2 0 0 0 0 1+1x2-x3 1x3-x2 ) and M(si+1)= ( 1x2-x3 0 1+1x3-x2 0 0 0 0 1x1-x3 0 0 1+1x3-x1 0 1+1x2-x3 0 1x3-x2 0 0 0 0 0 0 1x1-x2 0 1+1x2-x1 0 1+1x1-x3 0 0 1x3-x1 0 0 0 0 1+1x1-x2 0 1x2-x1 ) where x1=c(L(i)), x2=c(L(i+1)) and x3=c(L(i+2)). In each case we compute directly the products M(si)M(si+1)M(si) and M(si+1)M(si)M(si+1) and verify that they are equal.

Define elements xk, 1≤k≤n, in the group algebra ℂSn of the symmetric group x1=0,and xk=∑i<k (i,k),2≤k≤n, where (i,k)∈Sn is the transposition which switches i and k. The action of xk on the Sn-module Sλ is given by xkvT=c(T(k)) vT,for all standard tableaux T, where c(T(k)) is the content of the box containing k in T.

□

Proof.

The proof is by induction on k using the relation xk=sk-1 xk-1sk-1 +sk-1. Clearly, x1vT=0=c(T(1))vT for all standard tableaux T. By the induction assumption and the definition of the action of sk-1 on Sλ, xkvT = ( sk-1xk-1 sk-1+sk-1 ) vT = sk-1 (xk-1sk-1+1) vT = sk-1 ( c(T(k-1)) c(T(k))-c(T(k-1)) vT+c(T(k)) ( 1+ c(T(k-1)) c(T(k))-c(T(k-1)) ) vsk-1T+vT ) = sk-1 ( c(T(k)) c(T(k))-c(T(k-1)) vT+c(T(k)) ( 1+ c(T(k-1)) c(T(k))-c(T(k-1)) ) vsk-1T+vT ) = c(T(k))sk-1 sk-1vT=c (T(k))vT. qed

□

Let T be a standard tableau with n boxes and let T- be the standard tableau T except with the box containing n removed. Then T is the unique standard tableau given by adding a box (containing n) to T- in the diagonal of boxes with content c(T(n)). Thus, by induction on the number of boxes in T, T is uniquely determined by the sequence  ( c(T(1)), c(T(2)), …, c(T(n)) ) .

Example. If (c(T(1)),…,c(T(n)))= (0,1,-1,0,2,-2,-1,-3,1,3,2,-4,-3,-5,-6) then T= 1 2 5 10 3 4 9 11 6 7 8 13 12 14 15 It follows that the vector vT is, up to constant multiples, the unique vector in all the Sλ such that xkvT=c(T(k))vT, for all 1≤k≤n. This proves that the Sλ are nonisomorphic.

(c) Let us show that Sλ is irreducible. Let N be a nonzero submodule of Sλ and let n=∑TaTvT be a nonzero vector in N. Fix T such that aT≠0. It follows from the lemma and the fact that T is determined by the sequence (c(T(1)),…,c(T(n))) that the element in ℂSn given by pT=∏k=1n ∏j≠c(T(k))-n≤j≤n xk-j c(T(k))-j ,acts on Sλ by pTvS=δST vT, for all standard tableaux S of shape λ. So (1/aT)pTn=vT∈N.

Let Q be a standard tableau of shape λ and let k be minimal such that k+1 is southwest (strictly south and strictly west) of k in Q. k k+1 If k exists then skQ is a standard tableau and if k doesn’t exist then Q is the column reading tableau, i.e. Q is given by filling the boxes of λ sequentially down columns from left to right. C= 1 6 9 12 14 2 7 10 13 15 3 8 11 4 5 Column reading tableau By repeating the procedure with skQ in place of Q repeatedly we construct a sequence Q,sk1Q, sk2sk1 Q,…,skr⋯ sk2sk1 Q=C, which ends at the column reading tableau C. By concatenating this sequence with a similar sequence for T, T,sℓ1T,⋯, sℓm⋯sℓ2 sℓ1T=C we obtain a sequence T,sℓ1T,⋯,C,…, sk1Q,Q=sk1⋯ skrsℓm… sℓ1T of standard tableaux of shape λ which begins at T and ends at Q.

If P is a standard tableau in this sequence and vP∈N and skP is the next standard tableau in the sequence, then ( sk- 1c(P(k+1))-c(P(k)) ) vP = ( 1+ 1c(P(k+1))-c(P(k)) ) vP = ( c(P(k+1))-c(P(k))+1 c(P(k+1))-c(P(k)) ) vskP. Since skP is standard, c(P(k+1))-c(P(k))+1≠0 and so it follows that vskP∈N. Thus since vT∈N it follows that vQ∈N.

So vQ∈N for all standard tableaux of shape λ. So N contains a basis of Sλ. So N=Sλ. So N is irreducible.

Step 4: Let fλ be the number of standard tableaux of shape λ. Then n!=∑λ⊢n (fλ)2.

Proof.

The proof is accomplished by giving a bijection between permutations w∈Sn and pairs (P,Q) of standard tableaux, of the same shape, with n boxes. The matching of w∈Sn with a pair (P,Q) is accomplished by a recursive algorithm which begins with (P0,Q0)=(∅,∅) and, at step i, “inserts” w(i) into (Pi-1,Qi-1) to obtain (Pi,Qi). The output of the algorithm is the pair of tableaux (P,Q)=(Pn,Qn).

The insertion step for inserting w(i) into (Pi-1,Qi-1):

Place w(i) into the first column of Pi-1 as follows. If w(i) is greater than all entries of column 1 of Pi-1 then place w(i) at the end of column 1. Otherwise there is a unique entry in column 1 which can be replaced by w(i) and preserve the standardness condition. (This is the smallest entry larger that w(i).)

If w(i) displaces an entry from column 1 the the displaced entry is inserted into column 2 (in exactly the same way that w(i) was inserted into column 1). The displaced entries are successively inserted into the next column, and the process continues until there is no displaced entry.

The resulting standard tableau is Pi, which contains one more box than Pi-1. The tableau Qi is obtained by adding a box filled with i to Qi-1 so that Pi and Qi are the same shape.

To show that the algorithm produces a bijection it is necessary to confirm that the process can be reversed. To see this note that, given (Pi,Qi), the position of the box containing i in Qi tells which box of Pi must be “uninserted” to obtain Pi-1. The column by column insertion of this box will bump out an entry from column 1 of Pi and this entry is w(i) for the permutation w which corresponds to the pair (P,Q).

□

Example. Let ε1,…,εn be a basis of ℝn. The inversion set of a permutation w∈Sn is R(w)= { εj-εi  | i<j  and w(i)> w(j) } . The Bruhat-Chevalley order on Sn is the partial order on Sn given by w≤vifR(w) ⊆R(v).

Let λ be a partition and number the boxes of λ along diagonals (northwest to southeast within a diagonal) beginning with the southwest most diagonal and proceeding northeastward. 6 9 11 13 15 4 7 10 12 14 3 5 8 2 1 Numbering of boxes Using this numbering identify each standard tableau of shape λ with a permutation w∈Sn given by w(i)=entry in box i, or, equivalentlyw-1 (j)=box containing j. For example the standard tableau in ??? corresponds to the permutation w= ( 123456789101112131415 131183914142751261510 ) ∈S15. Let w be a standard tableau with n boxes and let w- be the standard tableau with n-1 boxes obtained by removing the box containing n from w. Then w is the unique standard tableau given by adding a box containing n to w- in the diagonal of boxes with content c(w-(n)). Thus, by induction on the number of boxes in w, w is uniquely determined by the sequence ( c(w-1(1)), c(w-1(2)), …, c(w-1(n)) ) . Define Zλ = { εj-εi |  i<j and  boxi and  boxj are in the same diagonal } Pλ = { εj-εi |  i<j and  boxi and  boxj are in adjacent diagonal } Jλ = { εj-εi∈Pλ  | boxj is northwest of  boxi } where, in the definition of Jλ, northwest means strictly north and weakly west. The sets Zλ, Pλ and Jλ completely determine the partition λ.

Let ℱλ={w∈Sn | w is a standard tableau of shape λ}. Then

(a) ℱλ= { w∈Sn |  R(w)∩Zλ= ∅,R(w)∩ Pλ=Jλ } .
(b) ℱλ is an interval in the Bruhat-Chevalley order on Sn, ℱλ= [wmin,wmax]= { v∈Sn |  wmin≤v≤wmax } , where wmin is the column reading tableau of shape λ and wmax is the row reading tableau of shape λ.

Proof.

(a) The condition R(w)∩Zλ=∅ is equivalent to

(A) w(i)<w(j) if i<j and boxi and boxj are in the same diagonal.
The condition R(w)∩Pλ=Jλ is equivalent to
(B) w(i)<w(j) if i<j, boxi and boxj are in adjacent diagonals, and boxj is southeast of boxi, and
(C) w(i)>w(j) if i<j, boxi and boxj are in adjacent diagonals, and boxj is borhteast of boxi.
w(i) w(j) > Case (A) w(i) w(j) > Case (B) w(i) w(j) < Case (C) Thus the condition R(w)∩Pλ=Jλ is equivalent to the condition for filling a standard tableau and the condition R(w)∩Zλ=∅ is redundant.

□

The Iwahori-Hecke algebra of type A

Fix q∈ℂ*. The Iwahori-Hecke algebra Hn=Hn(q) of type An-1 is the associative algebra with 1 given by generators T1,…,Tn-1 and relations TiTj = TjTi, if |i-j|>1, TiTi+1Ti = Ti+1TiTi+1, 1≤i≤n-2, Ti2 = 1, 1≤i≤n-1. If q=1 then Hn=ℂSn, the group algebra of the symmetric group.

The Iwahori-Hecke algebra Hn of type A has basis Tw, w∈Sn.

Proof.

□

dim(Hn)≤n!.

Proof.

We will show two things.

(a) Every element of Hn can be written as a linear combination of elements of the form w1Tn-1w2, where w1,w2∈Hn-1.
(b) Every element of Hn can be written as a linear combination of elements of the form aTn-1Tn-2⋯Tℓ, where 1≤ℓ≤n and a∈Hn-1.

(a) Every element of Hn can be written as a linear combination of elements of the form w1Tn-1 w2Tn-2 w3Tn-1⋯ wℓ-1Tn-1wℓ ,where wj∈ Hn-1. Then, by induction, w2 is a linear combination of elements of the form aTk-2b where a,b∈Hn-2. So Tn-1w2 Tn-1= Tn-1a Tn-2b Tn-1= aTn-1 Tn-2 Tn-1b =aTn-2 Tn-1 Tn-2b, since all elements of Hn-2 commute with Tn-1. So w1Tn-1 w2Tn-2 w3Tn-1⋯ wℓ-1 Tn-1wℓ is a linear combination of elements w1′Tn-1 w2′Tn-2 w4Tn-1w5 ⋯wℓ-1Tn-1 wℓ, where w1′=w1aTn-1 and w2′=Tn-2bw3 are in Hn-1. In this way the number of Tn-1 factors has been reduced by one. Thus, by induction, h is a linear combination of elements h′∈Hn-1 and elements h1Tn-1h2 with h1,h2∈Hn-1.

(b) By (a) any element h∈Hn-1 can be written as a linear combination of elements of the h1Tn-1h2 with h1,h2∈Hk-2. By induction, h2 can be written as a linear combination of elements of the form aTn-2Tn-3 ⋯Tℓ,for some  1≤ℓ≤k-2 and  a∈Hn-2. So h1Tn-1h2 is a linear combination of elements of the form h1Tn-1a Tn-2Tn-3 ⋯Tℓ=h1a Tn-1Tn-2 ⋯Tℓ,where h1 a∈Hn-1. So every element h∈Hn-1 is a linear combination of elements h′∈Hn-1 and elements of the form h1Tn-1⋯Tℓ ,with h1∈ Hn-1. So dim(Hn)≤dim(Hn-1)·n. Thus, by induction, dim(Hn)≤n!.

□

Assume that qk≠1 for all k=2,…,n.

(a) The irreducible representations Hλ of the Iwahori-Hecke algebra Hn of type A are indexed by partitions λ with n boxes.
(b) dim Hλ= # of standard tableaux of shape λ.
(c) The irreducible Hn-module Hλ is given by the vector space Hλ=ℂ-span { vT | T  is a standard tableau of shape λ } with basis {vT} and with Hn action given by TivT= ( q-q-1 1-q2(c(T(i))-c(T(i+1))) ) vT+ ( q-1+ q-q-1 1-q2(c(T(i))-c(T(i+1))) ) vsiT, where c(T(i)) is the content of the box containing i in T,
siT is the same as T except that i and i+1 are switched,
vsiT=0 if siT is not standard.

The proof of this theorem is exactly analogous to the proof of Theorem ??? once one knows what the analogues of the Murphy elements are for this setting.

Define elements Xεk, 1≤k≤n, in the Iwahori-Hecke algebra Hn of type A by Xε1=1, andXεk= Tk-1Tk-2⋯ T2T12T2⋯ Tk-2Tk-1, 2≤k≤n, The action of Xεk on the Hn-module Hλ is given by XεkvT= q2c(T(k)) vT,for all standard tableaux  T, where c(T(k)) is the content of the box containing k in T.

Proof.

The proof is by induction on k using the relation Xεk= Tk-1 Xεk-1 Tk-1. Clearly, Xε1vT=vT=q2c(T(1))vT, since c(T(1))=0 for all standard tableaux T. By the induction assumption and the definition of the action of Tk-1 on Hλ, XεkvT = Tk-1 Xεk-1 Tk-1vT = Tk-1 ( q2c(T(k-1)) (q-q-1) 1-q2(c(T(k))-c(T(k-1))) vT+q2c(T(k)) ( q-1+ (q-q-1) 1-q2(c(T(k))-c(T(k-1))) ) vsk-1T ) = q2c(T(k)) Tk-1 (Tk-1-(q-q-1)) vT=q2c(T(k)) vT.

□

The hyperoctahedral group

The hyperoctahedral group WBn is the group of signed permutations of 1,2,…,n, i.e. bijections w:{-n,…,-2,-1,1,2,…,n}→{-n,…,-2,-1,1,2,…,n} such that w(-i)=-w(i). There are multiple notations for signed permutations

(1) Two line notation: where w(i) in the second line is below i in the first line, for 1≤i≤n. w= ( 123456 3-15-62-4 )
(2) In cycle notation as permutations in the symmetric group S2n. w= (1,3,5,2,-1,-3,-5,-2) (4,-6).
(3) Matrix notation: where the (|w(i)|,i) entry is 1 if w(i) is positive and -1 if w(i) is negative, and all other entries are 0. w= ( 0-10000 000010 100001 00000-1 001000 000-100 )
(4) Diagram notation: where the ith dot in the top row is connected to the |w(i)|th dot in the bottom row and the edge is labeled by -1 if w(i) is negative. w= -1 -1 -1
The hyperoctahedral group is also called the Weyl group of type Bn and the Weyl group of type Cn and is the same as the group On(ℤ)= {A∈Mn(ℤ) | AAt=Id}. It is the group of n×n matrices such that
(a) there is exactly one nonzero entry in each row and each column,
(b) each nonzero entry is ±1.
The group WBn is isomorphic to the wreath product (ℤ/2ℤ)≀Sn and has order 2nn!.

The reflections in WBn are the elements sεi=(i,-i) sεi-εj= (i,j)(-i,-j), sεi+εj= (i,-j)(-i,j) The simple reflections are s1=(1,-1)= -1 ⋯ andsi= (i-1,i)= -1 ⋯ ⋯ for 2≤i≤n.

The hyperoctahedral group WBn can be presented by generators s1,s2,…,sn-1 and relations sisj = sjsi, if |i-j| >1, sisi+1si = si+1sisi+1, 2≤i≤n-1, s1s2s1s2 = s2s1s2s1, si2 = 1, 1≤i≤n.

Proof.

There are three things to show:

(1) The simple reflections in WBn satisfy the given relations.
(2) The simple reflections in WBn generate WBn.
(3) The group given by generators s1,…,sn and the relations in the statement has order 2nn!.

(1) The following pictures show that s1,…,sn∈WBn satisfy the relations in the statement of the theorem. -1 -1 = -1 = -1 = -1 -1 -1 = -1 -1 = -1 -1

(2) For each 1≤i≤n let ti=(i,-i)= -1 ith ⋯ ⋯ =sisi-1⋯ s3s2s1s2s3 ⋯si-1si. Every w∈WBn can be written as w=πti1⋯tik where π∈Sn is the permutation given by π(i)=|w(i)| and {i1,…,ik}={i | w(i) is negative}. Pictorially, w= -1 -1 -1 = -1 -1 -1 =πt1t3t6 Since s2,…,sn generate Sn and tk=sk⋯s2s1s2⋯sk for 1≤k≤n, it follows that s1,…,sn generate WBn.

Let Gn be the free group generated by s1,s2,…,sn modulo the relations in the statement of the theorem. We will show that every element w∈Gn is either

(a) w∈Gn-1,
(b) w=w1snsn-1⋯sk, with w1∈Gn-1, 2≤k≤n,
(c) w=w1snsn-1⋯s2s1s2⋯sk, with w1∈Gn-1, 1≤k≤n.
Let w∈Gn and assume that w=w1snw2snw3sn ⋯wℓ-1snwℓ, where wj∈Gn-1. First we will show that every element of Gn can be written in the form w=w1snw2sn, with w1w2∈ Gn-1. Suppose w=w1sns2snw3, with w1,w2,w3∈Gn-2. Then, by the induction assumption, w = w1 sn a sn-1 b sn-1 sn c sn-1 d sn-1 = w1 a sn sn-1 b sn-1 c ⏟ sn sn-1 d sn-1 = w1 a sn x sn-1 y sn-1 sn sn-1 d sn-1 = w1 a x sn sn-1 y sn sn-1 sn d sn-1 = w1 a x sn sn-1 sn y sn-1 sn d sn-1 = w1 a x sn-1 ⏟ sn sn-1 y sn d ⏟ sn sn-1 = Asnβ sn-1γsn-1 snsn-1 = Aβsnsn-1 γsnsn-1sn = Aβsnsn-1sn γsn-1sn = Aβsn-1⏟ sn sn-1γsn-1⏟ sn = w1′sn w2′sn. It follows that if w=w1snw2snw3sn with w1,w2,w3∈Gn-2 then w=w1′snw2′snsn=w1′snw2′. Then, by the induction assumption w=w1snw2sn, with
(1) w2∈Gn-2, or
(2) w2=asn-1⋯sk and a∈Gn-2, or
(3) w2=asn-1⋯s2s1s2⋯sk and a∈Gn-2.

Case 1. w=s1sns2sn=w1w2snsn=w1w2∈Gn-1.

Case 2. w = w1snasn-1⋯ sksn = w1asnsn-1sn sn-2⋯sk = w1asn-1sn sn-1sn-2⋯ sk = w1′snsn-1 ⋯sk,with  w1′∈Gn-1.

Case 3. w = w1snasn-1 ⋯s2s1s2⋯ sksn = { w1asnsn-1 snsn-2⋯s2 s1s2⋯sk, if k<n-1, w1asnsn-1⋯ s2s1s2⋯sn-1 sn, if k=n-1, = { w1asn-1sn sn-1sn-2⋯ s2s1s2⋯sk, if k<n-1, w1asnsn-1⋯ s2s1s2⋯sn-1 sn, if k=n-1, = w′asnsn-1⋯ s2s1s2⋯sk, with w1′∈ Gn-1. So Card(Gn)≤Card(Gn-1)·2n. So Card(Gn)≤2nn!.

□

Let (α,β) be a pair of partitions such that the total number of boxes in α and β is n. A standard tableau of shape (α,β) is a filling T of the boxes of α and β with 1,2,…,n such that, in each partition,

(a) the rows of T are increasing left to right,
(b) the columns of T are increasing top to bottom.
T= 1 5 7 4 10 12 8 13 2 3 9 6 11 α β The rows and columns of each partition are indexed as for matrices, T(i)= box containing i in T, c(b)=j-i, if the box  b is in position (i,j), sgn(b)= { 1, if b is in α, -1, if b is in β, The numbers c(b) and sgn(b) are the content and the sign of the the box b, respectively. 0 1 2 -1 0 1 -2 -1 0 1 2 -1 0 Contents of boxes 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 Signs of boxes

(a) The irreducible representations S(α,β) of the hyperoctahedral group WBn are indexed by pairs of partitions (α,β) with n boxes total.
(b) dim S(α,β)= # of standard tableaux of shape (α,β).
(c) The irreducible WBn-module S(α,β) is given by S(α,β)=ℂ-span {vT | T is a standard tableau of shape (α,β)} with basis {vT} and with WBn action given by s1vT = sgn(T(1))vT, sivT = (si)TT vT+ (1+(si)TT) vsiT, i=2,3,…,n, where s1=(1,-1) and si=(i,i-1)(-i,-(i-1)),
(si)TT= { 1c(T(i))-c(T(i-1)), if sgn(T(i)) =sgn(T(i-1)), 0, if sgn(T(i)) ≠sgn(T(i-1)),
c(T(i)) is the content of the box containing i in T,
sgn(T(i)) is the sign of the box containing i in T,
siT is the same as T except that i and i-1 are switched and
vsiT=0, if siT is not a standard tableau.

Proof.

We must show that

(1) The S(α,β) are WBn modules,
(2) The S(α,β) are irreducible WBn-modules,
(3) The S(α,β) are inequivalent WBn-modules,
(4) These are all the simple WBn modules.

The proofs are similar to the proofs of the analogous statements in the symmetric group case.

□

Define elements xk, 1≤k≤n, in the group algebra of the hyperoctahedral group WBn by yk=(k,-k), for1≤k ≤n, x1=0,and xk=∑i<k (i,k)(-i,-k) +(i,-k)(-i,k) ,2≤k≤n. The action of these elements on the WBn-module S(α,β) is given by ykvT=sgn(T(k)) vTandxk vT=c(T(k))vT, where sgn(T(k)) and c(T(k)) are the sign and the content of the box containing k in T, respectively.

Proof.

By induction, ykvT = skyk-1skvT = skyk-1 ( (sk)TTvt+ (1+(sk)TT) vskT ) = sk ( sgn(T(k-1)) (sk)TTvT +sgn(T(k)) (1+(sk)TT) vskT ) = sgn(T(k))sk ( skvT+ ( sgn(T(k-1))- sgn(T(k)) ) ( 1+sgn(T(k)) sgn(T(k-1)) ) c(T(k))-c(T(k-1)) ) vT = sgn(T(k))vT.

□

(d) Note that dim(S(α,β))= (n|α|) fαfβ, where fα is the number of standard tableaux of shape α. Thus fα is the dimension of the irreducible module Sα for the symmetric group S|α|. Then ∑α,βdim (S(α,β))2 = ∑α,β (n|α|)2 (fα)2 (fβ)2 = ∑k=0n (nk)2 (∑α⊢k(fα)2) (∑β⊢n-k(fβ)2) = ∑k=0n n!k!(n-k)! k!(n-k)!(nk) = ∑k=0nn! (nk)= 2nn!.

The Iwahori-Hecke algebra of type Bn

Fix p,q∈ℂ*. The Iwahori-Hecke algebra H of type Bn is the algebra given by generators T1,…,Tn and relations TiTj=tjTi, if |i-j|>1, T1T2T1T2= T2T1T2T1 andTiTi+1 Ti=Ti+1Ti Ti+1 T12=(p-p-1) T1+1and Ti2=(q-q-1) Ti+1,2≤i≤n.

The Iwahori-Hecke algebra HBn has dimension ≤2nn!.

(a) The irreducible representations H(α,β) of HBn are indexed by pairs of partitions (α,β) with n boxes total.
(b) dim H(α,β)= # of standard tableaux of shape (α,β).
(c) The irreducible HBn-module H(α,β) is given by S(α,β)=ℂ -span { vT | T  is a standard tableau of shape  (α,β) } with basis {vT} and with HBn action given by T1vT = sgn(T(1)) psgn(T(1)) qc(T(1)) vT, TivT = (Ti)TT vT+ (1+(Ti)TT) vsiT, i=2,3,…,n, where (Ti)TT= q-q-1 1-(CT(T(k-1))/CT(T(k))) ,withCT (T(k))=sgn (T(k)) psgn(T(k)) qc(T(k)), c(T(i)) is the content of the box containing i in T,
sgn(T(i)) is the sign of the box containing i in T,
siT is the same as T except that i and i-1 are switched, and
vsiT=0, if siT is not a standard tableau.

Proof.

Let us show that the action satisfies the given relations. The relations TiTj=TjTi, |i-j|>1, i,j≥2, and TiTi+1Ti=Ti+1TiTi+1, 2≤i≤n are taken care of by the case of the Iwahori-Hecke algebra of type A.

□

Define Xε1=T1, Vεi=Ti Ti-1⋯T2T1 T2⋯Ti-1Ti, in HBn. Then The action of Xεi, 1≤i≤n, on the HBn-module H(α,β) is given by XεivT=CT (T(i))vT,

Proof.

By the definition of the action T1vT= CT(T(1))vT= Xε1vT and, by induction, XεivT = TiXεi-1 TivT = Ti ( CT(T(i-1)) (Tk)TTvT +CT(T(i)) (q-1+(Tk)TT) vskT ) = CT(T(i))Ti (Ti-(q-q-1)) vT = CT(T(i))vT.

□

Note that 1- CT(T(i-1)) CT(T(i)) = 1- sgn(T(i-1)) sgn(T(i)) · psgn(T(i-1)) qc(T(i-1)) psgn(T(i)) qc(T(i)) = sgn(T(i)) psgn(T(i)) qc(T(i))- sgn(T(i-1)) psgn(T(i-1)) qc(T(i-1)) When p=q q-q-1 1- CT(T(i-1)) CT(T(i)) = q-q-1 sgn(T(i)) qsgn(T(i))+c(T(i))- sgn(T(i-1)) qsgn(T(i-1))+c(T(i-1)) = -sgn(T(i-1)) q-c(T(i-1))-sgn(T(i-1)) (q-q-1) 1-sgn(T(i-1)) sgn(T(i)) qsgn(T(i))+c(T(i))-sgn(T(i-1))-c(T(i-1)) = { 1/[c(T(i))-c(T(i-1))], if sgn(T(i))= sgn(T(i-1)), (q-q-1)/ (1+qc(T(i))-c(T(i-1))±2), if sgn(T(i))= -sgn(T(i-1)), and at q=1 this is { 1/(c(T(i))-c(T(i-1))), if sgn(T(i))= sgn(T(i-1)), 0, if sgn(T(i))= -sgn(T(i-1)).

Let u0,u1,…,ur-1∈ℂ and let q∈ℂ*. The cyclotomic algebra Hr,1,n is the algebra given by generators Xε1,T2,T3,…,Tn and relations TiTj = TjTi, if |i-j|>1, TiTi+1Ti = Ti+1TiTi+1, 2≤i≤n-1, Xε1Tj = TjXε1, j>1, Xε1T2 Xε1T2 = T2Xε1 T2Xε1, (Xε1-u0) (Xε1-u1)⋯ (Xε1-ur-1) =0, Ti2 = (q-q-1) Ti+1, 2≤i≤n. If pj=ξj where ξ=e2πi/r and q=1 then Hr,1,n=ℂG(r,1,n). Define Xεk=Ti Ti-1⋯T2 Xε1T2 ⋯Ti-1Ti, for 1≤i≤n, and Xλ= (Xε1)λ1⋯ (Xεn)λn, for λ=λ1ε1 +⋯λnεn, λi∈ℤ. Then ℂ[X]=ℂ-span { Xλ | λ= λ1ε1+⋯ λnεn, λi∈ℤ } is a commutative subalgebra of Hr,1,n.

If w∈Sn define Tw=Ti1⋯Tip if w=si1⋯sip and p is as small as possible. The cyclotomic Hecke algebra Hr,1,n has basis XλTw,where w∈Sn,λ=λ1 ε1+⋯+λnεn ,0≤λj≤r-1, and dim(Hr,1,n)= rnn!.

(a) The irreducible representations Hλ of Hr,1,n are indexed by r-tuples λ=(λ(0),…,λ(r-1)) of partitions with n boxes total.
(b) dim Hλ= # of standard tableaux of shape λ.
(c) The irreducible Hr,1,n-module Hλ is given by Hλ=ℂ-span { vT | T  is a standard tableau of shapeλ= (λ(0),…,λ(r-1)) } with basis {vT} and with Hr,1,n action given by Xε1vT = CT(T(1))vT, TivT = (Ti)TTvT+ (q-1+(Ti)TT) vsiT, i=2,3,…,n, where (Ti)TT= q-q-1 1-(CT(T(k-1))/CT(T(k))) ,withCT(b) =us(b) q2c(b), c(T(i)) is the content of the box b,
T(i) is the box containing i in T,
siT is the same as T except that i and i-1 are switched, and
vsiT=0, if siT is not a standard tableau.

The action of the elements Xεi, 1≤i≤n, on Hλ is given by XεivT=CT (T(i))vT, for all standard tableaux T of shape λ.

The Weyl group of type Dn

The Weyl group of type Dn is the group of n×n matrices such that

(a) there is exactly one nonzero entry in each row and each column,
(b) the nonzero entries are ±1,
(c) the product of the nonzero entries is 1.
Condition (c) says that there are an even number of -1 in the matrix. The Weyl group WDn is a normal subgroup of index 2 in WBn and has order 2n-1n!. The reflections in WDn are sεi-εj= (i,j)(-i,-j) ,and sεi+εj= (i,-j)(-i,j) ,1≤i<j≤n. The simple reflections in WDn are s1 = (-1,2)(1,-2)= -1 -1 ⋯ , si = (i-1,i)= ⋯ ⋯ ,2≤i≤n.

The Weyl group of type Dn has a presentation given by generators s1,…,sn and relations corresponding to the Dynkin diagram Dn and si2=1, for 1≤i≤n. An 2 3 n-1 n Bn 1 2 3 n-1 n Dn 1 2 3 4 n-1 n E6 2 3 4 5 6 1 E7 2 3 4 5 6 7 1 E8 2 3 4 5 6 7 8 1 F4 1 2 3 4 H3 1 2 3 5 H4 1 2 3 4 5 I2(m) 1 2 m

The affine symmetric group

The affine symmetric group S∼n is the group of permutations with edges labeled by elements of ℤ. For each λ=(λ1,…,λn)∈ℤn let tλ= t(λ1,…,λn)= λ1 λ2 ⋯ λn Then every element w∼∈S∼n can be written uniquely in the form w∼=tλw, with λ∈ℤn  and w∈Sn. w= 5 32 0 -7 -61 1 = 5 32 0 -7 -61 1 =t(5,32,0,-7,-61,1) ( 123456 362415 ) . The multiplication in Sn is determined by tλtμ= tλ+μ andwtλ= twλw, w∈Sn,λ,μ∈ ℤn, where λ+μ=(λ1+μ1,…,λn+μn) and Sn is acting on ℤn by wλ= w(λ1,…,λn)= (λw(1),…,λw(n)). So S∼n=ℤn⊢Sn.

The affine symmetric group S∼n has a presentation by generators s0= -1 0 0 0 0 1 ⋯ ⋯ ,ω= -1 0 0 0 0 0 ⋯ ⋯ , si= 0 0 0 0 0 0 0 ⋯ ⋯ ,1≤i≤n-1, and relations sisj = sjsi, |i-j|>1, sisi+1si = si+1sisi+1, si2 = 1, ω-1siω = si+1, where the indices on the si are always interpreted mod n.

Proof.

The theorem is proved by using the relations s0 = t(-1,0,0,…,0,1) sn-1sn-2⋯ s2s1s2⋯ sn-2sn-1, ω = t(-1,0,0,…,0) s1s2⋯sn-2 sn-1, Using these expressions one can write tλ in terms of s0,…,sn-1 and ω and prove that the equation tλtμ=tλ+μ, for λ,μ∈ℤn, is a consequence of the relations in the statement of the theorem.

□

For each r there is a surjective homomorphism S∼n ⟶ G(r,1,n) tλw ⟼ tλ‾w, where λ‾=(λ‾1,…,λ‾n), and i‾=i (mod r). Thus, if M is a G(r,1,n)-module there is an action of S∼n on M given by (tλw)m= (tλ‾w) m,for all tλ w∈S∼n. So every irreducible G(r,1,n) module is an irreducible S∼n-module. Are these all irreducible S∼n-modules? The answer is ??? as we shall see in ???, by using Clifford theory.

The affine Hecke algebra

Let q∈ℂ*. The affine Hecke algebra H∼n is the algebra given by generators Xε1,T2,T3,…,Tn and relations TiTj = TjTi, if |i-j|>1, TiTi+1Ti = Ti+1TiTi+1, 2≤i≤n-1, Xε1Tj = TjXε1, j>1, Xε1T2 Xε1T2 = T2Xε1 T2Xε1, Ti2 = (q-q-1)Ti+1, 2≤i≤n. If q=1 then H∼n=ℂS∼n, the group algebra of the affine symmetric group.

Define Xεk=Ti Ti-1⋯T2 Xε1T2⋯ Ti-1Ti, for 1≤i≤n , and Xλ= (Xε1)λ1⋯ (Xεn)λn, for λ=λ1ε1 +⋯λnεn,λi∈ ℤ. Then XλXμ= Xλ+μ, for all λ,μ∈ ℤn. Then ℂ[X]=ℂ-span { Xλ | λ= λ1ε1+⋯ λnεn,λi ∈ℤ } is a commutative subalgebra of H∼n isomorphic to the group algebra of ℤn.

The affine Hecke algebra is the unique algebra structure on ℂ[X]⊗H such that ℂ[X]=ℂ[X]⊗1 and H=1⊗H are subalgebras and XλTi=Ti Xsiλ+ (q-q-1) Xλ-Xsiλ 1-Xεi-εi-1 , for all λ∈ℤn and 1≤i≤n.

Define T0=Xε1-εn TnTn-1⋯T3 T2T3⋯Tnand ω=X-ε1 T2T3⋯Tn.

The affine Hecke algbera H∼n is presented by generators T0,T1,…,Tn,ω and relations TiTj = TjTi, if |i-j|>1, TiTi+1Ti = Ti+1TiTi+1, ωTiω-1 = Ti+1, Ti2 = (q-q-1) Ti+1, 0≤i≤n-1. where the indices are always taken modulo n.

If w∈Sn let Tw=Ti1⋯Tip if w=si1⋯sip and p is minimal. The affine Hecke algebra H∼n has basis XλTw,where w∈Sn,λ= λ1ε1+⋯+ λnεn,λj ∈ℤ.

The evaluation homomorphism is the surjective algebra homomorphism defined by H∼n ⟶ Hr,1,n Ti ⟼ Ti, Xεk ⟼ Tk⋯T2Xε1T2⋯Tk, Via this homomorphism every irreducible Hr,1,n module M is an irreducible H∼n module. Conversely, Let M be an H∼n-module. Let u0,…,ur-1∈ℂ be such that the minimal polynomial p(t) of the linear transformation of M determined by the action of Xε1 divides the polynomial (t-u0)(t-u1)⋯(t-ur-1). The the H∼n action on M is an Hr,1,n(u0,…,ur-1;q) action on M.

So any Hr,1,n(u0,…,ur-1;q)-module M is an H∼n and conversely, any H∼n module M is an Hr,1,n(u0,…,ur-1;q) module for some appropriate choice of r and u0,…,ur-1∈ℂ. So H∼n the representation theory “contains the representation theory” of all the algebras Hr,1,n(u0,…,ur-1;q).

The degenerate affine Hecke algebra

Let x1,…,xn be commuting variables and let ℂ[x1,…,xn] be the polynomials in x1,…,xn. Let ℂSn be the group algebra of the symmetric group. The graded Hecke algebra is the vector space ℂ[x1,…,xn]⊗Sn with multiplication such that

(a) ℂ[x1,…,xn]= ℂ[x1,…,xn]⊗1 is a subalgebra,
(b) ℂSn=1⊗ℂSn is a subalgebra,
(c) sixi-1si= xi-si, for 2≤i≤n.
If γ=(γ1,…,γn) is an n-tuple of nonnegative integers let xγ=x1γ1⋯xnγn. The elements { xγw | γ= (γ1,…,γn), γi∈ℤ≥0 ,w∈Sn } form a basis of Hn. The map Hn ⟶ ℂSn si ⟼ si x1 ⟼ 0 xk ⟼ ∑i<k(ik) 2≤k≤n, is a surjective algebra homomorphism.

Lusztig’s approah to the passage from the affine Hecke algebra to the graded Hecke algebra is as follows. Let h:ℂ[X]→ℂ* be W-invariant h(Xα)=1. Then I=ker h is a maximal ideal of ℂ[X]. Then the associated graded of the filtration ℂ[X]⊇I⊇ I2⊇⋯is S(𝔥*) =grℂ[X]. The “derivative” of f is the image d(f) of f-h(f) in I/I2. Then d(ff′)=h(f) d(f′)+h(f′) d(f),for f,f′ ∈ℂ[X]. Then H∼ is a ℂ[X] module and we have a filtration H∼⊇IH∼⊇ I2H∼⊇⋯ such that (IkH)(IℓH)⊆ Ik+ℓH. So consider grH∼=H‾= ⨁k≥0 H‾k, whereH‾k= (IkH∼)/ (Ik+1H∼). Let w be the image of Tw in H∼/IH∼=H‾0. r=d(q)∈I/I2. Then H‾ is the graded Hecke algebra (Prop. 4.4 in [Lus1989]). Prop. 4.5 in [Lus1989] says that Z(H‾)= S(𝔥*)W. There should be an analogue of the Pittie-Ram theorem for the graded Hecke algebra.

The degenerate affine Hecke algebra G∼n is the algebra generated by ℂ[x1,…,xn] and ℂSn with the relations xiTj = Tjxi, if |i-j|>1, six = xi+1si-1,

There is a surjective “evaluation” homomrphism G∼n ⟶ ℂSn si ⟼ si,xk ⟼ ∑i<k(i,k) The degenerate affine Hecke algebra is obtained from the affine Hecke algebra by setting xk to be the “derivative” of Xεk at q=1, xk= Xεk-1 q-1 |q=1.

Notes and references

This is a typed exert of Representation theory Lecture notes: Chapter 2 by Arun Ram. Research supported in part by National Science Foundation grant DMS-9622985.

page history