Skip to content

Similar matrices and the Jordan form

Watch two eigenvector lines close in and merge, meet the same map written in other coordinates, and see where the Jordan block and its extra factor of t come from.

Helps to know first
This topic

First, the picture

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).

ε
0.5
angle between the lines
26.57°
det of eigenvectors
0.5
0.00 / 12.00 s
Describe this picture

One panel with the grid moved by A(ε)=[1101+ε]\mathbf{A}(\varepsilon)=\begin{bmatrix}1&1\\0&1+\varepsilon\end{bmatrix} and its two eigenvector lines, through (1,0)(1,0) and (1,ε)(1,\varepsilon), the second dashed. Over 12 s, ε\varepsilon 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 ε=0.5\varepsilon=0.5, 5.71° (0.0997 radians) at 0.1 and 0.57° (0.0100 radians) at 0.01. At ε=0\varepsilon=0 the two lines are one, and the grid is moved by a shear. Readouts give ε\varepsilon, the angle, and the determinant of the eigenvector matrix, which equals ε\varepsilon and falls to 0. One control after the clip: a slider for ε\varepsilon 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 1+ε1+\varepsilon, as on Finding eigenvalues. Its eigenvectors are (1,0)(1,0) and (1,ε)(1,\varepsilon): check that A(ε) (1,ε)=(1+ε,  ε+ε2)=(1+ε) (1,ε)\mathbf{A}(\varepsilon)\,(1,\varepsilon)=(1+\varepsilon,\;\varepsilon+\varepsilon^2)=(1+\varepsilon)\,(1,\varepsilon).

As ε\varepsilon shrinks, the second eigenvector tilts down onto the first. The eigenvector matrix

V=[110ε]\mathbf{V}=\begin{bmatrix}1&1\\0&\varepsilon\end{bmatrix}

has determinant ε\varepsilon, so its inverse needs a division by ε\varepsilon and grows without limit. At ε=0\varepsilon=0 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 V\mathbf{V} is any invertible matrix, then

B=V−1AV\mathbf{B}=\mathbf{V}^{-1}\mathbf{A}\mathbf{V}

is similar to A\mathbf{A}. Read it right to left: V\mathbf{V} turns coordinates on the grid of its columns into ordinary ones, A\mathbf{A} acts, and V−1\mathbf{V}^{-1} turns the result back. So B\mathbf{B} is the same map as A\mathbf{A}, written on the grid of the columns of V\mathbf{V}, as coordinates were on Independence, basis and dimension.

The same map has the same stretch factors, so similar matrices share their eigenvalues. In symbols, det⁡(B−λI)=det⁡(V−1(A−λI)V)=det⁡(A−λI)\det(\mathbf{B}-\lambda\mathbf{I})=\det\big(\mathbf{V}^{-1}(\mathbf{A}-\lambda\mathbf{I})\mathbf{V}\big)=\det(\mathbf{A}-\lambda\mathbf{I}). So they share the trace and determinant too. Their eigenvectors differ: an eigenvector v\mathbf{v} of A\mathbf{A} appears as V−1v\mathbf{V}^{-1}\mathbf{v} on the new grid.

Diagonalising is the case where the new grid is made of eigenvectors, so that B\mathbf{B} 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.

0.00 / 7.60 s
Describe this picture

Two panels side by side (stacked on a phone). On the left, the square grid glides into the grid moved by A=[1.510.51]\mathbf{A}=\begin{bmatrix}1.5&1\\0.5&1\end{bmatrix}, with the images of the two unit arrows. On the right, the grid glides into the one moved by the similar matrix B=[2.51−10]\mathbf{B}=\begin{bmatrix}2.5&1\\-1&0\end{bmatrix}. Then the eigenvector lines appear, dashed: through (2,1)(2,1) and (1,−1)(1,-1) on the left, through (2,−1)(2,-1) and (1,−2)(1,-2) 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

A=[31−11].\mathbf{A}=\begin{bmatrix}3&1\\-1&1\end{bmatrix}.

