Jordan normal form

An example of a matrix in Jordan normal form. The grey blocks are called Jordan blocks.

In linear algebra, a Jordan normal form (often called Jordan canonical form)^[1] of a linear operator on a finite-dimensional vector space is an upper triangular matrix of a particular form called a Jordan matrix, representing the operator with respect to some basis. Such a matrix has each non-zero off-diagonal entry equal to 1, immediately above the main diagonal (on the superdiagonal), and with identical diagonal entries to the left and below them.

If the vector space is over a field K, then a basis with respect to which the matrix has the required form exists if and only if all eigenvalues of the matrix lie in K, or equivalently if the characteristic polynomial of the operator splits into linear factors over K. This condition is always satisfied if K is algebraically closed (for instance, if it is the field of complex numbers). The diagonal entries of the normal form are the eigenvalues (of the operator), and the number of times each eigenvalue occurs is called the algebraic multiplicity of the eigenvalue.^[2]^[3]^[4]

If the operator is originally given by a square matrix M, then its Jordan normal form is also called the Jordan normal form of M. Any square matrix has a Jordan normal form if the field of coefficients is extended to one containing all the eigenvalues of the matrix. In spite of its name, the normal form for a given M is not entirely unique, as it is a block diagonal matrix formed of Jordan blocks, the order of which is not fixed; it is conventional to group blocks for the same eigenvalue together, but no ordering is imposed among the eigenvalues, nor among the blocks for a given eigenvalue, although the latter could for instance be ordered by weakly decreasing size.^[2]^[3]^[4]

The Jordan–Chevalley decomposition is particularly simple with respect to a basis for which the operator takes its Jordan normal form. The diagonal form for diagonalizable matrices, for instance normal matrices, is a special case of the Jordan normal form.^[5]^[6]^[7]

The Jordan normal form is named after Camille Jordan.

Overview

Notation

Some textbooks have the ones on the subdiagonal, i.e., immediately below the main diagonal instead of on the superdiagonal. The eigenvalues are still on the main diagonal.^[8]^[9]

Motivation

An n × n matrix A is diagonalizable if and only if the sum of the dimensions of the eigenspaces is n. Or, equivalently, if and only if A has n linearly independent eigenvectors. Not all matrices are diagonalizable. Consider the following matrix:

$A=\left[\!\!\!{\begin{array}{*{20}{r}}5&4&2&1\\[2pt]0&1&-1&-1\\[2pt]-1&-1&3&0\\[2pt]1&1&-1&2\end{array}}\!\!\right].$

Including multiplicity, the eigenvalues of A are λ = 1, 2, 4, 4. The dimension of the eigenspace corresponding to the eigenvalue 4 is 1 (and not 2), so A is not diagonalizable. However, there is an invertible matrix P such that A = PJP⁻¹, where

J = \begin{bmatrix} 1 & 0 & 0 & 0 \\[2pt] 0 & 2 & 0 & 0 \\[2pt] 0 & 0 & 4 & 1 \\[2pt] 0 & 0 & 0 & 4 \end{bmatrix}.

The matrix J is almost diagonal. This is the Jordan normal form of A. The section Example below fills in the details of the computation.

Complex matrices

In general, a square complex matrix A is similar to a block diagonal matrix

J = \begin{bmatrix} J_1 & \; & \; \\ \; & \ddots & \; \\ \; & \; & J_p\end{bmatrix}

where each block J_i is a square matrix of the form

J_i = \begin{bmatrix} \lambda_i & 1 & \; & \; \\ \; & \lambda_i & \ddots & \; \\ \; & \; & \ddots & 1 \\ \; & \; & \; & \lambda_i \end{bmatrix}.

So there exists an invertible matrix P such that P⁻¹AP = J is such that the only non-zero entries of J are on the diagonal and the superdiagonal. J is called the Jordan normal form of A. Each J_i is called a Jordan block of A. In a given Jordan block, every entry on the superdiagonal is 1.

Assuming this result, we can deduce the following properties:

Counting multiplicity, the eigenvalues of J, therefore A, are the diagonal entries.
Given an eigenvalue λ_i, its geometric multiplicity is the dimension of Ker(A − λ_iI), and it is the number of Jordan blocks corresponding to λ_i.^[10]
The sum of the sizes of all Jordan blocks corresponding to an eigenvalue λ_i is its algebraic multiplicity.^[10]
A is diagonalizable if and only if, for every eigenvalue λ of A, its geometric and algebraic multiplicities coincide.
The Jordan block corresponding to λ is of the form λ I + N, where N is a nilpotent matrix defined as N_ij = δ_i,j−1 (where δ is the Kronecker delta). The nilpotency of N can be exploited when calculating f(A) where f is a complex analytic function. For example, in principle the Jordan form could give a closed-form expression for the exponential exp(A).
The number of Jordan blocks corresponding to λ of size at least j is dim Ker(A - λI)^j - dim Ker(A - λI)^j-1. Thus, the number of Jordan blocks of size exactly j is

2 \dim \ker (A - \lambda_i I)^j - \dim \ker (A - \lambda_i I)^{j+1} - \dim \ker (A - \lambda_i I)^{j-1}

Given an eigenvalue λ_i, its multiplicity in the minimal polynomial is the size of its largest Jordan block.

Generalized eigenvectors

Main article: Generalized eigenvector

Consider the matrix A from the example in the previous section. The Jordan normal form is obtained by some similarity transformation P⁻¹AP = J, i.e.

\; AP = PJ.

Let P have column vectors p_i, i = 1, ..., 4, then

A \begin{bmatrix} p_1 & p_2 & p_3 & p_4 \end{bmatrix} = \begin{bmatrix} p_1 & p_2 & p_3 & p_4 \end{bmatrix} \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 2 & 0 & 0 \\ 0 & 0 & 4 & 1 \\ 0 & 0 & 0 & 4 \end{bmatrix} = \begin{bmatrix} p_1 & 2p_2 & 4p_3 & p_3+4p_4 \end{bmatrix}.

We see that

\; (A - 1 I) p_1 = 0

\; (A - 2 I) p_2 = 0

\; (A - 4 I) p_3 = 0

\; (A - 4 I) p_4 = p_3.

For i = 1,2,3 we have $p_i \in \operatorname{Ker}(A-\lambda_{i} I)$ , i.e. p_i is an eigenvector of A corresponding to the eigenvalue λ_i. For i=4, multiplying both sides by $(A-4I)$ gives

\; (A-4I)^2 p_4 = (A-4I) p_3.

But $(A-4I)p_3 = 0$ , so

\; (A-4I)^2 p_4 = 0.

Thus, $p_4 \in \operatorname{Ker}(A-4 I)^2.$

Vectors such as $p_4$ are called generalized eigenvectors of A.

Thus, given an eigenvalue λ, its corresponding Jordan block gives rise to a Jordan chain. The generator, or lead vector, say p_r, of the chain is a generalized eigenvector such that (A − λ I)^rp_r = 0, where r is the size of the Jordan block. The vector p₁ = (A − λ I)^r−1p_r is an eigenvector corresponding to λ. In general, p_i is a preimage of p_i−1 under A − λ I. So the lead vector generates the chain via multiplication by (A − λ I).^[11]^[12]

Therefore, the statement that every square matrix A can be put in Jordan normal form is equivalent to the claim that there exists a basis consisting only of eigenvectors and generalized eigenvectors of A.

A proof

We give a proof by induction. The 1 × 1 case is trivial. Let A be an n × n matrix. Take any eigenvalue λ of A. The range of A − λ I, denoted by Ran(A − λ I), is an invariant subspace of A. Also, since λ is an eigenvalue of A, the dimension Ran(A − λ I), r, is strictly less than n. Let A' denote the restriction of A to Ran(A − λ I), By inductive hypothesis, there exists a basis {p₁, ..., p_r} such that A' , expressed with respect to this basis, is in Jordan normal form.

Next consider the subspace Ker(A − λ I). If

\mathrm{Ran}(A - \lambda I) \cap \mathrm{Ker}(A - \lambda I) = \{0\},

the desired result follows immediately from the rank–nullity theorem. This would be the case, for example, if A was Hermitian.

Otherwise, if

Q = \mathrm{Ran}(A - \lambda I) \cap \mathrm{Ker}(A - \lambda I) \neq \{0\},

