In mathematics, specifically group theory, a Hall subgroup of a finite group G is a subgroup whose order is coprime to its index. They were introduced by the group theorist .
A Hall divisor (also called a unitary divisor) of an integer n is a divisor d of n such that d and n/d are coprime. The easiest way to find the Hall divisors is to write the prime power factorization of the number in question and take any subset of the factors. For example, to find the Hall divisors of 60, its prime power factorization is 2<sup>2</sup> ÃÂ 3 ÃÂ 5, so one takes any product of 3, 2<sup>2</sup> = 4, and 5. Thus, the Hall divisors of 60 are 1, 3, 4, 5, 12, 15, 20, and 60.
A Hall subgroup of G is a subgroup whose order is a Hall divisor of the order of G. In other words, it is a subgroup whose order is coprime to its index.
If ÃÂ is a set of primes, then a Hall ÃÂ-subgroup is a subgroup whose order is a product of primes in ÃÂ, and whose index is not divisible by any primes in ÃÂ.
proved that if G is a finite solvable group and ÃÂ is any set of primes, then G has a Hall ÃÂ-subgroup, and any two Hall are conjugate. Moreover, any subgroup whose order is a product of primes in ÃÂ is contained in some Hall . This result can be thought of as a generalization of Sylow's Theorem to Hall subgroups, but the examples above show that such a generalization is false when the group is not solvable.
The existence of Hall subgroups can be proved by induction on the order of G, using the fact that every finite solvable group has a normal elementary abelian subgroup. More precisely, fix a minimal normal subgroup A, which is either a or a as G is . By induction there is a subgroup H of G containing A such that H/A is a Hall of G/A. If A is a then H is a Hall of G. On the other hand, if A is a , then by the SchurâÂÂZassenhaus theorem A has a complement in H, which is a Hall of G.
Any finite group that has a Hall for every set of primes ÃÂ is solvable. This is a generalization of Burnside's theorem that any group whose order is of the form p<sup>a</sup>q<sup>b</sup> for primes p and q is solvable, because Sylow's theorem implies that all Hall subgroups exist. This does not (at present) give another proof of Burnside's theorem, because Burnside's theorem is used to prove this converse.
A Sylow system is a set of Sylow S<sub>p</sub> for each prime p such that S<sub>p</sub>S<sub>q</sub> = S<sub>q</sub>S<sub>p</sub> for all p and q. If we have a Sylow system, then the subgroup generated by the groups S<sub>p</sub> for p in ÃÂ is a Hall . A more precise version of Hall's theorem says that any solvable group has a Sylow system, and any two Sylow systems are conjugate.
Any normal Hall subgroup H of a finite group G possesses a complement, that is, there is some subgroup K of G that intersects H trivially and such that HK = G (so G is a semidirect product of H and K). This is the SchurâÂÂZassenhaus theorem.