This post continues my series on representation theory in complex rank, begun here with a discussion of Deligne’s interpolation of the representation categories of the symmetric group, introduced in his 2004 paper.
Semisimplicity is the basic structure theorem for Deligne’s categories, and I would be extremely remiss in my discussion of representation theory in complex rank if I did not say something about it.
So, let’s review. In the first post, I explained and motivated the definition of Deligne’s categories . Incidentally, Deligne did the same for the other classical groups, i.e. , but I shall not discuss them. The categories , are defined as the pseudo-abelian envelope of the -linear category generated by objects , where the hom-spaces are free on the equivalence relations on , and composition is given by a combinatorial expression which is polynomial in the rank (hence interpolable).
Now, we just have an abstract category with formal objects and morphisms corresponding in no obvious way to anything concrete. To prove it is semisimple, we cannot use therefore techniques such as those in the proof of Maschke’s theorem of Weyl’s complete reducibility theorem.
But we can do it by appealing to what I discussed in the second post of this series: by proving that the endomorphism rings are semisimple and the category is nonnilpotent. In fact, since direct products and factor rings of semisimple rings are semisimple, we only need to prove that the algebras are semisimple (in addition to nonnilpotence). This endomorphism ring (depending on the size and the rank ) is an important object, called the partition algebra, and you can look it up e.g. here. But I don’t know how to prove directly that the partition algebra is semisimple. So I will follow Deligne (and Knop) in the (inductive) proof (which will also imply semisimplicity of the partition algebra).
I will do this in two steps. First, I will use a little bit of combinatorics to show that when , the category is nonnilpotent. Next, I will use this to prove semisimplicity.
1. Vanishing of the radical
We will now check that Deligne’s categories are nonnilpotent in the sense of this post. This will be a crucial ingredient in proving semisimplicity.
We will show that
for the last map the trace, is nondegenerate. This clearly implies that the category is nonnilpotent, for then composition is nondegenerate (because the trace of zero is zero), and so if is nonzero, there exists with .
To do this, it reduces to the case of because everything is a direct factor of a direct sum of these. Now we will pull out a bit of general magic for symmetric tensor categories. As is well-known, we have a functorial isomorphism and . The bilinear form corresponds to composition
As a result, we just have to check that
For the results I’ve dismissed as “well-known”, readers may look at Deligne’s review of what he calls “multilinear algebra” in his paper. I don’t really understand all this abstract nonsense as well as I should, but at any rate it’s not suited for a blog post, even on a blog with Bourbaki in the title. So I will just assume this. If you don’t feel like doing that, you could also use the fact that these equalities become polynomial identities(!) in in the family of categories , and their holding at the large nonnegative integers implies them everywhere, a theme that will become recurrent…
Anyway. Now, the unital object is . A member of (or can be represented as a formal sum of requivalence relations on .
So, to prove nondegenerate, it suffices to show it when . Now in this case, nondegenerate for , and we will compute for equivalence relations on .
The problem is, we never really worked out the right way to compose these formal symbols . Or rather, to be honest, I thought I did, and posted it on my blog earlier. But I was wrong. I’ve revised it since to say that the law is “polynomial in the rank,” but the polynomial I initially said it was was wrong. It’s not a huge deal—I’m just going to end up being slightly less complete with respect to some of the more combinatorial aspects of Deligne’s categories. (If you’re mad at me, you can take a look at some of the references I’ve given there. It won’t interfere with the story.)
But now we need to know what is, and thus the lack of a computation becomes an obstacle! Fortunately, the computation is easier when one of the objects is .
Lemma 1 Let be equivalence relations on and let the associated morphisms in . Then , where depends only on .
Here is the Kronecker delta, and this means that is given by a diagonal matrix whose entries on the diagonal are given by this polynomial in . And thus will be nondegenerate for all iff . So the nonnilpotence of Deligne’s categories will follow once we’ve handled this lemma.
The proof of this lemma will consist of a useful trick, namely the reduction to the integral case. Namely, if this is true for , it must be true for all (because it is a polynomial identity). So suppose . In fact, we can suppose that , and we can pretend that we’re working on the ordinary category of representations of , where is the regular representation.
The morphism corresponds to the -invariant element , where ranges over functions inducing the relation . The morphism sends each for inducing to 1. It is thus clear that if .
What if ? Then we just have to count the number of inducing the relation . Now corresponds to a partition of into equivalence classes , and to say that induces the relation means that is constant on each and sends each to a different point in . There are thus different choices of , and the lemma follows.
So, we now know that the Deligne categories are nonnilpotent. In fact, Deligne proves a theorem that whenever the trace form is nondegenerate, the category is necessarily semisimple. I won’t go there, though, because I want to do the inductive proof that actually tells you what the simple objects look like.
2. The inductive argument
And now for the proof of semisimplicity. This is the first big result in Deligne’s paper:
Theorem 2 If , the category is semisimple.
In fact, we will show that the simple objects are parametrized by the partitions (equvilanetly, Young diagrams) of arbitrary size. I will explain why this is only natural at the end.
2.1. The filtration on
In proving this, we should start by noting that is a pretty big category because in , is allowed to get large. So we define a full subcategory which is the pseudo-abelian envelope of the . Thus, we get a filtration on Deligne’s categories. Note that the elements of the filtration are not tensor categories, only pseudo-abelian ones.
The idea will be to prove that the subcategories are semisimple, and this we do by induction on . It is clearly true for (the zero category).
2.2. Splitting off a chunk
Now suppose we know that is semisimple, with simple objects for some set . The are not a priori simple when regarded as objects of (which may, for all we know, be a non-abelian category…how evil), but they are still -semisimple: that is to say, their endomorphism rings have dimension 1.
So, I claim now that if , there is a splitting
where when . In other words, we can excise the simple objects in the “smaller” category away. The idea is simple. If for some , then this is true for some simple (by semisimplicity of ) and there is a nonzero with simple. Take such that (OK because composition is a nondegenerate pairing of vector spaces); then by -simplicity is a multiple of the identity. So wlog is the identity and occurs as a direct factor in (we use pseudo-abelianness to get a complement).
So we split of a factor of isomorphic to a simple object in . We can keep on repeating this; the process will not last forever, since the hom-spaces are finite-dimensional. And this proves the claim.
2.3. Action of the symmetric group
Now, for the next step. We take ; this object, loosely speaking, is what introduces the additional simple objects in that aren’t in . We have a splitting
where an endomorphism factors through iff it factors through an element of .
We now invoke a fact familiar from Schur-Weyl duality: the symmetric group(!) acts on by permutation—ok because we are dealing with a symmetric monoidal category . So we have a map
I claim that it is an isomorphism. Indeed, it easy to see that the action of corresponds to the equivalence relation on obtained by identifying each point of (here denotes a set with elements, not to be confused with the natural numbers —sorry for the choice of notation) with its image under . So the act linearly independently on . Moreover, any map that factors through a direct sum of must be a sum of relations for an equivalence relation on that identifies a pair of distinct points in (this can be checked directly). The don’t do that, so any nontrivial linear combination of them cannot factor through anything in . And the map is thus an injection. It is even a surjection, because conversely any relation on which is not of the form for some bijection factors through a sum of smaller .
In particular, the endomorphism ring of is semisimple.
But, every object in is a direct summand of copies of and objects in . All these objects have semisimple endomorphism rings, and thus so does every object in . Since the category is nonnilpotent, it must be semisimple by the material in this post. (Note incidentally that if is an idempotent in a semisimple algebra , then is a semisimple algebra too—a fact easily proved from the structure theorem that is a product of matrix algebras.)
Whew! That was a fairly long proof. But we’re now done. We still don’t know what the simple objects look like. For that, I will resume this series in a later post.