23.7  Group Representations

Sections 01–06 studied an algebra of operators in the abstract. A group is not an algebra — its elements cannot be added — but a group can be made to act by operators, and then the operators it produces span an algebra. This section sets up that translation: a representation of a group G over F is the same thing as a representation of the group algebra F[G], so everything proved about algebras applies at once. The section’s main theorem, Maschke’s, says when the resulting algebra is semisimple, and its hypothesis on the field is not decoration: we exhibit a group and a field where the conclusion fails outright.

Throughout, G is a finite group, written multiplicatively, with its identity element written 1, and F is a field. All vector spaces are finite-dimensional over F. Where a statement needs F to be C, or needs a condition on charF, the statement says so.

23.7.1. Letting a group act by operators

The book’s groups so far have been groups of matrices or of permutations: GLn(F) (Example (Groups)), the symmetric group Sn, the classical groups of Chapter 14. Such a group arrives with its linear algebra attached. An abstract group does not. If all we know about G is its multiplication table, the only way to bring linear algebra to bear is to manufacture operators out of it.

The manufacture has one requirement. Group multiplication must become composition of operators, since composition is the only product on L(V), and every group element must become an invertible operator, since every group element can be undone. That is exactly the definition of a homomorphism into the group GL(V) of invertible operators on V, a group under composition by the same argument that makes GLn(F) one (Example (Groups)).

A representation is a way of realizing the elements of a group as invertible operators, so that multiplying in the group means composing the operators.

Definition 23.7.1 (Representation of a group)

Let G be a group, F a field, and V a finite-dimensional vector space over F. A representation of G on V over F is a group homomorphism ρ:G→GL(V), that is, a map assigning to each g∈G an invertible operator ρ(g) on V such that ρ(gh)=ρ(g)ρ(h) for all g,h∈G. The space V is the representation space, and dim⁡V is the degree of ρ. The representation is faithful if ρ is injective. When V=Fn we speak of a matrix representation and write ρ(g)∈GLn(F).

In words: to give a representation is to attach to each g∈G an invertible operator ρ(g) on one fixed space V, in such a way that the operator attached to a product is the composition of the operators attached to the factors. Two conditions that look like extra demands are already implied by Theorem 0.10.3: ρ(1)=idV, and ρ(g−1)=ρ(g)−1 for every g. So we never have to check them.

Note what is not required. Nothing says ρ is injective, and nothing says the operators ρ(g) are distinct. The constant map g↦idV is a perfectly good representation; it simply carries no information about G.

Examples. Fix a finite group G and a field F.

  • The trivial representation. V=F and ρ(g)=idF for every g. It is a representation because idF⋅idF=idF, matching ρ(gh)=ρ(g)ρ(h). Its degree is 1. This is the degenerate case, and it is not a curiosity: it is one of the basic building blocks, and in Section 08 it is the piece that detects averages.
  • The sign representation of Sn. V=F and ρ(σ)=sgn(σ)idF, where sgn is the sign of a permutation (Definition 7.3.2). It is a homomorphism because sgn(στ)=sgn(σ)sgn(τ) (Theorem 7.3.1). Over a field of characteristic 2 we have −1=1, so the sign representation coincides with the trivial one; over C it does not. It is faithful on S2, whose two elements have signs 1 and −1, but not on Sn for n≥3, where sgn((1 2 3))=1=sgn(id) while (1 2 3)≠id.
  • The permutation representation of Sn. V=Fn and ρ(σ)ei=eσ(i), extended linearly (Theorem 2.1.6). Then ρ(σ)ρ(τ)ei=ρ(σ)eτ(i)=eσ(τ(i))=ρ(στ)ei, where the last step uses that στ means “first τ, then σ”. So ρ is a homomorphism, and each ρ(σ) is invertible with inverse ρ(σ−1). The matrix of ρ(σ) in the standard basis is the permutation matrix Pσ of Definition 3.4.2. The same recipe works for any subgroup of Sn.
  • The rotation representation of Z/nZ over R. V=R2 and ρ([k]) is rotation by 2πk/n, with matrix (cos⁡(2πk/n)−sin⁡(2πk/n)sin⁡(2πk/n)cos⁡(2πk/n)). Composing rotations adds angles, so ρ([k])ρ([l])=ρ([k+l]); and rotating by 2πn/n=2π is the identity, so the recipe does not depend on the representative k. For n≥3 this representation has no invariant line. A line invariant under ρ([1]) would give that matrix a real eigenvalue (Proposition 9.1.2), but with c=cos⁡(2π/n) and s=sin⁡(2π/n) its characteristic polynomial is x2−2cx+1, of discriminant 4c2−4=−4s2, which is negative because 0<2π/n<π forces s≠0 when n≥3. (The quarter-turn case is Example (A Rotation Has No Invariant Lines).) Section 04 turned this into the standard warning about Schur’s lemma over R.
  • The regular representation. V=F[G], the group algebra of Definition 23.1.5: the free vector space on the set G (Definition 15.2.3), with basis {δg:g∈G} and multiplication determined by δgδh=δgh. Its dimension is |G|. Put ρreg(g)δh=δgh, extended linearly. Then ρreg(g)ρreg(g′)δh=δgg′h=ρreg(gg′)δh, so ρreg is a homomorphism, and ρreg(g) is invertible with inverse ρreg(g−1). It is faithful: if ρreg(g)=id then δg=ρreg(g)δ1=δ1, so g=1 because the δh are distinct basis vectors. Its degree is |G|.

