Let be the Cartesian basis vectors, with the given vector . The permutation matrix cycles them forward:
Thus three applications return the original vector.
Interchanging the rows and columns gives the matrix transpose
It cycles the three basis vectors in the opposite direction. Hence
The preceding cycles show the action on a full basis, not only on one direction: sends , and reverses each arrow. Therefore either composition fixes every basis vector, and by linearity fixes every vector. Thus
In particular is an orthogonal matrix, , and .
For an eigenvector , the equation reads
A nonzero solution requires . Write the three roots of unity in the requested polar form of a complex number:
Indeed satisfies all three equations. These eigenvectors are unnormalized; any nonzero scalar multiples are equally valid.
Since , each eigenvector from part (d) remains an eigenvector, with reciprocal eigenvalue:
The set of eigenvalues is again , with the two nonreal values exchanged relative to the same eigenvectors. Equivalently, for one can choose the eigenvector . Pairing each eigenvalue with its eigenvector matters in the next part.
The symmetric part of a matrix is
It satisfies . The complementary term is a skew-symmetric matrix.
Use the common eigenvectors of and . For each ,
Thus, without constructing explicitly, its eigenvalues are
The eigenvalue has direction . The repeated eigenvalue has a real eigenspace consisting of vectors whose coordinates sum to zero. This is the general rule for the symmetric part of an orthogonal matrix. Adding unrelated lists of eigenvalues would not suffice; here the shared eigenvectors justify the pairing.

Articles by others on the same topic (0)

There are currently no matching articles.