Jordan matrix

In the mathematical discipline of matrix theory, a Jordan matrix, named after Camille Jordan, is a block diagonal matrix over a ring R (whose identities are the zero 0 and one 1), where each block along the diagonal, called a Jordan block, has the following form:

$${\displaystyle {\begin{bmatrix}\lambda &1&0&\cdots &0\\0&\lambda &1&\cdots &0\\\vdots &\vdots &\vdots &\ddots &\vdots \\0&0&0&\lambda &1\\0&0&0&0&\lambda \end{bmatrix}}.}$$

Definition

Every Jordan block is specified by its dimension n and its eigenvalue ${\displaystyle \lambda \in R}$ , and is denoted as J_λ,n. It is an ${\displaystyle n\times n}$  matrix of zeroes everywhere except for the diagonal, which is filled with ${\displaystyle \lambda }$  and for the superdiagonal, which is composed of ones.

Any block diagonal matrix whose blocks are Jordan blocks is called a Jordan matrix. This (n₁ + ⋯ + n_r) × (n₁ + ⋯ + n_r) square matrix, consisting of r diagonal blocks, can be compactly indicated as ${\displaystyle J_{\lambda _{1},n_{1}}\oplus \cdots \oplus J_{\lambda _{r},n_{r}}}$  or ${\displaystyle \mathrm {diag} \left(J_{\lambda _{1},n_{1}},\ldots ,J_{\lambda _{r},n_{r}}\right)}$ , where the i-th Jordan block is J_λi,ni.

For example, the matrix

$${\displaystyle J=\left[{\begin{array}{ccc|cc|cc|ccc}0&1&0&0&0&0&0&0&0&0\\0&0&1&0&0&0&0&0&0&0\\0&0&0&0&0&0&0&0&0&0\\\hline 0&0&0&i&1&0&0&0&0&0\\0&0&0&0&i&0&0&0&0&0\\\hline 0&0&0&0&0&i&1&0&0&0\\0&0&0&0&0&0&i&0&0&0\\\hline 0&0&0&0&0&0&0&7&1&0\\0&0&0&0&0&0&0&0&7&1\\0&0&0&0&0&0&0&0&0&7\end{array}}\right]}$$

 

is a 10 × 10 Jordan matrix with a 3 × 3 block with eigenvalue 0, two 2 × 2 blocks with eigenvalue the imaginary unit i, and a 3 × 3 block with eigenvalue 7. Its Jordan-block structure is written as either ${\displaystyle J_{0,3}\oplus J_{i,2}\oplus J_{i,2}\oplus J_{7,3}}$  or diag(J_0,3, J_i,2, J_i,2, J_7,3).

Linear algebra

Any n × n square matrix A whose elements are in an algebraically closed field K is similar to a Jordan matrix J, also in ${\displaystyle \mathbb {M} _{n}(K)}$ , which is unique up to a permutation of its diagonal blocks themselves. J is called the Jordan normal form of A and corresponds to a generalization of the diagonalization procedure.^[1][2][3] A diagonalizable matrix is similar, in fact, to a special case of Jordan matrix: the matrix whose blocks are all 1 × 1.^[4][5][6]

More generally, given a Jordan matrix ${\displaystyle J=J_{\lambda _{1},m_{1}}\oplus J_{\lambda _{2},m_{2}}\oplus \cdots \oplus J_{\lambda _{N},m_{N}}}$ , that is, whose kth diagonal block, ${\displaystyle 1\leq k\leq N}$ , is the Jordan block J_λk,mk and whose diagonal elements ${\displaystyle \lambda _{k}}$  may not all be distinct, the geometric multiplicity of ${\displaystyle \lambda \in K}$  for the matrix J, indicated as ${\displaystyle \operatorname {gmul} _{J}\lambda }$ , corresponds to the number of Jordan blocks whose eigenvalue is λ. Whereas the index of an eigenvalue ${\displaystyle \lambda }$  for J, indicated as ${\displaystyle idx_{J}\lambda }$ , is defined as the dimension of the largest Jordan block associated to that eigenvalue.

