Let be an eigenvector of the Hermitian matrix , with eigenvalue . Multiplying by givesThe denominator is the positive real number , whileThus the numerator is real, and every eigenvalue of a Hermitian matrix is real. This argument does not require distinct eigenvalues.
Take eigenvectors for distinct eigenvalues . Since the eigenvalues are real and is a Hermitian matrix,Hence , so eigenvectors for distinct eigenvalues are orthogonal vectors. They are therefore linearly independent; after normalization the given eigenvectors form an orthonormal basis of .
Use the conventionfor the characteristic polynomial. Choosing instead multiplies it by and leaves the requested zero identity unchanged. For each eigenvector , induction gives , including . Thusbecause has the nonzero kernel vector and therefore has zero determinant. Part (a) supplies a basis consisting of these eigenvectors. A linear map vanishing on every basis vector vanishes everywhere. ConsequentlyThis proves the Cayley-Hamilton theorem identity directly in the distinct-eigenvalue case assumed here.
Expand in the orthonormal basis from part (a). ThenFor , the weights are nonnegative and sum to one. The Rayleigh quotient therefore lies between the smallest and largest eigenvalues. Conversely, normalized extreme eigenvectors give, for ,Thus the exact Hermitian Rayleigh quotient range isWhen , the range is the singleton containing the sole eigenvalue.
There is no such universal constant. For a real parameter , consider the real matrixIts characteristic polynomial is , so both eigenvalues are real and . ButFor any proposed finite , choosing violates the proposed bound. This is an explicit illustration that nonnormal eigenvalues do not bound a quadratic quotient.
Articles by others on the same topic
There are currently no matching articles.