Representation Theory of Finite Groups

Representation theory translates the abstract algebraic structure of a group into the concrete language of linear algebra, allowing us to use powerful tools like matrices and vector spaces to understand symmetry. This bridge is indispensable, making complex group-theoretic problems tractable and finding profound applications in physics, chemistry, and combinatorics. By studying how a group can "act" on a space, we uncover its deepest structural secrets.

From Symmetry to Matrices: Defining Representations

At its core, a representation of a finite group $G$ is a way to realize its elements as invertible matrices in a way that respects the group's multiplication. Formally, it is a homomorphism $\rho :G\to GL(V)$, where $V$ is a finite-dimensional vector space over a field (typically the complex numbers $\mathbb{C}$) and $GL(V)$ is the group of invertible linear transformations on $V$. The map $\rho$ must satisfy $\rho (gh)=\rho (g)\rho (h)$ for all $g,h\in G$.

The dimension of the representation is the dimension of the vector space $V$. For example, the symmetric group $S_3$ (the group of permutations of three objects) has a natural 3-dimensional representation where each permutation acts by permuting the basis vectors of ${\mathbb{C}}^3$. A more efficient 2-dimensional representation of $S_3$ exists, showcasing that different representations can capture the same group structure in varying levels of "economy." The primary goal is to break down complex representations into fundamental, indivisible building blocks.

Decomposition and Irreducibility: Maschke's Theorem and Beyond

A subspace $W$ of $V$ is called a subrepresentation if it is invariant under the action of all group elements, i.e., $\rho (g)w\in W$ for all $g\in G,w\in W$. A representation is called irreducible if it has no non-trivial proper subrepresentations. Irreducible representations (or "irreps") are the atomic units of representation theory.

Maschke's theorem is the foundational result that guarantees we can decompose any finite group representation (over a field like $\mathbb{C}$ where the group's order is invertible) into a direct sum of irreducible ones. This means if $(\rho ,V)$ is a representation of $G$, then $V$ is isomorphic to a direct sum $V_1^{\oplus a_1}\oplus V_2^{\oplus a_2}\oplus \cdots \oplus V_k^{\oplus a_k}$, where each $V_i$ is an irreducible representation and $a_i$ is its multiplicity. This theorem reduces the study of all representations to the classification of irreducible ones.

The Power of Characters: Character Theory

Tracking every entry of the matrices $\rho (g)$ is cumbersome. Character theory provides an elegant solution. The character ${\chi }_{\rho }$ of a representation $\rho$ is the function ${\chi }_{\rho }:G\to \mathbb{C}$ defined by ${\chi }_{\rho }(g)=\text{Tr}(\rho (g))$, the trace of the representing matrix. Characters are constant on conjugacy classes of $G$ (class functions) and, remarkably, they encode nearly all the essential information about the representation.

The key advantages are:

• The character of a direct sum is the sum of the characters: ${\chi }_{\rho \oplus \sigma }={\chi }_{\rho }+{\chi }_{\sigma }$.
• The irreducible characters (characters of irreducible representations) form an orthonormal basis for the space of class functions under a specific inner product. This orthogonality relation allows us to compute the multiplicity $a_i$ of an irrep in a larger representation via a simple formula: $a_i=⟨\chi ,{\chi }_i⟩$.
• Characters provide a practical test for irreducibility: a representation is irreducible if and only if $⟨\chi ,\chi ⟩=1$.

Schur's Lemma and the Algebra of Intertwiners

How do different representations relate to each other? A $G$-linear map (or intertwiner) between two representations $(\rho ,V)$ and $(\sigma ,W)$ is a linear map $T:V\to W$ that commutes with the group action: $T\circ \rho (g)=\sigma (g)\circ T$ for all $g\in G$.

Schur's lemma describes the structure of these maps between irreducible representations. It states two fundamental facts:

1. If $V$ and $W$ are non-isomorphic irreducible representations, then every $G$-linear map from $V$ to $W$ is the zero map.
2. If $V=W$ is an irreducible representation over $\mathbb{C}$, then every $G$-linear map from $V$ to itself is a scalar multiple of the identity map, $T=\lambda I$.

This lemma is a powerful tool for proving orthogonality relations and is the bedrock of many uniqueness arguments in the theory.

Applications: From Crystals to Quantum States

Representation theory is not an abstract pursuit; it is the language of symmetry in applied sciences.

• Crystallography: The crystalline structure of a material is defined by its space group—a discrete group of symmetries including rotations, reflections, and translations. Analyzing how these symmetries act on the physical crystal lattice (a representation) and its vibrational modes (another representation) using character theory predicts phenomena like spectroscopic selection rules and the degeneracy of energy bands.
• Quantum Mechanics: Symmetry dictates degeneracy. In quantum systems, the Hamiltonian's symmetry group $G$ acts on the space of quantum states. This space decomposes into irreducible representations of $G$. States belonging to the same irrep are guaranteed to have the same energy (they are degenerate). For instance, the $2\ell +1$ degeneracy of atomic orbitals (s, p, d,...) arises because they transform under irreducible representations of the rotation group $SO(3)$.
• Combinatorial Identities: A classic application is Burnside's lemma (or the Pólya enumeration theorem), which counts distinct colorings of an object under a group of symmetries. The formula is essentially a simple average of fixed points, but its generalization through character theory leads to powerful enumerative results that solve complex combinatorial problems by weighting colorings according to their symmetry.

Common Pitfalls

1. Confusing the group with its representation: A representation is a model of the group using matrices, not the group itself. Different representations (e.g., 2D vs. 3D) of the same group can exist. Always distinguish between the abstract group element $g$ and the matrix $\rho (g)$ that represents it.
2. Misapplying Maschke's theorem: Maschke's theorem requires the field's characteristic to not divide the order of the group $|G|$. Over a field like ${\mathbb{F}}_2$ (characteristic 2) representing a group of even order, a representation may not decompose into irreducibles, leading to "modular representation theory," which is more complex.
3. Overlooking conjugation invariance: A character $\chi (g)$ is only dependent on the conjugacy class of $g$. Calculating $\chi (g)$ and $\chi (h)$ separately when $g$ and $h$ are conjugate is redundant work. Organizing calculations by conjugacy class is essential for efficiency.
4. Assuming Schur's lemma applies to reducible representations: Schur's lemma's powerful conclusions about intertwiners being zero or scalar apply only when the domain and codomain are irreducible. For reducible representations, intertwiners can have rich, non-scalar structure.

Summary

• A representation makes an abstract group concrete by expressing its elements as invertible matrices acting on a vector space, preserving the group structure via a homomorphism.
• Maschke's theorem ensures that over suitable fields (like $\mathbb{C}$), every representation of a finite group can be broken down into a direct sum of fundamental, irreducible representations.
• Character theory simplifies analysis by replacing matrices with their traces; the irreducible characters are orthonormal and provide a computable method to decompose representations and check irreducibility.
• Schur's lemma governs the structure of maps between representations, stating that non-zero intertwiners between distinct irreps cannot exist, and those from an irrep to itself must be scalar multiples of the identity.
• The theory is widely applied, providing the framework for analyzing symmetry in crystallography, explaining degeneracy in quantum mechanics, and deriving powerful combinatorial identities.