ConceptComplete

Computing Jordan Canonical Form

Computing the Jordan form requires finding generalized eigenvectors systematically. The process involves analyzing the kernel structure of powers of (AλI)(A - \lambda I).

DefinitionJordan Chain

A Jordan chain for eigenvalue λ\lambda is a sequence of vectors {v1,v2,,vk}\{\mathbf{v}_1, \mathbf{v}_2, \ldots, \mathbf{v}_k\} satisfying: (AλI)v1=0(A - \lambda I)\mathbf{v}_1 = \mathbf{0} (AλI)vi=vi1for i=2,,k(A - \lambda I)\mathbf{v}_i = \mathbf{v}_{i-1} \quad \text{for } i = 2, \ldots, k

The vector vk\mathbf{v}_k is a generalized eigenvector of rank kk, and the chain corresponds to a Jordan block Jk(λ)J_k(\lambda).

ExampleFinding Jordan Form

Let A=[210020003]A = \begin{bmatrix} 2 & 1 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 3 \end{bmatrix}.

Step 1: Find eigenvalues. Since AA is triangular, eigenvalues are diagonal entries: λ1=2\lambda_1 = 2 (mult. 2), λ2=3\lambda_2 = 3 (mult. 1).

Step 2: For λ=2\lambda = 2, compute ker(A2I)\ker(A - 2I): A2I=[010000001]A - 2I = \begin{bmatrix} 0 & 1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{bmatrix} Only one eigenvector, so geometric multiplicity is 1 < 2 = algebraic multiplicity.

Step 3: Find generalized eigenvector in ker((A2I)2)\ker((A-2I)^2).

Conclusion: Jordan form is J=[210020003]J = \begin{bmatrix} 2 & 1 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 3 \end{bmatrix} (which equals AA itself—already in Jordan form).

DefinitionGeometric vs Algebraic Multiplicity

For eigenvalue λ\lambda:

  • Geometric multiplicity gλ=dim(ker(AλI))g_\lambda = \dim(\ker(A - \lambda I)) counts independent eigenvectors
  • Algebraic multiplicity aλa_\lambda is the multiplicity of λ\lambda as a root of the characteristic polynomial

Always: 1gλaλ1 \leq g_\lambda \leq a_\lambda

The number of Jordan blocks for λ\lambda equals gλg_\lambda. The sum of sizes of these blocks equals aλa_\lambda.

TheoremStructure of Generalized Eigenspaces

For eigenvalue λ\lambda with algebraic multiplicity aλa_\lambda: dim(Gλ)=dim(ker((AλI)aλ))=aλ\dim(G_\lambda) = \dim(\ker((A - \lambda I)^{a_\lambda})) = a_\lambda

The dimensions form an increasing chain: dim(ker(AλI))dim(ker((AλI)2))dim(ker((AλI)aλ))=aλ\dim(\ker(A - \lambda I)) \leq \dim(\ker((A - \lambda I)^2)) \leq \cdots \leq \dim(\ker((A - \lambda I)^{a_\lambda})) = a_\lambda

Remark

Computing Jordan form is more involved than diagonalization and numerically unstable (small perturbations can change the structure). In practice, Jordan form is primarily a theoretical tool for understanding matrix structure. For computation, Schur decomposition is preferred as it's numerically stable.