For subgroups , define when . The identity elements show reflexivity, inverses show symmetry, and multiplication shows transitivity. Thus the double cosets partition .
Let act by left multiplication on the set of left cosets . The orbit of consists of the cosets contained in , so its size is . Its stabilizer isThe orbit-stabilizer theorem therefore gives
Suppose is a Sylow subgroup of , with , and write the largest power of dividing as . If every had order at most , the displayed formula would make every double-coset size divisible by . Their sum would then also be divisible by , contradicting the choice of . Hence some has order and is a Sylow -subgroup of . This is the Sylow subgroup of a subgroup from double cosets argument.
To count the general linear group over a finite field , choose its columns successively. There are choices for the first, for the second, and for column . ConsequentlyNone of the factors is divisible by , so the upper unitriangular group is a Sylow -subgroup: it has one arbitrary field entry in each of the positions above the diagonal and hence order . The permutation matrices form a subgroup isomorphic to the symmetric group .
By Cayley theorem, every finite group embeds in , and permutation matrices embed this symmetric group in . The latter has the explicit Sylow -subgroup just described, so the result proved in the first part, applied to the embedded copy of , proves that every finite group has a Sylow -subgroup.
The counting part of the Sylow theorems says that if is the largest power of dividing , then the number of Sylow -subgroups satisfies
Finally, let with prime numbers . The Sylow counts giveso and the Sylow -subgroup is a normal subgroup. Also and . If , both Sylow subgroups are normal; their elements commute, so is their direct product and is abelian. In the nonabelian case one must therefore have , whenceor equivalently , as recorded by nonabelian group of order pq.
Solved by gpt-5.6-sol high.
Codex Wiki