Partition algebras

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

Last update: 9 April 2013

Partition algebras

For k∈12ℤ>0 and n∈ℂ, the partition algebra ℂAk(n) is the associative algebra over ℂ with basis Ak,

ℂAk(n)=ℂ-span {d∈Ak}, and multiplication defined byd1d2= nℓ(d1∘d2),

where, for d1,d2∈Ak, d1∘d2 is the product in the monoid Ak and ℓ is the number of blocks removed from the middle row when constructing the composition d1∘d2. For example,

ifd1= andd2= then d1d2= =n2 , (2.1)

since two blocks are removed from the middle row. There are inclusions of algebras given by

ℂAk-12 ↪ ℂAk 1 k d ⟼ 1 k d and ℂAk-1 ↪ ℂAk-12 1 k-1 d ⟼ 1 k d (2.2)

For d1,d2∈Ak, define

d1≤d2, if the set partition d2  is coarser than the set partition d1,

i.e., i and j in the same block of d1 implies that i and j are in the same block of d2. Let {xd∈ℂAk∣d∈Ak} be the basis of ℂAk uniquely defined by the relation

d=∑d′≤d xd′, for all d∈Ak. (2.3)

Under any linear extension of the partial order ≤ the transition matrix between the basis {d∣d∈Ak} of ℂAk(n) and the basis {xd∣d∈Ak} of ℂAk(n) is upper triangular with 1s on the diagonal and so the xd are well defined.

The maps

ε12:ℂAk⟶ℂ Ak-12, ε12:ℂAk-12 ⟶ℂAk-1and trk:ℂAk⟶ℂ.

Let k∈ℤ>0. Define linear maps

ε12: ℂAk ⟶ ℂAk-12 1 k d ⟼ 1 k d and ε12: ℂAk-12 ⟶ ℂAk-1 1 k d ⟼ 1 k-1 d

so that ε12(d) is the same as d except that the block containing k and the block containing k′ are combined, and ε12(d) has the same blocks as d except with k and k′ removed. There is a factor of n in ε12(d) if the removal of k and k′ reduces the number of blocks by 1. For example,

ε12 (∑A ∑A) = , ε12 (∑A ∑A) = ,

and

ε12 (∑A ∑A) = , ε12 (∑A ∑A) =n .

The map ε12 is the composition ℂAk-12↪ ℂAk→ε1 ℂAk-1. The composition of ε12 and ε12 is the map

ε1: ℂAk ⟶ ℂAk-1 1 k d ⟼ 1 k-1 d . (2.4)

By drawing diagrams it is straightforward to check that, for k∈ℤ>0,

ε12 (α1ba2) = a1ε12 (b)a2, for a1,a2∈ Ak-12,b∈ Ak ε12 (α1ba2) = a1ε12 (b)a2, for a1,a2∈ Ak-1,b∈ Ak-12 ε1 (α1ba2) = a1ε1 (b)a2, for a1,a2∈ Ak-1,b∈ Ak (2.5)

and

pk+12b pk+12 = ε12(b) pk+12 = pk+12 ε12(b), for b∈Ak pkb pk = ε12(b) pk = pk ε12(b), for b∈Ak-12 ekbek = ε1(b)ek = ekε1(b), for b∈Ak. (2.6)

Define trk:ℂAk→ℂ and trk-12:ℂAk→ℂ by the equations

trk(b)= trk-12 (ε12(b)), for b∈Ak, andtrk-12 (b)=trk-1 (ε12(b)), for b∈Ak-12 , (2.7)

so that

trk(b)= ε1k(b), for b∈Ak,and trk-12(b) =ε1k-1ε12 (b),for b∈ Ak-12. (2.8)

Pictorially trk(d)=nc where c is the number of connected components in the closure of the diagram d,

trk(d)= d ,for d∈Ak. (2.9)

The ideal ℂIk(n)

For k∈12ℤ≥0 define

ℂIk(n)=ℂ -span{d∈Ik}. (2.10)

By (1.3),

ℂIk(n)  is an ideal of ℂAk(n) andℂAk(n) /ℂIk(n)≅ ℂSk, (2.11)

since the set partitions with propagating number k are exactly the permutations in the symmetric group Sk (by convention Sℓ+12=Sℓ for ℓ∈ℤ>0; see (2.2)).

View ℂIk(n) as an algebra (without identity). Since ℂAk(n)/ℂIk≅ℂSk and ℂSk is semisimple, Rad(ℂAk(n)) ⊆ℂIk(n). Since ℂIk(n)/Rad(ℂAk(n)) is an ideal in ℂAk(n)/Rad(ℂAk(n)) the quotient ℂIk(n)/Rad(ℂAk(n)) is semisimple. Therefore Rad(ℂIk(n))⊆ Rad(ℂAk(n)). On the other hand, since Rad(ℂAk(n)) is an ideal of nilpotent elements in ℂAk(n), it is an ideal of nilpotent elements in ℂIk(n) and so Rad(ℂAk(n))⊇ Rad(ℂAk(n)). Thus

Rad(ℂAk(n))= Rad(ℂIk(n)). (2.12)

Let k∈ℤ≥0. By (2.5) the maps

ε12:ℂAk⟶ ℂAk-12and ε12:ℂ Ak-12⟶ℂ Ak-1

are (ℂAk-12,ℂAk-12)-bimodule and (ℂAk-1,ℂAk-1)-bimodule homomorphisms, respectively. The corresponding basic constructions (see Section 4) are the algebras

ℂAk(n) ⊗ℂAk-12(n) ℂAk(n)and ℂAk-12(n) ⊗ℂAk-1(n) ℂAk-12(n) (2.13)

with products given by

(b1⊗b2) (b3⊗b4)= b1⊗ε12 (b2b3)b4 ,and (c1⊗c2) (c3⊗c4)= c1⊗ε12 (c2c3)c4, (2.14)

for b1,b2, b3,b4∈ ℂAk(n), and for c1,c2, c3,c4∈ ℂAk-12(n).

Let k∈12ℤ>0. Then, by the relations in (2.6) and the fact that

every d∈Ik can be written asd=d1 pkd2,with  d1,d2∈ Ak-12, (2.15)

the maps

ℂAk-12(n) ⊗ℂAk-1(n) ℂAk-12(n) ⟶ ℂIk(n) b1⊗b2 ⟼ b1pkb2 (2.16)

are algebra isomorphisms. Thus the ideal ℂIk(n) is always isomorphic to a basic construction (in the sense of Section 4).

Representations of the symmetric group

A partition λ is a collection of boxes in a corner. We shall conform to the conventions in [Mac1995] and assume that gravity goes up and to the left, i.e.,

Numbering the rows and columns in the same way as for matrices, let

λi = the number of boxes in row i of  λ, λj′ = the number of boxes in column j of  λ,and ∣λ∣ = the total number of boxes in λ. (2.17)

Any partition λ can be identified with the sequence λ=(λ1≥λ2≥…) and the conjugate partition to λ is the partition λ′= ( λ1′, λ2′,… ) . The hook length of the box b of λ is

h(b)= (λi-i)+ (λj′-j) +1,if b  is in position (i,j)  of  λ. (2.18)

Write λ⊢n if λ is a partition with n boxes. In the example above, λ=(553311) and λ⊢18.

See [Mac1995, Section I.7] for details on the representation theory of the symmetric group. The irreducible ℂSk-modules Skλ are indexed by the elements of

S^k= {λ⊢n}and dim(Skλ)= k!∏b∈λh(b) . (2.19)

For λ∈S^k and μ∈S^k-1,

ResSk-1Sk (Skλ)≅ ⨁λ/ν=□ Sk-1νand IndSk-1Sk (Sk-1μ)≅ ⨁ν/μ=□ Skν, (2.20)

where the first sum is over all partitions ν that are obtained from λ by removing a box, and the second sum is over all partitions ν which are obtained from μ by adding a box (this result follows, for example, from [Mac1995, Section I.7 Example 22(d)]).

The Young lattice is the graph S^ given by setting

vertices on level k:S^k ={partitions λ with k boxes} ,and an edge λ→μ,λ∈ S^k,μ∈ S^k+1 if  μ is obtained from λ  by adding a box. (2.21)

It encodes the decompositions in (2.20). The first few levels of S^ are given by

∅ k=0: k=1: k=2: k=3: k=4:

For μ∈S^k define

S^kμ= { T= ( T(0), T(1),…, T(k) )  |  T(0)=∅, T(k)=μ,and ,for each ℓ, T(ℓ)∈ S^ℓ and  T(ℓ)→ T(ℓ+1)  is an edge in S^ }

so that S^kμ is the set of paths from ∅∈S^0 to μ∈S^k in the graph S^. In terms of the Young lattice,

dim(Skμ)= Card(S^kμ) . (2.22)

This is a translation of the classical statement (see [Mac1995, Section I.7.6(ii)]) that dim(Skμ) is the number of standard Young tableaux of shape λ (the correspondence is obtained by putting the entry ℓ in the box of λ which is added at the ℓth step T(ℓ-1)→T(ℓ) of the path).

Structure of the algebra ℂAk(n)

Build a graph A^ by setting

vertices on level k:A^k ={partitions μ∣k-∣μ∣∈ℤ≥0} , vertices on level k+12: A^k+1= A^k ={partitions μ∣k-∣μ∣∈ℤ≥0} , an edge λ→μ,λ∈ A^k,μ∈ A^k+12  if λ=μ or if  μ is obtained from λ  by removing a box, an edge μ→λ,μ∈ A^k+12,λ∈ A^k+1  if λ=μ or if  λ is obtained from μ  by adding a box. (2.23)

The first few levels of A^ are given by

∅ ∅ ∅ ∅ ∅ ∅ ∅ k=0: k=0+12: k=1: k=1+12: k=2: k=2+12: k=3:

The following result is an immediate consequence of the Tits deformation theorem, Theorems 5.10 and 5.13 in this paper (see also [CRe1987, (68.17)]).

Theorem 2.24.

  1. For all but a finite number of n∈ℂ the algebra ℂAk(n) is semisimple.
  2. If ℂAk(n) is semisimple then the irreducible ℂAk(n)-modules, Akμ are indexed by elements of the set A^k={partitions μ∣k-∣μ∣∈ℤ≥0}, and dim(Akμ)= (number of paths from ∅∈A^0 to μ∈A^k in the graph A^).

Let

A^kμ= { T= ( T(0), T(12),…, T(k-12), T(k) )  |  T(0)=∅, T(k)=μ, and,for each ℓ, T(ℓ)∈ A^ℓ and  T(ℓ)→ T(ℓ+12)  is an edge in A^ }

sothat A^kμ is the set of paths from ∅∈A^0 to μ∈A^k in the graph A^. If μ∈S^k then μ∈A^k and μ∈A^k+12 and, for notational convenience in the following theorem,

identify P= ( P(0), P(1),…, P(k) ) ∈S^kμ  with the corresponding P= ( P(0), P(0), P(1), P(1),…, P(k-1), P(k-1), P(k) ) ∈A^kμ, andP= ( P(0), P(0), P(1), P(1),…, P(k-1), P(k-1), P(k), P(k) ) ∈A^k+12μ.

For ℓ∈12ℤ≥0 and n∈ℂ such that ℂAℓ(n) is semisimple let χAℓ(n)μ, μ∈A^ℓ, be the irreducible characters of ℂAℓ(n). Let trℓ:ℂAℓ(n)→ℂ be the traces on ℂAℓ(n) defined in (2.8) and define constants trℓμ(n), μ∈A^ℓ, by

trℓ= ∑μ∈A^ℓ trℓμ(n) χAℓ(n)μ. (2.25)

Theorem 2.26.

  1. Let n∈ℂ and let k∈12ℤ≥0. Assume that trℓλ(n)≠0, for all λ∈ A^ℓ,ℓ∈12 ℤ≥0,ℓ<k. Then the partition algebras ℂAℓ(n)  are semisimple for all ℓ∈ 12ℤ≥0,ℓ ≤k. (2.27) For each ℓ∈12ℤ≥0, ℓ≤k-12, define εμλ= trℓ-12λ(n) trℓ-1μ(n) for each edge μ→λ, μ∈A^ℓ-1, λ∈A^ℓ-12 , in the graph A^. Inductively define elements in ℂAℓ(n) by ePQμ= 1εμτεμγ eP-Tτpℓ eTQ-γ, for μ∈A^ℓ ,∣μ∣≤ℓ-1, P,Q∈A^ℓμ, (2.28) where τ=P(ℓ-12), γ=Q(ℓ-12), R-=(R(0),…,R(ℓ-12)) for R=(R(0),…,R(ℓ-12),R(ℓ))∈A^ℓμ and T is an element of A^ℓ-1μ (the element ePQλ does not depend on the choice of T). Then define ePQλ= (1-z)sPQλ ,forλ∈ S^ℓ,P,Q∈ S^ℓλ, wherez= ∑μ∈A^ℓ∣μ∣≤ℓ-1 ∑P∈A^ℓμ ePPμ (2.29) and {sPQλ∣λ∈S^ℓ,P,Q∈S^ℓλ} is any set of matrix units for the group algebra of the symmetric group ℂSℓ. Together, the elements in (2.28) and (2.29) form a set of matrix units in ℂAℓ(n).
  2. Let n∈ℤ≥0 and let k∈12ℤ>0 be minimal such that trkλ(n)=0 for some λ∈A^k. Then ℂAk+12(n) is not semisimple.
  3. Let n∈ℤ≥0 and k∈12ℤ>0. If ℂAk(n) is not semisimple then ℂAk+j(n) is not semisimple for j∈ℤ>0.