let the dimension of Q be s ≤ r. Each vector in Q is an eigenvector of A' corresponding to eigenvalue λ. So the Jordan form of A' must contain s Jordan chains corresponding to s linearly independent eigenvectors. So the basis {p₁, ..., p_r} must contain s vectors, say {p_r−s+1, ..., p_r}, that are lead vectors in these Jordan chains from the Jordan normal form of A'. We can "extend the chains" by taking the preimages of these lead vectors. (This is the key step of argument; in general, generalized eigenvectors need not lie in Ran(A − λ I).) Let q_i be such that

\; (A - \lambda I) q_i = p_i \mbox{ for } i = r-s+1, \ldots, r.

Clearly no non-trivial linear combination of the q_i can lie in Ker(A − λ I). Furthermore, no non-trivial linear combination of the q_i can be in Ran(A − λ I), for that would contradict the assumption that each p_i is a lead vector in a Jordan chain. The set {q_i}, being preimages of the linearly independent set {p_i} under A − λ I, is also linearly independent.

Finally, we can pick any linearly independent set {z₁, ..., z_t} that spans

\; \mathrm{Ker}(A - \lambda I) / Q.

By construction, the union of the three sets {p₁, ..., p_r}, {q_{r−s +1}, ..., q_r}, and {z₁, ..., z_t} is linearly independent. Each vector in the union is either an eigenvector or a generalized eigenvector of A. Finally, by rank–nullity theorem, the cardinality of the union is n. In other words, we have found a basis that consists of eigenvectors and generalized eigenvectors of A, and this shows A can be put in Jordan normal form.

Uniqueness

It can be shown that the Jordan normal form of a given matrix A is unique up to the order of the Jordan blocks.

Knowing the algebraic and geometric multiplicities of the eigenvalues is not sufficient to determine the Jordan normal form of A. Assuming the algebraic multiplicity m(λ) of an eigenvalue λ is known, the structure of the Jordan form can be ascertained by analyzing the ranks of the powers (A − λ I)^m(λ). To see this, suppose an n × n matrix A has only one eigenvalue λ. So m(λ) = n. The smallest integer k₁ such that

(A - \lambda I)^{k_1} = 0

is the size of the largest Jordan block in the Jordan form of A. (This number k₁ is also called the index of λ. See discussion in a following section.) The rank of

(A - \lambda I)^{k_1 - 1}

is the number of Jordan blocks of size k₁. Similarly, the rank of

(A - \lambda I)^{k_1 - 2}

is twice the number of Jordan blocks of size k₁ plus the number of Jordan blocks of size k₁−1. The general case is similar.

This can be used to show the uniqueness of the Jordan form. Let J₁ and J₂ be two Jordan normal forms of A. Then J₁ and J₂ are similar and have the same spectrum, including algebraic multiplicities of the eigenvalues. The procedure outlined in the previous paragraph can be used to determine the structure of these matrices. Since the rank of a matrix is preserved by similarity transformation, there is a bijection between the Jordan blocks of J₁ and J₂. This proves the uniqueness part of the statement.

Real matrices

If A is a real matrix, its Jordan form can still be non-real, however there exists a real invertible matrix P such that P⁻¹AP = J is a real block diagonal matrix with each block being a real Jordan block. A real Jordan block is either identical to a complex Jordan block (if the corresponding eigenvalue $\lambda _{i}$ is real), or is a block matrix itself, consisting of 2×2 blocks as follows (for non-real eigenvalue $\lambda_i = a_i+ib_i$ ). The diagonal blocks are identical, of the form

C_i = \begin{bmatrix} a_i & b_i \\ -b_i & a_i \\ \end{bmatrix}

and describe multiplication by $\lambda _{i}$ in the complex plane. The superdiagonal blocks are 2×2 identity matrices. The full real Jordan block is given by

J_i = \begin{bmatrix} C_i & I & \; & \; \\ \; & C_i & \ddots & \; \\ \; & \; & \ddots & I \\ \; & \; & \; & C_i \\ \end{bmatrix}.

This real Jordan form is a consequence of the complex Jordan form. For a real matrix the nonreal eigenvectors and generalized eigenvectors can always be chosen to form complex conjugate pairs. Taking the real and imaginary part (linear combination of the vector and its conjugate), the matrix has this form with respect to the new basis.

