In a deterministic dynamical system, we write for
In a linear dynamical system, is a linear function (if the system is affine then )
A solution to a deterministic system is a sequence of numbers such that
So if then we have a sequence defined by (this is trivial but we can use induction if necessary)
In ,
- If then , oscillating if is negative
- If then will decay to
Note that the space of solutions in our linear dynamical system is a vector space (addition and scaling defined)
The dimension of this space, which is the number of linearly independent solutions, is equal to
Let’s look at the equation
This can actually be written as !
We just write
The cool thing is this means the solution is still
Assuming we can still write , we can substitute to obtain , a quadratic equation
So we have
If , we have two solutions . Are these linearly independent?
Only if there is no solution to besides . This is true, which we can find simply from the cases .
This is neat, since it means we’ve found a basis for the space
Conclusion: Any solution can be written as (naturally )
Example:
We have , so
So and
Observation: This is all related to diagonalization of matrices
Specifically, is just the eigenvalues of
The nice thing about diagonalizing to is that we can take powers trivially
Now what if ? We know one solution is
In class Jonathan showed how we can derive as another solution, in which case any solution can be written as
Now what if we have , where ?
Solutions to this are the sum of a particular solution and a general solution to
- If then a particular solution is of form , where
- If and , there is a particular solution of type
- Otherwise if , there is a particular solution of type