Sylow's theorem: Difference between revisions
No edit summary |
|||
| Line 1: | Line 1: | ||
{{basic fact}} | {{basic fact}} | ||
{{sylow theory result}} | |||
==Statement== | ==Statement== | ||
| Line 20: | Line 22: | ||
* '''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>. | ||
==Proof of existence part== | |||
===Proof by action on subsets=== | |||
Let <math>n</math> be the [[order of a group|order]] of <math>G</math>. Let <math>p^r</math> be the higher power of <math>p</math> that divides the order of <math>G</math>. Clearly, a subgroup of <math>G</math> is a <math>p</math>-Sylow subgroup if and only if it has order <math>p^r</math>. If we denote <math>n/p^r</math> by <math>m</math>, then the index of any <math>p</math>-Sylow subgroup must be <math>m</math>. | |||
Consider the action of <math>G</math> by left multiplication on the set of ''subsets'' of <math>G</math> of size <math>p^r</math>. Here are some observations regarding this action: | |||
* The size of the set on which <math>G</math> acts is the number of subsets of size <math>p^r</math> in <math>G</math>. This is a binomial coefficient, and an appeal to [[Lucas' theorem]] reveals that its value is relatively prime to <math>p</math>. | |||
* Since the total cardinality of the set is relatively prime to <math>p</math>, there must exist at least one orbit under the action of <math>G</math> which has size relatively prime to <math>p</math>. Let <math>S</math> be the isotropy subgroup for a point in this orbit. | |||
* Now, since the size of the orbit is relatively prime to <math>p</math>, the index of <math>S</math> is relatively prime to <math>p</math>, and hence a divisor of <math>m</math>. | |||
* On the other hand, given any subset <math>T</math> of size <math>p^r</math>, we know that the translates of <math>T</math> cover the whole of <math>G</math>, and therefore there are at least <math>n/p^r</math> members in the orbit of <math>T</math>. | |||
* Combining these two facts <math>S</math> must have index exactly <math>m</math> -- hence it is a subgroup. | |||
Interestingly, the only nontrivial result we use here (Lucas' theorem) can itself be proved using group theory (although a purely algebraic proof also exists). | |||
===Proof by conjugation action=== | |||
{{fillin}} | |||
==Proof of domination== | |||
===Proof using coset spaces=== | |||
Let <math>G</math> be a [[finite group]], <math>P</math> a <math>p</math>-Sylow subgroup, and <math>Q</math> a <math>p</math>-group. Suppose <math>n=p^rm</math> where <math>n</math> is the order of <math>G</math> adn <math>m</math> is relatively prime to <math>p</math>. Then: | |||
* <math>G</math> naturally acts (on the left) on the left coset space of <math>P</math>. | |||
* Since <math>Q</math> is a subgroup of <math>G</math>, <math>Q</math> also acts on the left coset space of <math>P</math> | |||
* The left coset space of <math>P</math> has cardinality <math>m</math>, which is relatively prime to <math>p</math>. Hence, under the action of <math>Q</math> (which is a <math>p</math>-group) on this set, there is at least one fixed point. Let the fixed point be <math>gP</math>. | |||
* We have <math>QgP = gP</math>. This gives us: <math>(g^{-1}Qg)P = P</math>, and hence <math>g^{-1}Qg \subseteq P</math>. Thus, a conjugate of <math>Q</math> is contained inside <math>P</math>. | |||
Revision as of 00:30, 22 February 2007
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 result is related to the theory of Sylow subgroups
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 .
Symbolic statement
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 . Then Sylow's theorem states that:
- Existence: There exists a -Sylow subgroup of
- Conjugacy: If and are -Sylow subgroups of then there exists in such that viz and are conjugate subgroups)
- Domination: Let be a -Sylow subgroup and a -group. Then there exists a in such that .
- Congruence: Let denote the set of -Sylow subgroups of and denote the cardinality of . Then, .
Proof of existence part
Proof by action on subsets
Let be the order of . Let be the higher power of that divides the order of . Clearly, a subgroup of is a -Sylow subgroup if and only if it has order . If we denote by , then the index of any -Sylow subgroup must be .
Consider the action of by left multiplication on the set of subsets of of size . Here are some observations regarding this action:
- The size of the set on which acts is the number of subsets of size in . This is a binomial coefficient, and an appeal to Lucas' theorem reveals that its value is relatively prime to .
- Since the total cardinality of the set is relatively prime to , there must exist at least one orbit under the action of which has size relatively prime to . Let be the isotropy subgroup for a point in this orbit.
- Now, since the size of the orbit is relatively prime to , the index of is relatively prime to , and hence a divisor of .
- On the other hand, given any subset of size , we know that the translates of cover the whole of , and therefore there are at least members in the orbit of .
- Combining these two facts must have index exactly -- hence it is a subgroup.
Interestingly, the only nontrivial result we use here (Lucas' theorem) can itself be proved using group theory (although a purely algebraic proof also exists).
Proof by conjugation action
PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]
Proof of domination
Proof using coset spaces
Let be a finite group, a -Sylow subgroup, and a -group. Suppose where is the order of adn is relatively prime to . Then:
- naturally acts (on the left) on the left coset space of .
- Since is a subgroup of , also acts on the left coset space of
- The left coset space of has cardinality , which is relatively prime to . Hence, under the action of (which is a -group) on this set, there is at least one fixed point. Let the fixed point be .
- We have . This gives us: , and hence . Thus, a conjugate of is contained inside .