markdown
Introduction to Jordan normal formmd ac9ffb5
lecture/math/linear-algebra/introduction-to-jordan-canonical-form.lecture.n.md
Download PDF

Introduction to Jordan normal formジョルダン標準形ひょうじゅんけい

date2026-07-14document_iddoc_6297f7b73c14ac625d50b253f3e7bb25descriptionジョルダン標準形を、対角化できない行列を固有値と nilpotent 成分に分けて理解するための入口として整理する講義である。prerequisites固有値と固有ベクトル / 対角化の基本 / 最小多項式の基本type講義content_typelecturestatusactiverelateddata/lecture/math/linear-algebra/linear-algebra-portal.lecture.n.md / data/lecture/math/linear-algebra/diagonalization-basics.lecture.n.md / data/lecture/math/linear-algebra/minimal-polynomial-basics.lecture.n.md / data/exercise/math/linear-algebra/eigenvalues-diagonalization-and-extensions.exercise.n.md
mathlinear-algebraundergraduatelecture

1Introduction

The key point of this lecture is that Jordan normal formジョルダン標準形ひょうじゅんけい does not give up on matrices that cannot be diagonalized. Instead, it organizes them into a form as close to diagonal as possible.

Diagonalization対角化たいかくか is the ideal case in which eigenvectors固有こゆうベクトル alone form a basis基底きてい. When there are not enough eigenvectors固有こゆうベクトル, generalized eigenvectors一般化いっぱんか固有こゆうベクトル complete the missing directions, and the matrix becomes a direct sum of Jordan blocks.

2Terms and definitions

A generalized eigenvector一般化いっぱんか固有こゆうベクトル for an eigenvalue固有値こゆうち λ is a nonzero vector v such that

(A-λI)kv=0

for some positive integer k.

A Jordan blockジョルダンブロック is

Jk(λ)=(λ1000λ100001000λ).

It can be written as

Jk(λ)=λI+N,

where N is nilpotent and has ones just above the diagonal.

3Plan

For each eigenvalue固有値こゆうち λ, separate the diagonal part λI from the nilpotent part N that prevents diagonalization.

data/lecture/math/linear-algebra/diagonalization-basics.lecture.n.md

4Intuitive explanation

In a diagonal matrix, each basis基底きてい vector is only scaled in its own direction. In a Jordan blockジョルダンブロック, a small coupling to the neighboring direction remains. This coupling is nilpotent: after applying it enough times, it disappears.

Therefore a Jordan blockジョルダンブロック is not fully diagonal, but its structure is still explicit: eigenvalue固有値こゆうち plus nilpotent drift along a chain.

5Precise explanation

5.11. Standard form

Over an algebraically closed field such as C, every square matrix正方行列せいほうぎょうれつ A has a Jordan normal formジョルダン標準形ひょうじゅんけい: there exists an invertible可逆かぎゃく matrix P such that

P-1AP=J,

where J is a block diagonal matrix whose blocks are Jordan blocks.

More explicitly,

P-1AP=diag(Jk1(λ1),,Jks(λs)).

The form is unique up to reordering of the blocks.

5.22. Relation with diagonalization

If every Jordan blockジョルダンブロック has size 1, then the Jordan form is diagonal. Thus

[PARSE ERROR: Undefined("Command(\"boxed\")")]AisdiagonalizableallJordanblockshavesize1.

5.33. Relation with the minimal polynomial最小多項式さいしょうたこうしき

If sλ is the largest Jordan blockジョルダンブロック size for eigenvalue固有値こゆうち λ, then the minimal polynomial最小多項式さいしょうたこうしき contains the factor

(t-λ)sλ.

Thus the exponent in the minimal polynomial最小多項式さいしょうたこうしき measures the obstruction to diagonalization.

5.44. Jordan chains

A Jordan blockジョルダンブロック corresponds to a chain of generalized eigenvectors一般化いっぱんか固有こゆうベクトル:

