nLab Jordan-Hölder theorem

Redirected from "Jordan-Holder theorem".

Context

Group Theory

Additive and abelian categories

Contents

Idea

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.

Proof

This is a proof of the classical version of the theorem.

Theorem

Every composition series of a given finite group has the same length and the same simple factors up to permutation.

Proof

Let GG be a finite group with two composition series G=G 0...G nG = G_0 \rhd ... \rhd G_n (a) and G=G 0...G mG = G_0\prime \rhd ... \rhd G_m\prime (b) where G n=G m=1G_n = G_m\prime = 1 (the trivial group) and nn, mm are nonzero natural numbers. Proceed by induction on |G||G|. The base case is trivial. In the inductive case:

If G 1=G 1G_1 = G_1\prime (case A), then we have two composition series for the same group of order less than |G||G|. By induction, n=mn = m and we have a permutation relating the factor groups, which can be easily extended (as G 0/G 1=G 0/G 1G_0/G_1 = G_0\prime/G_1\prime), so this case is done.

If G 1G 1G_1 \neq G_1\prime (case B), then we have G 1GG_1 \lhd G and G 1GG_1\prime \lhd G, so G 1G 1={gg|gG 1,gG 1}GG_1 G_1\prime = \{ g g\prime | g \in G_1, g\prime \in G_1\prime \} \lhd G. As both G 1G_1 and G 1G_1\prime are both maximal normal in GG and G 1G 1G_1 G_1\prime contains both, G 1G 1=GG_1 G_1\prime = G. Thus, by the second isomorphism theorem? for groups, G/G 1G 1/(G 1G 1)G/G_1 \cong G_1\prime/(G_1 \cap G_1\prime) and G/G 1G 1/(G 1G 1)G/G_1\prime \cong G_1/(G_1 \cap G_1\prime). Let HG 1G 1H \coloneqq G_1 \cap G_1\prime; due to the previous isomorphisms HH is maximal normal in both G 1G_1 and G 1G_1\prime.

Now, let H=H 2...H lH = H_2 \rhd ... \rhd H_l be a composition series for HH. Thus we have two new composition series G=G 0G 1H 2...H l=1G = G_0 \rhd G_1 \rhd H_2 \rhd ... \rhd H_l = 1 (c) and G=G 0G 1H 2...H l=1G = G_0\prime \rhd G_1\prime \rhd H_2 \rhd ... \rhd H_l = 1 (d). By case A we see that n=ln = l and that there are isomorphisms relating (a) and (c). Similarly, by case A we also see that m=lm = l and that there are isomorphisms relating (b) and (d). These, as well as the isomorphisms G 0/G 1G 1/H 2G_0/G_1 \cong G_1\prime/H_2 and G 0/G 1G 1/H 2G_0\prime/G_1\prime \cong G_1/H_2, allow us to connect (a) and (b) through (c) and (d).

Relation to FTA

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.

References

Last revised on August 21, 2026 at 12:36:58. See the history of this page for a list of all contributions to it.