Nonexample by minimal change. Keep V=F2 and G=Z/4Z, and try ρ([k])=(1k01) over Q. Each matrix is invertible, and ρ([k])ρ([l])=(1k+l01), so multiplicativity holds on representatives. But the recipe is not well defined on Z/4Z: the class [0] is also [4], and (1401)≠I2. The clause that fails is that ρ must be a function on G. Over F2 the same recipe on Z/2Z is well defined, because (1201)=I2 there; we return to that example when Maschke’s theorem breaks.

Warning. A representation need not remember the group. The trivial representation of any group is a representation, and it forgets everything. Conversely, a noninjective ρ can still be useful: the sign representation of Sn has a huge kernel yet separates even from odd permutations. When a statement needs ρ to see all of G, it must say faithful; none of the theorems below does.

Quick check. Is ρ:Z/3Z→GL1(R)=R∖{0}, ρ([k])=(−1)k, a representation?

Solution. No: it is not well defined. We have [0]=[3] in Z/3Z, but (−1)0=1 while (−1)3=−1. Equivalently, a representation of degree 1 is a homomorphism Z/3Z→R∖{0}, and ρ([1])3=ρ([0])=1 forces ρ([1])=1, since 1 is the only real cube root of 1. So the only degree-1 real representation of Z/3Z is the trivial one.

23.7.2. Subrepresentations, equivalence, and irreducibility

Having made operators, we ask the question this book always asks of a family of operators: can the space be broken into smaller pieces that the family preserves? Chapter 9 called such a piece an invariant subspace (Definition 9.1.1). Here the family is {ρ(g):g∈G}.

Definition 23.7.2 (Subrepresentation)

Let ρ be a representation of G on V. A subspace U⊆V is G-invariant if ρ(g)u∈U for every g∈G and every u∈U. In that case the restrictions ρ(g)|U define a representation ρ|U of G on U, the subrepresentation of ρ on U.

Two checks make this legitimate. First, ρ(g)|U really is an operator on U, by invariance. Second, it is invertible on U: applying invariance to g−1 gives ρ(g)−1U=ρ(g−1)U⊆U, so ρ(g)|U has a two-sided inverse on U, namely ρ(g−1)|U. Multiplicativity is inherited. The subspaces {0} and V are always G-invariant; we call them the trivial invariant subspaces.

Definition 23.7.3 (Equivalence of representations)

Let ρ and ρ′ be representations of G on V and V′, over the same field. A linear map S:V→V′ intertwines ρ and ρ′ if Sρ(g)=ρ′(g)Sfor every g∈G. The representations are equivalent, written ρ≅ρ′, if some intertwining S is an isomorphism; equivalently, if ρ′(g)=Sρ(g)S−1 for all g.

Equivalence is what “the same representation written in another basis” means. Indeed, if V=V′=Fn and S is an invertible matrix, then ρ′(g)=Sρ(g)S−1 is simultaneous similarity of the whole family {ρ(g)} by one matrix. It is an equivalence relation: idV intertwines ρ with itself; if S intertwines ρ with ρ′ and is invertible then S−1 intertwines ρ′ with ρ, since Sρ(g)=ρ′(g)S gives ρ(g)S−1=S−1ρ′(g); and a composition of intertwining isomorphisms intertwines.

Definition 23.7.4 (Irreducible representation)

A representation ρ of G on V is irreducible if V≠{0} and the only G-invariant subspaces of V are {0} and V. A representation with V≠{0} that is not irreducible is reducible.

Read the two clauses separately. The zero space is excluded by decree, exactly as 1 is excluded from the primes: keeping it would break every statement of the form “every representation is built from irreducible ones”. The second clause is the real content.

Examples and a nonexample.

  • Every representation of degree 1 is irreducible: a one-dimensional space has no subspaces but {0} and itself.
  • The permutation representation of S3 on F3 is reducible for every F. The line L=span(e1+e2+e3) is S3-invariant, since ρ(σ)(e1+e2+e3)=eσ(1)+eσ(2)+eσ(3)=e1+e2+e3, the same three basis vectors in another order. And L≠{0}, L≠F3.
  • So is the sum-zero subspace W={x∈F3:x1+x2+x3=0}, of dimension 2: permuting the coordinates of x does not change their sum. We will see below that over C the subrepresentation on W is irreducible; this is the standard representation of S3.
  • Nonexample by minimal change. Replace S3 by the subgroup H={id,(1 2)}⊆S3 and keep V=F3. Then span(e3) is H-invariant, though it is not S3-invariant. Invariance depends on the whole group, not on one element of it.

