Difference between revisions of "Sylow basis"
m (link) |
Ulf Rehmann (talk | contribs) m (tex encoded by computer) |
||
Line 1: | Line 1: | ||
− | + | <!-- | |
+ | s0915401.png | ||
+ | $#A+1 = 19 n = 0 | ||
+ | $#C+1 = 19 : ~/encyclopedia/old_files/data/S091/S.0901540 Sylow basis | ||
+ | Automatically converted into TeX, above some diagnostics. | ||
+ | Please remove this comment and the {{TEX|auto}} line below, | ||
+ | if TeX found to be correct. | ||
+ | --> | ||
+ | |||
+ | {{TEX|auto}} | ||
+ | {{TEX|done}} | ||
+ | |||
+ | Let $ G $ | ||
+ | be a [[Finite group|finite group]] and $ \pi $ | ||
+ | a subset of the prime numbers that divide the order $ n $ | ||
+ | of $ G $. | ||
+ | A Sylow $ \pi $- | ||
+ | basis $ S $ | ||
+ | is a collection of Sylow $ p $- | ||
+ | subgroups $ P _ {p} $ | ||
+ | of $ G $( | ||
+ | cf. [[Sylow subgroup|Sylow subgroup]]), one for each prime $ p $ | ||
+ | in $ \pi $, | ||
+ | such that: If $ P _ {p _ {1} } \dots P _ {p _ {r} } $ | ||
+ | are in $ S $, | ||
+ | then the order of every element in $ \{ G _ {p _ {1} } \dots G _ {p _ {r} } \} $( | ||
+ | the subgroup generated by $ P _ {p _ {1} } \dots P _ {p _ {r} } $) | ||
+ | is a product of non-negative powers of $ p _ {1} \dots p _ {r} $. | ||
+ | If $ \pi $ | ||
+ | is the set of all primes dividing $ n $, | ||
+ | one speaks of a complete Sylow basis. Two Sylow bases are conjugate if there is a single element of $ G $ | ||
+ | that by [[conjugation]] transforms all the groups of the first into those of the second. Hall's second theorem, [[#References|[a2]]], says that every finite solvable group has a complete Sylow basis, and that all these bases are conjugate. Conversely, if a finite group has a complete Sylow basis, then it is solvable (cf. also [[Solvable group|Solvable group]]). | ||
====References==== | ====References==== | ||
<table><TR><TD valign="top">[a1]</TD> <TD valign="top"> A.G. Kurosh, "The theory of groups" , '''2''' , Chelsea (1960) pp. 195ff (Translated from Russian)</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top"> P. Hall, "On the Sylow systems of a soluble group" ''Proc. London Math. Soc.'' , '''43''' (1937) pp. 316–323</TD></TR></table> | <table><TR><TD valign="top">[a1]</TD> <TD valign="top"> A.G. Kurosh, "The theory of groups" , '''2''' , Chelsea (1960) pp. 195ff (Translated from Russian)</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top"> P. Hall, "On the Sylow systems of a soluble group" ''Proc. London Math. Soc.'' , '''43''' (1937) pp. 316–323</TD></TR></table> |
Latest revision as of 08:24, 6 June 2020
Let $ G $
be a finite group and $ \pi $
a subset of the prime numbers that divide the order $ n $
of $ G $.
A Sylow $ \pi $-
basis $ S $
is a collection of Sylow $ p $-
subgroups $ P _ {p} $
of $ G $(
cf. Sylow subgroup), one for each prime $ p $
in $ \pi $,
such that: If $ P _ {p _ {1} } \dots P _ {p _ {r} } $
are in $ S $,
then the order of every element in $ \{ G _ {p _ {1} } \dots G _ {p _ {r} } \} $(
the subgroup generated by $ P _ {p _ {1} } \dots P _ {p _ {r} } $)
is a product of non-negative powers of $ p _ {1} \dots p _ {r} $.
If $ \pi $
is the set of all primes dividing $ n $,
one speaks of a complete Sylow basis. Two Sylow bases are conjugate if there is a single element of $ G $
that by conjugation transforms all the groups of the first into those of the second. Hall's second theorem, [a2], says that every finite solvable group has a complete Sylow basis, and that all these bases are conjugate. Conversely, if a finite group has a complete Sylow basis, then it is solvable (cf. also Solvable group).
References
[a1] | A.G. Kurosh, "The theory of groups" , 2 , Chelsea (1960) pp. 195ff (Translated from Russian) |
[a2] | P. Hall, "On the Sylow systems of a soluble group" Proc. London Math. Soc. , 43 (1937) pp. 316–323 |
Sylow basis. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Sylow_basis&oldid=48919