Properties of Induction
Induced representations satisfy important functorial properties and compatibility with various representation-theoretic operations.
Let be a tower of subgroups, and let be a representation of . Then:
Induction is transitive: we can induce in stages.
Proof idea: A function satisfying for is equivalent to a function satisfying for .
For finite groups, if is the character of (an -representation), the character of is:
Equivalently, using class functions on extended by zero: where are coset representatives for in .
from : Let with trivial representation. The coset representatives are . For :
- Check conjugated by each representative
- Only contributes 0
- Result:
For :
- : contributes
- : contributes 0
- Result:
The induced character is , which is the permutation representation.
- Direct sums:
- Tensor products: For a -representation and an -representation: where denotes a relative tensor product
These properties show that induction is a functor from to , preserving the categorical structure. This functorial perspective is crucial in modern representation theory, leading to concepts like derived functors, Mackey theory, and categorical representation theory.
The induced character formula is computationally essential: it allows us to compute characters of induced representations without explicitly constructing the representation, using only character values on the subgroup.