Lectures in Representation Theory

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

Last update: 27 August 2013

Lecture 19

3Centralizer Algebras

My Favorite Game
—A. Ram

Definition 3.1 If A is an algebra, let Md(A) denote the d×d matrices with entries in A.

Definition 3.2 Let A be a subset of Md(ℂ). The centralizer or commutant of A is the set A‾= {b∈Md(ℂ) | ab=ba ∀a∈A} . Note that A⊆A‾‾, although the inclusion may be proper.

Proposition 3.3 For any subset A⊆Md(ℂ), A‾ is an algebra over ℂ.

Proof.

The set A‾ inherits a ring structure from Md(ℂ), since for all b1,b2∈A‾, and all a∈A (b1+b2)a = a(b1+b2) (b1b2)a = a(b1b2). Moreover, cI=Z(A) and so must lie in the center of A‾. Hence ℂ≅cI acts as scalars on A‾ which gives the ℂ vector space and algebra structures.

□

Proposition 3.4 If A1⊆A2⊆Md(ℂ) are subsets then A1‾⊇A2‾.

Proposition 3.5 A‾=A‾‾‾.

Proof.

Since A⊆A‾‾, the previous proposition implies that A‾⊇A‾‾‾. But A‾⊆(A‾)‾‾=A‾‾‾.

□

Proposition 3.6 Md(ℂ)‾= Z(Md(ℂ))= ℂId, ℂId‾= Md(ℂ)

Let V be a representation of an algebra A, so V:A→Md(ℂ). The image of A is the algebra of the representation V(A) is a subalgebra of Md(ℂ). We are interested in V(A)‾, the centralizer algebra of the representation V.

From the module perspective, suppose V is an A-module and let End(V) be the set of all linear transformations of V. Then V(A)‾≅ EndA(V)=def { b∈End(V) |  ba(v)=ab(v)  ∀ a∈A,v∈V } .

Example 3.7 Let A be an arbitrary algebra and let W be an irreducible representation of A. We claim W(A)‾=ℂI.

Proof.

Let B∈W(A)‾. Then for all a∈A BW(a)=W(a)B and so by Schur’s lemma, B=cI for some c∈C.

□

Example 3.8 Let A be an (associative) algebra. Recall the left regular representation A→ given by a1a2→=a1a2→. What is EndA(A→)?

The associative law a(bc)=(ab)c shows that EndA(A→)⊇RA, the algebra of transformations given by right multiplication by elements of A.

Let B∈EndA(A→), and let b∈A be defined by B1→=b→. Then for all a∈A, Ba→=Ba1→=a B1→=ab→= ab→. Hence B=Rb acts on A as right multiplication by b, and so EndA(A→)=RA.

We are interested in the centralizer algebras of arbitrary semisimple algebras, A≅⊕λMdλ(ℂ), so we will develop some notation for block matrix algebras.

Definition 3.9 Let P be a d1×d2 matrix and Q be a r1×r2 matrix, both over the same field (or algebra). The tensor product of P and Q, P⊗Q is the d1r1×d2r2 matrix with entries in ℂ described by the block structure P⊗Q= ( p1,1Q p1,2Q p1,d2Q p2,1Q p2,2Q p2,d2Q ⋱ pd1,1Q pd1,2Q pd1,d2Q ) For example, Ei,j⊗Q is zero other than the r1×r2 block in the (i,j) position, where it agrees with Q.

Problem 3.10 Suppose P1 and P2 are d1×d2 and d2×d3 matrices, respectively, and suppose also that Q1 and Q2, respectively, are r1×r2 and r2×r3 (so that we may form the products P1P2 and Q1Q2).

Check that (P1⊗Q1) (P2⊗Q2) = P1P2⊗ Q1Q2.

Let A be a subalgebra of Md(ℂ). We defined Ms(A) to be s×s matrices with entries in A, so elements of Ms(A) are of the form ∑1≤i,j≤sEij⊗ai,j, where the ai,j are matrices in A. Thus, Ms(A) is a subalgebra of Msd(ℂ). Let us compute the centralizer Ms(A)‾, which also lies inside Msd(ℂ).

Suppose B∈Ms(A)‾, and write B=∑1≤i,j≤sEi,j⊗bi,j where each bi,j is a d×d complex matrix. Then B commutes with all elements of Ms(A), i.e. for all choices of s2 matrices ak,ℓ∈A, (∑1≤i,j≤sEi,j⊗bi,j) (∑1≤k,ℓ≤sEk,ℓ⊗ak,ℓ)= (∑1≤k,ℓ≤sEk,ℓ⊗ak,ℓ) (∑1≤i,j≤sEi,j⊗bi,j).

If we multiply this out, the left hand side becomes ∑i,k,ℓ Ei,ℓ⊗ bi,k ak,ℓ= ∑i,ℓ Ei,ℓ⊗ ∑kbi,k ak,ℓ. Performing the same calculation on the right hand side and setting it equal to the previous computation gives ∑i,ℓ Ei,ℓ⊗ ∑kbi,k ak,ℓ= ∑k,j Ek,j⊗ ∑iak,i bi,j. Comparing coefficients of Em,n, we see that ∑kbm,k ak,n=∑i am,ibi,n (3.11) for all choices of s2 elements ai,j∈A, for each 1≤m,n≤s.

Since A is a subalgebra, we know 0 and I lie in A. Fix indices m≠n and choose s2 elements given by am,m=I and all others zero. Then bm,n=∑i am,i bi,n= ∑kbm,k ak,n=0.

Make a second choice of s2 elements, with m≠n, where am,n=I and all other ai,j=0. Equation 3.11 becomes bm,m= bm,m am,n= am,n bn,n= bn,n.

Hence B= ∑1≤i,j≤s Ei,j⊗bi,j = ∑k=1s Ek,k⊗b is block diagonal. Moreover, 3.11 becomes bam,n= bm,m am,n= am,n bn.n= am,nb and so b∈A‾. Thus B∈Is⊗A‾, hence Ms(A)‾⊆Is⊗A‾ (where we mean the set of matrices of the form Is⊗b for b∈A‾). The reverse inclusion is left as an exercise, and we claim

Proposition 3.12 If A is a subalgebra of Md(ℂ) then Ms(A)‾=Is⊗A‾.

Notes and References

This is a copy of lectures in Representation Theory given by Arun Ram, compiled by Tom Halverson, Rob Leduc and Mark McKinzie.

page history