Namespaces
Variants
Actions

Difference between pages "Equivalence relation" and "Sylow basis"

From Encyclopedia of Mathematics
(Difference between pages)
Jump to: navigation, search
(cf Kernel of a function)
 
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}}
 
{{TEX|done}}
{{MSC|03E}}
 
 
Let $X$ be a set. An equivalence relation on $X$ is a subset $R\subseteq X\times X$ that satisfies the following three properties:
 
 
1) [[Reflexivity]]: for all $x\in X$, $(x,x)\in R$;
 
 
2) [[Symmetry (of a relation)|Symmetry]]: for all $x,y\in X$, if $(x,y)\in R$ then $(y,x)\in R$;
 
 
3) [[Transitivity]]: for all $x,y,z \in X$, if $(x,y)\in R$ and  $(y,z)\in R$ then $(x,z)\in R$.
 
 
When $(x,y)\in R$ we say that $x$ is equivalent to $y$.
 
 
Instead of $(x,y)\in R$, the notation $xRy$, or even $x\sim y$,  is also used.
 
 
An equivalence relation is a [[Binary relation|binary relation]].
 
  
Example: If $f$ maps the set $X$ into a set $Y$, then $R=\{(x_1,x_2)\in X\times X\,:\, f(x_1)=f(x_2)\}$ is an equivalence relation (cf. [[Kernel of a function]]).
+
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]]).
  
For any $y\in X$ the subset of $X$ that consists of all $x$ that are equivalent to $y$ is called the equivalence class of $y$. Any two equivalence classes either are disjoint or coincide, that is, any equivalence relation on $X$ defines a partition (decomposition) of $X$, and vice versa.
+
====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>

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
How to Cite This Entry:
Equivalence relation. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Equivalence_relation&oldid=35140
This article was adapted from an original article by V.N. Grishin (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article