The same goes for all the matrices A similar to J, so ${\displaystyle \operatorname {idx} _{A}\lambda }$  can be defined accordingly with respect to the Jordan normal form of A for any of its eigenvalues ${\displaystyle \lambda \in \operatorname {spec} A}$ . In this case one can check that the index of ${\displaystyle \lambda }$  for A is equal to its multiplicity as a root of the minimal polynomial of A (whereas, by definition, its algebraic multiplicity for A, ${\displaystyle \operatorname {mul} _{A}\lambda }$ , is its multiplicity as a root of the characteristic polynomial of A; that is, ${\displaystyle \det(A-xI)\in K[x]}$ ). An equivalent necessary and sufficient condition for A to be diagonalizable in K is that all of its eigenvalues have index equal to 1; that is, its minimal polynomial has only simple roots.

Note that knowing a matrix's spectrum with all of its algebraic/geometric multiplicities and indexes does not always allow for the computation of its Jordan normal form (this may be a sufficient condition only for spectrally simple, usually low-dimensional matrices): the Jordan decomposition is, in general, a computationally challenging task. From the vector space point of view, the Jordan decomposition is equivalent to finding an orthogonal decomposition (that is, via direct sums of eigenspaces represented by Jordan blocks) of the domain which the associated generalized eigenvectors make a basis for.

Functions of matrices

Let ${\displaystyle A\in \mathbb {M} _{n}(\mathbb {C} )}$  (that is, a n × n complex matrix) and ${\displaystyle C\in \mathrm {GL} _{n}(\mathbb {C} )}$  be the change of basis matrix to the Jordan normal form of A; that is, A = C⁻¹JC. Now let f (z) be a holomorphic function on an open set ${\displaystyle \Omega }$  such that ${\displaystyle \mathrm {spec} A\subset \Omega \subseteq \mathbb {C} }$ ; that is, the spectrum of the matrix is contained inside the domain of holomorphy of f. Let

$${\displaystyle f(z)=\sum _{h=0}^{\infty }a_{h}(z-z_{0})^{h}}$$

 

be the power series expansion of f around ${\displaystyle z_{0}\in \Omega \setminus \operatorname {spec} A}$ , which will be hereinafter supposed to be 0 for simplicity's sake. The matrix f (A) is then defined via the following formal power series

$${\displaystyle f(A)=\sum _{h=0}^{\infty }a_{h}A^{h}}$$

 

and is absolutely convergent with respect to the Euclidean norm of ${\displaystyle \mathbb {M} _{n}(\mathbb {C} )}$ . To put it another way, f (A) converges absolutely for every square matrix whose spectral radius is less than the radius of convergence of f around 0 and is uniformly convergent on any compact subsets of ${\displaystyle \mathbb {M} _{n}(\mathbb {C} )}$  satisfying this property in the matrix Lie group topology.

The Jordan normal form allows the computation of functions of matrices without explicitly computing an infinite series, which is one of the main achievements of Jordan matrices. Using the facts that the kth power (${\displaystyle k\in \mathbb {N} _{0}}$ ) of a diagonal block matrix is the diagonal block matrix whose blocks are the kth powers of the respective blocks; that is, ${\displaystyle \left(A_{1}\oplus A_{2}\oplus A_{3}\oplus \cdots \right)^{k}=A_{1}^{k}\oplus A_{2}^{k}\oplus A_{3}^{k}\oplus \cdots }$ , and that A^k = C⁻¹J^kC, the above matrix power series becomes

$${\displaystyle f(A)=C^{-1}f(J)C=C^{-1}\left(\bigoplus _{k=1}^{N}f\left(J_{\lambda _{k},m_{k}}\right)\right)C}$$

 

where the last series need not be computed explicitly via power series of every Jordan block. In fact, if ${\displaystyle \lambda \in \Omega }$ , any holomorphic function of a Jordan block ${\displaystyle f(J_{\lambda ,n})=f(\lambda I+Z)}$  has a finite power series around ${\displaystyle \lambda I}$  because ${\displaystyle Z^{n}=0}$ . Here, ${\displaystyle Z}$  is the nilpotent part of ${\displaystyle J}$  and ${\displaystyle Z^{k}}$  has all 0's except 1's along the ${\displaystyle k^{\text{th}}}$  superdiagonal. Thus it is the following upper triangular matrix:

