0. Prerequisites

We give a brief overview of some key concepts from group theory and linear algebra that will be used throughout the module. This is not an exhaustive list; there may well be other facts we will need!

0.0.1. Group theory

Definition of a group

Definition 0.0.1.

A group is a triple (G,⋅,e)(G,\cdot,e), where GG is a set, “⋅\cdot” is a binary operation on GG (i.e. a function from G×GG\times G to GG), and e∈Ge\in G is a distinguished element such that e⋅a=a⋅e=ae\cdot a=a\cdot e=a for all a∈Ga\in G.

Furthermore, we require that

  1. (i)
    ​

    ⋅\cdot is associative, i.e. (a⋅b)⋅c=a⋅(b⋅c)(a\cdot b)\cdot c=a\cdot(b\cdot c); this lets us write a⋅b⋅ca\cdot b\cdot c (normally we just write a⁢b⁢cabc).

  2. (ii)
    ​

    For every a∈Ga\in G, there exists some b∈Gb\in G s.t. a⁢b=eab=e. (It follows that b⁢a=eba=e, and that such an element bb is unique).

We often just write GG for a group, as it is normally clear from the context which binary operation is being used for the definition. We will generally either use additive or multiplicative notation for the binary operation, i.e. g+hg+h or g⁢hgh.

Examples of groups

Example 0.0.2.

(ℤ,+,0)({\mathbb{Z}},+,0), (ℚ,+,0)({\mathbb{Q}},+,0), (ℝ,+,0)({\mathbb{R}},+,0), (ℂ,+,0)({\mathbb{C}},+,0), (ℚ×,⋅,1)({\mathbb{Q}}^{\times},\cdot,1), (ℝ×,⋅,1)({\mathbb{R}}^{\times},\cdot,1), (ℂ×,⋅,1)({\mathbb{C}}^{\times},\cdot,1), (ℤ/n⁢ℤ,+,0)({\mathbb{Z}}/n{\mathbb{Z}},+,0), ((ℤ/n⁢ℤ)×,⋅,1)(({\mathbb{Z}}/n{\mathbb{Z}})^{\times},\cdot,1)

These are all Abelian! Some non-Abelian examples are as follows:

Example 0.0.3.

Let Q8={±1,±i,±j,±k}Q_{8}=\{\pm 1,\pm i,\pm j,\pm k\}. Here i2=j2=k2=−1i^{2}=j^{2}=k^{2}=-1 and i⁢j=kij=k.

Example 0.0.4.

Let XX be a set, and denote by SXS_{X} the set of invertible (i.e. bijective) functions from XX to XX. Then (SX,∘,id)(S_{X},\circ,\operatorname{id}) is a group (here “∘\circ” denotes composition of functions and id\operatorname{id} is the identity map id⁡(x)=x\operatorname{id}(x)=x for all x∈Xx\in X).

The group SXS_{X} is called the permutation or symmetric group on XX. In the special case X={1,2,…,n}X=\{1,2,\ldots,n\}, we simply write SnS_{n}.

A number of groups that will be important for us arise from linear algebra:

Example 0.0.5.

Let VV be a vector space over a field kk. We denote by GL⁡(V)\operatorname{GL}(V) the group of invertible linear maps from VV to VV. In the case V=knV=k^{n}, we write GL⁡(kn)=GLn⁡(k)\operatorname{GL}(k^{n})=\operatorname{GL}_{n}(k).

Observe that G⁢Ln⁢(k)GL_{n}(k) consists of invertible n×nn\times n matrices with entries from kk. If VV has dimension nn, we may identify GL⁡(V)\operatorname{GL}(V) with GLn⁡(k)\operatorname{GL}_{n}(k) by choosing a basis of VV and using coordinate transformations.

Presentations of groups

A convenient way of defining a group is in terms of generators and relations; we write

G=⟨g1,g2,g3,…⁢gn|r1=r2=…=rm=e⟩;G=\langle g_{1},g_{2},g_{3},\ldots g_{n}\,|\,r_{1}=r_{2}=\ldots=r_{m}=e\rangle;

here g1,…,gng_{1},\ldots,g_{n} are called the generators and the r1,…,rmr_{1},\ldots,r_{m} are finite words in the generators, called relations. The elements of the group are all finite words in the generators modulo the equivalence relation that two words are equivalent if one can be obtained from the other by substituting in or out the relations; we say that a word is reduced if it cannot be made any shorter by using the relations.

Example 0.0.6.
G=⟨a|an=e⟩G=\langle a\,|\,a^{n}=e\rangle

This is just the cyclic group Cn=ℤ/n⁢ℤC_{n}={\mathbb{Z}}/n{\mathbb{Z}}; ama^{m} denotes the word a⁢a⁢a⁢…⁢aaaa\ldots a (mm times). Then using the relation an=ea^{n}=e, we see that an+1=an⁢a=e⁢a=aa^{n+1}=a^{n}a=ea=a. Thus, GG consists of the elements e,a,a2,…,an−1e,a,a^{2},\ldots,a^{n-1}.

Example 0.0.7.
S=⟨s,t|s2=t2=e,s⁢t⁢s=t⁢s⁢t⟩.S=\langle s,t\,|\,s^{2}=t^{2}=e,sts=tst\rangle.

Since both elements have order 2, we see that any word in ss and tt can be reduced to just alternating words with each element having order one, for example s4⁢t5⁢s3⁢t2⁢s3=ts^{4}t^{5}s^{3}t^{2}s^{3}=t. From this, we obtain that the only possible reduced words are of the form s⁢t⁢s⁢t⁢s⁢…ststs\ldots or t⁢s⁢t⁢s⁢t⁢…tstst\ldots. However, for any of these words of length greater than 3, we can use the relation s⁢t⁢s=t⁢s⁢tsts=tst to shorten the word:

s⁢t⁢s⁢t⁢…=(t⁢s⁢t)⁢t⁢…=t⁢s⁢t2⁢…=t⁢s⁢…stst\ldots=(tst)t\ldots=tst^{2}\ldots=ts\ldots

(and similarly for words of the form t⁢s⁢t⁢s⁢…tsts\ldots). Thus, any reduced word has length at most 3. The elements of SS are therefore

S={e,s,t,s⁢t,t⁢s,s⁢t⁢s}.S=\{e,s,t,st,ts,sts\}.
Example 0.0.8.

Let Dn=⟨s,r|s2=rn=e,s⁢r=rn−1⁢s⟩D_{n}=\langle s,r\,|\,s^{2}=r^{n}=e,\,sr=r^{n-1}s\rangle. This is called the dihedral group of order 2⁢n2n, and can be viewed as the group of symmetries of the regular nn-gon.

Example 0.0.9.

Let D⁢i⁢cn=⟨a,b|a2⁢n=e,b2=an,b−1⁢a⁢b=a−1⟩Dic_{n}=\langle a,b\,|\,a^{2n}=e,\,b^{2}=a^{n},\,b^{-1}ab=a^{-1}\rangle. This is called the dicyclic group of order 4⁢n4n.

Homomorphisms and isomorphisms

Definition 0.0.10.

Let (G,⋅)(G,\cdot) and (H,∗)(H,\ast) be two groups. A function φ:G→H\varphi:G\rightarrow H is called a (group) homomorphism if

φ⁢(g1⋅g2)=φ⁢(g1)∗φ⁢(g2)\varphi(g_{1}\cdot g_{2})=\varphi(g_{1})\ast\varphi(g_{2})

for all g1,g2∈Gg_{1},g_{2}\in G.

Note that it follows from the definition that φ⁢(eG)=eH\varphi(e_{G})=e_{H} and φ⁢(g−1)=φ⁢(g)−1\varphi(g^{-1})=\varphi(g)^{-1}.

Example 0.0.11.