Finally, the operation that puts representations together. If ρ1,ρ2 are representations of G on V1,V2, their direct sum is the representation ρ1⊕ρ2 on V1⊕V2 given by (ρ1⊕ρ2)(g)(v1,v2)=(ρ1(g)v1,ρ2(g)v2). In a basis adapted to the decomposition its matrix is block diagonal, ρ1(g)⊕ρ2(g). Conversely, if V=U⊕W with both summands G-invariant, then the map U⊕W→V, (u,w)↦u+w, is an isomorphism intertwining ρ|U⊕ρ|W with ρ, so ρ≅ρ|U⊕ρ|W. So “decomposing a representation” and “finding an invariant complement” are the same task.

23.7.3. Representations of G and representations of F[G]

Here is the bridge that puts Sections 01–06 to work. The group algebra F[G] was built in Definition 23.1.5 precisely so that the next theorem is true.

Theorem 23.7.1 (Representations of G are representations of F[G])

Let G be a finite group, F a field, and V a finite-dimensional vector space over F. The assignment ρ ⟼ ρ~,ρ~(∑g∈Gagδg):=∑g∈Gagρ(g), is a bijection from the set of representations ρ:G→GL(V) onto the set of algebra homomorphisms F[G]→End(V) (Definition 23.1.2) — that is, onto the ways of making V an F[G]-space in the sense of Definition 23.3.2. Moreover a subspace U⊆V is G-invariant for ρ if and only if ρ~(a)U⊆U for every a∈F[G].

Idea. An element of F[G] is a formal linear combination of group elements, so a linear map out of F[G] is determined by, and may be prescribed freely on, the basis {δg}. The only thing to check is that “multiplicative on the basis” upgrades to “multiplicative everywhere”, and that is bilinearity of both products. The inverse map recovers ρ by restricting to the basis; the one point needing care is why ρ~(δg) is automatically invertible, which is where δgδg−1=δ1 earns its keep.

Proof. Let ρ:G→GL(V) be a representation. The formula defines a linear map ρ~:F[G]→End(V), because {δg} is a basis of F[G] and a linear map may be prescribed on a basis (Theorem 2.1.6). It sends δ1 to ρ(1)=idV (Theorem 0.10.3). For multiplicativity, take a=∑gagδg and b=∑hbhδh. Multiplication in F[G] and composition in End(V) are both bilinear, so ρ~(ab)=ρ~(∑g,hagbhδgh)=∑g,hagbhρ(gh)=∑g,hagbhρ(g)ρ(h)=(∑gagρ(g))(∑hbhρ(h))=ρ~(a)ρ~(b), where the third equality is the homomorphism property of ρ. Hence ρ~ is an algebra homomorphism.

Conversely, let φ:F[G]→End(V) be an algebra homomorphism, and set ρ(g):=φ(δg). Since δ1 is the identity of F[G] (Definition 23.1.5) and idV is the identity of End(V), the unital clause of Definition 23.1.2 gives φ(δ1)=idV. Then ρ(g)ρ(h)=φ(δgδh)=φ(δgh)=ρ(gh). In particular ρ(g)ρ(g−1)=φ(δ1)=idV and likewise in the other order, so each ρ(g) is invertible and ρ maps into GL(V). Thus ρ is a representation, and ρ~=φ because the two agree on the basis {δg} and both are linear. Since also ρ~(δg)=ρ(g), the two constructions are mutually inverse, and the assignment is a bijection.

For the last sentence, suppose U is G-invariant. For a=∑gagδg and u∈U, each ρ(g)u lies in U, and U is a subspace, so ρ~(a)u=∑gagρ(g)u∈U. Conversely, if ρ~(a)U⊆U for all a, take a=δg. This proves the theorem.

So the two languages are interchangeable, and we use whichever is shorter. A G-invariant subspace is an F[G]-invariant subspace; an irreducible representation of G on V is exactly a simple F[G]-space in the sense of Definition 23.3.3; and a map intertwining two representations of G is exactly an F[G]-map in the sense of Definition 23.4.1, since the condition Sρ(g)=ρ′(g)S for all g extends by linearity to all of F[G]. In particular Schur’s lemma (Theorem 23.4.1) applies verbatim to irreducible representations of groups, and we use it that way in Section 08.

Remark. Working with F[G] rather than with G buys one thing that matters: the ability to add group elements. Every averaging argument below lives in F[G], not in G. Chapter 10 §07 made the same move for a single operator, replacing T by the algebra F[T] and the space by an F[x]-module.

23.7.4. Maschke’s theorem

We now know that a reducible representation has a proper nonzero invariant subspace U. To break V into pieces we need more: an invariant complement, a G-invariant W with V=U⊕W. An ordinary complement always exists (Theorem 1.7.6), but it has no reason to be invariant.

The idea for repairing it is the one move this chapter uses over and over. Start with an object that is not invariant, and average its G-translates. The average is invariant because translating it permutes the terms of the sum. Averaging divides by |G|, and that is the whole hypothesis.

Lemma 23.7.2 (When the group order is invertible)

Let F be a field and m a positive integer. Then m⋅1F≠0 in F if and only if charF does not divide m.

Proof. If charF=0, then m⋅1F≠0 for every positive integer m (Definition 0.7.2), and 0 divides no positive integer, so both sides of the equivalence hold. Assume from now on that p:=charF>0, so p is the smallest positive integer with p⋅1F=0.

