5.1 Group Homomorphisms
A homomorphism ϕ:G→H is a function satisfying ϕ(ab)=ϕ(a)ϕ(b) for all a,b∈G.
Proposition 5.1. If ϕ:G→H is a homomorphism, then:
- ϕ(eG)=eH.
- ϕ(a−1)=ϕ(a)−1 for all a∈G.
- ϕ(an)=ϕ(a)n for all n∈Z.
Proof. (1) ϕ(eG)=ϕ(eG⋅eG)=ϕ(eG)ϕ(eG)So by cancellation in H ϕ(eG)=eH. (2) eH=ϕ(eG)=ϕ(aa−1)=ϕ(a)ϕ(a−1)So ϕ(a−1)=ϕ(a)−1. ■
5.2 Kernel and Image
The kernel of ϕ is ker(ϕ)={g∈G:ϕ(g)=eH}.
The image of ϕ is im(ϕ)={ϕ(g):g∈G}.
Theorem 5.2. ker(ϕ)⊴G and im(ϕ)≤H.
Proof. We show ker(ϕ) is a normal subgroup.
- ϕ(e)=eHSo e∈ker(ϕ).
- If a,b∈ker(ϕ)Then ϕ(ab−1)=ϕ(a)ϕ(b)−1=eHeH=eHSo ab−1∈ker(ϕ).
- If a∈ker(ϕ) and g∈GThen ϕ(gag−1)=ϕ(g)ϕ(a)ϕ(g)−1=ϕ(g)eHϕ(g)−1=eH so gag−1∈ker(ϕ).
Thus ker(ϕ)⊴G. The …/1-number-and-algebra/3_proof-and-logic that im(ϕ)≤H is straightforward. ■
5.3 The First Isomorphism Theorem
Theorem 5.3 (First Isomorphism Theorem). If ϕ:G→H is a surjective homomorphism, then
G/ker(ϕ)≅H
More generally (even if ϕ is not surjective), G/ker(ϕ)≅im(ϕ).
Proof. Define ϕ:G/ker(ϕ)→H by ϕ(gker(ϕ))=ϕ(g). This is well-defined: if gker(ϕ)=g"ker(ϕ)Then g′−1g∈ker(ϕ) So ϕ(g′−1g)=eHGiving ϕ(g)=ϕ(g′). It is a homomorphism: ϕ((aker(ϕ))(bker(ϕ)))=ϕ(abker(ϕ))=ϕ(ab)=ϕ(a)ϕ(b)=ϕ(aker(ϕ))ϕ(bker(ϕ)). It is injective: ϕ(gker(ϕ))=eH⇒ϕ(g)=eH⇒g∈ker(ϕ)⇒gker(ϕ)=ker(ϕ). By construction, im(ϕ)=im(ϕ). ■
5.4 Second and Third Isomorphism Theorems
Theorem 5.4 (Second Isomorphism Theorem). If N⊴G and H≤GThen HN≤G N⊴HN, H∩N⊴HAnd
H/(H∩N)≅HN/N
Proof. Define ϕ:H→HN/N by ϕ(h)=hN. This is a homomorphism (since N is normal). It is surjective: any element of HN/N has the form hnN=hN=ϕ(h). Its kernel is {h∈H:hN=N}={h∈H:h∈N}=H∩N. By the first isomorphism theorem, H/(H∩N)≅HN/N. ■
Theorem 5.5 (Third Isomorphism Theorem). If K⊴N⊴G with K⊴GThen
(G/K)/(N/K)≅G/N
Proof. Define ϕ:G/K→G/N by ϕ(gK)=gN. Well-defined: gK=g′K implies g−1g′∈K⊆NSo gN=g′N. Surjective and ker(ϕ)=N/K. Apply the first Isomorphism theorem. ■
5.5 Worked Example
Problem. Show that R∗/R+≅Z/2Z.
Solution. Define ϕ:R∗→{1,−1}≅Z/2Z by ϕ(x)=sgn(x). This is a homomorphism since sgn(xy)=sgn(x)sgn(y). It is surjective. Its kernel is {x∈R∗:sgn(x)=1}=R+. By the first isomorphism theorem, R∗/R+≅Z/2Z. ■
5.6 Further Worked Examples
Example 5.6 (Trivial Homomorphism). For any groups G,HThe map ϕ:G→H defined by ϕ(g)=eH for all g∈G is a homomorphism (the trivial homomorphism). Its kernel is G And its image is {eH}.
Example 5.7 (Sign Homomorphism). The sign map sgn:Sn→{1,−1} is a surjective Homomorphism with kernel An. By the first isomorphism theorem, Sn/An≅Z/2Z.
Example 5.8 (Determinant Homomorphism). The determinant det:GLn(R)→R∗ Is a surjective group homomorphism with kernel SLn(R). By the first isomorphism theorem, GLn(R)/SLn(R)≅R∗.
Example 5.9 (Conjugation Homomorphism). For a fixed g∈GThe map cg:G→G defined by cg(x)=gxg−1 is an automorphism of G (an inner automorphism). It is a homomorphism since cg(xy)=gxyg−1=(gxg−1)(gyg−1)=cg(x)cg(y). It is bijective with inverse cg−1.
Problem. Define ϕ:Z→Z/nZ by ϕ(k)=k+nZ. Verify that ϕ is a surjective homomorphism and identify the quotient.
Solution
Solution. ϕ(k+m)=(k+m)+nZ=(k+nZ)+(m+nZ)=ϕ(k)+ϕ(m) So ϕ is a homomorphism. It is surjective since every coset k+nZ equals ϕ(k). The kernel is ker(ϕ)={k∈Z:k∈nZ}=nZ. By the first isomorphism theorem, Z/nZ≅Z/nZ (the canonical projection). ■
5.7 The Correspondence Theorem
Theorem 5.6 (Correspondence Theorem / Fourth Isomorphism Theorem). Let ϕ:G→H be a Surjective homomorphism with K=ker(ϕ). Then there is an inclusion-preserving bijection
{subgroups of G containing K}⟷{subgroups of H}
Given by U↦ϕ(U) with inverse V↦ϕ−1(V). This bijection satisfies:
- U⊴G if and only if ϕ(U)⊴H.
- [G:U]=[H:ϕ(U)] for all U⊇K.
- G/U≅H/ϕ(U) when U⊴G.
Proof. Define Φ(U)=ϕ(U) and Ψ(V)=ϕ−1(V)={g∈G:ϕ(g)∈V}.
- Φ∘Ψ=id: Φ(Ψ(V))=ϕ(ϕ−1(V))=V (since ϕ is surjective).
- Ψ∘Φ=id on subgroups containing K: if U⊇KThen Ψ(Φ(U))=ϕ−1(ϕ(U))=U (since ker(ϕ)=K⊆U).
For normality: if U⊴GThen for any h∈H and u∈U Write h=ϕ(g). Then hϕ(u)h−1=ϕ(g)ϕ(u)ϕ(g)−1=ϕ(gug−1)∈ϕ(U) Since gug−1∈U. Conversely, if ϕ(U)⊴HThen for any g∈G and u∈U ϕ(gug−1)=ϕ(g)ϕ(u)ϕ(g)−1∈ϕ(U)So gug−1∈ϕ−1(ϕ(U))=U.
For the index: ϕ restricts to a surjection U→ϕ(U) with kernel K So ∣U/K∣=∣ϕ(U)∣Giving ∣G∣/∣U∣=∣H∣/∣ϕ(U)∣. ■
5.8 Automorphism Groups
An automorphism of G is an isomorphism ϕ:G→G. The set of all automorphisms of G Forms a group under composition, denoted Aut(G).
For each g∈GThe inner automorphism cg:G→G is defined by cg(x)=gxg−1. The set of inner automorphisms Inn(G)={cg:g∈G} is a normal subgroup of Aut(G).
Proposition 5.7. Inn(G)≅G/Z(G).
Proof. Define ψ:G→Aut(G) by ψ(g)=cg. This is a homomorphism: ψ(gh)=cghAnd cgh(x)=ghx(gh)−1=g(hxh−1)g−1=cg(ch(x))=(cg∘ch)(x). The image is Inn(G). The kernel is {g∈G:cg=id}={g∈G:gxg−1=x for all x∈G}=Z(G). By the first isomorphism theorem, Inn(G)≅G/Z(G). ■
Example. Aut(S3)≅S3. Since Z(S3)={e}We have Inn(S3)≅S3. Since ∣Aut(S3)∣≤∣S3∣!=6 (automorphisms permute the three elements of order 2), And Inn(S3) already has 6 elements, we get Aut(S3)=Inn(S3)≅S3.
Example. Aut(Z/nZ)≅(Z/nZ)∗The group of units Modulo n. An automorphism of Z/nZ is determined by where it sends 1And 1 can map to any generator, i.e., any [k] with gcd(k,n)=1.
Example. Aut(Z/8Z)≅(Z/8Z)∗={1,3,5,7}≅V4. The four automorphisms are x↦x, x↦3x, x↦5x, x↦7x. Note that 32=9≡1(mod8)So every non-identity automorphism has order 2.
5.9 Semidirect Products
Definition. Let H and K be groups and let ϕ:K→Aut(H) be a homomorphism. The semidirect product H⋊ϕK is the set H×K with the group operation
(h1,k1)(h2,k2)=(h1⋅ϕ(k1)(h2),k1k2)
When ϕ is the trivial homomorphism, this reduces to the direct product H×K.
Proposition 5.8. In G=H⋊ϕKThe subgroup H′={(h,eK)} is normal in G And K′={(eH,k)} is a subgroup with H′∩K′={(eH,eK)} and H′K′=G.
Proof. Conjugation: (eH,k)(h,eK)(eH,k)−1=(eH⋅ϕ(k)(h),k)(eH,k−1)=(ϕ(k)(h),eK)∈H′. So H′⊴G. The remaining claims are immediate. ■
Example. Dn=Z/nZ⋊Z/2Z where the action of Z/2Z on Z/nZ sends k↦−k (inversion). Explicitly: (a,0)(b,0)=(a+b,0), (a,0)(b,1)=(a+b,1) (a,1)(b,0)=(a−b,1), (a,1)(b,1)=(a−b,0).
Problem. Show that there are exactly two groups of order 6: Z/6Z and S3.
Solution
Solution. ∣G∣=6=2⋅3. By Sylow’s third theorem: n3≡1(mod3) and n3 Divides 2So n3=1. The Sylow 3-subgroup H=⟨a⟩≅Z/3Z is normal.
Let b be an element of order 2 (exists by Cauchy). Since H⊴G bab−1∈H. The action of ⟨b⟩ on H by conjugation is a homomorphism Z/2Z→Aut(Z/3Z)≅Z/2Z.
There are two such homomorphisms:
- Trivial: bab−1=a. Then G≅Z/3Z×Z/2Z≅Z/6Z.
- Inversion: bab−1=a−1. Then G≅Z/3Z⋊Z/2Z=S3.
These are the only two possibilities, up to isomorphism. ■
Problem. Classify all groups of order 21=3⋅7.
Solution
Solution. n7≡1(mod7) and n7 divides 3So n7=1. The Sylow 7-subgroup H=⟨a⟩≅Z/7Z is normal.
n3≡1(mod3) and n3 divides 7So n3=1 or 7.
The action of a Sylow 3-subgroup K=⟨b⟩≅Z/3Z on H by conjugation Is a homomorphism Z/3Z→Aut(Z/7Z)≅Z/6Z.
Aut(Z/7Z) has exactly one subgroup of order 3 (generated by x↦2x Since 23=8≡1(mod7)).
Case 1: Trivial action (n3=1): G≅Z/7Z×Z/3Z≅Z/21Z.
Case 2: Non-trivial action (n3=7): bab−1=a2 (or equivalently a4). This gives the non-abelian semidirect product Z/7Z⋊Z/3Z.
There are exactly two groups of order 21. ■