For any groups GG and HH, the trivial map triv:G→H\mathrm{triv}:G\rightarrow H, triv⁢(g)=eH\mathrm{triv}(g)=e_{H} for all g∈Gg\in G is a homomorphism.

Example 0.0.12.

The determinant map det:GLn⁡(k)→k×\det:\operatorname{GL}_{n}(k)\rightarrow k^{\times} is a homomorphism.

An invertible (bijective) homomorphism is called an isomorphism. If there exists an isomorphism from a group GG to a group HH, then GG and HH are said to be isomorphic, and we write G≅HG\cong H. Isomorphic groups are essentially identical from a group-theoretic point of view.

Example 0.0.13.

Given n∈ℕn\in{\mathbb{N}}, let G={e2⁢π⁢j⁢i/n:j=0,1,…,n−1}⊆ℂ×G=\{e^{2\pi ji/n}\,:j=0,1,\ldots,n-1\}\subseteq{\mathbb{C}}^{\times} and H=ℤ/n⁢ℤH={\mathbb{Z}}/n{\mathbb{Z}}. The map φ:H→G\varphi:H\rightarrow G given by φ⁢(j+n⁢ℤ)=e2⁢π⁢i⁢j/n\varphi(j+n{\mathbb{Z}})=e^{2\pi ij/n} is an isomorphism.

Subgroups and cosets

Definition 0.0.14.

Given a group GG, a subset H⊆GH\subseteq G is called a subgroup of GG if HH is a group with the same binary operation as the group GG.

In order to check whether a subset H⊆GH\subseteq G is a subgroup, one needs to check that eG∈He_{G}\in H, and that HH is closed under multiplication and when taking inverses.

Example 0.0.15.

Let φ:G→H\varphi:G\rightarrow H be a group homomorphism. Then ker⁡φ={g∈G|φ⁢(g)=eH}\ker\varphi=\{g\in G\,|\,\varphi(g)=e_{H}\} is a subgroup of GG and im⁢φ={h∈H|∃g∈G⁢s.t.φ⁢(g)=h}\mathrm{im}\,\varphi=\{h\in H\,|\,\exists g\in G\;s.t.\,\varphi(g)=h\}.

A nice example of this is the following: SLn⁡(k)=ker⁢det\operatorname{SL}_{n}(k)=\ker\det is the subgroup of GLn⁡(k)\operatorname{GL}_{n}(k) consisting of all matrices with determinant one.

Given a group GG with a subgroup HH, one can form the coset space G/HG/H. The elements of G/HG/H are called cosets; these are subsets of GG of the form

g⁢H={s∈G|∃h∈H⁢s.t.s=g⁢h}.gH=\{s\in G\,|\,\exists h\in H\;s.t.\;s=gh\}.

If a subgroup N<GN<G has the property that g⁢N⁢g−1=NgNg^{-1}=N for all g∈Gg\in G, then NN is said to be normal. The coset space G/NG/N has a natural group structure, with multiplication given by g1⁢N⋅g2⁢N=g1⁢g2⁢Ng_{1}N\cdot g_{2}N=g_{1}g_{2}N. You can check this is a well-defined group operation due to NN being normal.

Theorem 0.0.16 (First Isomorphism Theorem).

Given a homomorphism φ:G→H\varphi:G\rightarrow H, ker⁡φ\ker\varphi is a normal subgroup of GG and

G/ker⁡φ≅im⁢φ,G/\ker\varphi\cong\mathrm{im}\varphi,

with the map g⁢ker⁡φ↦φ⁢(g)g\ker\varphi\mapsto\varphi(g) being an isomorphism between the two groups.

Group actions and conjugacy classes

Definition 0.0.17.

A group action of a group GG on a set XX is a function f:G×X→Xf:G\times X\rightarrow X with the following properties:

  1. (i)
    ​

    f⁢(e,x)=xf(e,x)=x for all x∈Xx\in X.

  2. (ii)
    ​

    f⁢(g⁢h,x)=f⁢(g,f⁢(h,x))f(gh,x)=f\big{(}g,f(h,x)\big{)} for all g,h∈Gg,h\in G and x∈Xx\in X.

We normally don’t write out the function “ff”; instead, we simply denote f⁢(g,x)f(g,x) by g⋅xg\cdot x. In this notation, property (2) reads

g⁢h⋅x=g⋅(h⋅x).gh\cdot x=g\cdot(h\cdot x).
Example 0.0.18.

The group SnS_{n} acts on the set {1,2,…,n}\{1,2,\ldots,n\}: σ⋅j=σ⁢(j)\sigma\cdot j=\sigma(j) for all σ∈Sn\sigma\in S_{n} and j∈{1,…,n}j\in\{1,\ldots,n\}. More generally, SXS_{X} acts on the set XX by evaluation.

Example 0.0.19.

The group Dn=⟨s,r|s2=rn=e,s⁢r=rn−1⁢s⟩D_{n}=\langle s,r\,|\,s^{2}=r^{n}=e,\,sr=r^{n-1}s\rangle acts on the regular nn-gon inscribed in the plane centred at the origin with a vertex at (0,1)(0,1). The element rr acts by rotating the polygon counterclockwise 2⁢πn\frac{2\pi}{n} radians, and ss mirrors the polygon in the yy-axis.

Example 0.0.20.

The group GG acts on itself by conjugation: g⋅h=g⁢h⁢g−1g\cdot h=ghg^{-1} for all g,h∈Gg,h\in G (note that here the “⋅\cdot” does not mean the group multiplication, but instead the conjugation action).

Given a group action of a group GG on a set XX, we let 𝒪G⁢(x){\mathcal{O}}_{G}(x) denote the orbit of a point x∈Xx\in X under GG, that is 𝒪G⁢(x)={g⋅x|g∈G}{\mathcal{O}}_{G}(x)=\{g\cdot x\,|\,g\in G\}. The stabiliser of a point xx is defined as StabG⁢(x)={g∈G|g⋅x=x}\mathrm{Stab}_{G}(x)=\{g\in G\,|\,g\cdot x=x\}.

In the special case of a group acting on itself by conjugation, the orbits are called conjugacy classes, and are instead denoted 𝒞g{\mathcal{C}}_{g}, i.e. 𝒞g={h⁢g⁢h−1|h∈G}{\mathcal{C}}_{g}=\{hgh^{-1}\,|\,h\in G\}.

Example 0.0.21.

Every element of SnS_{n} may be written as a product of disjoint cycles. For example, let σ∈S5\sigma\in S_{5} be σ=(12)⁢(345)\sigma=(12)(345). Then the conjugacy class of σ\sigma consists of all elements with the same cycle type. For the given element σ\sigma, we have that 𝒞σ{\mathcal{C}}_{\sigma} consists of all permutations of five elements that may be written as a disjoint 2-cycle and 3-cycle.

0.0.2. Linear algebra

Vector spaces and linear maps

Recall that a vector space VV over a field kk is a set combined with two operations:

  1. (i)
    ​

    vector addition: given two vectors 𝐯,𝐰∈V{\bf v},{\bf w}\in V, we can “add” them together to obtain a new vector 𝐯+𝐰∈V{\bf v}+{\bf w}\in V.

  2. (ii)
    ​

    scalar multiplication: given a vector 𝐯∈V{\bf v}\in V and an element λ∈k\lambda\in k, we can “multiply” 𝐯{\bf v} by λ\lambda to obtain a new vector λ⁢𝐯∈V\lambda{\bf v}\in V.

These two operations must be compatible with each other and satisfy some natural properties, as listed in the axioms for vector spaces.

We will almost always just consider vector spaces over ℂ{\mathbb{C}}, however other examples that one might consider are k=ℚ,ℝ,𝔽qk={\mathbb{Q}},{\mathbb{R}},\mathbb{F}_{q} (here q=prq=p^{r} where pp is prime and r∈ℕr\in{\mathbb{N}}, and 𝔽q\mathbb{F}_{q} denotes the field with qq elements).

