Composition Series, the Jordan–Hölder Theorem and Solvable Groups
About this page
How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
✓ 20 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 9 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Coxeter Groups
Number Theory
Real Analysis
2 · Logical flowchart
3 · Items
Definition
Subnormal and normal series, factors, refinements, and equivalence
Definition
Composition series, composition factors, and composition length
Theorem
Every finite group has a composition series
Lemma
Dedekind's modular law for subgroup products
Theorem
The Zassenhaus butterfly lemma
Theorem
The Schreier refinement theorem
Theorem
The Jordan–Hölder theorem for groups
Corollary
The order of a finite group is the product of the orders of its composition factors
Definition
Characteristic subgroups
Lemma
Characteristic subgroups are normal, and characteristicity is transitive
Theorem
The derived subgroup is characteristic and the abelianization is universal
Definition
The derived series, solvable groups, and derived length
Lemma
Homomorphisms respect commutator subgroups and derived series
Theorem
A group is solvable if and only if it has a subnormal series with abelian factors
Theorem
Subgroups and quotients of solvable groups are solvable
Theorem
Extensions and finite direct products of solvable groups are solvable
Theorem
A finite group is solvable if and only if all its composition factors are cyclic of prime order
Theorem
A₅ and Sₙ for n≥5 are not solvable
Definition
Subgroup commutators and the lower central series
Definition
The upper central series
Definition
Nilpotent groups and nilpotency class
Lemma
Central factors are equivalent to adjacent commutator containments
Theorem
Nilpotence via central series, the upper central series, and the lower central series
Theorem
Subgroups, quotients, and finite direct products of nilpotent groups are nilpotent
Theorem
Every finite p-group is nilpotent
Corollary
Nilpotent groups, and in particular finite p-groups, are solvable
Theorem