Character Tables and Examples
Character tables provide complete catalogs of irreducible representations for finite groups, enabling explicit computations and classifications.
The symmetric group has three conjugacy classes: , transpositions , and 3-cycles . The character table is:
| Rep | | | | |-----|-----|--------|---------| | | 1 | 1 | 1 | | | 1 | -1 | 1 | | | 2 | 0 | -1 |
The rows are orthonormal under the inner product .
To construct the character table of a finite group :
- Find conjugacy classes: Partition into conjugacy classes
- Count irreducibles: There are irreducible representations (one for each class)
- Find dimensions: If , then
- Compute characters: Use known representations (trivial, regular, permutation) and orthogonality
- Verify orthogonality: Check
The dihedral group (symmetries of a square) has order 8 and five conjugacy classes. The dimensions satisfy . The character table:
| Rep | | | | | | |-----|-----|-------|----------|-----------|------------| | | 1 | 1 | 1 | 1 | 1 | | | 1 | 1 | 1 | -1 | -1 | | | 1 | 1 | -1 | 1 | -1 | | | 1 | 1 | -1 | -1 | 1 | | | 2 | -2 | 0 | 0 | 0 |
where is rotation by and is a reflection.
The character table satisfies column orthogonality: where is the centralizer of in .
This complements the row orthogonality from Schur's relations.
Character tables have been computed for:
- All groups of order (available in GAP, Magma)
- All sporadic simple groups
- Many families: cyclic, dihedral, symmetric, alternating, classical groups
The character tables of symmetric groups are indexed by partitions of , with beautiful combinatorial structure (Young tableaux, Frobenius formula). Computing characters of large symmetric groups is a major area of algebraic combinatorics.
Given the regular representation of with character , we compute:
Thus , confirming that each irreducible appears with multiplicity equal to its dimension.