## Symmetric Tensors

Wow, people are *loving* my zero-knowledge test. It got 1,743 views yesterday, thanks to someone redditing it. Anywho…

Today and tomorrow I want to take last Friday’s symmetrizer and antisymmetrizer and apply them to the tensor representations of , which we know also carry symmetric group representations. Specifically, the th tensor power carries a representation of by permuting the tensorands, and this representation commutes with the representation of . Then since the symmetrizer and antisymmetrizer are elements of the group algebra , they define intertwiners from to itself. The their images are not just subspaces on which the symmetric group acts nicely, but *subrepresentations* of symmetric and antisymmetric tensors — and , respectively.

Now it’s important (even if it’s not quite clear why) to emphasize that we’ve defined these representations without ever talking about a basis for . However, let’s try to get a better handle on what such a thing looks like by assuming has finite dimension and picking a basis . Then we have bases for tensor powers: a basis element of the th tensor power is given by an -tuple of basis elements for . We’ll write a general one like .

How does a permutation act on such a basis element? Well, basis elements are pure tensors, so the permutation simply permutes these basis tensorands. That is:

So the space of symmetric tensors is the image of under the action of the symmetrizer. And so it’s going to be spanned by the images of a basis for , which we can calculate now. The symmetrizer is an average of all the permutations in the symmetric group, so we find

Now we notice something here: if two basic tensors are related by a permutation of their tensorands, then the symmetrizer will send them to the *same* symmetric tensor! This means that we can choose a preimage for each basic symmetric tensor. Just use whatever permutation we need to put the -tuple of tensorands into order. That is, always select . Given any basic tensor, there is a unique permutation of its tensorands which is in this order.

As an explicit example, let’s consider what happens when we symmetrize the tensor . First of all, we toss it into the proper order, since this won’t change the symmetrization: . Now we write out a sum of all the permutations of the three tensorands, with the normalizing factor out front

Some of these terms are repeated, since we have two copies of in this tensor. So we collect these together and cancel off some of the normalizing factor to find

Now no matter how we rearrange the tensorands we’ll get back this same tensor again.

Tomorrow we’ll apply the same sort of approach to the antisymmetrizer.