Mathematics · Glossary

What is normal subgroup?

Definition 1.1 University Mathematics — Year 3 · Chapter 1 — Group Theory

A subgroup NN of GG is normal (written NGN \trianglelefteq G) when gNg1=NgNg^{-1} = N for every gGg \in G — equivalently, when left and right cosets coincide: gN=NggN = Ng for all gg.

Examples

Example 1.9

Five actions run all of finite group theory:

  1. GG on itself by left translation gx=gxg \cdot x = gx: free and transitive.
  2. GG on itself by conjugation gx=gxg1g \cdot x = gxg^{-1}: orbits are the conjugacy classes, stabilizers the centralizers ZG(x)={g:gx=xg}Z_G(x) = \{g : gx = xg\}, fixed points the center Z(G)Z(G).
  3. GG on the coset space G/HG/H by gxH=gxHg \cdot xH = gxH: transitive, with stabilizer of the coset HH equal to HH. Every transitive action is of this form (Exercise 1.8).
  4. GG on its set of subgroups by conjugation: the stabilizer of HH is the normalizer NG(H)={g:gHg1=H}N_G(H) = \{g : gHg^{-1} = H\}, the largest subgroup of GG in which HH is normal.
  5. SnS_n on [ ⁣[1,n] ⁣]\intint{1}{n}: the mother of all examples.

Example 1.22

Let G=pq\abs G = pq with p<qp < q primes and pq1p \nmid q - 1. Then nqpn_q \mid p and nq1modqn_q \equiv 1 \bmod q force nq=1n_q = 1 (as p<qp < q); npqn_p \mid q and np1modpn_p \equiv 1 \bmod p force np=1n_p = 1 (as q≢1modpq \not\equiv 1 \bmod p). Let P,QP, Q be the two normal Sylows: PQ={e}P \cap Q = \{e\} (coprime orders), so PQ=pq\abs{PQ} = pq (Exercise 1.4) and GP×QZ/pZ×Z/qZZ/pqZG \cong P \times Q \cong \Z/p\Z \times \Z/q\Z \cong \Z/pq\Z by Proposition 1.24 below. Every group of order 1515, 3333, 3535, … is cyclic. The excluded case pq1p \mid q - 1 produces exactly one more group, nonabelian — see the weekend problem (Problem 1.1).

Example 1.23 (A complete Sylow census: S4S_4)

Let us run the method on G=S4G = S_4, G=24=233\abs G = 24 = 2^3\cdot3. Sylow 33: n38n_3 \mid 8, n31mod3n_3 \equiv 1 \bmod 3, so n3{1,4}n_3 \in \{1, 4\}; since (123)\langle(123)\rangle and (124)\langle(124)\rangle are distinct, n3=4n_3 = 4 — the four subgroups (abc)\langle(abc)\rangle, one for each 33-element subset {a,b,c}\{a, b, c\}, accounting for the 88 three-cycles. By Sylow II they are conjugate, and the conjugation morphism S4SSyl3S4S_4 \to S_{\mathrm{Syl}_3} \cong S_4 is an isomorphism here (its kernel is contained in N=NG((123))N = N_G(\langle(123)\rangle) of order 24/4=624/4 = 6, and a normal subgroup of S4S_4 inside S3S_3-like NN must be trivial: it would consist of even permutations fixing the four Sylows, and only ee does). Sylow 22: n23n_2 \mid 3, n21mod2n_2 \equiv 1 \bmod 2: n2{1,3}n_2 \in \{1, 3\}. The subgroup D=(1234),(13)D = \langle(1234), (13)\rangle has order 88 (a dihedral D4D_4: the symmetries of the square with vertices 1,2,3,41, 2, 3, 4), is not normal ((12)(1234)(12)=(2134)(12)(1234)(12) = (2134) generates a different 44-cycle subgroup), so n2=3n_2 = 3: the three copies of D4D_4 correspond to the three ways of pairing 44 points into a “square”. Note the moral of the census: S4=24\abs{S_4} = 24 leaves room for either Sylow to fail normality, and both do — compare order 1212, where the count forces one of them normal (Part IV of Problem 1.1).

Read in context →