Jump to content

Linear algebra (Osnabrück 2024-2025)/Part I/Lecture 28

From Wikiversity



A decomposition theorem

Theorem

Let

φ:VV

denote a trigonalizable K-endomorphism on the finite-dimensional K-vector space V. Then there exists a decomposition

φ=φdiag+φnil,

where φdiag is diagonalizable and φnil is nilpotent, and where

φdiagφnil=φnilφdiag
holds.

Proof  

Due to Lemma 26.14 , we have

V=H1Hm,

where the Hi are the generalized eigenspaces for the eigenvalues λi, and we have

φ=φ1φm

with φi=φ|Hi. Let

pi:VV

denote the composition VHiV, that is, pi is in particular a projection. We set

φdiag:=λ1p1++λmpm.

This mapping is obviously diagonalizable, on Hi it is the multiplication with λi. Sei

φnil:=φφdiag.

The property of this mapping of being nilpotent can be checked on the Hi separately. There, we have

(φφdiag)|Hi=φi(φdiag)|Hi=φiλiIdHi,

so this is nilpotent. Moreover, φj and pi commute, since pi induces the identity on Hi and on Hj, ji, the zero mapping. Therefore, also the direct sums of those commute, and hence also φ and φdiag commute. Thus, φdiag and φφdiag=φnil commute.


Under the conditions given in the theorem, this decomposition is even unique.


An endomorphism

φ:VV

on a K-vector space is called unipotent, if we can write

φ=IdV+ψ

with some nilpotent mapping

ψ.

For a unipotent mapping, the diagonalizable part in the sense of the canonical decomposition from Theorem 28.1 is simple, it is just the identity.



Jordan normal form

Let K be a field and λK. A Jordan matrix (to the eigenvalue λ) is a square matrix of the form[1]

(λ1000λ10000λ1000λ100λ).

If we consider such a Jordan matrix as a linear mapping φ on the standard space Kn, then

φ(e1)=λe1 and φ(ek)=λek+ek1 for all k2.

In particular, e1 is a eigenvector to the eigenvalue λ. A simple observation shows that there is no further eigenvector linearly independent to e1 (see Exercise 28.22 ). The property on the right is equivalent with the condition[2]

ek1=(φλId)(ek)

for k2. The eigenvector e1 is a generating element of the kernel of the mapping ψ:=φλId, and the other standard vectors ek arise successively as preimages of ek1 under ψ.


A square matrix of the form

(J1000J20000Jk1000Jk),

where each Ji is a Jordan matrix, is called a matrix in

Jordan normal form.

The Jordan matrices occurring here are called the Jordan blocks of the matrix. Their eigenvalues might be different or equal. In the matrix

(210000020000004100000410000040000002),

there are three Jordan blocks,

(2102),(410041004) and (2)

with eigenvalues 2,4 and again 2.

We state and prove now the theorem about the Jordan normal form for trigonalizable endomorphisms.


Theorem

For every trigonalizable endomorphism

φ:VV

on a finite-dimensional K-vector space V, there exists a basis, such that the describing matrix is in

Jordan normal form.

Proof  

Since φ is trigonalizable, we can apply Lemma 26.14 . Hence, there exists a direct sum decomposition

V=GeEigλ1(φ)GeEigλm(φ),

where the generalized eigenspaces are φ-invariant. Looking at the situation for each generalized eigenspace, we may assume that φ has only one eigenvalue λ, and that

V=GeEigλ(φ)

holds. Then,

ψ=φλIdV

is nilpotent. Therefore, because of Fact *****, there exists a basis such that ψ is described by a matrix of the form

(0c10000c200000cn20000cn1000),

where the ci equal 0 or equal 1. With respect to this basis,

φ=ψ+λIdV

has the form

(λc1000λc20000λcn2000λcn100λ).


Hence, every upper triangular matrix is similar to a matrix in Jordan normal form. Over the complex numbers, every matrix can be brought to Jordan normal form. If a matrix has Jordan normal form, then we can read of directly the diagonalizable and the nilpotent part in the sense of Theorem 28.1 : The diagonal yields the diagonalizable part, and the entries which are strictly above the diagonal, yield the nilpotent part (in general, this is not true for upper triangular matrices).


We describe how to find to a linear trigonalizable mapping φ:VV a basis, such that describing matrix with respect to this basis is in Jordan normal form. For this, we determine, for every eigenvalue λK, the minimal exponent s with

kern(φλId)s=kern(φλId)s+1.

This kernel is the generalized eigenspace to λ. We set

Vi=kern(φλId)iGeEigλ(φ)

for i=1,,s. This yields the chain

V1=Eig(λ)V2Vs1Vs=GeEigλ(φ).

Now, we choose a vector u from VsVs1. The vectors

u,(φλId)(u),(φλId)2(u),,(φλId)s1(u)

