Definition
The Loewy length of a module M (or algebra regarded as a module over itself) is the smallest ordinal n (often a positive integer) such that the Loewy (socle) filtration reaches M after n steps: 0 = L_0 ⊂ L_1 ⊂ ··· ⊂ L_n = M where each successive quotient L_{i+1}/L_i is the socle of M/L_i.

Principle

Principle
Measures the number of semisimple 'layers' needed to build the object from simple submodules by iteratively adjoining the socle; it quantifies depth of nonsemisimplicity.

Demonstration

Demonstration
Example: For the local algebra k[x]/(x^n) viewed as a module over itself, the socle is generated by x^{n-1} and the Loewy length of the regular module is n. For a semisimple module the Loewy length is 1.

Misapplication

Misapplication
Mistaking Loewy length for composition length or Krull dimension; unlike composition length, Loewy length counts socle layers rather than simple factors and can be finite while composition length is infinite (or vice versa).

Consequence

Consequence
Finite Loewy length gives a natural finite filtration by semisimple layers, simplifies induction arguments, and is closely related to nilpotence indices of radicals: for Artinian modules the nilpotency index of the Jacobson radical controls the Loewy length of the regular module.

Reversal

Reversal
A Loewy length of 1 characterizes semisimple objects; increasing Loewy length indicates successive layers of complexity and extension between simple constituents.

Boundary

Boundary
Applies to modules over rings where socles are meaningful (typically modules with ACC/DCC conditions); for modules without well‑behaved socle or for certain infinite modules the Loewy series may not stabilize or may require transfinite steps.

Semantic Tension

Semantic Tension
Tension exists between Loewy length and composition length: both measure 'size' of module structure but from different filtrations (socle layers vs Jordan–Hölder simple factors), leading to different invariants in extension-theoretic problems.

Synthesis

Synthesis
Loewy length is a layer-count: the minimal number of socle iterations needed to assemble the module, providing a discrete measure of how far the object is from being semisimple and linking to radical nilpotence in Artinian contexts.