Prerequisites

Problem 1. Let (G,,e)(G,\cdot,e) be a group. Given gGg\in G, define g:G×GG\ast_{g}:G\times G\rightarrow G by

xgy:=xgy.x\ast_{g}y:=xgy.

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

Solution: We have to verify the group axioms. Firstly, for any x,y,zGx,y,z\in G,

(xgy)gz=(xgy)gz=(xgy)gz=xgygz=xg(ygz)=xg(ygz)=xg(ygz),(x\ast_{g}y)\ast_{g}z=(xgy)\ast_{g}z=(xgy)gz=xgygz=xg(ygz)=xg(y\ast_{g}z)=x% \ast_{g}(y\ast_{g}z),

showing that g\ast_{g} is associative (here we used that we know that \cdot is associative). Next we verify that g1g^{-1} is an identity for g\ast_{g}:

xgg1=xgg1=x,g1gx=g1gx=xxG.x\ast_{g}g^{-1}=xgg^{-1}=x,\qquad g^{-1}\ast_{g}x=g^{-1}gx=x\qquad\forall\,x% \in G.

Finally, we show that every element has an inverse: for any xGx\in G,

xg(g1x1g1)=xgg1x1g1=g1;x\ast_{g}(g^{-1}x^{-1}g^{-1})=xgg^{-1}x^{-1}g^{-1}=g^{-1};

(it follows that g1x1g1g^{-1}x^{-1}g^{-1} is also a left inverse of xx).

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

Solution: Recall that the order of any element and any subgroup must divide the order of the group. Since D4={e,s,r,sr,r2,sr2,r3,sr3}D_{4}=\{e,s,r,sr,r^{2},sr^{2},r^{3},sr^{3}\}, there are eight elements, hence any subgroup must have order 1,2,41,2,4, or 88. The subgroup of order one is {e}\{e\}, and the order eight subgroup is D4D_{4} itself. The order two subgroups are all of the form {e,x},\{e,x\}, where x2=ex^{2}=e. Going through the elements one by one, we see that the possibilities are {e,s}\{e,s\}, {e,r2}\{e,r^{2}\}, {e,sr}\{e,sr\}, {e,sr2}\{e,sr^{2}\}, {e,sr3}\{e,sr^{3}\}. Finally, we search for the order four subgroups. Clearly {e,r,r2,r3}\{e,r,r^{2},r^{3}\} is a cyclic subgroup of order four. Noting that rr and r3r^{3} are the only group elements of order four, the other subgroups of order four must be of the form {e,x,y,xy}\{e,x,y,xy\}, where xx and yy are two commuting elements of order two, and hence xyxy is also of order two. Systematically multiplying together the order two elements gives the subgroups {e,s,r2,sr2}\{e,s,r^{2},sr^{2}\}, {e,sr,r2,sr3}\{e,sr,r^{2},sr^{3}\}, and no other possibilities.

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

Solution: Recall that Q8={±1,±i,±j,±k|i2=j2=k2=ijk=1}Q_{8}=\{\pm 1,\pm i,\pm j,\pm k|i^{2}=j^{2}=k^{2}=ijk=-1\}. The systematic way to find conjugacy classes is to go through the group element by element, repeatedly conjugating by the generators until all elements have been assigned to a conjugacy class. The singleton {1}\{1\} is a conjugacy class. 1Z(Q8)-1\in Z(Q_{8}), so it too is its own conjugacy class. Then taking the element ii and conjugating by the generators gives ii(i)=iii(-i)=i, ji(j)=kj=iji(-j)=kj=-i, and ki(k)=jk=iki(-k)=-jk=-i Since i=(1)i-i=(-1)i, and 1Z(Q8)-1\in Z(Q_{8}), conjugating i-i by the generators gives no new elements, hence {±i}\{\pm i\} is a conjugacy class. By symmetry in i,j,ki,j,k, the remaining conjugacy classes are {±j}\{\pm j\} and {±k}\{\pm k\}.

There are therefore 5 conjugacy classes of Q8Q_{8}: {1}\{1\}, {1}\{-1\}, {±i}\{\pm i\}, {±j}\{\pm j\}, and {±k}\{\pm k\}.

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

Solution: We proceed as in Problem 3: D4={e,s,r,sr,r2,sr2,r3,sr3}D_{4}=\{e,s,r,sr,r^{2},sr^{2},r^{3},sr^{3}\}, with generators rr and ss. The singleton {e}\{e\} is a conjugacy class. Conjugating ss by the generators gives sss=ssss=s, and rsr3=sr2rsr^{3}=sr^{2}, so sr2sr^{2} is in the same conjugacy class as ss. Now conjugating sr2sr^{2} by the generators yields ssr2s=sr2ssr^{2}s=sr^{2}, and rsr2r3=srsr^{2}r^{3}=s, hence {s,sr2}\{s,sr^{2}\} is a conjugacy class. Conjugating rr by the generators: rrr3=rrrr^{3}=r, srs=ssr3=r3srs=ssr^{3}=r^{3}. Since all elements of a conjugacy class have the same order, and rr and r3r^{3} are the only order four elements, no other elements can be in the conjugacy class {r,r3}\{r,r^{3}\}. Starting with the element srsr: ssrs=sr3ssrs=sr^{3}, and rsrr3=sr3rsrr^{3}=sr^{3}. Now conjugating sr3sr^{3}: ssr3s=sr,ssr^{3}s=sr, and rsr3r3=srrsr^{3}r^{3}=sr, giving the conjugacy class {sr,sr3}\{sr,sr^{3}\}. All that remains is {r2}\{r^{2}\},

