\(\star\) Fall 2016 #7 #algebra/qual/work

Define what it means for a group \(G\) to be solvable.

Show that every group \(G\) of order 36 is solvable.
Hint: you can use that \(S_4\) is solvable.
Spring 2015 #4 #algebra/qual/completed
Let \(N\) be a positive integer, and let \(G\) be a finite group of order \(N\).

Let \(\operatorname{Sym}^*G\) be the set of all bijections from \(G\to G\) viewed as a group under composition. Note that \(\operatorname{Sym}^*G \cong S_N\). Prove that the Cayley map \begin{align*} C: G&\to \operatorname{Sym}^*G\\ g &\mapsto (x\mapsto gx) \end{align*} is an injective homomorphism.

Let \(\Phi: \operatorname{Sym}^*G\to S_N\) be an isomorphism. For \(a\in G\) define \({\varepsilon}(a) \in \left\{{\pm 1}\right\}\) to be the sign of the permutation \(\Phi(C(a))\). Suppose that \(a\) has order \(d\). Prove that \({\varepsilon}(a) = 1 \iff d\) is even and \(N/d\) is odd.
 Suppose \(N> 2\) and \(N\equiv 2 \operatorname{mod}4\). Prove that \(G\) is not simple.
Hint: use part (b).
We haven’t really covered the Cayley representation (“leftregular representation”) in the qual class in recent years, and this question uses some slightly nontrivial properties of it.
 A cycle \(\sigma\in S_N\) is odd \(\iff {\varepsilon}(\sigma) = 1 \iff \sigma\) has an odd number of even cycles \(\iff \sigma\) can be written as an even number of transpositions.
 A single cycle of even length is odd, and of odd length is even, by writing \((123\cdots, d) = (12)(13)\cdots(1d)\), reading righttoleft.
 \(A_n \coloneqq\ker (S_n\to {\mathbf{Z}}/2{\mathbf{Z}})\) is the kernel of the sign morphism, so only even permutations.
