45. Decomposition into elementary components*
* Cf. Pickert Linear Algebra (Encyclopedia of Mathematical Sciences I1,6) Leipzig 1953
During a further transformation, one can restrict considerations, according to Theorem 27, to matrices with a single characteristic root. Let M be a matrix of type (m,m) with the single characteristic root b. Assume to start with that b=0. Then the characteristic equation of M is xm = 0, whence there exists the Cayley-Hamilton relation Mm = O. There corresponds to the similarity class of M a linear mapping Y of an m-dimensional vector space W.
A lower power of M than the m-th can already equal the null-matrix, say
Mp
= O, but Mp-1
O (p
m).
Correspondingly,
Y
p = W, but Y p-1
W.
If here p = 1, that it M = O, no further transformation is necessary. Now let in the sequel p > 1.
Let for k = 0, 1, ··· , p be that partial space of W which during the mapping is mapped onto o, be denoted by Wk. Now, due to Y p = W , you have that Wp=W and, due to Y 0 = I , that W0 consists only of the null-vector. In the sequence of the vector spaces
Wp (= W), Wp-1 , ··· ,W1, W0 (= o), (45.1)
each is a genuine
partial space of the preceding one. To start with, Wk
is contained in Wk+1
(k + 1
p), because every vector x
of Wk has the property Y kx = o,
whence, obviously,
Y k+1(Y p-k-1 x) = Y px = Y o = W x = o,
whence x
is contained in Wk+1. If you
should have Wk+1 = Wk,
you would have for every vector y of W,
which satisfies the equation Y k+1y = o
also
Y ky
= o. For every vector x of
W, y = Y p-k-1 x
is now a vector which with Y k+1 is mapped on to o,
because
Y k(Y p-k-1 x) = Y p x = W x = o.
Hence in the case Wk+1 = Wk also
Y k(Y p-k-1x) =Y p-1x = o.
If y is a vector in Wk+1, then Yy lies Wk, because while y lies in Wk+1, Yk+1y=o; since you can write Yk+1y = Yk(Yy), Yy is mapped by Yk= onto o, that is, it lies in Wk.
A system x1, ··· ,xs of vectors of W is said to be linearly independent over a partial space T, if there is not contained in T a linear combination l1x1, ··· ,lsxs apart from the trivial one with l1 = ··· = ls = 0. If T is the partial space, which only contains the null-vector, the linear independence over T means that x1,···,xs are linearly independent. A base of W over T is a system x1, ··· , xr comprising as many vectors as possible which are linearly independent over T. If you add to a base of T a base of W over T, you obtain a base of W, because, if t1, ··· , tt is a base on T, then the vectors
x1, ··· , xr , t1, ··· , tt (45.2)
are linearly independent, since in a relation
l1x1 + ··· + lrxr + m1t1 + ··· + mttt = o
must, first of all, all lt vanish, because otherwise there would exist in T a non-trivial linear combination of x1, ··· , xr; moreover, due to the linear independence of t1, ··· , tt, also all mt must vanish . Next, let x be any vector of W. Then the vectors x, x1, ··· , xr form a system of r + 1 vectors, which must be linearly dependent over T. As a consequence, T contains a linear combination
t = lx + l1x1 + ··· + lrxr .
Since x1,
··· , xr are linearly
independent over T, l
0, whence
x = -(l1/l)x1 - ··· - (lr/l)xr - (1/l)t.
However, since t is a linear combination of t1, ··· , tt, you can represent x as a linear combination of the vectors (45.2).
Auxiliary Theorem: If x1, ··· , xs is a system of vectors of Wk+1, which are linearly independent over Wk , the vectors Yx1, ··· ,Yxs are linearly independent over Wk-1.
Proof: If Yx1, ··· ,Yxs over Wk-1 were linearly dependent, there would not exist a non-trivial linear combination
x = g1Yx1+ ··· +gsYxs over Wk-1
which is contained in Wk-1. But then you would have
Y k-1x = Y k(g1x1+ ··· +gsxs) = o,
that is, g1x1+ ··· +gsxs is contained in Wk, which contradicts the assumption, whence the Theorem has been proved.
Construct now the
following special base for W. Let
be an
arbitrary base of W over Wp-1.
Then, according to the auxiliary Theoren\m,
are vectors of Wp-1,
which are linearly independent over Wp-2.
If in case of need you extend it by
to a base of Wp-2
over Wp-3, there arises the
base of Wp-2 over Wp-3
with the form
![]()
Continuing in this manner until we arrive at a base of W1 over W0, that is, since W0 = o, at
![]()
Combine all such relative bases to a base E of W in the sequence

If you subject these vectors to the mapping Y, you obtain with preservation of the sequence

Hence YE = CE with an (m,m)-matrix C, the form of which you can describe as follows:
We will understand by an elementary component Ck(0) of degree k > 1, belonging to the characteristic root 0, a (k,k)-matrix of the form

in which there occur units (1) in the diagonal above the principal diagonal and otherwise zeroes. An elementary component, belonging to 0, of degree 1 is the (1,1)-matrix 0. The matrix decomposes entirely into
| m1 | elementary components of degree | p | ||
| m2-m1 | " | p-1 | ||
| m3-m2 | " | p-2 | ||
| ····················································· | ||||
| mp-1-mp-2 | " | 2 | ||
| mp-mp-1 | " | 1* |
* If mk = mk+1, there do not occur elementary components of degree p - k.
Hitherto, it has been assumed that the matrix M, from which you started, had the characteristic root 0. However, if b is the characteristic root of M, then, by Theorem 23, M0=M-bE has the characteristic root 0, and the preceding reasoning can be applied to M0. Since
P-1MP = P-1M0P + bE,
decomposes P-1MP = completely into elementary components, which belong to b
