Eigenvalues and Eigenvectors

linear transformations

Let 𝝋 : 𝑼 𝑼 be a linear transformation. A non-zero vector 𝒖 is an eigenvector for 𝝋 if

𝝋 (𝒖 ) = λ𝒖

The value λ is eigenvalue for the eigenvector 𝒖.

square matrices

Let M be an n×n matrix. A non-zero vector 𝒖 is an eigenvector for M if

M𝒖 = λ𝒖

The value λ is eigenvalue for the eigenvector 𝒖.

Computing via linear dependence

powers

Let L be an n×n matrix.

L0 = In L1 = LIn L2 = LL1 L3 = LL2 Lk+1 = LLk

Polynomials

For a polynomial

p(x) = a0 +a1x +a2 x2 + +ak-1 xk-1 +xk = a0 x0 +a1 x1 +a2 x2 + +ak-1 xk-1 +xk = (x- λ1 ) m1 (x- λ2 ) m2 (x- λt ) mt

and n×n matrix L define

p(L) = a0 L0 +a1 L1 +a2 L2 + +ak-1 Lk-1 +Lk = (L- λ1 In ) m1 (L- λ2 In ) m2 (L- λt In ) mt

recursive application

For a non-zero vector 𝒖 and matrix L

𝒖0 = 𝒖 = L0 𝒖 𝒖1 = L 𝒖0 = L1 𝒖 𝒖2 = L 𝒖1 = L2 𝒖 𝒖 k+1 = L 𝒖k = Lk+1 𝒖

Linear dependence

𝒐 = α0 𝒖0 𝒐 = α0 𝒖0 + α1 𝒖1 𝒐 = α0 𝒖0 + α1 𝒖1 + α2 𝒖2 𝒐 = α0 𝒖0 + α1 𝒖1 + α2 𝒖2 + + αk-1 𝒖k-1 𝒐 = α0 𝒖0 + α1 𝒖1 + α2 𝒖2 + + αk-1 𝒖k-1 + αk 𝒖k

Rewrite

Set ai = αi αk to obtain

𝒐 = a0 𝒖0 + a1 𝒖1 + a2 𝒖2 + + ak-1 𝒖k-1 + 𝒖k = a0 L0 𝒖 + a1 L1 𝒖 + a2 L2 𝒖 + + ak-1 Lk-1 𝒖 + Lk 𝒖 = ( a0 L0 +a1 L1 +a2 L2 + +ak-1 Lk-1 +Lk ) 𝒖 = (L- λk In ) (L- λk-1 In ) (L- λ2 In ) (L- λ1 In ) 𝒖

the eigenvector

𝒐 𝒛0 = 𝒖 𝒛1 = (L- λ1 In ) 𝒛0 = (L- λ1 In ) 𝒖 𝒛2 = (L- λ2 In ) 𝒛1 = (L- λ2 In ) (L- λ1 In ) 𝒖 𝒛i = (L- λi In ) 𝒛 i-1 𝒐 = 𝒛k = (L- λk In ) 𝒛 k-1 = (L- λk In ) (L- λk-1 In ) (L- λ2 In ) (L- λ1 In ) 𝒖

Computing via determinant

eigenvalue condition

The number λ is an eigenvalue for matrix L if and only if

det(L- λ In ) =0

algorithm

  1. Compute p(λ)= det(L- λ In )

  2. Find roots λ1 , λ2 , ,λn

  3. For each λi solve

    (L- λi In ) 𝒙 = 𝒐

characteristic polynomial

and equation

The characteristic polynomial of L is

p(λ)= det(L- λ In )

The characteristic equation of L is

det(L- λ In )=0

Properties

eigenspace

The eigenspace of transformation 𝝋 associated with eigenvalue λ is

𝑽λ = { 𝒖 𝑽 𝝋( 𝒖 ) = λ 𝒖 }

correctness

The eigenspace is a subspace.

multiplicities

For p(x) = (x- λ1 ) m1 (x- λ2 ) m2 (x- λt ) mt

  • mi is algebraic multiplicity λi
  • dim𝑽 λi is geometric multiplicity λi

linear independence

Eigenvectors with distinct eigenvalues are linearly independent.

Diagonal form

similar matrices

Two matrices A and B are similar if there is matrix S such that

A= S-1 B S

diagonalizable matrix

A matrix is diagonalizable if and only if it is similar to a diagonal matrix. A matrix that is not diagonalizable is called defective.

diagonalizable matrix

An n×n matrix is diagonalizable if and only if it has n linearly independent eigenvectors.