form a basis for a Jordan block. If this basis generates the generalized eigenspace, then we are done. Otherwise, we look in VsVs1 for another vector which is linearly independent to u and to Vs1. Again, we add this vector and all its successive images. If VsVs1 is exhausted, then we look whether Vs1Vs2 is already covered, and so on. If the generalized eigenspace to λ is covered, then we continue with the next eigenvalue.

Under certain circumstances, we can also start with a basis of the eigenspace. If, for example, the eigenspace to λ is one-dimensional, then we can choose an eigenvector v for λ, and we can find successively preimages under φλIdV of the vectors, that is, we have to solve the equation

v=(φλIdV)(v),

then

v=(φλIdV)(v),

etc.

If, for example, the eigenspace is k-dimensional and the generalized eigenspace is (k+1)-dimensional, then we only have to find a preimage for one eigenvector under φλIdV.


We consider the matrix

M=(221023002),

and want to bring it to Jordan normal form. bringen. The vector u=e1=(100) is an eigenvector to the eigenvalue 2. We have

A:=M2E3=(021003000),

so that there exists no further linearly independent eigenvector. We look at the linear system e1=Av. This imples (looking at the second row) v3=0 and so 2v2=1 (we can choose v1 freely to be 0). Hence, we set v=(0120). Finally, we need a solution for v=Aw. This yields the equation w=(011216). The matrix M acts as

Mu=2u,Mv=2v+u,Mw=2w+v,

so that the mapping is described with respect to the basis u,v,w by

(210021002).

This matrix is a Jordan matrix and, in particular, in Jordan normal form.


We consider the matrix

M=(200023002)

and want to bring it to Jordan normal form. The vectors u=e1=(100) and v=e2=(010) are linearly independent eigenvectors to the eigenvalue 2. We have

A:=M2E3=(000003000),

so that u and v span this eigenspace. An eigenvector must be the image of some vector under the matrix A. In fact, the linear system

e2=Aw

has the solution w=(0013). Therefore, the matrix M acts in the following way

Mu=2u,Mv=2v,Mw=2w+v.

Hence, the mapping is described, with respect to the basis u,v,w, by the matrix

(200021002).

This matrix is in Jordan normal form with the Jordan blocks (2) and (2102).


We consider the matrix

M=(3104012100100003)

and want to bring in in Jordan normal for. Here, we have two eigenvalues and, therefore, two two-dimensional generalized eigenspaces, which we treat separately. We have

M3E4=(0104042100400000),

therefore, (1000) belongs to the kernel. The determinant of the upper right submatrix is not 0, so the rank of the matrix is 3, and its kernel is one-dimensional. The second power is

(0104042100400000)2=(0104042100400000)(0104042100400000)=(0421016164001600000),

a new element of the kernel is (0104). Thus, we have

GeEig3(M)=(1000),(0104).

Because of

(0104042100400000)(0104)=(17000),

we can use the vectors (17000) and (0104) to establish the first Jordan block.

We have

M+1E4=(4104002100000004),

therefore, (1400) belongs to the kernel. The rank of this matrix is again 3, and the kernel has dimension one. The second power is

(4104002100000004)2=(4104002100000004)(4104002100000004)=(1642330004000000016),

a new element in the kernel is (0120). Thus, we have

GeEig1(M)=(1400),(0120).

Because of

(4104002100000004)(0120)=(1400),

we can use the vectors (1400) and (0120) to establish the second Jordan block. Altogether, the linear mapping defined by M has, with respect the basis

(17000),(0104),(1400),(0120),

the Jordan normal form

(3100030000110001).



Endomorphisms with finite order

In Lemma 24.11 , we have seen that permutation matrices over are diagonalizable. This is true over for all endomorphisms of finite order.


Lemma

Every invertible matrix MGLn() of finite order is

diagonalizable.

Proof  

The matrix is trigonalizable and can be brought, due to Theorem 28.5 , into Jordan normal form. We show that the Jordan blocks

(λ1000λ10000λ1000λ100λ)

are trivial. Because of the finite order, λ is a root of unity. By multiplying with λ1En, we can assume that we have a matrix of the form

(1a0001a00001a0001a001)

(with a0). If this is not an 1×1-matrix, then there exist two vectors u,v, where u is an eigenvector and where v is sent to v+au. The k-th iteration of the matrix sends v to v+kau, and this is never v, contradicting the property of being of finite order.




Footnotes
  1. Some authors define a Jordan matrix one where the 1 are below the diagonal.
  2. In the context of trigonalizable mappings and in order to find the Jordan normal form, it is useful to work with φλId instead of λIdφ.


<< | Linear algebra (Osnabrück 2024-2025)/Part I | >>
PDF-version of this lecture
Exercise sheet for this lecture (PDF)