Products and Group Structure/p-Groups, Nilpotent, and Solvable Groups

Lesson 5.31,503 words

p-Groups, Nilpotent, and Solvable Groups

Finite p-groups have nontrivial center, and iterating the center upward builds the nilpotent groups, which decompose as the direct product of their Sylow subgroups. Iterating the commutator downward builds the solvable groups, whose factors are abelian.

╌╌╌╌

Between the abelian groups and the general finite group lie two structured classes. Nilpotent groups are built by stacking centers upward; they behave almost like abelian groups and split into Sylow pieces. Solvable groups are built by stripping commutators downward; they are looser, but their abelian layers are what makes polynomial equations solvable by radicals. Both classes rest on one fact about prime-power groups.

The center of a p-group

A finite -group is a group of order . Its defining structural property is that its center is never trivial.

All five rest on the class equation.1 For the first, partition into conjugacy classes: , summed over noncentral class representatives. Every index in the sum is a power of greater than , so divides the sum and divides ; therefore divides , forcing . A nontrivial center makes induction possible: quotient by , apply the inductive hypothesis, and lift the result back.

The upper central series

Iterating take the center produces an ascending chain. Since , the quotient is a smaller -group with its own nontrivial center, which pulls back to a larger normal subgroup of , and so on.

The first term is the ordinary center. Each successive term collects the elements that become central after quotienting by the ones already collected. An abelian group is nilpotent of class , since then .

The upper central series climbs from to by repeatedly adjoining the center of the quotient. A group is nilpotent exactly when this climb reaches in finitely many steps.

Every finite -group is nilpotent: each quotient is a nontrivial -group with nontrivial center, so the series strictly ascends until it reaches . A group of order with has nilpotence class at most (a group of order is abelian, of class ).2 For example and both have class , and has class .

Characterizations of nilpotence

For finite groups, nilpotence has several equivalent characterizations; the most useful is structural: a finite nilpotent group is the direct product of its Sylow subgroups.

The normalizer condition forces each Sylow subgroup to be self-normalizing only when it is the whole group, so every Sylow subgroup is normal; normal Sylow subgroups for distinct primes have coprime orders and trivial pairwise intersection, so the recognition theorem assembles them into a direct product; and a product of nilpotent -groups is nilpotent.3

A finite nilpotent group splits as the direct product of its Sylow subgroups, one per prime dividing the order. Each factor is a nilpotent -group with nontrivial center.

The first part of the Fundamental Theorem of Finite Abelian Groups — that a finite abelian group is the direct product of its Sylow subgroups — is the abelian special case of this theorem, since abelian groups are nilpotent.4

There is a companion descending series. The lower central series sets and ; a group is nilpotent if and only if for some , and the nilpotence class is the least such .5 The upper and lower series climb and descend between the same endpoints but need not agree term by term.

A worked central series

The same computation generalizes: is nilpotent of class , while for not a power of is not nilpotent, because then its Sylow subgroups are not all normal.

Maximal subgroups and Frattini's argument

Nilpotence is also detectable from maximal subgroups alone.

One direction is the normalizer condition: in a nilpotent group , so maximality forces and . The converse uses Frattini's argument: if is a Sylow subgroup of a normal subgroup , then .6 Applying it, if some Sylow -subgroup were not normal, a maximal subgroup containing would be normal, and Frattini gives , a contradiction. So every Sylow subgroup is normal and is nilpotent. In a nilpotent group, then, every maximal subgroup has prime index, tightening the general -group fact that maximal subgroups have index .

The derived series and solvability

Solvability weakens nilpotence by iterating a different commutator. Instead of , take the commutator of each term with itself.

Each is characteristic in , and each quotient is abelian, being a group modulo its own commutator subgroup.7 This matches the original definition of solvability — a chain of subgroups with abelian successive quotients — because is abelian exactly when , so any abelian-quotient chain refines to the derived series.

The derived series descends by taking commutator subgroups, and each successive quotient is abelian. Solvability means the series reaches the identity.

Solvability is closed under three operations.8

  • Subgroups. solvable implies solvable, since .
  • Quotients. A homomorphic image of a solvable group is solvable, since .
  • Extensions. If with both and solvable, then is solvable.

The hierarchy of structure

The classes nest in a strict chain, each obtained by loosening the last. Cyclic groups are abelian; abelian groups are nilpotent of class ; nilpotent groups are solvable, taking the upper central series as an abelian-quotient chain; and solvable groups sit inside all groups.

The strict containment cyclic abelian nilpotent solvable all groups. Each inclusion is proper, witnessed by a group in the annulus just outside the smaller class.

Each inclusion is proper.

Solvability and the quintic

Solvability is the class where composition series have abelian factors.

The pattern breaks at . For the group is simple and non-abelian, so the composition series has the non-abelian factor , and is not solvable.

is solvable through the chain with abelian factors; is simple and non-abelian, so no such abelian-factor chain descends from .

This is the group-theoretic content behind the insolvability of the quintic: a polynomial is solvable by radicals exactly when its Galois group is solvable, and the general quintic has Galois group , which is not. Several deep sufficient conditions for solvability round out the theory — a group of order is solvable (Burnside), and every group of odd order is solvable (Feit–Thompson) — but the relevant fact for Galois theory is the sharp boundary at .10

Summary of the two constructions

NilpotentSolvable
Built byupper central series (climb)derived series (descend)
Terminates when
Factor groupscentral extensionsabelian
Finite characterizationproduct of Sylow subgroupsprime-cyclic composition factors
Smallest failure (solvable, not nilpotent) (not solvable)
Containsall finite -groupsall nilpotent groups

Nilpotent groups are close enough to abelian that Sylow subgroups separate cleanly; solvable groups keep only the abelian-layer structure that Galois theory uses. Both rest on the single fact that a -group has a nontrivial center.

Footnotes

  1. Dummit & Foote, Abstract Algebra, §6.1, Theorem 1: the five structural properties of finite -groups, all consequences of the class equation, including and normal subgroups of every intermediate order.
  2. Dummit & Foote, §6.1, Proposition 2: a group of order is nilpotent of class at most ; has class .
  3. Dummit & Foote, §6.1, Theorem 3: the equivalence of nilpotence with the normalizer condition, normality of all Sylow subgroups, and the direct product of Sylow subgroups.
  4. Dummit & Foote, §6.1, Corollary 4: a finite abelian group is the direct product of its Sylow subgroups, recovered as the abelian case of Theorem 3.
  5. Dummit & Foote, §6.1, Theorem 8: is nilpotent iff the lower central series reaches , with the class equal to the length; the relation .
  6. Dummit & Foote, §6.1, Proposition 6 (Frattini's Argument) and Proposition 7: if is a Sylow subgroup of then ; a finite group is nilpotent iff every maximal subgroup is normal.
  7. Dummit & Foote, §6.1, Theorem 9: is solvable iff for some ; the derived series is the shortest abelian-quotient series and consists of characteristic subgroups.
  8. Dummit & Foote, §6.1, Proposition 10: subgroups and quotients of solvable groups are solvable, and an extension of a solvable group by a solvable group is solvable.
  9. Judson, Abstract Algebra, §13.2 — Solvable Groups: the composition-series definition of solvability, solvable via the chain through and , and not solvable for .
  10. Dummit & Foote, §6.1, Theorem 11: sufficient conditions for solvability, including Burnside's theorem and the Feit–Thompson odd-order theorem.

╌╌ END ╌╌