23.8  Characters and Orthogonality

Complete reducibility (Corollary 23.7.4) promises that every complex representation of a finite group breaks into irreducible pieces, but the promise is not constructive: it says nothing about which pieces, or how many of each. This section produces a small table of numbers that answers both questions. To each representation we attach one function G→C, its character, and we prove that the characters of the irreducible representations are an orthonormal basis of a space of functions we can compute the dimension of by counting. Everything a complex representation is, up to equivalence, is then read off from one row of numbers.

Throughout, G is a finite group and the field is C. The hypothesis matters twice over: charC=0 never divides |G|, so Theorem 23.7.3 applies; and C is algebraically closed, so Schur’s lemma (Theorem 23.4.1) gives that the only operators commuting with an irreducible representation are the scalars. The theory over a field whose characteristic divides |G| — modular representation theory — is a different subject, and this book does not enter it.

23.8.1. Conjugacy classes

Before characters we need the sets they are constant on. The book has met them only in an exercise of Section 1 (Exercise (C1: The center of a group algebra)), so we build them here.

Definition 23.8.1 (Conjugate elements, conjugacy class)

Let G be a group. Elements g,h∈G are conjugate if h=xgx−1 for some x∈G. The conjugacy class of g is C(g):={xgx−1:x∈G}.

Conjugacy is an equivalence relation (Definition 0.5.2): g=1g1−1 gives reflexivity; if h=xgx−1, then g=x−1h(x−1)−1, which gives symmetry using Theorem 0.10.1; and if h=xgx−1 and k=yhy−1, then k=(yx)g(yx)−1, which gives transitivity. Hence the conjugacy classes are the equivalence classes, and by Theorem 0.5.2 they partition G: every element lies in exactly one class. We write k for the number of conjugacy classes of G, a finite number since G is finite.

In an abelian group xgx−1=g for every x, so every class is a single element and k=|G|. At the other extreme, C(1)={1} always.

Example (The conjugacy classes of the symmetric group on three letters)

Find the conjugacy classes of S3.

Solution. First a rule that does the work. For σ∈Sn and a cycle (i1 i2 ⋯ ir), σ(i1 i2 ⋯ ir)σ−1=(σ(i1) σ(i2) ⋯ σ(ir)). Both sides are permutations, so it is enough to check they agree at every point. At σ(ij): the left side applies σ−1 to get ij, then the cycle to get ij+1 (indices read cyclically), then σ to get σ(ij+1); the right side does the same in one step. At a point σ(m) with m∉{i1,…,ir}: the left side gives σ(m) back, and so does the right side, since σ(m) is not among the σ(ij) by injectivity. Every point of {1,…,n} is σ(m) for exactly one m, so the two agree.

So conjugation relabels the entries of a cycle. In S3, conjugating (1 2) by the six elements produces (σ(1) σ(2)), and as σ runs over S3 the pair {σ(1),σ(2)} runs over all three two-element subsets; so C((1 2))={(1 2),(1 3),(2 3)}. Conjugating (1 2 3) gives (σ(1) σ(2) σ(3)), which is (1 2 3) or (1 3 2) according to the cyclic order; both occur, for σ=id and σ=(1 2), so C((1 2 3))={(1 2 3),(1 3 2)}. The three classes are {id},{(1 2),(1 3),(2 3)},{(1 2 3),(1 3 2)}, of sizes 1,3,2, which add to 6=|S3| as a partition must. So k=3 for S3 — the same number as the three irreducible complex representations found in Example (The irreducible complex representations of the symmetric group on three letters). That is no coincidence, and the theorem explaining it is the main result of this section.

23.8.2. The character of a representation

A representation ρ on V is a whole family of matrices, and the matrices change when the basis does. To compare representations we want something attached to ρ that does not move. Chapter 2 already supplies the candidate: the trace of an operator does not depend on the basis (Definition 4.5.2), and similar operators have equal traces.

The character of a representation records one number per group element: the trace of the operator that element acts by.

Definition 23.8.2 (Character)

Let ρ be a representation of a finite group G on a finite-dimensional complex vector space V. The character of ρ is the function χρ:G→C,χρ(g):=trρ(g). Its degree is χρ(1)=dim⁡V. A character is irreducible if ρ is irreducible (Definition 23.7.4).

In words: a character is a list of |G| complex numbers, one per group element, obtained by computing traces. It throws away a great deal — the whole matrix becomes one number — and the content of this section is that it throws away exactly the information we did not want.

Examples. Let G be finite.

  • The trivial representation has χ(g)=tr(idC)=1 for every g. We write χtriv for the constant function 1.
  • The sign representation of Sn has χ(σ)=sgn(σ).
  • The permutation representation of Sn on Cn has χ(σ)=#{i:σ(i)=i}, the number of fixed points. Indeed the matrix of ρ(σ) in the standard basis has (i,i)-entry equal to 1 exactly when σ(i)=i, and 0 otherwise.
  • The regular representation on C[G] has χreg(1)=|G| and χreg(g)=0 for g≠1. The matrix of ρreg(g) in the basis {δh} has (h,h)-entry equal to 1 exactly when gh=h, that is, when g=1 by cancellation (Theorem 0.10.1).

One fact about finite groups is needed first, and Chapter 0 did not record it. It costs four lines, and Section 9 will use it constantly.

Lemma 23.8.1 (Order of an Element)

Let G be a finite group and g∈G. Then there is a least integer m≥1 with gm=1, called the order of g. Moreover gk=gl if and only if m divides k−l, and ⟨g⟩:={gk:k∈Z}={1,g,g2,…,gm−1} is a subgroup of G with exactly m elements.

Proof. The |G|+1 elements g0,g1,…,g|G| cannot all be distinct, so gi=gj for some 0≤i<j. Canceling gi (Theorem 0.10.1) gives gj−i=1 with j−i≥1. Hence the set of positive integers p with gp=1 is nonempty, and it has a least element m.