Its trace is 4 and its determinant 3+1=43+1=4, so its polynomial is λ2−4λ+4=(λ−2)2\lambda^2-4\lambda+4=(\lambda-2)^2: the eigenvalue 2, twice. But A−2I=[11−1−1]\mathbf{A}-2\mathbf{I}=\begin{bmatrix}1&1\\-1&-1\end{bmatrix} has only the line of v=(1,−1)\mathbf{v}=(1,-1) 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 w\mathbf{w} that A−2I\mathbf{A}-2\mathbf{I} sends to the eigenvector, not to zero:

(A−2I) w=v.(\mathbf{A}-2\mathbf{I})\,\mathbf{w}=\mathbf{v}.

Here w=(1,0)\mathbf{w}=(1,0) works: (A−2I)(1,0)=(1,−1)(\mathbf{A}-2\mathbf{I})(1,0)=(1,-1). Such a w\mathbf{w} is a generalised eigenvector. Use v\mathbf{v} and w\mathbf{w} as the new grid, V=[11−10]\mathbf{V}=\begin{bmatrix}1&1\\-1&0\end{bmatrix}, with V−1=[0−111]\mathbf{V}^{-1}=\begin{bmatrix}0&-1\\1&1\end{bmatrix}:

V−1AV=[2102].\mathbf{V}^{-1}\mathbf{A}\mathbf{V}=\begin{bmatrix}2&1\\0&2\end{bmatrix}.

The first column says Av=2v\mathbf{A}\mathbf{v}=2\mathbf{v}. The second says Aw=v+2w\mathbf{A}\mathbf{w}=\mathbf{v}+2\mathbf{w}: a stretch by 2, plus a push along v\mathbf{v}.

The Jordan block

The matrix that came out is a Jordan block:

J(λ)=[λ10λ].\mathbf{J}(\lambda)=\begin{bmatrix}\lambda&1\\0&\lambda\end{bmatrix}.

It is as close to diagonal as a defective matrix gets. The argument (λ)(\lambda) tells it apart from the exchange matrix J\mathbf{J} 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 [λ22λ0λ2]\begin{bmatrix}\lambda^2&2\lambda\\0&\lambda^2\end{bmatrix}, and in general

J(λ)k=[λkkλk−10λk].\mathbf{J}(\lambda)^k=\begin{bmatrix}\lambda^k&k\lambda^{k-1}\\0&\lambda^k\end{bmatrix}.

Each new step multiplies the corner by λ\lambda and adds one more λk\lambda^k, so the corner counts the steps. The same happens in continuous time:

eJ(λ) t=eλt[1t01].e^{\mathbf{J}(\lambda)\,t}=e^{\lambda t}\begin{bmatrix}1&t\\0&1\end{bmatrix}.

That corner tt is where solutions like t eλtt\,e^{\lambda t} come from. For the defective A\mathbf{A} above, the equation du/dt=Au\mathrm{d}\mathbf{u}/\mathrm{d}t=\mathbf{A}\mathbf{u} of Linear differential equations, started at (1,0)(1,0), has the solution

u(t)=e2t (1+t,  −t).\mathbf{u}(t)=e^{2t}\,(1+t,\;-t).

Check the slope at t=0t=0: 2 (1,0)+(1,−1)=(3,−1)2\,(1,0)+(1,-1)=(3,-1), which is A (1,0)\mathbf{A}\,(1,0).

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, 10−1010^{-10}, a change in the tenth decimal place. The eigenvalues of

[1110−101]are1±10−5.\begin{bmatrix}1&1\\10^{-10}&1\end{bmatrix}\quad\text{are}\quad 1\pm10^{-5}.

