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 and
the partition algebra
is the associative algebra over
with basis
where, for
is the product in the monoid
and is the number of blocks removed from the middle row when constructing the composition
For example,
since two blocks are removed from the middle row. There are inclusions of algebras given by
For
define
i.e., and in the same block of implies that and
are in the same block of Let
be the basis of uniquely defined by the relation
Under any linear extension of the partial order the transition matrix between the basis
of and the basis
of is upper triangular with 1s on the diagonal and
so the are well defined.
The maps
Let Define linear maps
so that is the same as
except that the block containing and the block containing
are combined, and has the same
blocks as except with and removed. There is a
factor of in
if the removal of and reduces the number of blocks by 1. For example,
and
The map is the composition
The composition of and
is the map
By drawing diagrams it is straightforward to check that, for
and
Define and
by the equations
so that
Pictorially
where is the number of connected components in the closure of the diagram
The ideal
For define
By (1.3),
since the set partitions with propagating number are exactly the permutations in the symmetric group
(by convention
for
see (2.2)).
View as an algebra (without identity). Since
and is semisimple,
Since
is an ideal in
the quotient
is semisimple. Therefore
On the other hand, since
is an ideal of nilpotent elements in
it is an ideal of nilpotent elements in and so
Thus
Let By (2.5) the maps
are
and
homomorphisms, respectively. The corresponding basic constructions (see Section 4) are the algebras
with products given by
for
and for
Let
Then, by the relations in (2.6) and the fact that
the maps
are algebra isomorphisms. Thus the ideal 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
Any partition can be identified with the sequence
and the conjugate partition to is the partition
The hook length of the box of is
Write if is a partition with boxes. In the example
above, and
See [Mac1995, Section I.7] for details on the representation theory of the symmetric group. The irreducible
are indexed by the elements of
For and
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 given by setting
It encodes the decompositions in (2.20). The first few levels of are given by
For define
so that is the set of paths from
to
in the graph
In terms of the Young lattice,
This is a translation of the classical statement (see [Mac1995, Section I.7.6(ii)]) that
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 step
of the path).
Structure of the algebra
Build a graph by setting
The first few levels of A^ are given by
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.
For all but a finite number of n∈ℂ the algebra
ℂAk(n) is semisimple.
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^ℓandT(ℓ)→T(ℓ+12)is an edge inA^}
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,
identifyP=(P(0),P(1),…,P(k))∈S^kμwith the correspondingP=(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
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 graphA^.
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).
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.
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 andtrℓ-1μ(n)≠0for allμ∈A^ℓ-1 then
ℂAℓ(n)is semisimple if and only iftrℓ-12λ(n)≠0for 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.
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-submodulesV1 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
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∈ℂ,
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,ℤ⟼,ifkis an integer, andA∣λ∣+12,ℤ⟶Ak,ℤ⟼,ifk-12is an integer.
For k∈12ℤ>0,
define an Ak,ℤ-module homomorphism
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).