Explain why \(n\) distinct eigenvalues guarantee diagonalisation of an \(n\times n\) matrix.
Question 12
***+
Explain why \(A=PDP^{-1}\) means the map is simple in eigenvector coordinates.
Question 13
****
Show that \(A=\begin{pmatrix}1&1\\0&1\end{pmatrix}\) is not diagonalizable.
Question 14
****
For which \(k\) is \(A=\begin{pmatrix}2&k\\0&2\end{pmatrix}\) diagonalizable?
Question 15
****+
Diagonalise \(A=\begin{pmatrix}4&0\\0&4\end{pmatrix}\) in two different ways.
Question 16
****+
A diagonalisation uses \(P=\begin{pmatrix}1&1\\1&-1\end{pmatrix}\) and \(D=\begin{pmatrix}6&0\\0&2\end{pmatrix}\). What are two eigenvector-eigenvalue pairs?
Question 17
****+
Find \(A\) from \(P=\begin{pmatrix}1&1\\0&1\end{pmatrix}\), \(D=\begin{pmatrix}2&0\\0&3\end{pmatrix}\), and \(A=PDP^{-1}\).
Question 18
*****
A student builds \(P\) from two eigenvectors that are scalar multiples. Explain why this cannot diagonalise a \(2\times2\) matrix.
Question 19
*****
Prove that \(AP=PD\) when \(P\) has eigenvectors as columns and \(D\) has matching eigenvalues.
Question 20
*****
Explain why repeated eigenvalues require checking eigenspace dimension before diagonalising.