Hall's theorem

From Groupprops
Revision as of 15:46, 20 February 2009 by Vipul (talk | contribs)

Statement

Suppose G is a finite group such that for any subset π of the set of prime divisors of G, G has a π-Hall subgroup. Then, G is a Solvable group (?) (specifically, G is a Finite solvable group (?)).

Related facts

Facts used

  1. Order has only two prime factors implies solvable (this result is popularly called Burnside's paqb theorem).
  2. Three solvable subgroups of pairwise coprime indices implies solvable

Proof

Case that the order has one or two prime factors

If the order has two or fewer prime factors, fact (1) tells us that the group is solvable. (If the order has only one prime factor, the group is in fact nilpotent).

Case that the order has three or more prime factor

We prove this claim by induction on the number of prime factors of the order. Note that the cases of one or two prime factors have already been dealt with.

Suppose the order of G is p1k1p2k2…prkr where pi are distinct primes.

  1. There exist pi-complements for each prime pi: In other words, for each pi, there exists a subgroup Ai whose index is piki. This follows from the assumption that there exist Hall subgroups of all possible orders.
  2. For any subset π of {p1,p2,…,pr}, the intersection of the subgroups Ai with pi∈π, is a π′-Hall subgroup: PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]
  3. Each Ai satisfies the hypothesis of containing Hall subgroups of all possible orders: This follows from step (2).
  4. Ai is solvable for each i: This follows from the induction hypothesis.
  5. G is solvable: This follows from fact (2), and the observation that when r≥3, we have a collection of at least three solvable subgroups of pairwise coprime indices.