Choose and . Then . Both are real matrices, as required.
Rearrange the identity into
Taking determinants gives . Hence , so is an invertible matrix, with . This uses that the matrices are finite and square: a right inverse then implies a two-sided inverse. Applying the identity to a vector in the kernel without first establishing commutation would not justify cancelling an on the wrong side. The argument is a case of invertibility forced by a polynomial product identity.
Multiply the original equation on the left by to obtain
Each term on the right commutes with . Thus
No general commutativity of matrix multiplication is being assumed; it follows from this particular expression for .
Let for a real eigenvalue and a nonzero real eigenvector . Part (b) gives and . The expression for in part (c) therefore gives
Consequently is a real eigenvalue of , with the same eigenvector . For a real matrix and real eigenvalue, a nonzero real vector can be chosen in the real kernel of ; no complex-vector assumption is needed.
For scalar , part (c) gives
The numerator is strictly positive for every real , and the denominator is nonzero. Therefore and hence is invertible. This proof uses the order structure of the real scalars; it does not say that the matrix must be nonsingular in higher dimension.
An integer-entry example is
Direct matrix multiplication gives , so adding and gives the zero matrix. Equivalently, this is the companion matrix of and has the two nonreal cube roots of unity as eigenvalues. The direct multiplication is already a complete proof. It also shows why part (e) does not extend to all real square matrices: with this , choosing satisfies the original product identity.

Articles by others on the same topic (0)

There are currently no matching articles.