Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof / 4 / a

Write $\hat{A}=\mathrm{diag}({\lambda }_1,\dots ,{\lambda }_n)$ and $v_i=P^{-1}{e}_i$, where $e_i$ are the standard basis vectors. Since $A{P}^{-1}=P^{-1}\hat{A}$,Thus the columns of $P^{-1}$ form an eigenbasis, and the requested ordered basis is $D=(P^{-1}{e}_1,\dots ,P^{-1}{e}_n)$. Its basis matrix is $P^{-1}$, giving $[t{]}_D=PA{P}^{-1}=\hat{A}$. More completely, for each distinct eigenvalue $\lambda$, its eigenspace isAll nonzero vectors in these eigenspaces are eigenvectors; when an eigenvalue repeats, they need not be individual columns of $P^{-1}$.