Diagonalisation of matrices
Studying this course? Keep your progress in one place.
Key facts
- A diagonal matrix is raised to a power by raising each diagonal entry to that power.
- With real eigenvalues, : the columns of are eigenvectors and holds the matching eigenvalues in the same order.
- : only is raised to the power.
- Check , which avoids finding .
- A matrix with no real eigenvalues cannot be diagonalised with real matrices.
Diagonal matrices
To raise a diagonal matrix to a power, raise each diagonal entry to that power.
A diagonal matrix has zeros everywhere except on the leading diagonal.
The same holds for . Diagonalisation uses this: it rewrites a matrix so the hard work is done on a diagonal matrix instead.
Evaluate .
Writing
Put the eigenvectors in the columns of and the matching eigenvalues, in the same order, on the diagonal of .
If has real eigenvalues with eigenvectors , then
This is diagonalisation. The th column of must go with the th diagonal entry of . Check by confirming .
- Columns of eigenvectors
- Diagonal of matching eigenvalues, same order
Worked example
Diagonalise .
- 1
The eigenvalues are and (trace 7, determinant 10).
- 2
The eigenvectors are for and for .
- 3
Put the eigenvectors in the columns: , with in the same order.
- 4
Invert: , so .
If the first column of is the eigenvector for and the second is the eigenvector for , what is ?
The method
Find the eigenvalues, then the eigenvectors, build and in matching order, and invert .
The steps always work, and the order of the eigenvalues is your choice.
Any non-zero multiples of the eigenvectors work, and any order works, provided and agree. So and are not unique.
Check by testing one entry of , or check .
- 1
Find the eigenvalues
solve
- 2
Find the eigenvectors
solve for each
- 3
Build and
eigenvectors as columns; eigenvalues in the same order
- 4
Find
for ,
Why is a useful check?
Powers of a matrix
The inner pairs cancel, so and only the diagonal entries are raised to the power.
This gives a formula for any . For :
The eigenvalues of are , and the eigenvectors stay the same. Check with (you get ) and (you get ).
Use the formula for above with . What matrix do you get?
3x3 and real eigenvalues
The method is identical for , but it needs real eigenvalues: a matrix with none cannot be diagonalised with real matrices.
For a matrix use a matrix of eigenvectors and a diagonal with three eigenvalues.
The method needs real eigenvalues. The rotation has characteristic equation , so no real eigenvalues and no real .
Real eigenvalues
- Diagonalise as
- Real and
- Powers by
No real eigenvalues
- e.g. rotation
- No real eigenvectors, cannot diagonalise with real matrices
Worked example
Find for .
- 1
The eigenvalues are , and , so .
- 2
The eigenvectors give .
- 3
Raise to the power 5: .
- 4
Compute .
Can the rotation be diagonalised using real matrices?
Try an exam question
has eigenvalues and with eigenvectors and respectively. Write in the form and hence find .
[5 marks]
- [1], with the eigenvectors as columns.
- [1], in the same order as the columns of .
- [1].
- [1] with .
- [1].
That's the notes covered.
Carry on to the next subtopic.
Try a question
Which of these pairs of matrices and satisfies ?
1 mark, marked against the mark scheme
Which of these pairs of matrices and satisfies ?
1 mark, marked against the mark scheme