## Group Actions and Representations

From the module perspective, we’re led back to the concept of a group action. This is like a -module, but “discrete”. Let’s just write down the axioms for easy reference: we’ve got a set and a function such that

- preserves the identity: .
- preserves the group operation: .

Notice how this looks almost exactly like the axioms for a -module, except since is just a set we don’t have any sense of “linearity”.

Now, from a group action on a finite set we can get a finite-dimensional representation. We let — the vector space defined to have as a basis. That is, vectors in are of the form

for some complex coefficients . We get a -module by extending to a bilinear function . We already know how it behaves on the basis of the form , and the extension to a bilinear function is uniquely defined. We call the “permutation representation” associated to , and the elements for we call the “standard basis”.

As an example, the group is defined from the very beginning by the fact that it acts on the set by shuffling the numbers around. And so we get a representation from this action, which we call the “defining representation”. By definition, it has dimension , since it has a basis given by . To be even more explicit, let me write out the defining matrix representation for . Technically, going from an abstract representation to a matrix representation requires not just a basis, but an *ordered* basis, but the order should be pretty clear in this case. And so, with no further ado:

To see how this works, note that the permutation sends to . Similarly, we find that . That is:

We also see that composition of permutations turns into matrix multiplication. For example, . In terms of the matrices we calculate:

You can check for yourself all the other cases that you care to.

Notice that in general the matrices are index by two elements of , and the matrix element — the one in the th row and th column — is . That is, it’s if — if the action of sends to — and otherwise. This guarantees that every entry will be either or , and that each row and each column will have exactly one . Such a matrix we call a “permutation matrix”, and we see that the matrices that occur in permutation representations are permutation matrices.

[…] as with any group action on a finite set, we get a finite-dimensional permutation representation. The representing space has a standard basis corresponding to the elements of . That is, to every […]

Pingback by The (Left) Regular Representation « The Unapologetic Mathematician | September 17, 2010 |

[…] around the cosets. That is, we have a group action of on the quotient set , and this gives us a permutation representation of […]

Pingback by Coset Representations « The Unapologetic Mathematician | September 20, 2010 |

[…] an example, consider the defining representation of , which is a permutation representation arising from the action of on the set . This representation comes with the standard basis , and […]

Pingback by Reducibility « The Unapologetic Mathematician | September 23, 2010 |

[…] take to be a permutation representation coming from a group action on a finite set that we’ll also call . It’s straightforward […]

Pingback by Characters of Permutation Representations « The Unapologetic Mathematician | October 19, 2010 |

[…] trivial representation sends every group element to the identity matrix, whose trace is . We also know that every character’s value on the identity element is the degree of the corresponding […]

Pingback by The Character Table of a Group « The Unapologetic Mathematician | October 20, 2010 |

[…] we have any other representations of to work with? Well, there’s the defining representation. This has a character we can specify by the three […]

Pingback by One Complete Character Table (part 1) « The Unapologetic Mathematician | October 26, 2010 |

[…] can find such a complement if we have a -invariant inner product on our space. And, luckily enough, permutation representations admit a very nice invariant inner product! Indeed, just take the inner product that arises by […]

Pingback by One Complete Character Table (part 2) « The Unapologetic Mathematician | October 27, 2010 |

[…] step is to compute the character of as a left -module. The nice thing here is that it’s a permutation representation, and that means we have a shortcut to calculating its character: is the number of fixed point of […]

Pingback by Decomposing the Left Regular Representation « The Unapologetic Mathematician | November 17, 2010 |

[…] that we have an action of on the Young tabloids of shape , we can consider the permutation representation that corresponds to it. Let’s consider a few […]

Pingback by Permutation Representations from Partitions « The Unapologetic Mathematician | December 14, 2010 |