Jordan Canonical Form and Defective Matrices

Diagonalization is the first great triumph of linear algebra: pick the eigenvectors as a basis and an operator collapses to a list of numbers on the diagonal, its whole action laid bare. But it is not universal. There exist perfectly ordinary matrices — the 2×22\times2 shear (λ10λ)\begin{pmatrix}\lambda&1\\0&\lambda\end{pmatrix} is the smallest — that simply lack enough eigenvectors to fill a basis, and no change of coordinates can diagonalize them because the obstruction is intrinsic. The Jordan canonical form is the definitive answer to what the simplest representation looks like when diagonalization fails, valid for every square matrix over an algebraically closed field like C\mathbb{C}. The failure has a precise diagnosis. Every eigenvalue λ\lambda carries two counts: its algebraic multiplicity mam_a (its order as a root of the characteristic polynomial) and its geometric multiplicity mg=dim⁡ker⁡(A−λI)m_g=\dim\ker(A-\lambda I) (the number of independent eigenvectors). Always mg≤mam_g\le m_a; when the inequality is strict the eigenvalue is defective and its eigenvectors cannot span. The cure is to enlarge the eigenspace to the generalized eigenspace ker⁡(A−λI)m\ker(A-\lambda I)^m, whose dimension always equals mam_a, and to organize the extra vectors into chains. Each chain becomes one Jordan block: λ\lambda on the diagonal, a telltale row of 11s on the superdiagonal, nothing else. For a physicist the payoff is operational. Functions of a matrix — above all the propagator eAte^{At} that solves linear evolution — are computed block by block, and the size of a Jordan block dictates the highest power of tt multiplying the exponential. Critical damping, resonance, secular growth in perturbation theory, and the exceptional points of non-Hermitian optics are all places where a matrix goes defective and a stray factor of tt enters the physics. Jordan form makes those moments exact.

Key takeaways
  • Not every operator on a finite-dimensional complex space is diagonalizable; when an eigenvalue's geometric multiplicity falls short of its algebraic multiplicity the matrix is defective, and no similarity can diagonalize it.
  • The Jordan canonical form writes any complex matrix as a block-diagonal sum of Jordan blocks Jk(λ)J_k(\lambda), each carrying one eigenvalue λ\lambda on its diagonal and 11s on its first superdiagonal.
  • Each block is built from a chain of generalized eigenvectors — vectors killed by (A−λI)k(A-\lambda I)^k but not (A−λI)k−1(A-\lambda I)^{k-1} — that fill the deficit ordinary eigenvectors leave behind.
  • The number of blocks for λ\lambda is its geometric multiplicity; the total size is its algebraic multiplicity; the exact block sizes are fixed only by the ranks of successive powers (A−λI)j(A-\lambda I)^j.
  • Jordan form makes matrix functions and the propagator eAte^{At} explicit, including the polynomial-times-exponential terms tk−1eλtt^{k-1}e^{\lambda t} that are the fingerprint of defectiveness.
  • The split A=D+NA=D+N into a diagonalizable part and a commuting nilpotent part (the Jordan–Chevalley decomposition) is the computational engine behind all of it.
  • Key idea: a defective eigenvalue cannot supply enough eigenvectors, so one builds chains of generalized eigenvectors (A−λI)vj=vj−1(A-\lambda I)v_j=v_{j-1}; each chain becomes a Jordan block with λ\lambda on the diagonal and ones above it, and the collection of all chains is a basis in which AA is block diagonal.
The core insight

A defective eigenvalue cannot supply enough eigenvectors, so one builds chains of generalized eigenvectors (A−λI)vj=vj−1(A-\lambda I)v_{j}=v_{j-1}; each chain becomes a Jordan block with λ\lambda on the diagonal and ones above it, and the collection of all chains forms a basis in which AA is block diagonal.

Where this lives today

Defective matrices are no longer a textbook curiosity. The liveliest arena is non-Hermitian physics: an open quantum system, a lossy cavity, or a PT\mathcal{PT}-symmetric photonic lattice is governed by an effective non-Hermitian Hamiltonian whose eigenvalues and eigenvectors can coalesce at an exceptional point — where the Hamiltonian is a genuine Jordan block, not a diagonalizable near-degeneracy. The coalescence produces effects with no Hermitian analogue: a resonance-splitting scaling as the kk-th root of a perturbation near an order-kk point (exploited for enhanced sensing in microcavities and gyroscopes), and asymmetric mode conversion when a control loop encircles the point. A second arena is non-normal stability theory: the shear-flow operator is far from normal, so even when every eigenvalue predicts decay the near-defective structure permits enormous transient amplification — the pseudospectral mechanism now believed to seed the transition to turbulence. The same secular t eλtt\,e^{\lambda t} growth appears as secular terms in celestial mechanics and perturbative resonance. And numerically, because block sizes are infinitely sensitive to perturbation, robust software works with the Schur form or pseudospectra instead — defectiveness is a knife-edge, and physics tends to live right on it.

