Spectral Theorem - Linear Algebra
- How many distinct eigenvalues does the symmetric matrix (rows) have when ?
- Two distinct real eigenvalues. The discriminant of its characteristic polynomial is .
- A symmetric matrix has eigenvalues and , and is an eigenvector for . Which line is the eigenspace for ?
- The line spanned by . It must be orthogonal to .
- What is the spectral decomposition of a symmetric matrix with orthonormal eigenvectors and eigenvalues ?
- .
- What does the Spectral Theorem say about which real matrices are orthogonally diagonalizable?
- A real square matrix is orthogonally diagonalizable if and only if it is symmetric.
- If with orthogonal and diagonal, why must be symmetric?
- , since .
- What does the Spectral Theorem guarantee about the eigenvalues of a real symmetric matrix?
- They are all real. A real symmetric matrix has no non-real complex eigenvalues.
- Which of and (rows) is guaranteed orthogonally diagonalizable by the Spectral Theorem?
- , because it is symmetric.
- How are eigenvectors from distinct eigenvalues of a real symmetric matrix related?
- They are orthogonal.
- In the spectral decomposition, what does each matrix (with a unit vector) represent?
- The orthogonal projection onto the line spanned by , a rank 1 matrix.
- Why is orthogonally diagonalizable for every real matrix ?
- It is symmetric: .
- For a real symmetric matrix, how do each eigenvalue's algebraic and geometric multiplicities compare?
- They are equal for every eigenvalue, so the matrix is always diagonalizable.
- is symmetric with and for nonzero , . What is ?
- . Eigenvectors of a symmetric matrix for distinct eigenvalues are orthogonal.