Jordan Normal Form

Jordan Normal Form (JNF): every square matrix over an algebraically closed field is similar to a block-diagonal matrix built from "Jordan blocks" — nearly-diagonal pieces with eigenvalues on the diagonal and 1's on the superdiagonal. It is the closest a non-diagonalizable matrix can get to being diagonal. Applies wherever linear operators must be classified up to similarity: ODE systems, matrix functions, control theory, dynamical systems. Established by Camille Jordan (1870).

The Jordan Normal Form is a canonical form for a square matrix $A$ under the relation of similarity ( $A \sim B$ iff $B = P^{- 1} A P$ ). Over an algebraically closed field (typically $C$ ), every matrix is similar to a unique (up to ordering of blocks) block-diagonal matrix $J$ whose blocks are Jordan blocks. Each Jordan block encodes a single eigenvalue together with a chain of generalized eigenvectors that cannot be split apart. This matters because it gives a complete invariant: two matrices are similar iff they have the same Jordan form, and it makes computing $A^{n}$ , $e^{A t}$ , and other matrix functions almost mechanical. The surprising fact: the entire structure of a possibly wildly complicated operator is captured by a finite list of integers — the sizes of its Jordan blocks.

The Core Insight

Diagonalization fails when an operator does not have "enough" eigenvectors. The fix is to enlarge the notion of eigenvector to generalized eigenvectors — vectors $v$ killed by some power $(A - λ I)^{k}$ rather than by $(A - λ I)$ itself. These organize into Jordan chains, where each vector maps (under $A - λ I$ ) to the previous one. Each chain becomes one Jordan block. The deep statement is that the whole space decomposes into independent chains, so any operator is, up to a change of basis, a disjoint union of these elementary "shift-plus-scalar" pieces.

Formal Statement

Jordan Block

A Jordan block of size $k$ with eigenvalue $λ$ is the $k \times k$ matrix

J_{k} (λ) = λ 1 λ 1 ⋱ ⋱ λ 1 λ

⟳place

λ

on the diagonal,

1

on the superdiagonal,

0

everywhere else;

J_{1} (λ) = (λ)

is the smallest case.

Here $λ$ is the eigenvalue, $k$ is the block size, the $1$ 's sit on the entries $(i, i + 1)$ , and all other entries are $0$ .

Jordan Normal Form

A matrix $J$ is in Jordan Normal Form if it is block-diagonal with Jordan blocks:

J = i = 1 ⨁ m J_{k_{i}} (λ_{i}) = J_{k_{1}} (λ_{1}) ⋱ J_{k_{m}} (λ_{m})

⟳arrange the individual blocks

J_{k_{i}} (λ_{i})

along the diagonal of a larger matrix, zeros off the blocks.

The $λ_{i}$ need not be distinct (an eigenvalue may own several blocks), and $\sum_{i} k_{i} = n$ , the matrix dimension.

Existence and Uniqueness of JNF

Let $V$ be a finite-dimensional vector space over an algebraically closed field $F$ , and let $A : V \to V$ be linear. Then there is a basis of $V$ in which $A$ is represented by a matrix $J$ in Jordan Normal Form. This $J$ is unique up to the order of the blocks. Equivalently, every square matrix over $F$ is similar to such a $J$ :

P^{- 1} A P = J

⟳

P

is the matrix whose columns are the Jordan-chain basis vectors; reading off how

A

acts on those basis vectors reproduces equation [2].

Block-Counting Formula

For eigenvalue $λ$ , the number of Jordan blocks of size exactly $j$ is determined by ranks of powers of $N = A - λ I$ :

b_{j} (λ) = rank (N^{j - 1}) - 2 rank (N^{j}) + rank (N^{j + 1})

⟳

dim ker (N^{j}) - dim ker (N^{j - 1})

counts blocks of size

\geq j

; differencing that quantity again isolates blocks of size exactly

j

. Use

rank = n - dim ker

The number of blocks for $λ$ (total) equals $dim ker (A - λ I)$ , the geometric multiplicity; the total size of all $λ$ -blocks equals the algebraic multiplicity.

Why It Holds / Derivation

Decomposition into Jordan chains

We sketch the standard constructive proof over $C$ .

Step 1 — Reduce to a single eigenvalue. By the Primary Decomposition Theorem, if the characteristic polynomial factors as

\prod_{i} (x - λ_{i})^{m_{i}}

, then

V = i ⨁ ker ((A - λ_{i} I)^{m_{i}})

⟳the factors

(x - λ_{i})^{m_{i}}

are pairwise coprime, so Bézout gives idempotent projections summing to the identity; each projects onto a generalized eigenspace, which is

A

-invariant.

Each summand $V_{i} = ker ((A - λ_{i} I)^{m_{i}})$ is $A$ -invariant, so we may work in one $V_{i}$ at a time.

Step 2 — Reduce to a nilpotent operator. On

V_{i}

set

N = A - λ_{i} I

. Then

N

is nilpotent:

N^{m_{i}} = 0

V_{i}

. It suffices to find a Jordan basis for

N

, since adding back

λ_{i} I

turns each nilpotent Jordan block

J_{k} (0)

into

J_{k} (λ_{i})

. Step 3 — Jordan basis for a nilpotent $N$ . Consider the descending chain of kernels:

{0} ⊊ ker N ⊊ ker N^{2} ⊊ \dots ⊊ ker N^{p} = V_{i}

⟳

ker N^{j} \subseteq ker N^{j + 1}

always; for nilpotent

N

the chain strictly grows until it fills

V_{i}

at the index of nilpotency

p

Choose a basis of $V_{i}$ adapted to this filtration from the top down. Take vectors completing $ker N^{p - 1}$ to $ker N^{p}$ ; apply $N$ repeatedly to each to generate a Jordan chain

v, N v, N^{2} v, \dots, N^{k - 1} v (N^{k} v = 0)

⟳

N

maps

ker N^{j}

into

ker N^{j - 1}

, so each chain descends one level per application; chains are independent because their leading vectors are chosen linearly independent modulo lower kernels.

Step 4 — Read off the block. On the chain in [7],

N

sends each basis vector to the next, so in the basis

(N^{k - 1} v, \dots, N v, v)

the operator

N

is exactly

J_{k} (0)

. Collecting all chains across all

V_{i}

gives the full basis

P

and equation [2].

■

Uniqueness follows from [4]: the block sizes are forced by rank invariants of

A

, which are unchanged by similarity.

Camille Jordan | 1838–1922

Marie Ennemond Camille Jordan was a French mathematician and engineer whose 1870 Traité des substitutions et des équations algébriques introduced the canonical form now bearing his name, in the context of studying linear substitutions over finite fields and the solvability of equations. (He is also responsible for the Jordan curve theorem and Jordan measure — a different, frequently confused Jordan from Wilhelm Jordan of Gauss–Jordan elimination.) His treatise was a foundational text in group theory and bridged Galois's ideas with concrete matrix computation.

Building Intuition

Think of a Jordan block $J_{k} (λ)$ as a scalar $λ$ plus a one-step shift. Write $J_{k} (λ) = λ I + N$ where $N$ is the "shift" sending basis vector $e_{i + 1} \mapsto e_{i}$ and $e_{1} \mapsto 0$ . Applying $N$ once "moves you down the chain"; applying it $k$ times annihilates everything. So a Jordan block is the algebraic incarnation of a finite conveyor belt: stuff enters at the top, slides down one notch each time $N$ acts, and falls off the bottom after $k$ steps.

Diagonalizability is the special case where every belt has length 1 — every generalized eigenvector is already a genuine eigenvector. A nontrivial Jordan block of size $\geq 2$ is precisely the obstruction to diagonalizing: it signals an eigenvalue whose geometric multiplicity (number of belts) is less than its algebraic multiplicity (total belt length).

A Jordan chain visualized as a conveyor belt under N = A − λI

Worked Examples

A 3×3 with a defective eigenvalue

Given.

A = 200120003

Step 1 — Characteristic polynomial.

det (A - x I) = (2 - x)^{2} (3 - x)

, so eigenvalues are

λ = 2

(algebraic multiplicity 2) and

λ = 3

(algebraic multiplicity 1). Step 2 — Geometric multiplicity of $λ = 2$ . Compute

N = A - 2 I = 000100001

rank (N) = 2

, so

dim ker N = 3 - 2 = 1

. Only one eigenvector for

λ = 2

, yet algebraic multiplicity is 2 → one Jordan block of size 2. Step 3 — Block counting via [4]. For

λ = 3

: geometric mult

= 1

, alg mult

= 1

→ one size-1 block. Step 4 — Assemble.

J = 200120003 = J_{2} (2) \oplus J_{1} (3)

(Here

A

is already in Jordan form.)

Computing $e^{At}$ via JNF

Given.

A = (5 - 1 13)

, find

e^{A t}

. Step 1 — Eigenvalues.

det (A - x I) = (5 - x) (3 - x) + 1 = x^{2} - 8 x + 16 = (x - 4)^{2}

. Single eigenvalue

λ = 4

, alg mult 2. Step 2 — Geometric multiplicity.

N = A - 4 I = (1 - 1 1 - 1)

rank = 1

dim ker N = 1

. Defective → one

J_{2} (4)

block. Step 3 — Jordan basis. Eigenvector

v_{1}

: solve

N v_{1} = 0 \Rightarrow v_{1} = (1, - 1)^{T}

. Generalized eigenvector

v_{2}

with

N v_{2} = v_{1}

(1 - 1 1 - 1) v_{2} = (1, - 1)^{T} \Rightarrow v_{2} = (1, 0)^{T}

. So

P = (1 - 1 10)

and

J = (4014)

. Step 4 — Exponentiate the block. For

J_{2} (λ) = λ I + N_{0}

with

N_{0}^{2} = 0

e^{J t} = e^{4 t} (10 t 1) .

Step 5 — Transform back.

e^{A t} = P e^{J t} P^{- 1}

with

P^{- 1} = (01 - 1 1)

e^{A t} = e^{4 t} (1 + t - t t 1 - t)

