Exercises Sylow theorem
Prove that if a group G has a unique Sylow p-subgroup, then is normal H ⊲̲ G.
Prove that the alternating group A4 does not possess subgroups of order 6.
Prove that if p is a prime number and m is not divisible by p, then
is not divisible by p.
Prove that a finite group G is a p-group iff every element of G has order a power of p.
Prove that a non-abelian group of order p3 has a center with order p.
Calculate all Sylow 2-subgroups and 3-subgroups of S3 and S4.
Prove that a group of order 65 has a non-trivial normal subgroup.
Let G a group with pq elements, with p and q primes such that p < q. Prove that G has one and only one subgroup of order q. Prove in addition that if p does not divide q − 1, then G is cyclic.
Let G a group with order 2m, with odd m and greater than 1. Prove that G possesses a non-trivial normal subroup and hence G is not simple.
Find all groups with order 33.
Solutions
gHg−1 is still a Sylow p-subgroup as the cardinality of H is the same as gHg−1 and gHg−1 is a subgroup. Since is unique it must be gHg−1 = H, that is gHg−1 ⊲̲ H. ■
Suppose the contrary and let N be such subgroup of order 6. By Lagranges's theorem the index |A4|/|N| = 2 = [A4: N]. If N is a subgroup of index 2, then N is normal (see Proposition 7.11.12). Let k be the number of Sylow 3-subgroups of N. Then by Sylow's theorems k | 6 and k ≡ 1 modulo 3: thus k = 1. Let S be such Sylow 3-subgroup of N. S is a Sylow 3-subgroup also of A4 (12 = 22 ⋅ 3). Let T a Sylow 3-subgroup of A4. Then S and T are conjugates, that is T = σSσ−1 for some A4 and then
T = σSσ−1 ⊆ σNσ−1 = N
T is a Sylow 3-subgroup of N and thus must be equal to S. S is thus the unique Sylow 3-subgroup of A4. But then it must contain all elements of A4 with order 3 (if not these elements would generate other Sylow 3-subgroup. See Proposition 7.2.5. Such elements are 8, which is absurd because S has 3 elements. Thus A4 canonot contain a subgroup with order 6. ■
First Proof.
We want to show that the binomial coefficient and p are relatevely prime. Consider the factors (pam − k)/k. There are two cases:
(p, k) = 1. Then p does not divide pa m − k.
(p, k) > 1, say k = pβs where 1 ≤ β < α and (p, s) = 1. Then,
and p does not divide m pa−β − s. Hence, after cancellation, k is a rational fraction with no factor of p in the numerator. Thus, p cannot divide the binomial coefficient. ■
Proof 2. Consider the polynomial (1 + x)p; The binomial coefficient theorem (1 + x)n is the sum from k = 0 to k = n of (n k) xk applied this case says
except for the first and the last term, all other terms of this expansion have a coefficient that is divisible by p. Hence
Let G be a p-group. Let |G| = pt. Since it's a double implication we must prove:
"a finite group G is a p-group ⇒ every element of G has order a power of p."
"a finite group G is a p-group ⇐ every element of G has order a power of p."
(a). If H is a subgroup of G, By Lagrange's theorem we know that |H| | |G|. If h is an element of G, h generates a subgroup H = ⟨h⟩. Since |G| is a power of p so must be |H|, so the order of h is pr with r ≤ t.
(b) Conversely, let every element of G have order a power of p. Let the order of G be not a power of p. Then there exist a prime q ≠ p such that q | |G|. By Cauchy therem G contains at least an element of period q. Hence we get a contradiction and consequently, G is a p-group. ■
We know that Z(G) ≠ {e} because the center of a p-group is non-trivial, and Z ≠ G since G is not abelian. In the case of |Z| = p2, by Lagrange's theorem |G|/|Z(G)| = |G/Z(G)| = p and thus G/Z and by Corollary 7.9.3 it would be cyclic. But then G would be abelian (see Theorem 7.2.16). Thus Z has order p. ■
As |S3| = 3! = 3 ⋅ 2, the Sylow 2-subgroup of S3 have order 2. Therefore n2 = 3 and the Sylow 2-subgroups of S3 are
{1, (12)}, {1, (13)}, {1, (23)}
while n3 =1 since n3 ≡ 1 mod 3; This Sylow 3-subgroup is
{1, (123), (132)}
Since |S4| = 4! = 23 ⋅ 3, we observe that the order of a Sylow 2-subgroup is 8 while that of a Sylow 3-subgroup is 3. The Sylow 3-subgroup of S4 are n3 = 4 since by Third SYlow theorem n3 = 1 mod 3 and n3| 24, that is by the 3-cycle of S4. Each 3-Sylow having order 3 means it must be of the for <(a, b, c)> since a single 3-cycle is the only type of element of order 3 in S4 (also in S5, but not in S6), this is because any group H, of prime order p must be cyclic which means H = ⟨h⟩ for some h in H, so h itself has order p. The Sylow 3-subgroups of S4 which are all conjugated among themselves are
⟨(1,2,3)⟩ = {1, (1,2,3), (1,3,2)}, ⟨(1,2,4)⟩ = {1, (1,2,4), (1,4,2)}, ⟨(1,3,4)⟩ = {1, (1,3,4), (1,4,3)}, ⟨(2,3,4)⟩ = {1, (2,3,4), (2,4,3)}
For a subgroup of order 8, we might recall that the dihedral group D4 (symmetries of the square) has order 8. The group D4 generated by σ and τ is a Sylow 2-subgroup of S4. Here's the group
1, σ = (1,2,3,4), σ2 = (1,3)(2,4), σ3 = (4,3,2,1)
τ = (2,4) στ (1,2)(3,4) σ2τ (1,3) σ3τ = (2,3)(1,4)To find the others, we just have to conjugate it. Conjugating the permutations above by (1,2) we get the conjugate group (1,2)D4(1,2)
1, (1,3,4,2), (1,4)(2,3), (2,4,3,1)
(1,4) (1,2)(3,4) (2,3) (1,3)(2,4)We need to find one more Sylow 2-subgroup. When we conjugate (1,2,3,4) by (1,2,3) we get (1,2,3)(1,2,3,4)(3,2,1) = (1,4,2,3), which is in neither of the preeceding Sylow 2-subgroup. Thus, we can be sure that the conjugate group (1,2,3)D4(3,2,1) is the Sylow 2-subgroup we are looking for. Here it is
1, (1,4,2,3), (1,2)(3,4), (3,2,4,1)
(3,4) (1,4)(3,4) (2,3) (1,3)(2,4)65 = 13 ⋅ 5, the number of Sylow 5-subgroup must be a divisor of 13, that is either 13 or 1. Since it must also be conguent to 1 modulo 5, we conclude there is only a Sylow 5-subgroup which by Exercise 1 is unique. The same is true for the Sylow 13-subgorup which is also unique and normal. ■
Since nq must divide p, nq = 1 or p; By Sylow counting theorem nq ≡ 1 mod q. Since p < q, we conclude that nq = 1; np can be either equal to q or 1, by the same argument. np being q means q ≡ 1 (mod p), that is p| (q − 1). In the hypothesis that p does not divide (q − 1) then np = 1, hence both Sylow p-subgroup and q-subgroup are normal. For the sake of simplicity let H be the Sylow p-subgroup and K the Sylow q-subgroup. By Lagrange's theorem the order of H ∩ K must divide both p and q, so is necessarily 1. Thus,
H ∩ K = {e}.
Now as p is prime, H must be cyclic, H ≃ Zp, and the same for K ≃ Zq. By Theorem 7.17.4
G ≃ H x K ≃ Zp x Zq ■
Let g ∈ G have order 2. Such an element exists necessarily by Cauchy's theorem. Let G act on itself by right multiplication and note that since g ≠ 1, the element g has no fixed points in this action: g * h = h ⇒ gg * h = gh ⇒ h = gh which cannot be since g is not e. Since g2 = 1, the cycle structure of the permutation induced by g consists of only 2-cycles and 1-cycles, but since there are no fixed points, we have only 2-cycyles: if the group elements are e, x1, x2, ..., xn and g is one of those, then the action of g on the group gives you a permutation sending e to ge, x1 to gx1, etc., which is equal to the permutation (e ge) (x1 gx1) (x2 gx2) (xn gxn); because there are no fixed points it can't be (e ge) (x1 gx1) (x2 gx2) (xn) which would imply gxn xn. It follows that this permutation is a product of m disjoint transpositions and hence is odd.
Considering the regular representation of φ: G ⟶ Sn, since G contains an odd permutation, by 7.16.15 Lemma, it has a normal subgroup of index 2. ■
Let G be a group of order 33 = 11 ⋅ 3. Let H, the Sylow 11-subgroup of G, the number of 11-subgroups could be either 1 or 3. We have n
11 = 1 hence normal (since 3 is not equal to 1 modulo 11) by 7.17.10 Third Sylow Theorem, similarly letting K the Sylow 3-subgroup we have it is also unique (since 11 is not equal to 1 modulo 3) and hence normal. By Lagrange's theorem the order of H ∩ K must divide both p and q, so is necessarily 1. Thus, H ∩ K = {e}.
Now as 11 is prime, H must be cyclic, H ≃ Z11, and the same for K ≃ Z3. By Theorem 7.17.4
G ≃ H x K ≃ Z11 x Z3 ■
(1 + x)pn ≡ 1 + xpn mod p
Applying this fact a second time, we see that (1 + x)p2 ≡ (1 + xp)p ≡ (1 + xp)p2 mod p, and thus by induction on a this gives
(1 + x)pa ≡ 1 + xpa mod p
Raising both sides of this equation to the mth power we get:
(1 + x)pam ≡ (1 + xpa)m = 1 + mxpa + binom (m 2) x2pa + ...
Since these polynomials are congruent, the coefficients of corresponding term are congruent modulo p, and the result follow by considering the coefficient of xpa on each side.
The coefficient on the right of xpa is m. To calculate the coefficient on the left note that (1 + x)pam is the sum from k = 0 to k = pam of binom(pam k) xk, since we want the the coefficient of xpa, we have to consider the term with k = pa that is, the one whose coefficient is binom(pam pa). So binom(pam pa) ≡ m mod p. ■