## Reducibility

We say that a module is “reducible” if it contains a nontrivial submodule. Thus our examples last time show that the left regular representation is always reducible, since it always contains a copy of the trivial representation as a nontrivial submodule. Notice that we have to be careful about what we mean by each use of “trivial” here.

If the -dimensional representation has a nontrivial -dimensional submodule — and — then we can pick a basis of . And then we know that we can extend this to a basis for all of : .

Now since is a -invariant subspace of , we find that for any vector and the image is again a vector in , and can be written out in terms of the basis vectors. In particular, we find , and all the coefficients of through are zero. That is, the matrix of has the following form:

where is an matrix, is an matrix, and is an matrix. And, in fact, this same form holds for all . In fact, we can use the rule for block-multiplying matrices to find:

and we see that actually provides us with the matrix for the representation we get when restricting to the submodule . This shows us that the converse is also true: if we can find a basis for so that the matrix has the above form for every , then the subspace spanned by the first basis vectors is -invariant, and so it gives us a subrepresentation.

As 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 it’s easy to see that every permutation leaves the vector — along with the subspace that it spans — fixed. Thus carries a copy of the trivial representation as a submodule of . We can take the given vector as a basis and throw in two others to get a new basis for : .

Now we can take a permutation — say — and calculate its action in terms of the new basis:

The others all work similarly. Then we can write these out as matrices:

Notice that these all have the required form:

Representations that are not reducible — those modules that have no nontrivial submodules — are called “irreducible representations”, or sometimes “irreps” for short. They’re also called “simple” modules, using the general term from category theory for an object with no nontrivial subobjects.

[...] Today I’d like to cover a stronger condition than reducibility: decomposability. We say that a module is “decomposable” if we can write it as the [...]

Pingback by Decomposability « The Unapologetic Mathematician | September 24, 2010 |

[...] than any particular invariant form is this: if we have an invariant form on our space , then any reducible representation is decomposable. That is, if is a submodule, we can find another submodule so that [...]

Pingback by Invariant Forms « The Unapologetic Mathematician | September 27, 2010 |

[...] saw last time that in the presence of an invariant form, any reducible representation is decomposable, and so any representation with an invariant form is completely [...]

Pingback by Maschke’s Theorem « The Unapologetic Mathematician | September 28, 2010 |

[...] that we call a -module irreducible or “simple” if it has no nontrivial submodules. In general, an object in any category [...]

Pingback by Schur’s Lemma « The Unapologetic Mathematician | September 30, 2010 |

[...] start our considerations by letting by any matrix irrep, and let’s calculate its commutant algebra. By definition for any we have for all . We can [...]

Pingback by Endomorphism and Commutant Algebras « The Unapologetic Mathematician | October 1, 2010 |

[...] We want to calculate commutant algebras of matrix representations. We already know that if is an irrep, then , and we’ll move on from [...]

Pingback by Some Commutant Algebras « The Unapologetic Mathematician | October 4, 2010 |

[...] More Commutant Algebras We continue yesterday’s discussion of commutant algebras. But today, let’s consider the direct sum of a bunch of copies of the same irrep. [...]

Pingback by More Commutant Algebras « The Unapologetic Mathematician | October 5, 2010 |

[...] one copy of the trivial representation and no copies of the signum representation. In fact, we already knew about the copy of the trivial representation, but it’s nice to see it confirmed again. [...]

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

[...] The secret is to look at the block diagonal form from when we defined reducibility: [...]

Pingback by An Alternative Path « The Unapologetic Mathematician | October 28, 2010 |