The physical picture

Picture an eigenvector as a direction the operator merely rescales: feed in vv, get back λv\lambda v, no leakage. A defective eigenvalue promises more of these directions than it can deliver. Where a second eigenvector should sit, the operator offers a partner v2v_2 obeying Av2=λv2+v1Av_2=\lambda v_2+v_1 — almost an eigenvector, but with a thin spill into the true eigendirection v1v_1. That spill is the lone 11 on the superdiagonal — no diagonal matrix owns it. Stack the partners into a tower and you get a Jordan chain: (A−λI)(A-\lambda I) walks you down it one rung at a time to the eigenvector at the bottom and then zero. The tower's height is the block size.

Figure
Generalized-eigenvector chains for an eigenvalue λ = 2 of a 4×4 matrix with algebraic multiplicity 4 but only 2 eigenvectors: a length-3 chain and a length-1 chain. The operator A − λI steps each vector down one rung, v₃ → v₂ → v₁ → 0, and the eigenvectors (kernel) sit at the bottom. Two towers means geometric multiplicity 2; heights 3 and 1 give Jordan blocks J₃ and J₁.
Defective λ = 2: mₐ = 4 but m_g = 2, so 2 chains — heights 3 and 1 each downward step is A − λI; the bottom rung is a true eigenvector, ker(A − λI) v₃ (top) v₂ v₁ eigenvector 0 A − λI A − λI A − λI w₁ eigenvector 0 A − λI block J₃(2), size 3 block J₁(2), size 1 chain relation: (A − λI) vⱼ = vⱼ₋₁ , (A − λI) v₁ = 0

The purest incarnation is the nilpotent shift. The matrix with 11s on the superdiagonal and zeros elsewhere sends e2↦e1e_2\mapsto e_1, e3↦e2e_3\mapsto e_2, e1↦0e_1\mapsto 0: single eigenvalue 00, yet only one eigenvector. A Jordan block is exactly this shift NN on a pure scaling, Jk(λ)=λI+NJ_k(\lambda)=\lambda I+N; since Nk=0N^k=0, every defective structure is a nilpotent embellishment of an eigenvalue, and that nilpotency makes the physics computable. The series eNt=I+Nt+⋯e^{Nt}=I+Nt+\cdots terminates after kk terms, so a defective mode's propagator is not a pure exponential but an exponential times a polynomial in tt of degree k−1k-1. The second figure shows that secular factor in the flesh — the t eλtt\,e^{\lambda t} mode a diagonalizable system can never produce.

Figure
The fingerprint of defectiveness: for eigenvalue λ = −2, a diagonalizable mode decays as e⁻²ᵗ (blue) but a defective 2×2 block adds a secular mode t·e⁻²ᵗ (amber). The secular mode rises from 0 to a peak 0.184 at t = 0.5 = 1/(2γ), the two curves cross at t = 1, and beyond t = 1 the defective mode decays more slowly and dominates.
Secular growth: the extra t·e⁻²ᵗ mode a defective block forces (γ = 2) 0 0.25 0.50 0.75 1.0 0 1 2 3 time t amplitude e⁻²ᵗ (diagonalizable) t·e⁻²ᵗ (defective mode) peak 0.184 at t = 0.5 t = 1: modes equal, then defective dominates

The core equations

Similarity can always reach block-diagonal form, even when it cannot reach diagonal form. This is the master identity: a single invertible PP, built from generalized eigenvectors, conjugates AA into a direct sum of Jordan blocks.

J=P−1AP=⨁iJki(λi)(1)J = P^{-1} A P = \bigoplus_{i} J_{k_i}(\lambda_i) \qquad (1)

where: AA — an n×nn\times n matrix over C\mathbb{C}; PP — invertible, its columns the concatenated Jordan chains; Jki(λi)J_{k_i}(\lambda_i) — the Jordan block of size kik_i carrying eigenvalue λi\lambda_i; ⨁\bigoplus — direct sum, i.e. block-diagonal placement. The form is unique up to the order of blocks, so it is a genuine invariant: two matrices are similar iff they share the same list of blocks. A single Jordan block is the atom of the construction: upper bidiagonal, the eigenvalue repeated down the diagonal and 11s on the superdiagonal, with everything about defectiveness packed into those off-diagonal ones.

Jk(λ)=(λ1λ⋱⋱1λ)=λI+N(2)J_k(\lambda)=\begin{pmatrix}\lambda & 1 & & \\ & \lambda & \ddots & \\ & & \ddots & 1 \\ & & & \lambda\end{pmatrix}=\lambda I + N \qquad (2)

