My professor said that the main idea of finding a Jordan normal form is to find the closest 'diagonal' matrix that is similar to a given matrix that does not have a similar matrix that is diagonal. I know that using a diagonal matrix is good for computations and simplifying powers of matrices. But what is the potential of finding a matrix with Jordan form? what is this 'almost diagonal' matrix gives me? We learnt how to find it, without knowing what is the main idea behind it and what are the applications used with it, so I can't really understand it.

  • 911
  • 7
  • 15
  • 3
    Canonical forms can give new insight into theory. Especially as you start to investigate families of matrices and how they relate to each other. – mathreadler Jul 08 '17 at 17:15
  • 3
    Here is some motivation, you can use it in image processing, some examples for the uses are the same as diagonal matrices, you can find power of matrices easier since $A^n=P^{-1}J^nP$ and as stated by others, we have a simple equation for finding $J^n$. Now this isn't the only use of Jordan forms, it can be used to [solve][1] a system of differential equations. Moreover, at advanced computer science courses, Jordan normal forms are used to approximate artificial intelligence growth. [1]: http://www.morganclaypool.com/doi/abs/10.2200/S00146ED1V01Y200808MAS002 – Rab Jul 08 '17 at 22:12
  • 1
    @RabMakh: To create an inline link in an answer or comment use `[link text](link url)`. =) – user21820 Jul 09 '17 at 06:07

5 Answers5


First of all, the Jordan form is also "good for computations and simplifying powers of matrices". In particular, if $$ J = \pmatrix{\lambda&1\\&\lambda&1\\&&\ddots & \ddots \\&&&&1\\&&&&\lambda} $$ Then we compute (when $k>n$) $$ J^k = \pmatrix{\lambda^k & k \lambda^{k-1} & \frac 1{2!} k(k-1)\lambda^{k-2} & \cdots & \frac 1{(n-1)!} k(k-1) \cdots(k-n + 1)\lambda^{k-n + 1}\\ 0 & \ddots & \ddots & \cdots\\ \vdots & \ddots} $$ More generally, if $f(x)$ is an analytic function (such as $f(x) = e^x$), we have

$$ f(J) = \pmatrix{f(\lambda) & f'(\lambda) & \frac 1{2!} f''(\lambda) & \cdots & \frac 1{(n-1)!} f^{(n-1)}(\lambda)\\ 0 & \ddots & \ddots & \cdots\\ \vdots & \ddots} $$ Jordan form is also important for determining whether two matrices are similar. In particular, we can say that two matrices will be similar if they "have the same Jordan form".

Ben Grossmann
  • 203,051
  • 12
  • 142
  • 283
  • 5
    I'm a little surprised you wrote 'good for computations'? – copper.hat Jul 09 '17 at 03:48
  • 4
    @copper.hat: Yea it's not good for computations at all. Canonical forms of matrices tend to be highly numerically unstable. Also, repeated squaring is probably by far the most efficient technique when coupled with fast matrix multiplication algorithms. – user21820 Jul 09 '17 at 06:09
  • 17
    @copper.hat When a theoretical mathematician talks about computations, they probably mean symbolic computations. – Ryan Reich Jul 09 '17 at 07:10
  • 5
    @copper.hat it's "good for computations" in the exact way that diagonalization is "good for computations", as in the asker's question. – Ben Grossmann Jul 09 '17 at 13:34

Exercise: using Jordan canonical form, prove that a matrix is diagonalizable (over C) iff the minimal polynomial has no repeated roots. Prove the Cayley Hamilton theorem (assuming Jordan form). (The idea in all cases is to understand these theorems for a Jordan block.) Prove that the determinant is the product of the eigenvalues, and that the trace is the sum.

So, you will see that the Jordan canonical form summarizes a lot of theorems as trivial corollaries. The ones I listed are just what came to mind, I'm sure there are others.

By the way - you will also notice that some of these theorems are trivial for diagonal matrices. There is a technique for proving theorems for diagonal matrices, and extending them to all matrices, since diagonalizable matrices are dense in the space of matrices, and so equalities of continuous functions will carry over to the whole space (you can even prove theorems in abstract linear algebra over any ring statement this way). All matrices have a JCF, so I guess the situations when you can prove stuff by reduction to JCF are strictly larger than when you can prove by reduction to diagonalizable matrix. (For example, the first exercise I listed.)

Elle Najt
  • 19,599
  • 5
  • 30
  • 68

Generally, if we can find a canonical form for some object, it simplifies reasoning about the object. If we want to prove some fact, we need only deal with the canonical form rather than all possibilities.

The Jordan normal form is not quite canonical (the blocks can be permuted in general) but serves the same purpose. It shows how repeated eigenvalues can affect the eigenvalue structure.

Omnomnomnom's answer shows how analytic functions can be defined, other answers show how $\det$ and $\operatorname{tr}$ are related to the eigenvalues.

A word of warning, in absence of special structure (or exact arithmetic), it is impossible to numerically determine the Jordan form of a matrix if there are repeated or nearby eigenvalues.

Other forms are better for numerical work, for example, the Schur decomposition allows us to write a matrix in the form $QTQ^*$, where $Q$ is unitary and $T$ upper triangular. This form does not reveal the eigenspace structure as clearly as the Jordan normal form, but can be computed in a numerically stable fashion.

  • 161,568
  • 8
  • 96
  • 225

Essentially the same that the diagonal form. It simplifies some computations, like powers,etc. If the matrix you are working with is not similar to a diagonal matrix, you settle for next best: the Jordan canonical form

Julián Aguirre
  • 74,504
  • 2
  • 51
  • 108

It is demonstrated in these notes, page 29-30, that exponential of a square matrix $M$ can be explicitly computed if either $M$ is diagonalisable or nilpotent, or if you know how to decompose $M=S+N$ for a diagonal matrix $S$ and a nilpotent matrix $N$ with $SN=NS$. Such a decomposition is justified by Jordan normal form.

  • 5,375
  • 1
  • 8
  • 27