i.e. the conjugacy classes of D4D_{4} are as follows: {e}\{e\}, {r2}\{r^{2}\}, {s,sr2}\{s,sr^{2}\}, {r,r3}\{r,r^{3}\}, and {sr,sr3}\{sr,sr^{3}\}.

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

Solution: {e}\{e\} is of course a conjugacy class. The other elements are all of the form rjr^{j} or srjsr^{j}. Since r\langle r\rangle is cyclic (and hence Abelian), conjugating rjr^{j} with an element rkr^{k} just returns rjr^{j}. On the other hand, conjugating rjr^{j} with srksr^{k} gives

(srk)rj(srk)1=srkrjrks=srjs=rj=rnj.(sr^{k})r^{j}(sr^{k})^{-1}=sr^{k}r^{j}r^{-k}s=sr^{j}s=r^{-j}=r^{n-j}.

This shows that {rj,rnj}\{r^{j},r^{n-j}\} is a conjugacy class for 1jn21\leq j\leq\frac{n}{2} (Note that if nn is even, then {rn/2}\{r^{n/2}\} is its own conjugacy class.) Now taking an arbitrary srjsr^{j} and conjugating with rr gives

rsrjr1=srj2.rsr^{j}r^{-1}=sr^{j-2}.

Since srj2=srj+n2sr^{j-2}=sr^{j+n-2}, we see that if nn is odd, given any srj1sr^{j_{1}} and srj2sr^{j_{2}}, we can find kk s.t. rksrj1rk=srj2r^{k}sr^{j_{1}}r^{-k}=sr^{j_{2}}.

Thus, for odd nn the conjugacy classes are {e}\{e\}, {r,rn1}\{r,r^{n-1}\}, {r2,rn2},,\{r^{2},r^{n-2}\},\ldots, {r(n1)/2,r(n+1)/2}\{r^{(n-1)/2},r^{(n+1)/2}\}, and {srk|k=0,,n1}\{sr^{k}\,|\,k=0,\ldots,n-1\}.

On the other hand, if nn is even, then we see that repeatedly conjugating srjsr^{j} with rr returns all elements srksr^{k} with j2kj\equiv_{2}k. We also check that conjugating with ss has the same behaviour:

ssrjs=srnj;ssr^{j}s=sr^{n-j};

again since nn is even, jj and njn-j have the same parity mod 22. The conjugacy classes for even nn are therefore {e}\{e\}, {rn/2},\{r^{n/2}\}, {r,rn1}\{r,r^{n-1}\}, {r2,rn2},,\{r^{2},r^{n-2}\},\ldots, {rn/21,rn/2+1}\{r^{n/2-1},r^{n/2+1}\}, {srk|k20}\{sr^{k}\,|\,k\equiv_{2}0\}, {srk|k21}\{sr^{k}\,|\,k\equiv_{2}1\}.