where: λ\lambda — the block's single eigenvalue; kk — the block size and chain length; NN — the nilpotent shift with Ni,i+1=1N_{i,i+1}=1, obeying Nk=0N^k=0 but Nk−1≠0N^{k-1}\neq0. A 1×11\times1 block is an honest eigenvector; every larger block is defective. The chain relation forces that superdiagonal. Where an eigenvector satisfies (A−λI)v1=0(A-\lambda I)v_1=0, a generalized eigenvector one rung up is sent by (A−λI)(A-\lambda I) not to zero but to the vector below it.

(A−λI) vj=vj−1,(A−λI) v1=0(3)(A-\lambda I)\,v_j = v_{j-1},\qquad (A-\lambda I)\,v_1 = 0 \qquad (3)

where: v1v_1 — an ordinary eigenvector at the bottom of the chain; vjv_j — the jj-th generalized eigenvector, killed by (A−λI)j(A-\lambda I)^j but not (A−λI)j−1(A-\lambda I)^{j-1}. Reading Avj=λvj+vj−1Av_j=\lambda v_j+v_{j-1} column by column reproduces block (2) exactly. Two multiplicities govern the coarse structure. The algebraic multiplicity is the total size of the blocks for λ\lambda; the geometric multiplicity — the number of independent eigenvectors — counts the blocks themselves, one per chain.

ma(λ)=∑blocks for λki,mg(λ)=#{blocks for λ}=dim⁡ker⁡(A−λI)(4)m_a(\lambda)=\sum_{\text{blocks for }\lambda} k_i,\qquad m_g(\lambda)=\#\{\text{blocks for }\lambda\}=\dim\ker(A-\lambda I) \qquad (4)

where: ma(λ)m_a(\lambda) — algebraic multiplicity (root order in the characteristic polynomial); mg(λ)m_g(\lambda) — geometric multiplicity. The gap ma−mgm_a-m_g measures defectiveness: it is zero exactly when every block is 1×11\times1. The two multiplicities do not pin down the individual block sizes. For that one needs the full rank sequence of powers of (A−λI)(A-\lambda I); the count of blocks of each size is a second difference of those ranks.

bj(λ)=rj−1−2rj+rj+1,rj=rank⁡(A−λI)j(5)b_j(\lambda)=r_{j-1}-2r_j+r_{j+1},\qquad r_j=\operatorname{rank}(A-\lambda I)^j \qquad (5)

where: bj(λ)b_j(\lambda) — the number of Jordan blocks of size exactly jj; rjr_j — the rank of the jj-th power, with r0=nr_0=n. In terms of nullities nj=n−rjn_j=n-r_j, the number of blocks of size ≥j\ge j is nj−nj−1n_j-n_{j-1}. The additive form of the same content is the Jordan–Chevalley decomposition: split AA into a diagonalizable piece and a commuting nilpotent piece. This is the version numerical work uses, because DD and NN are polynomials in AA.

A=D+N,DN=ND,N nilpotent,D diagonalizable(6)A = D + N,\qquad DN=ND,\qquad N\ \text{nilpotent},\quad D\ \text{diagonalizable} \qquad (6)

where: DD — the semisimple (diagonalizable) part; NN — the nilpotent part with Nn=0N^n=0. The decomposition is unique, and both parts are polynomials in AA. Physicists care because any analytic function of AA reduces to a finite sum on each block, with derivatives of ff climbing the superdiagonal — nilpotency truncates the Taylor series after kk terms.

f(Jk(λ))=∑j=0k−1f(j)(λ)j! Nj(7)f\big(J_k(\lambda)\big)=\sum_{j=0}^{k-1}\frac{f^{(j)}(\lambda)}{j!}\,N^{j} \qquad (7)

where: ff — a function analytic at λ\lambda; f(j)(λ)f^{(j)}(\lambda) — its jj-th derivative at the eigenvalue; NjN^{j} — the shift raised to the jj-th power, which populates the jj-th superdiagonal. The formula never needs a limit or a contour: it is a finite, exact sum. The single most important instance is f(x)=extf(x)=e^{xt}, the propagator of x˙=Ax\dot x=Ax. On a defective block it is an exponential dressed by a polynomial whose degree is one less than the block size — the secular growth of the second figure.

eJk(λ)t=eλt∑j=0k−1tjj! Nj(8)e^{J_k(\lambda)t}=e^{\lambda t}\sum_{j=0}^{k-1}\frac{t^{j}}{j!}\,N^{j} \qquad (8)

where: tt — the evolution parameter (time); eλte^{\lambda t} — the scalar envelope; the highest term tk−1/(k−1)!t^{k-1}/(k-1)! is the fastest-growing polynomial factor, present only when k≥2k\ge2. In a diagonalizable system all blocks are 1×11\times1 and the sum collapses to eλte^{\lambda t} alone.

