Sylow theorems explained

In mathematics, specifically in the field of finite group theory, the Sylow theorems are a collection of theorems named after the Norwegian mathematician Peter Ludwig Sylow that give detailed information about the number of subgroups of fixed order that a given finite group contains. The Sylow theorems form a fundamental part of finite group theory and have very important applications in the classification of finite simple groups.

p , a Sylow p-subgroup (sometimes p-Sylow subgroup) of a group G is a maximal p -subgroup of G , i.e., a subgroup of G that is a p-group (meaning its cardinality is a power of p, or equivalently, the order of every group element is a power of p ) that is not a proper subgroup of any other p -subgroup of G . The set of all Sylow p -subgroups for a given prime p is sometimes written Syl _{p(G)} .

The Sylow theorems assert a partial converse to Lagrange's theorem. Lagrange's theorem states that for any finite group

G the order (number of elements) of every subgroup of G divides the order of G . The Sylow theorems state that for every prime factor p of the order of a finite group G , there exists a Sylow p -subgroup of G of order p ^{n} , the highest power of p that divides the order of G . Moreover, every subgroup of order p ^{n} is a Sylow p -subgroup of G , and the Sylow p -subgroups of a group (for a given prime p ) are conjugate to each other. Furthermore, the number of Sylow p -subgroups of a group for a given prime p is congruent to 1 (mod p ).

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 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.

Consequences

The Sylow theorems imply that for a prime number

p every Sylow p -subgroup is of the same order, p ^{n} . Conversely, if a subgroup has order p ^{n} , then it is a Sylow p -subgroup, and so is conjugate to every other Sylow p -subgroup. Due to the maximality condition, if H is any p -subgroup of G , then H is a subgroup of a p -subgroup of order p ^{n} .

A very 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. However, there are groups that have proper, non-trivial normal subgroups but no normal Sylow subgroups, such as S _{4} .

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 .

Examples

A simple illustration of Sylow subgroups and the Sylow theorems are the dihedral group of the n-gon, D_2n. For n odd, 2 = 2¹ 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 GL₂(F_q), where p and q are primes ≥ 3 and, which are all abelian. The order of GL₂(F_q) is . Since, the order of . Thus by Theorem 1, the order of the Sylow p-subgroups is p²ⁿ.

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 F_q. Since the order of F_q is, its primitive roots have order q − 1, which implies that or x^m 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 pⁿ 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 GL₂(F_q) are all abelian.

Example applications

Since Sylow's theorem ensures the existence of p-subgroups of a finite group, it's 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.

Example-1: Groups of order pq, p and q primes with p < q.

Example-2: Group of order 30, groups of order 20, groups of order p²q, p and q distinct primes are some of the applications.

Example-3: (Groups of order 60): If the order |G| = 60 and G has more than one Sylow 5-subgroup, then G is simple.

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 n₃ be the number of Sylow 3-subgroups. Then n₃

\mid 5 and n₃ ≡ 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, n₅ must divide 3, and n₅ 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).

Small groups are not simple

A more complex example involves the order of the smallest simple group that is not cyclic. Burnside's p^a q^b theorem states that if the order of a group is the product of one or two prime powers, then it is solvable, and so the group is not simple, or is of prime order and is cyclic. This rules out every group up to order 30 .

If G is simple, and |G| = 30, then n₃ must divide 10 (= 2 · 5), and n₃ must equal 1 (mod 3). Therefore, n₃ = 10, since neither 4 nor 7 divides 10, and if n₃ = 1 then, as above, G would have a normal subgroup of order 3, and could not be simple. G then has 10 distinct cyclic subgroups of order 3, each of which has 2 elements of order 3 (plus the identity). This means G has at least 20 distinct elements of order 3.

As well, n₅ = 6, since n₅ must divide 6 (= 2 · 3), and n₅ must equal 1 (mod 5). So 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. Here n₇ must divide 6 (= 2 · 3) and n₇ must equal 1 (mod 7), so n₇ = 1. So, as before, G can not be simple.

