Write . If with , then , hence . The characteristic polynomial splits over and has degree , soThere is indeed an eigenvector for the eigenvalue zero: a nonzero vector in the last nonzero image of lies in its kernel of a linear map. For the bound, choose with , using minimality. The vectors are linearly independent. Otherwise choose the least with nonzero coefficient in a relation and apply ; only its nonzero multiple of survives, a contradiction. Therefore .
Suppose . Use the increasing chain of vector subspacesChoose a basis successively, extending a basis of each kernel of a linear map to one of the next kernel of a linear map. If a basis vector first enters at level , its image under belongs to , spanned entirely by earlier basis vectors. Thus every matrix column has nonzero entries only above its diagonal: the matrix is strictly upper triangular.
Conversely, for such a matrix and its ordered basis , one has . Iterating times kills every vector. Hence , establishing both directions without assuming a Jordan form.
The polynomials and are coprime. Bézout's identity gives polynomials with . SetFor every , the decompositionhas first summand in and second in , since and polynomial expressions in commute. If belongs to both kernels, the same Bézout identity gives . Thus . Both vector subspaces are invariant under .
Articles by others on the same topic
There are currently no matching articles.