The characteristic polynomial is (λ−1)2−10−10(\lambda-1)^2-10^{-10}, so the eigenvalues move by the square root of the nudge, 10−510^{-5}: a hundred thousand times more than the nudge itself. The picture shows the same thing from the other side. At ε=0.01\varepsilon=0.01 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 (1.0110−1)/0.01=10.462\big(1.01^{10}-1\big)/0.01=10.462, 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. A=[1.510.51]\mathbf{A}=\begin{bmatrix}1.5&1\\0.5&1\end{bmatrix} and V=[1011]\mathbf{V}=\begin{bmatrix}1&0\\1&1\end{bmatrix}, so V−1=[10−11]\mathbf{V}^{-1}=\begin{bmatrix}1&0\\-1&1\end{bmatrix}. Then AV=[2.511.51]\mathbf{A}\mathbf{V}=\begin{bmatrix}2.5&1\\1.5&1\end{bmatrix} and B=V−1AV=[2.51−10]\mathbf{B}=\mathbf{V}^{-1}\mathbf{A}\mathbf{V}=\begin{bmatrix}2.5&1\\-1&0\end{bmatrix}. Trace 2.5 and determinant 1, so the eigenvalues are 2 and 0.5 again. The eigenvector (2,1)(2,1) of A\mathbf{A} becomes V−1(2,1)=(2,−1)\mathbf{V}^{-1}(2,1)=(2,-1), and indeed B(2,−1)=(4,−2)=2 (2,−1)\mathbf{B}(2,-1)=(4,-2)=2\,(2,-1).

2. A defective matrix. [31−11]\begin{bmatrix}3&1\\-1&1\end{bmatrix}: eigenvalue 2 twice, eigenvector (1,−1)(1,-1), generalised eigenvector (1,0)(1,0), Jordan form [2102]\begin{bmatrix}2&1\\0&2\end{bmatrix}.

3. Powers. J(1)10=[11001]\mathbf{J}(1)^{10}=\begin{bmatrix}1&10\\0&1\end{bmatrix}. For ε=0.01\varepsilon=0.01, the top-right entry of A(ε)10\mathbf{A}(\varepsilon)^{10} is 10.462.

Try these before you read the answers.

  • Do similar matrices share their eigenvalues? Yes.
  • Their eigenvectors? No: v\mathbf{v} becomes V−1v\mathbf{V}^{-1}\mathbf{v}.
  • Eigenvectors of [2102]\begin{bmatrix}2&1\\0&2\end{bmatrix}? Only the line of (1,0)(1,0).
  • As ε\varepsilon 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 aa, the impulse response gains a term like n ann\,a^n, and an analog system gains t eatt\,e^{at}. Both are the corner of a Jordan block. Samples count from n=0n=0, 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 (c1+c2t) e−at(c_1+c_2t)\,e^{-at}: the t e−att\,e^{-at} term is the Jordan block at work.

Double poles. In digital filters, a repeated pole gives responses like n ann\,a^n, 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

QuantityFormulaNotes
SimilarB=V−1AV\mathbf{B}=\mathbf{V}^{-1}\mathbf{A}\mathbf{V}the same map on the grid of V\mathbf{V}‘s columns
Sharedeigenvalues, trace, determinanteigenvectors move to V−1v\mathbf{V}^{-1}\mathbf{v}
Defectivefewer independent eigenvectors than nncan’t be diagonalised
Generalised eigenvector(A−λI) w=v(\mathbf{A}-\lambda\mathbf{I})\,\mathbf{w}=\mathbf{v}fills in the missing direction
Jordan blockJ(λ)=[λ10λ]\mathbf{J}(\lambda)=\begin{bmatrix}\lambda&1\\0&\lambda\end{bmatrix}not the exchange matrix J\mathbf{J}
PowersJ(λ)k=[λkkλk−10λk]\mathbf{J}(\lambda)^k=\begin{bmatrix}\lambda^k&k\lambda^{k-1}\\0&\lambda^k\end{bmatrix}the corner counts the steps
ExponentialeJ(λ)t=eλt[1t01]e^{\mathbf{J}(\lambda)t}=e^{\lambda t}\begin{bmatrix}1&t\\0&1\end{bmatrix}source of t eλtt\,e^{\lambda t}
Fragile[1110−101]\begin{bmatrix}1&1\\10^{-10}&1\end{bmatrix}: λ=1±10−5\lambda=1\pm10^{-5}a tiny change splits the block

Keep reading with a free account.

By creating an account you accept the terms of use.

Sign in

Already have an account? Use the service you signed up with.

Or keep reading: get new lessons by email

Are you 13 or over?

Accounts and email updates are for people aged 13 or over. We keep only your answer, never your date of birth.

End of the lesson

Where to go next.

Phasorium

Account

Sign inKeep your place on any device

Subjects

Site

Look