Proof.

(a) Assume that ℂAℓ-1(n) and ℂAℓ-12(n) are both semisimple and that trℓ-1μ(n)≠0 for all μ∈A^ℓ-1. If λ∈A^ℓ-12 then εμλ≠0 if and only if trℓ-12λ(n)≠0, and, since the ideal ℂIℓ(n) is isomorphic to the basic construction ℂAℓ-12(n) ⊗ℂAℓ-1(n) ℂAℓ-12(n) (see (2.13)), it then follows from Theorem 4.28 that ℂIℓ(n) is semisimple if and only if trℓ-1μ(n)≠0 for all λ∈A^ℓ-12. Thus, by(2.12), if ℂAℓ-1(n) and ℂAℓ-12(n) are both semisimple and trℓ-1μ(n)≠0 for all μ∈A^ℓ-1 then

ℂAℓ(n) is semisimple if and only if trℓ-12λ (n)≠0 for all  λ∈A^ℓ-12 . (2.30)

By Theorem 4.28, when trℓ-12λ(n)≠0 for all λ∈A^ℓ-12, the algebra ℂIℓ(n) has matrix units given by the formulas in (2.28). The element z in (2.29) is the central idempotent in ℂAℓ(n) such that ℂIℓ(n)=zℂAℓ(n). Hence the complete set of elements in (2.28) and (2.29) form a set of matrix units for ℂAℓ(n). This completes the proof of (a) and (b) follows from Theorem 4.28(b).

(c) Part (g) of Theorem 4.28 shows that if ℂAℓ-1(n) is not semisimple then ℂAℓ(n) is not semisimple.

□

Specht modules

Let A be an algebra. An idempotent is a nonzero element p∈A such that p2=p. A minimal idempotent is an idempotent p which cannot be written as a sum p=p1+p2 with p1p2=p2p1=0. If p is an idempotent in A and pAp=ℂp then p is a minimal idempotent of A since, if p=p1+p2 with p12=p1, p22=p2, and p1p2=p2p1=0, then pp1p=kp for some constant p and so kp1=kpp1=pp1pp1=p1 giving that either p1=0 or k=1, in which case p1=pp1p=p.

Let p be an idempotent in A. Then the map

(pAp)op ⟶∼ EndA(Ap), pbp ⟼ ϕpbp whereϕpbp (ap)=(ap) (pbp)=apbp, for ap∈Ap, (2.31)

is a ring isomorphism.

If p is a minimal idempotent of A and Ap is a semisimple A-module then Ap must be a simple A-module. To see this suppose that Ap is not simple so that there are A-submodules V1 and V2 of Ap such that Ap=V1⊕V2. Let ϕ1,ϕ2∈EndA(Ap) be the A-invariant projections on V1 and V2. By (2.31) ϕ1 and ϕ2 are given by right multiplication by p1=pp∼1p and p2=pp∼2p, respectively, and it follows that p=p1+p2, V1=Ap1, V2=Ap2, and Ap=Ap1⊕Ap2. Then p12= ϕ1(p1)= ϕ12(p)=p1 and p1p2= ϕ2(p1)= ϕ2(ϕ1(p)) =0. Similarly p22=p2 and p2p1=0. Thus p is not a minimal idempotent.

If p is an idempotent in A and Ap is a simple A-module then

pAp=EndA (Ap)op=ℂ (p·1·p)=ℂp,

by (2.31) and Schur’s lemma (Theorem 5.3).

The group algebra of the symmetric group Sk over the ring ℤ is

Sk,ℤ=ℤSk andℂSk= ℂ⊗ℤSk,ℤ, (2.32)

where the tensor product is defined via the inclusion ℤ↪ℂ. Let λ=(λ1,λ2,…,λℓ) be a partition of k. Define subgroups of Sk by

Sλ=Sλ1×… ×Sλℓand Sλ′= Sλ1′×…× Sλr′, (2.33)

where λ′=(λ1′,λ2′,…,λr′) is the conjugate partition to λ, and let

1λ=∑w∈Sλ wandελ′ =∑w∈Sλ′ (-1)ℓ(w)w. (2.34)

Let τ be the permutation in Sk that takes the row reading tableau of shape λ to the column reading tableau of shape λ For example for λ=(553311),

