Sylow's theorem: Difference between revisions

Latest revision as of 05:42, 24 September 2016

This article gives the statement, and possibly proof, of a basic fact in group theory.
View a complete list of basic facts in group theory
VIEW FACTS USING THIS: directly | directly or indirectly, upto two steps | directly or indirectly, upto three steps|
VIEW: Survey articles about this

This fact is related to: Sylow theory
View other facts related to Sylow theory | View terms related to Sylow theory

Statement

Verbal statement

The Sylow's theorem(s) give(s) information about the existence of $p$ -Sylow subgroups of a finite group, as well as the relation among them. More specifically, given a finite group:

Existence: For any prime $p$ , there exists a $p$ -Sylow subgroup
Conjugacy: Any two $p$ -Sylow subgroups are conjugate in the whole group
Domination: Any $p$ -subgroup is contained inside some $p$ -Sylow subgroup
Congruence: The number of $p$ -Sylow subgroups divides the index of any $p$ -Sylow subgroup and is also congruent to $1$ modulo $p$ .

Statement with symbols

Let $G$ be a finite group and $p$ a prime. A subgroup of $G$ is termed a $p$ -Sylow subgroup if its order is a power of $p$ and its index is relatively prime to $p$ . Note that by Lagrange's theorem, the order of a Sylow subgroup is the largest power of $p$ dividing the order of $G$ , and thus, it is a multiple of the order of any $p$ -subgroup (subgroup whose order is a power of $p$ ) of $G$ .

Then Sylow's theorem states that:

Existence: There exists a $p$ -Sylow subgroup $P$ of $G$
Conjugacy: If $P$ and $Q$ are $p$ -Sylow subgroups of $G$ then there exists $g$ in $G$ such that $g P g^{- 1} = Q$ (i.e., $P$ and $Q$ are conjugate subgroups)
Domination: Let $P$ be a $p$ -Sylow subgroup and $Q$ a $p$ -group. Then there exists a $g$ in $G$ such that $g Q g^{- 1} \subseteq P$ .
Congruence: Let $S y l_{p} (G)$ denote the set of $p$ -Sylow subgroups of $G$ and $n_{p}$ denote the cardinality of $S y l_{p} (G)$ . Then, $n_{p} \equiv 1 mod p$ .

Related facts

Corollaries

There are other corollaries too, many of which factor through these corollaries.

Similar statements

ECD condition for pi-subgroups in solvable groups: In a finite solvable group, an analogue of Sylow's theorem holds for sets of primes in place of primes, with Sylow subgroups being replaced by Hall subgroups. Existence, conjugacy and domination have obvious analogues here. There are analogues to the divisibility and congruence conditions as well, but these are more complicated.
Sylow's theorem in profinite groups
Sylow's theorem with operators: An analogue of Sylow's theorem where, instead of looking at all $p$ -subgroups, we consider the $p$ -subgroups invariant under the action of a coprime automorphism group. The known proofs of this invoke the odd-order theorem, in the guise of the fact that given two groups of coprime order, one of them is solvable.

Proof breakup

Existence: For full proof, refer: Sylow subgroups exist
Conjugacy: This follows from Domination, though it can also be proved through the methods used to establish Congruence. For full proof, refer: Sylow implies order-conjugate
Domination: For full proof, refer: Sylow implies order-dominating
Congruence: For full proof, refer: Congruence condition on Sylow numbers

References

Journal references

Théorèmes sur les groupes de substitutions by Ludwig Sylow, Mathematische Annalen, Vol. 5, (1872), no. 4, 584-594 ^{Springerlink page}^{Archived local copy}: The original formulation of Sylow's theorem by Sylow. Does not include the congruence condition part of the theorem, which was proved later by Frobenius.^{More info}
Sur les groupes transitifs dont le degré est le carré d'un nombre premier by Peter Ludwig Mejdell Sylow, Volume 11, Page 201 - 256(Year 1887): A paper by Sylow on transitive group actions, that begins by stating the complete Sylow's theorem.^{Springerlink page}^{More info}

@@ Line 1: / Line 1: @@
 {{basic fact}}
+{{fact related to|Sylow theory}}
 ==Statement==
@@ Line 12: / Line 13: @@
 * '''Congruence''': The number of <math>p</math>-Sylow subgroups divides the index of any <math>p</math>-Sylow subgroup and is also congruent to <math>1</math> modulo <math>p</math>.
-===Symbolic statement===
+===Statement with symbols===
-Let <math>G</math>  be a [[finite group]] and <math>p</math> a prime. A [[subgroup]] of <math>G</math> is termed a <math>p</math>-Sylow subgroup if its order is a power of <math>p</math> and its index is relatively prime to <math>p</math>. Then Sylow's theorem states that:
+Let <math>G</math>  be a [[finite group]] and <math>p</math> a prime. A [[subgroup]] of <math>G</math> is termed a <math>p</math>-Sylow subgroup if its order is a power of <math>p</math> and its index is relatively prime to <math>p</math>. Note that by [[Lagrange's theorem]], the order of a Sylow subgroup is the largest power of <math>p</math> dividing the order of <math>G</math>, and thus, it is a multiple of the order of any <math>p</math>-subgroup (subgroup whose order is a power of <math>p</math>) of <math>G</math>.
-* '''Existence''': There exists a <math>p</math>-Sylow subgroup <math>P</math> of <math>G</math>
+Then Sylow's theorem states that:
-* '''Conjugacy''': If <math>P</math> and <math>Q</math> are <math>p</math>-Sylow subgroups of <math>G</math> then there exists <math>g</math> in <math>G</math> such that <math>gPg^{-1} = Q</math> viz <math>P</math> and <math>Q</math> are [[conjugate subgroups]])
-* '''Domination''': Let <math>P</math> be a <math>p</math>-Sylow subgroup and <math>Q</math> a <math>p</math>-group. Then there exists a <math>g</math> in <math>G</math> such that <math>gQg^{-1} \subseteq P</math>.
+# '''Existence''': There exists a <math>p</math>-Sylow subgroup <math>P</math> of <math>G</math>
-* '''Congruence''': Let <math>Syl_p(G)</math> denote the set of <math>p</math>-Sylow subgroups of <math>G</math> and <math>n_p</math> denote the cardinality of <math>Syl_p(G)</math>. Then, <math>n_p \equiv 1\mod p</math>.
+# '''Conjugacy''': If <math>P</math> and <math>Q</math> are <math>p</math>-Sylow subgroups of <math>G</math> then there exists <math>g</math> in <math>G</math> such that <math>gPg^{-1} = Q</math> (i.e., <math>P</math> and <math>Q</math> are [[conjugate subgroups]])
+# '''Domination''': Let <math>P</math> be a <math>p</math>-Sylow subgroup and <math>Q</math> a <math>p</math>-group. Then there exists a <math>g</math> in <math>G</math> such that <math>gQg^{-1} \subseteq P</math>.
+# '''Congruence''': Let <math>Syl_p(G)</math> denote the set of <math>p</math>-Sylow subgroups of <math>G</math> and <math>n_p</math> denote the cardinality of <math>Syl_p(G)</math>. Then, <math>n_p \equiv 1\mod p</math>.
+==Related facts==
+===Corollaries===
+* [[Sylow implies order-conjugate]]
+* [[Sylow implies order-isomorphic]]
+* [[Sylow implies isomorph-automorphic]]
+* [[Sylow implies automorph-conjugate]]
+* [[Sylow implies isomorph-conjugate]]
+* [[Sylow implies intermediately isomorph-conjugate]]
+* [[Sylow implies intermediately automorph-conjugate]]
+* [[Sylow implies pronormal]]
+There are other corollaries too, many of which factor through these corollaries.
+===Similar statements===
+* [[ECD condition for pi-subgroups in solvable groups]]: In a [[finite solvable group]], an analogue of Sylow's theorem holds for ''sets of primes'' in place of primes, with [[Sylow subgroup]]s being replaced by [[Hall subgroup]]s. Existence, conjugacy and domination have obvious analogues here. There are analogues to the divisibility and congruence conditions as well, but these are more complicated.
+* [[Sylow's theorem in profinite groups]]
+* [[Sylow's theorem with operators]]: An analogue of Sylow's theorem where, instead of looking at all <math>p</math>-subgroups, we consider the <math>p</math>-subgroups invariant under the action of a [[coprime automorphism group]]. The known proofs of this invoke the [[odd-order implies solvable|odd-order theorem]], in the guise of the fact that [[coprime implies one is solvable|given two groups of coprime order, one of them is solvable]].
+==Proof breakup==
+# '''Existence''': {{proofat|[[Sylow subgroups exist]]}}
+# '''Conjugacy''': This follows from '''Domination''', though it can also be proved through the methods used to establish '''Congruence'''. {{proofat|[[Sylow implies order-conjugate]]}}
+# '''Domination''': {{proofat|[[Sylow implies order-dominating]]}}
+# '''Congruence''': {{proofat|[[Congruence condition on Sylow numbers]]}}
+==References==
+===Journal references===
+* {{paperlink|Sylowtheoremoriginal}}
+* {{paperlink|Sylowsecondpaper}}