$${\displaystyle f(J_{\lambda ,n})=\sum _{k=0}^{n-1}{\frac {f^{(k)}(\lambda )Z^{k}}{k!}}={\begin{bmatrix}f(\lambda )&f^{\prime }(\lambda )&{\frac {f^{\prime \prime }(\lambda )}{2}}&\cdots &{\frac {f^{(n-2)}(\lambda )}{(n-2)!}}&{\frac {f^{(n-1)}(\lambda )}{(n-1)!}}\\0&f(\lambda )&f^{\prime }(\lambda )&\cdots &{\frac {f^{(n-3)}(\lambda )}{(n-3)!}}&{\frac {f^{(n-2)}(\lambda )}{(n-2)!}}\\0&0&f(\lambda )&\cdots &{\frac {f^{(n-4)}(\lambda )}{(n-4)!}}&{\frac {f^{(n-3)}(\lambda )}{(n-3)!}}\\\vdots &\vdots &\vdots &\ddots &\vdots &\vdots \\0&0&0&\cdots &f(\lambda )&f^{\prime }(\lambda )\\0&0&0&\cdots &0&f(\lambda )\\\end{bmatrix}}.}$$

 

As a consequence of this, the computation of any function of a matrix is straightforward whenever its Jordan normal form and its change-of-basis matrix are known. For example, using ${\displaystyle f(z)=1/z}$ , the inverse of ${\displaystyle J_{\lambda ,n}}$  is:

$${\displaystyle J_{\lambda ,n}^{-1}=\sum _{k=0}^{n-1}{\frac {(-Z)^{k}}{\lambda ^{k+1}}}={\begin{bmatrix}\lambda ^{-1}&-\lambda ^{-2}&\,\,\,\lambda ^{-3}&\cdots &-(-\lambda )^{1-n}&\,-(-\lambda )^{-n}\\0&\;\;\;\lambda ^{-1}&-\lambda ^{-2}&\cdots &-(-\lambda )^{2-n}&-(-\lambda )^{1-n}\\0&0&\,\,\,\lambda ^{-1}&\cdots &-(-\lambda )^{3-n}&-(-\lambda )^{2-n}\\\vdots &\vdots &\vdots &\ddots &\vdots &\vdots \\0&0&0&\cdots &\lambda ^{-1}&-\lambda ^{-2}\\0&0&0&\cdots &0&\lambda ^{-1}\\\end{bmatrix}}.}$$

 

Also, spec f(A) = f (spec A); that is, every eigenvalue ${\displaystyle \lambda \in \mathrm {spec} A}$  corresponds to the eigenvalue ${\displaystyle f(\lambda )\in \operatorname {spec} f(A)}$ , but it has, in general, different algebraic multiplicity, geometric multiplicity and index. However, the algebraic multiplicity may be computed as follows:

$${\displaystyle {\text{mul}}_{f(A)}f(\lambda )=\sum _{\mu \in {\text{spec}}A\cap f^{-1}(f(\lambda ))}~{\text{mul}}_{A}\mu .}$$

 

The function f (T) of a linear transformation T between vector spaces can be defined in a similar way according to the holomorphic functional calculus, where Banach space and Riemann surface theories play a fundamental role. In the case of finite-dimensional spaces, both theories perfectly match.

Dynamical systems

Now suppose a (complex) dynamical system is simply defined by the equation

$${\displaystyle {\begin{aligned}{\dot {\mathbf {z} }}(t)&=A(\mathbf {c} )\mathbf {z} (t),\\\mathbf {z} (0)&=\mathbf {z} _{0}\in \mathbb {C} ^{n},\end{aligned}}}$$

 

where ${\displaystyle \mathbf {z} :\mathbb {R} _{+}\to {\mathcal {R}}}$  is the (n-dimensional) curve parametrization of an orbit on the Riemann surface ${\displaystyle {\mathcal {R}}}$  of the dynamical system, whereas A(c) is an n × n complex matrix whose elements are complex functions of a d-dimensional parameter ${\displaystyle \mathbf {c} \in \mathbb {C} ^{d}}$ .

