Sylow's theorem: Difference between revisions

From Groupprops
No edit summary
No edit summary
Line 20: Line 20:


# '''Existence''': There exists a <math>p</math>-Sylow subgroup <math>P</math> of <math>G</math>
# '''Existence''': There exists a <math>p</math>-Sylow subgroup <math>P</math> of <math>G</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> viz <math>P</math> and <math>Q</math> are [[conjugate subgroups]])
# '''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>.
# '''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>.
# '''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>.
Line 38: Line 38:


There are other corollaries too, many of which factor through these corollaries.
There are other corollaries too, many of which factor through these corollaries.
===Similar statements===
* [[Sylow's theorem in profinite groups]]


==Proof breakup==
==Proof breakup==

Revision as of 22:45, 5 October 2008

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

For survey articles related to this, refer: Category:Survey articles related to Sylow theory

Statement

Verbal statement

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

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

Statement with symbols

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

Then Sylow's theorem states that:

  1. Existence: There exists a -Sylow subgroup of
  2. Conjugacy: If and are -Sylow subgroups of then there exists in such that (i.e., and are conjugate subgroups)
  3. Domination: Let be a -Sylow subgroup and a -group. Then there exists a in such that .
  4. Congruence: Let denote the set of -Sylow subgroups of and denote the cardinality of . Then, .

Related facts

Corollaries

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

Similar statements

Proof breakup

  1. Existence: For full proof, refer: Sylow subgroups exist
  2. 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
  3. Domination: For full proof, refer: Sylow implies order-dominating
  4. Congruence: For full proof, refer: Congruence condition on Sylow numbers

References

Journal references