Consequences

One can see that the Jordan normal form is essentially a classification result for square matrices, and as such several important results from linear algebra can be viewed as its consequences.

Spectral mapping theorem

Using the Jordan normal form, direct calculation gives a spectral mapping theorem for the polynomial functional calculus: Let A be an n × n matrix with eigenvalues λ₁, ..., λ_n, then for any polynomial p, p(A) has eigenvalues p(λ₁), ..., p(λ_n).

Cayley–Hamilton theorem

The Cayley–Hamilton theorem asserts that every matrix A satisfies its characteristic equation: if $p$ is the characteristic polynomial of $A$ , then $p (A) = 0$ . This can be shown via direct calculation in the Jordan form, since any Jordan block for $λ$ is annihilated by $(X - λ) m$ where $m$ is the multiplicity of the root $λ$ of $p$ , the sum of the sizes of the Jordan blocks for $λ$ , and therefore no less than the size of the block in question. The Jordan form can be assumed to exist over a field extending the base field of the matrix, for instance over the splitting field of $p$ ; this field extension does not change the matrix $p (A)$ in any way.

Minimal polynomial

The minimal polynomial P of a square matrix A is the unique monic polynomial of least degree, m, such that P(A) = 0. Alternatively, the set of polynomials that annihilate a given A form an ideal I in C[x], the principal ideal domain of polynomials with complex coefficients. The monic element that generates I is precisely P.

Let λ₁, ..., λ_q be the distinct eigenvalues of A, and s_i be the size of the largest Jordan block corresponding to λ_i. It is clear from the Jordan normal form that the minimal polynomial of A has degree $Σ$ s_i.

While the Jordan normal form determines the minimal polynomial, the converse is not true. This leads to the notion of elementary divisors. The elementary divisors of a square matrix A are the characteristic polynomials of its Jordan blocks. The factors of the minimal polynomial m are the elementary divisors of the largest degree corresponding to distinct eigenvalues.

The degree of an elementary divisor is the size of the corresponding Jordan block, therefore the dimension of the corresponding invariant subspace. If all elementary divisors are linear, A is diagonalizable.

Invariant subspace decompositions

The Jordan form of a n × n matrix A is block diagonal, and therefore gives a decomposition of the n dimensional Euclidean space into invariant subspaces of A. Every Jordan block J_i corresponds to an invariant subspace X_i. Symbolically, we put

\mathbb{C}^n = \bigoplus_{i = 1}^k X_i

where each X_i is the span of the corresponding Jordan chain, and k is the number of Jordan chains.

One can also obtain a slightly different decomposition via the Jordan form. Given an eigenvalue λ_i, the size of its largest corresponding Jordan block s_i is called the index of λ_i and denoted by ν(λ_i). (Therefore the degree of the minimal polynomial is the sum of all indices.) Define a subspace Y_i by

\; Y_i = \operatorname{Ker} (\lambda_i I - A)^{\nu(\lambda_i)}.

This gives the decomposition

\mathbb{C}^n = \bigoplus_{i = 1}^l Y_i

where l is the number of distinct eigenvalues of A. Intuitively, we glob together the Jordan block invariant subspaces corresponding to the same eigenvalue. In the extreme case where A is a multiple of the identity matrix we have k = n and l = 1.

The projection onto Y_i and along all the other Y_j ( j ≠ i ) is called the spectral projection of A at λ_i and is usually denoted by P(λ_i ; A). Spectral projections are mutually orthogonal in the sense that P(λ_i ; A) P(λ_j ; A) = 0 if i ≠ j. Also they commute with A and their sum is the identity matrix. Replacing every λ_i in the Jordan matrix J by one and zeroising all other entries gives P(λ_i ; J), moreover if U J U⁻¹ is the similarity transformation such that A = U J U⁻¹ then P(λ_i ; A) = U P(λ_i ; J) U⁻¹. They are not confined to finite dimensions. See below for their application to compact operators, and in holomorphic functional calculus for a more general discussion.

