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
A Jordan block of size with eigenvalue is the matrix:
where is the matrix with s on the superdiagonal and s elsewhere. Explicitly:
- -- a block (just a scalar).
- .
- (a nilpotent Jordan block).
- .
, so the entry of is for .
For .
For .
Jordan normal form
A matrix (where is algebraically closed) is in Jordan normal form if it is a block diagonal matrix of Jordan blocks:
where .
Let where is algebraically closed (e.g., ). Then is similar to a unique (up to permutation of blocks) Jordan normal form . That is, there exists an invertible such that .
Every matrix over has one of two Jordan forms:
-
Two distinct eigenvalues : (diagonal).
-
One repeated eigenvalue with : (already diagonal).
-
One repeated eigenvalue with : (a single Jordan block).
The possible Jordan forms for matrices (grouped by eigenvalue pattern):
Three distinct eigenvalues : .
One repeated eigenvalue (say with , plus ):
- if .
- if .
Triple eigenvalue (with ):
- if .
- if .
- if .
Computing Jordan form
.
Step 1: Characteristic polynomial. ... (assume after computation).
Eigenvalues: (with having ).
Step 2: For , compute . If : diagonal block . If : Jordan block .
Step 3: The Jordan form is either or .
.
Eigenvalue: with . , so .
Since , there are two Jordan blocks for : one and one .
Jordan form: .
The matrix is already in Jordan form.
over .
Eigenvalues: (distinct), so the Jordan form is .
Over : is already in its real canonical form (a rotation block).
Generalized eigenvectors
A vector is a generalized eigenvector of for eigenvalue of order if:
The generalized eigenspace is , and .
, , , .
Eigenvector: , with .
Generalized eigenvector: solve , i.e., . Solution: .
✓, ✓.
Jordan chain: . Transition matrix: , .
, , , (since ).
, , .
Jordan chain: start with (in ).
, .
, confirming is already in Jordan form .
Properties of Jordan form
:
- .
- .
- Characteristic polynomial: .
- Minimal polynomial: (the largest Jordan block for has size ).
If has Jordan form :
- (the block needs applications to vanish).
- (all blocks are killed by the third power).
- The nilpotent index is the size of the largest Jordan block.
Two matrices are similar iff they have the same Jordan form (up to ordering of blocks).
and : both have Jordan form . They are similar (any upper triangular matrix with eigenvalue and in is similar to ). Indeed gives .
and : different Jordan forms ( vs ), so not similar.
Applications of Jordan form
.
For : .
The solution to is -- note the polynomial growth factor due to the Jordan block. Diagonal matrices give pure exponentials; Jordan blocks add polynomial factors.
For as : iff , or and . If , or and , then diverges.
So iff all eigenvalues satisfy (the spectral radius ).
Summary
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 and in terms of eigenvalues and block sizes.
- The minimal polynomial as where is the largest block size for .
- A decomposition of into generalized eigenspaces: .