Sylow theorems

Motivation The Sylow theorems are a powerful statement about the structure of groups in general, but are also powerful in applications of finite group theory. This is because they give a method for using the prime decomposition of the cardinality of a finite group G to give statements about the structure of its subgroups: essentially, it gives a technique to transport basic number-theoretic information about a group to its group structure. From this observation, classifying finite groups becomes a game of finding which combinations/constructions of groups of smaller order can be applied to construct a group. For example, a typical application of these theorems is in the classification of finite groups of some fixed cardinality, e.g. |G| = 60. Statement Collections of subgroups that are each maximal in one sense or another are common in group theory. The surprising result here is that in the case of \operatorname{Syl}_p(G), all members are actually isomorphic to each other and have the largest possible order: if |G|=p^nm with n > 0 where does not divide , then every Sylow -subgroup has order |P| = p^n. That is, is a -group and \text{gcd}(|G:P|, p) = 1. These properties can be exploited to further analyze the structure of . The following theorems were first proposed and proven by Ludwig Sylow in 1872, and published in Mathematische Annalen. The following weaker version of theorem 1 was first proved by Augustin-Louis Cauchy, and is known as Cauchy's theorem. {{math theorem|note=2|Given a finite group and a prime number , all Sylow -subgroups of are conjugate to each other. That is, if and are Sylow -subgroups of , then there exists an element g \in G with g^{-1}Hg = K.}} {{math theorem|note=3|Let be a prime factor with multiplicity of the order of a finite group , so that the order of can be written as p^nm, where n > 0 and does not divide . Let n_p be the number of Sylow -subgroups of . Then the following hold: • n_p divides , which is the index of the Sylow -subgroup in . • n_p \equiv 1 \pmod{p} • n_p = |G:N_G (P)|, where is any Sylow -subgroup of and N_G denotes the normalizer. }} Consequences If p^mis any prime power dividing the order of G, then there exists a subgroup of G of order p^m. This is easily shown to be true for p-groups, and the first Sylow theorem guarantees the existence of a large enough p-subgroup of G. The Sylow theorems imply that for a prime number p all Sylow p-subgroups of G have the same order, p^n, the highest power of p dividing the order of G. Conversely, all subgroups of order p^nare Sylow p-subgroup, and so they are all conjugate to each other. Further, due to the maximality condition, any p-subgroup of G is subgroup of a p-subgroup of G of order p^n. An important consequence of Theorem 2 is that the condition n_p = 1 is equivalent to the condition that the Sylow p-subgroup of G is a normal subgroup (Theorem 3 can often be used to show n_p = 1). However, there are groups that have proper, non-trivial normal subgroups but no normal Sylow subgroups, such as S_4. Groups that are of prime-power order have no proper Sylow p-subgroups. The third bullet point of the third theorem has as an immediate consequence that n_p divides |G|. Sylow theorems for infinite groups There is an analogue of the Sylow theorems for infinite groups. One defines a Sylow -subgroup in an infinite group to be a p-subgroup (that is, every element in it has -power order) that is maximal for inclusion among all -subgroups in the group. Let \operatorname{Cl}(K) denote the set of conjugates of a subgroup K \subset G. {{math theorem|If is a Sylow -subgroup of , and n_p = |\operatorname{Cl}(K)| is finite, then every Sylow -subgroup is conjugate to , and n_p \equiv 1\ (\mathrm{mod}\ p). }} == Examples ==

A simple illustration of Sylow subgroups and the Sylow theorems are the dihedral group of the n-gon, D2n. For n odd, 2 = 21 is the highest power of 2 dividing the order, and thus subgroups of order 2 are Sylow subgroups. These are the groups generated by a reflection, of which there are n, and they are all conjugate under rotations; geometrically the axes of symmetry pass through a vertex and a side. By contrast, if n is even, then 4 divides the order of the group, and the subgroups of order 2 are no longer Sylow subgroups, and in fact they fall into two conjugacy classes, geometrically according to whether they pass through two vertices or two faces. These are related by an outer automorphism, which can be represented by rotation through π/n, half the minimal rotation in the dihedral group. Another example are the Sylow p-subgroups of GL2(Fq), where p and q are primes ≥ 3 and , which are all abelian. The order of GL2(Fq) is . Since , the order of . Thus by Theorem 1, the order of the Sylow p-subgroups is p2n. One such subgroup P, is the set of diagonal matrices \begin{bmatrix}x^{im} & 0 \\0 & x^{jm} \end{bmatrix}, x is any primitive root of Fq. Since the order of Fq is , its primitive roots have order q − 1, which implies that or xm and all its powers have an order which is a power of p. So, P is a subgroup where all its elements have orders which are powers of p. There are pn choices for both a and b, making . This means P is a Sylow p-subgroup, which is abelian, as all diagonal matrices commute, and because Theorem 2 states that all Sylow p-subgroups are conjugate to each other, the Sylow p-subgroups of GL2(Fq) are all abelian. ==Example applications==

