with . If we want to study a real system, we deal with the complexificated one.
A solution for this equation with initial condition is any
such that
for every , and .
Theorem
The solution of the previous equation with initial condition is given by
Proof
Properties of exponential gives that verifies the equation.
Also, observe that there can not be solutions of other form. Consider other solution. Then has the same initial value, so they are the same.
So the only problem is to compute , which is the matrix exponential. We compute the roots of the characteristic polynomial of and distinguish several cases:
1. All roots are distinct
In this case, is diagonalizable, i.e., we can write . By matrix exponential properties we have that
where .
So solutions has the form in every component of linear combinations of exponentials
Can we "separate" these exponential maps? Yes. Observe that an operator with all eigenvalues different gives a decomposition of in invariant complex lines.
Also,
and moreover,
From here we can conclude:
Theorem
[Arnold, page 185]
If the eigenvalues of are all distinct then
where are the eigenvectors, and are constants to be determined by the initial conditions.
2. is a Jordan block
If is a Jordan block, we write , as usual. Observe that so
Suppose that is a Jordan block but in other basis, that is, . What we can conclude is that solutions of are
with . If we define:
Definition
A quasi-polynomial with exponent is an expression of the form where is a polynomial in .
...we conclude that if could be carried to a Jordan block, has the form, in every component, of a sum of quasi-polynomials with exponent and degree less than .
Let's focus in the case and then follow with the general one. is made of blocks, and for each eigenvalue we have two of such blocks: a diagonal block with size and a Jordan block of size (maybe or !).
Then, observe that the algebraic multiplicity of is $$n_i=d_i+j_i$$ and the geometric muliplicity of is $$k_i=d_i+1$$. This is deduced by the form we proof the decomposition, view Jordan canonical form of a matrix.
Now, observe that matrix , with , is itself a block matrix, because of the following
Lemma
Let a linear map. Then, if we have
Proof
If , then and therefore
belongs to (I guess is a result of convergence...)
It turns out then that if is a block of matrix then is a block of .
Moreover, for each we see that has possibly two blocks:
A scalar block, , of size .
A quasipolynomial block (see the previous case) of exponent , degree and size .
In conclusion, for a matrix made of Jordan blocks we get that is a block matrix with elements of the form . If is \textbf{any matrix} then
And so,
But and are made of (complex) constants and so only "mix" the elements of . We can state that
Proposition
Let a system of first order linear equations, with a linear operator. Then, if has eigenvalues with algebraic multiplicities and geometric multiplicities then every component of a solution is \textbf{a sum of quasi-polynomials with exponent and degree less or equal than }. I. e., it has the form:
where has degree less or equal than with constant complex coefficients.
Proof
It is all above, since
for .
It only remains to show the degree of the quasipolynomials, but it is a simple computation. For every :