Math 2.0

Group theory and generalizations Finite groups Theorem

Hall's theorem on solvable groups

Builds on Solvable groupHall subgroupPrime numberConjugate subgroupSylow theoremsSchur–Zassenhaus theoremSimple group

Statement

Let GG be a finite solvable group, and let π\pi be a set of prime numbers. A π\pi-subgroup is a subgroup whose order has all its prime factors in π\pi.

  1. GG has a Hall π\pi-subgroup.
  2. Any two Hall π\pi-subgroups of GG are conjugate in GG.
  3. Every π\pi-subgroup of GG is contained in some Hall π\pi-subgroup of GG.

Remarks

The proof is by induction on ∣G∣\abs{G}. A minimal normal subgroup NN of a solvable group is an elementary abelian pp-group. One applies induction to G/NG/N and takes the preimage KK of a Hall π\pi-subgroup of G/NG/N. If p∈πp \in \pi, then KK is a Hall π\pi-subgroup of GG. If p∉πp \notin \pi, then a complement of NN in KK, given by the Schur–Zassenhaus theorem, is one.

Example: G=S3×ℤ/5ℤG = S_3 \times \Z/5\Z of order 3030 is solvable, and S3×{0}S_3 \times \set{0} is a Hall {2,3}\set{2, 3}-subgroup, of order 66 and index 55.

Solvability is necessary. The simple group A5A_5 of order 6060 has no subgroup of order 1515, so it has no Hall {3,5}\set{3, 5}-subgroup. In the simple group PSL2(𝔽7)\mathrm{PSL}_2(\F_7) of order 168168 there are two conjugacy classes of subgroups isomorphic to S4S_4; these are Hall {2,3}\set{2, 3}-subgroups, of index 77, that are not conjugate.

Philip Hall also proved a converse. Let p′p' denote the set of all primes other than pp. If a finite group has a Hall p′p'-subgroup for every prime pp, then it is solvable.

Going deeper

For a student

The theorem extends the Sylow theorems from one prime to sets of primes, but only for solvable groups. Together with the converse, it characterises solvable groups by the existence of Hall subgroups. Hall p′p'-subgroups are also called Sylow complements, since a Hall p′p'-subgroup and a Sylow pp-subgroup together make up the whole order of the group.

Reading path

To understand this page from the ground up, read these 92 pages in order. The foundations come first. The path takes the proof Proof of Lagrange's theorem.

  1. Abelianisation concept
  2. Commutator subgroup concept
  3. Conjugate elements concept
  4. Conjugate subgroup concept
  5. Coprime integers concept
  6. Element definition
  7. Group concept
  8. Group extension concept
  9. Hall subgroup concept
  10. Index of a subgroup concept
  11. Left coset concept
  12. Normal subgroup concept
  13. Normaliser concept
  14. P-group concept
  15. Prime number concept
  16. Proposition concept
  17. Semidirect product concept
  18. Simple group concept
  19. Solvable group concept
  20. Subgroup generated by a subset concept
  21. Sylow p-subgroup concept
  22. Transfer homomorphism concept
  23. Set definition
  24. Conjugate elements definition
  25. Group homomorphism definition
  26. Laws of exponents in a group statement
  27. Order of a group definition
  28. Subgroup definition
  29. Symmetric group definition
  30. Schur–Zassenhaus theorem statement
  31. Focal subgroup theorem statement
  32. Conjunction definition
  33. Disjunction definition
  34. Implication definition
  35. Predicate definition
  36. Empty set object
  37. Family of sets definition
  38. Ordered pair definition
  39. Conjugate subgroup definition
  40. Order of an element definition
  41. Group action definition
  42. Intersection definition
  43. Left coset definition
  44. Product of two subgroups definition
  45. Right coset definition
  46. Subgroup criterion statement
  47. Union definition
  48. Set-builder notation concept
  49. Existential quantifier definition
  50. Universal quantifier definition
  51. Cartesian product definition
  52. Disjoint sets definition
  53. Normal subgroup definition
  54. Normaliser definition
  55. P-group definition
  56. Orbit definition
  57. Stabiliser definition
  58. Index of a subgroup definition
  59. Intersection of subgroups is a subgroup statement
  60. Subset definition
  61. Cosets have the same cardinality as the subgroup statement
  62. Union of a family of sets definition
  63. Normal core definition
  64. Binary relation definition
  65. Sylow p-subgroup definition
  66. Orbits partition the set statement
  67. Transitive action definition
  68. Fixed points of an action definition
  69. Order of a group is the index times the order of the subgroup statement
  70. Partition of a set definition
  71. Reflexive relation definition
  72. Symmetric relation definition
  73. Transitive relation definition
  74. Action on left cosets example
  75. Equivalence relation definition
  76. Orbit-stabiliser theorem statement
  77. Equivalence class definition
  78. Equivalence classes form a partition statement
  79. Proof of Lagrange's theorem proof
  80. Lagrange's theorem statement
  81. Converse of Lagrange's theorem fails for the alternating group A4 counterexample
  82. Size of an orbit times the size of the stabiliser statement
  83. Fixed points of a p-group action statement
  84. Third Sylow theorem statement
  85. Cauchy's theorem statement
  86. First Sylow theorem statement
  87. Second Sylow theorem statement
  88. The number of Sylow subgroups is the index of the normaliser statement
  89. Frattini argument statement
  90. The number of Sylow subgroups divides the index statement
  91. Sylow theorems statement
  92. Hall's theorem on solvable groups statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Hall_subgroup
About this page
Tag8Z8PE69SJS
URIm2://8Z8PE69SJS
Kindstatement, theorem
WritingW0 stub
MSC20D20, 20D10
StatusThis copy of the site has no build data. Run m2 status 8Z8PE69SJS.
AboutHall subgroup, Solvable group
UsesSolvable group, Hall subgroup, Prime number, Conjugate subgroup, Sylow theorems, Schur–Zassenhaus theorem, Simple group
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by