Solvable and Nilpotent Groups
Can every polynomial equation be solved by a formula using only radicals? Abel and Galois posed this question sharply. It turns out to be a question about the internal architecture of groups. Galois discovered something key about solvability by radicals. A polynomial is solvable by radicals precisely when a certain group attached to it satisfies a condition. This group, called its Galois group, must have a very specific kind of structure. It can be broken into abelian pieces stacked one on top of another. This structural property, called solvability, is one of the deepest organizing ideas in all of algebra. It makes precise exactly what "abelian-like" means for a group that need not itself be abelian. Nilpotency is a stronger, more rigid version of the same idea. It sits between abelian groups and solvable groups. Every finite abelian group is nilpotent. Every nilpotent group is solvable. Every finite -group is nilpotent. So nilpotent groups form a natural generalization of p-Groups and Their Properties. They still behave almost as predictably. Both notions are detected by canonical chains of subgroups. Solvability uses the derived series; nilpotency uses the (upper/lower) central series. These series measure, in a precise quantitative sense, how far a group is from being commutative. The big picture is that solvability and nilpotency give us a hierarchy of "tameness" for groups: abelian nilpotent solvable all groups. The classic example (and hence ) shows the last inclusion is strict. This is the group-theoretic heart of the Abel–Ruffini theorem. It states that the general quintic has no radical solution. This article builds these series from scratch. It proves the fundamental closure properties (subgroups, quotients, extensions). It proves the key structural characterization of finite nilpotent groups. They are direct products of their Sylow subgroups. It shows exactly how solvability of fails for . By the end you will be able to construct derived and central series for concrete groups. You will be able to prove a group is or is not solvable/nilpotent. You will understand precisely why these definitions are the "correct" measure of commutativity defect. This builds on Composition Series and the Jordan-Holder Theorem and The Alternating Group.
- The derived series uses commutator subgroups; it terminates at iff is solvable.
- The lower central series terminates at iff is nilpotent.
- Nilpotent solvable, but not conversely (e.g. is solvable, not nilpotent).
- Finite nilpotent groups are exactly the direct products of their Sylow -subgroups.
- is simple and non-abelian for , so is not solvable for — the algebraic root of Abel–Ruffini.
- Key idea: solvability and nilpotency quantify "how commutative" a group is via subgroup chains with abelian, resp. central, quotients.
Where this lives today
Solvability is the precise obstruction behind the Abel–Ruffini theorem: the general polynomial of degree has no solution by radicals because its Galois group is (isomorphic to a subgroup containing) , which fails to be solvable since is simple and non-abelian. In finite group theory, the Feit–Thompson theorem (every group of odd order is solvable) was the starting point of the classification of finite simple groups, since it shows every non-solvable finite simple group has even order. Nilpotent Lie groups and Lie algebras are the infinitesimal analogues of nilpotent groups and appear throughout differential geometry and the study of homogeneous spaces; nilpotent Lie groups classify certain left-invariant geometric structures (e.g. the Heisenberg group, the simplest non-abelian nilpotent Lie group, underlies quantum mechanics' canonical commutation relations and sub-Riemannian geometry). In cryptography, understanding the solvable/nilpotent structure of Galois groups and related permutation groups constrains which field-theoretic constructions can be exploited or must be avoided for security. In computer science, solvable groups underlie certain polynomial-time algorithms in computational group theory (many algorithms that are exponential for general finite groups become polynomial for solvable groups, via repeatedly peeling off abelian normal sections), and -groups and nilpotent groups appear in coding theory and in the study of automatic sequences and formal languages via nilpotent monoid/group actions.
Ask the tutor: Can you show me step-by-step how to compute the derived and lower central series for the quaternion group and confirm its nilpotency class?
Let be a group. For the commutator is . For subgroups , let denote the subgroup generated by all commutators with , . The commutator subgroup (or derived subgroup) of is . The derived series of is defined recursively by
is solvable if for some . The lower central series of is defined by
is nilpotent if for some ; the least such is the nilpotency class of . Equivalently, define the upper central series by and (the center of the quotient); is nilpotent iff for some .
Intuition
Think of the commutator subgroup as a machine that extracts all the noncommutativity of in one pass: is abelian (in fact the largest abelian quotient of ), and exactly when itself is abelian. Solvability asks: if we apply this "abelianization" machine repeatedly to what's left over, does the noncommutative residue eventually vanish entirely? A solvable group is one built from abelian groups glued together in finitely many layers — like a tower of abelian extensions. Nilpotency asks a stricter question, using a two-sided notion of commutator with the whole group at every stage rather than with the previous term against itself. The lower central series measures commutators of elements with everything, so it decays more slowly and more uniformly; correspondingly the upper central series builds up the group from its center outward, layer by layer, the way -groups are built (every nontrivial -group has nontrivial center, and iterating this fact is exactly how one shows finite -groups are nilpotent). The picture below shows the containment hierarchy and where the standard example groups sit.
The central theorems
Let be a group and a normal subgroup. 1. is abelian if and only if . 2. is a characteristic (hence normal) subgroup of , and is abelian. 3. If is a surjective homomorphism, then .
(1) Suppose abelian. For , in we have , i.e. , i.e. ; taking inverses (a subgroup is closed under inverses) shows . Since this holds for all generators of and is a subgroup, . Conversely, if , then for any , , so in , i.e. cosets and commute. Since were arbitrary, is abelian.
(2) For any automorphism of and generators of , ; since is a bijection and is generated by such commutators, . Hence is characteristic, and every characteristic subgroup is normal (an inner automorphism is in particular an automorphism). Taking in part (1) with trivially true, is abelian.
(3) Since is a homomorphism, for all , so (the generators of map into generators of , and homomorphic images of generating sets generate the image). Conversely, since is surjective, every generator of (as range over , using surjectivity to write any element of as ) is the image of a generator of , so . Hence .
∎Let be a group. The following are equivalent: (a) is solvable, i.e. for some . (b) There is a chain of subgroups
with each and each quotient abelian. Moreover: (i) If is solvable and , then is solvable. (ii) If is solvable and , then is solvable. (iii) If and both and are solvable, then is solvable.
(a) (b). Take . By Basic commutator facts part (2) applied to , is normal in and is abelian. The chain terminates at by hypothesis.
(b) (a). We show by induction on that . The base case is . Suppose . Since is abelian, part (1) of Basic commutator facts gives . Since , taking commutator subgroups (which is monotone: if then , because commutators of elements of are commutators of elements of ) gives . By induction, , so , proving is solvable.
(i) Subgroups. Let . By monotonicity of the commutator subgroup, if then , and inductively for all (same induction as above, using ). Since for some , , so and is solvable.
(ii) Quotients. Let be the quotient map, which is surjective. By Basic commutator facts part (3), for every — this follows by induction: , and if , then applying part (3) to the surjective homomorphism (surjective since ) gives . If , then , so is solvable.
(iii) Extensions. Suppose is solvable, say , and is solvable, say . By the argument in (ii), , so . Since the derived series is monotone under inclusion (shown in part (i)'s proof: ), we get for all (applying the derived series of , which by definition of the derived series applied iteratively from coincides with ). Taking : , so and is solvable.
∎Let be a group. (a) is nilpotent of class (i.e. ) if and only if , where is the upper central series. (b) Every nilpotent group is solvable. (c) Every finite -group is nilpotent. (d) (Structure theorem) A finite group is nilpotent if and only if is the (internal) direct product of its Sylow subgroups; equivalently, iff every Sylow subgroup of is normal in .
We use throughout the standard facts (from p-Groups and Their Properties) that a nontrivial finite -group has nontrivial center, and (from Composition Series and the Jordan-Holder Theorem background) the Sylow theorems.
(a) Lower and upper central series match up. Claim: for all , implies , and conversely. First, note is a descending chain, each (since for and a generator with , one computes using that is normal — proved by an identical induction to Basic commutator facts(2) — so conjugation permutes the generating commutators of ). We show by induction on : whenever is not quite the cleanest route; instead we directly show the equivalence by simultaneous induction. Direction 1: Suppose . We show has the property that relates to upper series terms; concretely we show by downward induction on (from down to ) that . Base case : . ✓. Inductive step: suppose . We must show . By definition , so it suffices to show that for and , the commutator lies in — because that says and commute in for every , i.e. , i.e. . But such commutators generate exactly , which lies in by the inductive hypothesis. This proves the step. At : , i.e. , so . Direction 2: Suppose . By induction on from to we show . Base case : . ✓. Inductive step: suppose ; since , for any we get (the commutator of an element with something central mod lands back in , by definition of centrality of the coset). Hence , completing the induction. At : ... to avoid a negative index, stop at : , and then applying the same one-step argument once more with gives (since is central), so . Combining both directions proves (a).
(b) Nilpotent solvable. We show for all , by induction. Base case: . Suppose . Then
using and and monotonicity of the commutator bracket in each argument. If is nilpotent, for some , so , i.e. : is solvable.
(c) Finite -groups are nilpotent. Let . We show whenever , which forces the strictly descending chain to reach in at most steps (a strictly decreasing chain of subgroups of a group of order has length at most , since each proper containment of subgroups of a -group drops the order by at least a factor of ). Concretely we use the upper central series instead, which is cleaner: since is a nontrivial finite -group, (standard fact for -groups). Consider ; if nontrivial it is again a -group (a quotient of a -group by a normal subgroup has order a power of ), so it too has nontrivial center, meaning , so . Inductively, as long as , the quotient is a nontrivial finite -group (order , still ), hence has nontrivial center, forcing . Since strictly increases and is bounded by , we must reach for some . By part (a), is nilpotent.
(d) Structure theorem for finite nilpotent groups. Lemma (normalizers grow in nilpotent groups): If is nilpotent and is a proper subgroup, then (i.e. is not self-normalizing). Proof of lemma: Since is nilpotent, and for the nilpotency class . Let be the largest index with ; then and . Pick . For any , since , the coset commutes with in , i.e. . So , hence . Also : from we get (rearranging) — more directly: means , so ... let us just directly verify : for , -type manipulation. Cleanest: means , i.e. for some ; rearranging, , so ... We simplify: from for every , set ; then , so hence (as is finite, this inclusion of equal-order sets is equality, or directly apply the same argument to ranging over ) , i.e. . Since , . This proves the lemma. Now suppose finite nilpotent, and let be a Sylow -subgroup of . We claim . Let . A standard Sylow-theory fact is (the "normalizer of the normalizer" is itself, since is the unique Sylow -subgroup of and any normalizing must send to a Sylow -subgroup of , hence to itself, so ). If , the lemma gives , a contradiction. So , i.e. . So every Sylow subgroup of a finite nilpotent group is normal, giving the "only if" of the second equivalence in (d). Conversely, suppose every Sylow subgroup of is normal. Let be the distinct primes dividing , and the corresponding (unique, since normal Sylow subgroups are unique — any two Sylow -subgroups are conjugate, and a normal subgroup is its own only conjugate) Sylow subgroups. For , since their orders are coprime prime powers (Lagrange: the order of any element of the intersection divides both and , which are coprime). Since each , for () the commutator lies in using normality of both (the first parenthesization shows since by normality of , wait we need — yes since and as ; the second parenthesization shows similarly). So , i.e. elements of distinct Sylow subgroups commute. The map , , is then a homomorphism (using that distinct 's commute elementwise to check directly). It is injective: if , then for each prime , isolating shows lies in the subgroup generated by the other (pairwise commuting, coprime-order) 's, whose order is coprime to ; since has order a power of , and also order dividing that coprime number, . It is surjective since by Sylow's theorem (the order of factors as the product of the orders of its Sylow subgroups), and an injective map between finite sets of equal size is a bijection. So . Finally, each finite -group is nilpotent by (c), and a finite direct product of nilpotent groups is nilpotent (one checks directly that by induction on , since commutators in a direct product are computed coordinatewise; hence if each , taking gives ). So is nilpotent. This completes (d).
∎Worked examples
Example 1: is solvable but not nilpotent. Consider , . Recall the normal subgroups (index 2, hence normal) and the Klein four group (normal in , indeed normal in since it is a union of conjugacy classes of — conjugating a product of two disjoint transpositions by any permutation gives another product of two disjoint transpositions, and consists of exactly all such elements together with ). We compute the derived series directly:
because is abelian, so by Basic commutator facts(1); and because is generated by 3-cycles, and any 3-cycle is itself a commutator of transpositions in (direct computation: with , ... let's verify concretely with : , , , . Compute acting right-to-left on points: apply first, then , then , then . Track : ; ; ; . So . Track : ; ; ; . So . Track : ; ; ; . So . Net permutation: , which is , a 3-cycle. So indeed .) Hence , giving . Next,
since is abelian (order ), so ; and since is non-abelian, and is normal in of order dividing (as ) and it must be a nontrivial normal subgroup, and the only nontrivial proper normal subgroup of is itself (a standard fact about ), so . Then since is abelian. So the derived series is
terminating at step 3: is solvable. However is not nilpotent: by The Alternating Group background and Sylow theory, the Sylow -subgroups of have order (dihedral of order 8, e.g. generated by and ) and there are of them (they are not normal — one checks conjugates one Sylow 2-subgroup to a different one). Since not every Sylow subgroup of is normal, part (d) of the Structure theorem (Sylow characterization) shows is not nilpotent. This illustrates that the containment nilpotent solvable is strict.
Example 2: The dihedral group of order 12 (symmetries of a hexagon) is nilpotent — computed via both series. Let , order 12. We compute the center. An element commutes with iff , i.e. , i.e. , i.e. , i.e. . So among rotations, only and (rotation by ) centralize ; and rotations always commute with each other, and a reflection is central only if it commutes with , forcing (by a similar computation) , false since has order 6, so no reflection is central. Hence
Now consider , of order 6. One checks this quotient is isomorphic to (equivalently ): the images has order 3 (since ), has order 2, and (as has order 3 > 2), so this quotient is non-abelian of order 6, hence . Since (the center of is trivial, as is standard: non-abelian of order 6 has trivial center since a nontrivial central element would force cyclic hence abelian, contradiction), we get , i.e. . The upper central series stabilizes at , so is not nilpotent (by part (a) of the theorem, nilpotency would require the upper series to reach all of ). This is a cautionary computation: , despite looking similar to the nilpotent quaternion-type or -group examples, fails nilpotency because its "reduced" quotient has trivial center and thus permanently kills further growth. (One can check independently: 's Sylow 2-subgroups have order 4 and there are 3 of them, permuted transitively by conjugation by , hence not normal — consistent with non-nilpotency via the Sylow criterion.) By contrast is solvable: (index 4 abelian quotient, and one checks -type commutators generate exactly the order-3 rotation subgroup), and since is abelian, giving derived series of length 2.
The structure theorem (d) — " nilpotent iff is the direct product of its Sylow subgroups" — is stated for finite groups, and genuinely requires finiteness: infinite nilpotent groups need not decompose this way, and "Sylow subgroup" is not even the right invariant. Consider , the infinite cyclic group under addition. It is abelian, hence trivially nilpotent (class : ). But has no elements of finite order aside from , so it has no nontrivial finite -subgroups at all, let alone Sylow subgroups in any useful decomposition sense; there is no way to write as a product of "-primary parts" the way finite abelian groups decompose via the Fundamental Theorem of Finite Abelian Groups-type structure. The entire proof of part (d) relied essentially on finiteness: the existence of Sylow subgroups (a finite-group theorem), the counting argument , and the normalizer-growth lemma's use of a maximal chain-index argument bounded by . This shows the finiteness hypothesis in the structure theorem cannot be dropped: dropping it, the clean equivalence between "nilpotent" and "product of Sylow-type pieces" simply has no content, since the objects (Sylow subgroups) may fail to exist or fail to control the group's structure.
Scope, edge cases & common traps
| Situation | Solvable? | Nilpotent? | Why |
|---|---|---|---|
| Abelian group | Yes | Yes (class ) | and immediately |
| Finite -group | Yes | Yes | Theorem (c) |
| Yes | No | , upper series stalls at step 0 | |
| Yes (class-3 derived series) | No | not all Sylows normal | |
| No | No | simple non-abelian for | |
| No | No | simple, non-abelian forever | |
| Infinite group, e.g. free group | No | No | and in fact derived series never terminates |
The mathematician behind it
Origins · 1 minÉvariste Galois and how this was discovered
Galois, working in France in the early 1830s, discovered that whether a polynomial equation is solvable by radicals is governed by whether a certain permutation group associated to the equation has an abelian composition series — precisely the property later formalized as solvability. His ideas, submitted to the Paris Academy and largely unrecognized in his lifetime, were only properly disseminated after his death in a duel at age 20; Camille Jordan's 1870 treatise "Traité des substitutions" gave the first systematic account, and the modern group-theoretic vocabulary of derived series and solvable groups crystallized through the work of Jordan, Hölder, and later Philip Hall (who developed much of the theory of solvable and nilpotent finite groups in the 1930s).
What is the difference between the derived series and the lower central series?
The derived series takes successive commutator subgroups of the previous term with itself: . The lower central series instead commutes the previous term with the whole original group: . Because always, the lower central series descends at least as slowly, and in fact one can show for all (used in the proof that nilpotent implies solvable). This is exactly why nilpotency is the stronger property: it demands the commutators die out even when measured against the entire group at every stage, not just against a shrinking subgroup.
Is every solvable group nilpotent?
No. is the standard counterexample: its derived series is (length 2, so solvable), but its center is trivial, so the upper central series stalls immediately at and never reaches , meaning is not nilpotent. More generally, any non-abelian group with trivial center that is nonetheless built from abelian layers (like all dihedral groups with having an odd prime factor) tends to be solvable without being nilpotent. Nilpotency is strictly stronger.
How does solvability relate to the Abel–Ruffini theorem about the quintic?
Galois theory establishes that a polynomial over a field of characteristic zero is solvable by radicals if and only if its Galois group (the group of automorphisms of its splitting field fixing the base field) is a solvable group. For a "generic" polynomial of degree , the Galois group is the full symmetric group . For , is not solvable because its derived series stabilizes at , which is simple and non-abelian, so it can never reduce further. This is precisely why no general radical formula exists for degree-5 (or higher) polynomials, while the familiar quadratic, cubic, and quartic formulas exist because are all solvable.
Do all finite groups of prime-power order automatically satisfy both properties?
Yes. Every finite -group is nilpotent (proved via the fact that a nontrivial finite -group has nontrivial center, applied repeatedly to build up the upper central series), and nilpotent groups are always solvable (proved via the inequality ). So finite -groups sit at the very tame end of the hierarchy: abelian groups are the tamest, -groups (and more generally nilpotent groups) are next, and general solvable groups are the broadest tame class before one reaches groups like that admit no such decomposition at all.
Can an infinite group be solvable or nilpotent, and does the Sylow-based structure theorem still apply?
Solvability and nilpotency are defined purely in terms of the derived or central series terminating, which makes sense for any group, finite or infinite; for instance, the infinite dihedral group and all finitely generated abelian groups are nilpotent (even abelian, class ), and many infinite matrix groups (e.g. upper triangular unipotent matrices over any field) are nilpotent of higher class. However, the structure theorem identifying finite nilpotent groups with direct products of Sylow subgroups is a genuinely finite-group statement — Sylow subgroups are only guaranteed to exist for finite groups, so the theorem's proof and even its statement do not carry over to infinite groups without substantial reformulation.
Is there a quick test to check if a small finite group is solvable without computing the whole derived series?
A useful shortcut, valid because of the theorem that solvability passes to extensions (part (iii)), is to find any chain of normal subgroups with abelian successive quotients — you don't need the specific derived series, just some abelian tower, since if such a chain exists at all then is solvable (this is exactly criterion (b) in the theorem, shown equivalent to (a)). For instance, to check is solvable, exhibit with both and abelian — done, no need to compute explicitly. Conversely, to prove non-solvability, the cleanest route for , or any group containing a simple non-abelian subgroup as its own derived subgroup, is to show the derived series stabilizes at a nontrivial simple non-abelian group and can never move past it.
Why does nilpotency fail to be inherited by extensions, when solvability is?
The proof that solvability is closed under extensions uses that the derived series of eventually drops into and then continues descending inside 's own derived series, which terminates because is solvable — this argument only needs 's derived series to terminate, not any comparison with the "whole group" at each stage. Nilpotency's central series, by contrast, is defined using commutators with the entire group at every step (), so even if and both have central series that terminate, the presence of elements outside acting on can prevent from ever collapsing to — exactly what happens in , built from the abelian (hence nilpotent) pieces and .