Logo

Chapter 6: Further Topics in Group Theory

6.1 pp-groups, Nilpotent Groups, and Solvable Groups

Definition: A maximal subgroup of a group GG is a proper subgroup MM of GG such that ∄H≤G\nexists H\leq G with M<H<GM<H<G.
Theorem 1: Let pp be prime and PP have order pa,a>1p^{a},a>1. Then

Definition:

Proposition 2: Let pp be a prime and PP be a group of order pap^{a}. Then PP is nilpotent of nilpotence class at most a−1a-1 for a≥2a\geq{2} (and class = aa when a=0,1a=0,1).
Theorem 3: Let GG be a finite group, let p1,…,psp_{1},\dots,p_{s} be the distinct primes dividing ∣G∣\lvert G \rvert and let Pi∈Sylpi(G)P_{i}\in Syl_{p_{i}}(G), 1≤i≤s1\leq i\leq s. Then the following are equivalent:

Corollary 4: A finite abelian group is the direct product of its Sylow subgroups.
Proposition 5: If GG is a finite group such that for all n∈Z+n\in \mathbb{Z}^+ with n∣∣G∣n \mid \lvert G \rvert, GG contains at most nn elements xx satisfying xn=1x^{n}=1, then GG is cyclic.
Proposition 6: (Frattini's Argument) Let GG be a finite group, H⊴GH\trianglelefteq G, and P∈Sylp(H)P\in Syl_{p}(H). Then G=HNG(P)G=HN_{G}(P) and ∣G:H∣\lvert G:H \rvert divides ∣NG(P)∣\lvert N_{G}(P) \rvert.
Proposition 7: A finite group is nilpotent   ⟺  \iff every maximal subgroup is normal.
Definition: For any (finite or infinite) group GG we define G0=G,G1=[G,G],Gi+1=[G,Gi]G^{0}=G,G^{1}=[G,G],G^{i+1}=[G,G^{i}]. The chain of groups G0≥G1≥G2≥…G^{0}\geq G^{1}\geq G^{2}\geq\dots is called the lower central series of GG.
Theorem 8: A group GG is nilpotent   ⟺  \iff Gn=1G^{n}=1 for some n≥0n\geq{0}. In fact, GG is nilpotent of class cc   ⟺  \iff cc is the smallest nonnegative integer such that Gc=1G^{c}=1. Also, then Gc−i≤Zi(G)G^{c-i}\leq Z_{i}(G), froalli∈{0,..,c}froalli\in \{ 0,..,c \}.
Definition: For any group GG we define G(0)=G,G(1)=[G,G],G(i+1)=[G(i),G(i)]G^{(0)}=G,G^{(1)}=[G,G],G^{(i+1)}=[G^{(i)},G^{(i)}]. The chain of groups G(0)≥G(1)≥…G^{(0)}\geq G^{(1)}\geq\dots is the derived or commutator series of GG.
Definition: A group GG is solvable if there exists a chain of subgroups 1=G0⊴G1⊴⋯⊴Gs=G1=G_{0}\trianglelefteq G_{1}\trianglelefteq\dots\trianglelefteq G_{s}=G such that Gi+1/GiG_{i+1}/G_{i} is abelian ∀i∈{0,1,…,s−1}\forall i\in \{ 0,1,\dots,s-1 \}.
Theorem (3.4): A finite group GG is solvable   ⟺  \iff ∀n\forall n with n∣∣G∣n \mid \lvert G \rvert and (n,∣G∣n)=1\left( n, \frac{\lvert G \rvert}{n} \right)=1, GG has a subgroup of order nn.
Theorem 9: A group GG is solvable   ⟺  \iff G(n)=1G^{(n)}=1 for some n≥0n\geq{0}.
Definition: If GG is solvable, the smallest nonnegative nn such that G(n)=1G^{(n)}=1 is the solvable length of GG.
Proposition 10: Let G,KG,K be groups, H≤GH\leq G, and φ:G→K\varphi:G\to K be a surjective homomorphism. Then

Theorem 11: Let GG be a finite group.

6.2 Applications in Groups of Medium Order

Technique 1: (Counting Elements) Consider Sylow pp-subgroups where p∣∣G∣p \mid \lvert G \rvert and p2∤∣G∣p^{2} \nmid \lvert G \rvert. Non-normality implies np>1,∀pn_{p}>1,\forall p. Calculate # of elements of prime order from this, show that it is >G  ⟹  >G\implies not simple. Or, show that np=1n_{p}=1 for some pp.
Technique 2: (Exploiting subgroups of small index) This is derived from the fact that if H≤GH\leq G and ∣G:H∣=k\lvert G:H \rvert=k, ∃φ:G→Sk\exists \varphi:G\to S_{k} with ker  φ≤H\mathrm{ker\;\varphi}\leq H. If GG is simple, k=1  ⟹  G≅F≤Sk  ⟹  ∣G∣∣k!k=1\implies G\cong F\leq S_{k}\implies \lvert G \rvert \mid k! (that is, φ\varphi must be an injective homomorphism since ker  φ⊴G\mathrm{ker\;}\varphi\trianglelefteq G and we assume GG is simple). ∣G∣=p1α1…psαs\lvert G \rvert={p_{1}}^{\alpha_{1}}\dots{p_{s}}^{\alpha_{s}} with p1<⋯<psp_{1}<\dots<p_{s}. Minimal possible index of a proper subgroup is (usually) dependent on αs\alpha_{s}. αs=1  ⟹  ≥ps\alpha_{s}=1\implies \geq p_{s}, αs=2  ⟹  ≥2ps\alpha_{s}=2\implies\geq 2p_{s}.
Technique 3: (Permutation Representations) Consider a proper subgroup of index kk in GG with ∣G∣=n\lvert G \rvert=n. Then, G≅F≤SkG\cong F\leq S_{k}. We then calculate within SkS_{k} that SkS_{k} contains no simple subgroup of order nn. Two helpful restrictions are

Technique 4: (Playing pp-subgroups off against each other for distinct primes pp)

Technique 5: (Studying normalizers of intersections of Sylow pp-subgroups) Technique 1 fails to generalize because if distinct P,R∈Sylp(G)P,R\in Syl_{p}(G) and ∣P∣=pα,α≥2\lvert P \rvert=p^{\alpha},\alpha\geq 2, it is not necessary for P∩R=1P\cap R=1. Suppose ∃P,R\exists P,R with the above true. Let P0=P∩RP_{0}=P\cap R. Then, P0<PP_{0}<P and P0<RP_{0}<R. By Theorem 1, P0<NP(P0)P_{0}<N_{P}(P_{0}) and P0<NR(P0)P_{0}<N_{R}(P_{0}). We aim to use this to prove that the normalizer in GG has smaller index than the minimal index. This works well when ∣P0∣=pα−1\lvert P_{0} \rvert=p^{\alpha-1}, as then NG(P0)N_{G}(P_{0}) has two distinct Sylow pp-subgroups P,RP,R since P0P_{0} is a maximal subgroup of P,RP,R. In particular, ∣NG(P0)∣=pαk\lvert N_{G}(P_{0}) \rvert=p^{\alpha }k where k≥p+1k\geq p+1.
Proposition 12:

Lemma 13: In a finite group GG, if np≢1  (mod  p2)n_{p}\not\equiv1\; (\text{mod} \; p^{2} ), then ∃P,R∈Sylp(G)\exists P,R\in Syl_{p}(G) with P≠RP\neq R and P∩RP\cap R is of index pp in both P,RP,R (and thus normal in each).
Proposition 14: If GG is a simple group of order 168, then

Theorem 15: Up to isomorphism there is a unique simple group of order 168, GL3(F2)≅GL_{3}(\mathbb{F}_{2})\cong automorphism group of the projective plane F\mathcal{F}.

6.3 A Word on Free Groups

Theorem 16: F(S)F(S) is a group under the binary operation defined as follows:

(r1δ1r2δ2…rmδm)(s1δ1s2δ2…smδm)={r1δ1…rm−k+1δm−k+1skϵk…snϵn,k≤msm+1ϵm+1…snϵn,k=m+1≤n,1,k=m+1,m=n(r_{1}^{\delta_{1}}r_{2}^{\delta_{2}}\dots r_{m}^{\delta_{m}})(s_{1}^{\delta_{1}}s_{2}^{\delta_{2}}\dots s_{m}^{\delta_{m}})=\left\{ \begin{matrix*} r_{1}^{\delta_{1}}\dots r_{m-k+1}^{\delta_{m-k+1}}s_{k}^{\epsilon_{k}}\dots s_{n}^{\epsilon_{n}}, & k\leq m \\ s_{m+1}^{\epsilon_{m+1}}\dots s_{n}^{\epsilon_{n}},& k=m+1\leq n, \\ 1,& k=m+1,m=n \end{matrix*} \right.

Where kk is the smallest integer in the range 1≤k≤m+11\leq k\leq m+1 such that skϵk≠rm−k+1−δm−k+1s_{k}^{\epsilon_{k}}\neq r_{m-k+1}^{-\delta_{m-k+1}}. (Where the product of rr and ss in the center does not cancel).
Theorem 17: Let GG be a group, SS a set, and φ:S→G\varphi:S\to G a set map. Then there is a unique group homomorphism Φ:F(S)→G\Phi:F(S)\to G such that the following diagram commutes: thm17-triangle.png Corollary 18: F(S)F(S) is unique up to a unique isomorphism which is the identity map on the set SS.
Definition: The group F(S)F(S) is called the free group on the set SS. A group FF is a free group if there is some SS such that F=F(S)F=F(S) — in this case we call SS a set of free generators (or a free basis) of FF. The cardinality of SS is the rank of the free group.
Theorem 19: (Schreier) Subgroups of a free group are free.
Definition: Let S⊆GS\subseteq G such that G=⟨S⟩G=\langle S \rangle.