Diagonalization - Linear Algebra
- What is the eigenvector condition for an matrix to be diagonalizable?
- It must have linearly independent eigenvectors.
- What are the steps to diagonalize a matrix ?
- Find the eigenvalues, find a basis of each eigenspace, check that there are basis vectors in total, then put them in and the matching eigenvalues in .
- Which eigenvalue condition guarantees that an matrix is diagonalizable?
- Having distinct eigenvalues. This is sufficient but not necessary.
- In a diagonalization , what choices are not unique?
- The order of the eigenvalues in (with columns of reordered to match) and the choice and scaling of the eigenvector basis.
- If with diagonal with entries , what is ?
- . .
- A matrix has eigenvalues , and . Which diagonal matrix is it similar to (up to the order of entries)?
- The diagonal matrix with entries . Three distinct eigenvalues guarantee diagonalizability.
- What does it mean for a square matrix to be diagonalizable?
- for some invertible matrix and diagonal matrix .
- Why is not diagonalizable?
- Its only eigenvalue is , and the eigenspace has dimension , so there are not independent eigenvectors.
- A matrix has eigenvalues , and the eigenspace for is -dimensional. How many independent eigenvectors does it have?
- in total (). That is fewer than , so the matrix is not diagonalizable.
- In , what are the columns of and the diagonal entries of ?
- The columns of are linearly independent eigenvectors, and holds the matching eigenvalues in the same order.
- A diagonalizable matrix has every eigenvalue equal to . What must the matrix be?
- . .
- where the columns of are and , and . What is ?
- . and , so the eigenvalues are then .