Derivation AExistence of the Jordan form on a single generalized eigenspace

The goal is to prove the block structure actually exists, not merely assume it. Restricting to one eigenvalue, we show its generalized eigenspace splits as a direct sum of Jordan chains. Because A=λI+NA=\lambda I+N on this subspace, the whole problem reduces to classifying a single nilpotent operator NN, driven by how the kernels of its powers grow.

Step 1. Restrict to Vλ=ker⁡(A−λI)mV_\lambda=\ker(A-\lambda I)^m, where mm is large enough that the kernel stops growing, and set N=(A−λI)∣VλN=(A-\lambda I)\big|_{V_\lambda}. Then NN is nilpotent, Nm=0N^m=0, and finding Jordan blocks for AA on VλV_\lambda is identical to finding the canonical form of NN. Why: subtracting the scalar λI\lambda I shifts the diagonal without touching the superdiagonal, so all the defective structure lives in NN alone.

Step 2. Form the kernel filtration {0}⊂ker⁡N⊂ker⁡N2⊂⋯⊂ker⁡Nm=Vλ\{0\}\subset\ker N\subset\ker N^2\subset\cdots\subset\ker N^m=V_\lambda. Each inclusion is strict until the chain saturates, and the successive quotients have non-increasing dimensions. Why: a strictly growing tower of subspaces is exactly what lets us harvest, level by level, the vectors that sit at the top of chains but not lower down.

Step 3. Choose vectors in ker⁡Nm\ker N^m independent modulo ker⁡Nm−1\ker N^{m-1} — the tops of the longest chains — and apply NN repeatedly: the images Nv,N2v,…Nv, N^2v,\dots march down the filtration and stay independent. Fill in shorter chains by descending a level and repeating. Why: a top vector's images cannot collapse early without contradicting the level it was chosen at, so each choice manufactures a full independent chain.

Step 4. Assemble the chains into a basis of VλV_\lambda. A hypothetical dependence among them, hit with a power of NN, forces a dependence among bottom-level eigenvectors — independent by construction, a contradiction. So the chains meet only at 00 and their spans give a direct sum. Why: nilpotency turns any dependence into a lower-level one, and induction closes the argument.

Step 5. On each chain {v1,…,vk}\{v_1,\dots,v_k\}, NN acts as the shift vj↦vj−1v_j\mapsto v_{j-1}, v1↦0v_1\mapsto0 — the nilpotent Jordan block; adding back λI\lambda I gives Jk(λ)J_k(\lambda). The direct sum of chains realizes A∣VλA\big|_{V_\lambda} as a sum of Jordan blocks. Why: the shift matrix in the chain basis is, by inspection, the block of equation (2). *Verified: the chain dimensions sum to dim⁡Vλ=ma(λ)\dim V_\lambda=m_a(\lambda), and the number of chains equals dim⁡ker⁡N=mg(λ)\dim\ker N=m_g(\lambda), matching the multiplicity identities (4).*

Go deeper · Derivation B · 1 minReading block sizes off the ranks of the powers
Derivation BReading block sizes off the ranks of the powers

The goal is to turn the existence theorem into an algorithm: given a defective AA, determine not just how many blocks each eigenvalue carries but exactly how big each is, using only ranks. The key is that the nullity of (A−λI)j(A-\lambda I)^j counts generalized eigenvectors up to level jj, so its increments count chains by length, and a second difference isolates chains of one exact length.

Step 1. Define nullities nj=dim⁡ker⁡(A−λI)j=n−rjn_j=\dim\ker(A-\lambda I)^j=n-r_j, an increasing sequence that saturates at ma(λ)m_a(\lambda). Its first increment is dj=nj−nj−1d_j=n_j-n_{j-1}. Every chain of length ≥j\ge j contributes exactly one fresh generalized eigenvector at level jj and none beyond its top, so dj=#{chains of length≥j}d_j=\#\{\text{chains of length}\ge j\}. Why: level jj of the filtration gains precisely one basis vector from each chain still "alive" at that height, which is the geometric meaning of the increment.

Step 2. Since blocks of size ≥j\ge j are exactly the chains that survive to level jj, the count of such blocks is djd_j, a non-increasing function of jj. The blocks of size exactly jj are those that survive to jj but not to j+1j+1, i.e. bj=dj−dj+1b_j=d_j-d_{j+1}. Why: "exactly jj" is the set difference "at least jj" minus "at least j+1j+1", which subtraction implements directly.