(⇒) We prove the contrapositive: if p∣m, then m⋅1F=0. Write m=qp with q≥1. By Lemma 0.7.4, m⋅1F=(qp)⋅1F=(q⋅1F)(p⋅1F)=(q⋅1F)⋅0=0.

(⇐) Suppose, for a contradiction, that some positive integer m has m⋅1F=0 and p∤m. Choose such an m as small as possible. Now m≠p, since p∣p, and m>p, since p is the smallest positive integer killing 1F. So m−p is a positive integer, and by Lemma 0.7.4 (m−p)⋅1F+p⋅1F=m⋅1F=0, whence (m−p)⋅1F=0. Also p∤m−p, for otherwise p would divide (m−p)+p=m. This contradicts the minimality of m. This proves the lemma.

Theorem 23.7.3 (Maschke’s Theorem)

Let G be a finite group and F a field whose characteristic does not divide |G|. Let ρ be a representation of G on a finite-dimensional space V over F, and let U⊆V be a G-invariant subspace. Then there is a G-invariant subspace W⊆V with V=U⊕W.

Idea. Pick any projection P of V onto U; its kernel is a complement, but the wrong one, because P need not commute with the ρ(g). Repair it by averaging the conjugates ρ(g)Pρ(g)−1 over g∈G. ① Each conjugate is again a projection onto U, because U is invariant. ② Their average P0 is therefore again a projection onto U — here we divide by |G|. ③ Conjugating P0 by ρ(h) only permutes the terms of the sum, so P0 commutes with every ρ(h), and then its kernel is invariant.

Proof. Write n=|G|. By hypothesis and Lemma 23.7.2, n⋅1F≠0, so the scalar 1n:=(n⋅1F)−1 exists in F. By Theorem 1.7.6 there is a subspace W0 with V=U⊕W0; let P∈L(V) be the projection onto U along W0 (Theorem 4.5.1 (b)), so imP=U and Pu=u for all u∈U. Define P0:=1n∑g∈Gρ(g)Pρ(g)−1 ∈L(V).

Step 1: imP0⊆U. Let v∈V and g∈G. Then Pρ(g)−1v∈imP=U, and U is G-invariant, so ρ(g)Pρ(g)−1v∈U. A subspace is closed under sums and scalar multiples, so P0v∈U.

Step 2: P0u=u for u∈U. Let u∈U and g∈G. Since U is G-invariant and ρ(g)−1=ρ(g−1), we have ρ(g)−1u∈U, so Pρ(g)−1u=ρ(g)−1u and hence ρ(g)Pρ(g)−1u=u. Summing over the n elements of G gives ∑gρ(g)Pρ(g)−1u=(n⋅1F)u, and multiplying by 1n gives P0u=u.

By Steps 1 and 2, P0v∈U for every v, and P0 fixes U pointwise; therefore P02v=P0(P0v)=P0v, so P0 is a projection (Definition 4.5.1) with imP0=U.

Step 3: P0 commutes with every ρ(h). Fix h∈G. Then ρ(h)P0ρ(h)−1=1n∑g∈Gρ(hg)Pρ(hg)−1, using ρ(h)ρ(g)=ρ(hg) and ρ(g)−1ρ(h)−1=(ρ(h)ρ(g))−1=ρ(hg)−1. The map g↦hg is a bijection G→G, with inverse g↦h−1g by Theorem 0.10.1, so as g runs over G so does hg, and the sum is unchanged: ρ(h)P0ρ(h)−1=P0. Multiplying on the right by ρ(h) gives ρ(h)P0=P0ρ(h).

Step 4: conclusion. Put W:=kerP0. By Theorem 4.5.1 (a), V=imP0⊕kerP0=U⊕W. And W is G-invariant: if P0w=0 and h∈G, then by Step 3, P0ρ(h)w=ρ(h)P0w=0, so ρ(h)w∈W. This proves the theorem.

Two hypotheses did real work, and it is worth naming where. Finiteness of G is what makes the sum ∑g a finite sum, hence an operator at all. The condition on the characteristic is what makes 1n exist, and Step 2 is where it is spent: without the division, the computation in Step 2 gives ∑gρ(g)Pρ(g)−1u=(n⋅1F)u, which is 0 for every u∈U when charF divides n. The unnormalized sum then annihilates U instead of fixing it, and there is nothing to rescue. Both failures are real, not artifacts of the proof.

Example (Maschke fails when the characteristic divides the order)

Let p be a prime, F=Fp, G=Z/pZ, and V=Fp2. Define ρ([k]):=(1k01)∈GL2(Fp). Show that ρ is a well-defined representation, that U=span(e1) is G-invariant, and that U has no G-invariant complement.

Solution. Well defined. The entry k is read in Fp, so the matrix depends only on k modulo p; and (1k01)(1l01)=(1k+l01), so ρ([k])ρ([l])=ρ([k]+[l]). Each matrix is invertible, with inverse ρ([−k]). So ρ is a representation of the additive group Z/pZ. Here |G|=p=charFp, so the characteristic does divide the order and the hypothesis of Theorem 23.7.3 fails.

