Home page for accesible maths 6 Jordan normal form

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

6.C Generalized eigenspaces

Especially starting in this section, and subsequently, we will usually consider matrices and vectors spaces with the field of the complex numbers, F=ℂ. The reason for doing so is the Fundamental Theorem of Algebra, which has two key consequences:

  • •

    Every monic polynomial of degree ≥1 is the product of linear factors (x-a),

  • •

    Every complex matrix has at least 1 eigenvalue.

We have seen several examples of matrices in Mn⁡(ℂ) which are not diagonalizable; in other words, for which ℂn does not have a basis consisting of eigenvectors. The following could be seen as a strategy to deal with this obstacle. Instead of considering only spaces of eigenvectors, we will consider a generalization of eigenvectors, as follows.

Definition 6.17:

Let A∈Mn⁡(ℂ) be a square complex matrix, and let λ∈ℂ be an eigenvalue of A. Then the generalized eigenspace of index i is:

Vλ(i):={x→∈ℂn|(A-λ⁢In)i⁢x→=0→}=ker⁡((A-λ⁢In)i).

Non-zero elements of Vλ(i) are called generalized eigenvectors of A.

For i=0, we have Vλ(0)=ker⁡In={0→}.

For i=1, we have Vλ(1)=ker⁡(A-λ⁢In)=Vλ, which is the usual eigenspace for λ.

Exercise 6.18:

Let A=[04-1-4]. It’s only eigenvalue is λ=-2. Prove that:

V-2(1)=span⁡{(2,-1)}

and

V-2(2)=ℂ2.
Exercise 6.19:

If A∈Mn⁡(ℂ), and λ is an eigenvalue, prove that Vλ(i)⊂Vλ(i+1).

[End of Exercise]

Example 6.20.

Let’s find the generalized eigenspaces with respect to the eigenvalue λ=5, for the following matrices in M3⁡(C):

  1. A=[510050003]

  2. B=[510051005]

(Solution:) For A, let’s compute the powers of the matrix A-5⁢I3.

  1. A-5⁢I3=[01000000-2]

  2. (A-5⁢I3)2=[01000000-2]⁢[01000000-2]=[000000004]

So, for any i≥3, multiplying by more copies will still give a matrix with zeros everywhere except the lower right entry. The generalized eigenspaces are the kernels of these matrices. So

  1. V5(1)=ker⁡(A-5⁢I3)=spanℂ⁡{(1,0,0)}

  2. V5(2)=ker(A-5I3)2=ker(diag(0,0,4))=spanℂ{(1,0,0),(0,1,0)}

  3. V5(i)=spanℂ⁡{(1,0,0),(0,1,0)} for all i≥3

Similarly for the matrix B, we compute the powers of the matrix B-5⁢I3:

  1. B-5⁢I3=[010001000].

  2. (B-5⁢I3)2=[010001000]⁢[010001000]=[001000000]

  3. (B-5⁢I3)3=[010001000]⁢[001000000]=0→

So, for any i≥4, multiplying by more copies will still give the zero matrix, so (B-5⁢I3)i=0→. Now we find the kernels of the above matrices:

  1. V5(1)=ker⁡(B-5⁢I3)=spanℂ⁡{(1,0,0)}

  2. V5(2)=ker(B-5I3)2=spanℂ{(1,0,0),(0,1,0)}

  3. V5(3)=ker⁡0→=ℂ3

  4. V5(i)=ℂ3 for all i≥4.

So, the dimensions of the generalized eigenspaces of A, for the eigenvalue λ=5 are 1,2,2,2,⋯, while the dimensions of the generalized eigenspaces for B for the eigenvalue λ=5 are 1,2,3,3,⋯.

The pattern in the previous example is that the generalized eigenspace dimension increases until a certain point, after which the dimensions stabilize. This is an example of a general phenomenon, stated in the following theorem.

Theorem 6.21.

Let B∈Mn⁡(C) be any matrix, and let r≥1.

ker⁡Br=ker⁡Br+1

implies

ker⁡Br=ker⁡Br+1=ker⁡Br+2=ker⁡Br+3=⋯
Proof.

We already know that ker⁡Br+1⊂ker⁡Br+2, we just need the reverse containment. Assume x→∈ker⁡Br+2, in other words, Br+2⁢x→=0→. This implies Br+1⁢(B⁢x→)=0→, which means B⁢x→∈ker⁡Br+1. Using the assumption of the theorem, B⁢x→∈ker⁡Br, in other words, Br⁢(B⁢x→)=0→. This is the same as saying x→∈ker⁡Br+1. So we have proved ker⁡Br+1=ker⁡Br+2. Using the same argument for the next exponent, and the next, etc, we have proved the theorem. This argument could also be worded using the language of induction. ∎

