Character Tables and the Orthogonality Theorem

⚡ Key Takeaways

Character tables are square arrays encoding the traces of the irreducible matrix representations of a finite group; the Great Orthogonality Theorem states that the matrix elements (and hence the characters) of distinct irreducible representations are mutually orthogonal as vectors over the group. Together they reduce all questions about how a group acts linearly into simple arithmetic of integers. Used pervasively in chemistry (molecular vibrations, spectroscopy), crystallography, and quantum mechanics. Foundational work by Frobenius (1896) and Schur (1905).

💡 The Core Insight

The space $\mathbb{C}[G]$ of all complex functions on a finite group carries a natural Hermitian inner product. The matrix coefficients of irreducible representations are orthogonal vectors in this space, and their lengths are fixed by the dimension of the representation. Taking traces collapses this to class functions (functions constant on conjugacy classes), where the irreducible characters form a complete orthonormal basis. Hence representation theory of finite groups is, at heart, Euclidean geometry in a finite-dimensional space whose coordinates are group elements.

DefinitionRepresentation, Irreducibility, Character

Let $G$ be a finite group of order $|G| = n$ .

A (complex linear) representation is a homomorphism $\rho: G \to GL(V)$ where $V$ is a finite-dimensional $\mathbb{C}$ -vector space of dimension $d = \dim V$ , called the degree or dimension of $\rho$ .
$\rho$ is irreducible if $V$ has no $G$ -invariant subspace other than $\{0\}$ and $V$ .
The character of $\rho$ is $\chi_\rho: G \to \mathbb{C}$ , $\chi_\rho(g) = \operatorname{tr}\rho(g)$ .
Two representations are equivalent ( $\cong$ ) if related by a change of basis: $\rho'(g) = T\rho(g)T^{-1}$ for a fixed invertible $T$ .

We write $\rho_{ij}(g)$ for the $(i,j)$ matrix entry of $\rho(g)$ in a chosen basis.

TheoremGreat (Schur) Orthogonality of Matrix Coefficients

Let $\rho^{(\alpha)}$ and $\rho^{(\beta)}$ be inequivalent irreducible unitary representations of $G$ , of dimensions $d_\alpha, d_\beta$ . Then for all index choices,

2

\quad \frac{1}{|G|}\sum_{g\in G} \rho^{(\alpha)}_{ij}(g)\,\overline{\rho^{(\beta)}_{kl}(g)} \;=\; \frac{1}{d_\alpha}\,\delta_{\alpha\beta}\,\delta_{ik}\,\delta_{jl}.

Derivation hint: apply Schur's Lemma to the averaged operator $M = \frac{1}{|G|}\sum_g \rho^{(\alpha)}(g)\,A\,\rho^{(\beta)}(g)^{-1}$ for arbitrary $A$ ; it intertwines the two representations.

TheoremFirst Orthogonality Relation for Characters

For irreducible characters $\chi_\alpha, \chi_\beta$ ,

3

\quad \langle \chi_\alpha, \chi_\beta \rangle \;=\; \frac{1}{|G|}\sum_{g\in G} \chi_\alpha(g)\,\overline{\chi_\beta(g)} \;=\; \delta_{\alpha\beta}.

Derivation hint: set $i=j$ and $k=l$ in [2] and sum over $i$ and $k$ ; the right-hand side gives $\frac{1}{d_\alpha}\delta_{\alpha\beta}\sum_{i}\sum_k \delta_{ik}\delta_{ik} = \delta_{\alpha\beta}$ .

TheoremSecond Orthogonality Relation (Column Orthogonality)

For two conjugacy classes with representatives $g_s, g_t$ , summing over all irreducible characters,

5

\quad \sum_{\alpha} \chi_\alpha(g_s)\,\overline{\chi_\alpha(g_t)} \;=\; \delta_{st}\,\frac{|G|}{|C_t|} \;=\; \delta_{st}\,|Z(g_t)|,

where $Z(g_t)$ is the centraliser of $g_t$ . Derivation hint: the character table matrix (suitably weighted) is unitary; column orthogonality is the dual of row orthogonality. Equivalently, the rows being orthonormal and forming a complete set forces the columns to be orthogonal.

DefinitionCharacter Table

The character table of $G$ is the $r \times r$ array whose rows are the irreducible characters $\chi_1, \dots, \chi_r$ and whose columns are the conjugacy classes $C_1, \dots, C_r$ , with entry $\chi_\alpha(g_t)$ . Here a fundamental theorem guarantees:

6

