3 Character theory

3.1 Characters

Throughout this section, G is a finite group and V is a finite dimensional complex vector space.

Definition 3.1.

Let (ρ,V) be a finite-dimensional complex representation of G. The character of (ρ,V) is the function χρ:G defined by

χρ(g)=tr(ρ(g)).

We might also write χV instead of χρ.

Remark 3.2.

It is not totally obvious that the process ‘Start with an element ρ(g)GL(V), choose a basis for V, write ρ(g) as a matrix using that basis, and take the trace’ gives a number that is independent of the choice of basis. One way to see this is to use the change of basis formula and the fact that trPMP1=trM.

The same argument shows:

Lemma 3.3.

Isomorphic representations have the same character.

It seems that we throw away a lot of information when we pass to the character; the remarkable thing is that, in fact, the character completely determines the representation. Moreover, there is a lot of structure to the characters and it is often possible to find all of the characters of a group, even when it is not clear how to construct the representations!

Example 3.4.

If χ:G× is a one-dimensional representation, then it is its own character (the trace of a scalar is just itself).

Example 3.5.

Let ρ be the irreducible two-dimensional representation of S3 and let χ be its character. Then

χ(e)=2χ((12))=χ((23))=χ((31))=0χ((123))=χ((132))=1.
Lemma 3.6.

If (ρ,V) is a representation of G, then χρ(e)=dimρ.

Proof.

Exercise. ∎

We call dimρ the degree (or the dimension) of the character χρ.

Lemma 3.7.

If V and W are representations with characters χ and ψ, then VW has character χ+ψ.

Proof.

Use block matrices. ∎

Lemma 3.8.

If χ is the character of a representation V of G, then

χ(g1)=χ(g)¯.
Proof.

As g has finite order, say m, we can find a basis such that ρ(g) is diagonal with eigenvalues λ1,,λn, and the λi are $m$th roots of unity. Then ρ(g)1 is diagonal with eigenvalues λ11,,λn1, which are λ¯1,,λ¯n, giving the result. ∎

Remark 3.9.

It follows that, if g is conjugate to g1, then χ(g) is real for every character χ.

Lemma 3.10.

Let χ be the character of a representation ρ of G. If g and h are in the same conjugacy class of G, then

χ(g)=χ(h).
Proof.

Let h=xgx1 for some xG. Then

χ(h)=trρ(xgx1)=tr(ρ(x)ρ(g)ρ(x)1)=trρ(g)=χ(g)

since conjugate matrices have the same trace. ∎

Definition 3.11.

A class function is a function G that is constant on conjugacy classes.

The previous lemma then says that the character of a representation is a class function. We often organise the information into a character table. This has columns labeled by the conjugacy classes of G, and rows labeled by the irreducible representations. The entries are the values of the characters of the irreducible representations on elements of the conjugacy class.

We usually write 𝟙 for the character of the trivial representation.

Example 3.12.

Here is the character table of S3. We label each column by a representative element of the conjugacy class. It is also common, as here, to write the number of elements in the conjugacy class in the second row.

Classe(12)(123)size132𝟏111ϵ111ρ201
Example 3.13.

Let G=Cn and ω=e2πi/n. Then we can write down the character table of Cn; I will do this for n=5 for concreteness. Since G is abelian, all conjugacy classes are singletons so I will omit the second row.

Classegg2g3g4𝟙11111χ1ωω2ω3ω4χ21ω2ω4ωω3χ31ω3ωω4ω2χ41ω4ω3ω2ω
Exercise 3.14.

Let G act on a finite set X, and let ρ be the permutation representation. Then its character χ is given by

χ(g)=|Fix(g)|,

the number of fixed points of g.

Exercise 3.15.

What is the character of the regular representation?

3.2 Orthogonality of characters

Definition 3.16.

If χ and ψ are two class functions on G, then their inner product is

χ,ψ=1|G|gGχ(g)¯ψ(g).

You could define this for any old functions on G, but we will only use it for class functions. Note that this is a Hermitian inner product on the space of class functions of G, whose dimension is the number of conjugacy classes of G.

Over the next few section, we will prove the following theorem-

Theorem 3.17.

Let G be a finite group with conjugacy classes 𝒞1,,𝒞r. If χ is a class function, write χ(𝒞i)=χ(g) for any g𝒞i.

  1. 1.

    The irreducible characters are orthonormal with respect to the inner product defined above. This means that, if χ and ψ are irreducible characters, then

    1|G|gGχ(g)¯ψ(g)={1if χ=ψ0otherwise.

    We can also see this inner product as the standard inner product of the rows of the character table with the entries weighted by |𝒞i||G|:

    χ,ψ=1|G|i=1r|𝒞i|χ(𝒞i)¯ψ(𝒞i).
  2. 2.

    The number of irreducible representations is equal to the number of conjugacy classes. In other words, the character table is square.

  3. 3.

    The columns of the character table are orthonormal with respect to the weighted inner product from part(1). That is, if 𝒞i, 𝒞j are distinct conjugacy classes, then

    χχ(𝒞i)¯χ(𝒞j)=0

    while if they are the same conjugacy class then

    χχ(𝒞i)¯χ(𝒞i)=|G||𝒞i|.

To complement this, we have:

Theorem 3.18.

Two irreducible representations of G are isomorphic if and only if they have the same character.

In other words, each row of the character table corresponds to exactly one isomorphism class of irreducible representation.

Theorem 3.19.
  1. 1.

    A representation is determined up to isomorphism by its character.

  2. 2.

    If V is a representation with character χ, then V is irreducible if and only if χ,χ=1.

Proof.

Let the irreducible representations be V1,,Vr and let χ1,,χr be their characters (distinct, by Theorem 3.18 above). By Maschke’s Theorem, any representation V with character χ can be written as Viai for some integers ai0. Its character is then aiχi. We then have, for each i,

χ,χi=aiχi,χi=aiχi,χi=ai

since χj,χi=0 for all ji. Thus the integers ai are determined by chi, the character of V. But the integers ai determine V up to isomorphism so we are done.

For the second part, note that

χ,χ=ai2.

Since the ai are nonnegative integers, this holds if and only if exactly one of the ai is equal to one and the rest are zero. This means that V is irreducible. ∎

3.3 Example: S4

Example 3.20.

We determine the character table of S4. First, we have the trivial representation 𝟙 and the sign character ϵ:

e(12)(12)(34)(123)(1234)16386𝟙11111ϵ11111.

Next, we consider the permutation representation V of S4 on {1,2,3,4}. This contains a copy of the trivial representation, so we write V=𝟙W for some representation W, whose character χ satisfies

χ(g)=#{fixed points of g}1.

Notice that we also have an operation on representations known as twisting: if (ρ,V) is an irreducible representation of G with character χ and ψ is a one-dimensional character of G, then we can define a new representation, ρψ, of G on V by the formula (ρψ)(g)=ρ(g)ψ(g). It has character χψ. In this case, we can look at χϵ and see that it will also be the character of an irreducible representation.

e(12)(12)(34)(123)(1234)16386χ31101χϵ31101

Since χ,χ=124(32+6×12+3×(1)2+8×02+6×(1)2)=1, χ is irreducible. Note also that χϵ is different to χ, and also irreducible.

There is one more row of the table to find. This can be done using orthonormality with the first column, remembering that the dimension must be a positive integer (in this case, it must be two): we obtain that the full character table is

e(12)(12)(34)(123)(1234)16386𝟙11111ϵ11111χ31101χϵ31101ψ20210

Notice that we constructed the character of the final representation without constructing the representation itself!

3.3.1 Characters of lifts

Recall that if KG is a normal subgroup then we can lift representations of G/K to representations of G, as in Section 2.2.3.

Lemma 3.21.

If χ is the character of a representation of G/K and χ~ is the character of its lift to G, then

χ~(g)=χ(gK)

for all gG.

Proof.

Immediate from the definition. ∎

Example 3.22.

In exercise 2.29, we explained how to lift the irreducible two-dimensional representation of S3 to a representation of S4. Then its character agrees with that called ψ in the character table of S4.

We can recognise the kernel of a representation using its character.

Proposition 3.23.

Let ρ be a representation of G with character χ and dimension d. Then

ker(ρ)={gG:χ(g)=d}.
Proof.

It is clear that gker(ρ) then χ(g)=trI=d. We leave the converse as an exercise. ∎

3.3.2 Decomposing a representation

Example 3.24.

We apply the method of Theorem 3.19 to decompose a naturally occurring representation of S4. Let

X={S{1,2,3,4}:|S|=2}.

Then S4 acts on X. If we think of S4 as the symmetry group of the tetrahedron with vertices labeled 1, 2, 3, 4, then this is ‘the same as’ the action on the set of edges (each edge being determined by a set of two vertices).

Let (ρ,V) be the permutation representation obtained from X and let χρ be its character. Then

χρ(g)=|Xg|=|{{x,y}{1,2,3,4}:{gx,gy}={x,y},xy}|.

We have:

e(12)(12)(34)(123)(1234)16386χρ62200

Then we compute χρ,𝟏=χρ,χ=χρ,ψ=1, χρ,ϵ=χρ,χϵ=0. It follows that

χρ=𝟙+χ+ψ.

So

ρW0W1W2

where W0= is the trivial representation, W1 is isomorphic to the 3-D representation of S4 with character χ, and W2 is isomorphic to the unique 2-D representation of S4 (which has character ψ).

Exercise 3.25.

In the previous example, find W0, W1, W2 as subspaces of V.

Remark 3.26.

The problem of finding irreducible representations of G such that V is isomorphic to their direct sum is called “decomposing V into irreducibles representations (or irreps, or irreducibles)”. It can be solved with character theory as in example 3.24.

The problem of finding irreducible subrepresentations of V such that it is their (internal) direct sum is called “decomposing V into irreducible subrepresentations” and can require more understanding of the nature of the representation V. Exercise 3.25 is an example of this.

3.4 Inner products and homomorphisms

In this and the next section we complete the proof of character orthogonality!

If (ρ,V) and (σ,W) are two complex representations of a finite group G, then we can define a representation Hom(ρ,σ) on the vector space

Hom(V,W)={linear maps T:VW}

with G-action ’by conjugation’:

(gT)(v)=σ(g)T(ρ(g)1v).
Lemma 3.27.
  1. 1.

    If ρ and σ have characters χ and ψ, then Hom(ρ,σ) has character χ¯σ.

  2. 2.

    We have

    HomG(V,W)=Hom(V,W)G;

    in other words, the G-homomorphisms are the G-fixed points of Hom(V,W).

Proof.
  1. 1.

    Let gG and let v1,,vn and w1,,wm be bases of V and W consisting of eigenvectors for ρ(g) and σ(g), with λi the eigenvalue attached to vi and μi that attached to wi. Let TijHom(V,W) send vi to wj and all other basis vectors to zero; in matrix terms, this is the matrix with 1 in column i, row j, and 0 everywhere else. Then the Tij are a basis for Hom(V,W). Moreover, recalling that the λi are roots of unity, we have

    gTij=λi1μjTij=λi¯μjTij.

    So the trace of Hom(ρ,σ)(g) is

    i,jλi¯μj=iλi¯jμj=χ¯(g)ψ(g)

    as required.

  2. 2.

    If THom(V,W), then gT=T means

    σ(g)T(ρ(g)1v)=T(v)

    for all v. Replacing v by w=ρ(g)v, we get

    σ(g)T(w)=T(ρ(g)w)

    for all wW. So THom(V,W)G if and only if this holds for all g and all w, i.e. if and only if T is a G-homomorphism.∎

The key theoretical result is:

Theorem 3.28.

If V and W are two representations of G with characters χ and ψ respectively, then

χ,ψ=dimHomG(V,W).
Proof.

Step 1: We first consider the case that (ρ,V) is the trivial representation. Then we have to prove that

dimWG=1|G|gGψ(g).

Note that the operator

π=1|G|gGρ(g)

maps W to WG and is the identity on WG. This means that π must be a projection onto WG. It follows that, in some basis, its matrix is diagonal with dimWG ‘1’s and the remaining entries ‘0’,11 1 See also problem [[prob-projection]]. so

dimWG =tr(π)
=tr(1|G|gGρ(g))
=1|G|gGψ(g)

as required.

Step 2: Note that HomG(V,W)=Hom(V,W)G. The character of Hom(V,W) is χ¯ψ. So, by the first part,

dimHomG(V,W)=1|G|gGχ¯(g)ψ(g)

which is exactly what we have to show. ∎

Corollary 3.29.

Suppose that V and W are irreducible representations with characters χ and ψ. Then

χ,ψ={1if VW0otherwise.
Proof.

This is immediate from Theorem 3.28 and Schur’s lemma. ∎

We have therefore proved part (1) of Theorem 3.17, as well as Theorem 3.18 and Theorem 3.19. In other words, we know that representations are determined by their characters and that the rows of the character table are orthonormal (with an appropriately weighted inner product). We now only have to show that the character table is square.

3.5 Universal projections

The map π constructed in step 1 of the proof of Theorem 3.28 has an interesting feature: for every representation V, the map π is a G-homomorphism VVG. We can generalise this substantially.

Let α:G be any class function. Then define

πα=1|G|gGα¯(g)[g][G].

For every representation (ρ,V), πα acts on V, and we also call this πα:

πα(v)=1|G|gGα¯(g)ρ(g).

If we take α to be the constant function with value 1, then πα is the projection π:VVG.

Lemma 3.30.

If V is any representation, then πα:VV is a G-homomorphism.

Proof.

Let gG. Then we have

πα(ρ(g)v) =1|G|hGα¯(h)ρ(h)ρ(g)v
=ρ(g)1|G|hGα¯(h)ρ(g1hg)v
=ρ(g)1|G|hGα¯(g1hg)ρ(g1hg)v
as α is a class function
=ρ(g)πα(v)
replacing h by g1hg. ∎

Since πα is a G-homomorphism VV for every V, we could call it a universal G-homomorphism.

What happens when we take V to be an irreducible representation?

Proposition 3.31.

Let α be a class function and let V be an irreducible representation with character χ. Then πα acts as the scalar

1dim(V)α,χ

on V.

In particular, if ψ is the character of an irreducible representation W, then πψ acts as 1dimW on W and as 0 on all other irreducible representations.

Proof.

If V is irreducible, then by Schur’s lemma παHomG(V,V) must be a scalar. But its trace is

trπα=1|G|gGα¯(g)χ(g)=α,χ.

Since the trace of a scalar matrix is just the dimension times that scalar, we get the proposition. ∎

Recall now that, if ρ is an irreducible representation of G and V is another representation of G, then V(ρ) denotes the subrepresentation of V generated by all the subrepresentations of V isomorphic to ρ.

Corollary 3.32.

Let ρ be an irreducible representation of G with character χ and dimension d. Then the operator dπψ acts, on any G-representation V, as the G-equivariant projection

VV(ρ).
Proof.

We have VσIrr(G)V(σ) by Maschke’s Theorem. By the proposition, dπψ kills V(σ) for σ≇ρ, and acts as the identity on V(ρ), as required. ∎

So dim(ρ)πψ projects any representation V onto its ρ-isotypic component. In particular, if V has a unique subrepresentation isomorphic to ρ, then dim(ρ)πψ is a projection onto that subrepresentation.

Corollary 3.33.

The irreducible characters are a basis for the space of class functions.

Proof.

We already know that they are linearly independent (since they are mutually orthogonal vectors in a Hermitian inner product space), so we have to show that they span. Let C be the space of class functions, and let X be the subspace spanned by the irreducible characters. Then C=XX, and we must show X=0. Suppose that αX, so χ,α=0 for every irreducible character χ.

We consider the operator πα=1|G|gGα¯(g)[g]. This acts as (a multiple of)

α,χ=χ,α=0

on every irreducible representation V with character χ. As every representation is a direct sum of irreducibles, we see that πα acts as zero on all representations of V.

However, considering the action of πα on the regular representation [G], we see that

πα([e])=1|G|gGα¯(g)[g].

Since this must be zero, we have α(g)=0 for all gG, as required. ∎

Corollary 3.34.

Parts (2) and (3) of Theorem 3.17 are true.

Proof.

Part (2) follows from the obvious fact that the dimension of the space of class functions is the number of conjugacy classes, together with Corollary 3.33.

For part (3), consider the matrix obtained by multiplying each entry of the character table by |𝒞i|/|G|, where 𝒞i is the conjugacy class labeling the column. Then row orthogonality says that this is a (square) unitary matrix. But the transpose of a unitary matrix is unitary, which gives the column orthogonality. ∎

Example 3.35.

We give an example of how to use the projection operators. Let G=S4, and let (σ,V) be the permutation representation on the set of eight vertices of the cube. Its character θ is given below.

e(12)(12)(34)(123)(1234)16386θ80020χ31101.

Then we compute θ,θ=4, and (by inspection) that χ=𝟙ϵρρϵ where ρ is the standard three-dimensional representation of S4 whose character χ is also shown in the table. We label the vertices as in Figure 2, where the labels are shown in red: the labels on the top face are 1,2,3,4 running counterclockwise, and the label on the vertex opposite i is i+4, and look for a subspace of V isomorphic to ρ.

Refer to caption
Figure 2: Vertices of the cube

To do this we use the projection operator dim(ρ)πχ=324gS4χ¯(g)σ(g). Applying this to e1, we obtain:

324(3e1+e2+e4+e7+3e5e3e6e82e22e42e7)

which simplifies to (writing fi=ei+ei+4)

18(3f1f2f3f4).

This is illustrated in green in Figure 2. Starting with a different vector ei will permute the roles of the fi, and we see that the image of πχ is the subspace of V where the coefficients of opposite vertices are equal, and the sum of all the coefficients is zero. This is therefore the subspace of V isomorphic to ρ!

Exercise 3.36.

Complete this example by finding the other irreducible subrepresentations of V.

3.6 Linear algebra constructions

We construct new representations from old in various ways, using linear algebra. We continue to work over k= throughout, though many of these constructions work over any field.

3.6.1 The dual representation

Recall that we earlier defined, for any G-representations V and W, a G-representation on the space Hom(V,W) of linear maps from V to W. It has character χ¯VχW.

Definition 3.37.

If V is any vector space, then the dual space of V is

V=Hom(V,).

We have dimV=dimV. To see this, given a basis v1,,vn of V, we have the dual basis v1,,vn of V given by

vi(vj)=δij={1if i=j0otherwise.

There is a bilinear map V×V,(ϕ,v)ϕ(v). The choice of basis identifies V with n (as column vectors) and then the dual basis realizes V as 1×n matrices, with the above pairing being the usual matrix/dot product.

If V has a G-representation ρ, then we take to have the trivial representation and get an action ρ of G on V defined by ρ(g)(ϕ)=ϕ(ρ(g)1v). From the formula for the character of Hom(V,W), we see

χV=χ¯V.

If the matrix of ρ(g) with respect to some basis is A, then the matrix of ρ(g) with respect to the dual basis is (AT)1, the inverse of the transpose of A.

3.6.2 Tensor products

Let V,W be two vector spaces. Then the tensor product

VW

is the -vector space generated by the symbols vw for vV and wW, with the “bilinear” relations

λ(vw) =(λv)w=v(λw);
(v+v)w =vw+vw;
v(w+w) =vw+vw.
Remark 3.38.

Rigorously, we are taking the (infinite dimensional) vector space with a basis element vw for every vV and wW and then forming its quotient by the (infinite dimensional) subspace generated by vectors of the form (v+v)wvwvw and by similar expressions corresponding to the other relations; this quotient is then finite dimensional, as the proposition below shows.

Proposition 3.39.

Let e1,,en be a basis of V and f1,,fm be a basis of W. Then

{eifj:i=1,,n,j=1,,m}

is a basis of VW.

Proof.

Omitted.∎

In particular, the dimension of the tensor product is the product of the dimensions of the vector spaces:

dim(VW)=dimVdimW.

Contrast the direct sum, which has dimension the sum of the dimensions of the vector spaces.

Exercise 3.40.

It is not true that every vector in VW is of the form vw. For example, if V=W is two-dimensional with basis e,f then ee+ffVV cannot be written in this form.

Then next remark is non-examinable.

Remark 3.41.

Tensor products can be difficult to get used to. Perhaps the most important principle for understanding them is the following:

A linear map VWU is the same as a bilinear map V×WU.

The dictionary as follows: given a linear map ϕ:VWU, we define a bilinear map V×WU by sending (v,w) to ϕ(vw). The bilinearity is then a consequence of the relations that hold in the tensor product. Conversely, given a bilinear map ψ:V×WU, define a linear map VWU by sending vw to ψ(v,w). We have to check that this is well-defined, i.e. that the bilinear relations are respected, and this is equivalent to the bilinearity of ψ.

This all seems very abstract, but it is useful: defining bilinear maps is ‘easy’! In fact, tensor products ‘in real life’ often arise in situations where you have a number that depends on the choice of two vectors (in V, say); then this dependency can be expressed as a linear map VV.

All that said, for this course it will not be important to have such a deep theoretical understanding of tensor products as long as you are able to do calculations with them and are willing to take Proposition 3.39 on trust.

Naturally, we can consider more factors V1V2Vr, with linearity in each slot.

Now, if V and W are both representations of G then VW becomes a representation via

g(vw)=gvgw.

We also write ρVρW for this representation. If we have bases e1,,en of V and f1,,fm of W, with respect to which the matrices of g acting on V and W are A and B, and we order the resulting basis of VW as

e1f1,e1f2,,e1fm,e2f1,,

then the matrix of g on VW is AB where this is the block matrix

(a11Ba12Ba21Ba22B.).
Proposition 3.42.

If ρV and ρW have characters χV and χW, then

χVW=χVχW.
Proof.

Let gG and choose bases e1,,en and f1,,fm such that gei=λiei and gfj=μjfj. Then

g(eifj)=λiμjeifj,

so with respect to the basis {eifj} of VW, g acts diagonally with entries λiμj. So

χVW(g)=λiμj=(λi)(μj)=χV(g)χW(g).

The tensor product generalises the ’twisting’ construction earlier. If V is any vector space then V is isomorphic to V via the map vλλv. If (χ,) is a 1-dimensional representation and (ρ,V) is any representation of G, then ρχ is a representation acting on V. We have

(ρχ)(g)(vλ)=(ρ(g)v)(χ(g)λ)χ(g)ρ(g)λv

via the above isomorphism so that

ρχχρ.

Note that if ρ is irreducible, so is χρ. Furthermore, χρ might or might not be isomorphic to ρ.

Lemma 3.43.

Let V and W be two finite-dimensional representations of a group G. Then

VWHom(V,W)

as G-modules.

Proof.

The best way to prove this is to show that the map ϕwT, where T(v)=ϕ(v)w, is a G-isomorphism. This is straightforward but a bit technical.

Another proof which works in our situation is simply to observe that both sides have character χ¯VχW. ∎

3.6.3 Symmetric and alternating powers

The symmetric square Sym2(V) of V is the vector space spanned by symbols vv subject to the bilinear relations above and, additionally,

vv=vv

for all v,vV.

Remark 3.44.

Formally, Sym2(V) is the quotient of VV by the subspace spanned by all elements of the form vvvv, and then vv=vv is the image of vv in Sym2V.

Proposition 3.45.

Given a basis e1,,en of V, the eiej with ij are a basis of Sym2(V). ∎

Hence

dimSym2(V)=n(n+1)2.

The alternating square 2(V) of V is spanned by elements of the form vv subject to the bilinear relations above and, additionally,

vv=vv

for all v,vV.

Remark 3.46.

Formally, it is the quotient of VV by the subspace spanned by all elements of the form

vv+vv,

and then vv=vv is the image of vv in Λ2(V).

If V and W are representations of G, we define actions of G on these spaces as for the tensor product.

We can define linear maps Sym2VVV and 2(V)VV sending vvvv+vv and vvvvvv. Any vwVV can be written

vw=12((vw+wv)+(vwwv))

and this shows that

VVSym2(V)2(V).

In fact this decomposition holds as G-representations.

Remark 3.47.

The space VV has an involution22 2 Map whose square is the identity.

σ:vwwv.

As σ2=I, its eigenvalues are ±1. The decomposition above is the eigenspace decomposition for σ: Sym2V is the (+1)-eigenspace, Λ2(V) the (1)-eigenspace.

Proposition 3.48.

If (ρ,V) has character χ, then

χSym2V(g)=12(χ(g)2+χ(g2)))

and

χΛ2V(g)=12(χ(g)2χ(g2))).
Proof.

If ρ(g) has eigenvalues λ1,λn, then diagonalise it as usual to get an eigenvector basis v1,,vn. Using the basis vivj of Λ2(V) you find that

χΛ2V(g)=i<jλiλj.

This is

12((λi)2(λi2))

as required.

The proof for the symmetric square is similar, or use the decomposition of VV. ∎

Remark 3.49.

One can also define spaces Symk(V) and Λk(V) for any k, the latter vanishing if k>dimV. The former is spanned by expressions v1v2vk where ‘the order doesn’t matter’, while the latter is spanned by expressions v1v2vk where ‘switching two vectors introduces a minus sign’.

A particular special case is k=dim(V). In this case, Λk(V) is exactly one dimensional (it is easy to see it is spanned by e1ek for e1,,ek any basis of V, showing that the dimension is at most one, and there is an injective map to Vk given by

v1vkσSnϵ(σ)e1ek

which shows that the dimension is at least one).

If T:VV is any linear map, then we get a linear map Λk(T):Λk(V)Λk(V) by setting T(v1vk)=T(v1)T(vk). Since it is a map from a one-dimensional vector space to itself, Λk(T) is just multiplication by some scalar. This scalar is exactly the determinant of T!

3.6.4 Matrices in dimension 2

Suppose that (ρ,V) is a representation of G and that dimV=2, with e1,e2 being a basis of V. Let gG, and let

ρ(g)=(abcd)

be the matrix of ρ(g) in this basis. We compute the matrices of Λ2ρ(g) and Sym2ρ(g).

The space Λ2V is one-dimensional, with basis vector e1e2. Then

g(e1e2) =(ge1)(ge2)
=(ae1+ce2)(be1+de2)
=(adbc)e1e2
=det(ρ(g))e1e2

using that e1e1=e2e2=0 and e1e2=e2e1. We see that

Sym2ρdetρ.

The space Sym2V is three-dimensional with basis e12,e1e2,e22, and

g(e12) =(ae1+ce2)2
=a2e12+2ace1e2+c2e22
g(e1e2) =abe12+(ad+bc)e1e2+cde22
g(e22) =b2e12+2bde1e2+d2e22

whence the matrix of Sym2ρ(g) (in this basis) is

(a2abb22acad+bc2bdc2cdd2).

3.7 The character table of S5

Let G=S5. We have the trivial representation 𝟙, the sign representation ϵ, and the permutation representation V𝟙W, and its twist, as before. So we can start off the character table:

e(12)(12)(34)(123)(123)(45)(1234)(12345)1101520203024𝟙1111111ϵ1111111χ4201101χϵ4201101

We then try Λ2W, which has character as shown (sadly, this is equal to its twist by ϵ). This is an irreducible character.

e(12)(12)(34)(123)(123)(45)(1234)(12345)1101520203024Λ2χ6020001

We can also try Sym2W, which has character below; it isn’t irreducible.

e(12)(12)(34)(123)(123)(45)(1234)(12345)1101520203024Sym2χ10421100

By taking inner products with the characters we’ve already found, we see that

Sym2χ=𝟙χψ

where ψ is an irreducible character. We get one more from twisting ψ.

e(12)(12)(34)(123)(123)(45)(1234)(12345)1101520203024ψ5111110ψϵ5111110

This gives all of the irreducible characters, which we assemble into Table 2.

e(12)(12)(34)(123)(123)(45)(1234)(12345)1101520203024𝟏1111111ϵ1111111χ4201101χϵ4201101Λ2χ6020001ψ5111110ψϵ5111110
Table 2: Character table of S5
Question 3.50.

Find a more explicit description of the representation with character ψ.