Classifying Matrices with the Jordan Normal Form
This article explores how the Jordan normal form classifies matrices over the complex numbers that cannot be fully diagonalized. By breaking down these "defective" matrices into block-diagonal structures known as Jordan blocks, this mathematical tool provides a unique, standardized representation for every square matrix. Below is a straightforward breakdown of why diagonalization sometimes fails, how generalized eigenvectors resolve this issue, and how the resulting Jordan normal form categorizes all complex matrices up to similarity.
The Problem of Non-Diagonalizable Matrices
In linear algebra, diagonalizing a matrix simplifies complex calculations. A square \(n \times n\) matrix is diagonalizable if it has \(n\) linearly independent eigenvectors. When working over the complex numbers, the Fundamental Theorem of Algebra guarantees that every matrix has \(n\) eigenvalues, counting repetitions.
However, a matrix is non-diagonalizable (or "defective") when there is a mismatch between two types of eigenvalue counts:
- Algebraic Multiplicity: The number of times an eigenvalue appears as a root of the matrix's characteristic polynomial.
- Geometric Multiplicity: The number of linearly independent eigenvectors associated with that eigenvalue.
When the geometric multiplicity is strictly less than the algebraic multiplicity for any eigenvalue, the matrix lacks a full set of eigenvectors and cannot be diagonalized.
Generalized Eigenvectors and Jordan Chains
To classify a defective matrix, mathematicians compensate for the missing eigenvectors by introducing generalized eigenvectors.
While a standard eigenvector \(v\) for a matrix \(A\) and eigenvalue \(\lambda\) satisfies the equation \((A - \lambda I)v = 0\), a generalized eigenvector of rank \(k\) satisfies: \[(A - \lambda I)^k v = 0\] while \((A - \lambda I)^{k-1} v \neq 0\).
By applying the operator \((A - \lambda I)\) repeatedly to a generalized eigenvector, one generates a sequence of vectors that eventually terminates in a true eigenvector. This sequence is called a Jordan chain. Combining all the linearly independent Jordan chains for every eigenvalue always yields a complete basis of \(n\) vectors for the complex vector space, regardless of how defective the matrix is.
The Structure of the Jordan Normal Form
When a matrix is rewritten using this basis of generalized eigenvectors, it transforms into its Jordan normal form (also called the Jordan canonical form). This is the closest a non-diagonalizable matrix can get to being diagonal.
The Jordan normal form is a block-diagonal matrix composed of smaller square matrices called Jordan blocks. Each Jordan block corresponds to a single Jordan chain and has a specific structure:
- Main Diagonal: Filled entirely with a single eigenvalue, \(\lambda\).
- Superdiagonal: The diagonal line directly above the main diagonal is filled entirely with the number \(1\).
- Everywhere Else: All other entries in the block are \(0\).
If a matrix is actually diagonalizable, its Jordan normal form simply consists of \(1 \times 1\) Jordan blocks, making the superdiagonal of \(1\)s disappear and leaving a standard diagonal matrix.
Classification via Matrix Similarity
The ultimate power of the Jordan normal form lies in its ability to classify matrices through similarity. Two matrices \(A\) and \(B\) are similar if there is an invertible matrix \(P\) such that \(A = PBP^{-1}\). Similar matrices represent the exact same linear transformation, just viewed from different bases.
The Jordan normal form theorem states that every square matrix over the complex numbers is similar to a unique Jordan matrix, up to the ordering of the Jordan blocks. Therefore, the classification works as follows:
- The Invariants: The eigenvalues, the sizes of the Jordan blocks, and the number of blocks for each eigenvalue act as a unique "fingerprint" for a linear transformation.
- Equivalence Classes: Two complex matrices are similar if and only if they share the exact same Jordan normal form (ignoring the order in which the blocks are placed along the diagonal).
By reducing any complex matrix to this canonical state, the Jordan normal form provides a complete and definitive classification system, sorting an infinite variety of complex matrices into distinct, predictable categories based on their structural behavior.