τ= ( 2,7,8,12,9,16,14, 4,15,10,18,6 ) (3,11)(5,17), since τ· 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 = 1 7 11 15 17 2 8 12 16 18 3 9 13 4 10 14 5 6 .

The Specht module for Sk is the ℤSk-module

Sk,ℤλ=im  ΨSk= (ℤSk)pλ, where pλ=1λ τελ′ τ-1,and (2.35)

where ΨSk is the ℤSk-module homomorphism given by

ΨSk: (ℤSk)1λ ⟶ι ℤSk ⟶π (ℤSk)τελ′τ-1 b1λ ⟼ b1λ ⟼ b1λτελ′τ-1 (2.36)

By induction and restriction rules for the representations of the symmetric groups, the ℂSk-modules (ℂSk)1λ and (ℂSk)τελ′τ-1 have only one irreducible component in common and it follows (see [Mac1995, Section I.7, Example 15]) that

Skλ=ℂ⊗ℤ Sk,ℤλ is the irreducible ℂSk-module indexed by  λ, (2.37)

once one shows that ΨSk is not the zero map.

Let k∈12ℤ>0. For an indeterminate x, define the ℤ[x]-algebra by

Ak,ℤ=ℤ[x] -span{d∈Ak} (2.38)

with multiplication given by replacing n with x in (2.1). For each n∈ℂ,

ℂAk(n)=ℂ ⊗ℤ[x] Ak,ℤ, where the ℤ-module homomorphism evn: ℤ[x] ⟶ ℂ, x ⟼ n (2.39)

is used to define the tensor product. Let λ be a partition with ≤k boxes. Let b⊗ pk⊗(k-∣λ∣) denote the image of b∈A∣λ∣,ℤ under the map given by

A∣λ∣,ℤ ⟶ Ak,ℤ b ⟼ b ⋯ ⋯ ...........................⏟k-|λ| ,if k is an integer, and A∣λ∣+12,ℤ ⟶ Ak,ℤ b ⟼ b ⋯ ⋯ ...........................⏟k-|λ|-12 ,if k-12 is an integer.

For k∈12ℤ>0, define an Ak,ℤ-module homomorphism

ΨAk: Ak,ℤtλ ⟶ψ1 Ak,ℤsλ′ ⟶ψ2 Ak,ℤ/I∣λ∣,ℤ btλ ⟼ btλsλ′ ⟼ btλsλ′‾, (2.40)

where I∣λ∣,ℤ is the ideal

I∣λ∣,ℤ=ℤ [x]-span {d∈Ak∣d has propogating number <∣λ∣}

and tλ,sλ′∈Ak,ℤ are defined by

tλ=1λ⊗ pk⊗(k-∣λ∣) andsλ′= τελ′τ-1 ⊗pk⊗(k-∣λ∣). (2.41)

The Specht module for ℂAk(n) is the Ak,ℤ-module

Ak,ℤλ=im  ΨAk= ( image of  Ak,ℤeλ  ∈ Ak,ℤ/ I∣λ∣,ℤ ) ,whereeλ= pλ⊗ pk⊗(k-∣λ∣). (2.42)

Proposition 2.43. Let k∈12ℤ>0, and let λ be a partition with ≤k boxes. If n∈ℂ such that ℂAk(n) is semisimple, then

Akλ(n)=ℂ ⊗ℤ[x] Ak,ℤλ is the irreducible ℂAk (n)-module indexed by λ,

where the tensor product is defined via the ℤ-module homomorphism in (2.39).

Proof.

Let r=∣λ∣. Since

ℂAr(n)/ℂ Ir(n)≅ℂSr

and pλ is a minimal idempotent of ℂSr, it follows from (4.20) that eλ‾, the image of eλ in (ℂAk(n))/ (ℂIr(n)), is a minimal idempotent in (ℂAk(n))/ (ℂIr(n)). Thus

( ℂAk(n) ℂIr(n) ) e‾λ is a simple  (ℂAk(n))/ (ℂIr(n)) -module.

Since the projection ℂAk(n)→ (ℂAk(n))/ (ℂIr(n)) is surjective, any simple (ℂAk(n))/ (ℂIr(n))-module is a simple ℂAk(n)-module.

□

Notes and References

This is an excerpt of a paper entitled Partition algebras, written by Tom Halverson (Mathematics and Computer Science, Macalester College, Saint Paul, MN 55105, United States) and Arun Ram.

This research was supported in part by National Science Foundation Grant DMS-0100975. This research was also supported in part by the National Science Foundation (DMS-0097977) and the National Security Agency (MDA904-01-1-0032).

page history