(A-λI)v1=0,(A-λI)v2=v1,,(A-λI)vk=vk-1.

Here v1 is an eigenvector固有こゆうベクトル, and v2,,vk are generalized eigenvectors一般化いっぱんか固有こゆうベクトル. Using such chains as a basis基底きてい produces Jordan blocks in the matrix representation.

5.55. Generalized eigenspaces and block sizes

The generalized eigenspace一般化固有空間いっぱんかこゆうくうかん for λ is

Gλ=ker(A-λI)N

for sufficiently large N; in finite dimension one may take N=n. This space collects all Jordan blocks for λ.

The dimension of

ker(A-λI)

is the number of Jordan blocks for λ. The sequence of dimensions of

ker(A-λI)r

records how chains grow and determines the block sizes.

6Concrete examples

For

A=(1101),

we have A=J2(1). The only eigenvalue固有値こゆうち is 1, and

ker(A-I)=span{(10)},

so there is only one eigenvector固有こゆうベクトル direction. But

(A-I)2=0.

With v1=e1 and v2=e2,

(A-I)v1=0,(A-I)v2=v1.

Thus v1,v2 form a Jordan chain of length 2.

For a 3 by 3 block,

J=(210021002)=2I+N.

Here

N2=(001000000),N3=0.

Therefore

(J-2I)3=0,(J-2I)20,

and the minimal polynomial最小多項式さいしょうたこうしき is

mJ(t)=(t-2)3.

7How to read AM, GM, and blocks

For an eigenvalue固有値こゆうち λ:

  • The algebraic multiplicity代数的重複度だいすうてきちょうふくど is the sum of the sizes of all Jordan blocks for λ.
  • The geometric multiplicity幾何的重複度きかてきちょうふくど is the number of Jordan blocks for λ.
  • The exponent of (t-λ) in the minimal polynomial最小多項式さいしょうたこうしき is the largest block size for λ.

Thus AM equals GM exactly when all blocks for that eigenvalue固有値こゆうち have size 1.

8Numerical warning

Jordan normal formジョルダン標準形ひょうじゅんけい is extremely useful for theoretical classification, but it is numerically unstable. Small perturbations can split or merge apparent Jordan behavior. In practical computation, Schur decomposition or SVD is often preferred.

data/lecture/math/linear-algebra/introduction-to-singular-value-decomposition.lecture.n.md

9Criteria

  • When eigenvectors固有こゆうベクトル are insufficient, introduce generalized eigenvectors一般化いっぱんか固有こゆうベクトル.
  • A matrix is diagonalizable exactly when all Jordan blocks have size 1.
  • The largest block size is the exponent in the minimal polynomial最小多項式さいしょうたこうしき.
  • Jordan normal formジョルダン標準形ひょうじゅんけい is unique up to block order.
  • The result is naturally stated over a field where the characteristic polynomial特性多項式とくせいたこうしき splits.

10Scope and limitations

Jordan normal formジョルダン標準形ひょうじゅんけい is stated over fields where the characteristic polynomial特性多項式とくせいたこうしき splits into linear factors. Over the real numbers, complex eigenvalues固有値こゆうち may be missing, so one often extends to C.

11Precise form of the existence theorem

Over an algebraically closed field, for example C, every square matrix正方行列せいほうぎょうれつ A has a Jordan normal formジョルダン標準形ひょうじゅんけい. That is, there exists an invertible matrix可逆行列かぎゃくぎょうれつ P such that

P-1AP=diag(Jk1(λ1),[PARSE ERROR: Undefined("Command(\"dots\")")],Jks(λs)).

This form is unique up to the order of the blocks. The theorem says that even a non-diagonalizable matrix still has a standard form. Over the real numbers alone, complex eigenvalues固有値こゆうち may be missing, so the usual setting is C.

12Final forms

