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 shear 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 . The failure has a precise diagnosis. Every eigenvalue carries two counts: its algebraic multiplicity (its order as a root of the characteristic polynomial) and its geometric multiplicity (the number of independent eigenvectors). Always ; 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 , whose dimension always equals , and to organize the extra vectors into chains. Each chain becomes one Jordan block: on the diagonal, a telltale row of s on the superdiagonal, nothing else. For a physicist the payoff is operational. Functions of a matrix — above all the propagator that solves linear evolution — are computed block by block, and the size of a Jordan block dictates the highest power of 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 enters the physics. Jordan form makes those moments exact.
- 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 , each carrying one eigenvalue on its diagonal and s on its first superdiagonal.
- Each block is built from a chain of generalized eigenvectors — vectors killed by but not — that fill the deficit ordinary eigenvectors leave behind.
- The number of blocks for is its geometric multiplicity; the total size is its algebraic multiplicity; the exact block sizes are fixed only by the ranks of successive powers .
- Jordan form makes matrix functions and the propagator explicit, including the polynomial-times-exponential terms that are the fingerprint of defectiveness.
- The split 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 ; each chain becomes a Jordan block with on the diagonal and ones above it, and the collection of all chains is a basis in which is block diagonal.
A defective eigenvalue cannot supply enough eigenvectors, so one builds chains of generalized eigenvectors ; each chain becomes a Jordan block with on the diagonal and ones above it, and the collection of all chains forms a basis in which 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 -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 -th root of a perturbation near an order- 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 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 , get back , 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 obeying — almost an eigenvector, but with a thin spill into the true eigendirection . That spill is the lone on the superdiagonal — no diagonal matrix owns it. Stack the partners into a tower and you get a Jordan chain: 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.
The purest incarnation is the nilpotent shift. The matrix with s on the superdiagonal and zeros elsewhere sends , , : single eigenvalue , yet only one eigenvector. A Jordan block is exactly this shift on a pure scaling, ; since , every defective structure is a nilpotent embellishment of an eigenvalue, and that nilpotency makes the physics computable. The series terminates after terms, so a defective mode's propagator is not a pure exponential but an exponential times a polynomial in of degree . The second figure shows that secular factor in the flesh — the mode a diagonalizable system can never produce.
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 , built from generalized eigenvectors, conjugates into a direct sum of Jordan blocks.
where: — an matrix over ; — invertible, its columns the concatenated Jordan chains; — the Jordan block of size carrying eigenvalue ; — 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 s on the superdiagonal, with everything about defectiveness packed into those off-diagonal ones.
where: — the block's single eigenvalue; — the block size and chain length; — the nilpotent shift with , obeying but . A block is an honest eigenvector; every larger block is defective. The chain relation forces that superdiagonal. Where an eigenvector satisfies , a generalized eigenvector one rung up is sent by not to zero but to the vector below it.
where: — an ordinary eigenvector at the bottom of the chain; — the -th generalized eigenvector, killed by but not . Reading column by column reproduces block (2) exactly. Two multiplicities govern the coarse structure. The algebraic multiplicity is the total size of the blocks for ; the geometric multiplicity — the number of independent eigenvectors — counts the blocks themselves, one per chain.
where: — algebraic multiplicity (root order in the characteristic polynomial); — geometric multiplicity. The gap measures defectiveness: it is zero exactly when every block is . The two multiplicities do not pin down the individual block sizes. For that one needs the full rank sequence of powers of ; the count of blocks of each size is a second difference of those ranks.
where: — the number of Jordan blocks of size exactly ; — the rank of the -th power, with . In terms of nullities , the number of blocks of size is . The additive form of the same content is the Jordan–Chevalley decomposition: split into a diagonalizable piece and a commuting nilpotent piece. This is the version numerical work uses, because and are polynomials in .
where: — the semisimple (diagonalizable) part; — the nilpotent part with . The decomposition is unique, and both parts are polynomials in . Physicists care because any analytic function of reduces to a finite sum on each block, with derivatives of climbing the superdiagonal — nilpotency truncates the Taylor series after terms.
where: — a function analytic at ; — its -th derivative at the eigenvalue; — the shift raised to the -th power, which populates the -th superdiagonal. The formula never needs a limit or a contour: it is a finite, exact sum. The single most important instance is , the propagator of . 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.
where: — the evolution parameter (time); — the scalar envelope; the highest term is the fastest-growing polynomial factor, present only when . In a diagonalizable system all blocks are and the sum collapses to alone.
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 on this subspace, the whole problem reduces to classifying a single nilpotent operator , driven by how the kernels of its powers grow.
Step 1. Restrict to , where is large enough that the kernel stops growing, and set . Then is nilpotent, , and finding Jordan blocks for on is identical to finding the canonical form of . Why: subtracting the scalar shifts the diagonal without touching the superdiagonal, so all the defective structure lives in alone.
Step 2. Form the kernel filtration . 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 independent modulo — the tops of the longest chains — and apply repeatedly: the images 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 . A hypothetical dependence among them, hit with a power of , forces a dependence among bottom-level eigenvectors — independent by construction, a contradiction. So the chains meet only at 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 , acts as the shift , — the nilpotent Jordan block; adding back gives . The direct sum of chains realizes 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 , and the number of chains equals , matching the multiplicity identities (4).*
Go deeper · Derivation B · 1 minReading block sizes off the ranks of the powers
The goal is to turn the existence theorem into an algorithm: given a defective , 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 counts generalized eigenvectors up to level , so its increments count chains by length, and a second difference isolates chains of one exact length.
Step 1. Define nullities , an increasing sequence that saturates at . Its first increment is . Every chain of length contributes exactly one fresh generalized eigenvector at level and none beyond its top, so . Why: level 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 are exactly the chains that survive to level , the count of such blocks is , a non-increasing function of . The blocks of size exactly are those that survive to but not to , i.e. . Why: "exactly " is the set difference "at least " minus "at least ", which subtraction implements directly.
Step 3. Substitute and then to eliminate nullities in favour of ranks, giving , and in rank form the boxed identity . Why: ranks are what one measures numerically, so trading nullities for ranks makes the formula executable; the sign flips cancel because and differ only by the constant . *Verified against blocks with : sizes give ranks so ; sizes give so . The two structures are separated solely by .*
Limiting cases
Jordan form interpolates between the diagonalizable extreme (every block ) and the maximally defective extreme (one chain filling the space).
| Case | Result | Meaning |
|---|---|---|
| Diagonalizable | every block is ; Jordan form is the ordinary diagonal spectral form | |
| Single chain (maximally defective) | one eigenvalue, one eigenvector, a single block; | |
| Normal operator | Hermitian, anti-Hermitian, and unitary operators are never defective; can be chosen unitary | |
| Nilpotent operator | all eigenvalues are ; Jordan form is a sum of nilpotent blocks, the largest of size | |
| Distinct eigenvalues | different | automatically diagonalizable; defectiveness needs a repeated eigenvalue |
Worked examples
1 · A defective 3×3: Jordan form, the chains, and the propagator (fully worked)
Let . Find its eigenvalues, its Jordan form and a transforming matrix , and then compute .
Step 1. The block-triangular structure gives the characteristic polynomial from the top-left (trace , determinant ) times : . So is the only eigenvalue, with algebraic multiplicity 3.
Step 2. Form . Its rows span a single direction, so and the geometric multiplicity is . A direct check gives , so . The block-counting formula (5) yields block of size and block of size . Hence — one block and one block, sizes .
Step 3. Build the chains. Solving gives the eigenspace . The image of is , so the eigenvector is the one that admits a partner. Solve : the equation is met by . The isolated eigenvector for the size- block is . Assemble with columns .
Step 4. Verify column by column: ; ; . All three hold exactly, so with .
Step 5. Now the propagator. On the blocks, , and . Multiplying out,
Two sanity checks confirm it: at it is the identity, and . The stray factor in the corner is the secular signature of the single defective block.
2 · Distinguishing from by rank (the trap made concrete)
A matrix has one eigenvalue with algebraic multiplicity and geometric multiplicity . What Jordan forms are possible, and what single measurement decides between them?
Step 1. Two blocks () summing to size () leave exactly two partitions: sizes or sizes . The multiplicities alone cannot choose, because both give .
Step 2. Go one power up. For sizes the size- block contributes rank to and the size- block contributes , so . For sizes each size- block dies at the second power, so .
Step 3. Apply formula (5). With : and — one block of size , one of size . With : — two blocks of size . The single number decides: , .
3 · The critically damped oscillator (defectiveness in a physics you already know)
A damped oscillator is written as with . Take rad/s and tune to critical damping . Solve for with .
Step 1. The companion matrix has characteristic equation . The doubled root has geometric multiplicity (a companion matrix always has a single eigenvector), so is a single defective Jordan block — critical damping is exactly where the system goes defective.
Step 2. By equation (8) the solution carries the secular factor: . Impose , and with . Hence .
Step 3. Verify against the ODE: (so ✓) and , giving ✓. The 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
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 , 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.
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 and the multiplicity relations (4) are verifiable against Horn & Johnson ch. 3 and Stone & Goldbart; the block-exponential (7)–(8) and the critically damped result are standard (Arfken–Weber–Harris; Riley–Hobson–Bence). Every number here was re-verified numerically: for the worked the eigenvalues are all , , , to machine precision, and ; the -vs- discriminator and the secular curve (peak at , crossing at ) check out. A verifier should confirm (i) column by column, (ii) for a size- 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 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 — the operator merely rescales it. A generalized eigenvector of rank satisfies the weaker but : it is killed only after applications. Applying once to a rank- vector gives a rank- one, so they arrange into chains stepping down to a genuine eigenvector (the rank- case). The point is that there are always enough — the generalized eigenspace 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 compute the ranks until they stop dropping; then and the block sizes come from — that fixes . Third, if you also need , build the chains: find the eigenvectors, see which lie in the image of (those get partners), and solve upward to grow each chain to its block size. The columns of 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 block into two 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 with diagonalizable, nilpotent, and — crucially — and commuting. In Jordan coordinates is the diagonal part of and its superdiagonal part, but the theorem's power is that both are polynomials in , so you never change basis to build them. Because they commute, functions factor: , 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 — is the smallest defective matrix. Its only eigenvalue is (repeated), and has rank , so there is just one eigenvector, . Diagonalizing would need two independent eigenvectors, and they do not exist: but . Geometrically the map is a shear — it fixes the -axis direction and slides everything else along it — with no second invariant direction to rescale. That missing direction is filled by the generalized eigenvector , sent to : an eigenvector plus a leak, the irreducible content of a Jordan block.