Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
Last update: 9 April 2013
Schur–Weyl duality for partition algebras
Let and let be a vector space with basis
Then the tensor product
For and values
define
For example, viewing
as the diagram with vertices labeled by the values
and
we have
With this notation, the formula
defines actions
of and
on
where the second map
comes from the fact that if
then
acts on the subspace
In other words, the map is
obtained from by restricting to the subspace
and identifying
with
The group acts on the vector spaces
and by
for
View
as the subgroup of permutation matrices and let
Theorem 3.6. Let
and let
be the basis of defined in (2.3). Then
has
has
Proof.
(a) As a subgroup of
acts on via its permutation representation and
acts on by
Then
if and only if (as endomorphisms
on for all
Thus, using the notation of (3.1),
if and only if
It follows that the matrix entries of are constant on the
of its matrix coordinates. These orbits decompose
into subsets and thus correspond to set partitions It follows from (2.3) and
(3.1) that for all
Thus has 1s in
the matrix positions corresponding to and 0s elsewhere, and so is a linear combination of
Since
form a basis of
If has more than blocks, then by (3.8) the matrix entry
for all indices
since we need a distinct
for each block of Thus,
If has blocks, then we can find an index set
with
simply by choosing a distinct index from
for each block of
Thus, if has blocks then
and so
(b) The vector space
is a submodule both for
and If
then
Then as above
if and only if
The orbits of the matrix coordinates of correspond to set
partitions
that is, vertices and
must be in the same
block of The same argument as in part (a) can be used to show that
is the span of with having more than
blocks. We always choose the index for the block containing
and
The maps
and
If let
be the coefficients in the expansion
Define linear maps
The composition of and
is the map
and
The relation between the maps
in (3.10) and the maps
in Section 2 is given by
where, on the right hand side of the middle equality is viewed as an element of
via the natural inclusion
Then
and, by (3.4), if
then
The representations
and
Let
be the trivial representation of and let
be the permutation representation of given in (3.5). Then
More generally, for any
where the third isomorphism comes from the “tensor identity”,
for
and the fact that
By iterating (3.17) it follows that
As and
respectively.
If
to be the same partition as except with the first row removed. Build a graph
which encodes the decomposition of
by letting
For example, if then the first few levels of are
The following theorem is a consequence of Theorem 3.6 and the Centralizer Theorem, Theorem 5.4 (see also [GWa1998, Theorem 3.3.7]).
Theorem 3.22. Let
Let denote the irreducible
indexed by
As
where the vector spaces are
irreducible
and
As
where the vector spaces
are irreducible and
Determination of the polynomials
Let For a partiton
let
i.e., remove the first row of to get
Then, for
the maps
which provide an isomorphism between levels 0 to of the graphs
and
Proposition 3.24. For
and
such that
is semisimple, let
be the irreducible characters of and let
be the trace on defined in (2.25). Use the
notation for partitions in (2.17). For the coefficients in the expansion
If is such that
is semisimple then for the coefficients in the expansion
Proof.
Let be a partition with boxes. Beginning with the vertical edge at the end of the first row, label the boundary
edges of sequentially with
Then the
Hence
For example, if
then the boundary labels of and the hook numbers in the first row of are
Thus, since
Let and let
denote the irreducible characters of the symmetric group
By taking the trace on both sides of the equality in Theorem 3.22,
Thus the equality in (3.25) and the bijection in (3.23) provide the expansion of for all
such that
The statement for all
such that
is semisimple is then a consequence of the fact that any polynomial is determined by its evaluations at an infinite number of values of the parameter. The proof of
e expansion of is exactly analogous.
Note that the polynomials and
(of degrees
and
respectively) do not depend on
By Proposition 3.24,
For example, the first few values of and
are
Theorem 3.27. Let
and
Then is semisimple if and only if
Proof.
By Theorem 2.26(a) and the observation (3.26) it follows that
is semisimple if
Suppose is even. Then Theorems 2.26(a) and 2.26(b) imply that
since
and
Since
the
Since the path
does not correspond to an element of
Thus, Tits deformation theorem (Theorem 5.13) implies that
cannot be semisimple. Now it follows from Theorem 2.26(c) that is not semisimple for
If is odd then Theorems 2.26(a) and 2.26(b) imply that
since and
Since
the
Since the path
does not correspond to an element of
and since
the Tits deformation theorem implies that
is not semisimple. Now it follows from Theorem 2.26(c) that
is not semisimple for
Murphy elements for
Let be the element of given by
where is the transposition in which switches
and Let
and let
Define
by
For example, in if
and
then
For define
where the sum is over such that
and
For
such that
define
where the sum is over all such that
or
and
Let and, for
let
View
using the embedding in (2.2), and define and
where the sum is over
such that and
Define
For example, the first few are
and the first few are
Part (a) of the following theorem is well known.
Theorem 3.35.
For
is a central element of If is a partition with
boxes and is the irreducible
indexed by the partition
Let
Then, as operators on where
Let
Then is a central element of
and, if
is such that
is semisimple and with
boxes, then
where is the irreducible
indexed by the partition Furthermore,
is a central element of
and, if is such that
is semisimple and is a partition with
boxes, then
where is the irreducible
indexed by the partition
Proof.
(a) The element is the class sum corresponding to the conjugacy class of transpositions and thus
is a central element of
The constant by which acts on is computed in
[Mac1995, Chapter 1, Section 7, Example 7].
(c) The first statement follows from parts (a) and (b) and Theorems 3.6 and 3.22 as follows. By Theorem 3.6,
if Thus, by Theorem 3.22, if
then acts on the irreducible
by the constant given in the statement.
This means that is a central element of
for all Thus, for
for all diagrams
Since the coefficients in
(in terms of the basis of diagrams) are polynomials in
it follows that
for all
If is such that
is semisimple let
be the irreducible characters. Then acts on
by the constant
If this is the constant in the statement, and therefore it is a polynomial in
determined by its values for
The proof of the second statement is completely analogous using
and the second statement in part (b).
(b) Let so that
Then
and expanding this sum gives that
is equal to
where
corresponds to the tensor positions where 1 is acting, and where
corresponds to the tensor positions that must equal and corresponds to the tensor positions that
must equal
When the set is empty and the term corresponding to
in (3.36) is
Assume and separate the sum according to the cardinality of
Note that the sum for is equal to the sum for since the whole sum is
symmetric in and The sum of the terms in (3.36) which come from
is equal to
We get a similar contribution from the sum of the terms with
If then the sum of the terms in (3.36) which come from
is equal to
and there is a corresponding contribution from
The remaining terms can be written as
Putting these cases together gives that acts on
the same way that
acts on
Note that if
Hence
acts on
the same way that
acts on
and so
as operators on This proves the first statement.
For the second statement, since
The first sum is known to equal
by the computation proving the first statement, and the last sum has only one nonzero term, the term corresponding to
Expanding the middle sum gives
where the inner sum is over all
such that or
As in part (a) this sum is treated in four cases: (1) when
(2) when or
(3) when
or
and (4) the remaining cases. Since the first case does not occur, and cases
(2)–(4) are as in part (a) giving
Combining this with the terms
and
gives that
acts on as
Thus acts on
as
so, as operators on we have
By the first statement in part (c) of this theorem we get
Theorem 3.37. Let
and let
The elements
all commute with each other in
Assume that is semisimple. Let
so that
is a partition with boxes, and let
be the irreducible
indexed by Then there is a unique, up to multiplication by constants, basis
of such that, for all
and such that
and
where denotes the box where and differ.
Proof.
(a) View
Then
so
for all Since
we see that the commute with each other in
(b) The basis is defined inductively. If or 1, then
so up to a constant there is a unique choice for the basis. For we consider the restriction
The branching rules for this restriction are multiplicity free, meaning that each
that shows up in does so exactly once.
By induction, we can choose a basis for each
and the union of these bases forms a basis for
For
so acts on this basis as in the statement of the theorem. It remains only to check the statement for
Let be an integer, and let
and
such that
and
Then by Theorem 3.35(c),
acts on by the constant
and
acts on
by the constant
The result now follows from (3.23) and the observation that
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).