MTH3003 Weekly Problems 10

Original Documents: mth3003 weekly problem sheet 10.pdf / mth3003 weekly problem sheet 10 handwritten solutions.pdf

Vibes: Final problem sheet, all on Sylow’s theorems. Mix of “find a subgroup of order ” (apply Sylow’s First), counting Sylow subgroups (apply Sylow’s Third), and structural deductions (uniqueness normality direct product). The last problem nudges into the classification of small-order groups.

Used Techniques:

  • Sylow’s First Theorem: prime Sylow -subgroup of order exists.
  • Sylow’s Third Theorem: AND .
  • Uniqueness normality: unique Sylow -subgroup is normal in .
  • Internal direct product: two normal subgroups with trivial intersection and full product give .
  • Counting -cycles in : for the number of -cycles.

10.1. Existence of Subgroups via Sylow’s First Theorem

Question

Prove the following: (a) Every group of order contains a subgroup of order . (b) Prove that has a subgroup of order . (c) Prove that a group of order has a subgroup of order .

(a) Factorise: . Take , so with coprime to . By Sylow’s First Theorem, has a Sylow -subgroup of order .

(b) . The exponent of in is

So divides , and the Sylow -subgroup has order . By Sylow’s First Theorem, has such a subgroup.

(c) . Take : a Sylow -subgroup has order . By Sylow’s First Theorem, has such a subgroup.


10.2. Sylow Subgroups of

Question

Find a -Sylow subgroup and a -Sylow subgroup of .

. Sylow -subgroup has order , Sylow -subgroup has order .

Sylow -subgroup. .

Sylow -subgroup. The dihedral group of the square (with vertices labelled in cyclic order):

  • eight elements, isomorphic to . ✓

10.3. Group of Order 24 with Exactly Four Sylow 2-Subgroups?

Question

Does there exist a finite group of order with precisely four distinct Sylow 2-subgroups? Give an example or a proof of nonexistence.

Solution. No such group exists.

, so by Sylow’s Third Theorem and . Divisibility forces ; mod-2 forces odd. Both conditions agree: .

is impossible, since and .


10.4. Has at Least Eight Sylow 7-Subgroups

Question

Prove that has at least eight Sylow -subgroups.

Solution. . Sylow -subgroups have order (so are cyclic, generated by -cycles).

By Sylow’s Third Theorem, and , so .

Lower-bound by exhibiting two distinct Sylow 7-subgroups. contains many -cycles, e.g. and . The first generates , which doesn’t contain the second (the first cycle moves but fixes , while the second moves ). So these are two distinct Sylow -subgroups. Hence .

Combined with and , the smallest possibility is . So .

Note

In fact is much larger. The number of -cycles in is , and each Sylow -subgroup contains generators (the -cycle and its powers ), so .


10.5. Unique Sylow Normal

Question

Prove that if , then the Sylow -subgroup of is normal.

Solution. Let be the unique Sylow -subgroup of . For any , the conjugate is a subgroup of (Quick Subgroup Test) of order (the conjugation map is a bijection). So is a Sylow -subgroup. Since there’s only one of those (by hypothesis), for every . Hence .

Note

This is the workhorse Sylow trick. A key reason Sylow’s Third Theorem is so useful: if the divisibility constraints force , you get a normal subgroup for free.


10.6. Subgroups of a Group of Order 35

Question

Let . Find all subgroups of .

Solution. .

Possible orders. By Lagrange, subgroups have orders dividing : .

Order . Just the trivial subgroup .

Order . Just itself.

Order . Sylow -subgroups. By Sylow’s Third Theorem, and , so . So exactly one Sylow -subgroup.

Order . Sylow -subgroups. and , so . So exactly one Sylow -subgroup.

Conclusion. has exactly four subgroups: , the unique , the unique , and .

Note

Combined with the 10.7. Every Group of Order 221 is Cyclic’s argument: any such has .


10.7. Every Group of Order 221 is Cyclic

Question

Let . Prove is cyclic.

Solution. - a product of two distinct primes.

Sylow -subgroup count. and . . Now , so .

Sylow -subgroup count. and . . Now , so .

Let be the unique Sylow -subgroup and the unique Sylow -subgroup. Both are normal in (by problem 10.5).

Trivial intersection. divides both and , hence divides . So .

Product is . , so .

Internal direct product. By the internal direct product theorem (lecture 18),

where the last isomorphism uses (the direct product of two coprime cyclic groups is cyclic).

Generalisation

The same argument applies to any group whose order is a product of two distinct primes with and : the group must be cyclic. In particular all force cyclic. (When a non-cyclic example exists: allows .)