Problem. Show that S4 has no normal subgroup of order 8.
Solution. Suppose N⊴S4 with ∣N∣=8. By Lagrange, [S4:N]=24/8=3. The action of S4 on the cosets of N gives a homomorphism ϕ:S4→S3. Since N is normal, ker(ϕ)⊆NSo ∣ker(ϕ)∣ divides 8. Since im(ϕ)⊆S3 has order dividing 6, ∣ker(ϕ)∣ divides 24/6=4. But ∣ker(ϕ)∣ divides 8So ∣ker(ϕ)∣ divides gcd(8,4)=4. Since ker(ϕ)⊆N and ∣N∣=8And ∣ker(ϕ)∣ divides 4This is possible. However, we need ker(ϕ)=N (since N is the kernel of the action on cosets). Then ∣ker(ϕ)∣=8Contradicting ∣ker(ϕ)∣≤4. So no such N exists. ■
15.2 Ring Theory Example
Problem. Show that Z[2] is a Euclidean domain.
Solution. Define δ(a+b2)=∣a2−2b2∣. For α,β=0 in Z[2]Compute α/β∈Q(2). Choose q∈Z[2] With ∣α/β−q∣<1 in both coordinates (round to nearest integers). Then α=qβ+r where r=α−qβ. We have δ(r)=∣N(r)∣=∣N(α−qβ)∣=∣N(β)∣⋅∣N(α/β−q)∣. Since ∣N(α/β−q)∣=∣a2−2b2∣<1 For the coordinate differences a,b (each less than 1 in absolute value), we get δ(r)<δ(β). ■
15.3 Galois Theory Example
Problem. Determine the Galois group of x4−5 over Q.
Solution. The roots are ±45 and ±i45. The splitting field is E=Q(45,i). We have [Q(45):Q]=4 (since x4−5 is irreducible by Eisenstein with p=5), and [E:Q(45)]=2 (since i∈/Q(45)⊂R). Thus [E:Q]=8.
The Galois group is generated by:
σ:45↦i45,i↦i (order 4)
τ:45↦45,i↦−i (order 2)
With τστ−1=σ−1We get Gal(E/Q)≅D8 (the dihedral Group of order 8). ■
15.4 Additional Worked Examples
Problem. Let G be a finite group and H⊴G with gcd(∣H∣,[G:H])=1. Show that H has a complement in G: there exists K≤G with HK=G and H∩K={e}.
Solution
Solution. This result is known as the Schur-Zassenhaus theorem. We prove a special case When H is abelian. Let ∣H∣=m and [G:H]=n with gcd(m,n)=1.
Consider the action of G on H by conjugation. Since H is abelian and normal, G acts by Automorphisms on H. The group of automorphisms of H, Aut(H)Has order dividing ∣H∣!But we need a more refined argument.
Here is a cleaner approach for the case when one factor is cyclic. Let G/H=⟨gH⟩ be cyclic (which always holds when [G:H] is the smallest prime dividing ∣G∣). Pick a representative g with gn∈H. We need to find k∈G with kn=e and kH=gH.
Since gcd(m,n)=1There exist a,b∈Z with am+bn=1. Let x=gn∈H. Then xa=x1−bn=x⋅(xn)−b=x⋅x−bn… Actually, the general …/1-number-and-algebra/3_proof-and-logic requires Cohomology and is beyond our current scope. The key takeaway: when gcd(∣H∣,[G:H])=1 A complement exists (Schur-Zassenhaus theorem). ■
Problem. Show that if G is a group of order pqr where p<q<r are primes, then G is not simple.
Solution
Solution. Consider the Sylow r-subgroups. nr≡1(modr) and nr divides pq. Since r>q>pWe have r>pq is possible but nr=pq+1,2pq+1,… would need To divide pq. The only divisors of pq are 1,p,q,pq. If nr=1We are done (Sylow r-subgroup is normal).
If nr=1Then nr≥r+1>q+1>p+1. Since nr divides pq We must have nr=pq. This means there are pq(r−1) non-identity elements in Sylow r-subgroups.
Similarly, nq≡1(modq) and nq divides pr. If nq=prThere are pr(q−1) Non-identity elements in Sylow q-subgroups.
If both nr=pq and nq=prThe total number of non-identity elements is at least pq(r−1)+pr(q−1)=pqr−pq+pqr−pr=2pqr−p(q+r)Which exceeds pqr−1 for most values. So at least one of nr=1 or nq=1 must hold, giving a normal Sylow subgroup. ■
Problem. Prove that there are exactly two groups of order 10 up to isomorphism.
Solution
Solution.∣G∣=10=2⋅5. By Sylow”s third theorem: n5≡1(mod5) and n5 Divides 2So n5=1. The Sylow 5-subgroup P=⟨a⟩≅Z/5Z is normal.
n2≡1(mod2) and n2 divides 5So n2=1 or 5.
Let b be an element of order 2 (exists by Cauchy’s theorem). Since P⊴Gbab−1∈P. So bab−1=ak for some k∈{0,1,2,3,4}. Applying conjugation twice: b2ab−2=ak2I.e., a=ak2So k2≡1(mod5) Giving k≡1 or k≡4(mod5).
Case k=1:bab−1=aSo a and b commute. G≅Z/5Z×Z/2Z≅Z/10Z.
Case k=4:bab−1=a4=a−1So ba=a−1b. This gives the dihedral group D5.
These are the only two possibilities, so there are exactly two groups of order 10. ■