Given two vector spaces V,WV,W (over the same field kk), a function T:V→WT:V\rightarrow W is said to be linear if

T⁢(α⁢𝐯+β⁢𝐮)=α⁢T⁢(𝐯)+β⁢T⁢(𝐮)T(\alpha{\bf v}+\beta{\bf u})=\alpha T({\bf v})+\beta T({\bf u})

for all 𝐯,𝐮∈V{\bf v},{\bf u}\in V and α,β∈k\alpha,\beta\in k. Two vector spaces are said to isomorphic if there exists an invertible linear map from one to the other.

The set of all linear maps from VV to WW is denoted Hom⁡(V,W)\operatorname{Hom}(V,W), and we write Hom⁡(V)\operatorname{Hom}(V) instead of Hom⁡(V,V)\operatorname{Hom}(V,V). These spaces carry a natural vector space structure inherited from VV and WW; given S,T∈Hom⁡(V,W)S,T\in\operatorname{Hom}(V,W) and λ∈k\lambda\in k, we define S+T∈Hom⁡(V,W)S+T\in\operatorname{Hom}(V,W) and λ⁢T∈Hom⁡(V,W)\lambda T\in\operatorname{Hom}(V,W) by

(S+T)⁢(𝐯):=S⁢(𝐯)+T⁢(𝐯),(λ⁢T)⁢(𝐯)=λ⁢T⁢(𝐯)(S+T)({\bf v}):=S({\bf v})+T({\bf v}),\qquad(\lambda T)({\bf v})=\lambda T({% \bf v})

for all 𝐯∈V{\bf v}\in V.

Subspaces and sums and quotients of vector spaces

Definition 0.0.22.

A subset UU of a vector space VV is said to be a subspace of VV if it is a vector space with the same addition and scalar multiplication operations as on VV.

Note that to show that a nonempty subset is a subspace, one simply needs to check that it is closed under vector addition and scalar multiplication.

Example 0.0.23.

Given T∈Hom⁡(V,W)T\in\operatorname{Hom}(V,W), recall that

ker⁡(T)={𝐯∈V|T⁢(𝐯)=0},im⁢(T)={𝐰∈W|∃𝐯∈V⁢s.t.𝐰=T⁢(𝐰)}.\ker(T)=\{{\bf v}\in V\,|\,T({\bf v})=0\},\quad{\mathrm{im}}(T)=\{{\bf w}\in W% \,|\,\exists{\bf v}\in V\;s.t.\;{\bf w}=T({\bf w})\}.

Then ker⁡(T)\ker(T) is a subspace of VV and im⁢(T){\mathrm{im}}(T) is a subspace of WW.

A vector space VV is an Abelian group with respect to the vector addition operation. A subspace UU of VV is therefore a normal subgroup with respect to this operation, allowing us to consider the quotient group (V/W,+,𝟎)(V/W,+,{\bf 0}). We can then define a scalar multiplication on this quotient by the formula

λ⁢(𝐯+W):=λ⁢𝐯+W\lambda({\bf v}+W):=\lambda{\bf v}+W

for all λ∈k\lambda\in k and 𝐯+W∈V/W{\bf v}+W\in V/W. This definition gives the quotient group a vector space structure, and we call this the quotient space of VV with respect to WW.

Given T∈Hom⁡(V,W)T\in\operatorname{Hom}(V,W), define a new map T~:V/ker⁡(T)→W\widetilde{T}:V/\ker(T)\rightarrow W by

T~⁢(𝐯+ker⁡(T)):=T⁢(𝐯)\widetilde{T}\big{(}{\bf v}+\ker(T)\big{)}:=T({\bf v})

for all 𝐯+ker⁡(T)∈V/ker⁡(T){\bf v}+\ker(T)\in V/\ker(T). Then T~:T/ker⁡(T)→im⁢(T)\widetilde{T}:T/\ker(T)\rightarrow{\mathrm{im}}(T) is an isomorphism of vector spaces.

