1 Definitions and basic setup
1.1 Chains of subobjects
Let \(A\) be an algebraic object of a fixed type (for example, a group or a module). A chain of subobjects is a finite nested sequence of substructures \[ 0 = A_0 \subset A_1 \subset \cdots \subset A_n = A \] where each \(A_i\) is a subobject of the appropriate type (subgroup, submodule, etc.). The nesting order is strict: \(A_{i-1}\neq A_i\) for each step where the chain progresses.
1.2 Quotients as factors
From such a chain one forms quotients (also called factors of the chain) by considering \[ A_i/A_{i-1}. \] Each quotient measures what new elements (or vectors, depending on the setting) are added when passing from \(A_{i-1}\) to \(A_i\).
1.3 The notion of simplicity and minimality
A subobject is called simple (or, more precisely, the quotient is simple) when it has no nontrivial subobjects of the same kind. Concretely, for groups one uses simple groups: a group \(G\) is simple if its only normal subgroups are \(\{e\}\) and \(G\). For modules, one uses simple modules: a module \(M\) is simple if its only submodules are \(0\) and \(M\).
A chain is called a composition series if every nonzero factor \(A_i/A_{i-1}\) is simple and the inclusions are strict. This “factor-by-factor minimality” prevents redundant steps.
1.4 Composition series vs. other series
Composition series are a special case of other filtration procedures. For instance, an object may admit a normal series (in groups) or a submodule series (in modules) without requiring simplicity of the factors. In contrast, a composition series is designed to ensure that each factor is as small and irreducible as possible in the sense of having no further decomposition of the same type into subfactors.
2 Existence and elementary examples
2.1 Finite objects and common hypotheses
A basic existence theorem applies when the object is finite, or more generally when descending chains of subobjects stabilize (the appropriate chain condition). Under such hypotheses, one can refine any suitable series until the factors become simple. For groups, this is typically phrased for finite groups, ensuring that normal subgroups can be refined into a composition series. For modules, the standard assumption is that the module has finite length (e.g., is finitely generated over an Artinian ring).
2.2 Simple objects and length 0
If the object \(A\) itself is simple (in the relevant sense), then the chain \[ 0 \subset A \] is already a composition series, with one simple factor \(A/0 \cong A\). In the language of composition length, this corresponds to length \(1\). If one allows the trivial chain \(0=A\) for a zero object, then the length is \(0\).
2.3 Cyclic groups and modules
For cyclic groups, the situation is especially explicit. Any subgroup of a cyclic group is normal, and for \(C_{n}\) one can use the subgroup chain coming from divisors of \(n\). For example, when \(n=p^k\) is a prime power, there is a natural chain of subgroups of orders \(p^i\), and each successive quotient has order \(p\), yielding simple cyclic factors isomorphic to \(C_p\).
For cyclic modules over a principal ideal domain or a suitably structured ring, a parallel description exists: factors correspond to successive quotients of the form \(R/I\) where \(I\) changes by divisibility, and the simple factors reflect the prime/irreducible elements involved.
2.4 Direct sums and product constructions
Composition series interact predictably with direct sum and product operations in many common settings. In modules, a direct sum \(M\oplus N\) often has a composition series whose factors are drawn from composition series of \(M\) and \(N\), leading to additivity of composition length. For groups, direct products behave similarly when one works with normal subgroups: the structure of normal subgroups in a direct product governs how composition factors distribute across factors, though the details depend on the interplay of the components.
3 Properties of composition series
3.1 Factor groups/modules and their interpretation
Each factor \(A_i/A_{i-1}\) is simple, so it represents an irreducible building block of \(A\) in that category. In groups, a factor is a simple group, and the series expresses \(A\) as successive extensions whose “quotient pieces” are simple. In modules, the factors are simple modules, giving an analogous “extension by simples” viewpoint.
3.2 Refinements and comparison of chains
If one starts with a non-composition series, one can often refine it by inserting intermediate subobjects until all factors become simple. Two different refinement attempts may yield different lengths and different intermediate subobjects. However, comparison results (discussed in the next section) ensure that the essential data—the multiset of factor types—does not depend on the chosen chain under standard hypotheses.
3.3 Jordan–Hölder style uniqueness (overview)
The central uniqueness principle is the Jordan–Hölder theorem. In essence, it states that for objects of finite length (such as finite groups, or finite-length modules), any two composition series have the same multiset of composition factors, counted with multiplicity, up to isomorphism. While the order of factors may differ between series, the collection of factor isomorphism types is invariant.
3.4 Length (composition length) and additivity
The number of factors in a composition series is called the composition length. For groups and modules of finite length, this length is well-defined (independent of the chosen composition series) because the multiset of factors is invariant up to isomorphism and reordering. Moreover, in module theory one has additivity results, for example \[ \ell(M\oplus N)=\ell(M)+\ell(N), \] and there are corresponding statements for short exact sequences where length behaves like an “additive measure” of complexity.
4 Methods and constructions
4.1 Building a series via subobject lattice ideas
One constructive approach is to examine the lattice of subobjects (subgroups ordered by inclusion, submodules ordered by inclusion). To build a composition series, one iteratively chooses a maximal proper subobject of the appropriate type within a current subobject, ensuring that the quotient becomes simple. In finite settings, maximal choices exist and repeated refinement terminates after finitely many steps.
4.2 Pullbacks, pushouts, and induced subseries
When maps between objects are available (homomorphisms, module homomorphisms), one can transfer series information using standard constructions. For instance:
- In modules and groups, a subobject inside a quotient corresponds to a subobject containing a kernel (via pullback ideas).
- A series for a quotient can often be lifted to a series in the original object by taking preimages of subobjects.
- Conversely, subobjects mapping onto a quotient can induce a chain inside the image.
These mechanisms help construct composition series for related objects appearing in exact sequences.
4.3 Behavior under homomorphisms (kernels and images)
Given a homomorphism \(f:A\to B\), the kernel \(\ker f\) and image \(\operatorname{im} f\) provide a bridge between decomposition data in \(A\) and \(B\). Because composition series factors are tied to simple quotients, one can often read off factor types of \(\ker f\) and of \(\operatorname{im} f\), then relate them to factor types in \(A\) and \(B\) via exact-sequence reasoning. This is a standard engine for proving additivity of length and for tracking multiplicities of composition factors.
4.4 Computing factors in small examples
In explicit computations, one typically:
- Identifies a chain of subobjects with strict inclusions.
- Computes quotients at each step.
- Checks whether each quotient is simple.
- If a quotient is not simple, refines by selecting subobjects inside it and repeating.
For small groups, one can list normal subgroups and test simplicity. For modules over familiar rings, one uses classification results (e.g., over \(\mathbb{Z}\) for finitely generated abelian groups) or computes annihilators and submodule structure to isolate simple subquotients.
5 Composition factors and their significance
5.1 Irreducible factors as invariants
The composition factors—simple quotients arising from a composition series—play the role of irreducible invariants. Although the internal arrangement of a chain may vary, the factor types capture fundamental information about how the object is built from simple pieces through extensions.
5.2 Multiset of factors and equivalence statements
The relevant uniqueness statement is not that two composition series are literally the same chain, but that the multiset of isomorphism classes of factors coincides. Two series may have different lengths ordering or different intermediate subobjects, yet they contain exactly the same simple factors with the same multiplicities. This multiset invariance underlies many classification arguments.
5.3 Relationship to semisimplicity
An object is semisimple (in module settings, completely reducible) when it splits as a direct sum of simple submodules. In such a case, one can choose a composition series that aligns with the direct-sum decomposition, and the “extension” viewpoint collapses to a “direct sum” viewpoint. More generally, composition series show how far an object is from being semisimple: nontrivial extensions manifest as factor arrangements that do not correspond to an outright direct-sum decomposition.
5.4 Composition factors in modules
In module theory, composition factors correspond to simple modules that occur in a module’s filtration. This provides a practical classification tool: for many module classes, knowing the multiplicities of simple modules suffices to identify the module up to isomorphism only when additional conditions hold, but it always gives an invariant constrained by any possible decomposition.
6 Variants across algebraic settings
6.1 Group composition series
For groups, a composition series is usually defined using a chain of subgroups where each factor is simple and the relevant quotients are formed with respect to normality (since quotients require normal subgroups). A finite group always has such a series once the appropriate finiteness assumptions hold. The factors are simple groups, and the Jordan–Hölder theorem guarantees invariance of the factor multiset.
6.2 Module composition series
For modules over a ring, a composition series is a finite chain of submodules with simple quotients. The category-theoretic behavior of submodules under homomorphisms and exact sequences makes modules a particularly tractable environment. Composition length and factor multiplicities are standard invariants in this context.
6.3 Composition series in other algebraic structures
Similar notions exist beyond groups and modules, typically whenever there is:
- a sensible concept of subobjects,
- a quotient construction,
- and a definition of “simple” objects (no proper nontrivial subobjects).
Examples include certain algebraic structures where subobjects correspond to ideals or congruences, enabling a filtration into minimal components.
6.4 Refinement in non-finite contexts (conceptual notes)
In settings without finiteness or chain conditions, composition series in the strict sense may fail to exist because refinements might not terminate. Conceptually, one can still study analogues using transfinite constructions or alternative invariants, but the tidy uniqueness and existence properties associated with finite length become more delicate.
7 Worked examples
7.1 A group with a short composition series
Consider the cyclic group \(C_{p^2}\) for a prime \(p\). It has a subgroup of order \(p\), say \(\langle g^p\rangle\), and the chain \[ \{e\} \subset \langle g^p\rangle \subset C_{p^2} \] has two factors. The first quotient \(\langle g^p\rangle/\{e\}\) is isomorphic to \(C_p\), and the second quotient \(C_{p^2}/\langle g^p\rangle\) is also isomorphic to \(C_p\). Since cyclic groups of prime order are simple in the group sense, this chain is a composition series.
7.2 Decomposing a module over a ring
Let \(R=\mathbb{Z}\) and take the \(\mathbb{Z}\)-module \(M=\mathbb{Z}/12\mathbb{Z}\). A filtration can be obtained by choosing submodules corresponding to divisors of \(12\). For example, one can form a chain where successive quotients are \(\mathbb{Z}/2\mathbb{Z}\) and \(\mathbb{Z}/3\mathbb{Z}\) (with multiplicities reflecting the prime-power decomposition). Over \(\mathbb{Z}\), the simple \(\mathbb{Z}\)-modules are precisely \(\mathbb{Z}/p\mathbb{Z}\) for primes \(p\), so the composition factors reveal the prime components of the torsion.
7.3 Example using direct sum behavior
Let \(M\) and \(N\) be finite-length modules. Suppose \(M\) has composition factors \(S_1,\dots,S_r\) and \(N\) has composition factors \(T_1,\dots,T_s\). Then a composition series for \(M\oplus N\) can be chosen so that its factors are the union of these two lists, counted with multiplicity. As a consequence, the composition length of the direct sum equals \(\ell(M)+\ell(N)\).
7.4 Example highlighting non-uniqueness of the chain but uniqueness of factors
One can find cases where two different composition series use different intermediate subobjects, leading to different step-by-step quotients in a positional sense. However, the Jordan–Hölder theorem ensures that the factors obtained—considered as isomorphism types with multiplicities—match between the two series. Thus the chain itself need not be unique, but the factor data is.
8 Common pitfalls and clarifications
8.1 Confusing composition series with composition chains of different types
Composition series depend on the category and the meaning of subobject and quotient. A chain of subgroups in a group does not automatically define a valid composition series unless the quotients are taken with respect to appropriate normality conditions. Similarly, a submodule chain must respect module structure to ensure the quotient is a module.
8.2 Misinterpreting the uniqueness statement
The uniqueness of composition factors is about the multiset of isomorphism classes, not about the order of factors or equality of the intermediate subobjects. Two composition series may look different and still have the same factor types. Confusing invariance of factors with uniqueness of chains leads to incorrect conclusions.
8.3 Length vs. other measures of complexity
Composition length counts the number of simple factors in any composition series, but it is not necessarily the same as other measures such as dimension (for vector spaces), rank (for abelian groups), or minimal numbers of generators. Length is tailored to the filtration into simples, so comparing it directly to unrelated complexity metrics can be misleading.
8.4 Dependence on assumptions (e.g., finiteness)
Existence and clean uniqueness results generally require finiteness or stabilization hypotheses ensuring finite length. Without them, a composition series may not exist, or it may require more advanced notions to describe. When using composition factors as invariants, one must check that the object lies in the regime where the theory applies.