In the mathematical discipline of matrix theory, a Jordan block over a ring R (whose identities are the zero 0 and one 1) is a matrix composed of zeroes everywhere except for the diagonal, which is filled with a fixed element , and for the superdiagonal, which is composed of ones. The concept is named after Camille Jordan.
Every Jordan block specified by its dimension n and its eigenvalue λ and is denoted as Jλ,n.
Any block diagonal matrix whose blocks are Jordan blocks is called a Jordan matrix; using either the or the "diag" symbol, the (n1 + ⋯ + nr) × (n1 + ⋯ + nr) block diagonal square matrix consisting of r diagonal blocks, where the first is Jλ1,n1, the second is Jλ2,n2, and so on, until the rth is Jλr,nr, can be compactly indicated as or , respectively.
For example, the matrix
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 can also be written as either or diag(J0,3, Ji,2, Ji,2, J7,3).
Any n × n square matrix A whose elements are in an algebraically closed field K is similar to a Jordan matrix J, also in , 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. A diagonalizable matrix is similar, in fact, to a special case of Jordan matrix: the matrix whose blocks are all 1 × 1.
More generally, given a Jordan matrix , i.e., whose kth diagonal block, 1 ≤ k ≤ N is the Jordan block Jλk,mk and whose diagonal elements λk may not all be distinct, the geometric multiplicity of for the matrix J, indicated as gmulJλ, corresponds to the number of Jordan blocks whose eigenvalue is λ. Whereas the index of an eigenvalue λ for J, indicated as idxJλ, 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 idxAλ can be defined accordingly with respect to the Jordan normal form of A for any of its eigenvalues . In this case one can check that the index of λ for A is equal to its multiplicity as a root of the minimal polynomial of A (whereas, by definition, its algebraic multiplicity for A, mulAλ, is its multiplicity as a root of the characteristic polynomial of A, i.e. ). An equivalent necessary and sufficient condition for A to be diagonalizable in K is that all of its eigenvalues have index equal to 1, i.e. 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 (i.e. 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 (i.e. a n × n complex matrix) and be the change of basis matrix to the Jordan normal form of A, i.e. A = C−1JC. Now let f (z) be a holomorphic function on an open set Ω such that , i.e. the spectrum of the matrix is contained inside the domain of holomorphy of f. Let
and is absolutely convergent with respect to the Euclidean norm of . 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 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 () of a diagonal block matrix is the diagonal block matrix whose blocks are the kth powers of the respective blocks, i.e. , and that Ak = C−1JkC, the above matrix power series becomes
where the last series need not be computed explicitly via power series of every Jordan block. In fact, if , any holomorphic function of a Jordan block f (Jλ,n) is the following upper triangular matrix:
As a consequence of this, the computation of any functions of a matrix is straightforward whenever its Jordan normal form and its change-of-basis matrix are known. Also, spec f(A) = f (spec A), i.e. every eigenvalue corresponds to the eigenvalue , but it has, in general, different algebraic multiplicity, geometric multiplicity and index. However, the algebraic multiplicity may be computed as follows:
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.
Now suppose a (complex) dynamical system is simply defined by the equation
where is the (n-dimensional) curve parametrization of an orbit on the Riemann surface of the dynamical system, whereas A(c) is an n × n complex matrix whose elements are complex functions of a d-dimensional parameter .
Even if (i.e. A continuously depends on the parameter c) the Jordan normal form of the matrix is continuously deformed almost everywhere on but, in general, not everywhere: there is some critical submanifold of 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 together to a unique Jordan block, or vice versa (i.e. 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, i.e. let and :
whose direct closed-form solution involves computation of the matrix exponential:
The matrix function (A − sI)−1 is called the resolvent matrix of the differential operator . It is meromorphic with respect to the complex parameter 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, i.e. .
- Jordan decomposition
- Jordan normal form
- Holomorphic functional calculus
- Matrix exponential
- Logarithm of a matrix
- Dynamical system
- Bifurcation theory
- State space (controls)
- 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