[PARSE ERROR: Undefined("Command(\"boxed\")")]P-1AP=J
[PARSE ERROR: Undefined("Command(\"boxed\")")]Jk(λ)=λI+N,Nk=0
[PARSE ERROR: Undefined("Command(\"boxed\")")]diagonalizableallJordanblockshavesize1
[PARSE ERROR: Undefined("Command(\"boxed\")")](A-λI)vj=vj-1definesaJordanchain

13Generalized eigenspaces and block sizes

The generalized eigenspace一般化固有空間いっぱんかこゆうくうかん for an eigenvalue固有値こゆうち λ is

Gλ=ker(A-λI)N,

where N is sufficiently large; in finite dimension one may take N=n. The space Gλ collects all Jordan blocks for λ.

The dimension

dimker(A-λI)

is the number of Jordan blocks for λ. The dimensions of

ker(A-λI)r

measure how chains of length up to r accumulate, and this growth recovers the block sizes.

14In one sentence

Jordan normal formジョルダン標準形ひょうじゅんけい decomposes a non-diagonalizable matrix into eigenvalue固有値こゆうち parts and nilpotent parts.

15Calculation example: a 3 by 3 Jordan block

Let

J=(210021002)=2I+N,N=(010001000).

Then

N2=(001000000),N3=0.

Thus

(J-2I)3=0,(J-2I)20,

so the minimal polynomial最小多項式さいしょうたこうしき is

mJ(t)=(t-2)3.

The only eigenvalue固有値こゆうち is 2, but the nilpotent part has length 3, so the structure is far from diagonalizable.

16Exercise link

data/exercise/math/linear-algebra/eigenvalues-diagonalization-and-extensions.exercise.n.md

17How to read AM, GM, and blocks

For an eigenvalue固有値こゆうち λ:

  • The algebraic multiplicity代数的重複度だいすうてきちょうふくど is the sum of the sizes of all Jordan blocks for λ.
  • The geometric multiplicity幾何的重複度きかてきちょうふくど is the number of Jordan blocks for λ.
  • The exponent of (t-λ) in the minimal polynomial最小多項式さいしょうたこうしき is the largest block size for λ.

Thus AM equals GM exactly when all blocks for that eigenvalue固有値こゆうち have size 1, meaning that the corresponding part is diagonalizable.

18Warning: theory versus numerical computation

Jordan normal formジョルダン標準形ひょうじゅんけい is powerful for theoretical classification. However, for matrices with close eigenvalues固有値こゆうち or small perturbations, Jordan block sizes can change unstably. Practical numerical computation often prefers Schur decomposition or SVD.

data/lecture/math/linear-algebra/introduction-to-singular-value-decomposition.lecture.n.md

19Final forms

[PARSE ERROR: Undefined("Command(\"boxed\")")]P-1AP=J
[PARSE ERROR: Undefined("Command(\"boxed\")")]Jk(λ)=λI+N,Nk=0
[PARSE ERROR: Undefined("Command(\"boxed\")")]diagonalizableallJordanblockshavesize1
[PARSE ERROR: Undefined("Command(\"boxed\")")](A-λI)vj=vj-1definesaJordanchain

20In one sentence

  • Jordan normal formジョルダン標準形ひょうじゅんけい describes a non-diagonalizable matrix行列ぎょうれつ by decomposing it into eigenvalue固有値こゆうち parts and nilpotent parts.

21Exercise link

data/exercise/math/linear-algebra/eigenvalues-diagonalization-and-extensions.exercise.n.md

22Related links

data/lecture/math/linear-algebra/diagonalization-basics.lecture.n.md data/lecture/math/linear-algebra/minimal-polynomial-basics.lecture.n.md data/lecture/math/linear-algebra/eigenvalues-and-eigenvectors.lecture.n.md
raw .n.md をコピー
loc をコピー (filepath:line ~ line)
copy share link
copy encoded share link
path をコピー
copy share link
copy encoded share link
copy share link
copy encoded share link
タブを全て閉じる