Matrix - Diagonalization

Diagonalization is the process of finding a diagonal matrix that is similar to a given square matrix . This is done by finding an invertible matrix such that:

Where:

  • is a diagonal matrix containing the eigenvalues of on its main diagonal.
  • is a matrix whose columns are the corresponding eigenvectors of .
  • is the inverse of matrix .

Finding

The columns of are the linearly independent eigenvectors of . These columns can be put in any order.

As well, the diagonal elements of are the corresponding eigenvalues of , arranged in the same order as their respective eigenvectors in .

This process is called Eigenvalue Decomposition.

Conditions for Diagonalization

A matrix is diagonalizable if and only if it has enough linearly independent eigenvectors to form the matrix . Specifically, for an matrix, there must be linearly independent eigenvectors.

Examples

Example 1

Problem Statement

Consider the matrix

Diagonalize if possible.

Solution

Starting with the Matrix Characteristic Equation

Expanding the determinant

Simplifying yields

Note: has multicity of 2, meaning its eigenspace has a maximum dimension of 2

Begin with :

  1. construct the homogenous equation
  2. construct the augmented matrix
  3. Apply row reduction to bring the matrix to RREF

Free variable:

The Eigenspace is now the span of these vectors. That is,

Next

performing the same calculation yields the following eigenspace:

Therefore, the matrix has 3 linearly independent eigenvectors

Conclusion

Thus, we conclude that is diagonalizable and

Example 2

Problem Statement

Diagonalize the following matrix

SOlution

Therefore, both of multiplicity . Then, applying the characteristic equation and setting

And then

For simplicity, we can choose , s can be any real number

As there are eigenvectors, is diagonalizable and:

Diagonalizing

Now raising both sides to the power of

Any instance of , so the right side can be simplified to:

Raising a diagonal matrix to a power is very easy, as in general:

Therefore: