The characteristic polynomial is . Solving the three eigenvector equations gives
Each eigenspace consists of the scalar multiples of its displayed nonzero vector. Their pairwise dot products vanish: and . This also agrees with the orthogonal diagonalization of a real symmetric matrix.
The Euclidean norms are and . With normalized eigenvectors as rows,
The rows form an orthonormal basis, so and is an orthogonal matrix. The zero eigenvalue means for a nonzero vector; thus is singular and has no matrix inverse.
The upper-left block is a planar rotation matrix. Its real characteristic polynomial is , which is strictly positive for real because the angle excludes integer multiples of . Hence any real eigenvector has . The remaining equation is , giving
There are infinitely many nonzero solutions, spanning one independent eigenvector direction.

Articles by others on the same topic (0)

There are currently no matching articles.