A Ribbon Hopf Algebra Approach to the Irreducible Representations of Centralizer Algebras: The Brauer, Birman-Wenzl, and Type A Iwahori-Hecke Algebras

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

Last update: 13 March 2014

Centralizer Algebras of Tensor Powers of Vω1, Type Ar

We shall use the notations for partitions given in [Mac1979]. In particular, a partition λ of the positive integer m, denoted λm, is a decreasing sequence λ=(λ1λ2λt0) of non-negative integers such that λ1++λt=m. The length l(λ) is the largest j such that λj>0. The Ferrers diagram of λ is the left-justified array of boxes with λi boxes in the ith row. For example, (5,3,3,1)= is a partition of length 4. Given two partitions λ,μ we write λμ if λiμi for all i. We have that λμ if the Ferrers diagram of λ is a subset of the Ferrers diagram of μ.

The Bratteli diagram given in Fig. 1 is called the Young lattice. The shapes λYˆm of Y which are on level m are the partitions of m; Yˆm= {λm}. A partition λYˆm is connected by an edge to a partition μYˆm+1 if μ can be obtained by adding a box to λ. The Young lattice Y is a multiplicity free Bratteli diagram.

Classically, a standard tableau of shape λm is a filling of the boxes in the Ferrers diagram of λ with the numbers 1,2,,m such that the numbers are increasing left to right in the rows and increasing down the columns. Each tableau T𝒯λ in the Bratteli diagram Y can be identified in a natural way with a standard tableau of shape λ. Let P be a standard tableau of shape λ and let T=(τ(0),τ(1),,τ(m))𝒯λ be the tableau such that τ(i) is the partition given by the set of boxes of P which contain the numbers 1,2,,i. One easily shows that this identification is a bijection between the standard tableaux P of shape λ and the tableaux TTλ.

The r-truncated Young lattice is the Bratteli diagram Y(r) which is given by the sets Yˆm(r)= {λm|l(λ)r}. A partition λYˆm(r) is connected by an edge to a partition μYˆm+1(r) if λμ, or equivalently, if μ can be obtained by adding a box to λ. The r-truncated Young lattice can be obtained by removing all the partitions with more than r rows (and the edges connected to them) from the full Young lattice Y. It is easy to see that tableaux in the r-truncated Young lattice correspond to standard tableaux of shapes λYˆ(r), in exactly the same way as tableaux in Y correspond to standard tableaux. Note also that the full Young lattice can be viewed as the limit of the r-truncated Young lattices as r goes to infinity.

For the remainder of this section let us fix r, and, unless otherwise specified, all paths and tableaux shall be from the Bratteli diagram Y(r).

Fix S=(σ(m-2),σ(m-1),σ(m))𝒯m-2m. Suppose that σ(m-1) is obtained by adding a box to the kth row of σ(m-2) and that σ(m) is obtained by adding a box to the lth row of σ(m-1). Now suppose that T=(σ(m-2),τ(m-1),σ(m)) is such that (S,T)Ωm-2m. If k=l then we must have that Figure 1 τ(m-1)=σ(m-1). If kl then either τ(m-1)=σ(m-1), or τ(m-1) is the shape obtained by adding a box to the lth row of σ(m-2). Thus, there is at most oneTS such that(S,T) Ωm-2m. (4.1)

The Centralizer Algebras 𝒵m

