Logo

Chapter 3: Quotient Groups and Homomorphisms

3.1 Quotient Groups

Proposition 1: Let G,HG,H be groups and let φ:G→H\varphi:G\to H be a homomorphism. Then,

φ(1G)=1Hφ(g−1)=φ(g)−1φ(gn)=φ(g)nker  φ≤Gim  (φ)≤H\varphi(1_{G})=1_{H} \qquad \varphi(g^{-1})=\varphi(g)^{-1} \qquad \varphi(g^{n})=\varphi(g)^{n} \qquad \mathrm{ker\;}\varphi\leq G \qquad \mathrm{im\;}(\varphi)\leq H

Theorem 3: Let G,HG,H be groups and K=ker  φK=\mathrm{ker\;}\varphi with φ:G→H\varphi:G\to H. Then the set of left cosets of KK in GG is G/KG/K and the operation uK∘vK=(uv)KuK\circ vK=(uv)K is well defined if the converse of injectivity is true, i.e. u=v  ⟹  φ(u)=φ(v)u=v\implies \varphi(u)=\varphi(v).
Proposition 4: Let GG be a group and N≤GN\leq G. Then the set of left cosets of NN in GG partition GG, and ∀u,v∈G\forall u,v\in G, uN=vN  ⟺  v−1u∈NuN=vN\iff v^{-1}u\in N.
Proposition 5: Let GG be a group and N≤GN\leq G. The operation uN⋅vN=(uv)NuN\cdot vN=(uv)N is well defined   ⟺  gng−1∈N,∀g∈G\iff gng^{-1}\in N,\forall g\in G and ∀n∈N\forall n\in N. If the operation if well defined, the set of left cosets of NN in GG is a group.
Definition: gng−1gng^{-1} is the conjugate of n∈Nn\in N by g∈Gg\in G. The set gNg−1={gng−1∣n∈N}gNg^{-1}=\{ gng^{-1} \mid n\in N \} is called the conjugate of NN by gg. The element gg normalizes NN if gNg−1=NgNg^{-1}=N. A subgroup NN of GG is normal (N⊴GN\trianglelefteq G) if gNg−1=N,∀g∈GgNg^{-1}=N,\forall g\in G. All subgroups of an abelian group are normal.
Theorem 6: Let N≤GN\leq G. The following statements are equivalent:

N⊴GNG(N)=GgN=Ng,∀g∈GThe set of left cosets of N in G are a groupgNg−1⊆N,∀g∈GN\trianglelefteq G \qquad N_{G}(N)=G \qquad gN=Ng, \forall g\in G \qquad \text{The set of left cosets of }N\text{ in }G\text{ are a group} \qquad gNg^{-1}\subseteq N,\forall g\in G

Proposition 7: N⊴G  ⟺  ∃φN\trianglelefteq G\iff \exists \varphi such that φ\varphi is a homomorphism and ker  φ=N\mathrm{ker\;\varphi}=N.
Definition: Let N⊴GN\trianglelefteq G. The homomorphism π:G→G/N\pi:G\to G/N defined by π(g)=gN\pi(g)=gN is a natural projection/homomorphism. If H‾≤G/N\overline{H}\leq G/N, the complete preimage of H‾\overline{H} in GG is the preimage of H‾\overline{H} under the natural projection
Fact: The quotient groups of of a cyclic group are cyclic with order ∣G∣∣N∣\frac{\lvert G \rvert}{\lvert N \rvert}.

3.2 Lagrange's Theorem

Theorem 8: (Lagrange) If GG is a finite group and H≤GH\leq G, then ∣H∣∣∣G∣\lvert H \rvert \Big| \lvert G \rvert and ∣G:H∣=∣G∣∣H∣\lvert G:H \rvert=\frac{\lvert G \rvert}{\lvert H \rvert}. This also implies ∣G:H∣∣H:K∣=∣G:K∣\frac{\lvert G:H \rvert}{\lvert H:K \rvert}=\lvert G:K \rvert.
Corollary 9: If GG is a finite group and x∈Gx \in G, ∣x∣=∣⟨x⟩∣∣∣G∣\lvert x \rvert = \lvert \langle x \rangle \rvert \Big| \lvert G \rvert and x∣G∣=1x^{\lvert G \rvert} =1.
Corollary 10: If GG is a group of prime order pp, then GG is cyclic   ⟹  G≅Zp\implies G\cong Z_{p}.
Theorem 11: (Cauchy) If GG is a finite group and p∣∣G∣p \Big| \lvert G \rvert, then ∃x∈G\exists x \in G such that ∣x∣=p\lvert x \rvert=p.
Theorem 12: (Sylow) If GG is a finite group of order pαmp^{\alpha}m, where pp is a prime and p∤mp \nmid m, then ∃H≤G\exists H\leq G such that ∣H∣=pα\lvert H \rvert=p^{\alpha}.
Definition: Let H,K≤GH,K\leq G. Then HK={hk∣h∈H,k∈K}HK=\{ hk \mid h\in H, k\in K \}.
Proposition 13: If H,K≤GH,K\leq G and are finite, then ∣HK∣=∣H∣∣K∣∣H∩K∣\lvert HK \rvert=\frac{\lvert H \rvert\lvert K \rvert}{\lvert H\cap K \rvert}.
Proposition 14: If H,K≤GH,K\leq G, HK≤G  ⟺  HK=KHHK\leq G\iff HK=KH.
Corollary 15: If H,K≤GH,K\leq G and H≤NG(K)H\leq N_{G}(K), then HK≤GHK\leq G. In particular, if K⊴GK\trianglelefteq G then HK≤GHK\leq G for any H≤GH\leq G.

