Jordan normal form

from Wikipedia, the free encyclopedia

The Jordanian normal form is a term from the mathematical branch of linear algebra . It was named after Marie Ennemond Camille Jordan , who derived it in 1870 for finite bodies and in 1871 in connection with the solution of complex differential equation systems for complex matrices, but who was also known to Karl Weierstrass in 1868 for his treatment of bilinear forms in the complex. The Jordanian normal form is a simple representative of the equivalence class of matrices that are similar to a trigonalizable matrix . Trigonalization is synonymous with the fact that thecharacteristic polynomial of the matrix breaks down completely into linear factors . Matrices over an algebraically closed field are always trigonalizable and therefore always similar to a Jordanian normal form.

For each linear mapping of a finite-dimensional vector space, the characteristic polynomial of which is completely broken down into linear factors, a vector space basis can be selected so that the mapping matrix that describes the mapping with respect to this basis has Jordanian normal form.

The rational normal form or Frobenius normal form provides a standardized representative of the similarity class of this matrix for any matrix, even if it cannot be trigonalized .

definition

The Jordanian normal form of a square matrix over the complex numbers is a matrix in the following block diagonal form :

The matrix is the matrix of the eigenvectors and principal vectors that make it up in columns. denotes the inverse matrix of . The matrices are called Jordan blocks or Jordan boxes and they are bidiagonal matrices with the following shape:

They are the eigenvalues of . For each eigenvalue there are many Jordan blocks corresponding to its geometric multiplicity . The geometric multiplicity is the dimension of the eigen-space to the eigen-value . The total dimension of all Jordan blocks of an eigenvalue corresponds to its algebraic multiplicity , i.e. H. its multiplicity in the characteristic polynomial.

In a Jordan block the so-called are Jordan chains "stored" (see Major Vector ). Is there e.g. B. only from a Jordan block with eigenvalue and denote a principal vector -th degree. There is an eigenvector for the eigenvalue and it holds and for . Then and for , that is, the mapping matrix with respect to the base is actually a Jordan block.

There is also an alternative representation of the Jordan blocks with 1 in the lower secondary diagonal .

In the special case of a diagonalizable matrix, the Jordanian normal form is a diagonal matrix .

Shape of the transformation matrix

There are principal vectors of the respective th stage, wherein the dimension of the -th Jordan block .

Then is defined by

a transformation matrix that uses the Jordan normal form of .

In words: The columns of are the eigenvectors with the associated main vectors in the order of the associated Jordan blocks. However, it is not clearly determined.

Algorithm for determining a complex Jordanian normal form

For Jordan normal form of an endomorphism of a -dimensional -Vektorraums to choose a basis of a vector space , and calculates the Jordan normal form of the imaging array of respect to the base .

The following is therefore set and the complex Jordanian normal form of a square matrix is determined. The identity matrix is denoted by.

Determination of the eigenvalues

With the help of the characteristic polynomial

the pairwise different eigenvalues ​​are calculated from its zeros

The eigenvalues ​​are therefore not listed here according to their multiplicity.

Determination of the size of the Jordan blocks

To do this, the dimensions of the generalized eigenspaces must first be determined. That is, one calculates the numbers for all of them

In particular, is always and is precisely the geometric multiplicity of the eigenvalue . The dimension of the core can be calculated from the rank with the aid of the dimension set , which can be determined, for example, with the Gaussian algorithm .

The sequence of is increasing monotonically and becomes stationary from a certain value , at the latest when the algebraic multiplicity of the eigenvalue in the characteristic polynomial is reached . The number of Jordan blocks of size to the eigenvalue can then be calculated using the formula

to calculate. It also gives the total number of Jordan blocks belonging to this eigenvalue.

Complex Jordanian normal form

The Jordan blocks obtained are written in a matrix and the complex Jordanian normal form of a matrix is ​​obtained. If all blocks have the size 1, there is the special case of a diagonal matrix and can therefore be diagonalized.

The minimal polynomial of is obtained from , where denotes the size of the largest Jordan block for the eigenvalue .