For the remainder of this section fix 𝔘=𝔘h(𝔰𝔩(r+1)). Let ε1,,εr+1 be an orthonormal basis of r+1. Then 𝔥*, the simple roots, αi, the fundamental weights, ωi, and the element 2ρ are given by 𝔥* = { λ1ε1++ λr+1εr+1 | i=1r+1 λi=0 } , αi = εi-εi+1, 1ir, ωi = ε1++εi- ir+1 i=1r+1 εj,1ir, 2ρ = i2ρiεi=r ε1+(r-2) ε2+-(r-2) εr-rεr+1. The finite dimensional irreducible modules Λλ of 𝔘h(𝔰𝔩(r+1)) are indexed by the dominant integral weights, 𝔘ˆ= { λ=λ1ε1++ λrεr- |λ|r+1 j=1r+1 εj|λi ,λ1 λr0 } , where |λ|=λ1++λr. It is sometimes helpful to identify each dominant integral weight λ with the partition λ=(λ1,,λr). Note that all partitions in 𝔘ˆ have at most r rows. It will also be helpful to note that, if λ=λ1ε1++λrεr-(|λ|/(r+1))jεj𝔘ˆ then λ,λ+2ρ= i=1rλi2- |λ|2r+1+ i=1r2ρiλi. (4.2)

Let V=Λω1 the irreducible 𝔘-module of highest weight ω1. The decomposition rule for tensoring by V is given by ΛλV μλ+ Λμ, (4.3) where the sum is over all partitions μ𝔘ˆ that are gotten by adding a box to the partition λ. It follows that the Bratteli diagram for tensor powers of V=Vω1 is the r-truncated Young lattice Y(r).

Let V=Vω1 be the irreducible 𝔘=𝔘h(𝔰𝔩(r+1))-module indexed by the fundamental weight ω1. The matrices ŘiEnd𝔘(Vm) satisfy the relations ŘiŘj = ŘjŘi, |i-j|>1, ŘiŘi+1Ři = Ři+1Ři Ři+1, 1im-2, (q(1/r+1)Ři-q) (q(1/r+1)Ři-q-1) = 0, 1im-1.

Proof.

The first two relations follow from Proposition (2.18). From (4.3), we have VVΛ(12) Λ(2)= Λ2ω1Λω2. Use (4.2) to show that ω2,ω2+2ρ = 2-(4/(r+1))+ 2ρ1+2ρ2=2r- 4/(r+1), 2ω1,2ω1+2ρ = 4-(4/(r+1))+ 4ρ1=4+2r-4/ (r+1), ω1,ω1+2ρ = 1-(1/(r+1))+ 2ρ1=r+1-1/ (r+1). It follows that q(1/2)ω2,ω2+2ρ-ω1,ω1+2ρ = q-1-(1/(r+1)), q(1/2)2ω1,2ω1+2ρ-ω1,ω1+2ρ = q1-(1/(r+1)). The result now follows from Proposition (2.22) part (3) and the standard fact that Λ(12) is antisymmetric part of V2 and Λ(2) is the symmetric part of V2.

A Path Algebra Formula for Ři

Let Y=Y(r) be the Bratteli diagram for tensor powers of V=Vω1. Identify the centralizer algebras 𝒵m=End𝔘(Vm) with the path algebras corresponding to the Bratteli diagram Y(r). Recall that the path algebras have a natural basis EST, (S,T)Ωm of matrix units.

For each tableau S=(σ(0),,σ(m))𝒯m define i(S)= σ(i),σ(i)+2ρ- σ(i-1),σ(i-1)+2ρ- ω1,ω1+2ρ. (4.5) Let (S,T) be a pair of tableaux S= ( σ(0),, σ(i-1), σ(i), σ(i+1),, σ(m) ) , and T= ( σ(0),, σ(i-1), τ(i), σ(i+1),, σ(m) ) , in 𝒯m such that S and T are the same except possibly at the shape at level i-1. In other words the pair (S,T)Ωi-1i+1. Define i(S,T)=12 (i+1(S)-i(T)) +1r+1. (4.6) These constants are defined so that, if Dm=Řm-1Řm-2Ř2Ř1Ř1Ř2Řm-2Řm-1, then Dm=S𝒯m (Dm)SSESS, where (Dm)SS= qm(S), and q-2m-1(S,T) =q-(2/r+1) (Dm-1)SS (Dm-1)TT. The first of these formulas is a consequence of Corollary (2.25).

