The number of simple (irreducible) factors appearing in a finite composition series of an object (such as a module or group), counted with multiplicity; equivalently the length of a maximal chain of subobjects with simple successive quotients.

Principle

Decompose an object by a finite chain 0 = A0 ⊂ A1 ⊂ ... ⊂ An = A where each Ai+1/Ai is simple; the composition length is n when such a chain exists and is independent of the chosen composition series by the Jordan–Hölder theorem.

Demonstration

For a finite-dimensional vector space V over a field, any composition series refines to 1-dimensional quotients and the composition length equals the vector space dimension. For Z/12Z as a Z-module, a composition series yields length 3 corresponding to factors Z/2Z, Z/2Z, Z/3Z.

Misapplication

Counting non-simple refinements or failing to require simple successive quotients leads to overcounting; applying composition length to objects without finite composition series (infinite-length modules) is invalid.

Consequence

Composition length is an invariant that measures complexity of an object, constrains possible subquotient structures, and participates in classification results; existence of finite length implies both artinian and noetherian conditions for modules.

Reversal

Instead of refining by simple quotients, consider a socle or radical series that focuses on maximal semisimple submodules or successive radicals; these series can have different lengths and properties and need not coincide with composition length.

Boundary

Applies only to objects admitting finite composition series; infinite-length objects, objects lacking simple subquotients, or contexts without a well-defined notion of simplicity fall outside its scope.

Semantic Tension

Composition length competes with other measures of complexity such as Loewy length, Krull dimension, or length in derived categories: composition length counts irreducible building blocks, while other measures capture layered or homological depth.

Synthesis

Composition length is the finite number of simple factors in any composition series of an object, an invariant quantifying its irreducible constituents and constraining its subquotient architecture when such a finite refinement exists.