Step 3. Substitute dj=nj−nj−1d_j=n_j-n_{j-1} and then nj=n−rjn_j=n-r_j to eliminate nullities in favour of ranks, giving bj=(nj−nj−1)−(nj+1−nj)=nj−1−2nj+nj+1b_j=(n_j-n_{j-1})-(n_{j+1}-n_j)=n_{j-1}-2n_j+n_{j+1}, and in rank form the boxed identity bj=rj−1−2rj+rj+1b_j=r_{j-1}-2r_j+r_{j+1}. Why: ranks are what one measures numerically, so trading nullities for ranks makes the formula executable; the sign flips cancel because njn_j and rjr_j differ only by the constant nn. *Verified against 4×44\times4 blocks with ma=4, mg=2m_a=4,\,m_g=2: sizes (3,1)(3,1) give ranks r1=2,r2=1,r3=0r_1{=}2,r_2{=}1,r_3{=}0 so b1=1,b3=1b_1{=}1,b_3{=}1; sizes (2,2)(2,2) give r1=2,r2=0r_1{=}2,r_2{=}0 so b2=2b_2{=}2. The two structures are separated solely by r2=rank⁡(A−λI)2r_2=\operatorname{rank}(A-\lambda I)^2.*

Limiting cases

Jordan form interpolates between the diagonalizable extreme (every block 1×11\times1) and the maximally defective extreme (one chain filling the space).

CaseResultMeaning
Diagonalizablemg(λ)=ma(λ) ∀λm_g(\lambda)=m_a(\lambda)\ \forall\lambdaevery block is 1×11\times1; Jordan form is the ordinary diagonal spectral form
Single chain (maximally defective)Jn(λ)=λIn+N, Nn=0J_n(\lambda)=\lambda I_n+N,\ N^n=0one eigenvalue, one eigenvector, a single n×nn\times n block; mg=1m_g=1
Normal operatorAA†=A†A⇒J=diag(λi)AA^\dagger=A^\dagger A\Rightarrow J=\mathrm{diag}(\lambda_i)Hermitian, anti-Hermitian, and unitary operators are never defective; PP can be chosen unitary
Nilpotent operatorAk=0, Ak−1≠0A^k=0,\ A^{k-1}\neq0all eigenvalues are 00; Jordan form is a sum of nilpotent blocks, the largest of size kk
Distinct eigenvaluesnn different λi\lambda_iautomatically diagonalizable; defectiveness needs a repeated eigenvalue

Worked examples

1 · A defective 3×3: Jordan form, the chains, and the propagator (fully worked)

Let A=(110−130002)A=\begin{pmatrix}1&1&0\\-1&3&0\\0&0&2\end{pmatrix}. Find its eigenvalues, its Jordan form JJ and a transforming matrix PP, and then compute eAte^{At}.

Step 1. The block-triangular structure gives the characteristic polynomial from the top-left 2×22\times2 (trace 44, determinant 1⋅3−1⋅(−1)=41\cdot3-1\cdot(-1)=4) times (2−x)(2-x): χ(x)=(x2−4x+4)(2−x)=−(x−2)3\chi(x)=(x^2-4x+4)(2-x)=-(x-2)^3. So λ=2\lambda=2 is the only eigenvalue, with algebraic multiplicity 3.

Step 2. Form N=A−2I=(−110−110000)N=A-2I=\begin{pmatrix}-1&1&0\\-1&1&0\\0&0&0\end{pmatrix}. Its rows span a single direction, so rank⁡N=1\operatorname{rank}N=1 and the geometric multiplicity is 3−1=23-1=2. A direct check gives N2=0N^2=0, so r1=1, r2=0r_1=1,\ r_2=0. The block-counting formula (5) yields b1=r0−2r1+r2=3−2+0=1b_1=r_0-2r_1+r_2=3-2+0=\mathbf{1} block of size 11 and b2=r1−2r2+r3=1−0+0=1b_2=r_1-2r_2+r_3=1-0+0=\mathbf{1} block of size 22. Hence J=(210020002)J=\begin{pmatrix}2&1&0\\0&2&0\\0&0&2\end{pmatrix} — one 2×22\times2 block and one 1×11\times1 block, sizes (2,1)(2,1).

Step 3. Build the chains. Solving Nv=0Nv=0 gives the eigenspace span⁡{(1,1,0),(0,0,1)}\operatorname{span}\{(1,1,0),(0,0,1)\}. The image of NN is span⁡{(1,1,0)}\operatorname{span}\{(1,1,0)\}, so the eigenvector v1=(1,1,0)v_1=(1,1,0) is the one that admits a partner. Solve Nv2=v1Nv_2=v_1: the equation −v2,1+v2,2=1-v_{2,1}+v_{2,2}=1 is met by v2=(0,1,0)v_2=(0,1,0). The isolated eigenvector for the size-11 block is v3=(0,0,1)v_3=(0,0,1). Assemble P=(100110001)P=\begin{pmatrix}1&0&0\\1&1&0\\0&0&1\end{pmatrix} with columns v1,v2,v3v_1,v_2,v_3.