Since Sylow's theorem ensures the existence of p-subgroups of a finite group, it is worthwhile to study groups of prime power order more closely. Most of the examples use Sylow's theorem to prove that a group of a particular order is not simple. For groups of small order, the congruence condition of Sylow's theorem is often sufficient to force the existence of a normal subgroup. Burnside's pa qb theorem states that if the order of a group is the product of one or two prime powers, then it is solvable, hence not not simple (except if it is cyclic of prime order). Cyclic group orders Some non-prime numbers n are such that every group of order n is cyclic. One can show that n = 15 is such a number using the Sylow theorems: Let G be a group of order 15 = 3 · 5 and n3 be the number of Sylow 3-subgroups. Then n3 \mid 5 and n3 ≡ 1 (mod 3). The only value satisfying these constraints is 1; therefore, there is only one subgroup of order 3, and it must be normal (since it has no distinct conjugates). Similarly, n5 must divide 3, and n5 must equal 1 (mod 5); thus it must also have a single normal subgroup of order 5. Since 3 and 5 are coprime, the intersection of these two subgroups is trivial, and so G must be the internal direct product of groups of order 3 and 5, that is the cyclic group of order 15. Thus, there is only one group of order 15 (up to isomorphism). More generally, one can show with a similar argument that if n = pq, where p and q are distinct prime numbers such that p does not divide q-1, then every group of order n is cyclic. The condition of p not dividing q-1 is necessary: as an example, the dihedral group Dp, where p is an odd prime, has order 2p but is not cyclic. Small groups are not simple A more complicated application is to find the order of the smallest simple group that is not cyclic. Burnside's pa qb theorem rules out every group up to order 30 . If |G| = 30 and G were simple, then n3 > 1 to avoid a normal 3-subgroup, and n3 must both divide 10 = 2 · 5 and equal 1 (mod 3), hence n3 = 10. The group then has 10 distinct cyclic subgroups of order 3, each with 2 elements of order 3. This means G has at least 20 distinct elements of order 3. Similarly, n5 = 6, since n5 > 1 must divide 6 = 2 · 3, and n5 must equal 1 (mod 5). Thus G also has 24 distinct elements of order 5. But the order of G is only 30, so a simple group of order 30 cannot exist. Next suppose |G| = 42 = 2 · 3 · 7 and G were simple. Here n7 > 1 must divide 6 = 2 · 3 and n7 must equal 1 (mod 7), which is impossible. On the other hand, if |G| = 60 = 22 · 3 · 5, then n3 = 10 and n5 = 6 is perfectly possible. In fact, the smallest simple non-cyclic group is A5, the alternating group over 5 elements. It has order 60, and has 24 cyclic permutations of order 5, and 20 of order 3. In fact, if |G| = 60 and n5 > 1, then G is simple. Wilson's theorem Part of Wilson's theorem states that :(p-1)! \equiv -1 \pmod p for every prime p. One may easily prove this theorem by Sylow's third theorem. Indeed, observe that the number np of Sylow's p-subgroups in the symmetric group Sp is times the number of p-cycles in Sp, ie. . On the other hand, . Hence, . So, . Fusion results Frattini's argument shows that a Sylow subgroup of a normal subgroup provides a factorization of a finite group. A slight generalization known as '''Burnside's fusion theorem' states that if G is a finite group with Sylow p-subgroup P and two subsets A and B normalized by P, then A and B are G-conjugate if and only if they are NG(P'')-conjugate. The proof is a simple application of Sylow's theorem: If B=Ag, then the normalizer of B contains not only P but also Pg (since Pg is contained in the normalizer of Ag). By Sylow's theorem P and Pg are conjugate not only in G, but in the normalizer of B. Hence gh−1 normalizes P for some h that normalizes B, and then Agh−1 = Bh−1 = B, so that A and B are NG(P)-conjugate. Burnside's fusion theorem can be used to give a more powerful factorization called a semidirect product: if G is a finite group whose Sylow p-subgroup P is contained in the center of its normalizer, then G has a normal subgroup K of order coprime to P, G = PK and P∩K = {1}, that is, G is p-nilpotent. Less trivial applications of the Sylow theorems include the focal subgroup theorem, which studies the control a Sylow p-subgroup of the derived subgroup has on the structure of the entire group. This control is exploited at several stages of the classification of finite simple groups, and for instance defines the case divisions used in the Alperin–Brauer–Gorenstein theorem classifying finite simple groups whose Sylow 2-subgroup is a quasi-dihedral group. These rely on J. L. Alperin's strengthening of the conjugacy portion of Sylow's theorem to control what sorts of elements are used in the conjugation. ==Proof of the Sylow theorems==

The Sylow theorems have been proved in a number of ways, and the history of the proofs themselves is the subject of many papers, including Waterhouse, Scharlau, Casadio and Zappa, Gow, and to some extent Meo. One proof of the Sylow theorems exploits the notion of group action in various creative ways. The group acts on itself or on the set of its p-subgroups in various ways, and each such action can be exploited to prove one of the Sylow theorems. The following proofs are based on combinatorial arguments of Wielandt. In the following, we use a \mid b as notation for "a divides b" and a \nmid b for the negation of this statement. {{math proof|1=Let such that p \nmid u, and let Ω denote the set of subsets of of size pk. acts on Ω by left multiplication: for and , . For a given set , write for its stabilizer subgroup and for its orbit in Ω. The proof will show the existence of some for which has pk elements, providing the desired subgroup. This is the maximal possible size of a stabilizer subgroup , since for any fixed element , the right coset is contained in ; therefore, . By the orbit-stabilizer theorem we have for each , and therefore using the additive p-adic valuation νp, which counts the number of factors p, one has . This means that for those with , the ones we are looking for, one has , while for any other one has (as implies . Since is the sum of over all distinct orbits , one can show the existence of ω of the former type by showing that (if none existed, that valuation would exceed r). This is an instance of Kummer's theorem (since in base p notation the number ends with precisely k + r digits zero, subtracting pk from it involves a carry in r places), and can also be shown by a simple computation: :|\Omega | ={p^km \choose p^k} = \prod_{j=0}^{p^k - 1} \frac{p^k m - j}{p^k - j} = m\prod_{j=1}^{p^{k} - 1} \frac{p^{k - \nu_p(j)} m - j/p^{\nu_p(j)}}{p^{k - \nu_p(j)} - j/p^{\nu_p(j)}} and no power of p remains in any of the factors inside the product on the right. Hence , completing the proof. It may be noted that conversely every subgroup H of order pk gives rise to sets for which = H, namely any one of the m distinct cosets Hg.}} {{math proof|1=Let Ω be the set of all Sylow p-subgroups of and let act on Ω by conjugation. Let be a Sylow p-subgroup. By Theorem 2, the orbit of P has size np, so by the orbit-stabilizer theorem . For this group action, the stabilizer P is given by , the normalizer of P in . Thus, , and it follows that this number is a divisor of . Now let P act on Ω by conjugation, and again let Ω0 denote the set of fixed points of this action. Let and observe that then for all so that P ≤ NG(Q). By Theorem 2, P and Q are conjugate in NG(Q) in particular, and Q is normal in NG(Q), so then P = Q. It follows that Ω0 = {P} so that, by the Lemma, .}} == Algorithms ==

The problem of finding a Sylow subgroup of a given group is an important problem in computational group theory. One proof of the existence of Sylow p-subgroups is constructive: if H is a p-subgroup of G and the index [G:H] is divisible by p, then the normalizer N = NG(H) of H in G is also such that [N : H] is divisible by p. In other words, a polycyclic generating system of a Sylow p-subgroup can be found by starting from any p-subgroup H (including the identity) and taking elements of p-power order contained in the normalizer of H but not in H itself. The algorithmic version of this (and many improvements) is described in textbook form in Butler, including the algorithm described in Cannon. These versions are still used in the GAP computer algebra system. In permutation groups, it has been proven, in Kantor and Kantor and Taylor, that a Sylow p-subgroup and its normalizer can be found in polynomial time of the input (the degree of the group times the number of generators). These algorithms are described in textbook form in Seress, and are now becoming practical as the constructive recognition of finite simple groups becomes a reality. In particular, versions of this algorithm are used in the Magma computer algebra system. == See also ==