The matrix trace is the sum of diagonal entries:
Consequently
The first diagonal entry is in the original PDF.
Expanding the determinant along the first row gives
Under the matrix trace condition , this simplifies to . A square matrix is invertible exactly when its determinant is nonzero. Thus
The characteristic polynomial of is
Its distinct eigenvalues are and . For , the eigenvector relation gives , so choose . For , it gives , so choose . Put these independent eigenvectors into columns:
Then column by column. Also , so this choice supplies the diagonalization of a matrix . Scaling columns or interchanging their order gives other valid choices, with the matching order in .
For the choice of in part (b)(i), the two-by-two matrix inverse formula gives
Multiplication gives , providing a direct check.
The expression assumes is invertible. By the cyclic property of the trace,
For a real or complex antisymmetric matrix, forces every diagonal entry to satisfy , hence . Therefore
This also demonstrates invariance of the matrix trace under matrix similarity. Antisymmetry of itself is not needed.
An orthogonal matrix has orthonormal columns. The first column of has squared norm , so . Orthogonality of the two columns then gives , hence . The second column must have squared norm . Therefore
Both resulting matrices satisfy directly.
Among the two orthogonal matrices from part (d)(i), gives , a rotation matrix through angle . For , the determinant is , so the matrix reverses orientation and is a reflection rather than a rotation:
It is the reflection matrix across the axis.
For any real square matrix , the symmetric and antisymmetric parts of a matrix give , whose summands are respectively a symmetric matrix and an antisymmetric matrix. Here it gives
Transposing the first summand leaves it unchanged; transposing the second changes its sign. Entrywise addition recovers the original matrix. The decomposition is unique because a matrix that is both symmetric and antisymmetric must be zero.

Articles by others on the same topic (0)

There are currently no matching articles.