The Sylow theorems

The order of a subgroup divides the order of the group, but a divisor need not be the order of any subgroup. For which divisors is there always a subgroup, and how many such subgroups can there be?

Where you are 6 in Homomorphisms

Why this exists

Lagrange’s theorem says that the order of a subgroup divides the order of the group, and its converse fails: the rotation group of a regular tetrahedron has order 12 and no subgroup of order 6 (Lagrange's theorem, Example 6). The Sylow theorems show that the converse holds for prime powers. If p^k is the largest power of a prime p dividing |G|, then G has subgroups of orders p, p^2, \dots, p^k; those of order p^k are all conjugate; and their number obeys two divisibility rules that often force it to be 1. A subgroup that is the only one of its order is normal, so the order of a group alone can show that it is cyclic, or that it is not simple.

Definition

Let p be a prime. A p-group is a finite group whose order is a power of p, that is, p^j with j \ge 0. A p-subgroup of a group is a subgroup that is a p-group.

Let G be a finite group and write |G| = p^k m with k \ge 0 and p \nmid m. A Sylow p-subgroup of G is a subgroup of order p^k, the largest power of p that Lagrange’s theorem allows. \operatorname{Syl}_p(G) is the set of them and n_p = |\operatorname{Syl}_p(G)|. When p \nmid |G|, k = 0 and the only Sylow p-subgroup is \{e\}.

The proofs use the normalizer N_G(H) = \{g \in G : gHg^{-1} = H\} of a subgroup H, a subgroup of G (Normal subgroups, Theorem 3). It contains H, and H \trianglelefteq N_G(H), since every element of N_G(H) conjugates H onto itself.

Intuition

Every proof below rests on one count from Group actions, orbits and stabilizers (Theorem 6 there): when a p-group acts on a finite set X, the points it moves fall into orbits whose sizes are positive powers of p, so the number of fixed points is congruent to |X| mod p. Each theorem picks a set whose fixed points are what it wants: cosets, to enlarge a p-subgroup or place it inside a Sylow subgroup, and the Sylow subgroups themselves, to count them.

Results

Throughout, G is a finite group, p is a prime, and |G| = p^k m with p \nmid m.

Theorem 1 (Cauchy’s theorem). If p divides |G|, then G has an element of order p, and so a subgroup of order p. More precisely, the number of g \in G with g^p = e is a multiple of p.

Theorem 2 (first Sylow theorem). Let 0 \le i < k. Every subgroup H of G of order p^i lies in a subgroup H' of order p^{i+1} with H \trianglelefteq H'. Hence G has a subgroup of order p^i for each 0 \le i \le k; in particular \operatorname{Syl}_p(G) is not empty.

Theorem 3 (second Sylow theorem). Let P \in \operatorname{Syl}_p(G). Every conjugate gPg^{-1} is in \operatorname{Syl}_p(G), and every p-subgroup H of G lies in gPg^{-1} for some g \in G. In particular any two Sylow p-subgroups are conjugate.

Theorem 4 (third Sylow theorem). Let P \in \operatorname{Syl}_p(G). Then n_p = [G : N_G(P)], n_p divides m, and

n_p \equiv 1 \pmod{p}.

Corollary 5 (normal Sylow subgroups). For P \in \operatorname{Syl}_p(G), P \trianglelefteq G if and only if n_p = 1.

Corollary 6 (elements of order p). If k = 1, then G has exactly n_p(p - 1) elements of order p.

Why it is true

Proof of Theorem 1. Let X be the set of p-tuples (g_1, \dots, g_p) \in G^p with g_1g_2 \cdots g_p = e. The first p - 1 entries are free and then g_p = (g_1 \cdots g_{p-1})^{-1}, so |X| = |G|^{p-1}, a multiple of p. If (g_1, \dots, g_p) \in X, then g_2 \cdots g_p = g_1^{-1}, so g_2 \cdots g_pg_1 = e: moving the first entry to the end stays in X. Let [j] \in \mathbb{Z}_p act by making this move j times; this is well defined, since p moves restore the tuple, and it is an action, since [0] does nothing and [i] after [j] is [i + j]. A tuple fixed by one move has all entries equal, so the fixed set X_0 consists of the (g, \dots, g) with g^p = e. By Group actions, orbits and stabilizers, Theorem 6, |X_0| \equiv |X| \equiv 0 \pmod{p}, which is the count in the statement. Since (e, \dots, e) \in X_0, |X_0| \ge p \ge 2, so some g \ne e has g^p = e. Then \operatorname{ord}(g) divides p and is not 1 (Cyclic groups, Theorem 4), so it is p. \square

Proof of Theorem 2. Let |H| = p^i with i < k. H acts on the set G/H of left cosets by h \cdot gH = hgH (the action of Group actions, orbits and stabilizers, Exercise 15, restricted to H). A coset gH is fixed by all of H exactly when g^{-1}hg \in H for all h \in H (Cosets, Lemma 2), that is, g^{-1}Hg \subseteq H. As |g^{-1}Hg| = |H| (Normal subgroups, Theorem 1), this says g^{-1}Hg = H, or g \in N_G(H). So the fixed points are the [N_G(H) : H] left cosets of H inside N_G(H), and Theorem 6 of Group actions, orbits and stabilizers, applied to the p-group H, gives

[N_G(H) : H] \equiv [G : H] = p^{k-i}m \equiv 0 \pmod{p}.

Since H \trianglelefteq N_G(H), the quotient N_G(H)/H is a group (Quotient groups, Theorem 1) of order a multiple of p, so by Theorem 1 it has a subgroup L of order p. With \pi : N_G(H) \to N_G(H)/H the natural map (Homomorphisms and kernels, Theorem 10), H' = \pi^{-1}(L) is a subgroup containing H (Homomorphisms and kernels, Theorem 3). It is the union of the p cosets of H that make up L, so |H'| = p^{i+1}, and H \trianglelefteq H' because H' \subseteq N_G(H). Starting from \{e\} and repeating gives subgroups of orders p, p^2, \dots, p^k. \square

Proof of Theorem 3. A conjugate gPg^{-1} is a subgroup with |P| = p^k elements (Normal subgroups, Theorem 1), so it is a Sylow p-subgroup. Let H be a p-subgroup. H acts on the m left cosets of P by h \cdot gP = hgP, and by Group actions, orbits and stabilizers, Theorem 6, the number of fixed cosets is congruent to m \not\equiv 0 mod p, so some gP is fixed. Then hgP = gP, so g^{-1}hg \in P (Cosets, Lemma 2) and h \in gPg^{-1}, for every h \in H. Thus H \le gPg^{-1}, with equality when H also has p^k elements. \square

Proof of Theorem 4. G acts on \operatorname{Syl}_p(G) by g \cdot Q = gQg^{-1}: the result is in \operatorname{Syl}_p(G) by Theorem 3, eQe^{-1} = Q, and g(hQh^{-1})g^{-1} = (gh)Q(gh)^{-1}. By Theorem 3 there is one orbit, and the stabilizer of P is N_G(P), so orbit-stabilizer (Group actions, orbits and stabilizers, Theorem 4) gives n_p = [G : N_G(P)]. Since P \le N_G(P) \le G, the index multiplies (Lagrange's theorem, Theorem 4):

m = [G : P] = [G : N_G(P)]\,[N_G(P) : P],

so n_p divides m.

Now let only P act on \operatorname{Syl}_p(G) by conjugation. P is a fixed point. If Q is one, then xQx^{-1} = Q for every x \in P, so P \le N_G(Q). The order of N_G(Q) divides p^k m and is a multiple of |Q| = p^k, so P and Q are Sylow p-subgroups of N_G(Q). By Theorem 3 in the group N_G(Q), P = yQy^{-1} for some y \in N_G(Q), and yQy^{-1} = Q. So P = Q: the p-group P has exactly one fixed point, and Group actions, orbits and stabilizers, Theorem 6, gives n_p \equiv 1 \pmod{p}. \square

Proof of Corollary 5. By Theorem 4, n_p = 1 exactly when N_G(P) = G, that is, when gPg^{-1} = P for every g \in G, which is P \trianglelefteq G (Normal subgroups, Theorem 2). \square

Proof of Corollary 6. When k = 1 the Sylow p-subgroups are exactly the subgroups of order p, and the number of elements of order p is p - 1 times the number of subgroups of order p (Lagrange's theorem, Example 4). \square

Worked examples

Example 1

Sylow subgroups of S_5

Find n_5 and n_3 for S_5, check Theorem 4, and find the normalizer of a Sylow 5-subgroup.

Solution

|S_5| = 120 = 2^3 \cdot 3 \cdot 5, so Corollary 6 applies to p = 5 and p = 3. The order of a permutation is the least common multiple of its disjoint cycle lengths (Permutation groups and cycle notation, Theorem 4), and these lengths add to at most 5. So the elements of order 5 are the 4! = 24 five-cycles (write 1 first, then order the rest), and those of order 3 are the \binom{5}{3} \cdot 2 = 20 three-cycles. By Corollary 6,

n_5 = \frac{24}{4} = 6, \qquad n_3 = \frac{20}{2} = 10.

Theorem 4 checks: 6 \mid 24 and 6 \equiv 1 \pmod{5}; 10 \mid 40 and 10 \equiv 1 \pmod{3}.

Let P = \langle \gamma \rangle with \gamma = (1\ 2\ 3\ 4\ 5). By Theorem 4, |N_{S_5}(P)| = 120/6 = 20. For \sigma = (2\ 3\ 5\ 4) the cycle formula (Permutation groups and cycle notation, Exercise 14) gives

\sigma\gamma\sigma^{-1} = (1\ 3\ 5\ 2\ 4) = \gamma^2,

which generates P, so \sigma P \sigma^{-1} = P. The subgroup \langle \gamma, \sigma \rangle lies in N_{S_5}(P), and its order is a multiple of 5 and of \operatorname{ord}(\sigma) = 4, hence of 20. So N_{S_5}(P) = \langle \gamma, \sigma \rangle.

Example 2

The upper unitriangular matrices

Let p be prime, G = \operatorname{GL}_2(\mathbb{Z}_p) and E = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix}. Show that U = \{I_2 + tE : t \in \mathbb{Z}_p\} is a Sylow p-subgroup, find N_G(U) and n_p, and count the elements of order p.

Solution

|G| = (p^2 - 1)(p^2 - p) = p(p - 1)^2(p + 1) (Integers mod n, symmetries and matrices as groups, Theorem 7), and p divides neither p - 1 nor p + 1, so the Sylow p-subgroups have order p. As E^2 = 0, (I_2 + tE)(I_2 + uE) = I_2 + (t + u)E, so U is a subgroup of order p, a Sylow p-subgroup. For A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} \in G with \Delta = \det A,

AEA^{-1} = \frac{1}{\Delta}\begin{pmatrix} -ac & a^2 \\ -c^2 & ac \end{pmatrix},

and A(I_2 + tE)A^{-1} = I_2 + t\,AEA^{-1}. If c \ne 0, the lower left entry is not 0, as \mathbb{Z}_p has no zero divisors, so A(I_2 + E)A^{-1} \notin U. If c = 0, then \Delta = ad and \displaystyle AEA^{-1} = \frac{a}{d}E, so AUA^{-1} = U, as \displaystyle t\frac{a}{d} runs through \mathbb{Z}_p with t. So N_G(U) is the group B of invertible upper triangular matrices, |B| = (p - 1)^2 p, and by Theorem 4

n_p = \frac{p(p - 1)^2(p + 1)}{p(p - 1)^2} = p + 1,

which is 1 mod p and divides (p - 1)^2(p + 1). By Corollary 6 there are (p + 1)(p - 1) = p^2 - 1 elements of order p.

Each I_2 + tE with t \ne 0 sends (x, y) to (x + ty, y), so it fixes exactly the line through e_1 = (1, 0), and gUg^{-1} fixes exactly the line through ge_1. The p + 1 Sylow p-subgroups match the p + 1 lines through the origin.

(1, 0) (0, 1) (1, 1) (1, 2)
Figure 1The four lines through the origin in \mathbb{Z}_3^2, each drawn as large dots in a 3 \times 3 grid of vectors. Each is the set of vectors fixed by one of the four Sylow 3-subgroups of \operatorname{GL}_2(\mathbb{Z}_3) (Example 2).
Example 3

A group of order 35

Prove that every group of order 35 is cyclic.

Solution

Proof. By Theorem 4, n_5 divides 7 and is 1 mod 5; of 1 and 7 only 1 is, so n_5 = 1. Likewise n_7 divides 5 and is 1 mod 7, so n_7 = 1. By Corollary 6, G has 4 elements of order 5 and 6 of order 7. Every order divides 35 (Lagrange's theorem, Corollary 2), so it is 1, 5, 7 or 35, and

35 - 1 - 4 - 6 = 24

elements have order 35. Any one of them generates G. \square

Example 4

No simple group of order 80

Prove that no group of order 80 is simple.

Solution

Proof. 80 = 2^4 \cdot 5. By Theorem 4, n_5 divides 16 and is 1 mod 5, so n_5 \in \{1, 16\}. If n_5 = 1, the Sylow 5-subgroup is normal (Corollary 5), and it is neither \{e\} nor G. If n_5 = 16, Corollary 6 gives 16 \cdot 4 = 64 elements of order 5, leaving 16 elements. A Sylow 2-subgroup Q has 16 elements, whose orders divide 16, so none has order 5: Q is exactly the set of the 16 that are left. This holds for every Sylow 2-subgroup, so n_2 = 1 and Q \trianglelefteq G. Either way G is not simple. \square

Q order 5 one column per Sylow 5-subgroup
Figure 2The case n_5 = 16 of Example 4. Each column below the top row holds the four elements of order 5 in one Sylow 5-subgroup, 64 in all. The sixteen cells of the top row, the dot marking e, are all that is left, so they form the only Sylow 2-subgroup.

Both cases occur: \mathbb{Z}_{80} has n_5 = 1, and the drawn group, the maps v \mapsto \rho^j(v) + w of the even-weight vectors of \mathbb{Z}_2^5 with \rho the cyclic shift, has n_5 = 16.

Example 5

No simple group of order 36

Prove that no group of order 36 is simple.

Solution

Proof. 36 = 2^2 \cdot 3^2. By Theorem 4, n_3 divides 4 and is 1 mod 3, so n_3 \in \{1, 4\}. If n_3 = 1, the Sylow 3-subgroup, of order 9, is normal (Corollary 5). Suppose n_3 = 4. Conjugation is an action of G on the four-element set \operatorname{Syl}_3(G) (proof of Theorem 4), so it gives a homomorphism \psi : G \to \operatorname{Sym}(\operatorname{Syl}_3(G)) (Group actions, orbits and stabilizers, Lemma 1), into a group of order 4! = 24. Its kernel K is normal (Homomorphisms and kernels, Theorem 4), and 36 = |K| \cdot |\operatorname{im} \psi| (Homomorphisms and kernels, Corollary 7) with |\operatorname{im} \psi| \le 24, so K \ne \{e\}. The action has one orbit of four points (Theorem 3), so some g moves a point, \psi(g) \ne e, and K \ne G. \square

Counting elements as in Example 4 fails here: subgroups of order 9 may share more than e.

Example 6

When a Sylow subgroup is unique

Prove that n_p = 1 if and only if the elements of G whose order is a power of p form a subgroup, and use this to show that S_3 has more than one Sylow 2-subgroup.

Solution

Proof. Let S be the set of elements whose order is a power of p (including e). Every element of a Sylow p-subgroup lies in S, since its order divides p^k (Lagrange's theorem, Corollary 2).

Suppose n_p = 1, with P the Sylow p-subgroup; P \trianglelefteq G by Corollary 5. For x \in S, \langle x \rangle is a p-subgroup, so by Theorem 3, \langle x \rangle \le gPg^{-1} = P. So S = P, a subgroup.

Conversely, suppose S \le G. If a prime q \ne p divided |S|, Theorem 1 would give an element of S of order q. So |S| is a power of p dividing p^k m, hence at most p^k. Every Sylow p-subgroup lies in S and has p^k elements, so each equals S, and n_p = 1. \square

In S_3 the elements of order 1 or 2 are e and the three transpositions. Four elements cannot form a subgroup of a group of order 6, as 4 \nmid 6, so n_2 \ne 1. Since n_2 divides 3, Theorem 4 forces n_2 = 3.

Boundaries

  • Prime powers only. A divisor of |G| that is not a prime power need not be the order of a subgroup, as the tetrahedral rotation group above shows.
  • Theorem 4 narrows; it does not decide. For order 6 it allows n_2 = 1 or 3, and both occur: \mathbb{Z}_6 is abelian, so n_2 = 1, while S_3 has n_2 = 3 (Example 6).
  • Order, not structure. A Sylow 2-subgroup of S_4 is the symmetry group of a square and is not abelian (Exercise 1), while that of \mathbb{Z}_{24} is cyclic.
  • Only the largest power is conjugate. Subgroups of order p^i with i < k need not be conjugate: the three subgroups of order 2 in V_4 are not, since in an abelian group each subgroup is its own only conjugate.

Where this goes next

In a finite abelian group every Sylow subgroup is normal, and Direct products and finite abelian groups shows that the group is the direct product of them. Exercise 16 shows that every group of order pq with p \nmid q - 1 is cyclic, so isomorphic to \mathbb{Z}_{pq} (Isomorphisms). Arguments like Examples 4 and 5, which find a normal subgroup from the order alone, feed Solvable groups in Abstract Algebra II.

Exercises

Finding Sylow subgroups

  1. For p = 2 and p = 3, find n_p for S_4 and one Sylow p-subgroup, and check Theorem 4.
  2. In D_6, find n_2 and n_3, and list the Sylow subgroups.
  3. Find the Sylow 2- and 3-subgroups of \mathbb{Z}_{21}^\times (writing k for [k]).
  4. Let F be the group of maps x \mapsto ax + b of \mathbb{Z}_7, with a \in \mathbb{Z}_7^\times and b \in \mathbb{Z}_7, under composition. Find n_7, n_3 and n_2.
  5. Let B \le \operatorname{GL}_2(\mathbb{Z}_3) be the invertible upper triangular matrices. Find |B|, and n_3 and n_2 for B.

Counting with the third theorem

  1. For a group of order 105, list the values of n_3, n_5 and n_7 that Theorem 4 allows, and show that n_5 = 1 or n_7 = 1.
  2. Show that no group of order 200 is simple.
  3. (a) Prove that a group of order 12 has n_3 = 1 or n_2 = 1. (b) Which holds in A_4, and which in D_6?
  4. Prove that a group of order 30 has a normal subgroup of order 15.
  5. Amara, a toymaker, designs a twisting puzzle whose moves form a group of order 45 under “do one, then the other”. Kofi wants a single move that returns the puzzle to its start after 15 repetitions and not sooner. Prove that the group is abelian and that such a move exists.

Cauchy’s theorem

  1. Take G = S_3 and p = 3 in the proof of Theorem 1. Find |X|, |X_0| and the number of orbits of each size.
  2. A group of order 6 is not cyclic. How many elements of each order does it have?

Proofs

  1. Prove that a finite group has order a power of p if and only if every element has order a power of p.
  2. Let P \in \operatorname{Syl}_p(G). Prove that N_G(N_G(P)) = N_G(P).
  3. Let N \trianglelefteq G and P \in \operatorname{Syl}_p(G). Prove that P \cap N is a Sylow p-subgroup of N.
  4. Let p < q be primes with p \nmid q - 1. Prove that every group of order pq is cyclic.
  5. Let p and q be distinct primes. Prove that no group of order p^2q is simple.
  6. Let H \le G with p \nmid [G : H]. Prove that H contains a Sylow p-subgroup of G, and that every Sylow p-subgroup of G is conjugate to one inside H.
Answers
  1. |S_4| = 24 = 2^3 \cdot 3. The eight 3-cycles give n_3 = 8/2 = 4 (Corollary 6), for instance \langle (1\ 2\ 3) \rangle; 4 \mid 8 and 4 \equiv 1 \pmod{3}. The symmetries of a square with corners 1, 2, 3, 4 in order give a subgroup D of order 8, a Sylow 2-subgroup: e, (1\ 2\ 3\ 4), (1\ 3)(2\ 4), (1\ 4\ 3\ 2), (1\ 3), (2\ 4), (1\ 2)(3\ 4) and (1\ 4)(2\ 3). Theorem 4 allows n_2 \in \{1, 3\}, and D is not normal, as (2\ 3)(1\ 3)(2\ 3)^{-1} = (1\ 2) \notin D. So n_2 = 3 (Corollary 5).
  2. |D_6| = 12 = 2^2 \cdot 3. \operatorname{ord}(r^j) = 6/\gcd(j, 6) and reflections have order 2, so the elements of order 3 are r^2 and r^4, and n_3 = 1: \{e, r^2, r^4\}. As sr^3 = r^{-3}s = r^3s, r^3 is central, and for j = 0, 1, 2 the set \{e, r^3, r^js, r^{j+3}s\} is closed: (r^js)^2 = e, r^3 \cdot r^js = r^{j+3}s, r^js \cdot r^{j+3}s = r^{-3} = r^3. These are three subgroups of order 4, so n_2 = 3.
  3. |\mathbb{Z}_{21}^\times| = \varphi(21) = 12. The group is abelian, so n_2 = n_3 = 1, and by Example 6 each Sylow subgroup is the set of elements of p-power order. Mod 21, x^2 = 1 for x = 1, 8, 13, 20 and x^2 \in \{4, 16\} otherwise, and neither 4 nor 16 squares to 1. So the Sylow 2-subgroup is \{1, 8, 13, 20\}, and as 4^3 = 64 \equiv 1, the Sylow 3-subgroup is \{1, 4, 16\}.
  4. |F| = 42 = 2 \cdot 3 \cdot 7. For f(x) = ax + b, f^j(x) = a^jx + b(1 + a + \dots + a^{j-1}). If a \ne 1, then (a - 1)(1 + \dots + a^{j-1}) = a^j - 1, so f^j = \mathrm{id} exactly when a^j = 1: \operatorname{ord}(f) = \operatorname{ord}(a). If a = 1 and b \ne 0, \operatorname{ord}(f) = 7. So there are 6 elements of order 7, 14 of order 3 (a = 2, 4) and 7 of order 2 (a = 6), and Corollary 6 gives n_7 = 1, n_3 = 7, n_2 = 7, as Theorem 4 permits.
  5. |B| = 2^2 \cdot 3 = 12 (a, d \in \{1, 2\}, b free). By Example 2, B = N_G(U), so U \trianglelefteq B and n_3 = 1 in B. The diagonal matrices form a Sylow 2-subgroup D. With u = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}, u\begin{pmatrix} 1 & 0 \\ 0 & 2 \end{pmatrix}u^{-1} = \begin{pmatrix} 1 & 1 \\ 0 & 2 \end{pmatrix} \notin D, so D is not normal, and as n_2 divides 3, n_2 = 3.
  6. n_3 \in \{1, 7\}, n_5 \in \{1, 21\}, n_7 \in \{1, 15\}: the divisors of 35, 21, 15 that are 1 mod 3, 5, 7. If n_5 = 21 and n_7 = 15, Corollary 6 gives 21 \cdot 4 + 15 \cdot 6 = 174 elements of order 5 or 7, more than 105.
  7. 200 = 2^3 \cdot 5^2. n_5 divides 8 and is 1 mod 5; of 1, 2, 4, 8 only 1 is. So the Sylow 5-subgroup, of order 25, is normal (Corollary 5).
  8. (a) n_3 \in \{1, 4\}. If n_3 = 4, Corollary 6 gives 8 elements of order 3, leaving 4. A Sylow 2-subgroup has 4 elements, none of order 3, so it is exactly those, and n_2 = 1. (b) In A_4 the eight 3-cycles give n_3 = 4, and n_2 = 1: e and the three double transpositions. In D_6, n_3 = 1 and n_2 = 3 (Exercise 2).
  9. n_3 \in \{1, 10\} and n_5 \in \{1, 6\}. If neither were 1, Corollary 6 would give 10 \cdot 2 + 6 \cdot 4 = 44 elements, more than 30. So a Sylow 3-subgroup P_3 or 5-subgroup P_5 is normal, and P_3P_5 is a subgroup (Normal subgroups, Theorem 6) of order 15, as P_3 \cap P_5 = \{e\} (Lagrange's theorem, Exercises 11 and 15). It has index 2, so it is normal (Normal subgroups, Theorem 5).
  10. Proof. n_3 divides 5 and is 1 mod 3; n_5 divides 9 and is 1 mod 5; so both are 1, and the Sylow subgroups P_3 (order 9) and P_5 are normal and meet in \{e\} (Lagrange's theorem, Exercise 11). By Normal subgroups, Example 5, elements of P_3 commute with elements of P_5, and the 45 products xy are distinct, so they make up G. P_3 is abelian (Group actions, orbits and stabilizers, Example 5) and P_5 is cyclic, so (xy)(x'y') = (x'y')(xy): G is abelian. By Theorem 1 take x \in P_3 of order 3 and y \in P_5 of order 5. Then (xy)^n = x^ny^n = e exactly when x^n = y^{-n} \in P_3 \cap P_5 = \{e\}, that is, when 3 \mid n and 5 \mid n. So xy has order 15; it is Kofi’s move. \square
  11. |X| = 6^2 = 36. The fixed tuples are (g, g, g) with g^3 = e, for g = e, (1\ 2\ 3), (1\ 3\ 2), so |X_0| = 3: three orbits of size 1. The other 33 tuples fall into 11 orbits of size 3.
  12. n_3 divides 2 and is 1 mod 3, so n_3 = 1 and there are 2 elements of order 3 (Corollary 6). Orders divide 6 and none is 6, so the other 6 - 1 - 2 = 3 elements have order 2.
  13. Proof. If |G| = p^j, every element’s order divides p^j (Lagrange's theorem, Corollary 2), so it is a power of p. Conversely, if a prime q \ne p divided |G|, Theorem 1 would give an element of order q. So p is the only prime factor of |G| (Every number has exactly one prime factorization). \square
  14. Proof. Write N = N_G(P); always N \le N_G(N). Let g \in N_G(N). Then gPg^{-1} \le gNg^{-1} = N, and gPg^{-1} has order p^k, the largest power of p dividing |N|, so it is a Sylow p-subgroup of N. As P \trianglelefteq N, Corollary 5 in the group N makes P its only one, so gPg^{-1} = P and g \in N. \square
  15. Proof. PN \le G (Normal subgroups, Theorem 6), and |PN| = |P|\,|N|/|P \cap N| (Lagrange's theorem, Exercise 15). So |N|/|P \cap N| = [PN : P], which divides [G : P] = m (Lagrange's theorem, Theorem 4) and is prime to p. As |P \cap N| divides |P|, it is a power of p, and |N| = |P \cap N| \cdot [PN : P] shows it is the largest power of p dividing |N|. \square
  16. Proof. n_q divides p and is 1 mod q; as 1 < p < q, n_q = 1. n_p divides q and is 1 mod p, and q \not\equiv 1 \pmod{p}, so n_p = 1. By Corollary 6 there are p - 1 elements of order p and q - 1 of order q, and every order divides pq. So pq - 1 - (p - 1) - (q - 1) = (p - 1)(q - 1) > 0 elements have order pq, and G is cyclic. \square
  17. Proof. Let |G| = p^2q. If q < p, then n_p divides q and is 1 mod p, so n_p = 1. If p < q, then n_q \in \{1, p, p^2\} and p \not\equiv 1 \pmod{q}, so n_q \ne p. If n_q = p^2, Corollary 6 gives p^2(q - 1) elements of order q, leaving p^2; a Sylow p-subgroup has p^2 elements, none of order q, so it is exactly those, and n_p = 1. In every case some Sylow subgroup is normal (Corollary 5) and is neither \{e\} nor G. \square
  18. Proof. [G : H] divides p^km and is prime to p, so it divides m (Every number has exactly one prime factorization), and \displaystyle |H| = p^k \cdot \frac{m}{[G : H]} with \displaystyle p \nmid \frac{m}{[G : H]}. By Theorem 2 applied to H, H has a subgroup Q of order p^k, a Sylow p-subgroup of G. By Theorem 3 every Sylow p-subgroup of G is gQg^{-1} for some g \in G. \square
math.wiki · updated 2026-11-17 · CC-BY-SA-4.0