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 pp-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 ⊊\subsetneq nilpotent ⊊\subsetneq solvable ⊊\subsetneq all groups. The classic example A5A_5 (and hence S5S_5) 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 SnS_n fails for n≥5n \ge 5. 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.

Key takeaways
  • The derived series G=G(0)▹G(1)▹⋯G = G^{(0)} \triangleright G^{(1)} \triangleright \cdots uses commutator subgroups; it terminates at {e}\{e\} iff GG is solvable.
  • The lower central series G=γ1(G)▹γ2(G)▹⋯G = \gamma_1(G) \triangleright \gamma_2(G) \triangleright \cdots terminates at {e}\{e\} iff GG is nilpotent.
  • Nilpotent   ⟹  \implies solvable, but not conversely (e.g. S3S_3 is solvable, not nilpotent).
  • Finite nilpotent groups are exactly the direct products of their Sylow pp-subgroups.
  • AnA_n is simple and non-abelian for n≥5n \ge 5, so SnS_n is not solvable for n≥5n \ge 5 — 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 ≥5\ge 5 has no solution by radicals because its Galois group is (isomorphic to a subgroup containing) S5S_5, which fails to be solvable since A5A_5 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 pp-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 Q8Q_8 and confirm its nilpotency class?

DefinitionDerived series, solvable groups, central series, nilpotent groups

Let GG be a group. For x,y∈Gx, y \in G the commutator is [x,y]=x−1y−1xy[x,y] = x^{-1}y^{-1}xy. For subgroups H,K≤GH, K \le G, let [H,K][H,K] denote the subgroup generated by all commutators [h,k][h,k] with h∈Hh \in H, k∈Kk \in K. The commutator subgroup (or derived subgroup) of GG is G′=[G,G]G' = [G,G]. The derived series of GG is defined recursively by

G(0)=G,G(i+1)=[G(i),G(i)]=(G(i))′.G^{(0)} = G, \qquad G^{(i+1)} = [G^{(i)}, G^{(i)}] = (G^{(i)})'.

GG is solvable if G(n)={e}G^{(n)} = \{e\} for some n≥0n \ge 0. The lower central series of GG is defined by

γ1(G)=G,γi+1(G)=[G,γi(G)].\gamma_1(G) = G, \qquad \gamma_{i+1}(G) = [G, \gamma_i(G)].

GG is nilpotent if γc+1(G)={e}\gamma_{c+1}(G) = \{e\} for some c≥0c \ge 0; the least such cc is the nilpotency class of GG. Equivalently, define the upper central series by Z0(G)={e}Z_0(G) = \{e\} and Zi+1(G)/Zi(G)=Z(G/Zi(G))Z_{i+1}(G)/Z_i(G) = Z(G/Z_i(G)) (the center of the quotient); GG is nilpotent iff Zc(G)=GZ_c(G) = G for some cc.

Intuition

Think of the commutator subgroup G′G' as a machine that extracts all the noncommutativity of GG in one pass: G/G′G/G' is abelian (in fact the largest abelian quotient of GG), and G′={e}G' = \{e\} exactly when GG 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 GG 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 pp-groups are built (every nontrivial pp-group has nontrivial center, and iterating this fact is exactly how one shows finite pp-groups are nilpotent). The picture below shows the containment hierarchy and where the standard example groups sit.

Figure
Hierarchy of group classes, with example groups placed by inclusion
All groups Solvable e.g. S₃, S₄, D₈ Nilpotent e.g. Q₈, all p-groups Abelian e.g. ℤ/6ℤ trivial group {e} S₅, A₅ (not solvable)

The central theorems

LemmaBasic commutator facts

Let GG be a group and H⊴GH \trianglelefteq G a normal subgroup. 1. G/HG/H is abelian if and only if G′≤HG' \le H. 2. G′G' is a characteristic (hence normal) subgroup of GG, and G/G′G/G' is abelian. 3. If φ:G→K\varphi: G \to K is a surjective homomorphism, then φ(G′)=K′\varphi(G') = K'.

Proof

(1) Suppose G/HG/H abelian. For x,y∈Gx,y \in G, in G/HG/H we have xH⋅yH=yH⋅xHxH \cdot yH = yH \cdot xH, i.e. xyH=yxHxyH = yxH, i.e. (xy)−1(yx)=y−1x−1yx∈H(xy)^{-1}(yx) = y^{-1}x^{-1}yx \in H; taking inverses (a subgroup is closed under inverses) shows x−1y−1xy=[x,y]∈Hx^{-1}y^{-1}xy = [x,y] \in H. Since this holds for all generators of G′G' and HH is a subgroup, G′≤HG' \le H. Conversely, if G′≤HG' \le H, then for any x,y∈Gx,y \in G, [x,y]∈H[x,y] \in H, so xyH=yxHxyH = yxH in G/HG/H, i.e. cosets xHxH and yHyH commute. Since x,yx,y were arbitrary, G/HG/H is abelian.

(2) For any automorphism φ\varphi of GG and generators [x,y][x,y] of G′G', φ([x,y])=[φ(x),φ(y)]∈G′\varphi([x,y]) = [\varphi(x), \varphi(y)] \in G'; since φ\varphi is a bijection and G′G' is generated by such commutators, φ(G′)=G′\varphi(G') = G'. Hence G′G' is characteristic, and every characteristic subgroup is normal (an inner automorphism is in particular an automorphism). Taking H=G′H = G' in part (1) with G′≤G′G' \le G' trivially true, G/G′G/G' is abelian.

