1 Introduction

1.1 Outline

The aim of this course is to study the representation theory of groups. If G is a group, then a (finite-dimensional, complex) representation of G is a homomorphism

ρ:GGLn()

for some n0. We can view this as an action of G on n. Two representations are equivalent if they are related by a change of basis. In the situations we will consider, every representation can be broken down into building blocks, called irreducible representations, and for a group G, there are two basic (related) problems:

  1. 1.

    classify the irreducible representations;

  2. 2.

    construct representations and decompose them into irreducibles.

The first half of the course will be devoted to the representation theory of finite groups. Here we will develop character theory: the character of a representation ρ is the function gtrρ(g). It turns out that this function knows a lot about the representation — in some sense, it knows everything. We will develop methods to determine the irreducible characters of a finite group G. They fit into a “character table”, which has many beautiful properties.

The second half of the course focuses on the representation theory of certain groups of matrices — called linear Lie groups — such as SLn(). In this case, we require that the representations ρ are continuous. These groups are naturally smooth manifolds and their tangent spaces at the identity have the extra structure of a Lie algebra. We will explain how to relate Lie groups to their Lie algebras via the exponential map; we may then study the representation theory of Lie groups via the representation theory of Lie algebras. In the case of SL2() we will obtain an essentially complete understanding. In the case of SL3(), we will make substantial progress. In both cases, the method is essentially to consider the action of the diagonal matrices, leading to the theory of weights.

1.2 References

These notes are based on those written by Jens Funke for a previous iteration of this course. Those in turn are based on multiple sources, especially [MR1153249] and [MR2553682]. Here is a brief rundown of a few references you could look at:

  • We rely a lot on “Fulton and Harris”: [MR1153249]. This book takes the point of view that examples should come before theory. It has lots of good exercises. It would be particularly useful for the 𝔰𝔩3,-theory. It doesn’t discuss Lie groups (as opposed to algebras) much.

  • Kosmann–Schwarzbach’s book [MR2553682] is a relatively short source, and is good for its concrete discussion of representations of Lie groups.

  • Serre’s book [MR0450380] is unusual in that it develops the theory of finite group representation theory in three chapters at three different levels: the first part, aimed at chemistry students (!) covers character theory and is very concrete; the second takes a more abstract point of view and proves the main theoretical results, while the third deals with issues that come up when you look at representations over fields other than .

  • James and Liebeck, [MR1864147], is an elementary and accessible book on finite group representation theory, with a focus on character theory.

  • I like Hall, [MR3331229], for the theory of linear Lie groups, Lie algebras and representations. It is complete yet readable.

1.3 Background review

We very rapidly recall the material from Algebra II that we will be requiring in this course. We won’t be covering this in lectures but it is worth taking the time to make sure you remember this stuff (and if there’s anything you haven’t seen before, please let me know!)

1.4 Linear algebra

1.4.1 Fields

A field is a commutative ring in which every nonzero element is invertible (colloquially, a place where we can do normal arithmetic). Linear algebra takes place over fields. We will use the following examples:

  • the field of rational numbers

  • the field of real numbers

  • the field of complex numbers

  • the fields 𝔽p of integers modulo p, for p prime.

1.4.2 Linear maps

If V,W are vector spaces over a field k, then a linear map T:VW is a function such that

T(λv+μw)=λT(v)+μT(w)

for all λ,μk and all v,wV. If bases have been chosen for V and W (and they are finite dimensional), then every linear map can be written as a matrix. The linear map T is invertible if it is a bijection, in which case its inverse T1 is also a linear map. We write Hom(V,W) for the set of linear maps from V to W, which is also vector space over k. If V=W, we write End(V)=Hom(V,V). We write GL(V) for the group of invertible linear maps from V to itself (GL stands for ’general linear’). If a basis of V is chosen, and dimV=n, then End(V) is given by the n×n matrices over k while GL(V)=GLn(k) is the group of n×n invertible matrices.

If T:VW is a linear map, then its kernel and image are

ker(T)={vV:Tv=0}

and

im(T)={wW:w=Tv for some vV}.

1.4.3 Subspaces, quotients, sums

A subspace of V is a subset W closed under addition and scalar multiplication.

If W is a subspace of V, then the quotient space V/W is the set of cosets (for addition) of W in V. We denote its elements by

v¯=v+W={v+w:wW}.

In this situation, the map VV/W sending v to v¯ is a surjective linear map whose kernel is W. If T:VU is a linear map, then the map T:V/ker(T)U taking v¯ to T(v) gives a well-defined isomorphism from V/ker(T) to im(T). Compare the first isomorphism theorem in group theory, and also the rank-nullity theorem

dimker(T)+dimim(T)=dimV.

If V and W are two vector spaces, then their (external) direct sum is

VW={(v,w):vV,wW}

with componentwise addition and scalar multiplication. If V and W are both subspaces of some common space U, we say that U is the internal direct sum of V and W if every element of U can be written uniquely as u=v+w for vV, wW. This is equivalent to requiring U=V+W and VW={0}, or to requiring that the map

VWU

sending

(v,w)v+w