On the other hand, for |G| = 60 = 2² · 3 · 5, then n₃ = 10 and n₅ = 6 is perfectly possible. And in fact, the smallest simple non-cyclic group is A₅, the alternating group over 5 elements. It has order 60, and has 24 cyclic permutations of order 5, and 20 of order 3.

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 n_p of Sylow's p-subgroups in the symmetric group S_p is times the number of p-cycles in S_p, 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 N_G(P)-conjugate. The proof is a simple application of Sylow's theorem: If B=A^g, then the normalizer of B contains not only P but also P^g (since P^g is contained in the normalizer of A^g). By Sylow's theorem P and P^g are conjugate not only in G, but in the normalizer of B. Hence gh⁻¹ normalizes P for some h that normalizes B, and then A^gh−1 = B^h−1 = B, so that A and B are N_G(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 =, 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.

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 = N_G(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

• Frattini's argument
• Hall subgroup
• Maximal subgroup
• p-group

References

Proofs

• Casadio . Giuseppina . Zappa . Guido . 1990 . History of the Sylow theorem and its proofs . Boll. Storia Sci. Mat. . 10 . 1 . 29–75 . it . 0392-4432 . 1096350 . 0721.01008.
• Gow . Rod . 1994 . Sylow's proof of Sylow's theorem . Irish Math. Soc. Bull. . 0033 . 33 . 55–63 . 10.33232/BIMS.0033.55.63 . 0791-5578 . 1313412 . 0829.01011. free .
• Kammüller . Florian . Paulson . Lawrence C. . 1999 . A formal proof of Sylow's theorem. An experiment in abstract algebra with Isabelle HOL . J. Automat. Reason. . 23 . 3 . 235–264 . 10.1023/A:1006269330992 . 0168-7433 . 1721912 . 0943.68149 . 1449341 . 2006-01-03 . https://web.archive.org/web/20060103223152/http://www.cl.cam.ac.uk/users/lcp/papers/Kammueller/sylow.pdf .
• Meo . M. . 2004 . The mathematical life of Cauchy's group theorem . . 31 . 2 . 196–221 . 10.1016/S0315-0860(03)00003-X . 0315-0860 . 2055642 . 1065.01009 . free .
• Scharlau . Winfried . 1988 . Die Entdeckung der Sylow-Sätze . . 15 . 1 . 40–52 . de . 10.1016/0315-0860(88)90048-1 . 0315-0860 . 931678 . 0637.01006 . free .
• Waterhouse . William C. . William C. Waterhouse . 1980 . The early proofs of Sylow's theorem . Arch. Hist. Exact Sci. . 21 . 3 . 279–290 . 10.1007/BF00327877 . 0003-9519 . 575718 . 0436.01006. 123685226 .
• Wielandt . Helmut .

  de:Helmut Wielandt

  . 1959 . Ein Beweis für die Existenz der Sylowgruppen . Arch. Math. . 10 . 1 . 401–402 . de . 10.1007/BF01240818 . 0003-9268 . 0147529 . 0092.02403. 119816392 .

Algorithms

• Book: Butler, G. . 1991 . Fundamental Algorithms for Permutation Groups . . 559 . Berlin, New York City . . 10.1007/3-540-54955-2 . 9783540549550 . 1225579 . 0785.20001. 395110 .
• Book: Cannon, John J. . 1971 . Computing local structure of large finite groups . Computers in Algebra and Number Theory (Proc. SIAM-AMS Sympos. Appl. Math., New York City, 1970) . SIAM-AMS Proc. . 4 . Providence RI . . 161–176 . 0160-7634 . 0367027 . 0253.20027.
• Kantor . William M. . 1985a . Polynomial-time algorithms for finding elements of prime order and Sylow subgroups . J. Algorithms . 6 . 4 . 478–514 . 10.1016/0196-6774(85)90029-X . 0196-6774 . 813589 . 0604.20001 . 10.1.1.74.3690 .
• Kantor . William M. . William Kantor . 1985b . Sylow's theorem in polynomial time . J. Comput. Syst. Sci. . 30 . 3 . 359–394 . 10.1016/0022-0000(85)90052-2 . 1090-2724 . 805654 . 0573.20022. free .
• Kantor . William M. . Taylor . Donald E. . 1988 . Polynomial-time versions of Sylow's theorem . J. Algorithms . 9 . 1 . 1–17 . 10.1016/0196-6774(88)90002-8 . 0196-6774 . 925595 . 0642.20019.
• Kantor . William M. . 1990 . Finding Sylow normalizers in polynomial time . J. Algorithms . 11 . 4 . 523–563 . 10.1016/0196-6774(90)90009-4 . 0196-6774 . 1079450 . 0731.20005.
• Book: Seress, Ákos . 2003 . Permutation Group Algorithms . Cambridge Tracts in Mathematics . 152 . . 9780521661034 . 1970241 . 1028.20002.