A Glimpse of Representation and Character Theory
Representation theory studies a group by the ways it can act linearly on a vector space. Representations are equivalent to modules over the group ring; Maschke's theorem gives complete reducibility, the Wedderburn consequences bound the irreducible degrees, and character theory reduces a representation to a trace invariant governed by the orthogonality relations and displayed in the character table of a small group.
╌╌╌╌
A finite group can act on a vector space by invertible linear maps, and representation theory studies those linear actions. They turn questions about group structure into questions about matrices, modules, and eventually a small table of complex numbers. The theory is an application of the modules-over-a-ring viewpoint, with one particular ring — the group ring — playing the role that the polynomial ring played in commutative algebra. Throughout, is a finite group, is a field, and is a vector space over ; the deepest results assume .
Representations
The homomorphism condition is the entire content: group multiplication is realized as matrix multiplication. Every group has several standard representations.1
- Trivial representation. Degree , with for all . Never faithful when .
- Regular representation. Let act on itself by left multiplication; the permutation of basis vectors gives a faithful degree- representation whose matrices are permutation matrices.
- Dihedral and quaternion. The symmetries of the -gon give a faithful degree- real representation of by an explicit rotation matrix and a reflection matrix; the quaternion group has a faithful degree- complex representation.
The group ring
A single ring built from and holds all representations of at once.
As an -vector space has the elements of as a basis, so , and sits in its center, making an -algebra.1 It is commutative exactly when is abelian, and it has zero divisors whenever : for a nonidentity of order , the element satisfies . The group ring plays the same structural role here that played for a single linear operator in the rational canonical form.
A representation and an -module are the same data. Given , define a module action by ; the module axioms hold precisely because is a homomorphism. Conversely an -module is an -vector space on which each acts invertibly and -linearly, which is a representation.1
Under this dictionary, a subspace is a submodule exactly when it is -invariant ( for all ), and two representations are equivalent when their modules are isomorphic — equivalently, related by a single change of basis with for all .1
Complete reducibility
We break a representation into indivisible pieces.
In matrix terms, a reducible representation has a basis putting every in block upper-triangular form, and a decomposable one puts them all in block diagonal form simultaneously. Degree- representations are automatically irreducible. Whether a representation can be fully broken apart depends on the field.
The proof averages a vector-space projection over the group to make it -equivariant:
which requires exactly that be invertible in .1 The result is an -module projection onto whose kernel is the complement . When has characteristic — in particular — the hypothesis is automatic.
The hypothesis is essential. Over with of order acting on a -dimensional space by a single Jordan block, the invariant line has no invariant complement: the module is reducible but indecomposable, so not completely reducible.1 Modular representation theory, over fields whose characteristic divides , is a separate and harder subject.
The Wedderburn count
Complete reducibility says is semisimple, and Wedderburn's theorem describes such a ring as a direct product of matrix algebras over . Character theory uses only two numerical consequences, both constraining the irreducibles.2
The sum-of-squares identity comes from decomposing the regular representation, which contains each irreducible exactly times, so . Separately, the number of degree- representations equals the index of the commutator subgroup, since a degree- representation factors through the abelianization .2
These constraints often force a unique list of degrees.
Characters
The trace of compresses a whole matrix into one scalar, and over the resulting function on already determines the representation up to equivalence. Writing down matrices of degree is unnecessary.
Because trace is conjugation-invariant, , so every character is a class function. Two basic values are read off immediately: is the degree of the representation, and equivalent representations have equal characters, since similar matrices have equal traces.3 The character of the trivial representation is the constant , called the principal character.
Class functions form a vector space of dimension (one basis function per conjugacy class), and the number of irreducible characters is also . Putting a Hermitian inner product on this space makes the irreducibles an orthonormal basis.
Orthonormality gives an immediate irreducibility test: a character has if and only if it is irreducible, and the multiplicity of in any representation with character is . The companion statement about columns is the second orthogonality relation: distinct columns of the table below are orthogonal, and the squared column norm at is .3
The character table
The character table of arranges the values in a grid: one row per irreducible character, one column per conjugacy class. It is a square array, and it is a near-complete fingerprint of the group.
For the symmetric group , there are three conjugacy classes — the identity, the three transpositions, and the two -cycles — hence three irreducible characters. The degrees are from the count above. The two degree- characters are the trivial and sign homomorphisms, and the degree- character is found by orthogonality.4
| class size | |||
The same method builds the tables of and , each with four degree- characters and one degree- character. The two groups share an identical character table even though they are not isomorphic, so the table does not always determine the group.4
Multiplicities read off the same inner product. The regular representation decomposes with each irreducible appearing as often as its degree.
Further directions
Character theory converts group-theoretic questions into linear algebra over a finite table. Counting solutions, detecting normal subgroups (a normal subgroup is a union of conjugacy classes, visible as a set of columns), and Burnside's theorem that groups of order are solvable all reduce to manipulating characters. Two generalizations extend the theory: induced characters, which build representations of from those of a subgroup, and modular representation theory over fields where Maschke's theorem fails and the group ring is no longer semisimple. Both study a group through the modules over its group ring — the same module-theoretic lens the commutative-algebra capstone applied to polynomial rings.
Footnotes
- Dummit & Foote, §18.1 — linear and matrix representations, the group ring as an -algebra, the equivalence between representations and -modules, invariant subspaces as submodules, and Maschke's theorem with the averaging projection. ↩ ↩2 ↩3 ↩4 ↩5 ↩6
- Dummit & Foote, §18.2 — Wedderburn's theorem, semisimplicity of , the finiteness of the irreducibles, the identity , and the count of degree- representations. ↩ ↩2 ↩3
- Dummit & Foote, §18.3 — characters as traces, class functions, the equality of the number of irreducible characters with the number of conjugacy classes, the Hermitian inner product, and the first and second orthogonality relations. ↩ ↩2 ↩3
- Dummit & Foote, §19.1 — the character table, the tables of , , , and , and the fact that and share a character table without being isomorphic. ↩ ↩2 ↩3
╌╌ END ╌╌