A square matrix is a diagonalizable matrix over a specified field if some invertible matrix makes diagonal. Equivalently, the underlying vector space has a basis of eigenvectors of .
For example,
The first is already diagonal. The second has only the eigenvalue one, of algebraic multiplicity two, but its eigenspace consists of and has dimension one. It cannot supply a two-vector eigenbasis.
Every row sums to six, so is an eigenvector with eigenvalue six. Since is a real symmetric matrix, its other two eigenvalues, say , are real. The trace gives
Also, for a real symmetric matrix, is the sum of the squares of all its entries. Here
Thus . Together with their zero sum, this implies
By the spectral theorem for real symmetric matrices, choose an orthonormal eigenbasis corresponding to , with . Write and . This orthogonal change of coordinates gives
The plane constraint is therefore . On that plane the quadratic form vanishes exactly when
Consequently the entire set is
The two direction vectors are nonzero and not parallel, since are linearly independent. An invertible orthogonal transformation maps each full line to a full line. Thus the set consists of precisely two infinite lines through the origin.

Articles by others on the same topic (0)

There are currently no matching articles.