Step 4. Verify AP=PJAP=PJ column by column: Av1=(2,2,0)=2v1Av_1=(2,2,0)=2v_1; Av2=(1,3,0)=2v2+v1Av_2=(1,3,0)=2v_2+v_1; Av3=(0,0,2)=2v3Av_3=(0,0,2)=2v_3. All three hold exactly, so J=P−1APJ=P^{-1}AP with P−1=(100−110001)P^{-1}=\begin{pmatrix}1&0&0\\-1&1&0\\0&0&1\end{pmatrix}.

Step 5. Now the propagator. On the blocks, eJt=e2t(1t0010001)e^{Jt}=e^{2t}\begin{pmatrix}1&t&0\\0&1&0\\0&0&1\end{pmatrix}, and eAt=P eJt P−1e^{At}=P\,e^{Jt}\,P^{-1}. Multiplying out,

eAt=e2t(1−tt0−t1+t0001).e^{At}=e^{2t}\begin{pmatrix}1-t & t & 0\\ -t & 1+t & 0\\ 0 & 0 & 1\end{pmatrix}.

Two sanity checks confirm it: at t=0t=0 it is the identity, and ddteAt∣t=0=2I+N=A\dfrac{d}{dt}e^{At}\big|_{t=0}=2I+N=A. The stray factor tt in the 2×22\times2 corner is the secular signature of the single defective block.

2 · Distinguishing (3,1)(3,1) from (2,2)(2,2) by rank (the trap made concrete)

A 4×44\times4 matrix has one eigenvalue λ\lambda with algebraic multiplicity 44 and geometric multiplicity 22. What Jordan forms are possible, and what single measurement decides between them?

Step 1. Two blocks (mg=2m_g=2) summing to size 44 (ma=4m_a=4) leave exactly two partitions: sizes (3,1)(3,1) or sizes (2,2)(2,2). The multiplicities alone cannot choose, because both give r1=rank⁡(A−λI)=n−mg=2r_1=\operatorname{rank}(A-\lambda I)=n-m_g=\mathbf{2}.

Step 2. Go one power up. For sizes (3,1)(3,1) the size-33 block contributes rank 22 to (A−λI)2(A-\lambda I)^2 and the size-11 block contributes 00, so r2=1r_2=\mathbf{1}. For sizes (2,2)(2,2) each size-22 block dies at the second power, so r2=0r_2=\mathbf{0}.

Step 3. Apply formula (5). With (r0,…,r4)=(4,2,1,0,0)(r_0,\dots,r_4)=(4,2,1,0,0): b1=4−4+1=1b_1=4-4+1=1 and b3=1−0+0=1b_3=1-0+0=1 — one block of size 33, one of size 11. With (4,2,0,0,0)(4,2,0,0,0): b2=2−0+0=2b_2=2-0+0=2 — two blocks of size 22. The single number r2=rank⁡(A−λI)2r_2=\operatorname{rank}(A-\lambda I)^2 decides: r2=1⇒(3,1)r_2=1\Rightarrow(3,1), r2=0⇒(2,2)r_2=0\Rightarrow(2,2).

3 · The critically damped oscillator (defectiveness in a physics you already know)

A damped oscillator q¨+2γq˙+ω02q=0\ddot q+2\gamma\dot q+\omega_0^2q=0 is written as x˙=Ax\dot{\mathbf x}=A\mathbf x with x=(q,q˙)\mathbf x=(q,\dot q). Take ω0=2\omega_0=2 rad/s and tune to critical damping γ=ω0=2\gamma=\omega_0=2. Solve for q(t)q(t) with q(0)=1, q˙(0)=0q(0)=1,\ \dot q(0)=0.

Step 1. The companion matrix A=(01−4−4)A=\begin{pmatrix}0&1\\-4&-4\end{pmatrix} has characteristic equation (x+2)2=0(x+2)^2=0. The doubled root λ=−2\lambda=-2 has geometric multiplicity 11 (a companion matrix always has a single eigenvector), so AA is a single defective 2×22\times2 Jordan block — critical damping is exactly where the system goes defective.

Step 2. By equation (8) the solution carries the secular factor: q(t)=(a+bt) e−2tq(t)=(a+bt)\,e^{-2t}. Impose q(0)=1⇒a=1q(0)=1\Rightarrow a=1, and q˙=(b−2a−2bt)e−2t\dot q=(b-2a-2bt)e^{-2t} with q˙(0)=b−2=0⇒b=2\dot q(0)=b-2=0\Rightarrow b=2. Hence q(t)=(1+2t) e−2t\mathbf{q(t)=(1+2t)\,e^{-2t}}.