Part a: Check that \(\ker C = \left\{{e}\right\} \subseteq G\), or prove injectivity directly via \(C(g) = C(h) \implies g=h\). For the former, introduce some new notation: write \begin{align*} C: G &\to \operatorname{Sym}(G) \\ g &\mapsto \tau_g .\end{align*} where \begin{align*} \tau_g: G &\to G \\ x &\mapsto gx \end{align*} is lefttranslation by \(g\). Now note that the identity in \(\operatorname{Sym}(G)\) is the group morphism \(\operatorname{id}_G\), so \begin{align*} \ker(C) &\coloneqq\left\{{g\in G {~\mathrel{\Big\vert}~}C(g) = \operatorname{id}_G }\right\} \\ &= \left\{{g\in G {~\mathrel{\Big\vert}~}\tau_g(x) = x \,\,\forall x\in G}\right\} \\ &= \left\{{g\in G {~\mathrel{\Big\vert}~}gx = x \,\, \forall x\in G}\right\} \\ &= \bigcap_{x\in G}{\operatorname{Stab}}_G(x) ,\end{align*} i.e. anything in the kernel is (by definition) in the stabilizer of every point \(x\in G\). Now check that \begin{align*} g\in {\operatorname{Stab}}_G(x) \iff gx=x \iff gxx^{1}= xx^{1}\iff ge= e \iff g=e \end{align*} where \(e\) is the identity in \(G\), so \({\operatorname{Stab}}_G(x) = \left\{{e}\right\}\) for every \(x\in G\) and thus \(\ker(C) = \left\{{e}\right\}\).
Note: one should also prove that \(C\) is actually a group morphism, but this is mostly a routine check.
Part b: Let \(\Psi: G\to S_N\) be the composition \(\Psi = \Phi \circ C\); this is a group morphism and \(\ker \Psi {~\trianglelefteq~}G\) is always a normal subgroup (which is used in part c).
Fix \(a\in G\) with \(d\) defined as the order of \(a\).
\(\impliedby\): Suppose \(d\) is even and \(N/d\) is odd. Let \(A \coloneqq\left\langle{a}\right\rangle\), then \([G: H] = N/d\), so there are an odd number of (left) \(A{\hbox{}}\)cosets. Consider the permutation \(\Psi(a) \in S_N\); the claim is that \(\tau_a\) is a product of \(N/d\) cycles, all of length \(d\). Given this claim, under our assumptions \(\Psi(a)\) has an odd number of even cycles, is thus an odd permutation, and thus \({\varepsilon}(a) = 1\).
\(\implies\): Suppose \({\varepsilon}(a) = 1\), then \(\Psi(a)\) is an odd permutation. Since \(\Psi(a)\) is in the image of \(\Psi\), it can be written as a product (not necessarily unique) of \(N/d\) cycles of length \(d\). Since this cycle must be odd, there must be an odd number of even cycles in any such decomposition. One can show that all cycles in the image of the leftregular representation are the same length, so every cycle is of even length \(d\), and there are an odd number \(N/d\) of them.
Part c: . Since a sufficient condition for \(G\) not to be simple is existence of a nontrivial normal subgroup, it suffices to cook up a nontrivial \(a\in \ker \Psi\).
Note that \begin{align*} N\equiv 2\operatorname{mod}4\implies 2\divides N\, \text{ and } 2^2\notdivides N \implies N/2 \text{ is odd} ,\end{align*} so with the hint in mind, consider \(d\coloneqq 2\).
Suppose \begin{align*} \ker(\Psi) \coloneqq\left\{{a\in G {~\mathrel{\Big\vert}~}{\varepsilon}(a) = 1}\right\} = \left\{{e}\right\} ,\end{align*} then this forces \({\varepsilon}(a) = 1\) for every nontrivial \(a\in G\). Letting \(d(a)\) be the order of \(a\), we know that \(d(a)\) must be even and \(N/d(a)\) must be odd for every \(a\). Since \(d(a)\) is even, \(2\divides d(a)\), but since \(2^2 \not\divides N\), we must have \(2^2\not\divides d(a)\). So \(d(a)\) is an even number (so no odd prime factors) with exactly one copy of \(2\) in its prime factorization, forcing \(d(a) = 2\) for all \(a\in G\).
But now every element in \(G\) is order 2, and a one can show the general result that if every \(g\in G\) satisfies \(g^2=e\) then the size of \(G\) is a power of \(2\). However, since \(N/2\) is necessarily odd, this is a contradiction. \(\contradiction\)
So there must be some \(a\in G\) with \({\varepsilon}(a)=1\), making \(\ker(\Psi) {~\trianglelefteq~}G\) nontrivial and exhibiting a normal subgroup that makes \(G\) nonsimple.
For the power of 2 result, one can use Cauchy’s theorem: if any odd prime \(p\geq 3\) divides the size of \(G\), then there exists an element of order \(p\), contradiction.
Spring 2014 #1 #algebra/qual/work
Let \(p, n\) be integers such that \(p\) is prime and \(p\) does not divide \(n\). Find a real number \(k = k (p, n)\) such that for every integer \(m\geq k\), every group of order \(p^m n\) is not simple.
Fall 2013 #1 #algebra/qual/work
Let \(p, q\) be distinct primes.

Let \(\overline{q} \in {\mathbf{Z}}_p\) be the class of \(q\operatorname{mod}p\) and let \(k\) denote the order of \(\overline{q}\) as an element of \({\mathbf{Z}}_p^{\times}\). Prove that no group of order \(pq^k\) is simple.

Let \(G\) be a group of order \(pq\), and prove that \(G\) is not simple.
Spring 2013 #4 #algebra/qual/work
Define a simple group. Prove that a group of order 56 can not be simple.
Fall 2019 Midterm #3 #algebra/qual/work
Show that there exist no simple groups of order 148.