Let S=(σ(0),,σ(m)) be a tableau in the Bratteli diagram Y(r). Then m(S) = 2(σk(m-1)-k+1) +-2m+2r+1, m-1(S,S) = σk(m)- σl(m-1)-k+l, where σ(m) is obtained by adding a box to the kth row of σ(m-1) and σ(m-1) is obtained by adding a box to the lth row of σ(m-2).

Proof.

Let S=(σ(0),,σ(m)) be a tableau in the Bratteli diagram Y(r). Then, since σ(m) differs from σ(m-1) by adding a box in the kth row we have σ(m-1)= i=1r σi(m-1)εi -m-1r+1 j=1r+1 εj, and σ(m)= (σk(m-1)+1) εk+1irik σi(m)εi- mr+1 j=1r+1εj. Using (4.2) to compute m(S) we get m(S) = σ(m),σ(m)+2ρ- σ(m-1),σ(m-1)+2ρ- ε1,ε1+2ρ = (ik(σi(m-1))2) +(σk(m-1)+1)2 -m2r+1 +(ik2σi(m-1)ρi) +2(σk(m-1)+1) ρk -(ik(σi(m-1))2) -(σk(m-1))2+ (m-1)2r+1 -(ik2σi(m-1)ρi) -2σk(m-1)ρk -1+1r+1-2ρ1 = 2σk(m-1)+2 (ρk-ρ1)+ -2m+2r+1. The formula for m(S) follows since 2(ρk-ρ1)=(r-(2k-1))-(r-1)=-2k-2=2(-k+1).

The formula for m-1(S,S) now follows easily since m-1(S,S) = 12 (m(S)-m-1(S)) +1r+1 = (σk(m-1)-k+1)+ -m+1r+1- (σl(m-2)-l+1) --(m-1)+1r+1 +1r+1 = σk(m)-k- σl(m-1)+l- 1r+1+1r+1.

Remark. In terms of standard tableaux, the value of i(S,S) is the "axial distance" between the box containing i and the box containing i+1. i i+1

One can choose the identification (Section 1) of the centralizer algebras 𝒵m with the path algebras corresponding to the Bratteli diagram Y(r) so that the matrices Ři are given by the formula Ři=(S,T)=Ωi-1i+1 (Ři)ST EST, where for each S𝒯m we have q1/(r+1) (Ři)SS= qi(S,S) [i(S,S)] and for each pair (S,T)Ωi-1i+1 such that ST we have q1/(r+1) (Ři)ST= [i(S,S)-1] [i(S,S)+1] [|i(S,S)|]

Proof.

Since Ři𝒵i=End𝔘(V(i+1)) commutes with all elements of 𝒵i-1=End𝔘(V(i-1)) it follows from Corollary (1.5) that Ři= (S,T)Ωm-2m (Ři)STEST, for some constants (Ři)ST. In view of the imbeddings 𝒵0𝒵1𝒵m, it is sufficient to show that the formulas for Ři hold for i=m-1.

By definition Dm=Řm-1Řm-2Ř2Ř1Ř1Ř2Řm-2Řm-1 and it follows that Řm-1-1= Rm-1 Řm-1 Dm-1. The relation (q1/(r+1)Ři-q)(q1/(r+1)Ři+q-1)=0 from Proposition (4.4) can be written in the form q1/(r+1)Řm-1-q-1/(r+1)Řm-1-1=(q-q-1) or, equivalently, in the form q1/(r+1) Řm-1- q-2/(r+1) Dm-1 q1/(r+1) Řm-1 Dm-1= (q-q-1). (4.9) Let S𝒯m and view (4.9) as an equation in the path algebra. Since the matrices Dm and Dm-1 are diagonal, taking the ESS-entry of this equation yields q1/(r+1) (Řm-1)SS- q-2/(r+1) (Dm-1)SS q1/(r+1) (Řm-1)SS (Dm-1)SS= (q-q-1) δSS, or, equivalently, ( 1-q-2/(r+1) (Dm-1)SS (Dm-1)SS ) q1/(r+1) (Řm-1)SS =(q-q-1). (4.10) Since the right hand side of this equation is nonzero, the left hand side is also nonzero and we may write q1/(r+1) (Řm-1)SS= (q-q-1)δSS q-q-2/(r+1) (Dm-1)SS (Dm-1)SS . Plugging in the following q-q-1 q-q-2/(r+1) (Dm-1)SS (Dm-1)SS = q-q-1 1-q-2m-1(S,S) = qm-1(S,S) (q-q-1) qm-1(S,S)- q-m-1(S,S) = qm-1(S,S) [m-1(S,S)] gives the first formula in Theorem (4.8).

Now let us prove the second formula in Theorem (4.8). Let S𝒯m-2m and suppose that T𝒯m-2m is such that (S,T)Ωm-2m and TS. By the remark in (4.1), T is unique. It follows that q2/(r+1) (Řm-12)SS =q2/(r+1) ((Řm-1)SS)2 +q2/(r+1) (Řm-1)ST (Řm-1)TS. (4.11) On the other hand, the relation (q1/(r+1)Řm-1-q)(q1/(r+1)Řm-1+q-1)=0 from Proposition (4.4) can be written in the form q2/(r+1)Řm-12-1= q1/(r+1)Řm-1(q-q-1), giving that q2/(r+1) (Řm-12)SS =(q-q-1) q1/(r+1) (Řm-1)SS+1 (4.12) Equating (4.11) and (4.12) and using the formula for q1/(r+1)(Řm-1)SS gives (q1/(r+1)Řm-1)ST (q1/(r+1)Řm-1)TS = 1+(q-q-1) (q1/(r+1)Řm-1)SS- (q1/(r+1)Řm-1)SS2 = (q-(q1/(r+1)Řm-1)SS) (q-1+(q1/(r+1)Řm-1)SS) = (q-qi(S,S)[i(S,S)]) (q-1+qi(S,S)[i(S,S)]) = q ( qi(S,S)- q-i(S,S) ) -qi(S,S) (q-q-1) qi(S,S)- q-i(S,S) · q-1 ( qi(S,S)- q-i(S,S) ) +qi(S,S) (q-q-1) qi(S,S)- q-i(S,S) = ( qi(S,S)+1- q-i(S,S)-1 ) ( q-i(S,S)+1 -qi(S,S)-1 ) qi(S,S)- q-i(S,S) = [i(S,S)+1] [i(S,S)-1] [i(S,S)]2

It follows from the remarks at the end of Section 1 that we can choose the normalization of the elements EST so that (Řm-1)ST and (Řm-1)TS are as given in the theorem.

Remark. If (S,T)Ωi-1i+1 such that ST then i(S,S)=-i(T,T). Thus, the formula for q1/(r+1)(Řm-1)ST given in Theorem (4.8) is actually symmetric in S and T.

Matrix Units

Given a tableau T=(τ(0),,τ(m))𝒯m let T denote the tableau T=(τ(0),,τ(m-1))𝒯m-1. Let (T)+ denote the set of all extensions of T; (T)+= { S𝒯m| S=T } . Given tableaux S=(σ(0),,σ(m)) and T=(τ(0),,τ(m)) in 𝒯m let (Řm-1)ST be the constant given by Theorem (4.8) in the case that ( (σ(m-2),σ(m-1),σ(m)), (τ(m-2),τ(m-1),τ(m)) ) Ωm-2m and let (Řm-1)ST=0 otherwise.

Let T=(τ(0),,τ(m-1))𝒯m-1 and let (T)+ be the set of extensions of T. Then the values m(S) are all different as S ranges over all elements of (T)+.

Proof.

Let S=(τ(0),,τ(m-1),σ(m))(T)+. By the previous lemma, m(S)=2(τk(m-1)-k+1-(m-1)/(r+1)) if σ(m) is obtained by adding a box to the kth row of τ(m-1). Since τ1(m-1) τk(m-1) τr(m-1) it follows that τ1(m-1)- m-1r+1 >>τk(m-1) -k+1-m-1r+1 >>τr(m-1) -r+1-m-1r+1.