(units: dimensionless matrix,

t

in the same time units as the underlying ODE

\overset{x}{˙} = A x

Common Misconceptions

JNF over $R$ may not exist as written. The existence theorem requires an algebraically closed field. A real matrix with complex eigenvalues (e.g. a rotation) has no real Jordan form with real

λ

's on the diagonal; one uses the real Jordan form with

2 \times 2

rotation-scaling blocks instead. Also: the Jordan form is not a continuous function of the matrix entries — an arbitrarily small perturbation can split a Jordan block into distinct eigenvalues, which is exactly why JNF is numerically ill-conditioned and rarely computed in floating-point practice.

A common error: "algebraic multiplicity equals the size of the largest Jordan block." Consider $λ$ with algebraic multiplicity 4 but Jordan structure $J_{2} (λ) \oplus J_{1} (λ) \oplus J_{1} (λ)$ . The algebraic multiplicity is $2 + 1 + 1 = 4$ (sum of all block sizes), the geometric multiplicity is $3$ (number of blocks), and the largest block has size $2$ — which is the multiplicity of $(x - λ)$ in the minimal polynomial, not the characteristic polynomial. Conflating these three numbers is the single most frequent JNF mistake.

Connections

JNF sits at the heart of the structure theory of linear operators. It is the special case (over an algebraically closed field) of the Rational Canonical Form, which works over any field by using companion blocks of invariant factors. The block sizes are governed by the Minimal Polynomial (largest block per eigenvalue) and the Characteristic Polynomial (total block size per eigenvalue). The diagonalizable case is exactly when JNF reduces to the Spectral Theorem situation of distinct eigenspaces. Abstractly, JNF is the manifestation of the Structure Theorem for Finitely Generated Modules over a PID applied to $V$ as a module over $F [x]$ , where the Jordan blocks correspond to primary cyclic summands $F [x] / (x - λ)^{k}$ .

Real-World Applications

Linear ODE systems. Solving $\overset{x}{˙} = A x$ requires $e^{A t}$ ; defective (non-diagonalizable) systems produce solutions with polynomial-times-exponential terms $t^{j} e^{λ t}$ , directly read off block sizes.
Control theory & stability. Repeated eigenvalues on the imaginary axis with Jordan blocks of size $\geq 2$ give unbounded (polynomially growing) responses — the criterion for marginal vs. genuine instability in Lyapunov Stability analysis.
Markov chains & PageRank. Convergence rates and oscillatory transients of $A^{n}$ depend on Jordan structure near the dominant eigenvalue; non-trivial blocks slow convergence by polynomial factors.
Difference equations / recurrences. Closed forms for linear recurrences with repeated characteristic roots use the same $n^{j} r^{n}$ terms that Jordan blocks generate.
Quantum mechanics (non-Hermitian / open systems). Effective non-Hermitian Hamiltonians exhibit exceptional points where eigenvectors coalesce — physically a Jordan block forming, with enhanced sensitivity exploited in optical sensors.
Vibration & structural engineering. Critically damped modes correspond to coincident eigenvalues with Jordan coupling between displacement and velocity coordinates.
Differential geometry / Lie theory. The Jordan–Chevalley decomposition $A = A_{s} + A_{n}$ (semisimple plus nilpotent) underpins the analysis of Lie Algebras and algebraic groups.

Historical Development

1858 — Cayley and Sylvester develop the theory of matrices; the Cayley–Hamilton theorem hints at minimal/characteristic polynomial structure.
1868 — Karl Weierstrass introduces elementary divisors and a canonical form for matrix pencils, anticipating the invariant-factor viewpoint.
1870 — Camille Jordan publishes Traité des substitutions, defining the canonical form over finite fields in connection with Galois theory.
1878 — Georg Frobenius unifies and clarifies the invariant-factor and elementary-divisor theories, giving the rational canonical form.
1880s — The module-over-PID interpretation crystallizes through the work on finitely generated abelian groups (Frobenius, Stickelberger).
1930s — Jordan–Chevalley decomposition formalized in the theory of algebraic groups and Lie algebras.
1965 — Numerical analysts (Wilkinson) document the extreme ill-conditioning of JNF computation, steering applied practice toward the Schur form.
20th–21st c. — Exceptional points in non-Hermitian physics revive interest in Jordan blocks as physical, observable phenomena rather than mere algebraic curiosities.

Subtleties & Limits

The chief practical limitation of Jordan Normal Form is numerical instability: because Jordan structure is destroyed by generic perturbations, no backward-stable algorithm computes it from inexact data. This raises the still-active question of how to define a meaningful numerical Jordan form — work by Golub, Wilkinson, and others on staircase algorithms and the Kronecker canonical form addresses it partially, but a fully robust, parameter-free method remains elusive. Related open territory includes the structured perturbation theory of exceptional points (how Jordan blocks deform under physically constrained perturbations) and effective bounds on the conditioning of the similarity matrix $P$ , which can be exponentially large in the block size and is central to controlling errors in matrix-function computation.

Jordan Normal Form

The Core Insight

Formal Statement

Jordan Block

Jordan Normal Form

Existence and Uniqueness of JNF

Block-Counting Formula

Why It Holds / Derivation

Decomposition into Jordan chains

Camille Jordan | 1838–1922

Building Intuition

A Jordan chain visualized as a conveyor belt under N = A − λI

Worked Examples

A 3×3 with a defective eigenvalue

Computing $e^{At}$ via JNF

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also

Before this

Where this leads