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. For a prime number p {\displaystyle p} , a p-group is a group in which the order of every element is a power of p {\displaystyle p} ; for finite groups, this is equivalent to the group's cardinality being a power of p {\displaystyle p} . A Sylow p-subgroup of a group G {\displaystyle G} is a maximal p {\displaystyle p} -subgroup—that is, a p-subgroup of G {\displaystyle G} not contained in any strictly larger p-subgroup. The set of all Sylow p {\displaystyle p} -subgroups of G {\displaystyle G} for a given prime p {\displaystyle p} is denoted Syl p ( G ) {\displaystyle {\text{Syl}}_{p}(G)} . The Sylow theorems assert a partial converse to Lagrange's theorem. Lagrange's theorem states that for any finite group G {\displaystyle G} the order (number of elements) of every subgroup of G {\displaystyle G} divides the order of G {\displaystyle G} . The Sylow theorems state that for every prime factor p {\displaystyle p} of the order of a finite group G {\displaystyle G} , there exists a Sylow p {\displaystyle p} -subgroup of G {\displaystyle G} of order p n {\displaystyle p^{n}} , the highest power of p {\displaystyle p} that divides the order of G {\displaystyle G} . Moreover, every subgroup of order p n {\displaystyle p^{n}} is a Sylow p {\displaystyle p} -subgroup of G {\displaystyle G} , and the Sylow p {\displaystyle p} -subgroups of a group (for a given prime p {\displaystyle p} ) are conjugate to each other. Furthermore, the number of Sylow p {\displaystyle p} -subgroups of a group for a given prime p {\displaystyle p} is congruent to 1 (mod p {\displaystyle 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 {\displaystyle 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 {\displaystyle |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 Syl p ( G ) {\displaystyle \operatorname {Syl} _{p}(G)} , all members are actually isomorphic to each other and have the largest possible order: if | G | = p n m {\displaystyle |G|=p^{n}m} with n > 0 {\displaystyle n>0} where p does not divide m, then every Sylow p-subgroup P has order | P | = p n {\displaystyle |P|=p^{n}} . That is, P is a p-group and gcd ( | G : P | , p ) = 1 {\displaystyle {\text{gcd}}(|G:P|,p)=1} . These properties can be exploited to further analyze the structure of G. 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.
… excerpt ends here. Continue reading the full article.
