# Commutative Algebra/Normal and composition series
## Normal series

Definition 12.1:
Let $M$ be an $R$-module. A finite sequence of submodules
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$
is called normal series of $M$.
Note that a normal series of a module is a normal series of the underlying group $(M,+)$; indeed, each subgroup of an abelian group is normal, hence each normal series in modules gives rise to a normal series of groups. The other direction is not true, since additive subgroups need not be closed under multiplication by elements of $R$.
Definition 12.2:
Let $M$ be an $R$-module, and let a normal series
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$
be given. This normal series is said to be without repetitions if each inclusion of modules is, in fact, strict.

## Refinements and composition series

Definition 12.3:
Let $M$ be an $R$-module, and let a normal series
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$
be given. A refinement of this normal series is another normal series
    $M\geq L_{1}\geq L_{2}\geq \cdots \geq L_{m-1}\geq \langle 0\rangle$
such that $\{N_{1},\ldots ,N_{n-1}\}\subseteq \{L_{1},\ldots ,L_{m-1}\}$.
Note that this implies $m\geq n$. Refinements arise from a normal series
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$
by inserting submodules $L$ between two modules of the composition series $N_{k}$ and $N_{k+1}$; that is, we start with two modules of a composition series $N_{k}$ and $N_{k+1}$, find a submodule $L$ of $M$ such that $N_{k}\geq L\geq N_{k+1}$, and then just insert this into the normal series.
Definition 12.4:
Let $M$ be an $R$-module. We say that $M$ is simple if and only if it has no proper submodules (i.e. no submodules of $M$ which are neither equal to $M$ nor equal to $\langle 0\rangle$).
Definition 12.5:
Let $M$ be an $R$-module. A composition series of $M$ is a normal series of $M$, say
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$,
such that
* there are no repetitions, and
* each so-called composition factor of that series, namely $N_{k}/N_{k+1}$ for $k\in \{0,\ldots ,n-1\}$, is simple (where we set $N_{0}:=M$ and $N_{n}:=\langle 0\rangle$).
Equivalently, a composition series is a normal series without repetitions, such that any proper refinement of it has repetitions.
To any module, we may associate a so-called length. This concept is justified by the following theorem:
Theorem 12.6 (Jordan):
Let $M$ be an $R$-module which has a composition series
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$.
We say that this composition series has length $n$, and then it follows that
* each normal series in $M$ without repetitions has length $\leq n$,
* every other composition series of $M$ also has length $n$, and
* every normal series in $M$ can be refined to a composition series of $M$.
Proof:
First, we note that 1. implies 3., since whenever a normal series has a refinement that has no repetitions, we may apply that refinement, and due to 1., we must eventually reach a composition series.
Then we prove 1. and 2. by induction on $n$. Indeed, for $n=1$, this theorem follows since then $M$ is simple, and therefore any normal series of length $>n=1$ must have repetitions, which is why the trivial normal series is the only one without repetitions, and there is only one composition series.
Assume now the case $n-1$ to be valid. Let there be a composition series
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$
of length $n$, and assume that there is any other normal series
    $M\geq L_{1}\geq L_{2}\geq \cdots \geq L_{m-1}\geq \langle 0\rangle$
without repetition of length $m$. Now $N_{1}$ hence has a composition series of length $n-1$. By induction, we have:
* If $N_{1}=L_{1}$, then $L_{1}\geq \cdots \geq L_{m-1}\geq \langle 0\rangle$ is a normal series in $L_{1}$ and hence has length at most $n-1$, whence the complete normal series $M\geq L_{1}\geq L_{2}\geq \cdots \geq L_{m-1}\geq \langle 0\rangle$ has length at most $n$.
* If $L_{1}<N_{1}$, then $N_{1}$ has a normal series without repetitions of length $n$, which is a contradiction.
* If not $L_{1}\leq N_{1}$, we have $N_{1}+L_{1}=M$, for otherwise the composition series $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$ would have a proper refinement. Then we have two normal series
          $M=N_{1}+L_{1}\geq N_{1}\geq N_{1}\cap L_{1}\geq \cdots \geq N_{n-1}\cap L_{1}\geq \langle 0\rangle$
       and
          $M=N_{1}+L_{1}\geq L_{1}\geq N_{1}\cap L_{1}\geq \cdots \geq N_{n-1}\cap L_{1}\geq \langle 0\rangle$.
       Now $N_{1}$ has a composition series of length $n-1$, whence $N_{1}\cap L_{1}$ has a composition series of length $\leq n-2$. Furthermore, $L_{1}/(N_{1}\cap L_{1})\cong (L_{1}+N_{1})/N_{1}=M/N_{1}$, which is why any such composition series then extends to a composition series of $L_{1}$ of length $n-1$. Therefore, the partial series
          $L_{1}\geq \cdots \geq L_{m-1}\geq \langle 0\rangle$
       has length at most $n-1$.
This proves 1. by induction. Furthermore, by induction, $M$ can not have a composition series of length $<n$, since then also the composition series above would have length $n-1$, whence 2. is proven by 1. and induction.$\Box$
Definition 12.7:
Assume $M$ has a composition series. Then the length of the module $M$ is defined to be the length of such a composition series.
If $M$ doesn't have a composition series, we set the length of $M$ to be $\infty$.
Furthermore, composition series are essentially unique, as given by the following theorem:
Theorem 12.8 (Hölder):
If
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$
and
    $M\geq L_{1}\geq L_{2}\geq \cdots \geq L_{n-1}\geq \langle 0\rangle$
are two composition series, then there exists a permutation $\sigma :\{0,1,\ldots ,n-1\}\to \{0,1,\ldots ,n-1\}$ such that for all $k\in \{0,1,\ldots ,n-1\}$
    $N_{\sigma (k)}/N_{\sigma (k)+1}\cong L_{k}/L_{k+1}$
(again $N_{0}:=M$ and $N_{n}:=\langle 0\rangle$, and analogous for $L$).
We say that the two series are equivalent.
Proof:
We proceed by induction on $n$. For $n=1$, we have only the trivial composition series as composition series. Now assume the theorem for $n-1$. Let two composition series
    $M\geq N_{1}\geq N_{2}\geq \cdots \geq N_{n-1}\geq \langle 0\rangle$
and
    $M\geq L_{1}\geq L_{2}\geq \cdots \geq L_{n-1}\geq \langle 0\rangle$
be given. If $L_{1}=N_{1}$, we have equivalence by induction. If not, we have once again $L_{1}+N_{1}=M$ (since neither can be properly contained in the other, for else we would obtain a contradiction to the previous theorem of Jordan). Now $L_{1}\cap N_{1}$ must have a composition series, since by the previous theorem we may refine the series
    $M\geq L_{1}\cap N_{1}\geq \langle 0\rangle$
to a composition series of $M$. Further, we again have
    $N_{1}/(L_{1}\cap N_{1})\cong M/L_{1}$ and $L_{1}/(N_{1}\cap L_{1})\cong M/N_{1}$;
both modules on the right of the isomorphisms are simple, whence we get two composition series of $M$ given by
    $M\geq N_{1}\geq L_{1}\cap N_{1}\geq \cdots \geq \langle 0\rangle$
and
    $M\geq L_{1}\geq L_{1}\cap N_{1}\geq \cdots \geq \langle 0\rangle$.
Now the two above isomorphisms also imply that these two are equivalent, and by induction, the first one is equivalent to the first composition series, and the second one equivalent to the second composition series.$\Box$
Proposition 12.9:
Let $M$ be an $R$-module, let $N\leq M$ be a submodule.
    $M$ has a composition series if and only if both $N$ and $M/N$ have composition series.
Proof:
If $M$ has a composition series, then intersecting this series or projecting this series gives normal series of $N$ or $M/N$ respectively. When the repetitions are crossed out, no refinements are possible (else they induce a refinement of the original composition series, in the latter case by the correspondence theorem).
If $N$ and $M/N$ both have composition series, we take a composition series
    $N>N_{1}>N_{2}>\cdots >N_{k-1}>\langle 0\rangle$
of $N$ and another one of $M/N$ given by
    $M/N>L_{1}>\cdots >L_{m-1}>\langle 0\rangle$.
By the correspondence theorem, we write $L_{j}=(K_{j}+N)/N$ for suitable $K_{j}$. Then
    $M>K_{1}+N>\cdots >K_{m-1}+N>N>N_{1}>\cdots >N_{k-1}>\langle 0\rangle$
is a composition series of $M$.$\Box$

## Normal series between modules

Definition 12.10:
Let $M$ be a module and $N\leq M$ a submodule. A series
    $N\leq L_{1}\leq L_{2}\leq \cdots \leq L_{n-1}\leq M$
is called a normal series between $M$ and $N$, and if each inclusion is strict and there does not exist a refinement which leaves each inclusion strict, it is called a composition series between $M$ and $N$.
By the correspondence theorem, we get a bijection between normal (or composition) series
    $N\leq L_{1}\leq L_{2}\leq \cdots \leq L_{n-1}\leq M$
between $M$ and $N$ on the one hand, and of normal (or composition) series
    $N/N\leq L_{1}/N\leq L_{2}/N\leq \cdots \leq L_{n-1}/N\leq M/N$
of $M/N$. Then by the above and the third isomorphism theorem, composition series between $M$ and $N$ are essentially unique. Further, if there is a composition series, normal series can be refined to composition series of same length.