The invariant line. ρ([k])e1=e1 for every k, so U=span(e1) is G-invariant, and U≠{0},V.

No invariant complement. If V=U⊕W, then dim⁡W=2−1=1 by Theorem 1.7.3, so W=span(v) for some v=(a,b)≠0; and b≠0, since b=0 would force a≠0 and W=span(e1)=U, which is not a complement of itself. Suppose W is G-invariant. Then ρ([1])v=(a+b,b) must be a scalar multiple λv=(λa,λb). Comparing second coordinates and dividing by b≠0 gives λ=1; comparing first coordinates then gives a+b=a, so b=0, a contradiction. Hence U has no G-invariant complement. In fact U is the only nontrivial invariant subspace, so V is neither irreducible nor a direct sum of irreducibles.

Warning. Do not drop finiteness either. Let G=Z (infinite) act on Q2 by ρ(k)=(1k01) — now well defined, since Z has no relations to respect. The computation just made, with b≠0 in Q, again shows span(e1) is invariant with no invariant complement, and here the characteristic is 0. Averaging over Z is not an option: the sum has infinitely many terms.

Once one invariant complement can always be found, the full decomposition follows by induction.

Corollary 23.7.4 (Complete Reducibility of Group Representations)

Let G be a finite group and F a field with charF∤|G| — for instance F=C. Then every representation ρ of G on a nonzero finite-dimensional space V over F decomposes as V=V1⊕V2⊕⋯⊕Vr with each Vi a G-invariant subspace on which the subrepresentation is irreducible.

Proof. We argue by strong induction on dim⁡V≥1 (Theorem 0.2.10). If ρ is irreducible, take r=1 and V1=V. Otherwise V has a G-invariant subspace U with U≠{0} and U≠V. By Theorem 23.7.3 there is a G-invariant W with V=U⊕W, and W≠{0} since U≠V. Both dim⁡U and dim⁡W are at least 1, and since U∩W={0} (Theorem 1.7.4) the dimension formula Theorem 1.7.3 gives dim⁡U+dim⁡W=dim⁡V; hence both are smaller than dim⁡V. The induction hypothesis decomposes U and W into irreducible invariant subspaces, and concatenating the two lists decomposes V, because a subspace of U invariant under ρ|U is invariant under ρ. This proves the corollary.

In the language of Section 03, the corollary says that F[G] acts semisimply on every representation (Definition 23.3.4, Theorem 23.3.3); applied to the regular representation, it says F[G] is a semisimple algebra. Section 06’s structure theorem then applies to C[G], and Section 08 cashes that in.

Quick check. Where exactly does the proof of Corollary 23.7.4 use that V≠{0}?

Solution. In the base of the induction and in the meaning of the conclusion. If V={0} it is not irreducible (Definition 23.7.4 excludes the zero space) and it has no nonzero invariant subspace to split off, so neither branch of the argument applies. The usual convention is that {0} is the empty direct sum, r=0; the corollary is stated with V≠{0} so that r≥1.

23.7.5. Two families worked out

We close with the two examples Section 08 will compute characters for. Both are over C, where Corollary 23.7.4 applies to every finite group.

Example (The irreducible complex representations of a cyclic group)

Let G=Z/nZ and F=C. Determine all irreducible representations of G up to equivalence.

Solution. Every irreducible is one-dimensional. Let ρ be a representation of G on V≠{0} over C, and set A=ρ([1]). By Theorem 9.2.4, A has an eigenvector v≠0, say Av=λv. The line L=span(v) is invariant under A, hence under every power Ak=ρ([k]), so L is G-invariant. If ρ is irreducible then L=V, so dim⁡V=1. (For abelian G the algebra C[G] is commutative, since δgδh=δgh=δhg=δhδg and multiplication is bilinear; so this is also Corollary 23.4.4 read through Theorem 23.7.1.)

Listing them. A one-dimensional representation is a homomorphism χ:Z/nZ→C∖{0}, determined by z=χ([1]), which must satisfy zn=χ([n])=χ([0])=1. So z is an n-th root of unity, z=ωk with ω=e2πi/n and 0≤k≤n−1 (Example (Roots of Unity)). Conversely each such z does define a homomorphism χk([j])=ωjk: the recipe respects representatives because ωn=1, and ω(j+l)k=ωjkωlk.

They are pairwise inequivalent. Two one-dimensional representations are equivalent exactly when they are equal, since on a one-dimensional space every operator is λid for a scalar λ, and S(λid)S−1=λid for every isomorphism S. And χk≠χl for 0≤k<l≤n−1, because χk([1])=ωk≠ωl=χl([1]), the n-th roots of unity being distinct.

So Z/nZ has exactly n irreducible complex representations, all of degree 1, namely χ0,…,χn−1. Their degrees satisfy ∑k12=n=|G|, the count Corollary 23.6.2 gives for the semisimple algebra C[G].

Example (The irreducible complex representations of the symmetric group on three letters)

Write down three pairwise inequivalent irreducible complex representations of S3, with explicit matrices for the two-dimensional one.