\quad (\text{number of irreducible representations}) \;=\; (\text{number of conjugacy classes}) \;=\; r,

so the table is square. Moreover the dimensions satisfy

7

\quad \sum_{\alpha=1}^{r} d_\alpha^2 \;=\; |G|.

Derivation hint: [6] follows because irreducible characters form a basis of the class functions, a space of dimension $r$ ; [7] is column orthogonality [5] evaluated at the identity class, where $\chi_\alpha(e) = d_\alpha$ and $|C_e| = 1$ .

ProofGreat Orthogonality from Schur's Lemma

Step 1 — Unitarisation. Every finite-group representation is equivalent to a unitary one. Define $H = \sum_{g} \rho(g)^\dagger \rho(g)$ ; it is positive-definite Hermitian, $G$ -invariant, and conjugating by $H^{1/2}$ makes $\rho$ unitary. So assume $\rho^{(\alpha)}, \rho^{(\beta)}$ unitary: $\rho(g)^{-1} = \rho(g)^\dagger$ , i.e. $\rho_{kl}(g)^{-1\text{ entry}} = \overline{\rho_{lk}(g)}$ .

Step 2 — Build an intertwiner. For any $d_\alpha \times d_\beta$ matrix $A$ , define

M \;=\; \frac{1}{|G|}\sum_{g\in G} \rho^{(\alpha)}(g)\,A\,\rho^{(\beta)}(g)^{-1}.

A direct computation using the homomorphism property shows $\rho^{(\alpha)}(h)\,M = M\,\rho^{(\beta)}(h)$ for all $h$ (reindex the sum by $g \mapsto h^{-1}g$ ). Thus $M$ intertwines the two representations.

Step 3 — Apply Schur's Lemma.

If $\alpha \neq \beta$ (inequivalent irreducibles): Schur's Lemma forces $M = 0$ for every $A$ .
If $\alpha = \beta$ : $M$ commutes with an irreducible representation, so $M = \lambda I$ . Taking traces, $\lambda = \frac{\operatorname{tr}A}{d_\alpha}$ .

Step 4 — Extract matrix elements. Choose $A = E_{jl}$ (the matrix with a single 1 in position $(j,l)$ ). Then the $(i,k)$ entry of $M$ is

M_{ik} = \frac{1}{|G|}\sum_g \rho^{(\alpha)}_{ij}(g)\,(\rho^{(\beta)}(g)^{-1})_{lk} = \frac{1}{|G|}\sum_g \rho^{(\alpha)}_{ij}(g)\,\overline{\rho^{(\beta)}_{kl}(g)},

using unitarity in the last step. Setting this equal to the Schur conclusion ( $0$ if $\alpha\neq\beta$ ; $\frac{1}{d_\alpha}\delta_{ik}\delta_{jl}$ if $\alpha=\beta$ ) yields exactly [2]. $\blacksquare$

∎

ProofCompleteness — Irreducible Characters Span the Class Functions

Step 1. Let $f$ be a class function orthogonal to every $\chi_\alpha$ . For each irreducible $\rho^{(\alpha)}$ form $T_\alpha = \sum_g \overline{f(g)}\,\rho^{(\alpha)}(g)$ . Because $f$ is a class function, $T_\alpha$ commutes with all $\rho^{(\alpha)}(h)$ , so by Schur $T_\alpha = \mu I$ with $\mu = \frac{|G|}{d_\alpha}\langle f, \chi_\alpha\rangle = 0$ .

Step 2. Apply this to the regular representation, whose decomposition contains every irreducible. The operator $\sum_g \overline{f(g)}\,\rho_{\text{reg}}(g)$ is zero, but evaluating on the basis vector $e_e$ gives $\sum_g \overline{f(g)}\, e_g = 0$ , forcing $f \equiv 0$ .

Step 3. Therefore the $\chi_\alpha$ are orthonormal (by [3]) and complete in the $r$ -dimensional space of class functions. A complete orthonormal set has exactly $r$ elements, proving [6]. $\blacksquare$

∎

FG

Ferdinand Georg Frobenius

1849–1917

Frobenius single-handedly created the character theory of finite groups in a burst of papers from 1896–1900, motivated by a cryptic question from Dedekind about factoring the "group determinant." He defined characters as solutions to certain functional equations before he had matrix representations, then with Issai Schur placed the whole theory on the firm matrix-theoretic footing we use today. The orthogonality relations are, in spirit, his discovery; Schur's Lemma (1905) supplied the clean modern proof. Frobenius held the chair at Berlin and was famously rigorous and combative — but his character tables remain unchanged after 125 years.

🧠 Intuition

Think of the group algebra $\mathbb{C}[G]$ as a vector space with one coordinate axis per group element — an $|G|$ -dimensional space. The Great Orthogonality Theorem says the matrix-coefficient functions $\rho^{(\alpha)}_{ij}$ are mutually perpendicular vectors in this space, like the standard basis but adapted to the group's symmetry. There are exactly $\sum d_\alpha^2 = |G|$ of them, so they form a complete orthogonal basis — equation [7] is just "the dimensions add up." Characters are the shadows of representations: you throw away all off-diagonal information and keep only the trace, one number per conjugacy class. Remarkably, no information about which representation you have is lost — orthogonality means the characters are still independent. The picture to keep is that of an orthonormal frame (the irreducible characters) inside the function space, and any representation's character is just a vector with non-negative integer coordinates in that frame.

Figure

Irreducible characters as orthonormal axes in the space of class functions; an arbitrary character decomposes with integer multiplicities.

```svg

```

ExampleBuilding the Character Table of

S_3

Given. $G = S_3$ , $|G| = 6$ . Conjugacy classes: $\{e\}$ (size 1), three transpositions $\{(12),(13),(23)\}$ (size 3), two 3-cycles $\{(123),(132)\}$ (size 2). So $r = 3$ classes $\Rightarrow$ 3 irreducibles.

Step 1 — Dimensions. From [7]: $d_1^2 + d_2^2 + d_3^2 = 6$ . Every group has the trivial 1-D rep, $d_1 = 1$ . The only positive-integer solution is $1 + 1 + 4 = 6$ , so dimensions are $(1, 1, 2)$ .

Step 2 — One-dimensional reps. Trivial $\chi_1 = (1,1,1)$ . The sign representation $\chi_2$ sends even permutations to $+1$ , odd to $-1$ : $\chi_2 = (1, -1, 1)$ on classes $(e,\text{transposition},\text{3-cycle})$ .

Step 3 — The 2-D rep by orthogonality. Write $\chi_3 = (2, a, b)$ since $\chi_3(e) = d_3 = 2$ . Use [4]:

$\langle\chi_3,\chi_1\rangle = \frac{1}{6}(1\cdot2 + 3\cdot a + 2\cdot b) = 0 \Rightarrow 2 + 3a + 2b = 0$ .
$\langle\chi_3,\chi_2\rangle = \frac{1}{6}(2 - 3a + 2b) = 0 \Rightarrow 2 - 3a + 2b = 0$ .

Subtracting gives $6a = 0 \Rightarrow a = 0$ ; then $2 + 2b = 0 \Rightarrow b = -1$ .

Step 4 — Verify normalisation. $\langle\chi_3,\chi_3\rangle = \frac{1}{6}(4 + 3\cdot 0 + 2\cdot1) = \frac{6}{6} = 1.$ ✓

Boxed answer.

\begin{array}{c|ccc} & \{e\} & 3(ab) & 2(abc)\\\hline \chi_1 & 1 & 1 & 1\\ \chi_2 & 1 & -1 & 1\\ \chi_3 & 2 & 0 & -1 \end{array}

(dimensionless — characters are pure complex numbers).

ExampleDecomposing a Reducible Representation of

S_3

Given. The natural permutation representation $P$ of $S_3$ on $\mathbb{C}^3$ (permuting coordinates). Its character counts fixed points: $\chi_P(g) = \#\{\text{fixed points of } g\}$ .

Step 1 — Compute the character. $\chi_P(e) = 3$ ; a transposition fixes 1 point $\Rightarrow \chi_P = 1$ ; a 3-cycle fixes 0 $\Rightarrow \chi_P = 0$ . So $\chi_P = (3, 1, 0)$ .

Step 2 — Project onto each irreducible using $m_\alpha = \langle\chi_P, \chi_\alpha\rangle$ via [4]:

$m_1 = \frac{1}{6}(1\cdot3\cdot1 + 3\cdot1\cdot1 + 2\cdot0\cdot1) = \frac{1}{6}(3+3+0) = 1.$
$m_2 = \frac{1}{6}(3\cdot1 + 3\cdot1\cdot(-1) + 0) = \frac{1}{6}(3-3) = 0.$
$m_3 = \frac{1}{6}(3\cdot2 + 3\cdot1\cdot0 + 2\cdot0\cdot(-1)) = \frac{1}{6}(6) = 1.$

Step 3 — Check. Reconstructed character $1\cdot\chi_1 + 0\cdot\chi_2 + 1\cdot\chi_3 = (1,1,1)+(2,0,-1) = (3,1,0) = \chi_P$ . ✓

