A soluble group is a group whose derived series , terminates at . Equivalently, it has a finite subnormal series with abelian factors. For the reverse implication, if has derived length , then ; if has derived length , then . Iterating this observation through the series proves the equivalence. For a finite group, refining the abelian factors to composition factors says that solubility is equivalent to all composition factors being cyclic of prime order.
Subgroups and quotient groups of soluble groups are soluble, since their derived series lie in, or are images of, the original series. The same calculation proves closure under group extensions. Finite p-groups are nilpotent groups, hence soluble: their nontrivial centers allow induction to construct a central series. Every finite nilpotent group is a direct product of groups of its Sylow subgroups. The converse fails: has the abelian-factor series , but its order-two Sylow subgroups are not normal. The symmetric group is also soluble, with series and abelian factors. A finite soluble group has elementary abelian minimal normal subgroups, by the argument in 1(c). In contrast, a nonabelian simple group is a perfect group and is not soluble.
The Fitting subgroup collects the normal nilpotent structure. For a nontrivial finite soluble group it is nontrivial, since it contains an elementary abelian minimal normal subgroup. Part 1(c) proves , so conjugation embeds in . This shows why controlling a soluble group through normal abelian or nilpotent layers is effective, even when the whole group is not a nilpotent group.
For a set of primes , a Hall subgroup of type has order divisible only by primes in and index divisible only by primes outside . The Hall theorem for soluble groups says that a finite soluble group has such subgroups, any two are conjugate, and every subgroup of -order is contained in one. These assertions generalize the Sylow theorems, which treat a single prime. Here is a proof of all three assertions.
First we need coprime splitting over an elementary abelian normal subgroup. Suppose is an elementary abelian p-group and has order prime to . A section defines an action on and an additive factor set by . Associativity says
Summing over and dividing by in gives , where . Replacing by removes the factor set, giving a complement. Two complements differ by a map satisfying . Averaging over gives , so the complements are conjugate by an element of . This proves both splitting and conjugacy, without assuming that an arbitrary extension splits.
Induct on , taking an elementary abelian minimal normal subgroup of exponent . Choose a quotient Hall subgroup and let be its preimage. If , then itself is a Hall subgroup. If , the preceding splitting argument gives a complement to in , and that complement is a Hall subgroup of .
For conjugacy, the images of two Hall subgroups are quotient Hall subgroups, so induction allows them to have the same image and lie in the same . If , every Hall subgroup contains : its product with is a -subgroup and cannot be larger by the subgroup-order formula. Both are then . If , both are complements to in , so the averaging argument conjugates them.
Finally let be any -subgroup. By induction its image lies in a quotient Hall subgroup, so . If , is already a Hall subgroup containing . Otherwise write . In , both and the inverse image in of the image of are complements to . Complement conjugacy therefore places in a conjugate of . This proves embedding and completes the induction.
Thus existence, conjugacy and containment all hold for every prime set in a finite soluble group. The solubility hypothesis matters: has no Hall subgroup for . Such a subgroup would have index three; its coset action would give a nontrivial group homomorphism , impossible because is a simple group and has order . This example also distinguishes a Hall subgroup from a merely arbitrary subgroup whose order uses the chosen primes.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact