Construct an example of a 4×4 matrix, with one of its eigenvalues equal to −3, that is not diagonal or invertible, but is diagonalizable.
I know how to find the eigenvalues, and diagonalizing matrices. I can determine whether it is invertible or not. I know how to find the diagonal of a diagonalizable matrix, but answering this question seems to be a confusing task to do. All I can think of is trial and error, but surely there is a better way than that.
Any takes?
The idea is to construct an upper triangular matrix: its eigenvalues can be read off the diagonal. If these are distinct, the matrix is diagonalizable. If there is one zero, the matrix is singular. For example, $$ A = \pmatrix{0 & 1 & 0 & 0 \\0 & 1 & 0 & 0 \\0 & 0 & 2 & 0 \\0 & 0 & 0 & -3}. $$ Another idea is to construct a symmetric matrix with the prescribed properties, as symmetric matrices are diagonalizable. Here, my favorite is $$ B = \pmatrix{ -1 & -1 & -1 & 0\\ -1 & -1 & -1 & 0\\-1 & -1 & -1 &0\\0 & 0 & 0 & 0}. $$ It is clearly singular, and has eigenvalue of $-3$.