The aim of this course is to study the representation theory of groups. If is a group, then a (finite-dimensional, complex) representation of is a homomorphism
for some . We can view this as an action of on . 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 , there are two basic (related) problems:
classify the irreducible representations;
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 . 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 . 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 . 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 we will obtain an essentially complete understanding. In the case of , 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.
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 -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.
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!)
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 of integers modulo , for prime.
If are vector spaces over a field , then a linear map is a function such that
for all and all . If bases have been chosen for and (and they are finite dimensional), then every linear map can be written as a matrix. The linear map is invertible if it is a bijection, in which case its inverse is also a linear map. We write for the set of linear maps from to , which is also vector space over . If , we write . We write for the group of invertible linear maps from to itself ( stands for ’general linear’). If a basis of is chosen, and , then is given by the matrices over while is the group of invertible matrices.
If is a linear map, then its kernel and image are
and
A subspace of is a subset closed under addition and scalar multiplication.
If is a subspace of , then the quotient space is the set of cosets (for addition) of in . We denote its elements by
In this situation, the map sending to is a surjective linear map whose kernel is . If is a linear map, then the map taking to gives a well-defined isomorphism from to . Compare the first isomorphism theorem in group theory, and also the rank-nullity theorem
If and are two vector spaces, then their (external) direct sum is
with componentwise addition and scalar multiplication. If and are both subspaces of some common space , we say that is the internal direct sum of and if every element of can be written uniquely as for , . This is equivalent to requiring and , or to requiring that the map
sending
is an isomorphism. Often in this situation we will simply say that is the direct sum of and .
We can generalise this to more than one subspace. If are subspaces of , then we say that is their internal direct sum if every element of can be written uniquely as with for all . Equivalently, if the map
is an isomorphism.
If is a linear map from a vector space to itself, then an eigenvector of with eigenvalue is a non-zero vector such that .
The linear map is diagonalizable if there is a basis of consisting of eigenvectors of . This is equivalent to there being a basis for which the matrix of is diagonal.
For later use, we record the following theorem from linear algebra: if are linear maps that commute with each other and that are diagonalizable, then there is a basis of consisting of simultaneous eigenvectors of the . Equivalently, a basis for which the matrices of the are all diagonal.
If is a group then a subgroup is a subset containing the identity, closed under the group law and taking inverses. If is a subgroup, then a left coset of in is a subset . The left cosets partition , and we write for the set of left cosets (not a group!). Similarly we define right cosets and .
A subgroup is normal if, for every , . Equivalently, for all . In this case, the rule
defines a group law on (the quotient group).
If and are groups, a homomorphism is a function such that . The kernel of is and the image is and these are subgroups of and respectively. The subgroup 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
is an isomorphism.
The symmetric group is the group of permutations of . We use cycle notation, so that (e.g.) is the permutation taking to , to , to , and to . 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
fixes the elements and . 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 (see below for conjugacy classes).
There is a homomorphism uniquely determined by the property that it takes transpositions to . It is called the sign homomorphism. Its kernel is the alternating group . The sign of an –cycle is .
If is a set, we sometimes write for the group of permutations of , so with . If then , but the exact isomorphism depends on how we label the elements of by the numbers to .
A (left) action of a group on a set is a way of transforming an element by elements to produce , such that .
If acts on a set show that the map
defined by is a group homomorphism.
In this case, if then its stabiliser is a subgroup. We also have the orbit . One form of the orbit-stabiliser theorem states that the map
is a bijection. This implies (if is finite) that
If then the set of fixed points of is
We write
the set of fixed points of .
We will need a few examples of groups:
the integers
cyclic groups
symmetric groups
alternating groups
dihedral groups (symmetries of regular –gon)
the quaternion group :
with .
the general linear group (for a field) of invertible matrices over [note that if then this is finite!]
the special linear group of matrices with determinant 1
the orthogonal group
which is also the group of isometries of (with its standard inner product) fixing the origin, and the subgroup of elements of whose determinant is one (i.e. the group of rotations of fixing the origin.)
the unitary and special unitary groups
where , with being complex conjugation, and
The group is the group of transformations of fixing the standard Hermitian inner product.