The conjugate transpose reverses the order of matrix multiplication. Since and are Hermitian matrices,
Consequently : the condition is exactly that the two matrices commute.
Take . Indeed the conjugate transpose is
so the anticommutator is a Hermitian matrix. The original PDF, p. 6, supplies the factor that is corrupted in the local OCR.
Using the conjugate transpose and the Hermitian matrix assumptions,
Thus is a Hermitian matrix, whether or not and commute.
Put , so . Because the Hermitian matrices commute,
For every nonzero vector ,
since is an invertible matrix. Thus and are invertible matrices, justifying the inverse in the definition of . The conjugate transpose of is . Since and commute, their inverses do too, and
Hence is a unitary matrix.
For the unitary matrix , . Therefore is a Hermitian matrix:
Every positive integer power remains a Hermitian matrix, since . Its eigenvalues are real by the finite-dimensional spectral theorem. Equivalently, matrix similarity gives
whose eigenvalues are , where the are the real eigenvalues of .
Complete the square in the Hermitian matrix polynomial:
For every nonzero vector ,
Thus is a positive-definite matrix, so . In finite-dimensional spectral theorem terms, each eigenvalue is
If , the scalar polynomial has real roots of a polynomial
An allowed nonzero root can be an eigenvalue of , a Hermitian matrix which is also an invertible matrix, in which case has a zero eigenvalue. For example, , , gives . The weaker inequality does not force failure for every ; it removes the general positive lower bound. There is also the harmless corner , for which stays positive definite because is invertible, even though the strict discriminant hypothesis is absent.

Articles by others on the same topic (0)

There are currently no matching articles.