Finite-length semisimplicity reductions #
A nonsemisimple finite-length module contains a nonsimple indecomposable submodule. The proof uses a submodule of minimal nonsemisimple length and does not require a separately chosen Krull--Schmidt decomposition.
A finite-length nonsemisimple module has a nonsimple indecomposable submodule.
A finite-length nonsemisimple module contains a nonsimple indecomposable submodule with simple top. Choose a minimal nonsemisimple submodule. If its top split into two nonzero summands, their two proper inverse images would be semisimple and would sum to the chosen submodule.
A finite-length nonsemisimple module has a maximal nonsimple indecomposable submodule. Maximality is by inclusion among submodules with those two intrinsic properties.
Ambient form of the maximal extraction: a nonsemisimple submodule contains an ambient submodule maximal among the nonsimple indecomposables which it contains.