Boxed answer. $\;P \cong \rho_{\text{triv}} \oplus \rho_{\text{std}}$ , i.e. one copy of the trivial and one copy of the 2-D standard representation; the trivial summand is the line $(1,1,1)$ fixed by all permutations.

⚠️ Common mistake

The inner product needs a complex conjugate. Equation [3] uses $\overline{\chi_\beta(g)}$ . For real characters this is harmless, but with complex characters (e.g. $\mathbb{Z}/3$ , roots of unity) omitting it gives wrong, often non-integer, multiplicities.
Character $\neq$ representation map. $\chi$ is not a homomorphism: $\chi(gh) \neq \chi(g)\chi(h)$ in general. It is only a class function.
"Square table" is a theorem, not a definition. That #irreducibles = #conjugacy classes [6] requires proof; it is special to finite groups (and works only over fields like $\mathbb{C}$ with enough roots of unity — an algebraically closed field of characteristic not dividing $|G|$ ).
Equal dimensions don't imply equivalence, but equal characters do. Two representations are isomorphic iff their characters coincide on every class.

CounterexampleCharacters over

\mathbb{R}

fail orthogonality counts

For the cyclic group $\mathbb{Z}/3 = \{e, g, g^2\}$ , the three irreducible complex characters are $\chi_k(g^j) = \omega^{jk}$ with $\omega = e^{2\pi i/3}$ , $k = 0,1,2$ . They are orthonormal under [3]. But if you insist on real representations, two of these fuse into a single 2-D real irreducible, and you get only two real irreducibles — fewer than the three conjugacy classes. Lesson: [6] and the orthogonality relations as stated require an algebraically closed field; over $\mathbb{R}$ the count and the table change.

connection

Character orthogonality is the finite-group avatar of Fourier analysis: for $G = \mathbb{Z}/n$ the characters are $\chi_k(j) = e^{2\pi i jk/n}$ and [3] is exactly the orthogonality of the discrete Fourier basis. See Fourier Series and Transforms and Representation Theory of Finite Groups. The whole machinery rests on Schur's Lemma and the Maschke complete-reducibility theorem, which guarantees decomposition into irreducibles. The decomposition multiplicities link to Group Actions and Permutation Representations (Burnside-type counting), and the algebra structure to the Group Algebra and Wedderburn Decomposition, where $\mathbb{C}[G] \cong \bigoplus_\alpha M_{d_\alpha}(\mathbb{C})$ — equation [7] is the dimension count of that decomposition.

🔬 Where this appears

⏳ History

- 1854 — Cayley abstracts the notion of a group; the objects whose representations will later be tabulated come into focus.

- 1896 — Dedekind communicates the factorisation of the "group determinant" to Frobenius, posing the puzzle that births character theory.

- 1896–1897 — Frobenius defines group characters via functional equations and proves the first orthogonality relations, initially without explicit matrix representations.

- 1897 — Frobenius introduces matrix representations proper and links them to his characters.

- 1899 — Frobenius proves induced characters and reciprocity (Frobenius reciprocity), extending the orthogonality toolkit.

- 1905 — Issai Schur publishes Schur's Lemma, giving the clean conceptual proof of the Great Orthogonality Theorem used today.

- 1911 — Burnside's Theory of Groups of Finite Order (2nd ed.) systematises character tables for the English-speaking world and proves the

p^a q^b

solvability theorem using characters.

- 1929 — Wigner imports group representation theory into quantum mechanics; the character table becomes a working physicist's tool.

- 1930s–40s — Mulliken standardises the notation (

A_1, B_2, E, T_2, \dots

) and layout of chemical character tables, the form printed in every spectroscopy textbook.

open-problem

Character tables are powerful but do not determine the group: there exist non-isomorphic groups with identical character tables (the dihedral group $D_4$ and the quaternion group $Q_8$ are the classic order-8 example — same table, different groups). So the table is a near-invariant, not a complete one. Open and active directions include: the modular representation theory of Brauer (characteristic $p \mid |G|$ ), where Maschke fails, decompositions need not be unique, and "Brauer characters" replace ordinary ones; the McKay conjecture and its 2024 proof by Cabanes–Späth (building on the classification of finite simple groups), relating counts of irreducible characters of a group and of normaliser subgroups; and the broad project of reading deep structural and counting properties of a group off purely numerical features of its character table. Determining exactly what the table does and does not know about $G$ remains a rich research theme.

Character Tables and the Orthogonality Theorem

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also