The external direct sum of two vector spaces V,UV,U is the set

V⊕U={(𝐯,𝐮)|𝐯∈V,𝐮∈U},V\oplus U=\{({\bf v},{\bf u})\,|\,{\bf v}\in V,\,{\bf u}\in U\},

with the addition and scalar multiplication operations being defined component-wise.

If VV and UU are subspaces of a vector space WW such that V∩U={𝟎}V\cap U=\{{\bf 0}\} and every element of WW may be written as the sum of an element of VV and an element of UU, then we say that WW is the internal direct sum of VV and UU, and the map (𝐯,𝐮)↦𝐯+𝐮({\bf v},{\bf u})\mapsto{\bf v}+{\bf u} is an isomorphism from V⊕UV\oplus U to WW.

One can define sums V1⊕V2⊕V3⊕…V_{1}\oplus V_{2}\oplus V_{3}\oplus\ldots of multiple vector spaces in a similar way.

Eigenvalues and eigenvectors

Definition 0.0.24.

A number λ\lambda is said to be an eigenvalue of T∈Hom⁡(V)T\in\operatorname{Hom}(V) if there exists a non-zero vector 𝐯∈V{\bf v}\in V such that

T⁢(𝐯)=λ⁢𝐯.T({\bf v})=\lambda{\bf v}.

The vector 𝐯{\bf v} is said to be a λ\lambda-eigenvector of TT.

A basis 𝐯1,𝐯2,…{\bf v}_{1},{\bf v}_{2},\ldots, of VV is said to be an eigenbasis of T∈Hom⁡(V)T\in\operatorname{Hom}(V) if every element of the basis is an eigenvector of TT. If TT has an eigenbasis, then TT is said to be diagonalisable. We will make use of the following result at a few key moments in the module:

Proposition 0.0.25.

Let A,BA,B be two commuting elements of Hom⁡(V)\operatorname{Hom}(V), where VV is a finite dimensional vector space. If AA and BB are both diagonalisable, then there is a joint eigenbasis of VV, i.e. a basis of VV such that every element of the basis is an eigenvector of both AA and BB.

0.0.3. Exercises

.

Problem 1. Let (G,⋅,e)(G,\cdot,e) be a group. Given g∈Gg\in G, define ∗g:G×G→G\ast_{g}:G\times G\rightarrow G by

x∗gy:=x⁢g⁢y.x\ast_{g}y:=xgy.

Show that (G,∗g,g−1)(G,\ast_{g},g^{-1}) is a group, where g⋅g−1=eg\cdot g^{-1}=e.

Problem 2. Find all subgroups of D4D_{4}.

Problem 3. Compute the conjugacy classes of Q8Q_{8}.

Problem 4. Compute the conjugacy classes of D4D_{4}.

Problem 5. Find the conjugacy classes of DnD_{n}.

Problem 6. Let a group GG act on a set XX. Show that the stabiliser of a point xx, StabG⁢(x)={g∈G|g⋅x=x}\mathrm{Stab}_{G}(x)=\{g\in G\,|\,g\cdot x=x\}, is a subgroup of GG. Note that it is often called the stabiliser subgroup.

Problem 7. Show that D3≅S3D_{3}\cong S_{3}. Hint: Label the vertices of the triangle by 1,2,31,2,3 and consider the action of D3D_{3} on them (cf. Example 0.0.19).

Problem 8. Identify, with proof, the group given in Example 0.0.7.

Problem 9. Show that any finite group GG is isomorphic to a subgroup of S|G|S_{|G|}.

Problem 10. For a prime pp, compute the orders of SL2⁡(𝔽p)\operatorname{SL}_{2}(\mathbb{F}_{p}) and GL2⁡(𝔽p)\operatorname{GL}_{2}(\mathbb{F}_{p}).

Problem 11. Prove Proposition 0.0.25.