Solution. Trivial and sign. ρtriv(σ)=1 and ρsgn(σ)=sgn(σ), both on C, both irreducible because their degree is 1. They are inequivalent: ρtriv((1 2))=1≠−1=ρsgn((1 2)).

The standard representation. Take the permutation representation on C3 and restrict it to the invariant plane W={x:x1+x2+x3=0}. A basis of W is B=(f1,f2) with f1=e1−e2 and f2=e2−e3: they lie in W, they are independent, and dim⁡W=2 because W is the kernel of the surjective functional x↦x1+x2+x3 on C3 (Theorem 2.3.1). Since S3 is generated by (1 2) and (1 2 3) — every element of S3 is a product of transpositions (Theorem 0.10.4), and (1 3)=(1 2 3)(1 2), (2 3)=(1 2)(1 2 3) — it is enough to record two matrices. With ρ(σ)ei=eσ(i): ρ((1 2))f1=e2−e1=−f1,ρ((1 2))f2=e1−e3=f1+f2,ρ((1 2 3))f1=e2−e3=f2,ρ((1 2 3))f2=e3−e1=−f1−f2. Writing Rσ:=ρ(σ)|W, the two matrices in the basis B are [R(1 2)]BB=(−1101),[R(1 2 3)]BB=(0−11−1). The remaining four matrices follow by multiplying: I2 for id, (0−1−10) for (1 3), (101−1) for (2 3), and (−11−10) for (1 3 2).

Irreducibility. A proper nonzero invariant subspace of the plane W would be a line span(v), and v would be an eigenvector of both displayed matrices. The first has eigenvalues −1 and 1, with eigenvectors spanned by (1,0) and (1,2) respectively. The second has characteristic polynomial x2+x+1, whose roots are the two primitive cube roots of unity; neither (1,0) nor (1,2) is an eigenvector of it, since (0−11−1)(1,0)=(0,1) and (0−11−1)(1,2)=(−2,−1) are not multiples of (1,0), (1,2). So there is no common eigenvector, and the standard representation is irreducible.

Inequivalent. It has degree 2, the others degree 1, and equivalent representations act on spaces of the same dimension.

The degrees satisfy 12+12+22=6=|S3|, which is the count Corollary 23.6.2 gives for the semisimple algebra C[S3]. That count runs over all isomorphism classes of irreducible C[S3]-spaces (Theorem 23.6.1), and a further class would add at least 1 to a total already equal to 6; so these three are all of the irreducible complex representations of S3. Section 08 reaches the same conclusion by counting conjugacy classes, which does not require the list to be found first.

23.7.6. Exercises

A. Check your understanding

Exercise (A1)
  • (a) State the definition of a representation of a group G on a vector space V, and say which two properties of ρ come for free.
  • (b) State Maschke’s theorem with all of its hypotheses.
  • (c) Determine whether the following is true: “every representation of degree 1 is irreducible.” Justify your answer.
  • (d) Give an example of a reducible representation of S3 over C, and name an invariant subspace.
  • (e) Explain why ρ:Z/2Z→GL1(Q), ρ([k])=2k, is not a representation.

Solution.

  • (a) A representation is a group homomorphism ρ:G→GL(V) with V finite-dimensional over F, that is, ρ(gh)=ρ(g)ρ(h) for all g,h∈G with each ρ(g) invertible (Definition 23.7.1). Free: ρ(1)=idV and ρ(g−1)=ρ(g)−1, by Theorem 0.10.3.
  • (b) If G is finite, F is a field with charF∤|G|, V is finite-dimensional over F, and U⊆V is G-invariant, then U has a G-invariant complement W, so V=U⊕W (Theorem 23.7.3).
  • (c) True. If dim⁡V=1 then V≠{0} and the only subspaces of V are {0} and V, so in particular the only invariant ones are the trivial ones.
  • (d) The permutation representation of S3 on C3; the line span(e1+e2+e3) is invariant, as is the sum-zero plane.
  • (e) It is not well defined: [0]=[2] in Z/2Z, but 20=1≠4=22. (Equivalently, a degree-1 representation of Z/2Z needs ρ([1])2=1, and the only rational solutions of z2=1 are z=±1.)

B. Practice

Exercise (B1: Which of these are representations?)

Determine which of the following are representations. Justify your answer in each case.

  • (a) G=Z/6Z, F=C, ρ([k])=(ωk00ω−k) with ω=eπi/3.
  • (b) G=S3, F=R, ρ(σ)=sgn(σ)Pσ, where Pσ is the permutation matrix with Pσei=eσ(i) (Definition 3.4.2).
  • (c) G=S3, F=R, ρ(σ)=Pσ⊤ with Pσ as in (b).
  • (d) G=Z/4Z, F=R, ρ([k])=(100k+1).

