We will use induction on the order of If then clearly itself is the required subgroup. We now assume that every group of order where and divides has an element of order Assume that and and consider the class equation of
We have two cases.
Case 1.
Suppose the order of one of the centralizer subgroups, is divisible by for some In this case, by our induction hypothesis, we are done. Since is a proper subgroup of and divides must contain an element of order Hence, must contain an element of order
Case 2.
Suppose the order of no centralizer subgroup is divisible by Then divides the order of each conjugacy class in the class equation; hence, must divide the center of Since is abelian, it must have a subgroup of order by the Fundamental Theorem of Finite Abelian Groups. Therefore, the center of contains an element of order
We induct on the order of once again. If then we are done. Now suppose that the order of is with and that the theorem is true for all groups of order less than where divides We shall apply the class equation once again:
First suppose that does not divide for some Then since divides Now we can apply the induction hypothesis to
Hence, we may assume that divides for all Since divides the class equation says that must divide hence, by Cauchy's Theorem, has an element of order say Let be the group generated by Clearly, is a normal subgroup of since is abelian; therefore, is normal in since every element in commutes with every element in Now consider the factor group of order By the induction hypothesis, contains a subgroup of order The inverse image of under the canonical homomorphism is a subgroup of order in
Certainly and the cyclic subgroup, has as its order a power of By the Correspondence Theorem there exists a subgroup of containing such that Since the order of must be a power of However, is a Sylow -subgroup contained in Since the order of is the largest power of dividing Therefore, is the trivial subgroup and or
We define a bijection between the conjugacy classes of and the right cosets of by To show that this map is a bijection, let and suppose that Then Therefore, or and the map is an injection. It is easy to see that this map is surjective; hence, we have a one-to-one and onto map between the -conjugates of and the right cosets of in
Theorem 15.7. Second Sylow Theorem.
Let be a finite group and a prime dividing Then all Sylow -subgroups of are conjugate. That is, if and are two Sylow -subgroups, there exists a such that
Let be a Sylow -subgroup of and suppose that with Let
consist of the distinct conjugates of in By Lemma 15.6, Notice that
Since divides cannot divide
Given any other Sylow -subgroup we must show that Consider the -conjugacy classes of each Clearly, these conjugacy classes partition The size of the partition containing is by Lemma 15.6, and Lagrange's Theorem tells us that Thus, must be a divisor of Hence, the number of conjugates in every equivalence class of the partition is a power of However, since does not divide one of these equivalence classes must contain only a single Sylow -subgroup, say In this case, for all By Lemma 15.5,
Let be a Sylow -subgroup acting on the set of Sylow -subgroups,
by conjugation. From the proof of the Second Sylow Theorem, the only -conjugate of is itself and the order of the other -conjugacy classes is a power of Each -conjugacy class contributes a positive power of toward except the equivalence class Since is the sum of positive powers of and
Now suppose that acts on by conjugation. Since all Sylow -subgroups are conjugate, there can be only one orbit under this action. For
by Lemma 15.6. But is a divisor of consequently, the number of Sylow -subgroups of a finite group must divide the order of the group.