ConceptComplete

Jordan Normal Form

The Jordan normal form is the "next best thing" after diagonalization. When a matrix cannot be diagonalized, it can still be brought into a nearly diagonal form consisting of Jordan blocks. This form is unique (up to ordering of blocks) and completely classifies matrices up to similarity over an algebraically closed field.


Jordan blocks

Definition7.1Jordan block

A Jordan block of size kk with eigenvalue λ\lambda is the k×kk \times k matrix:

Jk(λ)=λIk+Nk,J_k(\lambda) = \lambda I_k + N_k,

where NkN_k is the k×kk \times k matrix with 11s on the superdiagonal and 00s elsewhere. Explicitly:

Jk(λ)=(λ1000λ1000λ1000λ).J_k(\lambda) = \begin{pmatrix} \lambda & 1 & 0 & \cdots & 0 \\ 0 & \lambda & 1 & \cdots & 0 \\ \vdots & & \ddots & \ddots & \vdots \\ 0 & 0 & \cdots & \lambda & 1 \\ 0 & 0 & \cdots & 0 & \lambda \end{pmatrix}.

ExampleSmall Jordan blocks
  • J1(λ)=(λ)J_1(\lambda) = (\lambda) -- a 1×11 \times 1 block (just a scalar).
  • J2(3)=(3103)J_2(3) = \begin{pmatrix} 3 & 1 \\ 0 & 3 \end{pmatrix}.
  • J3(0)=(010001000)J_3(0) = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix} (a nilpotent Jordan block).
  • J4(2)=(2100021000210002)J_4(2) = \begin{pmatrix} 2 & 1 & 0 & 0 \\ 0 & 2 & 1 & 0 \\ 0 & 0 & 2 & 1 \\ 0 & 0 & 0 & 2 \end{pmatrix}.
ExamplePowers of Jordan blocks

(Jk(λ))n=j=0k1(nj)λnjNkj(J_k(\lambda))^n = \sum_{j=0}^{k-1} \binom{n}{j} \lambda^{n-j} N_k^j, so the (i,i+j)(i, i+j) entry of Jk(λ)nJ_k(\lambda)^n is (nj)λnj\binom{n}{j}\lambda^{n-j} for j=0,1,,k1j = 0, 1, \ldots, k-1.

For J2(3)n=(3nn3n103n)J_2(3)^n = \begin{pmatrix} 3^n & n \cdot 3^{n-1} \\ 0 & 3^n \end{pmatrix}.

For J3(1)n=(1n(n2)01n001)J_3(1)^n = \begin{pmatrix} 1 & n & \binom{n}{2} \\ 0 & 1 & n \\ 0 & 0 & 1 \end{pmatrix}.


Jordan normal form

Definition7.2Jordan normal form

A matrix AMn×n(F)A \in M_{n \times n}(F) (where FF is algebraically closed) is in Jordan normal form if it is a block diagonal matrix of Jordan blocks:

J=diag(Jk1(λ1),Jk2(λ2),,Jkr(λr)),J = \operatorname{diag}(J_{k_1}(\lambda_1), J_{k_2}(\lambda_2), \ldots, J_{k_r}(\lambda_r)),

where k1+k2++kr=nk_1 + k_2 + \cdots + k_r = n.

Theorem7.1Jordan Normal Form Theorem

Let AMn×n(F)A \in M_{n \times n}(F) where FF is algebraically closed (e.g., F=CF = \mathbb{C}). Then AA is similar to a unique (up to permutation of blocks) Jordan normal form JJ. That is, there exists an invertible PP such that P1AP=JP^{-1}AP = J.

ExampleJordan forms for 2x2 matrices

Every 2×22 \times 2 matrix over C\mathbb{C} has one of two Jordan forms:

  • Two distinct eigenvalues λ1λ2\lambda_1 \neq \lambda_2: J=(λ100λ2)J = \begin{pmatrix} \lambda_1 & 0 \\ 0 & \lambda_2 \end{pmatrix} (diagonal).

  • One repeated eigenvalue λ\lambda with mg=2m_g = 2: J=(λ00λ)=λIJ = \begin{pmatrix} \lambda & 0 \\ 0 & \lambda \end{pmatrix} = \lambda I (already diagonal).

  • One repeated eigenvalue λ\lambda with mg=1m_g = 1: J=(λ10λ)J = \begin{pmatrix} \lambda & 1 \\ 0 & \lambda \end{pmatrix} (a single Jordan block).

ExampleAll Jordan forms for 3x3 matrices

The possible Jordan forms for 3×33 \times 3 matrices (grouped by eigenvalue pattern):

Three distinct eigenvalues λ1,λ2,λ3\lambda_1, \lambda_2, \lambda_3: diag(λ1,λ2,λ3)\operatorname{diag}(\lambda_1, \lambda_2, \lambda_3).

