A finite chain of subobjects 0 = M_0 < M_1 < ... < M_n = M (for modules, groups, or similar algebraic structures) in which each successive quotient M_{i+1}/M_i is simple (has no nontrivial proper subobjects). The chain is used to decompose the object into irreducible building blocks called composition factors.

Principle

Organize an object by a finite subnormal chain whose successive factors are minimal nonzero objects (simple objects); the composition factors capture the irreducible constituents that cannot be further broken down within the category.

Demonstration

For the symmetric group S_3 there is a chain {e} < A_3 < S_3 with quotients A_3/{e} ≅ C3 and S_3/A_3 ≅ C2; these quotients are simple groups, so the chain is a composition series and the composition factors are C3 and C2.

Misapplication

Asserting a composition series exists for every object without finiteness conditions — for instance, demanding a composition series for an infinite-dimensional vector space or an infinite group without finite length — ignores the requirement of finite length and can lead to nonexistent chains.

Consequence

When a composition series exists, the multiset of composition factors is well-defined up to order by the Jordan–Hölder theorem, providing a canonical invariant for classification and comparison of finite-length objects.

Reversal

Instead of a chain with simple successive quotients, consider a subnormal series whose successive quotients are composite and admit nontrivial subobjects; this inversion highlights non-irreducible decomposition and a lack of uniqueness for factors.

Boundary

Applies only to objects of finite length (e.g., finite groups, finite-length modules or Artinian/Noetherian modules); excludes infinite chains, categories without a notion of simple objects, or chains where quotients fail to be simple.

Semantic Tension

Tension arises between 'composition series' and 'chief series' (maximal normal series), and between existence of a composition series and weaker decompositions like Jordan–Hölder-type filtrations that require additional hypotheses.

Synthesis

A composition series is a finite filtration that reduces an algebraic object to a sequence of simple quotients; when it exists it isolates the irreducible constituents and—by the Jordan–Hölder principle—provides a stable multiset of building blocks for classification.