Classical groups
Finite groups
Group schemes
Topological groups
Lie groups
Super-Lie groups
Higher groups
Cohomology and Extensions
Related concepts
additive and abelian categories
(AB1) pre-abelian category
(AB2) abelian category
(AB5) Grothendieck category
left/right exact functor
The Jordan-Hölder theorem says that every composition series of a given group, and every Jordan-Hölder sequence on a given object in an abelian category, has the same length, and the same simple factors, up to permutation. In particular says that the length of an object in an abelian category is well defined.
More generally, a form of the theorem holds in any homological category.
This is a proof of the classical version of the theorem.
Every composition series of a given finite group has the same length and the same simple factors up to permutation.
Let be a finite group with two composition series (a) and (b) where (the trivial group) and , are nonzero natural numbers. Proceed by induction on . The base case is trivial. In the inductive case:
If (case A), then we have two composition series for the same group of order less than . By induction, and we have a permutation relating the factor groups, which can be easily extended (as ), so this case is done.
If (case B), then we have and , so . As both and are both maximal normal in and contains both, . Thus, by the second isomorphism theorem? for groups, and . Let ; due to the previous isomorphisms is maximal normal in both and .
Now, let be a composition series for . Thus we have two new composition series (c) and (d). By case A we see that and that there are isomorphisms relating (a) and (c). Similarly, by case A we also see that and that there are isomorphisms relating (b) and (d). These, as well as the isomorphisms and , allow us to connect (a) and (b) through (c) and (d).
The theorem can be seen as a generalization of the fundamental theorem of arithmetic. Using cyclic groups to represent positive natural numbers, simple cyclic groups correspond to prime numbers and composition series correspond to prime factorizations.
Last revised on August 21, 2026 at 12:36:58. See the history of this page for a list of all contributions to it.