Solution.

  • (a) Yes. Here ω6=e2πi=1, so the matrix depends only on k modulo 6 and the map is well defined; it is diagonal, hence invertible since ω±k≠0; and ρ([k])ρ([l])=diag(ωk+l,ω−k−l)=ρ([k]+[l]).
  • (b) Yes. Both factors are multiplicative: sgn(στ)=sgn(σ)sgn(τ) (Theorem 7.3.1) and PσPτ=Pστ (Lemma 3.4.7 (a)). Scalars commute with matrices, so ρ(σ)ρ(τ)=sgn(στ)Pστ=ρ(στ), and ρ(σ) is invertible because Pσ is and sgn(σ)≠0.
  • (c) No. Taking transposes reverses products: ρ(σ)ρ(τ)=Pσ⊤Pτ⊤=(PτPσ)⊤=Pτσ⊤=ρ(τσ). Since S3 is not abelian this differs from ρ(στ): with σ=(1 2), τ=(1 3) we get τσ=(1 2 3)≠(1 3 2)=στ (Example (Computing with cycles)), and distinct permutations have distinct permutation matrices. (The repair is σ↦Pσ−1⊤, or equivalently Pσ itself.)
  • (d) No, on two counts. It is not well defined: [0]=[4] but diag(1,1)≠diag(1,5). And it is not multiplicative even on representatives: ρ([1])ρ([1])=diag(1,4) while ρ([2])=diag(1,3).
Exercise (B2: Averaging an inner product)

Let G be a finite group and ρ a representation of G on a complex space V carrying an inner product ⟨⋅,⋅⟩ (Definition 11.1.1). Define ⟨u,v⟩G:=1|G|∑g∈G⟨ρ(g)u,ρ(g)v⟩. Prove that ⟨⋅,⋅⟩G is an inner product on V and that every ρ(g) is an isometry for it. Hence give a second proof of Theorem 23.7.3 over C.

Solution. (IP1). For fixed v, the map u↦⟨ρ(g)u,ρ(g)v⟩ is linear in u, being a composition of the linear map ρ(g) with a slot that is linear by (IP1) for ⟨⋅,⋅⟩. A sum of linear maps times a scalar is linear.

(IP2). ⟨v,u⟩G=1|G|∑g⟨ρ(g)v,ρ(g)u⟩=1|G|∑g⟨ρ(g)u,ρ(g)v⟩―=⟨u,v⟩G―, since conjugation is additive.

(IP3). For v≠0, each ρ(g)v≠0 because ρ(g) is invertible, so each term ⟨ρ(g)v,ρ(g)v⟩ is >0, and |G|>0 is a positive real. Hence ⟨v,v⟩G>0.

Isometry. For h∈G, ⟨ρ(h)u,ρ(h)v⟩G=1|G|∑g⟨ρ(gh)u,ρ(gh)v⟩=⟨u,v⟩G, because g↦gh is a bijection of G (Theorem 0.10.1).

Second proof of Maschke over C. Let U be G-invariant and let W=U⊥ be its orthogonal complement for ⟨⋅,⋅⟩G. Then V=U⊕W by Theorem 11.3.2. If w∈W, u∈U, and h∈G, then, writing u=ρ(h)(ρ(h)−1u) and using that ρ(h) preserves ⟨⋅,⋅⟩G, ⟨ρ(h)w,u⟩G=⟨ρ(h)w,ρ(h)ρ(h)−1u⟩G=⟨w,ρ(h)−1u⟩G=0, the last step because ρ(h)−1u=ρ(h−1)u∈U and w∈U⊥. So ρ(h)w∈W, and W is G-invariant. Note that this route needs F=R or C, where inner products live, whereas Theorem 23.7.3 needs only a condition on the characteristic.

Exercise (B3: Decomposing a permutation representation)

Number the coordinates of C3 as 0,1,2, as in Chapter 12 §09, and let G=Z/3Z act by ρ([k])=Sk, where S is the cyclic shift, Sx=(x1,x2,x0). Check that ρ is a representation, decompose C3 into one-dimensional invariant subspaces, and identify each with one of the χk of Example (The irreducible complex representations of a cyclic group).

Solution. A representation. Shifting three times restores every entry, so S3=I, and therefore Sk depends only on k modulo 3: the recipe is well defined on Z/3Z. It is multiplicative because SkSl=Sk+l, and each Sk is invertible with inverse S3−k.

Decomposition. Let ω=e2πi/3. By Theorem 12.9.2 the vectors fj=13(1,ωj,ω2j), j=0,1,2, satisfy Sfj=ωjfj. The three eigenvalues 1,ω,ω2 are distinct, so the fj are independent (Theorem 9.2.2), and three independent vectors in C3 form a basis (Theorem 1.6.4). Hence C3=span(f0)⊕span(f1)⊕span(f2), and each line is invariant under S, hence under every ρ([k])=Sk.

Identification. On span(fj) the element [k] acts by the scalar ωjk, which is exactly χj([k]) in the notation of Example (The irreducible complex representations of a cyclic group). So the three summands realize χ0,χ1,χ2: every irreducible representation of Z/3Z occurs exactly once.

C. Going deeper

Exercise (C1: One-dimensional representations and the commutator)

Let G be a finite group and F a field.

  • (a) Prove that every representation of degree 1 satisfies ρ(ghg−1h−1)=1 for all g,h∈G.
  • (b) Deduce that the only degree-1 complex representation of G=S3 other than the trivial one is the sign representation. Hint: write the 3-cycle (1 2 3) in the form ghg−1h−1 with g and h transpositions.