is an isomorphism. Often in this situation we will simply say that U is the direct sum of V and W.

We can generalise this to more than one subspace. If V1,,Vn are subspaces of V, then we say that V is their internal direct sum if every element of V can be written uniquely as v1++vn with viVi for all i. Equivalently, if the map

V1Vn V
(v1,,vn) v1++vn

is an isomorphism.

1.4.4 Eigenspaces

If T:VV is a linear map from a vector space to itself, then an eigenvector of T with eigenvalue λ is a non-zero vector vV such that Tv=λv.

The linear map T is diagonalizable if there is a basis of V consisting of eigenvectors of T. This is equivalent to there being a basis for which the matrix of T is diagonal.

For later use, we record the following theorem from linear algebra: if T1,,Tn are linear maps VV that commute with each other and that are diagonalizable, then there is a basis of V consisting of simultaneous eigenvectors of the Ti. Equivalently, a basis for which the matrices of the Ti are all diagonal.

1.5 Group theory

1.5.1 Subgroups, cosets, quotients

If G is a group then a subgroup H is a subset containing the identity, closed under the group law and taking inverses. If H is a subgroup, then a left coset of H in G is a subset gH={gh:hH}. The left cosets partition G, and we write G/H for the set of left cosets (not a group!). Similarly we define right cosets and H\G.

A subgroup H is normal if, for every gG, gHg1=H. Equivalently, gH=Hg for all gG. In this case, the rule

(gH)(gH)=(gg)H

defines a group law on G/H=H\G (the quotient group).

1.5.2 Homomorphisms

If G and G are groups, a homomorphism f:GG is a function such that f(gh)=f(g)f(h). The kernel of f is ker(f)={gG:f(g)=e} and the image is im(f)={f(g):gG} and these are subgroups of G and H respectively. The subgroup ker(f) is normal — in fact, normal subgroups are precisely those that are the kernel of some homomorphism.

A homomorphism is injective if and only if its kernel is trivial. A bijective homomorphism is called an isomorphism, in which case the inverse is also an isomorphism and we say that the groups are isomorphic.

The first (and best) isomorphism theorem states that the map

G/ker(f) im(f)
gker(f) f(g)

is an isomorphism.

1.5.3 Symmetric groups

The symmetric group Sn is the group of permutations of {1,,n}. We use cycle notation, so that (e.g.) (1253) is the permutation taking 1 to 2, 2 to 5, 5 to 3, and 3 to 1. Every permutation can be written uniquely (up to changing the order of the factors) as a product of disjoint cycles. We don’t bother writing cycles of length one, for example

(18)(2475)S8

fixes the elements 3 and 6. The sequence of lengths of the cycles appearing (including those of length one!), written in decreasing order, is called the cycle type of the permutation. The elements of given cycle type make up a single conjugacy class of Sn (see below for conjugacy classes).

There is a homomorphism ϵ:Sn±1 uniquely determined by the property that it takes transpositions (ij) to 1. It is called the sign homomorphism. Its kernel is the alternating group An. The sign of an n–cycle is (1)n+1.

If X is a set, we sometimes write SX for the group of permutations of X, so Sn=SX with X={1,,n}. If |X|=n then SXSn, but the exact isomorphism depends on how we label the elements of X by the numbers 1 to n.

1.5.4 Actions

A (left) action of a group G on a set X is a way of transforming an element x by elements g to produce gxX, such that (gh)x=g(hx).

Exercise 1.1.

If G acts on a set X, show that the map

ρ:GSX

defined by ρ(g)(x)=gx is a group homomorphism.

In this case, if xX then its stabiliser stab(x)={gG:gx=x} is a subgroup. We also have the orbit Gx=orbx={gx:gG}X. One form of the orbit-stabiliser theorem states that the map

G/stab(x) Gx
gstab(x)gx

is a bijection. This implies (if G is finite) that

|orbx||stab(x)|=|G|.

If gG then the set of fixed points of g is

Xg=Fix(g)={xX:gx=x}.

We write

XG={xX:gx=x for all gG},

the set of fixed points of G.

1.5.5 Zoo

We will need a few examples of groups:

  • the integers

  • cyclic groups Cn/n

  • symmetric groups Sn

  • alternating groups An

  • dihedral groups Dn (symmetries of regular n–gon)

  • the quaternion group Q8:

    {±1,±i,±j,±k}

    with i2=j2=k2=ijk=1.

  • the general linear group GLn(k) (for k a field) of invertible n×n matrices over k [note that if k=𝔽p then this is finite!]

  • the special linear group SLn(k) of matrices with determinant 1

  • the orthogonal group

    O(n)={AGLn():AAT=I},

    which is also the group of isometries of n (with its standard inner product) fixing the origin, and the subgroup SO(n) of elements of O(n) whose determinant is one (i.e. the group of rotations of n fixing the origin.)

  • the unitary and special unitary groups

    U(n)={AGLn():AA=I}

    where A=A¯T, with ¯ being complex conjugation, and

    SU(n)={AU(n):det(A)=1}.

    The group U(n) is the group of transformations of n fixing the standard Hermitian inner product.