Comparing the two decompositions, notice that, in general, l ≤ k. When A is normal, the subspaces X_i's in the first decomposition are one-dimensional and mutually orthogonal. This is the spectral theorem for normal operators. The second decomposition generalizes more easily for general compact operators on Banach spaces.

It might be of interest here to note some properties of the index, ν(λ). More generally, for a complex number λ, its index can be defined as the least non-negative integer ν(λ) such that

\mathrm{Ker}(\lambda - A)^{\nu(\lambda)} = \operatorname{Ker} (\lambda - A)^m, \; \forall m \geq \nu(\lambda) .

So ν(λ) > 0 if and only if λ is an eigenvalue of A. In the finite-dimensional case, ν(λ) ≤ the algebraic multiplicity of λ.

Generalizations

Matrices with entries in a field

Jordan reduction can be extended to any square matrix M whose entries lie in a field K. The result states that any M can be written as a sum D + N where D is semisimple, N is nilpotent, and DN = ND. This is called the Jordan–Chevalley decomposition. Whenever K contains the eigenvalues of M, in particular when K is algebraically closed, the normal form can be expressed explicitly as the direct sum of Jordan blocks.

Similar to the case when K is the complex numbers, knowing the dimensions of the kernels of (M − λI)^k for 1 ≤ k ≤ m, where m is the algebraic multiplicity of the eigenvalue λ, allows one to determine the Jordan form of M. We may view the underlying vector space V as a K[x]-module by regarding the action of x on V as application of M and extending by K-linearity. Then the polynomials (x − λ)^k are the elementary divisors of M, and the Jordan normal form is concerned with representing M in terms of blocks associated to the elementary divisors.

The proof of the Jordan normal form is usually carried out as an application to the ring K[x] of the structure theorem for finitely generated modules over a principal ideal domain, of which it is a corollary.

Compact operators

In a different direction, for compact operators on a Banach space, a result analogous to the Jordan normal form holds. One restricts to compact operators because every point x in the spectrum of a compact operator T, the only exception being when x is the limit point of the spectrum, is an eigenvalue. This is not true for bounded operators in general. To give some idea of this generalization, we first reformulate the Jordan decomposition in the language of functional analysis.

Holomorphic functional calculus

For more details on this topic, see holomorphic functional calculus.

Let X be a Banach space, L(X) be the bounded operators on X, and σ(T) denote the spectrum of T ∈ L(X). The holomorphic functional calculus is defined as follows:

Fix a bounded operator T. Consider the family Hol(T) of complex functions that is holomorphic on some open set G containing σ(T). Let Γ = {γ_i} be a finite collection of Jordan curves such that σ(T) lies in the inside of Γ, we define f(T) by

f(T) = \frac{1}{2 \pi i} \int_{\Gamma} f(z)(z - T)^{-1} dz.

The open set G could vary with f and need not be connected. The integral is defined as the limit of the Riemann sums, as in the scalar case. Although the integral makes sense for continuous f, we restrict to holomorphic functions to apply the machinery from classical function theory (e.g. the Cauchy integral formula). The assumption that σ(T) lie in the inside of Γ ensures f(T) is well defined; it does not depend on the choice of Γ. The functional calculus is the mapping Φ from Hol(T) to L(X) given by

\; \Phi(f) = f(T).

We will require the following properties of this functional calculus:

Φ extends the polynomial functional calculus.
The spectral mapping theorem holds: σ(f(T)) = f(σ(T)).
Φ is an algebra homomorphism.

The finite-dimensional case

In the finite-dimensional case, σ(T) = {λ_i} is a finite discrete set in the complex plane. Let e_i be the function that is 1 in some open neighborhood of λ_i and 0 elsewhere. By property 3 of the functional calculus, the operator

\; e_i(T)

is a projection. Moreoever, let ν_i be the index of λ_i and

f(z)= (z - \lambda_i)^{\nu_i}.

The spectral mapping theorem tells us

f(T) e_i (T) = (T - \lambda_i)^{\nu_i} e_i (T)

has spectrum {0}. By property 1, f(T) can be directly computed in the Jordan form, and by inspection, we see that the operator f(T)e_i(T) is the zero matrix.

By property 3, f(T) e_i(T) = e_i(T) f(T). So e_i(T) is precisely the projection onto the subspace

\mathrm{Ran} \; e_i (T) = \mathrm{Ker}(T - \lambda_i)^{\nu_i}.

The relation

\; \sum_i e_i = 1

implies

\mathbb{C}^n = \bigoplus_i \; \mathrm{Ran}\; e_i (T) = \bigoplus_i \; \mathrm{Ker}(T - \lambda_i)^{\nu_i}

where the index i runs through the distinct eigenvalues of T. This is exactly the invariant subspace decomposition

\mathbb{C}^n = \bigoplus_i Y_i

given in a previous section. Each e_i(T) is the projection onto the subspace spanned by the Jordan chains corresponding to λ_i and along the subspaces spanned by the Jordan chains corresponding to λ_j for j ≠ i. In other words e_i(T) = P(λ_i;T). This explicit identification of the operators e_i(T) in turn gives an explicit form of holomorphic functional calculus for matrices:

For all f ∈ Hol(T),

f(T) = \sum_{\lambda_i \in \sigma(T)} \sum_{k = 0}^{\nu_i -1} \frac{f^{(k)}}{k!} (T - \lambda_i)^k e_i (T).

Notice that the expression of f(T) is a finite sum because, on each neighborhood of λ_i, we have chosen the Taylor series expansion of f centered at λ_i.

Poles of an operator

Let T be a bounded operator λ be an isolated point of σ(T). (As stated above, when T is compact, every point in its spectrum is an isolated point, except possibly the limit point 0.)

The point λ is called a pole of operator T with order ν if the resolvent function R_T defined by

\; R_T(\lambda) = (\lambda - T)^{-1}

has a pole of order ν at λ.

We will show that, in the finite-dimensional case, the order of an eigenvalue coincides with its index. The result also holds for compact operators.

Consider the annular region A centered at the eigenvalue λ with sufficiently small radius ε such that the intersection of the open disc B_ε(λ) and σ(T) is {λ}. The resolvent function R_T is holomorphic on A. Extending a result from classical function theory, R_T has a Laurent series representation on A:

R_T(z) = \sum _{- \infty} ^{\infty} a_m (\lambda - z)^m

where

a_{-m} = - \frac{1}{2 \pi i} \int_C (\lambda - z) ^{m-1} (z - T)^{-1} d z

and C is a small circle centered at λ.

By the previous discussion on the functional calculus,

\; a_{-m} = -(\lambda - T)^{m-1} e_{\lambda} (T)

where

\; e_{\lambda}

is 1 on

\; B_{\epsilon}(\lambda)

and 0 elsewhere.

But we have shown that the smallest positive integer m such that

a_{-m} \neq 0

and

a_{-l} = 0 \; \; \forall \; l \geq m

is precisely the index of λ, ν(λ). In other words, the function R_T has a pole of order ν(λ) at λ.

Example

This example shows how to calculate the Jordan normal form of a given matrix. As the next section explains, it is important to do the computation exactly instead of rounding the results.

Consider the matrix

A = \begin{bmatrix} 5 & 4 & 2 & 1 \\ 0 & 1 & -1 & -1 \\ -1 & -1 & 3 & 0 \\ 1 & 1 & -1 & 2 \end{bmatrix}

which is mentioned in the beginning of the article.

The characteristic polynomial of A is

\chi(\lambda) = \det(\lambda I - A) = \lambda^4 - 11 \lambda^3 + 42 \lambda^2 - 64 \lambda + 32 = (\lambda-1)(\lambda-2)(\lambda-4)^2. \,

This shows that the eigenvalues are 1, 2, 4 and 4, according to algebraic multiplicity. The eigenspace corresponding to the eigenvalue 1 can be found by solving the equation Av = λ v. It is spanned by the column vector v = (−1, 1, 0, 0)^T. Similarly, the eigenspace corresponding to the eigenvalue 2 is spanned by w = (1, −1, 0, 1)^T. Finally, the eigenspace corresponding to the eigenvalue 4 is also one-dimensional (even though this is a double eigenvalue) and is spanned by x = (1, 0, −1, 1)^T. So, the geometric multiplicity (i.e., the dimension of the eigenspace of the given eigenvalue) of each of the three eigenvalues is one. Therefore, the two eigenvalues equal to 4 correspond to a single Jordan block, and the Jordan normal form of the matrix A is the direct sum

