LINEAR-ALGEBRA · Interactive Practice | Unit 20 · Video 3
| Concept | Formula / Rule | Notes |
|---|---|---|
| Eigenvalue equation | Vector stays on its own line | |
| Characteristic equation | Solve for eigenvalues | |
| Trace & determinant | Useful check | |
| Triangular matrix | Eigenvalues diagonal entries | Upper or lower triangular |
| Symmetry rule | real ; imaginary | Conjugate pairs for real matrices |
A rotation by turns every real vector off its own line, so no real can be an eigenvector.
The shear has one repeated eigenvalue , yet it fixes only the horizontal line.
💡 Because the second independent eigenvector is missing, this shear is defective — it cannot be diagonalized.
Splitting , the symmetric part pushes the eigenvalues onto the real axis; the anti-symmetric part pushes them onto the imaginary axis.
Question 1
Consider the rotation matrix .
What are its eigenvalues?
✅ Correct! Anti-symmetric matrices have purely imaginary eigenvalues, always in conjugate pairs.
❌ Not quite. Compute , so .
Solution:
Set up the characteristic equation:
So , giving .
Check: , and .
This is the signature of an anti-symmetric matrix (): purely imaginary eigenvalues and no real eigenvectors.
Question 2
True or False: For a real matrix, if is an eigenvalue, then must also be an eigenvalue.
✅ Correct! Real matrices force complex eigenvalues to appear in conjugate pairs.
❌ Not quite. The characteristic polynomial of a real matrix has real coefficients, so complex roots must come in conjugate pairs.
Solution:
True. For a matrix with real entries, the characteristic polynomial has real coefficients. Any complex roots of a real polynomial come in complex conjugate pairs.
So if is an eigenvalue, then must also be an eigenvalue. This is why the rotation matrix has eigenvalues and together — they are conjugates.
Question 3
Consider . Find its eigenvalues and determine how many linearly independent eigenvectors it has.
✅ Correct! A repeated eigenvalue with fewer independent eigenvectors than its multiplicity makes the matrix defective.
❌ Not quite. Triangular matrix: eigenvalues are diagonal entries (5, 5). Now solve and count the free parameters.
Solution:
Since is upper triangular, the eigenvalues are the diagonal entries: (repeated).
Find the eigenvectors: Solve :
Row 1 gives . Row 2 gives (no info). So is free, :
Only 1 independent eigenvector — the x-axis direction. Algebraic multiplicity is 2, but geometric multiplicity is 1. The matrix is defective and cannot be diagonalized.
Question 4
Which statement about a matrix satisfying (symmetric) is TRUE?
✅ Correct! This is the Spectral Theorem — symmetric matrices are the well-behaved ideal case.
❌ Not quite. You're thinking of anti-symmetric or defective matrices. Symmetric matrices () are the ideal case.
Solution:
Symmetric matrices () have two very nice properties (the Spectral Theorem):
This is the "well-behaved ideal." The two pathologies we studied happen for other kinds of matrices:
Solved: 0 / 4