The first coordinate direction is already an eigenvector of with eigenvalue . On the last two coordinates, the matrix is , with characteristic polynomialThus the three eigenvalues are . For , the last two components are equal; for , they are opposite. Normalising by the Euclidean norm gives the complete listEach sign-reversed vector is an equally valid choice. The three displayed eigenvectors are mutually orthogonal, as expected for a real symmetric matrix with distinct eigenvalues.
Subtracting the second row from the third gives a third row , so expansion along it shows . Thus the matrix inverse exists and every right-hand side has a unique solution.
To calculate it, temporarily solve with general . Subtracting the second equation from the third and from the first givesBack-substitution into the second equation givesThereforeFor the given right-hand side, matrix multiplication yields the unique answer
The three coordinate basis vectors are eigenvectors, so is diagonal in those coordinates. Exactly one coordinate is multiplied by , while the other two are fixed. The three possibilities areThey are respectively reflections in the coordinate planes , and . Each is a Householder reflection with unit normal equal to the coordinate eigenvector carrying the eigenvalue .
For each possibility in part (i), squaring the diagonal entries gives . Equivalently, the linear transformation fixes a vector space basis after being applied twice. ThereforeGeometrically, reflecting twice in the same plane returns every vector to itself.
Articles by others on the same topic
There are currently no matching articles.