Let . A concrete real matrix isIts first coordinate has eigenvalue . The lower block has characteristic polynomial , whose roots are . Thus this example has all three required eigenvalues. It is also an orthogonal matrix, but orthogonality is not forced by its spectrum, as the second part shows.
True. All three eigenvalues are distinct in , so their nonzero eigenvectors are linearly independent. Here is a direct proof of that assertion. If , apply to obtainDistinctness makes both scalar factors nonzero, hence . Applying the analogous products gives . The three eigenvectors therefore form a basis of . Taking them as the columns of givesThis proves that every such matrix is a diagonalizable matrix over , rather than merely showing it for the example.
False. Consider the real matrixIt is block upper triangular, so its characteristic polynomial is the same as that of and it has the required eigenvalues. Its second column, however, has squared Euclidean norm , whereas every column of an orthogonal matrix has norm one. ThusUnit-modulus eigenvalues alone do not imply orthogonality; they do not control the geometry of the eigenvectors.
False; in fact no matrix with this spectrum is diagonalizable over . If a real invertible gave with a real diagonal matrix, all eigenvalues of would be the real diagonal entries of . But two of the required eigenvalues have nonzero imaginary parts. This contradiction provesThe real block form in the initial example is consistent with this: a two-dimensional rotation block is not a real diagonalization.
Articles by others on the same topic
There are currently no matching articles.