Step 3. Verify against the ODE: q˙=−4t e−2t\dot q=-4t\,e^{-2t} (so q˙(0)=0\dot q(0)=0 ✓) and q¨=(−4+8t)e−2t\ddot q=(-4+8t)e^{-2t}, giving q¨+4q˙+4q=e−2t[(−4+8t)+4(−4t)+4(1+2t)]=0\ddot q+4\dot q+4q=e^{-2t}[(-4+8t)+4(-4t)+4(1+2t)]=0 ✓. The t e−2tt\,e^{-2t} term is the second solution the missing eigenvector cannot provide — and what makes critical damping return to equilibrium fastest without overshoot.

Physics of the portrait

Jordan form is a rare case where pure algebra — worked out for substitution groups — became the exact language physics needed for resonance, damping, and the non-Hermitian frontier.

Origins · 1 minCamille Jordan and how this was discovered
CJ
Camille Jordan
1838–1922 · French mathematician, École Polytechnique and Collège de France

Marie Ennemond Camille Jordan trained as a mining engineer before mathematics claimed him, spending his career at the École Polytechnique and the Collège de France. His monumental 1870 Traité des substitutions et des équations algébriques was the first book-length treatment of Galois theory, and buried in its study of how linear substitutions can be simplified is the canonical form that now bears his name — originally stated over finite fields, in the service of group theory rather than analysis. It had near-simultaneous rivals: Weierstrass had already classified matrices up to similarity through his theory of elementary divisors, and Frobenius later systematized the rational canonical form. What makes Jordan's version the physicist's favourite is its transparency — it displays, block by block, exactly how far an operator falls short of diagonalizability, and it makes functions of the operator, above all the propagator eAte^{At}, computable in closed form. But for anyone who has watched a critically damped needle settle without overshoot, the canonical form is the Jordan that matters.

History
1868
— Weierstrass classifies matrices up to similarity via the theory of elementary divisors
1870
— Jordan presents the canonical form in his Traité des substitutions et des équations algébriques
1878
— Frobenius develops the minimal polynomial and the rational canonical form
1951
— Chevalley formalizes the additive D + N (Jordan–Chevalley) decomposition
2000
— exceptional points, recognized as Jordan-block degeneracies, become central to non-Hermitian photonics

Going further

Texts. Stone & Goldbart, Mathematics for Physics, ch. on linear operators and the Jordan form · Arfken, Weber & Harris, Mathematical Methods for Physicists, 7th ed., ch. on matrices and eigensystems · Hassani, Mathematical Physics, ch. on spectral decomposition and canonical forms · Byron & Fuller, Mathematics of Classical and Quantum Physics, ch. 4–5 · Nakahara, Geometry, Topology and Physics, §on linear operators · Horn & Johnson, Matrix Analysis, ch. 3 (the definitive reference on Jordan canonical form).

Provenance. The block-counting identity bj=rj−1−2rj+rj+1b_j=r_{j-1}-2r_j+r_{j+1} and the multiplicity relations (4) are verifiable against Horn & Johnson ch. 3 and Stone & Goldbart; the block-exponential (7)–(8) and the critically damped t e−γtt\,e^{-\gamma t} result are standard (Arfken–Weber–Harris; Riley–Hobson–Bence). Every number here was re-verified numerically: for the worked 3×33\times3 the eigenvalues are all 22, rank⁡N=1\operatorname{rank}N=1, rank⁡N2=0\operatorname{rank}N^2=0, AP=PJAP=PJ to machine precision, and eAt=e2t(1−tt0−t1+t0001)e^{At}=e^{2t}\begin{pmatrix}1-t&t&0\\-t&1+t&0\\0&0&1\end{pmatrix}; the (3,1)(3,1)-vs-(2,2)(2,2) discriminator r2∈{1,0}r_2\in\{1,0\} and the secular curve t e−2tt\,e^{-2t} (peak 0.1840.184 at t=0.5t=0.5, crossing e−2te^{-2t} at t=1t=1) check out. A verifier should confirm (i) AP=PJAP=PJ column by column, (ii) Nk=0, Nk−1≠0N^k=0,\ N^{k-1}\neq0 for a size-kk block, and (iii) the truncation of the exponential series.

Prerequisites. Eigenvalues, Eigenvectors, and the Characteristic Equation · Diagonalization and the Spectral Decomposition · Change of Basis and Similarity Transformations · Rank, Nullity, and the Fundamental Theorem of Linear Maps · Linear Operators and Matrix Representations. Leads to. Diagonalization and the Spectral Decomposition · Adjoint and Hermitian Operators · Unitary and Orthogonal Operators.