(3) Since φ\varphi is a homomorphism, φ([x,y])=[φ(x),φ(y)]\varphi([x,y]) = [\varphi(x),\varphi(y)] for all x,y∈Gx,y \in G, so φ(G′)≤K′\varphi(G') \le K' (the generators of G′G' map into generators of K′K', and homomorphic images of generating sets generate the image). Conversely, since φ\varphi is surjective, every generator [φ(x),φ(y)][\varphi(x),\varphi(y)] of K′K' (as x,yx,y range over GG, using surjectivity to write any element of KK as φ(x)\varphi(x)) is the image φ([x,y])\varphi([x,y]) of a generator of G′G', so K′≤φ(G′)K' \le \varphi(G'). Hence φ(G′)=K′\varphi(G') = K'. ■\blacksquare

∎
TheoremCharacterizations and closure properties of solvable groups

Let GG be a group. The following are equivalent: (a) GG is solvable, i.e. G(n)={e}G^{(n)} = \{e\} for some nn. (b) There is a chain of subgroups

G=G0▹G1▹⋯▹Gn={e}G = G_0 \triangleright G_1 \triangleright \cdots \triangleright G_n = \{e\}

with each Gi+1⊴GiG_{i+1} \trianglelefteq G_i and each quotient Gi/Gi+1G_i/G_{i+1} abelian. Moreover: (i) If GG is solvable and H≤GH \le G, then HH is solvable. (ii) If GG is solvable and N⊴GN \trianglelefteq G, then G/NG/N is solvable. (iii) If N⊴GN \trianglelefteq G and both NN and G/NG/N are solvable, then GG is solvable.

Proof

(a) ⇒\Rightarrow (b). Take Gi=G(i)G_i = G^{(i)}. By Basic commutator facts part (2) applied to GiG_i, Gi+1=Gi′G_{i+1} = G_i' is normal in GiG_i and Gi/Gi+1G_i/G_{i+1} is abelian. The chain terminates at {e}\{e\} by hypothesis.

(b) ⇒\Rightarrow (a). We show by induction on ii that G(i)≤GiG^{(i)} \le G_i. The base case i=0i=0 is G(0)=G=G0G^{(0)} = G = G_0. Suppose G(i)≤GiG^{(i)} \le G_i. Since Gi/Gi+1G_i/G_{i+1} is abelian, part (1) of Basic commutator facts gives Gi′≤Gi+1G_i' \le G_{i+1}. Since G(i)≤GiG^{(i)} \le G_i, taking commutator subgroups (which is monotone: if A≤BA \le B then A′≤B′A' \le B', because commutators of elements of AA are commutators of elements of BB) gives G(i+1)=(G(i))′≤Gi′≤Gi+1G^{(i+1)} = (G^{(i)})' \le G_i' \le G_{i+1}. By induction, G(n)≤Gn={e}G^{(n)} \le G_n = \{e\}, so G(n)={e}G^{(n)} = \{e\}, proving GG is solvable.

(i) Subgroups. Let H≤GH \le G. By monotonicity of the commutator subgroup, if H≤GH \le G then H′≤G′H' \le G', and inductively H(i)≤G(i)H^{(i)} \le G^{(i)} for all ii (same induction as above, using H(i)≤G(i)⇒H(i+1)=(H(i))′≤(G(i))′=G(i+1)H^{(i)} \le G^{(i)} \Rightarrow H^{(i+1)} = (H^{(i)})' \le (G^{(i)})' = G^{(i+1)}). Since G(n)={e}G^{(n)} = \{e\} for some nn, H(n)≤{e}H^{(n)} \le \{e\}, so H(n)={e}H^{(n)} = \{e\} and HH is solvable.

(ii) Quotients. Let π:G→G/N\pi: G \to G/N be the quotient map, which is surjective. By Basic commutator facts part (3), π(G(i))=(G/N)(i)\pi(G^{(i)}) = (G/N)^{(i)} for every ii — this follows by induction: π(G(0))=π(G)=G/N=(G/N)(0)\pi(G^{(0)}) = \pi(G) = G/N = (G/N)^{(0)}, and if π(G(i))=(G/N)(i)\pi(G^{(i)}) = (G/N)^{(i)}, then applying part (3) to the surjective homomorphism π∣G(i):G(i)→(G/N)(i)\pi|_{G^{(i)}}: G^{(i)} \to (G/N)^{(i)} (surjective since π(G(i))=(G/N)(i)\pi(G^{(i)}) = (G/N)^{(i)}) gives π(G(i+1))=π((G(i))′)=((G/N)(i))′=(G/N)(i+1)\pi(G^{(i+1)}) = \pi((G^{(i)})') = ((G/N)^{(i)})' = (G/N)^{(i+1)}. If G(n)={e}G^{(n)} = \{e\}, then (G/N)(n)=π(G(n))=π({e})={e}(G/N)^{(n)} = \pi(G^{(n)}) = \pi(\{e\}) = \{e\}, so G/NG/N is solvable.

(iii) Extensions. Suppose NN is solvable, say N(m)={e}N^{(m)} = \{e\}, and G/NG/N is solvable, say (G/N)(k)={e}(G/N)^{(k)} = \{e\}. By the argument in (ii), π(G(k))=(G/N)(k)={e}\pi(G^{(k)}) = (G/N)^{(k)} = \{e\}, so G(k)≤ker⁡π=NG^{(k)} \le \ker \pi = N. Since the derived series is monotone under inclusion (shown in part (i)'s proof: A≤B⇒A(i)≤B(i)A \le B \Rightarrow A^{(i)} \le B^{(i)}), we get G(k+i)=(G(k))(i)≤N(i)G^{(k+i)} = (G^{(k)})^{(i)} \le N^{(i)} for all i≥0i \ge 0 (applying the derived series of G(k)G^{(k)}, which by definition of the derived series applied iteratively from G(k)G^{(k)} coincides with (G(k))(i)=G(k+i)(G^{(k)})^{(i)} = G^{(k+i)}). Taking i=mi = m: G(k+m)≤N(m)={e}G^{(k+m)} \le N^{(m)} = \{e\}, so G(k+m)={e}G^{(k+m)} = \{e\} and GG is solvable. ■\blacksquare

∎
TheoremNilpotent groups: central series and the Sylow decomposition

Let GG be a group. (a) GG is nilpotent of class ≤c\le c (i.e. γc+1(G)={e}\gamma_{c+1}(G) = \{e\}) if and only if Zc(G)=GZ_c(G) = G, where Zi(G)Z_i(G) is the upper central series. (b) Every nilpotent group is solvable. (c) Every finite pp-group is nilpotent. (d) (Structure theorem) A finite group GG is nilpotent if and only if GG is the (internal) direct product of its Sylow subgroups; equivalently, iff every Sylow subgroup of GG is normal in GG.

Proof

We use throughout the standard facts (from p-Groups and Their Properties) that a nontrivial finite pp-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 i≥0i \ge 0, γi+1(G)={e}\gamma_{i+1}(G) = \{e\} implies Zi(G)=GZ_i(G) = G, and conversely. First, note γ1(G)=G⊇γ2(G)⊇⋯\gamma_1(G) = G \supseteq \gamma_2(G) \supseteq \cdots is a descending chain, each γi+1(G)=[G,γi(G)]⊴G\gamma_{i+1}(G) = [G,\gamma_i(G)] \trianglelefteq G (since for g∈Gg \in G and a generator [x,y][x,y] with x∈G,y∈γi(G)x \in G, y \in \gamma_i(G), one computes g[x,y]g−1=[gxg−1,gyg−1]g[x,y]g^{-1} = [gxg^{-1}, gyg^{-1}] using that γi(G)\gamma_i(G) is normal — proved by an identical induction to Basic commutator facts(2) — so conjugation permutes the generating commutators of γi+1(G)\gamma_{i+1}(G)). We show by induction on ii: γi+1(G)≤Zj(G)\gamma_{i+1}(G) \le Z_j(G) whenever i+j≥ci + j \ge c is not quite the cleanest route; instead we directly show the equivalence by simultaneous induction. Direction 1: Suppose γc+1(G)={e}\gamma_{c+1}(G) = \{e\}. We show G/γi+1(G)G/\gamma_{i+1}(G) has the property that γ1(G)/γi+1(G),…\gamma_1(G)/\gamma_{i+1}(G), \ldots relates to upper series terms; concretely we show by downward induction on ii (from i=ci=c down to i=0i=0) that γc−i+1(G)≤Zi(G)\gamma_{c-i+1}(G) \le Z_i(G). Base case i=0i = 0: γc+1(G)={e}=Z0(G)\gamma_{c+1}(G) = \{e\} = Z_0(G). ✓. Inductive step: suppose γc−i+1(G)≤Zi(G)\gamma_{c-i+1}(G) \le Z_i(G). We must show γc−i(G)≤Zi+1(G)\gamma_{c-i}(G) \le Z_{i+1}(G). By definition Zi+1(G)/Zi(G)=Z(G/Zi(G))Z_{i+1}(G)/Z_i(G) = Z(G/Z_i(G)), so it suffices to show that for x∈Gx \in G and y∈γc−i(G)y \in \gamma_{c-i}(G), the commutator [x,y][x,y] lies in Zi(G)Z_i(G) — because that says xZi(G)xZ_i(G) and yZi(G)yZ_i(G) commute in G/Zi(G)G/Z_i(G) for every x∈Gx \in G, i.e. yZi(G)∈Z(G/Zi(G))yZ_i(G) \in Z(G/Z_i(G)), i.e. y∈Zi+1(G)y \in Z_{i+1}(G). But such commutators [x,y][x,y] generate exactly γc−i+1(G)=[G,γc−i(G)]\gamma_{c-i+1}(G) = [G, \gamma_{c-i}(G)], which lies in Zi(G)Z_i(G) by the inductive hypothesis. This proves the step. At i=ci = c: γ1(G)≤Zc(G)\gamma_1(G) \le Z_c(G), i.e. G≤Zc(G)G \le Z_c(G), so Zc(G)=GZ_c(G) = G. Direction 2: Suppose Zc(G)=GZ_c(G) = G. By induction on ii from 00 to cc we show γi+1(G)≤Zc−i(G)\gamma_{i+1}(G) \le Z_{c-i}(G). Base case i=0i=0: γ1(G)=G=Zc(G)\gamma_1(G) = G = Z_c(G). ✓. Inductive step: suppose γi+1(G)≤Zc−i(G)\gamma_{i+1}(G) \le Z_{c-i}(G); since Zc−i(G)/Zc−i−1(G)=Z(G/Zc−i−1(G))Z_{c-i}(G)/Z_{c-i-1}(G) = Z(G/Z_{c-i-1}(G)), for any x∈G,y∈γi+1(G)≤Zc−i(G)x\in G, y \in \gamma_{i+1}(G) \le Z_{c-i}(G) we get [x,y]∈Zc−i−1(G)[x,y] \in Z_{c-i-1}(G) (the commutator of an element with something central mod Zc−i−1(G)Z_{c-i-1}(G) lands back in Zc−i−1(G)Z_{c-i-1}(G), by definition of centrality of the coset). Hence γi+2(G)=[G,γi+1(G)]≤Zc−i−1(G)\gamma_{i+2}(G) = [G,\gamma_{i+1}(G)] \le Z_{c-i-1}(G), completing the induction. At i=ci = c: γc+1(G)≤Z−1(G)\gamma_{c+1}(G) \le Z_{-1}(G)... to avoid a negative index, stop at i=c−1i = c-1: γc(G)≤Z1(G)\gamma_{c}(G) \le Z_1(G), and then applying the same one-step argument once more with x∈G,y∈γc(G)≤Z1(G)=Z(G)x \in G, y \in \gamma_c(G) \le Z_1(G) = Z(G) gives [x,y]=e[x,y] = e (since yy is central), so γc+1(G)={e}\gamma_{c+1}(G) = \{e\}. Combining both directions proves (a).

(b) Nilpotent ⇒\Rightarrow solvable. We show G(i)≤γi+1(G)G^{(i)} \le \gamma_{i+1}(G) for all i≥0i \ge 0, by induction. Base case: G(0)=G=γ1(G)G^{(0)} = G = \gamma_1(G). Suppose G(i)≤γi+1(G)G^{(i)} \le \gamma_{i+1}(G). Then

G(i+1)=[G(i),G(i)]≤[G,γi+1(G)]=γi+2(G),G^{(i+1)} = [G^{(i)}, G^{(i)}] \le [G, \gamma_{i+1}(G)] = \gamma_{i+2}(G),

using G(i)≤GG^{(i)} \le G and G(i)≤γi+1(G)G^{(i)} \le \gamma_{i+1}(G) and monotonicity of the commutator bracket in each argument. If GG is nilpotent, γc+1(G)={e}\gamma_{c+1}(G) = \{e\} for some cc, so G(c)≤γc+1(G)={e}G^{(c)} \le \gamma_{c+1}(G) = \{e\}, i.e. G(c)={e}G^{(c)} = \{e\}: GG is solvable.

(c) Finite pp-groups are nilpotent. Let ∣G∣=pn|G| = p^n. We show γi+1(G)≠γi(G)\gamma_{i+1}(G) \ne \gamma_i(G) whenever γi(G)≠{e}\gamma_i(G) \ne \{e\}, which forces the strictly descending chain G=γ1(G)⊋γ2(G)⊋⋯G = \gamma_1(G) \supsetneq \gamma_2(G) \supsetneq \cdots to reach {e}\{e\} in at most nn steps (a strictly decreasing chain of subgroups of a group of order pnp^n has length at most nn, since each proper containment of subgroups of a pp-group drops the order by at least a factor of pp). Concretely we use the upper central series instead, which is cleaner: since GG is a nontrivial finite pp-group, Z(G)=Z1(G)≠{e}Z(G) = Z_1(G) \ne \{e\} (standard fact for pp-groups). Consider G/Z1(G)G/Z_1(G); if nontrivial it is again a pp-group (a quotient of a pp-group by a normal subgroup has order a power of pp), so it too has nontrivial center, meaning Z2(G)/Z1(G)=Z(G/Z1(G))≠{e}Z_2(G)/Z_1(G) = Z(G/Z_1(G)) \ne \{e\}, so Z2(G)⊋Z1(G)Z_2(G) \supsetneq Z_1(G). Inductively, as long as Zi(G)≠GZ_i(G) \ne G, the quotient G/Zi(G)G/Z_i(G) is a nontrivial finite pp-group (order pn/∣Zi(G)∣p^n/|Z_i(G)|, still >1>1), hence has nontrivial center, forcing Zi+1(G)⊋Zi(G)Z_{i+1}(G) \supsetneq Z_i(G). Since ∣Zi(G)∣|Z_i(G)| strictly increases and is bounded by pnp^n, we must reach Zc(G)=GZ_c(G) = G for some c≤nc \le n. By part (a), GG is nilpotent.

(d) Structure theorem for finite nilpotent groups. Lemma (normalizers grow in nilpotent groups): If GG is nilpotent and H⪇GH \lneq G is a proper subgroup, then H⪇NG(H)H \lneq N_G(H) (i.e. HH is not self-normalizing). Proof of lemma: Since GG is nilpotent, Z0(G)={e}≤HZ_0(G) = \{e\} \le H and Zc(G)=G≰HZ_c(G) = G \not\le H for the nilpotency class cc. Let ii be the largest index with Zi(G)≤HZ_i(G) \le H; then i<ci < c and Zi+1(G)≰HZ_{i+1}(G) \not\le H. Pick z∈Zi+1(G)∖Hz \in Z_{i+1}(G) \setminus H. For any h∈Hh \in H, since zZi(G)∈Zi+1(G)/Zi(G)=Z(G/Zi(G))zZ_i(G) \in Z_{i+1}(G)/Z_i(G) = Z(G/Z_i(G)), the coset zZi(G)zZ_i(G) commutes with hZi(G)hZ_i(G) in G/Zi(G)G/Z_i(G), i.e. [z,h]∈Zi(G)≤H[z,h] \in Z_i(G) \le H. So z−1h−1zh∈Hz^{-1}h^{-1}zh \in H, hence h−1zh=z(z−1h−1zh)∈zHh^{-1}zh = z(z^{-1}h^{-1}zh) \in zH. Also hzh−1hzh^{-1}: from z−1h−1zh∈Hz^{-1}h^{-1}zh \in H we get zhz−1⋅h−1⋅zh z^{-1} \cdot h^{-1} \cdot(rearranging) — more directly: [z,h]∈H[z,h] \in H means z−1h−1zh=h0∈Hz^{-1}h^{-1}zh = h_0 \in H, so zh=h(zh0)zh = h(zh_0)... let us just directly verify zHz−1=HzHz^{-1} = H: for h∈Hh \in H, zhz−1=h⋅h−1zhz−1=h⋅[h−1,z−1]−1zhz^{-1} = h \cdot h^{-1}zhz^{-1} = h \cdot [h^{-1}, z^{-1}]^{-1}-type manipulation. Cleanest: z−1h−1zh∈Zi(G)≤Hz^{-1}h^{-1}zh \in Z_i(G) \le H means h−1zh∈zHh^{-1}zh \in zH, i.e. h−1zh=zh′h^{-1}zh = zh' for some h′∈Hh' \in H; rearranging, zh=hzh′zh = hzh', so z=hzh′h−1∈z = hzh'h^{-1} \in ... We simplify: from z−1h−1zh∈Hz^{-1}h^{-1}zh \in H for every h∈Hh \in H, set k=z−1h−1zh∈Hk = z^{-1}h^{-1}zh \in H; then z−1h−1z=kh−1∈Hz^{-1}h^{-1}z = kh^{-1} \in H, so z−1Hz⊆Hz^{-1}Hz \subseteq H hence (as HH is finite, this inclusion of equal-order sets is equality, or directly apply the same argument to h−1h^{-1} ranging over HH) z−1Hz=Hz^{-1}Hz = H, i.e. z∈NG(H)z \in N_G(H). Since z∉Hz \notin H, NG(H)⊋HN_G(H) \supsetneq H. This proves the lemma. Now suppose GG finite nilpotent, and let PP be a Sylow pp-subgroup of GG. We claim P⊴GP \trianglelefteq G. Let N=NG(P)N = N_G(P). A standard Sylow-theory fact is NG(NG(P))=NG(P)N_G(N_G(P)) = N_G(P) (the "normalizer of the normalizer" is itself, since PP is the unique Sylow pp-subgroup of NG(P)N_G(P) and any gg normalizing NG(P)N_G(P) must send PP to a Sylow pp-subgroup of NG(P)N_G(P), hence to PP itself, so g∈NG(P)g \in N_G(P)). If N≠GN \ne G, the lemma gives N⪇NG(N)=NN \lneq N_G(N) = N, a contradiction. So N=GN = G, i.e. P⊴GP \trianglelefteq G. 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 GG is normal. Let p1,…,pkp_1, \ldots, p_k be the distinct primes dividing ∣G∣|G|, and P1,…,PkP_1,\ldots,P_k the corresponding (unique, since normal Sylow subgroups are unique — any two Sylow pp-subgroups are conjugate, and a normal subgroup is its own only conjugate) Sylow subgroups. For i≠ji \ne j, Pi∩Pj={e}P_i \cap P_j = \{e\} since their orders are coprime prime powers (Lagrange: the order of any element of the intersection divides both ∣Pi∣|P_i| and ∣Pj∣|P_j|, which are coprime). Since each Pi⊴GP_i \trianglelefteq G, for x∈Pi,y∈Pjx \in P_i, y \in P_j (i≠ji\ne j) the commutator [x,y]=x−1(y−1xy)=(x−1y−1x)y[x,y] = x^{-1}(y^{-1}xy) = (x^{-1}y^{-1}x)y lies in Pi∩Pj={e}P_i \cap P_j = \{e\} using normality of both (the first parenthesization shows [x,y]∈Pi[x,y] \in P_i since y−1xy∈Piy^{-1}xy \in P_i by normality of PiP_i, wait we need x−1⋅(y−1xy)∈Pix^{-1}\cdot(y^{-1}xy) \in P_i — yes since x−1∈Pix^{-1} \in P_i and y−1xy∈Piy^{-1}xy \in P_i as Pi⊴GP_i \trianglelefteq G; the second parenthesization shows [x,y]∈Pj[x,y] \in P_j similarly). So [x,y]=e[x,y] = e, i.e. elements of distinct Sylow subgroups commute. The map φ:P1×⋯×Pk→G\varphi: P_1 \times \cdots \times P_k \to G, (x1,…,xk)↦x1x2⋯xk(x_1,\ldots,x_k) \mapsto x_1 x_2 \cdots x_k, is then a homomorphism (using that distinct PiP_i's commute elementwise to check φ((xi)(yi))=φ((xi))φ((yi))\varphi((x_i)(y_i)) = \varphi((x_i))\varphi((y_i)) directly). It is injective: if x1⋯xk=ex_1\cdots x_k = e, then for each prime pip_i, isolating xi=(x1⋯xi−1)−1(xi+1⋯xk)−1x_i = (x_1\cdots x_{i-1})^{-1}(x_{i+1}\cdots x_k)^{-1} shows xix_i lies in the subgroup generated by the other (pairwise commuting, coprime-order) PjP_j's, whose order is coprime to pip_i; since xi∈Pix_i \in P_i has order a power of pip_i, and also order dividing that coprime number, xi=ex_i = e. It is surjective since ∣P1×⋯×Pk∣=∏∣Pi∣=∣G∣|P_1\times\cdots\times P_k| = \prod |P_i| = |G| by Sylow's theorem (the order of GG 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 G≅P1×⋯×PkG \cong P_1 \times \cdots \times P_k. Finally, each finite pp-group PiP_i is nilpotent by (c), and a finite direct product of nilpotent groups is nilpotent (one checks directly that γj(H1×⋯×Hk)=γj(H1)×⋯×γj(Hk)\gamma_j(H_1 \times \cdots \times H_k) = \gamma_j(H_1) \times \cdots \times \gamma_j(H_k) by induction on jj, since commutators in a direct product are computed coordinatewise; hence if each γci+1(Hi)={e}\gamma_{c_i+1}(H_i) = \{e\}, taking c=max⁡cic = \max c_i gives γc+1(∏Hi)={e}\gamma_{c+1}(\prod H_i) = \{e\}). So G≅∏PiG \cong \prod P_i is nilpotent. This completes (d). ■\blacksquare

∎

Worked examples

Example 1: S4S_4 is solvable but not nilpotent. Consider G=S4G = S_4, ∣G∣=24|G| = 24. Recall the normal subgroups A4⊴S4A_4 \trianglelefteq S_4 (index 2, hence normal) and the Klein four group V={e,(12)(34),(13)(24),(14)(23)}⊴A4V = \{e, (12)(34), (13)(24), (14)(23)\} \trianglelefteq A_4 (normal in A4A_4, indeed normal in S4S_4 since it is a union of conjugacy classes of S4S_4 — conjugating a product of two disjoint transpositions by any permutation gives another product of two disjoint transpositions, and VV consists of exactly all such elements together with ee). We compute the derived series directly:

S4′=A4S_4' = A_4

because S4/A4≅Z/2ZS_4/A_4 \cong \mathbb{Z}/2\mathbb{Z} is abelian, so S4′≤A4S_4' \le A_4 by Basic commutator facts(1); and S4′≥A4S_4' \ge A_4 because A4A_4 is generated by 3-cycles, and any 3-cycle (abc)=[(ab),(ac)](abc) = [(ab), (ac)] is itself a commutator of transpositions in S4S_4 (direct computation: with x=(ab),y=(ac)x=(ab), y=(ac), x−1y−1xy=(ab)(ac)(ab)(ac)=(acb)(acb)x^{-1}y^{-1}xy = (ab)(ac)(ab)(ac) = (acb)(acb)... let's verify concretely with a,b,c=1,2,3a,b,c=1,2,3: x=(12)x = (12), y=(13)y=(13), x−1=x=(12)x^{-1}=x=(12), y−1=y=(13)y^{-1}=y=(13). Compute xyxyx y x y acting right-to-left on points: apply y=(13)y=(13) first, then x=(12)x=(12), then yy, then xx. Track 11: y:1→3y: 1\to3; x:3→3x: 3\to3; y:3→1y: 3\to1; x:1→2x: 1\to2. So 1↦21 \mapsto 2. Track 22: y:2→2y:2\to2; x:2→1x:2\to1; y:1→3y:1\to3; x:3→3x:3\to3. So 2↦32\mapsto3. Track 33: y:3→1y:3\to1; x:1→2x:1\to2; y:2→2y:2\to2; x:2→1x:2\to1. So 3↦13\mapsto1. Net permutation: 1→2,2→3,3→11\to2, 2\to3, 3\to1, which is (123)(123), a 3-cycle. So indeed [(12),(13)]=(123)[(12),(13)] = (123).) Hence A4≤S4′A_4 \le S_4', giving S4′=A4S_4' = A_4. Next,

A4′=VA_4' = V

since A4/V≅Z/3ZA_4/V \cong \mathbb{Z}/3\mathbb{Z} is abelian (order 12/4=312/4=3), so A4′≤VA_4' \le V; and A4′≠{e}A_4' \ne \{e\} since A4A_4 is non-abelian, and A4′A_4' is normal in A4A_4 of order dividing 44 (as A4′≤VA_4' \le V) and it must be a nontrivial normal subgroup, and the only nontrivial proper normal subgroup of A4A_4 is VV itself (a standard fact about A4A_4), so A4′=VA_4' = V. Then V′={e}V' = \{e\} since V≅Z/2×Z/2V \cong \mathbb{Z}/2 \times \mathbb{Z}/2 is abelian. So the derived series is

S4▹A4▹V▹{e},S_4 \triangleright A_4 \triangleright V \triangleright \{e\},

terminating at step 3: S4S_4 is solvable. However S4S_4 is not nilpotent: by The Alternating Group background and Sylow theory, the Sylow 22-subgroups of S4S_4 have order 88 (dihedral of order 8, e.g. generated by (1234)(1234) and (13)(13)) and there are 33 of them (they are not normal — one checks (123)(123) conjugates one Sylow 2-subgroup to a different one). Since not every Sylow subgroup of S4S_4 is normal, part (d) of the Structure theorem (Sylow characterization) shows S4S_4 is not nilpotent. This illustrates that the containment nilpotent ⊊\subsetneq solvable is strict.

Example 2: The dihedral group D12D_{12} of order 12 (symmetries of a hexagon) is nilpotent — computed via both series. Let D12=⟨r,s∣r6=s2=e, srs=r−1⟩D_{12} = \langle r, s \mid r^6 = s^2 = e,\ srs = r^{-1}\rangle, order 12. We compute the center. An element rkr^k commutes with ss iff srks−1=rks r^k s^{-1} = r^k, i.e. r−k=rkr^{-k} = r^k, i.e. r2k=er^{2k} = e, i.e. 6∣2k6 \mid 2k, i.e. 3∣k3 \mid k. So among rotations, only r0=er^0 = e and r3r^3 (rotation by 180°180°) centralize ss; and rotations always commute with each other, and a reflection srjsr^j is central only if it commutes with rr, forcing (by a similar computation) r2=er^{2} = e, false since rr has order 6, so no reflection is central. Hence

Z(D12)={e,r3}≅Z/2Z.Z(D_{12}) = \{e, r^3\} \cong \mathbb{Z}/2\mathbb{Z}.

Now consider D12/Z(D12)D_{12}/Z(D_{12}), of order 6. One checks this quotient is isomorphic to S3S_3 (equivalently D6D_6): the images rˉ\bar r has order 3 (since r3∈Zr^3 \in Z), sˉ\bar s has order 2, and sˉrˉsˉ=r−1‾=rˉ−1≠rˉ\bar s \bar r \bar s = \overline{r^{-1}} = \bar r^{-1} \ne \bar r (as rˉ\bar r has order 3 > 2), so this quotient is non-abelian of order 6, hence ≅S3\cong S_3. Since Z(D12/Z(D12))=Z(S3)={e}Z(D_{12}/Z(D_{12})) = Z(S_3) = \{e\} (the center of S3S_3 is trivial, as is standard: S3S_3 non-abelian of order 6 has trivial center since a nontrivial central element would force S3/ZS_3/Z cyclic hence S3S_3 abelian, contradiction), we get Z2(D12)/Z1(D12)={e}Z_2(D_{12})/Z_1(D_{12}) = \{e\}, i.e. Z2(D12)=Z1(D12)={e,r3}≠D12Z_2(D_{12}) = Z_1(D_{12}) = \{e, r^3\} \ne D_{12}. The upper central series stabilizes at {e,r3}≠D12\{e,r^3\} \ne D_{12}, so D12D_{12} is not nilpotent (by part (a) of the theorem, nilpotency would require the upper series to reach all of GG). This is a cautionary computation: D12D_{12}, despite looking similar to the nilpotent quaternion-type or pp-group examples, fails nilpotency because its "reduced" quotient S3S_3 has trivial center and thus permanently kills further growth. (One can check independently: D12D_{12}'s Sylow 2-subgroups have order 4 and there are 3 of them, permuted transitively by conjugation by rr, hence not normal — consistent with non-nilpotency via the Sylow criterion.) By contrast D12D_{12} is solvable: D12′=⟨r2⟩≅Z/3ZD_{12}' = \langle r^2 \rangle \cong \mathbb{Z}/3\mathbb{Z} (index 4 abelian quotient, and one checks r2=[s,r]r^2 = [s, r]-type commutators generate exactly the order-3 rotation subgroup), and (D12′)′={e}(D_{12}')' = \{e\} since Z/3\mathbb{Z}/3 is abelian, giving derived series D12▹⟨r2⟩▹{e}D_{12} \triangleright \langle r^2\rangle \triangleright \{e\} of length 2.

CounterexampleWhy finiteness is needed in the Sylow / direct-product characterization of nilpotent groups

The structure theorem (d) — "GG nilpotent iff GG 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 G=ZG = \mathbb{Z}, the infinite cyclic group under addition. It is abelian, hence trivially nilpotent (class 11: γ2(Z)=[Z,Z]={0}\gamma_2(\mathbb{Z}) = [\mathbb{Z},\mathbb{Z}] = \{0\}). But Z\mathbb{Z} has no elements of finite order aside from 00, so it has no nontrivial finite pp-subgroups at all, let alone Sylow subgroups in any useful decomposition sense; there is no way to write Z\mathbb{Z} as a product of "pp-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 ∣P1×⋯×Pk∣=∣G∣|P_1 \times \cdots \times P_k| = |G|, and the normalizer-growth lemma's use of a maximal chain-index argument bounded by ∣G∣|G|. 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

SituationSolvable?Nilpotent?Why
Abelian groupYesYes (class ≤1\le 1)G′={e}G' = \{e\} and γ2(G)={e}\gamma_2(G) = \{e\} immediately
Finite pp-groupYesYesTheorem (c)
S3S_3YesNoZ(S3)={e}Z(S_3) = \{e\}, upper series stalls at step 0
S4S_4Yes (class-3 derived series)Nonot all Sylows normal
Sn, n≥5S_n,\ n\ge5NoNoAnA_n simple non-abelian for n≥5n\ge5
A5A_5NoNosimple, non-abelian ⇒A5′=A5≠{e}\Rightarrow A_5' = A_5 \ne \{e\} forever
Infinite group, e.g. free group F2F_2NoNoF2′≠{e}F_2' \ne \{e\} and in fact derived series never terminates

The mathematician behind it

Origins · 1 minÉvariste Galois and how this was discovered
ÉG
Évariste Galois
1811–1832 · Founder of Galois theory, origin of "solvable group"

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).

History
- 1832: Galois's final letter, written the night before his fatal duel, outlines the criterion for radical solvability of polynomials in terms of the structure of the associated permutation group.
- 1870: Camille Jordan publishes Traité des substitutions et des équations algébriques, systematizing Galois's ideas and composition series.
- 1889: Otto Hölder refines the uniqueness statement for composition factors, sharpening what becomes the Jordan–Hölder theorem.
- 1930s: Philip Hall develops a deep structure theory of finite solvable groups, including Hall subgroups generalizing Sylow's theorem.
- 1963: Feit and Thompson prove every finite group of odd order is solvable, a landmark theorem whose 255-page proof cemented solvability as a central organizing concept in finite group theory.
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: G(i+1)=[G(i),G(i)]G^{(i+1)} = [G^{(i)}, G^{(i)}]. The lower central series instead commutes the previous term with the whole original group: γi+1(G)=[G,γi(G)]\gamma_{i+1}(G) = [G, \gamma_i(G)]. Because γi(G)≤G\gamma_i(G) \le G always, the lower central series descends at least as slowly, and in fact one can show G(i)≤γi+1(G)G^{(i)} \le \gamma_{i+1}(G) for all ii (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. S3S_3 is the standard counterexample: its derived series is S3▹A3▹{e}S_3 \triangleright A_3 \triangleright \{e\} (length 2, so solvable), but its center is trivial, so the upper central series stalls immediately at Z1(S3)={e}Z_1(S_3) = \{e\} and never reaches S3S_3, meaning S3S_3 is not nilpotent. More generally, any non-abelian group with trivial center that is nonetheless built from abelian layers (like all dihedral groups D2nD_{2n} with nn 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 f(x)f(x) 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 nn, the Galois group is the full symmetric group SnS_n. For n≥5n \ge 5, SnS_n is not solvable because its derived series stabilizes at AnA_n, 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 S2,S3,S4S_2, S_3, S_4 are all solvable.

Do all finite groups of prime-power order automatically satisfy both properties?

Yes. Every finite pp-group is nilpotent (proved via the fact that a nontrivial finite pp-group has nontrivial center, applied repeatedly to build up the upper central series), and nilpotent groups are always solvable (proved via the inequality G(i)≤γi+1(G)G^{(i)} \le \gamma_{i+1}(G)). So finite pp-groups sit at the very tame end of the hierarchy: abelian groups are the tamest, pp-groups (and more generally nilpotent groups) are next, and general solvable groups are the broadest tame class before one reaches groups like A5A_5 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 ≤1\le 1), 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 GG is solvable (this is exactly criterion (b) in the theorem, shown equivalent to (a)). For instance, to check D2nD_{2n} is solvable, exhibit ⟨r⟩⊴D2n\langle r \rangle \trianglelefteq D_{2n} with both ⟨r⟩\langle r\rangle and D2n/⟨r⟩≅Z/2D_{2n}/\langle r\rangle \cong \mathbb{Z}/2 abelian — done, no need to compute G(i)G^{(i)} explicitly. Conversely, to prove non-solvability, the cleanest route for Sn, n≥5S_n,\, n\ge5, 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 GG eventually drops into NN and then continues descending inside NN's own derived series, which terminates because NN is solvable — this argument only needs NN's derived series to terminate, not any comparison with the "whole group" GG at each stage. Nilpotency's central series, by contrast, is defined using commutators with the entire group GG at every step (γi+1(G)=[G,γi(G)]\gamma_{i+1}(G) = [G,\gamma_i(G)]), so even if NN and G/NG/N both have central series that terminate, the presence of elements outside NN acting on NN can prevent [G,anything][G, \text{anything}] from ever collapsing to {e}\{e\} — exactly what happens in S3S_3, built from the abelian (hence nilpotent) pieces Z/3\mathbb{Z}/3 and Z/2\mathbb{Z}/2.

Before this