Problem 6. Let a group GG act on a set XX. Show that the stabiliser of a point xx, StabG(x)={gG|gx=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.

Solution: Suppose g,hStabG(x)g,h\in\mathrm{Stab}_{G}(x), then

(gh)x=g(hx)=gx=x.(gh)\cdot x=g\cdot(h\cdot x)=g\cdot x=x.

Thus ghStabG(x)gh\in\mathrm{Stab}_{G}(x). Also note that, for any gStabG(x)g\in\mathrm{Stab}_{G}(x),

x=ex=g1(gx)=g1x,x=e\cdot x=g^{-1}\cdot(g\cdot x)=g^{-1}\cdot x,

and thus g1StabG(x)g^{-1}\in\mathrm{Stab}_{G}(x). As StabG(x)\mathrm{Stab}_{G}(x) is clearly nonempty (eStabG(x)e\in\mathrm{Stab}_{G}(x)) it is a subgroup of GG.

Problem 7. Show that D3S3D_{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.

Solution: Labelling the vertices of the triangle counterclockwise from (1,0), we see that rr moves 11 to the position of 22, 22 to 33’s spot, and 33 back to 11’s place. ss on the other hand leaves 11 fixed and swaps 22 and 33. This suggests we should try to make a homomorphism φ:D3S3\varphi:D_{3}\rightarrow S_{3} by defining

φ(skrj)=(2 3)k(1 2 3)j.\varphi(s^{k}r^{j})=(2\,3)^{k}(1\,2\,3)^{j}.

In order for this to define a homomorphism, we simply need to verify that φ(r)\varphi(r) and φ(s)\varphi(s) satisfy the same relations as rr and ss. φ(s)\varphi(s) is a two-cycle, and φ(r)\varphi(r) is a three-cycle, so Id=φ(s)2=φ(r)3\mathrm{Id}=\varphi(s)^{2}=\varphi(r)^{3}. It remains to check the relation φ(s)φ(r)=φ(r)1φ(s)\varphi(s)\varphi(r)=\varphi(r)^{-1}\varphi(s). On the one hand,

φ(s)φ(r)=(2 3)(1 2 3)=(1 3),\varphi(s)\varphi(r)=(2\,3)(1\,2\,3)=(1\,3),

while using that (1 2 3)1=(1 3 2)(1\,2\,3)^{-1}=(1\,3\,2) gives

φ(r)1φ(s)=(1 3 2)(2 3)=(1 3),\varphi(r)^{-1}\varphi(s)=(1\,3\,2)(2\,3)=(1\,3),

hence φ\varphi is a homomorphism. In order to show that it is an isomorphism, we compute kerφ\ker\varphi. All group elements are of the form skrjs^{k}r^{j}, where k=0k=0 or 11, and j=0,1,2j=0,1,2. Looking at the elements rjr^{j}, if rjkerφr^{j}\in\ker\varphi, then φ(rj)=(1 2 3)j=Id\varphi(r^{j})=(1\,2\,3)^{j}=\mathrm{Id} only holds if j=0j=0. For the elements s,sr,sr2s,sr,sr^{2}, we have φ(s)=(2 3)\varphi(s)=(2\,3), φ(sr)=(1 3),\varphi(sr)=(1\,3), and φ(sr2)=(2 3)(1 3 2)=(1 2)\varphi(sr^{2})=(2\,3)(1\,3\,2)=(1\,2), hence kerφ={e}\ker\varphi=\{e\}. Then by the isomorphism theorem, D3im(φ)/ker(φ)=im(φ)D_{3}\cong\mathrm{im}(\varphi)/\ker(\varphi)=\mathrm{im}(\varphi). However, since |D3|=|S3|=6|D_{3}|=|S_{3}|=6, we must have im(φ)=S3\mathrm{im}(\varphi)=S_{3}.

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

Solution: We will show this by constructing a group homomorphism and then showing it is an isomorphism. Consider the map

ϕ:s,t|s2=t2=e,sts=tst\displaystyle\phi:\langle s,t\,|\,s^{2}=t^{2}=e,sts=tst\rangle D3=r,s|r3=s2=e,sr=r2s\displaystyle\longrightarrow D_{3}=\left\langle r,s\,|\,r^{3}=s^{2}=e,sr=r^{2}% s\right\rangle
s\displaystyle s s,\displaystyle\longmapsto s,
st\displaystyle st r.\displaystyle\longmapsto r.

This is a groups homomorphism as all relations are preserved by ϕ\phi: s2=es^{2}=e, (st)3=e(st)^{3}=e and s(st)=t=(ts)s=(st)2ss(st)=t=(ts)s=(st)^{2}s. As both groups have order 66 and the kernel is trivial we have a bijection. Thus the groups are isomorphic

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

Solution: Label the elements of G:G: g1,g|G|g_{1},\,\ldots g_{|G|}. For each group element hGh\in G, we define a permutation σhS|G|\sigma_{h}\in S_{|G|} by the rule hgi=gσh(i)hg_{i}=g_{\sigma_{h}(i)}. Since the map ghgg\mapsto hg is a bijection on GG, hσhh\mapsto\sigma_{h} is a well-defined map from GG to S|G|S_{|G|}. We claim that it is a homomorphism:

σgh(i)=j(gh)gi=gjghgi=gjggσh(i)=gjgσg(σh(i))=gjσg(σh(i))=j,\sigma_{gh}(i)=j\Leftrightarrow(gh)g_{i}=g_{j}\Leftrightarrow ghg_{i}=g_{j}% \Leftrightarrow gg_{\sigma_{h}(i)}=g_{j}\Leftrightarrow g_{\sigma_{g}(\sigma_{% h}(i))}=g_{j}\Leftrightarrow\sigma_{g}(\sigma_{h}(i))=j,

hence σgh=σgσh\sigma_{gh}=\sigma_{g}\circ\sigma_{h} for all g,hGg,h\in G. We also claim that ker(gσg)={e}\ker(g\mapsto\sigma_{g})=\{e\}: note that σg(i)=iggi=gig=e\sigma_{g}(i)=i\Leftrightarrow gg_{i}=g_{i}\Leftrightarrow g=e. Thus Gim(gσG)<S|G|G\cong\mathrm{im}(g\mapsto\sigma_{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}).

Solution:

Problem 11. Prove Proposition 0.25.

Solution: