Worked Examples

Problem. Show that $S_4$ has no normal subgroup of order 8.

Solution. Suppose $N \trianglelefteq S_4$ with $|N| = 8$. By Lagrange, $[S_4 : N] = 24/8 = 3$. The action of $S_4$ on the cosets of $N$ gives a homomorphism $\phi : S_4 \to S_3$. Since $N$ is normal, $\ker(\phi) \subseteq N$ So $|\ker(\phi)|$ divides $8$. Since $\mathrm{im}(\phi) \subseteq S_3$ has order dividing $6$, $|\ker(\phi)|$ divides $24/6 = 4$. But $|\ker(\phi)|$ divides $8$ So $|\ker(\phi)|$ divides $\gcd(8, 4) = 4$. Since $\ker(\phi) \subseteq N$ and $|N| = 8$ And $|\ker(\phi)|$ divides $4$ This is possible. However, we need $\ker(\phi) = N$ (since $N$ is the kernel of the action on cosets). Then $|\ker(\phi)| = 8$ Contradicting $|\ker(\phi)| \leq 4$. So no such $N$ exists. $\blacksquare$

Problem. Show that $\mathbb{Z}[\sqrt{2}]$ is a Euclidean domain.

Solution. Define $\delta(a + b\sqrt{2}) = |a^2 - 2b^2|$. For $\alpha, \beta \neq 0$ in $\mathbb{Z}[\sqrt{2}]$ Compute $\alpha/\beta \in \mathbb{Q}(\sqrt{2})$. Choose $q \in \mathbb{Z}[\sqrt{2}]$ With $|\alpha/\beta - q| \lt 1$ in both coordinates (round to nearest integers). Then $\alpha = q\beta + r$ where $r = \alpha - q\beta$. We have $\delta(r) = |N(r)| = |N(\alpha - q\beta)| = |N(\beta)| \cdot |N(\alpha/\beta - q)|$. Since $|N(\alpha/\beta - q)| = |a^2 - 2b^2| \lt 1$ For the coordinate differences $a, b$ (each less than $1$ in absolute value), we get $\delta(r) \lt \delta(\beta)$. $\blacksquare$

Problem. Determine the Galois group of $x^4 - 5$ over $\mathbb{Q}$.

Solution. The roots are $\pm\sqrt[4]{5}$ and $\pm i\sqrt[4]{5}$. The splitting field is $E = \mathbb{Q}(\sqrt[4]{5}, i)$. We have $[\mathbb{Q}(\sqrt[4]{5}) : \mathbb{Q}] = 4$ (since $x^4 - 5$ is irreducible by Eisenstein with $p = 5$), and $[E : \mathbb{Q}(\sqrt[4]{5})] = 2$ (since $i \notin \mathbb{Q}(\sqrt[4]{5}) \subset \mathbb{R}$). Thus $[E : \mathbb{Q}] = 8$.

The Galois group is generated by:

• $\sigma : \sqrt[4]{5} \mapsto i\sqrt[4]{5},\ i \mapsto i$ (order 4)
• $\tau : \sqrt[4]{5} \mapsto \sqrt[4]{5},\ i \mapsto -i$ (order 2)

With $\tau\sigma\tau^{-1} = \sigma^{-1}$ We get $\mathrm{Gal}(E/\mathbb{Q}) \cong D_8$ (the dihedral Group of order 8). $\blacksquare$

Worked examples are where abstract theory meets concrete calculation. Showing that S4 has no normal subgroup of order 8 requires understanding how group actions on cosets create homomorphisms and why counting constraints make certain structures impossible. Determining whether a ring is a Euclidean domain tests whether division with remainder is possible. Computing Galois groups reveals the hidden symmetry of polynomial roots, connecting the algebraic structure of a field extension to the geometric arrangement of roots. These examples demonstrate that algebra is not about memorising definitions but about building intuition for how structures fit together.

Mistake 1: Assuming every normal subgroup is unique for a given order A group can have multiple normal subgroups of the same order, or none at all. Lagrange’s theorem only constrains the possible orders of subgroups, not their existence or uniqueness. Always verify normality directly rather than assuming it from the order alone.

Mistake 2: Confusing the Galois group of a polynomial with the Galois group of its splitting field The Galois group acts on the roots of the polynomial, but it is defined as the automorphism group of the splitting field. For reducible polynomials, the Galois group may be a proper subgroup of the permutation group on roots. Always identify the splitting field first before computing its automorphisms.

Mistake 3: Assuming irreducibility over Q implies irreducibility over Z A polynomial with rational coefficients that is irreducible over Q may still factor over Z after clearing denominators. Gauss’s lemma guarantees that if a polynomial factors over Q, it factors over Z with the same degree factors, but the converse requires checking primitivity of the coefficients.

Problem. Let $G$ be a finite group and $H \trianglelefteq G$ with $\gcd(|H|, [G:H]) = 1$. Show that $H$ has a complement in $G$: there exists $K \leq G$ with $HK = G$ and $H \cap K = \{e\}$.

Problem. Show that if $G$ is a group of order $pqr$ where $p \lt q \lt r$ are primes, then $G$ is not simple.

Problem. Prove that there are exactly two groups of order $10$ up to isomorphism.

• Group Actions — The orbit-stabilizer theorem and Burnside’s lemma used in the worked examples are developed in this chapter.
• The Sylow Theorems — Sylow theory is the primary tool for the group classification arguments in several worked examples.
• Polynomial Rings — The ring-theoretic examples rely on irreducibility criteria and Euclidean division developed in this chapter.
• Euclidean Domains, PIDs, and UFDs — The chain of implications between ring types underpins the factorisation arguments in the worked examples.

• Additional Results
• Classification of Groups of Small Order
• Common Pitfalls
• Euclidean Domains, PIDs, and UFDs