Suppose gk=gl, so gk−l=1. Divide: k−l=qm+r with 0≤r<m. Then gr=(gm)−qgk−l=1, and minimality of m forces r=0, that is m∣k−l. Conversely m∣k−l gives gk−l=(gm)(k−l)/m=1, so gk=gl.

Consequently gk depends only on k modulo m, so ⟨g⟩={1,g,…,gm−1}, and those m elements are distinct because m∤k−l whenever 0≤l<k≤m−1. Finally 1∈⟨g⟩, gkgl=gk+l∈⟨g⟩, and (gk)−1=g−k∈⟨g⟩, so ⟨g⟩ is a subgroup (Definition 0.10.2).

The next proposition collects the properties we use constantly. Chapter 4’s trace results do all the work.

Proposition 23.8.2 (Basic properties of characters)

Let ρ be a representation of a finite group G on a complex space V, with character χ=χρ. Then:

  • (a) χ(1)=dim⁡V;
  • (b) χ is a class function: χ(xgx−1)=χ(g) for all g,x∈G;
  • (c) equivalent representations have equal characters;
  • (d) if V=U⊕W with both summands G-invariant, then χ=χρ|U+χρ|W;
  • (e) χ(g−1)=χ(g)― for every g∈G, and |χ(g)|≤χ(1).

Idea. Parts (a)–(d) are the four standard facts about the trace read in this setting: the trace of the identity, invariance under conjugation, invariance under similarity, and additivity over a block decomposition. Part (e) is different: it needs to know that ρ(g) is diagonalizable with eigenvalues on the unit circle, which comes from g having finite order.

Proof.

  • (a) ρ(1)=idV (Theorem 0.10.3), and tridV=(dim⁡V)⋅1=dim⁡V in C (Theorem 4.5.3).

  • (b) χ(xgx−1)=tr(ρ(x)ρ(g)ρ(x)−1)=tr(ρ(g)ρ(x)−1ρ(x))=trρ(g)=χ(g), where the second equality is tr(ST)=tr(TS) (Theorem 4.5.3) applied with S=ρ(x) and T=ρ(g)ρ(x)−1.

  • (c) If ρ′(g)=Sρ(g)S−1 for an isomorphism S (Definition 23.7.3), the same computation as in (b) gives trρ′(g)=trρ(g).

  • (d) Choose a basis of V formed by a basis of U followed by a basis of W. Since both are invariant, the matrix of ρ(g) in this basis is block diagonal, with the matrices of ρ(g)|U and ρ(g)|W on the diagonal. The diagonal entries of the big matrix are those of the two blocks, so the traces add (Definition 4.5.2).

  • (e) We may assume V≠{0}, since otherwise χ is the zero function and both claims are clear.

Finite order. By Lemma 23.8.1 there is an integer d≥1 with gd=1, namely the order of g.

Diagonalizability. Then ρ(g)d=ρ(gd)=idV, so the polynomial xd−1 annihilates ρ(g). Over C it equals ∏m=0d−1(x−ζm) with ζ=e2πi/d, a product of distinct linear factors (Example (Roots of Unity)). By Theorem 9.8.2, (c) ⇒ (a), ρ(g) is diagonalizable, and every eigenvalue λ satisfies λd=1, hence |λ|=1.

Conclusion. Let λ1,…,λn be the diagonal entries in an eigenbasis, n=dim⁡V. Then χ(g)=∑jλj. In the same basis ρ(g)−1=ρ(g−1) is diagonal with entries λj−1, and |λj|=1 gives λj−1=λj―. Hence χ(g−1)=∑jλj―=χ(g)―. Finally |χ(g)|≤∑j|λj|=n=χ(1) by the triangle inequality for complex numbers (Theorem 0.6.4), applied repeatedly. This proves the proposition.

Warning. A character is not a homomorphism. For the standard representation of S3 (Example (The irreducible complex representations of the symmetric group on three letters)), χ((1 2))=0 and χ((1 3))=0, while (1 2)(1 3)=(1 3 2) has χ((1 3 2))=−1≠0⋅0. Only characters of degree 1 are homomorphisms, because then χ(g) is the whole operator. Nor need the values of a character be real: for Z/4Z they include ±i.

Quick check. A representation of G has character χ with χ(1)=3 and χ(g)=4 for some g. What is wrong?

Solution. Nothing can have such a character: by Proposition 23.8.2 (e), |χ(g)|≤χ(1)=3 for every g, and 4>3. The bound says a character is largest, in absolute value, at the identity.

23.8.3. Class functions and their inner product

Part (b) of Proposition 23.8.2 says every character lives in one particular space of functions, and that space is small enough to be a useful home.

Definition 23.8.3 (Class function)

Let G be a finite group. A function f:G→C is a class function if f(xgx−1)=f(g) for all g,x∈G; equivalently, if f is constant on each conjugacy class. The set of class functions is written Cl(G).

The functions G→C form a complex vector space under the pointwise operations (Example (The Standard Vector Spaces) (d)). The zero function is a class function, and sums and scalar multiples of class functions are class functions, so Cl(G) is a subspace of it (Theorem 1.2.1). Its dimension is exactly what we want to count.

Nonexample by minimal change. On S3, the function f that is 1 at (1 2) and 0 elsewhere is not a class function: (1 3)=σ(1 2)σ−1 for σ=(2 3), so f would have to take the same value at (1 3), and it takes 0 there. Changing f to be 1 on all three transpositions repairs it; that is the indicator function of a whole class, and those are the building blocks below.

Proposition 23.8.3 (The class functions have dimension the number of classes)

Let G be a finite group with conjugacy classes C1,…,Ck. For each j let 1Cj:G→C be the function that is 1 on Cj and 0 elsewhere. Then (1C1,…,1Ck) is a basis of Cl(G), and dim⁡Cl(G)=k.