Solution.

  • (a) A degree-1 representation takes values in F∖{0}, which is abelian under multiplication. So ρ(ghg−1h−1)=ρ(g)ρ(h)ρ(g)−1ρ(h)−1=ρ(g)ρ(g)−1ρ(h)ρ(h)−1=1, using Theorem 0.10.3 for the inverses.

  • (b) Let ρ have degree 1 over C. Transpositions are self-inverse, so (1 2)(1 3)(1 2)−1(1 3)−1=(1 2)(1 3)(1 2)(1 3). Applying this product to each point, rightmost factor first: 1↦3↦3↦1↦2, 2↦2↦1↦3↦3, and 3↦1↦2↦2↦1. So the product is (1 2 3). By (a), ρ((1 2 3))=1, and then ρ((1 3 2))=ρ((1 2 3))2=1. Let c=ρ((1 2)). Since (1 2)2=id, c2=1, so c=±1. Finally (1 3)=(1 2 3)(1 2) and (2 3)=(1 2)(1 2 3), so ρ((1 3))=ρ((2 3))=c as well. Thus ρ is determined by c: for c=1 it is trivial, and for c=−1 it agrees with sgn on every element. Both values do occur, so there are exactly two.

Exercise (C2: Maschke over a field of the right characteristic)

Let G=Z/2Z and V=F2, with ρ([1])=(0110).

  • (a) For F=Q, find two G-invariant lines whose direct sum is V.
  • (b) For F=F2, prove that V has exactly one nontrivial G-invariant subspace, and conclude that Theorem 23.7.3 fails here. Which hypothesis is violated?
  • (c) For F=F3, decompose V into irreducible subrepresentations.

Solution.

  • (a) ρ([1]) swaps the coordinates, so u=(1,1) and w=(1,−1) satisfy ρ([1])u=u and ρ([1])w=−w. Both lines are invariant, since ρ([0])=I2 as well. The two vectors are independent, because the matrix with columns u,w has determinant −2≠0 in Q; hence span(u)∩span(w)={0} and the sum is direct (Theorem 1.7.4). Its dimension is 2=dim⁡V, so V=span(u)⊕span(w).

  • (b) Over F2 we have −1=1, so w=u=(1,1) and the two lines coincide. A nontrivial invariant subspace is a line span((a,b)) with (a,b)≠(0,0), and invariance requires (b,a)=λ(a,b). Over F2 the only nonzero scalar is λ=1, forcing a=b, so (a,b)=(1,1) and the only nontrivial invariant subspace is span((1,1)). A complement of a line in the plane V is again a line, and the only invariant line is span((1,1)) itself, which is not a complement of itself. So this invariant subspace has no invariant complement, and V is not a direct sum of irreducibles. The violated hypothesis is on the characteristic: charF2=2=|G|.

  • (c) Over F3, −1=2≠1, so u=(1,1) and w=(1,2) are again independent, with ρ([1])u=u and ρ([1])w=2w=−w. Hence V=span(u)⊕span(w), each summand of dimension 1 and so irreducible. Here charF3=3∤2=|G|, and Theorem 23.7.3 applies.

Exercise (C3: The contragredient representation)

Let G be a finite group and ρ a representation of G on V over F. For g∈G define τ(g):=(ρ(g)−1)′∈L(V∗), where T′ denotes the dual map (Definition 5.4.1).

  • (a) Prove that τ is a representation of G on V∗, the contragredient of ρ.
  • (b) Prove that if U⊆V is G-invariant for ρ, then its annihilator U0⊆V∗ (Definition 5.2.1) is G-invariant for τ.
  • (c) Hence deduce that if τ is irreducible, so is ρ.

Solution.

  • (a) Each ρ(g)−1 is invertible, so τ(g) is invertible by Theorem 5.4.1 (d). For multiplicativity, put S=ρ(h)−1 and T=ρ(g)−1. By Theorem 5.4.1 (b), τ(g)τ(h)=T′S′=(ST)′=(ρ(h)−1ρ(g)−1)′=((ρ(g)ρ(h))−1)′=(ρ(gh)−1)′=τ(gh), where the fourth equality is Theorem 0.10.1 (3) applied in GL(V). So τ is a homomorphism into GL(V∗).

  • (b) Let φ∈U0, g∈G, and u∈U. By Definition 5.4.1, (τ(g)φ)(u)=φ(ρ(g)−1u). Since ρ(g)−1=ρ(g−1) and U is G-invariant, ρ(g)−1u∈U, so the value is 0. Hence τ(g)φ annihilates U, that is, τ(g)φ∈U0.

  • (c) Suppose τ is irreducible. Then V∗≠{0}, so V≠{0} by Corollary 5.1.4. Let U be a G-invariant subspace of V with U≠{0} and U≠V. By (b), U0 is G-invariant, and by Theorem 5.2.2, dim⁡U0=dim⁡V−dim⁡U. From 0<dim⁡U<dim⁡V we get 0<dim⁡U0<dim⁡V=dim⁡V∗, so U0 is a nontrivial invariant subspace of V∗, contradicting irreducibility. Hence ρ has no such U, and ρ is irreducible.

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.