[RWe1992]. The matrix units EST𝒵m, (S,T)Ωm are given in terms of the Ři, 1im-1, inductively, by the following formulas.

(1) Let T𝒯m. Then ETT= S𝒯m,ST,S=T ( ETTŘm-1 ETT- (Řm-1)SS ETT ) / ( (Řm-1)TT- (Řm-1)SS )
(2) Let (S,T)Ωm. If shp(S)=shp(T) then EST=ESTETT where ETT is given by (1).
(3) Let (S,T)Ωm. If shp(S)shp(T) then EST= 1(Řm-1)MN ESM Řm-1 ENT ETT, where M,N𝒯m are of the form M M=(μ(0),,μ(m-2),shp(S),shp(S)) and N=(μ(0),,μ(m-2),shp(T),shp(S)).

Proof.

(1) Let T𝒯m-1. It follows from the formula for Řm-1 that ETT Řm-1 ETT =S(T)+ (Řm-1)SS ESS. The identity (1) follows if we show that the values (Řm-1)SS are all different as S runs over all tableaux in (T)+. Since m-1(S,S)= 12(m(S)-m-1(S)) +1/(r+1)= 12(m(S)-m-1(T)) +1/(r+1) it follows that the values (Řm-1)SS are all different as S runs over all tableaux in (T)+ if and only if the values m(S) are all different as S runs over all tableaux in (T)+. Statement (1) now follows from Lemma (4.13).

(2) follows from the definition (1.3) of the embedding of path algebras.

(3) We must show two things: (a) For each possible choice of M and N the formula determines EST. (b) There exist tableaux M and N in 𝒯m of the form M=(μ(0),,μ(m-2),shp(S),shp(S)) and N=(μ(0),,μ(m-2),shp(T),shp(S)).

Suppose that M and N are given. Since shp(S)shp(T), it follows from (4.1) that M and N are the unique extensions of M and N respectively, such that shp(M)=shp(N)=shp(S). By Theorem (4.8) we know that the values (Řm-1)MN are nonzero. It follows that 1(Řm-1)MN ESMŘm-1 ENT = 1(Řm-1)MN ESM (U,V)Ωm (Řm-1)UV EUVENT = 1(Řm-1)MN ESM (Řm-1)MN ENM ENT=EST, proving (a). To see that (b) is true we reason as follows. Suppose that shp(S) is a partition that is the same as shp(S) except that there is a box missing from the kth row. Suppose that shp(T) is a partition that is the same as shp(S) except that there is a box missing from the lth row. Since shp(S)shp(T) we know that kl. Then there is a unique partition μ(m-2) that is the same as shp(S) except that there is a box missing from the lth row and a box missing from the kth row. The partition μ(m-2) is uniquely determined by S and T, and M and N can be determined by fixing some tableau (μ(0),,μ(m-2))𝒯m-2 of shape μ(m-2).

The centralizer 𝒵m=End𝔘(Vm) is generated by the matrices Ři, 1im-1.

Proof.

It follows from the identification of the centralizer algebras 𝒵m with the path algebras that the matrix units EST, (S,T)Ωm span the centralizer algebras 𝒵m. In view of Theorem (4.14), the matrix units EST, (S,T)Ωm can be written in terms of the Ři matrices. The statement follows.

Notes and References

This is a typed version of the paper A Ribbon Hopf Algebra Approach to the Irreducible Representations of Centralizer Algebras: The Brauer, Birman-Wenzl, and Type A Iwahori-Hecke Algebras by Robert Leduc* and Arun Ram.

The paper was received June 24, 1994; accepted September 12, 1994.

*Supported in part by National Science Foundation Grant DMS-9300523 to the University of Wisconsin.
Supported in part by National Science Foundation Postdoctoral Fellowship DMS-9107863.

page history