Even if ${\displaystyle A\in \mathbb {M} _{n}\left(\mathrm {C} ^{0}\left(\mathbb {C} ^{d}\right)\right)}$  (that is, A continuously depends on the parameter c) the Jordan normal form of the matrix is continuously deformed almost everywhere on ${\displaystyle \mathbb {C} ^{d}}$  but, in general, not everywhere: there is some critical submanifold of ${\displaystyle \mathbb {C} ^{d}}$  on which the Jordan form abruptly changes its structure whenever the parameter crosses or simply "travels" around it (monodromy). Such changes mean that several Jordan blocks (either belonging to different eigenvalues or not) join to a unique Jordan block, or vice versa (that is, one Jordan block splits into two or more different ones). Many aspects of bifurcation theory for both continuous and discrete dynamical systems can be interpreted with the analysis of functional Jordan matrices.

From the tangent space dynamics, this means that the orthogonal decomposition of the dynamical system's phase space changes and, for example, different orbits gain periodicity, or lose it, or shift from a certain kind of periodicity to another (such as period-doubling, cfr. logistic map).

In a sentence, the qualitative behaviour of such a dynamical system may substantially change as the versal deformation of the Jordan normal form of A(c).

Linear ordinary differential equations

The simplest example of a dynamical system is a system of linear, constant-coefficient, ordinary differential equations; that is, let ${\displaystyle A\in \mathbb {M} _{n}(\mathbb {C} )}$  and ${\displaystyle \mathbf {z} _{0}\in \mathbb {C} ^{n}}$ :

$${\displaystyle {\begin{aligned}{\dot {\mathbf {z} }}(t)&=A\mathbf {z} (t),\\\mathbf {z} (0)&=\mathbf {z} _{0},\end{aligned}}}$$

 

whose direct closed-form solution involves computation of the matrix exponential:

$${\displaystyle \mathbf {z} (t)=e^{tA}\mathbf {z} _{0}.}$$

 

Another way, provided the solution is restricted to the local Lebesgue space of n-dimensional vector fields ${\displaystyle \mathbf {z} \in \mathrm {L} _{\mathrm {loc} }^{1}(\mathbb {R} _{+})^{n}}$ , is to use its Laplace transform ${\displaystyle \mathbf {Z} (s)={\mathcal {L}}[\mathbf {z} ](s)}$ . In this case

$${\displaystyle \mathbf {Z} (s)=\left(sI-A\right)^{-1}\mathbf {z} _{0}.}$$

 

The matrix function (A − sI)⁻¹ is called the resolvent matrix of the differential operator ${\textstyle {\frac {\mathrm {d} }{\mathrm {d} t}}-A}$ . It is meromorphic with respect to the complex parameter ${\displaystyle s\in \mathbb {C} }$  since its matrix elements are rational functions whose denominator is equal for all to det(A − sI). Its polar singularities are the eigenvalues of A, whose order equals their index for it; that is, ${\displaystyle \mathrm {ord} _{(A-sI)^{-1}}\lambda =\mathrm {idx} _{A}\lambda }$ .

See also

• Jordan decomposition
• Jordan normal form
• Holomorphic functional calculus
• Matrix exponential
• Logarithm of a matrix
• Dynamical system
• Bifurcation theory
• State space (controls)

Notes

1. Beauregard & Fraleigh (1973, pp. 310–316)
2. Golub & Van Loan (1996, p. 317)
3. Nering (1970, pp. 118–127)
4. Beauregard & Fraleigh (1973, pp. 270–274)
5. Golub & Van Loan (1996, p. 316)
6. Nering (1970, pp. 113–118)

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
• Golub, Gene H.; Van Loan, Charles F. (1996), Matrix Computations (3rd ed.), Baltimore: Johns Hopkins University Press, ISBN 0-8018-5414-8
• Nering, Evar D. (1970), Linear Algebra and Matrix Theory (2nd ed.), New York: Wiley, LCCN 76091646