One repeated eigenvalue (say λ\lambda with ma=2m_a = 2, plus μλ\mu \neq \lambda):

  • diag(λ,λ,μ)\operatorname{diag}(\lambda, \lambda, \mu) if mg(λ)=2m_g(\lambda) = 2.
  • diag(J2(λ),μ)\operatorname{diag}(J_2(\lambda), \mu) if mg(λ)=1m_g(\lambda) = 1.

Triple eigenvalue λ\lambda (with ma=3m_a = 3):

  • λI3\lambda I_3 if mg=3m_g = 3.
  • diag(J2(λ),λ)\operatorname{diag}(J_2(\lambda), \lambda) if mg=2m_g = 2.
  • J3(λ)J_3(\lambda) if mg=1m_g = 1.

Computing Jordan form

ExampleFinding the Jordan form

A=(5421011111301112)A = \begin{pmatrix} 5 & 4 & 2 & 1 \\ 0 & 1 & -1 & -1 \\ -1 & -1 & 3 & 0 \\ 1 & 1 & -1 & 2 \end{pmatrix}.

Step 1: Characteristic polynomial. pA(λ)=(λ1)(λ2)(λ4)2p_A(\lambda) = (\lambda - 1)(\lambda - 2)(\lambda - 4)^2... (assume after computation).

Eigenvalues: 1,2,41, 2, 4 (with 44 having ma=2m_a = 2).

Step 2: For λ=4\lambda = 4, compute dimker(A4I)\dim\ker(A - 4I). If mg(4)=2m_g(4) = 2: diagonal block diag(4,4)\operatorname{diag}(4, 4). If mg(4)=1m_g(4) = 1: Jordan block J2(4)J_2(4).

Step 3: The Jordan form is either diag(1,2,4,4)\operatorname{diag}(1, 2, 4, 4) or diag(1,2,J2(4))\operatorname{diag}(1, 2, J_2(4)).

ExampleNilpotent 3x3 matrix

A=(010000000)A = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}.

Eigenvalue: 00 with ma=3m_a = 3. rank(A)=1\operatorname{rank}(A) = 1, so mg(0)=dimkerA=2m_g(0) = \dim\ker A = 2.

Since mg=2m_g = 2, there are two Jordan blocks for λ=0\lambda = 0: one J2(0)J_2(0) and one J1(0)J_1(0).

Jordan form: diag(J2(0),0)=(010000000)\operatorname{diag}(J_2(0), 0) = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}.

The matrix is already in Jordan form.

ExampleJordan form with complex eigenvalues

A=(0110)A = \begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix} over C\mathbb{C}.

Eigenvalues: i,ii, -i (distinct), so the Jordan form is (i00i)\begin{pmatrix} i & 0 \\ 0 & -i \end{pmatrix}.

Over R\mathbb{R}: AA is already in its real canonical form (a rotation block).


Generalized eigenvectors

Definition7.3Generalized eigenvector

A vector vv is a generalized eigenvector of AA for eigenvalue λ\lambda of order kk if:

(AλI)kv=0but(AλI)k1v0.(A - \lambda I)^k v = 0 \quad \text{but} \quad (A - \lambda I)^{k-1} v \neq 0.

The generalized eigenspace is Gλ=ker(AλI)ma(λ)G_\lambda = \ker(A - \lambda I)^{m_a(\lambda)}, and dimGλ=ma(λ)\dim G_\lambda = m_a(\lambda).

ExampleFinding generalized eigenvectors

A=(2102)A = \begin{pmatrix} 2 & 1 \\ 0 & 2 \end{pmatrix}, λ=2\lambda = 2, ma=2m_a = 2, mg=1m_g = 1.

Eigenvector: v1=(1,0)v_1 = (1, 0), with (A2I)v1=0(A - 2I)v_1 = 0.

Generalized eigenvector: solve (A2I)v2=v1(A - 2I)v_2 = v_1, i.e., (0100)v2=(10)\begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix} v_2 = \begin{pmatrix} 1 \\ 0 \end{pmatrix}. Solution: v2=(0,1)v_2 = (0, 1).

(A2I)2v2=(A2I)v1=0(A - 2I)^2 v_2 = (A-2I)v_1 = 0 ✓, (A2I)v2=v10(A-2I)v_2 = v_1 \neq 0 ✓.

Jordan chain: v1v2v_1 \leftarrow v_2. Transition matrix: P=(v1,v2)=IP = (v_1, v_2) = I, P1AP=J2(2)P^{-1}AP = J_2(2).

ExampleGeneralized eigenvectors for a 3x3 matrix

A=(110011001)A = \begin{pmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{pmatrix}, λ=1\lambda = 1, ma=3m_a = 3, mg=1m_g = 1 (since rank(AI)=2\operatorname{rank}(A - I) = 2).

(AI)=(010001000)(A - I) = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}, (AI)2=(001000000)(A-I)^2 = \begin{pmatrix} 0 & 0 & 1 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}, (AI)3=0(A-I)^3 = 0.

Jordan chain: start with v3=(0,0,1)v_3 = (0, 0, 1) (in ker(AI)3ker(AI)2\ker(A-I)^3 \setminus \ker(A-I)^2).

v2=(AI)v3=(0,1,0)v_2 = (A-I)v_3 = (0, 1, 0), v1=(AI)v2=(1,0,0)v_1 = (A-I)v_2 = (1, 0, 0).

P=(v1,v2,v3)=IP = (v_1, v_2, v_3) = I, confirming AA is already in Jordan form J3(1)J_3(1).


Properties of Jordan form

ExampleInvariants from Jordan form

J=diag(J2(3),J1(5))J = \operatorname{diag}(J_2(3), J_1(5)):

  • det(J)=325=45\det(J) = 3^2 \cdot 5 = 45.
  • tr(J)=3+3+5=11\operatorname{tr}(J) = 3 + 3 + 5 = 11.
  • Characteristic polynomial: (λ3)2(λ5)(\lambda - 3)^2(\lambda - 5).
  • Minimal polynomial: (λ3)2(λ5)(\lambda - 3)^2(\lambda - 5) (the largest Jordan block for λ=3\lambda = 3 has size 22).
ExampleNilpotent index from Jordan form

If AA has Jordan form diag(J3(0),J2(0),J1(0))\operatorname{diag}(J_3(0), J_2(0), J_1(0)):

  • A20A^2 \neq 0 (the J3(0)J_3(0) block needs 33 applications to vanish).
  • A3=0A^3 = 0 (all blocks are killed by the third power).
  • The nilpotent index is the size of the largest Jordan block.
ExampleJordan form classifies similarity

Two matrices are similar iff they have the same Jordan form (up to ordering of blocks).

A=(3103)A = \begin{pmatrix} 3 & 1 \\ 0 & 3 \end{pmatrix} and B=(3203)B = \begin{pmatrix} 3 & 2 \\ 0 & 3 \end{pmatrix}: both have Jordan form J2(3)J_2(3). They are similar (any upper triangular matrix with eigenvalue 33 and mg=1m_g = 1 in 2×22 \times 2 is similar to J2(3)J_2(3)). Indeed P=(1002)P = \begin{pmatrix} 1 & 0 \\ 0 & 2 \end{pmatrix} gives P1BP=J2(3)P^{-1}BP = J_2(3).

A=(3103)A = \begin{pmatrix} 3 & 1 \\ 0 & 3 \end{pmatrix} and C=(3003)C = \begin{pmatrix} 3 & 0 \\ 0 & 3 \end{pmatrix}: different Jordan forms (J2(3)J_2(3) vs diag(3,3)\operatorname{diag}(3, 3)), so not similar.


Applications of Jordan form

ExampleMatrix exponential via Jordan form

eJk(λ)t=eλt(1tt2/201t001)e^{J_k(\lambda)t} = e^{\lambda t} \begin{pmatrix} 1 & t & t^2/2 & \cdots \\ 0 & 1 & t & \cdots \\ \vdots & & \ddots & \\ 0 & 0 & \cdots & 1 \end{pmatrix}.

For J2(3)J_2(3): eJ2(3)t=e3t(1t01)e^{J_2(3)t} = e^{3t}\begin{pmatrix} 1 & t \\ 0 & 1 \end{pmatrix}.

The solution to x=J2(3)xx' = J_2(3)x is x(t)=e3t(c1+c2t,c2)x(t) = e^{3t}(c_1 + c_2 t, c_2) -- note the polynomial growth factor tt due to the Jordan block. Diagonal matrices give pure exponentials; Jordan blocks add polynomial factors.

ExampleLong-term behavior from Jordan form

For AnA^n as nn \to \infty: Jk(λ)n0J_k(\lambda)^n \to 0 iff λ<1|\lambda| < 1, or λ=1|\lambda| = 1 and k=1k = 1. If λ>1|\lambda| > 1, or λ=1|\lambda| = 1 and k>1k > 1, then Jk(λ)nJ_k(\lambda)^n diverges.

So An0A^n \to 0 iff all eigenvalues satisfy λ<1|\lambda| < 1 (the spectral radius ρ(A)<1\rho(A) < 1).


Summary

RemarkJordan form as the complete similarity invariant

The Jordan normal form provides:

  • A canonical representative for each similarity class of matrices.
  • A classification: two matrices are similar iff they have the same Jordan form.
  • Explicit formulas for AnA^n and eAte^{At} in terms of eigenvalues and block sizes.
  • The minimal polynomial as i(λλi)ki\prod_i (\lambda - \lambda_i)^{k_i} where kik_i is the largest block size for λi\lambda_i.
  • A decomposition of Cn\mathbb{C}^n into generalized eigenspaces: Cn=Gλ1Gλm\mathbb{C}^n = G_{\lambda_1} \oplus \cdots \oplus G_{\lambda_m}.