Restricting and Inducing Representations
Two of the most interesting constructions involving group representations are restriction and induction. For our discussion of both of them, we let be a subgroup; it doesn’t have to be normal.
Now, given a representation , it’s easy to “restrict” it to just apply to elements of
. In other words, we can compose the representing homomorphism
with the inclusion
:
. We write this restricted representation as
; if we are focused on the representing space
, we can write
; if we pick a basis for
to get a matrix representation
we can write
. Sometimes, if the original group
is clear from the context we omit it. For instance, we may write
.
It should be clear that restriction is transitive. That is, if is a chain of subgroups, then the inclusion mapping
is the exactly composition of the inclusion arrows
and
. And so we conclude that
So whether we restrict from directly to
, or we stop restrict from
to
and from there to
, we get the same representation in the end.
Induction is a somewhat more mysterious process. If is a left
-module, we want to use it to construct a left
-module, which we will write
, or simply
if the first group
is clear from the context. To get this representation, we will take the tensor product over
with the group algebra of
.
To be more explicit, remember that the group algebra carries an action of
on both the left and the right. We leave the left action alone, but we restrict the right action down to
. So we have a
-module
, and we take the tensor product over
with
. We get the space
; in the process the tensor product over
“eats up” the right action of
on the
and the left action of
on
. The extra left action of
on
leaves a residual left action on the tensor product, and this is the left action we seek.
Again, induction is transitive. If is a chain of subgroups, and if
is a left
-module, then
The key step here is that . But if we have any simple tensor
, we can use the relation that lets us pull elements of
across the tensor product. We get
. That is, we can specify any tensor by an element in
alone.

I’m enjoying every step, John. Have a happy Thanksgiving.
In my daily 2,000 words of new fiction writing (over 300,000 words since the regimen was self-imposed on the advice of Stephen King and Ray Bradbury) I found myself this morning trying to explain why it would be preposterous to discover tensor calculus computations on a 3,750-year-old Babylonian clay tablet.
In this science fiction story, tablets are unburied which have Clebsch–Gordan coefficients and Calabi-Yau manifold tables. The poor NSA officer is trying to explain to the President of the United States.
[...] want to work out the matrices of induced representations. Explicitly, if is a left -module of degree , where is a subgroup of , then is a left -module. [...]
Pingback by Induced Matrix Representations « The Unapologetic Mathematician | November 25, 2010 |
[...] of Induced Representations We know how to restrict and induce representations. Now we want to see what this looks like on the level of [...]
Pingback by Characters of Induced Representations « The Unapologetic Mathematician | November 29, 2010 |
[...] Today, we can prove the Frobenius’ reciprocity formula, which relates induced characters to restricted [...]
Pingback by (Fake) Frobenius Reciprocity « The Unapologetic Mathematician | November 30, 2010 |
[...] Before we can prove the full version of Frobenius reciprocity, we need to see that induction and restriction are actually additive [...]
Pingback by Induction and Restriction are Additive Functors « The Unapologetic Mathematician | December 1, 2010 |
[...] Now we come to the real version of Frobenius reciprocity. It takes the form of an adjunction between the functors of induction and restriction: [...]
Pingback by (Real) Frobenius Reciprocity « The Unapologetic Mathematician | December 3, 2010 |
[...] really should see an example of inducing a representation. One example we’ll find extremely useful is when we start with the trivial [...]
Pingback by Inducing the Trivial Representation « The Unapologetic Mathematician | December 6, 2010 |
[...] they’re restricted to , it also tells us how representations of decompose when they’re induced to [...]
Pingback by The Branching Rule, Part 3 « The Unapologetic Mathematician | January 31, 2011 |
[...] we see, the right hand side is obvious, but he left takes a little more work. We consult the definition of induction to [...]
Pingback by The Branching Rule, Part 4 « The Unapologetic Mathematician | February 1, 2011 |