Executive summary
Solubility is the group property that ultimately connects algebraic formulae with root permutations. Starting from a group, repeatedly take its derived subgroup: the subgroup generated by all commutators. If this sequence reaches the identity after finitely many steps, the group is soluble. Equivalently, the group can be built through finitely many layers whose successive quotients are commutative. This layered viewpoint is more informative than the definition alone because radical extraction introduces cyclic, hence commutative, branching layers. The source proves that solubility is preserved under subgroups, surjective images, quotients and direct products, and that an extension is soluble when both its normal subgroup and quotient are soluble.
What this handbook page teaches
- Construct the derived series of a group.
- Recognise equivalent descriptions of solubility using commutative quotient layers.
- Apply closure properties under subgroups, quotients, images and direct products.
- Use extension logic: a soluble normal subgroup plus a soluble quotient yields a soluble whole group.
- Explain why solubility is the right group invariant for finite radical constructions.
Core concepts
The recurring method is to replace the physical meaning of the objects by the rules governing how they combine.
Derived-series definition
Let G^(0)=G and G^(k+1)=[G^(k),G^(k)], where the bracket denotes the derived subgroup generated by commutators. If G^(m)={e} for some finite m, the group is soluble. Every commutative group is soluble immediately because its first derived subgroup is the identity.
A group whose derived subgroup is commutative is also soluble: one step reaches a commutative group and the next reaches the identity. The number of steps gives a coarse measure of how many layers of non-commutativity remain.
Equivalent layered description
Because the quotient of any group by its derived subgroup is commutative, a soluble derived series yields a chain of normal subgroups with commutative successive quotients. Conversely, if such a finite chain exists, the derived subgroup at each level is forced into the next layer, and repeated derivation eventually reaches the identity.
This equivalence explains the word 'soluble' in the source's context: a complicated structure can be decomposed through successive commutative extensions, matching the way radical operations add controlled cyclic layers.
Closure and extension properties
Subgroups of soluble groups are soluble because their derived subgroups sit inside the corresponding derived subgroups of the ambient group. Surjective homomorphic images and quotients of soluble groups are soluble because commutators map to commutators and cannot create new derived complexity.
Direct products of soluble groups are soluble component-wise. Most importantly, if N is a normal soluble subgroup and G/N is soluble, then G is soluble. This extension property is the key step when a root extraction creates cyclic permutations inside each pack of sheets while a pre-existing soluble group controls movement between packs.
Working method
Use the following sequence as a repeatable analysis workflow. The steps are ordered to separate definitions and admissibility checks from structural conclusions, so a result can be audited without relying on intuition or an unverified diagram.
- Start by asking whether the group is already commutative. If yes, the derived series terminates after one commutator step.
- If not, identify or bound the derived subgroup. Use known commutator calculations, normal subgroups, or the fact that a commutative quotient must contain the derived subgroup in its kernel.
- Repeat inside the derived subgroup until the identity is reached or a stable non-trivial derived subgroup appears.
- For structural proofs, replace explicit calculations with a chain of normal subgroups whose successive quotients are commutative.
- Use permanence rules: pass solubility to subgroups, quotients and surjective images; combine soluble factors by direct products.
- For an extension, establish solubility of both the normal kernel-like part and the quotient, then conclude solubility of the whole group.
Why a root-extraction extension remains soluble
Imagine a multi-valued function whose existing branch permutations form a soluble group F. Form a new function by taking an nth root of its values. Each old sheet becomes a pack of n new sheets. A branch loop can move one pack to another according to F, and it can also cyclically permute sheets inside the packs.
There is a natural surjective map from the new permutation group H onto F that forgets which sheet inside a pack is occupied. Its kernel consists of compatible cyclic shifts within the packs, and the source shows this kernel is commutative. Thus both the kernel and quotient are soluble.
By the extension property, H is soluble. Repeating this reasoning over a finite radical expression proves that the final monodromy group remains soluble. The group theory developed here is therefore not ancillary: it supplies the exact induction principle for radical constructions.
Technical reasoning and deeper connections
Solubility is weaker than commutativity. A non-commutative group may still be soluble if its non-commutativity disappears after finitely many derived steps. This distinction is essential because radical constructions can produce non-commutative combinations while remaining soluble overall.
A group with no non-trivial proper normal subgroups and which is non-commutative cannot be soluble. Its derived subgroup is normal and non-trivial, so it must equal the whole group; the derived series then never shrinks. The source uses this idea with a sixty-element rotation group and with the even permutations of five symbols.
The full five-symbol permutation group is not soluble because it contains a non-soluble subgroup. Since every subgroup of a soluble group would have to be soluble, the existence of one non-soluble subgroup is enough to rule out solubility of the full group.
The extension criterion is the conceptual centre of the radical argument. It turns a potentially complicated branch construction into two manageable questions: what happens between packs of sheets, and what happens inside each pack? If both levels are soluble, their combination is soluble.
Quick-reference matrix
| Operation or relation | Solubility behaviour | Reason used later |
|---|---|---|
| Subgroup of soluble group | Remains soluble | Derived series is contained level by level. |
| Surjective image | Remains soluble | Commutators map to commutators. |
| Quotient | Remains soluble | A quotient is a surjective image. |
| Direct product | Soluble if factors are | Derived series works component-wise. |
Extension 1→N→G→Q→1 | Soluble if N and Q are | Combines commutative layers. |
| Non-soluble subgroup present | Ambient group non-soluble | Contrapositive of subgroup permanence. |
Common mistakes
- Equating soluble with commutative.
- Assuming a group is soluble simply because it has many commutative subgroups.
- Using an arbitrary subgroup chain; the normality and commutative-quotient conditions matter.
- Assuming quotient solubility implies group solubility without also controlling the kernel or normal subgroup.
- Trying to prove non-solubility only by exhibiting a non-commuting pair.
- Failing to separate the finite number of construction steps in a radical expression from an infinite process.
Verification checklist
Before accepting a solution or proof, confirm each item below. These checks are intentionally practical: they catch the most common category errors, missing hypotheses and structure mismatches.
- Derived subgroup definition is consistent throughout the calculation.
- Normality is stated for every subgroup used in a quotient chain.
- Successive quotients claimed commutative are actually checked.
- Closure properties are used in the correct direction.
- Extension proofs establish both kernel and quotient solubility.
- Non-solubility arguments rule out termination of the derived series, not merely commutativity.
Frequently asked questions
Is every finite group soluble?
No. Degree five supplies the first full symmetric-group example relevant here that is not soluble.
Is every commutative group soluble?
Yes. Its derived subgroup is the identity.
Can a non-commutative group be soluble?
Yes. Solubility requires non-commutativity to disappear after finitely many derived steps, not immediately.
Why does this property matter for formulas?
The branch group of a finite radical expression is built by operations and extensions that preserve solubility, so any target with non-soluble monodromy cannot have such a representation.
Source basis: this page is a handbook-style synthesis of the uploaded mathematics source, principally sections 1.14. It paraphrases the supplied material and does not reproduce source artwork or long source passages. Historical names, publisher details and personal details have been intentionally omitted.