Proof. Each 1Cj is constant on every class — it is 1 on Cj and 0 on the others — so it lies in Cl(G).

Spanning. Let f∈Cl(G) and pick gj∈Cj for each j. Every g∈G lies in exactly one class Cj (the classes partition G), and then f(g)=f(gj) while ∑lf(gl)1Cl(g)=f(gj). So f=∑jf(gj)1Cj.

Independence. Suppose ∑jcj1Cj=0. Evaluating at gj∈Cj gives cj=0, since every other 1Cl vanishes there. Hence the list is a basis and dim⁡Cl(G)=k.

Now the pairing. It is the standard inner product of C|G|, with the coordinates indexed by G and normalized by |G| so that the trivial character has length 1.

Definition 23.8.4 (The inner product of class functions)

For functions f,f′:G→C on a finite group G, set ⟨f,f′⟩:=1|G|∑g∈Gf(g)f′(g)―.

This satisfies (IP1)–(IP3) of Definition 11.1.1 on the space of all functions G→C, hence on the subspace Cl(G): linearity in the first slot and conjugate symmetry are immediate from the formula, and ⟨f,f⟩=1|G|∑g|f(g)|2>0 whenever f≠0, since some term is positive and none is negative. So Cl(G) is a complex inner product space of dimension k, and all of Chapter 11 is available in it.

When f and f′ are class functions the sum can be shortened to one term per class: with cj=|Cj| and gj∈Cj,

⟨f,f′⟩=1|G|∑j=1kcjf(gj)f′(gj)―.
(23.8.1)

That is the formula used for hand computation, and it is the only place the class sizes enter.

23.8.4. Two averaging lemmas

Both proofs of orthogonality run through the same device as Maschke’s theorem: average over G, and the average is G-invariant. Here we also need its trace.

Lemma 23.8.4 (The average of a representation is the projection onto the fixed space)

Let ρ be a representation of a finite group G on a complex space V, and set VG:={v∈V:ρ(g)v=v for all g∈G},P:=1|G|∑g∈Gρ(g). Then VG is a subspace, P is a projection with imP=VG, and 1|G|∑g∈Gχρ(g)=dim⁡VG.

Proof. VG=⋂g∈Gker(ρ(g)−idV) is an intersection of subspaces, hence a subspace (Theorem 1.2.2).

Fix h∈G. Then ρ(h)P=1|G|∑gρ(hg)=P, because g↦hg is a bijection of G (Theorem 0.10.1) and so only reorders the terms. Hence ρ(h)(Pv)=Pv for every v, giving imP⊆VG. Conversely, if v∈VG then Pv=1|G|∑gv=v. So P is the identity on VG; combined with imP⊆VG this gives P2=P and imP=VG.

Thus P is a projection (Definition 4.5.1) of rank dim⁡VG, and trP=dim⁡VG by Theorem 4.5.4, the field being C. On the other hand the trace is linear (Theorem 4.5.3), so trP=1|G|∑gtrρ(g)=1|G|∑gχρ(g). This proves the lemma.

Lemma 23.8.5 (The trace of a two-sided multiplication)

Let V and W be finite-dimensional vector spaces over a field F, let A∈L(V) and B∈L(W), and let Φ:L(V,W)→L(V,W),Φ(f)=B∘f∘A. Then Φ is linear and trΦ=(trA)(trB).

Idea. Write everything in coordinates. In the basis of L(V,W) given by the matrix units Eij, the map X↦BXA sends Eij to a matrix whose (i,j)-entry is biiajj; adding those diagonal coefficients factorizes as a product of two sums.

Proof. Linearity of Φ is immediate from bilinearity of composition. Fix bases of V and W and identify L(V,W) with Mm×n(F), where n=dim⁡V and m=dim⁡W (Theorem 4.1.4); let A=(ajl)∈Mn(F) and B=(bki)∈Mm(F) be the matrices of A and B. Under the identification Φ becomes X↦BXA.

Let Eij∈Mm×n(F) be the matrix unit with a 1 in position (i,j) and zeros elsewhere — the rectangular version of the matrix units of Lemma 23.2.1; these mn matrices form a basis. By Definition 0.9.9, (BEijA)kl=∑p,qbkp(Eij)pqaql=bkiajl. In the basis (Eij), the coefficient of Eij in Φ(Eij) is the (i,j)-entry of BEijA, namely biiajj. These coefficients are the diagonal entries of the matrix of Φ, so by Definition 4.5.2, trΦ=∑i=1m∑j=1nbiiajj=(∑ibii)(∑jajj)=(trB)(trA), and trA=trA, trB=trB by Definition 4.5.2. This proves the lemma.

Now put the two together. Given representations ρ on V and σ on W, make G act on the space L(V,W) of linear maps by π(g)f:=σ(g)∘f∘ρ(g)−1.

Proposition 23.8.6 (The representation on the space of linear maps)

Let ρ,σ be representations of a finite group G on complex spaces V,W. Then π above is a representation of G on L(V,W), its character is χπ(g)=χσ(g)χρ(g)―, and its fixed space is the space LG(V,W):={f∈L(V,W):fρ(g)=σ(g)f for all g∈G} of maps intertwining ρ and σ (Definition 23.7.3); for W=V and σ=ρ this is the commutant EndC[G](V) of Definition 23.4.1. Consequently

1|G|∑g∈Gχσ(g)χρ(g)―=dim⁡LG(V,W).
(23.8.2)

Proof. A representation. Each π(g) is linear in f, and π(g)π(h)f=σ(g)σ(h)fρ(h)−1ρ(g)−1=σ(gh)fρ(gh)−1=π(gh)f, using the homomorphism property of ρ and σ and Theorem 0.10.1 for the inverse of a product. Taking h=g−1 shows π(g) is invertible with inverse π(g−1).

Its character. Apply Lemma 23.8.5 with A=ρ(g)−1 and B=σ(g): χπ(g)=trπ(g)=tr(ρ(g)−1)tr(σ(g))=χρ(g−1)χσ(g)=χρ(g)―χσ(g), the last step by Proposition 23.8.2 (e).

Its fixed space. π(g)f=f means σ(g)fρ(g)−1=f, and composing with ρ(g) on the right turns this into σ(g)f=fρ(g). So the fixed space is exactly LG(V,W).

The count. Apply Lemma 23.8.4 to π and substitute the character just computed. This proves the proposition.

23.8.5. Orthogonality of the irreducible characters

Everything is now in place. Schur’s lemma converts the right-hand side of Eq. 23.8.2 into a 0 or a 1.

Theorem 23.8.7 (Orthogonality of Irreducible Characters)

Let G be a finite group and let ρ on V and σ on W be irreducible complex representations of G. Then ⟨χσ,χρ⟩={1,if ρ≅σ,0,if ρ≇σ. In particular the characters of pairwise inequivalent irreducible complex representations form an orthonormal list in Cl(G).

Idea. By Eq. 23.8.2, ⟨χσ,χρ⟩ counts the dimension of the space of intertwining maps V→W. Schur’s lemma says that space is {0} when the two are inequivalent, because a nonzero intertwiner would be an isomorphism. When they are equivalent, fix one isomorphism S0; every other intertwiner differs from it by an intertwiner of V with itself, which over C is a scalar. So the space is the line CS0.

Proof. By Eq. 23.8.2, ⟨χσ,χρ⟩=dim⁡LG(V,W), which is a nonnegative integer. It remains to compute that dimension.

Case 1: ρ≇σ. By Theorem 23.7.1, V and W are irreducible C[G]-spaces; and since the condition fρ(g)=σ(g)f for all g∈G extends by linearity to all of C[G], the members of LG(V,W) are exactly the C[G]-maps V→W (Definition 23.4.1). Let f∈LG(V,W) be nonzero. By Theorem 23.4.1 (a) it is an isomorphism, making ρ and σ equivalent (Definition 23.7.3) — a contradiction. Hence LG(V,W)={0} and the inner product is 0.

Case 2: ρ≅σ. Fix an isomorphism S0∈LG(V,W), so S0ρ(g)=σ(g)S0 for all g. Applying S0−1 on both sides gives ρ(g)S0−1=S0−1σ(g), so S0−1 intertwines σ with ρ. Let f∈LG(V,W) and set u:=S0−1f∈L(V). Then for every g, uρ(g)=S0−1fρ(g)=S0−1σ(g)f=ρ(g)S0−1f=ρ(g)u, so u commutes with every ρ(g). Since ρ is irreducible and the field is algebraically closed, Corollary 23.4.3 gives u=λidV for some λ∈C, and hence f=S0u=λS0. Therefore LG(V,W)=CS0, which has dimension 1 because S0≠0.

The last sentence of the statement follows: distinct members of a list of pairwise inequivalent irreducibles pair to 0, and each pairs with itself to 1. This proves the theorem.

Two consequences come for free, and both are used in every computation below.

Corollary 23.8.8 (Irreducibility criterion)

Let ρ be a complex representation of a finite group G on V≠{0}, with character χ. Write V=V1⊕⋯⊕Vr with each Vi irreducible (Corollary 23.7.4), and let χ1,…,χs be the distinct characters occurring among the χρ|Vi, with multiplicities m1,…,ms≥1. Then χ=∑i=1smiχi,mi=⟨χ,χi⟩,⟨χ,χ⟩=∑i=1smi2. In particular ⟨χ,χ⟩=1 if and only if ρ is irreducible, and two complex representations of G with the same character are equivalent.

Proof. Repeated use of Proposition 23.8.2 (d) gives χ=∑i=1rχρ|Vi, and grouping equal terms gives χ=∑imiχi. Distinct characters come from inequivalent representations, since equivalent ones have equal characters (Proposition 23.8.2 (c)); so by Theorem 23.8.7 the χi are orthonormal, and ⟨χ,χi⟩=mi and, expanding the pairing in the first slot and then in the second, ⟨χ,χ⟩=∑imi2.

If ρ is irreducible then s=1 and m1=1, so ⟨χ,χ⟩=1. Conversely, a sum of squares of positive integers equals 1 only when there is a single term equal to 1; then r=1 and V=V1 is irreducible.

For the last claim, suppose ρ and ρ′ have the same character. Every irreducible character ψ of G then has ⟨χρ,ψ⟩=⟨χρ′,ψ⟩, so each irreducible occurs with the same multiplicity in both decompositions. So the two decompositions into irreducibles use the same irreducibles with the same multiplicities, and the summands can be matched in pairs with equal characters. Two irreducible summands with equal characters are equivalent: were they inequivalent, Theorem 23.8.7 would make their characters orthogonal, hence unequal, since an irreducible character pairs with itself to 1 and not to 0. The direct sum of those equivalences is an isomorphism V→V′ intertwining ρ and ρ′. This proves the corollary.

Example (Checking the standard representation by its character)

Use Corollary 23.8.8 to confirm that the two-dimensional representation of S3 built in Example (The irreducible complex representations of the symmetric group on three letters) is irreducible, and decompose the permutation representation of S3 on C3.

Solution. From Example (The irreducible complex representations of the symmetric group on three letters) the matrices give χstd(id)=2, χstd((1 2))=−1+1=0, and χstd((1 2 3))=0+(−1)=−1; by Proposition 23.8.2 (b) these three values determine χstd on all of S3, the classes being those of Example (The conjugacy classes of the symmetric group on three letters). Using Eq. 23.8.1 with class sizes 1,3,2, ⟨χstd,χstd⟩=16(1⋅22+3⋅02+2⋅(−1)2)=4+0+26=1, so the representation is irreducible.

For the permutation representation, χperm counts fixed points: 3 at id, 1 at a transposition, 0 at a 3-cycle. Then ⟨χperm,χtriv⟩=16(1⋅3+3⋅1+2⋅0)=1,⟨χperm,χsgn⟩=16(1⋅3+3⋅1⋅(−1)+2⋅0)=0,⟨χperm,χstd⟩=16(1⋅3⋅2+0+0)=1. So χperm=χtriv+χstd, and by Corollary 23.8.8 the permutation representation is the direct sum of the trivial and the standard one. That matches the splitting C3=span(e1+e2+e3)⊕W found by hand in Example (The irreducible complex representations of the symmetric group on three letters), and it was found here without looking at a single vector.

23.8.6. The characters span the class functions

Orthonormality already bounds the number of irreducible representations: an orthonormal list in Cl(G) is independent (Theorem 11.1.4), so there are at most k of them up to equivalence. The next theorem shows there are exactly k. It is the deepest statement of the section, and its proof is the third and last averaging argument: this time we average the group elements themselves, weighted by a class function.

Theorem 23.8.9 (The Irreducible Characters Are a Basis of the Class Functions)

Let G be a finite group with k conjugacy classes. Then G has exactly k irreducible complex representations up to equivalence, and their characters χ1,…,χk form an orthonormal basis of Cl(G).

Idea. Suppose a class function f is orthogonal to every irreducible character; we must show f=0. Build from f the operator Tf=∑gf(g)―ρ(g) on any representation ρ. ① Because f is a class function, Tf commutes with every ρ(h) — conjugating by ρ(h) permutes the terms and leaves the coefficients alone. ② So on an irreducible ρ it is a scalar, and its trace, which is |G|⟨χρ,f⟩=0, forces that scalar to be 0. ③ Complete reducibility (Corollary 23.7.4) spreads this to every representation. ④ Apply it to the regular representation and evaluate at δ1: the result is ∑gf(g)―δg=0, and the δg are a basis.

Proof. Orthonormal lists are independent (Theorem 11.1.4) and dim⁡Cl(G)=k (Proposition 23.8.3), so by Theorem 23.8.7 any list of pairwise inequivalent irreducible representations has at most k members. Choose such a list ρ1,…,ρs with s as large as possible; by maximality every irreducible complex representation of G is equivalent to some ρi. Write χi=χρi, and let U=span(χ1,…,χs)⊆Cl(G), using Proposition 23.8.2 (b).

Let f∈U⊥, the orthogonal complement of U in Cl(G) (Definition 11.3.1), so f is a class function with ⟨f,χi⟩=0, hence also ⟨χi,f⟩=⟨f,χi⟩―=0, for every i. For any representation ρ of G on V, define Tfρ:=∑g∈Gf(g)―ρ(g)∈L(V).

Claim. Claim 1. Tfρ commutes with ρ(h) for every h∈G.

Proof. Fix h. Then ρ(h)Tfρρ(h)−1=∑g∈Gf(g)―ρ(hgh−1). The map g↦hgh−1 is a bijection G→G, with inverse g↦h−1gh. Substituting g′=hgh−1, so that g=h−1g′h, the sum becomes ∑g′f(h−1g′h)―ρ(g′). Since f is a class function, f(h−1g′h)=f(g′), so the sum is Tfρ. Multiplying on the right by ρ(h) gives the claim.

Claim. Claim 2. If ρ is irreducible, then Tfρ=0.

Proof. By Claim 1 and Corollary 23.4.3, over the algebraically closed field C we get Tfρ=λidV for some λ∈C. Taking traces and using linearity of the trace (Theorem 4.5.3), λdim⁡V=trTfρ=∑gf(g)―χρ(g)=|G|⟨χρ,f⟩. Now ρ is equivalent to some ρi, so χρ=χi by Proposition 23.8.2 (c), and ⟨χi,f⟩=0. Since dim⁡V≥1, λ=0.

Claim. Claim 3. Tfρ=0 for every representation ρ.

Proof. We may assume V≠{0}. By Corollary 23.7.4, V=V1⊕⋯⊕Vr with each Vj invariant and ρ|Vj irreducible. Each ρ(g) maps Vj into Vj, hence so does Tfρ, and its restriction to Vj is ∑gf(g)―ρ|Vj(g)=Tfρ|Vj, which is 0 by Claim 2. So Tfρ vanishes on each Vj, hence on their sum V.

Now apply Claim 3 to the regular representation ρreg on C[G], where ρreg(g)δh=δgh. Evaluating at the basis vector δ1, 0=Tfρregδ1=∑g∈Gf(g)―δg. The δg are a basis of C[G], so every coefficient vanishes: f(g)―=0, that is f(g)=0, for all g. Hence U⊥={0}.

By Theorem 11.3.2, Cl(G)=U⊕U⊥=U. So (χ1,…,χs) is an orthonormal spanning list, hence a basis, and s=dim⁡Cl(G)=k by Proposition 23.8.3. Finally, inequivalent irreducibles have different characters, since orthonormality gives ⟨χi,χj⟩=0≠1=⟨χi,χi⟩ for i≠j; so the k characters correspond to the k equivalence classes of irreducible representations. This proves the theorem.

Corollary 23.8.10 (The sum of the squares of the degrees)

Let G be a finite group and let ρ1,…,ρk on V1,…,Vk be a complete list of pairwise inequivalent irreducible complex representations of G, one for each of the k conjugacy classes (Theorem 23.8.9). Then each ρi occurs in the regular representation with multiplicity exactly dim⁡Vi, and |G|=∑i=1k(dim⁡Vi)2.

Proof. The regular character is χreg(1)=|G| and χreg(g)=0 for g≠1, as computed after Definition 23.8.2. Hence ⟨χreg,χi⟩=1|G|∑gχreg(g)χi(g)―=1|G||G|χi(1)―=dim⁡Vi, the value χi(1)=dim⁡Vi being a real number (Proposition 23.8.2 (a)). By Corollary 23.8.8 this inner product is the multiplicity of ρi in ρreg, so χreg=∑i(dim⁡Vi)χi. Evaluating at g=1 gives |G|=∑i(dim⁡Vi)χi(1)=∑i(dim⁡Vi)2.

This is Corollary 23.6.2, the count dim⁡A=∑ni2 of the structure theorem, applied to A=C[G]: the two proofs are different and the answer is the same.

Corollary 23.8.11 (Orthogonality of the columns)

Let G be a finite group with conjugacy classes C1,…,Ck, representatives gj∈Cj and sizes cj=|Cj|, and irreducible characters χ1,…,χk. Then for all j,l, ∑i=1kχi(gj)χi(gl)―={|G|/cj,j=l,0,j≠l.

Idea. Theorem 23.8.9 makes the table of character values a square array. Rescale it so that orthonormality of the rows says the matrix is unitary; then its columns are orthonormal too, because a one-sided inverse of a square matrix is two-sided.

Proof. Let U∈Mk(C) have entries uij=cj/|G| χi(gj); the square root is a positive real. By Eq. 23.8.1 and Theorem 23.8.7, (UU∗)ii′=∑j=1kuijui′j―=1|G|∑j=1kcjχi(gj)χi′(gj)―=⟨χi,χi′⟩, which is 1 for i=i′ and 0 otherwise. Hence UU∗=Ik. By Theorem 3.4.5, U∗U=Ik as well, so for all j,l ∑i=1kuij―uil=cjcl|G|∑i=1kχi(gj)―χi(gl) equals 1 when j=l and 0 otherwise. For j=l this gives ∑i|χi(gj)|2=|G|/cj, and for j≠l it gives ∑iχi(gj)―χi(gl)=0. Conjugating the second identity, which is a sum of complex numbers, gives the stated form. This proves the corollary.

23.8.7. Two character tables

The character table of G is the k×k array whose (i,j)-entry is χi(gj): one row per irreducible character, one column per conjugacy class. By Theorem 23.8.9 it is square, by Theorem 23.8.7 its rows are orthonormal, and by Corollary 23.8.11 its columns are orthogonal.

Example (The character table of the symmetric group on three letters)

Write down the character table of S3 and verify every orthogonality relation.

Solution. By Example (The conjugacy classes of the symmetric group on three letters) there are k=3 classes, with representatives id, (1 2), (1 2 3) and sizes 1,3,2. So there are three irreducible complex representations (Theorem 23.8.9), and Example (The irreducible complex representations of the symmetric group on three letters) produced three: the trivial, the sign, and the standard one. Their characters, from the definitions and the traces computed in Example (Checking the standard representation by its character), are:

id (1 2) (1 2 3)
class size 1 3 2
χtriv 1 1 1
χsgn 1 −1 1
χstd 2 0 −1

Degrees. 12+12+22=6=|S3|, as Corollary 23.8.10 requires.

Row orthogonality, from Eq. 23.8.1 with weights 1,3,2 and divisor 6. All values are real, so conjugation does nothing: ⟨χtriv,χtriv⟩=16(1+3+2)=1,⟨χsgn,χsgn⟩=16(1+3+2)=1,⟨χstd,χstd⟩=16(4+0+2)=1,⟨χtriv,χsgn⟩=16(1−3+2)=0,⟨χtriv,χstd⟩=16(2+0−2)=0,⟨χsgn,χstd⟩=16(2+0−2)=0.

Column orthogonality, from Corollary 23.8.11, with no weights this time: column id:1+1+4=6=6/1,column (1 2):1+1+0=2=6/3,column (1 2 3):1+1+1=3=6/2,id against (1 2):1⋅1+1⋅(−1)+2⋅0=0,id against (1 2 3):1+1−2=0,(1 2) against (1 2 3):1−1+0=0. Every relation holds.

Example (The character table of a cyclic group of order four)

Write down the character table of Z/4Z and verify the orthogonality relations.

Solution. The group is abelian, so every conjugacy class is a single element and k=4. By Theorem 23.8.9 there are four irreducible complex representations, and Example (The irreducible complex representations of a cyclic group) produced four, all of degree 1: χm([j])=ijm, using ω=e2πi/4=i. Their degrees satisfy 12+12+12+12=4=|G|.

[0] [1] [2] [3]
χ0 1 1 1 1
χ1 1 i −1 −i
χ2 1 −1 1 −1
χ3 1 −i −1 i

Row orthogonality. For characters of degree 1, χl([j])―=i−jl, so ⟨χm,χl⟩=14∑j=03ij(m−l). If m=l every term is 1 and the sum is 4/4=1. If m≠l, put d=m−l, so id≠1 and (id)4=1; then (id−1)∑j=03(id)j=(id)4−1=0, and dividing by id−1≠0 gives ∑jijd=0. For instance ⟨χ1,χ0⟩=14(1+i−1−i)=0 and ⟨χ3,χ1⟩=14(1−1+1−1)=0.

Column orthogonality. Every class has size 1, so Corollary 23.8.11 predicts 4 down the diagonal and 0 off it. The same geometric sum settles every one of them: column [j] against column [l] gives ∑m=03χm([j])χm([l])―=∑m=03im(j−l), which is 4 when j=l, and is 0 otherwise by the computation just made, read with d=j−l. Three of them written out. Column [1] against itself: 1+|i|2+1+|−i|2=4. Column [0] against [2]: the entries of column [0] are 1,1,1,1 and those of column [2] are 1,−1,1,−1, so the sum is 1⋅1+1⋅(−1)+1⋅1+1⋅(−1)=0. Column [1] against [3]: 1+i⋅(−i)―+(−1)(−1)―+(−i)i―=1+i⋅i+1+(−i)(−i)=1−1+1−1=0.

Read as a matrix, the table is (ijm)m,j, which up to the factor 1/2 is the 4×4 Fourier matrix of Example (The Fourier matrix of size four). That is not a coincidence, and Section 09 explains it.

Warning. The character table does not determine the group. Two nonisomorphic groups can have identical character tables. The standard witness is a pair of groups of order 8: the eight symmetries of a square (four rotations and four reflections), and the group {±I2,±i,±j,±k} sitting inside the quaternions H of Definition 14.12.3 under multiplication. Both have five conjugacy classes and degrees 1,1,1,1,2, and their tables agree entry for entry, yet the groups are not isomorphic. This is stated on credit and not proved here; nothing below depends on it. What the character table does determine is every complex representation of the group, up to equivalence (Corollary 23.8.8).

23.8.8. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the character of a representation, and state why it does not depend on a choice of basis.
  • (b) State the orthogonality relation for irreducible complex characters.
  • (c) Determine whether the following is true: “if χ is a character of G then χ(gh)=χ(g)χ(h).” Justify your answer.
  • (d) A group of order 12 has exactly four conjugacy classes. Determine the degrees of its irreducible complex representations.
  • (e) Explain why the number of irreducible complex representations of an abelian group G is |G|.

Solution.

  • (a) χρ(g)=trρ(g) (Definition 23.8.2). The trace of an operator is computed from its matrix in any basis and the answer is the same for all of them (Definition 4.5.2), so χρ depends only on ρ.
  • (b) For irreducible complex representations ρ,σ of a finite group, ⟨χσ,χρ⟩ is 1 if ρ≅σ and 0 otherwise (Theorem 23.8.7).
  • (c) False. See the warning after Proposition 23.8.2: for the standard representation of S3, χ((1 2))χ((1 3))=0 but χ((1 3 2))=−1. It is true precisely for characters of degree 1.
  • (d) Four classes means four irreducible representations (Theorem 23.8.9), with degrees d1,…,d4≥1 satisfying d12+d22+d32+d42=12 (Corollary 23.8.10). Every group has the trivial representation, so we may take d1=1 and need d22+d32+d42=11 with each di≥1. The squares available are 1,4,9, since 42=16>11. A triple containing a 9 has its other two terms summing to 2, so it is 9+1+1=11, which works; and a triple with no 9 is one of 4+4+4=12, 4+4+1=9, 4+1+1=6, and 1+1+1=3, none of them 11. So the degrees are 1,1,1,3.
  • (e) In an abelian group xgx−1=g, so every conjugacy class is a singleton and k=|G|; now apply Theorem 23.8.9.

B. Practice

Exercise (B1: A character computed and decomposed)

Let Pτ be the permutation matrix of τ∈S3, so that Pτei=eτ(i) (Definition 3.4.2), and let π be the representation of S3 on L(C3) given by π(τ)(f)=PτfPτ−1.

  • (a) Compute the character of π on the three conjugacy classes.
  • (b) Decompose π into irreducibles.

Solution.

  • (a) This is the construction of Proposition 23.8.6 with both representations equal to the permutation representation ρperm on C3. So its character is χπ(τ)=χperm(τ)χperm(τ)―=|χperm(τ)|2. From Example (Checking the standard representation by its character), χperm=(3,1,0) on the classes of id, (1 2), (1 2 3), so χπ=(9,1,0).

  • (b) With weights 1,3,2 and divisor 6: ⟨χπ,χtriv⟩=16(9+3+0)=2,⟨χπ,χsgn⟩=16(9−3+0)=1,⟨χπ,χstd⟩=16(9⋅2+0+0)=3. So χπ=2χtriv+χsgn+3χstd, and the degrees check: 2+1+6=9=dim⁡L(C3). As a check on the arithmetic, ⟨χπ,χπ⟩=16(81+3+0)=14=22+12+32, as Corollary 23.8.8 requires. In particular dim⁡LG(C3,C3)=2: the G-equivariant operators on C3 form a plane, spanned by the identity and the all-ones matrix.

Exercise (B2: Which of these are characters?)

Let G=S3, with classes ordered id, (1 2), (1 2 3) of sizes 1,3,2. Determine which of the following class functions are characters of complex representations of S3. Justify your answer.

  • (a) (4,0,1);
  • (b) (3,1,0);
  • (c) (2,2,−1);
  • (d) (1,1,−1).

Solution. A class function is a character exactly when it is a nonnegative integer combination of χtriv=(1,1,1), χsgn=(1,−1,1), and χstd=(2,0,−1), by Corollary 23.7.4 and Proposition 23.8.2 (d); the coefficients are the inner products ⟨⋅,χi⟩.

  • (a) ⟨(4,0,1),χtriv⟩=16(4+0+2)=1, ⟨⋅,χsgn⟩=16(4−0+2)=1, ⟨⋅,χstd⟩=16(8+0−2)=1. All nonnegative integers, and 1⋅1+1⋅1+1⋅2=4 matches the degree. Yes: it is the character of the direct sum of the trivial, the sign, and the standard representation, equivalently of the direct sum of the permutation representation and the sign representation, since (3,1,0)+(1,−1,1)=(4,0,1).

  • (b) Inner products 1,0,1 as computed in Example (Checking the standard representation by its character). Yes: the permutation representation.

  • (c) ⟨⋅,χtriv⟩=16(2+6−2)=1, ⟨⋅,χsgn⟩=16(2−6−2)=−1. A negative multiplicity is impossible, so no. (It is a difference of characters, called a virtual character, but not a character.)

  • (d) ⟨(1,1,−1),χtriv⟩=16(1+3−2)=13, which is not an integer. So no: it is not even a combination of the three irreducible characters with integer coefficients, let alone nonnegative ones.

Exercise (B3: Degree-one characters of a cyclic group)

Let G=Z/6Z.

  • (a) Write down the character table.
  • (b) Verify ⟨χ1,χ4⟩=0 and ⟨χ2,χ2⟩=1 by direct computation.

Solution.

  • (a) The group is abelian of order 6, so there are six classes, six irreducible characters, all of degree 1, given by χm([j])=ωjm with ω=e2πi/6 (Example (The irreducible complex representations of a cyclic group)). The table has (m,j)-entry ωjm, with ω6=1.

  • (b) Here ⟨χ1,χ4⟩=16∑j=05ωjω4j―=16∑jω−3j=16∑j(−1)j=16(1−1+1−1+1−1)=0, using ω−3=ω3=−1. And ⟨χ2,χ2⟩=16∑jω2jω2j―=16∑j|ω2j|2=16⋅6=1.

C. Going deeper

Exercise (C1: Counting fixed points)

Let G be a finite group acting on {1,…,n} through a homomorphism φ:G→Sn, and let ρ(g)=Pφ(g) be the corresponding permutation representation on Cn, where Pσ is the permutation matrix of Definition 3.4.2 (so PσPτ=Pστ by Lemma 3.4.7 (a)).

  • (a) Prove that ⟨χρ,χtriv⟩ equals the average number of fixed points of the permutations φ(g), and also equals dim⁡(Cn)G.
  • (b) Deduce that for every n≥1, the average number of fixed points of a permutation in Sn is exactly 1.
  • (c) For G=S3 with φ=id, verify (a) numerically.

Solution.

  • (a) By the computation after Definition 23.8.2, χρ(g) is the number of i with φ(g)(i)=i. Hence ⟨χρ,χtriv⟩=1|G|∑gχρ(g)⋅1― is exactly the average of those counts. By Lemma 23.8.4 applied to ρ, the same quantity is dim⁡(Cn)G.

  • (b) Take G=Sn and φ=id. A vector x∈Cn fixed by every ρ(τ) has xi=xj for all i≠j, by taking τ the transposition (i j); conversely every vector with equal coordinates is fixed. So (Cn)Sn=span(e1+⋯+en), of dimension 1 (for n=1 this is C itself). By (a) the average number of fixed points equals that dimension, namely 1.

  • (c) For S3, χρ=(3,1,0) on classes of sizes 1,3,2, so the average number of fixed points is 16(1⋅3+3⋅1+2⋅0)=1. Directly: id fixes three points, each of the three transpositions fixes one, and each of the two 3-cycles fixes none, giving (3+3+0)/6=1. And dim⁡(C3)S3=1 by (b). The three agree.

Exercise (C2: Degree-one characters form a group)

Let G be a finite group and let X(G) be the set of characters of degree 1 of complex representations of G. (For abelian G this group is the subject of Section 09.)

  • (a) Prove that the pointwise product of two degree-one characters is a degree-one character, and that X(G) is a group under this product.
  • (b) Prove that |X(G)|≤k, the number of conjugacy classes, with equality if and only if G is abelian. Hint: use Corollary 23.8.10 in one direction and Corollary 23.4.4 in the other.

Solution.

  • (a) A degree-one character is a homomorphism χ:G→C∖{0} (the representation is the scalar it multiplies by). If χ,ψ are two of them then (χψ)(gh)=χ(gh)ψ(gh)=χ(g)ψ(g)χ(h)ψ(h)=(χψ)(g)(χψ)(h), using commutativity of C; so χψ is again a homomorphism into C∖{0}, hence a degree-one character. The product is associative because multiplication in C is; χtriv is an identity; and g↦χ(g)−1 is a homomorphism and satisfies χ⋅χ−1=χtriv. So X(G) is a group (Definition 0.10.1).

  • (b) Degree-one characters are irreducible (a one-dimensional representation has no nontrivial invariant subspace) and pairwise distinct elements of X(G) are inequivalent representations, since for degree one, equivalence means equality. So X(G) is a subset of the k irreducible characters (Theorem 23.8.9) and |X(G)|≤k.

Equality says every irreducible character has degree 1. If G is abelian then C[G] is a commutative algebra, so every irreducible C[G]-space is one-dimensional by Corollary 23.4.4; by Theorem 23.7.1 those are exactly the irreducible representations of G. Conversely, if every irreducible has degree 1 then |G|=∑i=1k1=k by Corollary 23.8.10, so every conjugacy class is a singleton; that is, xgx−1=g for all x,g, which says G is abelian.

Exercise (C3: The second orthogonality relation)

Let G be a finite group with irreducible complex characters χ1,…,χk.

  • (a) Prove that ∑i=1k|χi(g)|2=|G|/|C(g)| for every g∈G.
  • (b) Deduce that ∑i|χi(g)|2=1 if and only if the class of g is all of G, and that this happens only for the trivial group. Hint: C(1)={1} always.
  • (c) For G=S3 compute ∑i|χi(g)|2 at each of the three classes and check (a).

Solution.

  • (a) This is the diagonal case j=l of Corollary 23.8.11, with g=gj a representative of its own class and cj=|C(g)|. The value is independent of the representative chosen, as it must be, since characters are class functions.

  • (b) By (a), the sum equals 1 exactly when |C(g)|=|G|, that is, when the class of g is all of G. But C(1)={1}, and the classes partition G, so a class equal to G forces G={1}. Conversely for the trivial group the only class is {1}=G and the single character has |χ1(1)|2=1.

  • (c) From Example (The character table of the symmetric group on three letters): at id, 1+1+4=6=6/1; at (1 2), 1+1+0=2=6/3; at (1 2 3), 1+1+1=3=6/2. Each matches |G|/|C(g)| with class sizes 1,3,2.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.