A matrix bends almost every direction you feed it into something new. But "almost" is doing real work in that sentence — are there directions a given matrix leaves alone, only stretching them, never rotating them at all?
Drag around. For most positions, points somewhere completely different from — the rotation angle swings all over the place. But near two particular directions, that angle collapses toward : stops rotating and only scales.
A vector is an eigenvector of if doesn't rotate it at all — only scales it:
- — the matrix being analyzed.
- — the eigenvector: a direction only scales, never rotates.
- — the eigenvalue: how much that direction gets stretched (or flipped, if negative).
- Finding lambda first
Rearranging gives , which has a nonzero solution only when — a polynomial in called the characteristic polynomial. Its roots are exactly the eigenvalues.
- Then solving for each eigenvector
Once is known, becomes a system with a whole line of solutions — any nonzero vector along that line is a valid eigenvector for that eigenvalue.
- Eigenvectors need not be perpendicular
Unlike a symmetric matrix, a general matrix's eigenvectors don't have to be at right angles to each other — this chapter's example has eigenvectors at and , which are not orthogonal.
Watch the stretch ratio alongside the rotation angle. At each of the two special directions, the ratio locks onto a fixed number — that number is for that direction, no matter how far out you drag along it.
For :
- Solve the characteristic equation
, so and .
- Solve for the first eigenvector
These equations come from the matrix-vector multiplication in , where and the right-hand side is the zero vector . For :
-
Set up the matrix :
-
Set up the system :
-
Multiply row by row:
- Row 1:
- Row 2: — the same relation, no new information (exactly what guarantees)
So , giving direction . Check: . ✓
-
- Solve for the second eigenvector
For :
-
Set up the matrix :
-
Set up the system :
-
Multiply row by row — both rows are identical here, so they give the same equation twice:
- Row 1:
- Row 2: (identical to row 1)
So , giving direction . Check: . ✓
-
This matrix has two eigenvector directions (both with rotation angle 0). Drag v until Av points the same direction as v and the stretch ratio is 5 — that picks out the eigenvector for the larger eigenvalue. Hint: it's near (1, 1).
Every square matrix carries its own set of invariant directions — the eigenvectors — each with its own private scale factor, the eigenvalue. Finding them means solving one polynomial and then one linear system per root, no guessing required. Later chapters build directly on this: positive semi-definite matrices are defined by the sign of their eigenvalues, and the SVD generalizes this exact machinery to matrices that aren't even square.