Composition length

This article defines an arithmetic function on a restricted class of groups, namely: group of finite composition lengths

Definition

Symbol-free definition

The composition length of a group is defined as the length of any composition series of the group. The composition length is well-defined only for a group of finite composition length.

By the Jordan-Holder theorem, the composition length is well-defined, because all composition series have the same length and in fact the same collection of composition factors.

Definition with symbols

Suppose $G$ is a group with a composition series:

$\{e\}=N_{0}\leq N_{1}\leq N_{2}\leq \dots \leq N_{r}=G$.

Then, the composition length of $G$ is defined to be equal to $r$.

Facts

Composition lengths related to some group properties

Group property or condition	Meaning	What we can say about the composition length
trivial group	group of order one, has only the identity element	it is 0. In fact, the trivial group is the only group of composition length 0.
simple group	no proper nontrivial normal subgroup	it is 1. In fact, a group is simple if and only if it has composition length 1.
finite group	the underlying set is finite	The composition length is finite, and is bounded by the sum of the exponents on all prime divisors in a prime factorization.
finite solvable group	finite and solvable, so in particular all the composition factors are groups of prime order.	The composition length equals the sum of the exponents on all prime divisors in a prime factorization. Specifically, if the order is $p_{1}^{k_{1}}p_{2}^{k_{2}}\dots p_{r}^{k_{r}}$ with $p_{1},p_{2},\dots ,p_{r}$ distinct primes, then the composition length is $k_{1}+k_{2}+\dots +k_{r}$. In fact, the composition length is $k_{1}+k_{2}+\dots +k_{r}$ if and only if the group is solvable.
group of prime power order	order is a prime power, i.e., of the form $p^{k}$, $p$ prime.	composition length is $k$, i.e., the prime-base logarithm of order.

Relation with product notions

Product notion	Information for factors or inputs to the product	Result for product notion	Proof
external direct product	$G_{1}$ has composition length $a_{1}$, $G_{2}$ has composition length $a_{2}$	$G_{1}\times G_{2}$ has composition length $a_{1}+a_{2}$	composition length of direct product is sum of composition lengths
external semidirect product	$N$ has composition length $a$, and $H$ has composition length $b$, with $\rho :H\to \operatorname {Aut} (N)$ an action	$N\rtimes H$ has composition length $a+b$	composition length of semidirect product is sum of composition lengths
group extension	$N$ has composition length $a$, $G/N$ has composition length $b$	$G$ has composition length $a+b$	composition length of extension group is sum of composition lengths
wreath product	$A$ has composition length $a$, $B$ has composition length on a set of size $b$ and its permutation action is on a set of size $n$	$A\wr B$ has composition length $na+b$