A Hall subgroup for a set of primes is a subgroup such that every prime divisor of belongs to , while no prime divisor of belongs to . Equivalently , the product of the full prime powers in belonging to .
The Hall conjugacy and embedding in finite soluble groups theorem says that, for every , a finite soluble group has a Hall -subgroup, any two such subgroups are conjugate, and every -subgroup is contained in one. We prove all three assertions together by induction, including the needed complement argument rather than assuming it.
First establish coprime splitting over an elementary abelian normal subgroup. Suppose is an elementary Abelian -group and has order prime to . Write additively. Conjugation defines a well-defined action of on because is Abelian. Choose a section , with , and let its extension cocycle be defined by . Associativity gives
Sum over . With this becomes
Multiplication by is invertible on , so setting gives . The new section has zero cocycle and is a homomorphism. Its image is a complement to , proving .
Every other complement has the form , with . Summing this identity over and putting gives . Hence , where , and the other complement is . The same argument applies on any subgroup : a subgroup intersecting trivially is a graph of such a one-cocycle over its image , so conjugation by an element of carries it into . This proves the complement-conjugacy and embedding assertions needed below.
Now let be finite soluble, and choose a minimal normal subgroup . It is elementary Abelian of some prime characteristic , by the minimal-normal argument in the series discussion. Induction gives Hall subgroups and the embedding and conjugacy assertions in . Let be a Hall -subgroup there and its full preimage.
If , then itself is a Hall -subgroup of . Every Hall -subgroup contains , since is a -subgroup and already has the largest possible -order. Thus is the full preimage of its image in , and quotient conjugacy lifts to conjugacy in . Given any -subgroup , induction puts its quotient image into some , whose preimage contains .
If , then has order prime to . The complement construction produces of order , hence a Hall subgroup of . Any Hall subgroup has trivial intersection with and a Hall image in . Conjugating two Hall subgroups first aligns these images, after which both are complements to in the same ; the complement-conjugacy argument then conjugates them by an element of . For an arbitrary -subgroup , quotient induction puts its image into some . Then and , so the embedding argument conjugates into the chosen complement . Equivalently lies in a conjugate of . This completes the induction and all three parts of the Hall theorem for soluble groups.
For the specific general linear group over a finite field, counting ordered bases gives
There are seven lines and seven planes in . The group is transitive on each family, so line and plane stabilizers both have order and index seven. To show that these exhaust the index-seven subgroups, let have order . It contains a Sylow -subgroup of order eight, which can be conjugated to
The group orbits of on the seven nonzero vectors are
of sizes . An -orbit is a union of these. The group cannot be transitive on seven points, since seven does not divide . Therefore it has an orbit of size at most three. A size-one orbit fixes . A size-two orbit must be , whose vector sum is consequently fixed. A size-three orbit must be the union of the first two -orbits, the nonzero part of the plane , so that plane is invariant. In every case lies in a line or plane stabilizer, and equality follows from their equal orders.
The two stabilizer families are not conjugate. A line stabilizer fixes its nonzero vector and is transitive on the other six nonzero vectors: extend that fixed vector and either chosen other vector to a basis, and map one such basis to the other. Thus it has no invariant three-element subset of nonzero vectors and fixes no plane. In contrast a plane stabilizer fixes its defining plane. Conjugation sends line stabilizers to line stabilizers, so cannot send one to a plane stabilizer. We obtain
They are Hall subgroups for but are not conjugate. This explicitly shows why the solubility hypothesis of the Hall theorem for soluble groups matters.
Finally, an index-three subgroup would give a nontrivial transitive coset homomorphism . Its kernel is normal; the permitted simplicity of forces that kernel to be trivial, because the action is nontrivial. But an injective map from a group of order into one of order six is impossible. Hence has no subgroup of index three.
The Hall theorem for soluble groups says that for every prime set , a finite soluble group has Hall -subgroups; they are all conjugate, and every -subgroup is contained in one. A Hall -subgroup has only primes in in its order and no primes in in its index.
For a proof outline, induct on the group order and choose a minimal normal subgroup . In a finite soluble group this is elementary abelian of some characteristic : its derived subgroup is characteristic and solvability forces it to be trivial; primary components and the subgroup of elements of order dividing are then characteristic, so minimality gives an elementary abelian p-group. Choose a Hall -subgroup of and let be its preimage. If , is itself a Hall -subgroup. If , has order prime to and coprime splitting over an elementary abelian normal subgroup supplies a complement to in , of the required Hall order.
Here the complement fact has a short averaging proof. Choose a section of and write its multiplication defect as , in additive notation. Associativity gives
Since is invertible on , averaging over expresses the defect as ; adjusting the section by gives a homomorphic section. Two such complements differ by . Averaging this identity gives , so they are conjugate by . Inductive conjugacy in the quotient followed by this complement conjugacy proves Hall conjugacy. To embed an arbitrary -subgroup , first put its quotient inside the chosen quotient Hall subgroup. In the coprime case and the corresponding subgroup of a complement are both complements to inside , hence are -conjugate. In the other case directly. This proves Hall conjugacy and embedding in finite soluble groups as well as existence.
Now prove the assertion about maximal subgroups by induction on . Suppose a nontrivial normal subgroup is contained in . If , maximality gives , and since this gives . If , both and are maximal in ; induction yields either their product equal to or their conjugacy, lifting respectively to or to conjugacy of . The same applies with their roles reversed.
It remains to suppose that no nontrivial normal subgroup of lies in either maximum. Let be minimal normal, an elementary abelian p-group. Since lies in neither maximum, . The intersection is normalized by and by the abelian group , hence by ; it is therefore trivial. Likewise . Thus both and complement . Their action on is irreducible, since an invariant subspace would be a proper nontrivial normal subgroup of . It is also faithful: is normalized by and centralized by , so is a normal subgroup of contained in and must be trivial.
If , these assumptions force and to have prime order. Otherwise choose normal in with minimal normal in . It is an elementary abelian r-group. Under , its copy is a nontrivial normal subgroup of . The prime differs from : a p-group acting on the characteristic-p vector space has nonzero fixed points, by counting its orbits on modulo . Its fixed subspace would be -invariant, hence all of by irreducibility, contrary to faithfulness of .
Therefore and are Sylow r-subgroups of . They are conjugate in . Conjugate so that these intersections coincide as . Since , . It cannot equal , since would then be a nontrivial normal subgroup contained in . Maximality gives , and the same argument gives . The conjugated maxima are equal. Hence
This is the factorization-or-conjugacy property of maximal subgroups of a finite soluble group.