Ask the tutor: Want to see why (λ10λ)\begin{pmatrix}\lambda&1\\0&\lambda\end{pmatrix} can never be diagonalized, or how an exceptional point turns a Hamiltonian into a Jordan block — ask and we will work it through together.

What is the difference between an eigenvector and a generalized eigenvector?

An ordinary eigenvector satisfies (A−λI)v=0(A-\lambda I)v=0 — the operator merely rescales it. A generalized eigenvector of rank jj satisfies the weaker (A−λI)jv=0(A-\lambda I)^j v=0 but (A−λI)j−1v≠0(A-\lambda I)^{j-1}v\neq0: it is killed only after jj applications. Applying (A−λI)(A-\lambda I) once to a rank-jj vector gives a rank-(j−1)(j-1) one, so they arrange into chains stepping down to a genuine eigenvector (the rank-11 case). The point is that there are always enough — the generalized eigenspace ker⁡(A−λI)m\ker(A-\lambda I)^m has dimension equal to the algebraic multiplicity — even when ordinary eigenvectors fall short.

How do I actually find the Jordan form of a matrix by hand?

Three stages. First, get the eigenvalues and algebraic multiplicities from the characteristic polynomial. Second, for each λ\lambda compute the ranks rj=rank⁡(A−λI)jr_j=\operatorname{rank}(A-\lambda I)^j until they stop dropping; then mg=n−r1m_g=n-r_1 and the block sizes come from bj=rj−1−2rj+rj+1b_j=r_{j-1}-2r_j+r_{j+1} — that fixes JJ. Third, if you also need PP, build the chains: find the eigenvectors, see which lie in the image of (A−λI)(A-\lambda I) (those get partners), and solve (A−λI)vj=vj−1(A-\lambda I)v_j=v_{j-1} upward to grow each chain to its block size. The columns of PP are the chains, ordered to match the blocks. Worked example 1 does exactly this.

Why is the Jordan form barely used in numerical computation?

Because it is discontinuous in the matrix entries. Block sizes depend on which ranks are exactly deficient, and an arbitrarily small perturbation can split a defective eigenvalue into distinct ones, collapsing a 2×22\times2 block into two 1×11\times1 blocks. So a computer in floating point can never reliably decide whether a matrix "is" defective — the question is ill-posed at finite precision. Practical algorithms therefore compute the Schur form (stable unitary triangularization) or study the pseudospectrum instead. Jordan form remains the right conceptual tool — it tells you what secular growth and transient amplification to expect — but the honest numerical object is the Schur form.

Does defectiveness ever happen for the operators of quantum mechanics?

Not for the observables. Physical observables are Hermitian and time evolution is unitary — both normal operators — so the spectral theorem makes them unitarily diagonalizable and never defective. That is why ordinary quantum eigenvalue problems never need Jordan blocks. Defectiveness enters only through effective non-Hermitian descriptions — open systems where probability leaks out, gain-and-loss photonic structures, or non-Hermitian model Hamiltonians. There, eigenvalues and eigenvectors can genuinely coalesce at exceptional points, the effective Hamiltonian becomes a real Jordan block, and the consequences — like power-law-enhanced sensitivity — are things a diagonalizable near-degeneracy cannot mimic.

What exactly is the Jordan–Chevalley decomposition, and why is it useful?

It writes any square matrix uniquely as A=D+NA=D+N with DD diagonalizable, NN nilpotent, and — crucially — DD and NN commuting. In Jordan coordinates DD is the diagonal part of JJ and NN its superdiagonal part, but the theorem's power is that both are polynomials in AA, so you never change basis to build them. Because they commute, functions factor: eAt=eDteNte^{At}=e^{Dt}e^{Nt}, an honest diagonalizable exponential times a terminating polynomial series. This is the backbone behind formula (8), and the algebraic reason the "diagonalizable part" and the "secular part" of a linear evolution separate so cleanly.

Is the shear matrix the smallest defective example, and why can't it be diagonalized?

Yes — (λ10λ)\begin{pmatrix}\lambda&1\\0&\lambda\end{pmatrix} is the smallest defective matrix. Its only eigenvalue is λ\lambda (repeated), and (A−λI)=(0100)(A-\lambda I)=\begin{pmatrix}0&1\\0&0\end{pmatrix} has rank 11, so there is just one eigenvector, (1,0)(1,0). Diagonalizing would need two independent eigenvectors, and they do not exist: ma=2m_a=2 but mg=1m_g=1. Geometrically the map is a shear — it fixes the xx-axis direction and slides everything else along it — with no second invariant direction to rescale. That missing direction is filled by the generalized eigenvector (0,1)(0,1), sent to λ(0,1)+(1,0)\lambda(0,1)+(1,0): an eigenvector plus a leak, the irreducible content of a Jordan block.

Before this

Where this leads