Solving gives and . A convenient normalized eigenvector is
The displayed nonzero vector proves that four is an eigenvalue. Every nonzero multiple represents the same eigendirection.
A vector perpendicular to has the form . Direct matrix multiplication gives
Thus every nonzero such vector is an eigenvector with . The zero vector must be excluded from the literal claim about “any” perpendicular vector, since an eigenvector is nonzero. The eigenspace is two-dimensional. Equivalently, exhibits the spectrum of a scalar matrix plus a rank-one projector.
Choose two perpendicular unit directions in the eigenspace:
Their pairwise dot products vanish and their Euclidean norms are one. They form an orthonormal basis of eigenvectors, with eigenvalues , as guaranteed for a real symmetric matrix by the spectral theorem for real symmetric matrices.
The trace is the sum of the eigenvalues, counting multiplicity, while the determinant is their product:
A direct expansion along the middle row checks the latter: .
Using the ordered orthonormal basis chosen in (c), the column matrix is
Other signs or another orthonormal choice within the repeated eigenspace are equally valid, provided the same choice is retained in the remaining parts.
The entry of is . Hence is an orthogonal matrix, whose matrix inverse equals its transpose:
This obtains the inverse without unnecessary cofactor calculations.
The eigenvector equations give . Multiplying on the left by therefore gives
This is an orthogonal diagonalization: the linear map acts independently by multiplication by its eigenvalues in the new orthonormal basis. The repeated eigenvalue explains the freedom to rotate the last two basis directions.

Articles by others on the same topic (0)

There are currently no matching articles.