Corollary 6.22.

Let λ be an eigenvalue of A∈Mn⁡(C). If Vλ(r)=Vλ(r+1), then all generalized eigenspaces Vλ(r+i) for i≥0 are equal to each other.

Proof.

This is just Theorem 6.21 applied to the case when B=A-λ⁢In. ∎

Example 6.23.

Let A=[321031-1-4-1]. For each eigenvalue of A, find a basis for each generalized eigenspaces of A.

(Solution:) First, we determine the eigenvalues via the characteristic polynomial.

cA⁢(x)=det⁡[3-x2103-x1-1-4-1-x] =(3-x)⁢((3-x)⁢(-1-x)+4)-(2-(3-x))
=-x3+5⁢x2-8⁢x+4=(2-x)2⁢(1-x).

So the eigenvalues are λ=2 and λ=1.

λ=1: We compute the dimensions of the generalized eigenspaces as follows:

(A-I3)=[221021-1-4-2].

Since λ=1 is an eigenvalue, we have det⁡(A-I3)=0, and so rank⁡(A-I3)≠3. But two of its rows are clearly linearly independent, and so rank⁡(A-I3)≥2 by Theorem 4.25. This proves that rank⁡(A-I3)=2. By the dimension theorem, dim⁡ker⁡(A-I3)=1, in other words dim⁡V1(1)=1.

(A-I3)2=[221021-1-4-2]⁢[221021-1-4-2]=[342-1000-2-1].

This shows two rows of (A-I3)2 are linearly independent, and we can use that det⁡B⁢C=det⁡B⁢det⁡C to see that det⁡[(A-I3)2]=0. So rank(A-I3)2=2. By the dimension theorem again, V1(2)=dimker(A-I)2=1. Now by Theorem 6.21 all of the generalized eigenspaces for λ=1 are equal to each other:

V1(i)=spanℂ⁡{(0,1,-2)},

for all i≥1. So, in this case, a basis for each generalized eigenspace is the vector (0,1,-2).

λ=2: The computation is similar to the previous case:

(A-2⁢I3)=[121011-1-4-3].

This matrix is rank 2, and so dim⁡V2(1)=dim⁡ker⁡(A-2⁢I3)=1, by the dimension theorem. Moreover, the eigenspace is

V2(1)=spanℂ⁡{(1,-1,1)}.

To determine the next generalized eigenspace, we compute:

(A-2⁢I3)2=[121011-1-4-3]⁢[121011-1-4-3]=[000-1-3-2264].

Observe that the rows are scalar multiples of each other, and therefore the row space is 1-dimensional; in other words rank(A-2I3)2=1. So by the dimension theorem, dimV2(2)=dimker(A-2I3)2=2. We can express the generalized eigenspace as the span of 2 vectors as follows:

V2(2)=ker⁡[000-1-3-2264]=spanℂ⁡{(3,-1,0),(2,0,-1)}.

The next generalized eigenspace is the kernel of the following matrix:

(A-2⁢I3)3=[121011-1-4-3]⁢[000-1-3-2264]=[000132-2-6-4].

So ker(A-2I3)r=ker(A-2I3)2 for every r≥3. In particular,

V2(r)=spanℂ⁡{(3,-1,0),(2,0,-1)},

for all r≥3.

Since the sequence (3,-1,0),(2,0,-1) is linearly independent (it consists of two vectors which are not multiples of each other) and spans this generalized eigenspace, it forms a basis.

To summarize: the generalized eigenspaces for the eigenvalue λ=1 are of dimension 1,1,1,1,⋯, and they each have a basis (0,1,-2). The generalized eigenspaces for the eigenvalue λ=2 are of dimension 1,2,2,2,⋯, and the first one has a basis (1,-1,1), while each of the others has a basis (3,-1,0),(2,0,-1).

Exercise 6.24:

For each of the matrices in Exercise 6.15, in Mn⁡(ℂ), and for each eigenvalue λ, compute the dimensions and find a basis of each generalized eigenspace Vλ(i) for i≥1.

[End of Exercise]

In all of the above exercises and examples, the observant reader may have noticed that generalized eigenvectors for different eigenvalues are always linearly independent. This is always true (as stated in the following theorem), and the proof uses an induction argument which we omit.

Theorem 6.25.

Let A∈Mn⁡(C), and assume v1→,⋯,vr→ are generalized eigenvectors for different eigenvalues. Then v1→,⋯,vr→ are linearly independent.

As we will see, the dimensions of the generalized eigenspaces will be used to deduce the Jordan normal form; no other information is needed. But if you want to find a specific change of basis matrix P such that P-1⁢A⁢P is in Jordan normal form, this is equivalent to finding a Jordan basis, which is the purpose of the next section.