Some matrices have two eigenvector lines that are almost one. Watch the two lines close in on each other and merge.
When eigenvectors collide
A(ε) = [1 1; 0 1 + ε]: as ε falls to 0, its two eigenvector lines become one.
A(ε) = [1 1; 0 1 + ε] at ε = 0.5: two eigenvalues, 1 and 1.5, and two eigenvector lines, through (1, 0) and (1, 0.5).
Describe this picture
One panel with the grid moved by and its two eigenvector lines, through and , the second dashed. Over 12 s, falls from 0.5 to 0, resting at 0.1 and at 0.01. The second line swings down onto the first: the angle between them is 26.57° (0.4636 radians) at , 5.71° (0.0997 radians) at 0.1 and 0.57° (0.0100 radians) at 0.01. At the two lines are one, and the grid is moved by a shear. Readouts give , the angle, and the determinant of the eigenvector matrix, which equals and falls to 0. One control after the clip: a slider for from 0 to 0.5.
Two lines become one
The matrix in the picture is triangular, so its eigenvalues are its diagonal entries, 1 and , as on Finding eigenvalues. Its eigenvectors are and : check that .
As shrinks, the second eigenvector tilts down onto the first. The eigenvector matrix
has determinant , so its inverse needs a division by and grows without limit. At the matrix is the shear, with the eigenvalue 1 twice and only one line of eigenvectors. Diagonalisation and matrix powers can’t handle it. This page shows what replaces the diagonal form.
Similar matrices
First, a way to compare matrices. If is any invertible matrix, then
is similar to . Read it right to left: turns coordinates on the grid of its columns into ordinary ones, acts, and turns the result back. So is the same map as , written on the grid of the columns of , as coordinates were on Independence, basis and dimension.
The same map has the same stretch factors, so similar matrices share their eigenvalues. In symbols, . So they share the trace and determinant too. Their eigenvectors differ: an eigenvector of appears as on the new grid.
Diagonalising is the case where the new grid is made of eigenvectors, so that comes out diagonal.
Same map, other coordinates
A and the similar matrix B = P⁻¹AP: different lines, the same stretch factors.
A = [1.5 1; 0.5 1] and the similar matrix B = [2.5 1; −1 0] move the grid in different ways.
Describe this picture
Two panels side by side (stacked on a phone). On the left, the square grid glides into the grid moved by , with the images of the two unit arrows. On the right, the grid glides into the one moved by the similar matrix . Then the eigenvector lines appear, dashed: through and on the left, through and on the right, each labelled with its stretch factor, the same pair in both panels, 2 and 0.5. There is no control.
Compare the two panels. The grids move differently, and the eigenvector lines sit in different places, but the stretch factors are the same.
Too few eigenvectors
A matrix whose eigenvectors can’t fill a grid is called defective. Take
Its trace is 4 and its determinant , so its polynomial is : the eigenvalue 2, twice. But has only the line of in its null space. One line, where a diagonal form would need two.
The missing direction comes from one step further. Look for a vector that sends to the eigenvector, not to zero:
Here works: . Such a is a generalised eigenvector. Use and as the new grid, , with :
The first column says . The second says : a stretch by 2, plus a push along .
The Jordan block
The matrix that came out is a Jordan block:
It is as close to diagonal as a defective matrix gets. The argument tells it apart from the exchange matrix of Transposes and permutations. Allowing complex numbers, every square matrix is similar to a matrix made of such blocks along its diagonal, a block of size 1 for each ordinary eigenvector, and longer blocks, with 1s just above the diagonal, where eigenvectors are missing. That arrangement is the Jordan form.
Its powers show what the extra 1 does. Squaring gives , and in general
Each new step multiplies the corner by and adds one more , so the corner counts the steps. The same happens in continuous time:
That corner is where solutions like come from. For the defective above, the equation of Linear differential equations, started at , has the solution
Check the slope at : , which is .
Sensitivity of the Jordan form
A Jordan block lives exactly at a collision, and the smallest nudge breaks it apart. Change the bottom-left zero of the shear to a tiny number, , a change in the tenth decimal place. The eigenvalues of
The characteristic polynomial is , so the eigenvalues move by the square root of the nudge, : a hundred thousand times more than the nudge itself. The picture shows the same thing from the other side. At the matrix still has two eigenvector lines, but they are 0.57° apart, which is 0.0100 radians, and its tenth power has a top-right corner of , against exactly 10 for the shear. The two are hard to tell apart.
For this reason programs do not compute the Jordan form of a measured matrix: rounding errors alone would change the answer. The Jordan form is a tool for understanding, not for computing.
Worked example
1. A similar copy. and , so . Then and . Trace 2.5 and determinant 1, so the eigenvalues are 2 and 0.5 again. The eigenvector of becomes , and indeed .
2. A defective matrix. : eigenvalue 2 twice, eigenvector , generalised eigenvector , Jordan form .
3. Powers. . For , the top-right entry of is 10.462.
Try these before you read the answers.
- Do similar matrices share their eigenvalues? Yes.
- Their eigenvectors? No: becomes .
- Eigenvectors of ? Only the line of .
- As falls to 0 in the picture, what happens to the angle between the eigenvector lines? It falls to 0°.
In signal processing · double poles
Transfer functions, poles and zeros, in the signal processing course, places a system’s poles. When two poles coincide at , the impulse response gains a term like , and an analog system gains . Both are the corner of a Jordan block. Samples count from , while matrix entries count from 1.
Where you’ll meet this
Critical damping. A door closer or a car suspension tuned to stop as fast as possible without swinging has a repeated eigenvalue. Its response is : the term is the Jordan block at work.
Double poles. In digital filters, a repeated pole gives responses like , as in the callout above.
What software does instead. Because the Jordan form is so fragile, numerical libraries use forms that rounding cannot upset, such as the Schur form, a triangular matrix reached through orthonormal coordinates, or the singular value decomposition.
Reference card
| Quantity | Formula | Notes |
|---|---|---|
| Similar | the same map on the grid of ‘s columns | |
| Shared | eigenvalues, trace, determinant | eigenvectors move to |
| Defective | fewer independent eigenvectors than | can’t be diagonalised |
| Generalised eigenvector | fills in the missing direction | |
| Jordan block | not the exchange matrix | |
| Powers | the corner counts the steps | |
| Exponential | source of | |
| Fragile | : | a tiny change splits the block |