J = J_1(1) \oplus J_1(2) \oplus J_2(4) = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 2 & 0 & 0 \\ 0 & 0 & 4 & 1 \\ 0 & 0 & 0 & 4 \end{bmatrix}.

There are three chains. Two have length one: {v} and {w}, corresponding to the eigenvalues 1 and 2, respectively. There is one chain of length two corresponding to the eigenvalue 4. To find this chain, calculate

\ker {(A-4I)}^{2}=\operatorname {span} \,\left\{{\begin{bmatrix}1\\0\\0\\0\end{bmatrix}},{\begin{bmatrix}1\\0\\-1\\1\end{bmatrix}}\right\}

where I is the 4 x 4 identity matrix. Pick a vector in the above span that is not in the kernel of A − 4I, e.g., y = (1,0,0,0)^T. Now, (A − 4I)y = x and (A − 4I)x = 0, so {y, x} is a chain of length two corresponding to the eigenvalue 4.

The transition matrix P such that P⁻¹AP = J is formed by putting these vectors next to each other as follows

P = \Big[ \,v\, \Big| \,w\, \Big| \,x\, \Big| \,y\, \Big] = \begin{bmatrix} -1 & 1 & 1 & 1 \\ 1 & -1 & 0 & 0 \\ 0 & 0 & -1 & 0 \\ 0 & 1 & 1 & 0 \end{bmatrix}.

A computation shows that the equation P⁻¹AP = J indeed holds.

P^{-1}AP=J=\begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 2 & 0 & 0 \\ 0 & 0 & 4 & 1 \\ 0 & 0 & 0 & 4 \end{bmatrix}.

If we had interchanged the order of which the chain vectors appeared, that is, changing the order of v, w and {x, y} together, the Jordan blocks would be interchanged. However, the Jordan forms are equivalent Jordan forms.

Numerical analysis

If the matrix A has multiple eigenvalues, or is close to a matrix with multiple eigenvalues, then its Jordan normal form is very sensitive to perturbations. Consider for instance the matrix

A = \begin{bmatrix} 1 & 1 \\ \varepsilon & 1 \end{bmatrix}.

If ε = 0, then the Jordan normal form is simply

\begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix}.

However, for ε ≠ 0, the Jordan normal form is

\begin{bmatrix} 1+\sqrt\varepsilon & 0 \\ 0 & 1-\sqrt\varepsilon \end{bmatrix}.

This ill conditioning makes it very hard to develop a robust numerical algorithm for the Jordan normal form, as the result depends critically on whether two eigenvalues are deemed to be equal. For this reason, the Jordan normal form is usually avoided in numerical analysis; the stable Schur decomposition^[13] or pseudospectra^[14] are better alternatives.

Matrix functions

Main article: Matrix function

The Jordan normal form is the most convenient for computation of the matrix functions (though it may be not the best choice for computer computations). Let f(z) be an analytical function of a complex argument. Applying the function on a n×n Jordan block J with eigenvalue λ results in an upper triangular matrix:

f(J)={\begin{bmatrix}f(\lambda )&f'(\lambda )&{\tfrac {f''(\lambda )}{2}}&...&{\tfrac {f^{(n-1)}(\lambda )}{(n-1)!}}\\0&f(\lambda )&f'(\lambda )&...&{\tfrac {f^{(n-2)}(\lambda )}{(n-2)!}}\\\vdots &\vdots &\ddots &\ddots &\vdots \\0&0&0&f(\lambda )&f'(\lambda )\\0&0&0&0&f(\lambda )\end{bmatrix}},

so that the elements of the k-th superdiagonal of the resulting matrix are ${\tfrac {f^{(k)}(\lambda )}{k!}}$ . For a matrix of general Jordan normal form the above expression shall be applied to each Jordan block.

The following example shows the application to the power function f(z)=zⁿ:

{\begin{bmatrix}\lambda _{1}&1&0&0&0\\0&\lambda _{1}&1&0&0\\0&0&\lambda _{1}&0&0\\0&0&0&\lambda _{2}&1\\0&0&0&0&\lambda _{2}\end{bmatrix}}^{n}={\begin{bmatrix}\lambda _{1}^{n}&{\tbinom {n}{1}}\lambda _{1}^{n-1}&{\tbinom {n}{2}}\lambda _{1}^{n-2}&0&0\\0&\lambda _{1}^{n}&{\tbinom {n}{1}}\lambda _{1}^{n-1}&0&0\\0&0&\lambda _{1}^{n}&0&0\\0&0&0&\lambda _{2}^{n}&{\tbinom {n}{1}}\lambda _{2}^{n-1}\\0&0&0&0&\lambda _{2}^{n}\end{bmatrix}},

where the binomial coefficients are defined as ${\tbinom {n}{k}}=\prod _{i=1}^{k}{\tfrac {n+1-i}{i}}$ . For integer positive n it reduces to standard definition of the coefficients. For negative n the identity ${\tbinom {-n}{k}}=\left(-1\right)^{k}{\tbinom {n+k-1}{k}}$ may be of use.

Notes

↑ Shilov defines the term Jordan canonical form and in a footnote says that Jordan normal form is synonymous. These terms are sometimes shortened to Jordan form. (Shilov) The term Classical canonical form is also sometimes used in the sense of this article. (James & James, 1976)
1 2 Beauregard & Fraleigh (1973, pp. 310–316)
1 2 Golub & Van Loan (1996, p. 355)
1 2 Nering (1970, pp. 118–127)
↑ Beauregard & Fraleigh (1973, pp. 270–274)
↑ Golub & Van Loan (1996, p. 353)
↑ Nering (1970, pp. 113–118)
↑ Cullen (1966, p. 114)
↑ Franklin (1968, p. 122)
1 2 Horn & Johnson (1985, §3.2.1)
↑ Bronson (1970, pp. 189,194)
↑ Holt & Rumynin (2009, p. 9)
↑ See Golub & Van Loan (2014), §7.6.5; or Golub & Wilkinson (1976) for details.
↑ See Golub & Van Loan (2014), §7.9

References

Beauregard, Raymond A.; Fraleigh, John B. (1973), A First Course In Linear Algebra: with Optional Introduction to Groups, Rings, and Fields, Boston: Houghton Mifflin Co., ISBN 0-395-14017-X
Bronson, Richard (1970), Matrix Methods: An Introduction, New York: Academic Press, LCCN 70097490
Cullen, Charles G. (1966), Matrices and Linear Transformations, Reading: Addison-Wesley, LCCN 66021267
N. Dunford and J.T. Schwartz, Linear Operators, Part I: General Theory, Interscience, 1958.
Daniel T. Finkbeiner II, Introduction to Matrices and Linear Transformations, Third Edition, Freeman, 1978.
Franklin, Joel N. (1968), Matrix Theory, Englewood Cliffs: Prentice-Hall, LCCN 68016345
Gene H. Golub and Charles F. Van Loan, Matrix Computations (4th ed.), Johns Hopkins University Press, Baltimore, 2012.
Gene H. Golub and J. H. Wilkinson, Ill-conditioned eigensystems and the computation of the Jordan normal form, SIAM Review, vol. 18, nr. 4, pp. 578–619, 1976.
Holt, Derek; Rumynin, Dmitriy (2009), Algebra I – Advanced Linear Algebra (MA251) Lecture Notes (PDF)
Horn, Roger A.; Johnson, Charles R. (1985), Matrix Analysis, Cambridge University Press, ISBN 978-0-521-38632-6 .
Glenn James and Robert C. James, Mathematics Dictionary, Fourth Edition, Van Nostrand Reinhold, 1976.
Saunders MacLane and Garrett Birkhoff, Algebra, MacMillan, 1967.
Anthony N. Michel and Charles J. Herget, Applied Algebra and Functional Analysis, Dover, 1993.
Nering, Evar D. (1970), Linear Algebra and Matrix Theory (2nd ed.), New York: Wiley, LCCN 76091646
Georgi E. Shilov, Linear Algebra, Dover, 1977.
I. R. Shafarevich & A. O. Remizov (2012) Linear Algebra and Geometry, Springer ISBN 978-3-642-30993-9.
Jordan Canonical Form article at mathworld.wolfram.com

This article is issued from Wikipedia - version of the 6/29/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.