The Jordanian normal form is uniquely determined except for the order of the Jordan blocks. If all eigenvalues are in, two matrices that have the same Jordanian normal form are similar to each other.

example

Consider the matrix which is defined as follows

Its characteristic polynomial is . Thus this matrix has exactly one eigenvalue, namely 3. With the abbreviation the following are determined:

It applies . So is .

Furthermore, the zero matrix is valid, and therefore and the sequence becomes stationary from this point on.

So it follows:

There are Jordan blocks, and of them

Jordan block with size 1 and

Jordan blocks with size 2.

This is the Jordanian normal form of . The minimal polynomial of is .

Determination of a basic transformation to the complex Jordanian normal form

Now a basic transformation matrix is ​​to be determined which

Fulfills. It is known that it is not clearly determined by this equation. The standard procedure uses previous knowledge of the complex Jordanian normal form .

A standard procedure

A common procedure for obtaining a basis transformation is as follows: First determine (as with the naive approach above) the Jordan normal form . Then in particular all eigenvalues ​​have already been calculated as well as the kernels for all in which the dimension of the largest Jordan block denotes the eigenvalue . Subsequently, work for determining a regular matrix with the blocks in succession. It should be noted that with Jordan blocks with the same eigenvalue one always proceeds from the largest block to the smallest block.

For each block of size and eigenvalue are columns of the base transformation matrix according to a certain scheme determined. If the block occupies the columns , the vectors are also inserted into the columns (from left to right) . The vectors are now determined as follows:

  • One can choose arbitrarily, in which denotes the set of previously calculated columns (ie basis vectors) of the level from previously processed Jordan blocks for the same eigenvalue (if any). This relatively free choice in particular shows that the basic transformation cannot be unique. If is simply an eigenvector to the eigenvalue
  • After choosing the above vector, there is no longer any freedom of choice for the other basic vectors: You have to set successively for all of them.

After all Jordan blocks have been processed in the above way, all columns of have been filled in at the end . The following applies: is regular and satisfied , and its columns form a basis with respect to which the representation possesses.

If the alternative representation of the Jordan blocks is selected, i. H. with 1 in the lower secondary diagonal, only the order of the basis vectors per Jordan block has to be reversed.

example

As an illustrative example, consider the matrix

as above. It applies

and .

Its normal Jordan form is

.

Start with the first Jordan block of dimension 2. To do this, choose

any, for example . Then choose. From this you get . Now move on to the second Jordan block, size 2. Choose now

any, for example . Then is , and you end up with . Finally, it is the turn of the last Jordan block (size 1). Choose for this

any, for example . Then there is a regular matrix with .

Real Jordanian normal form

If one considers real matrices, their characteristic polynomial generally no longer breaks down completely into linear factors, but only into irreducible factors, which in this case are always linear or quadratic factors. The question of a normal form now arises if only real basis transformations are allowed.

A quadratic irreducible factor with is defined as a Jordan block

We call the number of rows (or columns) the size of this block. Then one designates

as a real Jordanian normal form. To find it and a suitable real matrix , one can proceed as follows:

  • Find the characteristic polynomial and factor it into irreducible factors. It turns out
,
where pairwise denote different eigenvalues ​​with multiplicity . Next were in it , , and pairwise different.
  • Determine for each
for ,
where is the smallest natural number with . Determine analogously for each
for ,
where is the smallest natural number with .
We also bet .
  • Now set up the Jordanian normal form. It applies here
    • is the number of Jordan blocks for the eigenvalue whose size is greater than or equal .
    • is the number of Jordan blocks for the factor whose size is greater or equal .
In addition, the sum of the Jordan block sizes is the eigenvalue and the sum of the Jordan block sizes is the factor . From this information one can clearly determine the Jordanian normal form .
  • Then determine the basis transformation matrix , that is, one looks for a real invertible matrix such that .

One method to get a base transformation is as follows:

  • Work through the blocks one after the other. It should be noted that with Jordan blocks for the same irreducible factor one always proceeds from the largest block to the smallest block. For each block of size are columns of the base transformation matrix determined according to a certain scheme. If the block occupies the columns , the vectors are also inserted into the columns (from left to right) . The vectors are now determined as follows:
    • For a Jordan block of the size of the eigenvalue, one can arbitrarily choose , in which the set of previously calculated columns (i.e. basis vectors) of the level from previously processed Jordan blocks for the same eigenvalue (if any) is designated. Then you bet successively for all .
    • For a Jordan block of the size of the irreducible factor, choose a vector , whereby the main vectors of the steps already calculated for the same irreducible factor are made up.
Then you set for successively
Finally, as usual, you put the vectors together.
  • After you have processed all Jordan blocks in the above way, all columns are filled by at the end . The following applies: is regular and satisfied , and its columns form a basis with respect to which the representation possesses.

example

Consider the matrix which is defined as follows

Its characteristic polynomial is where irreducible is over . Now we calculate the Jordanian normal form:

.

This core has dimension 1. So there is only one Jordan block that size . On the other hand, the sum of the Jordan block sizes must be 1 (the power of ), so that there is exactly one Jordan block with eigenvalue 1, and it has size 1. Further

the dimension 2, so that there is consequently only Jordan block of the size . Since the sum of the Jordan block sizes must be 4 (twice the power of ), it follows that this one Jordan block is size 4. We also calculate

.

Thus is the real Jordanian normal form of .

For comparison, the complex Jordanian normal form is .

To calculate a basic transformation matrix, start with the first real eigenvalue and then with the (first) Jordan block of dimension 1. Choose

any, for example . From this you get .

Now move on to the first irreducible factor (complex eigenvalue) and then to the Jordan block of size 4. To do this, choose

any, for example . Then , and to choose. This yields: . is a regular matrix with .

Jordan normal form in general solids

The Jordanian normal form can be further generalized to general bodies . In this context it is often referred to as the Weierstraß normal form (or Frobenius normal form ). This allows an unambiguous matrix representation of endomorphisms of finite-dimensional vector spaces, in which all similar endomorphisms can be represented by an unambiguous matrix. In this way, similar linear maps can be identified. The lemma Frobenius characterized matrices similar to each other through the elementary divisors their characteristic matrices and provides the Frobenius normal form as the normal form of the vector space under the operation of a polynomial ring.

Due to the representation in the Weierstrasse normal form, the structure of the minimal polynomial is immediately recognizable and the characteristic polynomial can be easily calculated.

Use in systems of linear differential equations of the first order with constant coefficients

A linear differential equation system (of equations) of the first order with constant coefficients is given

by a matrix and a continuous function . It is known that the unique solution to the initial value problem

is given by

,

wherein

For

denotes the matrix exponential function . Note:

  • The matrix exponential function of a complex Jordan block can be calculated explicitly:
.
  • The matrix exponential function of a complex Jordan normal form can be calculated explicitly using:
.
  • The matrix exponential function of a matrix whose complex Jordan normal form is known together with a base transformation matrix , that is , can be calculated explicitly using:
.

In other words: If you know a representation with the complex Jordanian normal form , you can calculate explicitly for each , so that to determine

only the integration problem remains to be solved, which is completely eliminated in the homogeneous case .

See also

  • Diagonalization is a special case of the Jordanian normal form.
  • The Jordan normal form is a special case of the Weierstrass normal form .
  • The existence of the Jordanian normal form provides the existence of the (additive) Jordan-Chevalley decomposition of an endomorphism.
  • Since the existence of zeros of the characteristic polynomial is decisive for the existence of a Jordanian normal form, the real normal form, as described here, can be more general for affine self-maps of the two- dimensional affine space over a Euclidean space and an affine space with any finite dimension over a real closed body to be determined.

literature

  • Herbert Amann: Ordinary differential equations . 2nd Edition. De Gruyter, Berlin 1995, ISBN 3-11-014582-0 .
  • Gilbert Strang : Linear Algebra . 1st edition. Springer-Verlag, Berlin 2003, ISBN 3-540-43949-8 . (Literature on eigenvalues ​​and eigenvectors as well as matrix calculation).

Web links

Individual evidence

  1. ^ Wilhelm von Alten u. a., 4000 Years of Algebra, Springer 2008, p. 409