3.3 Isomorphism Theorems

Theorem 16: (1) If φ:G→H\varphi:G\to H is a homomorphism of groups, then ker  φ⊴G\mathrm{ker\;}\varphi \trianglelefteq G and G/ker  φ≅φ(G)G/\mathrm{ker\;}\varphi \cong \varphi(G).
Corollary 17: Let φ:G→H\varphi:G\to H be a homomorphism of groups. φ\varphi is injective   ⟺  ker  φ=1\iff \mathrm{ker\;\varphi}=1, and ∣G:ker  φ∣=∣φ(G)∣\lvert G:\mathrm{ker\;\varphi} \rvert=\lvert \varphi(G) \rvert.
Theorem 18: (2) Let GG be a group, let A,B≤GA,B\leq G and assume A≤NG(B)A\leq N_{G}(B). Then ABAB is a subgroup of GG, B⊴ABB\trianglelefteq AB, A∩B⊴AA\cap B\trianglelefteq A and AB/B≅A/A∩BAB/B \cong A/A\cap B.
Theorem 19: (3) Let GG be a group and let H,K⊴GH,K\trianglelefteq G with H≤KH\leq K. Then K/H⊴G/HK/H\trianglelefteq G/H and (G/H)/(K/H)≅G/K(G/H)/(K/H)\cong G/K.
Theorem 20: (4) Let GG be a group and let N⊴GN\trianglelefteq G. Then there is a bijection from the set of subgroups AA of GG which contain NN onto the set of subgroups A‾=A/N\overline{A}=A/N of G/NG/N. In particular, every subgroup of G‾\overline{G} is of the form A/NA/N for some subgroup AA of GG containing NN (namely, its preimage in GG under the natural projection homomorphism from GG to G/NG/N). ∀A,B≤G\forall A,B\leq G with N≤AN\leq A and N≤BN\leq B, this bijection has the following properties:

A≤B  ⟺  A‾≤B‾A≤B  ⟹  ∣B:A∣=∣B‾:A‾∣⟨A,B⟩‾=⟨A‾,B‾⟩A∩B‾=A‾∩B‾A⊴G  ⟺  A‾⊴G‾A\leq B\iff \overline{A}\leq \overline{B} \qquad A\leq B\implies \lvert B:A \rvert=\lvert \overline{B}:\overline{A} \rvert \qquad \overline{\langle A,B \rangle}=\langle \overline{A},\overline{B} \rangle \qquad \overline{A\cap B}=\overline{A}\cap \overline{B} \qquad A\trianglelefteq G\iff \overline{A}\trianglelefteq \overline{G}

3.4 Composition Series and the Hölder Program

Proposition 21: If GG is a finite abelian group and pp is a prime dividing ∣G∣\lvert G \rvert, then ∃x∈G\exists x \in G with ∣x∣=p\lvert x \rvert=p.
Definition: A (finite or infinite) group GG is simple if ∣G∣>1\lvert G \rvert > 1 and the only normal subgroups of GG are 11 and GG.
Definition: In a group GG a sequence of subgroups 1=N0≤N1≤⋯≤Nk−1≤Nk=G1=N_{0}\leq N_{1}\leq\dots\leq N_{k-1}\leq N_{k}=G is called a composition series if Ni⊴Ni+1N_{i}\trianglelefteq N_{i+1} and Ni+1/NiN_{i+1}/N_{i} is a simple group for 0≤i≤k−10\leq i\leq k-1. If the above sequence is a composition series, the quotient groups Ni+1/NiN_{i+1}/N_{i} are called composition factors of GG.
Theorem 22: (Jordan-Hölder) Let GG be a finite group with G≠1G \neq 1. Then

Theorem: There is a list consisting of 18 (infinite) families of simple groups and 26 simple groups not belonging to these families (the sporadic simple groups) such that every finite simple group is isomorphic to one of the groups in this list.
Theorem: (Feit-Thomopson) If GG is a simple group of odd order, then G≅ZpG\cong Z_{p} for some prime pp.
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 for i=0,1,…,s−1i=0,1,\dots,s-1.
Theorem: The finite group GG is solvable   ⟺  \iff for every divisor nn of ∣G∣\lvert G \rvert such that (n,∣G∣n)=1\left( n, \frac{\lvert G \rvert}{n} \right)=1, GG has a subgroup of order nn.

3.5 Transpositions and the Alternating Group

Definition: A 22-cycle is called a transposition.
Definition:

Proposition 23: The map ϵ:Sn→{±1}\epsilon:S_{n}\to \{ \pm1 \} is a homomorphism (where {±1}≅Z2\{ \pm1 \}\cong Z_{2})
Proposition 24: Transpositions are all odd permutations and ϵ\epsilon is surjective.
Definition: The alternating group of degree nn, denoted by AnA_{n}, is the kernel of the homomorphism ϵ\epsilon (i.e. the set of even permutations).
Proposition 25: The permutation σ\sigma is odd   ⟺  \iff the number of cycles of even length in its cycle decomposition is odd.