In this section, we combine differential equations and linear algebra to produce differential systems.
Linear Differential Systems
Introduction
An -dimensional differential system is defined as
where
In other words, we have unknown functions in terms of given functions. We want to find a solutions to
We can often convert higher order differential equations into differential systems, which may be easier to solve!
For simplicity, we will only be working with first order linear systems.
Let be our unknown function. A first order linear system is given as
where are functions on . Note that in these systems, all unknown functions are given in terms of their first derivative.
We represent differential systems in matrix form, as so:
Solutions to Differential Systems
To solve a differential system is to find a vector such that its entries (which are functions on ) satisfy our differential system
Oftentimes, we want to find a fundamental matrix to our differential system, which is a matrix of solutions such that
such that each column is a solution, and the linear combination of all column vectors represents all possible solutions to our linear system.
Note: Given a fundamental matrix, we can actually find the system corresponding to this matrix of solutions!
Example: System from Fundamental Matrix
Suppose are solutions to a homogeneous differential system. What is the differential system?
We know that because our functions are solutions, they satisfy
Thus, we can easily solve for by performing matrix operations!
Example: Finding the General Solution
Suppose we have differential system
Defined on interval .
Now say we have solutions to differential system
Find the general solution of this differential system.
Note that we cannot simply add our solutions together, as the system may not be homogeneous.
However, we see that subtracting our solutions will give us solutions to the homogeneous differential system!
Thus, if we use this to find the general solution for the homogeneous system, and then add a particular solution, we will find out general solution!
Thus, let’s choose
as our homogeneous general solution. We see their Wronskian is , so they only form a FSoS on .
Assuming that , therefore, we find our general solution to be
Theorem: Solutions to Homogeneous Systems
Let be an -dimensional differential system, such that .
Then, the set of all solutions to the homogeneous system forms an -dimensional vector space. We can thus choose functions that span this vector space.
Note that because FSoS span the same solution space, there must necessarily exist a change of basis matrix that maps one to the other.
We know that such a matrix is a fundamental matrix if its determinant, otherwise known as its Wronskian, is not 0 on the entire interval on which the differential system is defined.
This is very similar to Fundamental Set of Solutions!
Luckily, we don’t have to check the Wronskian for all , by the following theorem:
Theorem: The Wronskian
If the Wronskian of solutions is 0 for some , then the Wronskian of these solutions is 0 for all .
Similar to differential equations, we also have Natural Fundamental Set of Solutions (NFSoS) such that only the entry of is 1, all others 0.
Given a differential system with initial values, known as an initial value problem, how can we obtain a NFSoS?
Given a fundamental matrix , we can easily find NFSoS for value by taking
Furthermore, we can multiply our NFSoS by initial value problem to easily find our solution.
This should intuitively make sense! At , we obtain
Additionally, we see the following theorem for initial value problems.
Theorem: Existence and Uniqueness
Let be an -dimensional differential system.
If all entries of and are defined and continuous over some interval , then given initial value problem
Then there exists one and only one solution to the system such that .
Example: Existence and Uniqueness - Disproving Solutions
Show that is not a solution to any homogeneous 2-dimensional linear differential system defined on .
Suppose satisfies
The existence and uniqueness theorem guarantees that for all values in , there exists one and only one solution.
Pick initial condition . We can easily say there is solution .
However, if we take , we also obtain ! As the existence and uniqueness theorem states there is only one solution for IVP, so cannot be a solution!
Example: Existence and Uniqueness - Properties of Solutions
Take differential system
Prove there is a solution defined on which is an even function.
Suppose we have an initial value problem with solution . Because is a solution, it satisfies
Now, define . Plugging this into the differential equation, we obtain
Now, using the fact that and are odd functions, we substitute
Applying a change of variables , we see that
We see that is a solution! However, as the Existence and Uniqueness Theorem guarantees a unique solution for this initial value problem,
Thus, is an even function!
Differential Equations as Systems
Given any arbitrary differential equation, we can represent it as a differential system. This is important, as all linear differential equations will translate to first order systems, which may considerably simplify solving!
To represent an equation as a system, choose to be our functions, where each corresponds to some derivative of under the order of the equation. Then, find what is to create your matrix.
What we are essentially doing is creating an isomorphism between the equation and system! So, if we find a solution to our equation, we can transform it into a solution for our system!
Some examples are given below.
Example: Equations as Systems (1)
Take second order differential equation
We know from constant differential equations that we have FSoS to homogeneous differential equation , and finding particular solution , we have general solution
Let’s now relate this to differential systems.
Define , to obtain differential systemNote that the characteristic polynomial of is the same as the characteristic polynomial of the differential equation !
Given our previously found solution, we know we have solution
Example: Equations as Systems (2)
Convert the following differential equation to a system.
Let . We find that
And use this to find matrices and for our system
Example: Equations as Systems (3)
Convert the following differential equation to a system.
Define . We find that
And use this to find matrices and for our system
Constant Linear Systems
Suppose we have differential system
such that is a constant matrix (a matrix whose entries are all constants). We’ll define these systems as constant differential systems.
Note that there are more constant systems than there are constant differential equations. Our previous method of finding the solution for a constant equation may not work for all systems.
How do we solve these equations?
Solutions to Homogeneous Systems
Take homogeneous constant system
Now, observe that if we take the exponential of matrix , defined as
Taking the exponential of offers really convenient solutions to our system!
We can prove this by computing its derivative.
Furthermore, we see that the determinant of the exponential matrix is never 0, as
So, the columns of always forms a FSoS for our constant differential system! We can thus find our FSoS by finding the Jordan Form of and taking the matrix exponential, to obtain !
Theorem: Solutions to Constant Homogeneous Systems
The FSoS constant homogeneous differential system
can always be found by finding the column vectors of the matrix exponential .
Working in reverse, how can we find ?
- Because all fundamental matrices can be transformed to one another via a constant matrix, we know that for some fundamental matrix ,
Furthermore, we know that at , !
So, we know our fundamental matrix if , and if it is not the exponential, we can easily find by solving for !
Thus, we may sometimes be able to use our experience with constant differential equations to easily find our exponential matrix!
- Alternatively, we now that if we have the NFSoS about ,
We can prove this. We know that by definition, at where the NFSoS is based,
Additionally, any derivative of yields .
Thus, at , We can generalize this with the following theorem.
Theorem: Finding the Matrix Exponential
Suppose we have constant homogeneous differential system
And let be the order differential equation with characteristic polynomial equal to the characteristic polynomial of .
If is a NFSoS for at , then
All we need to know about matrix is its characteristic polynomial to find the system’s solution! Note that are polynomials and not matrices.
Note: We can find the NFSoS easily by taking the Wronskian of a FSoS , and multiply it with !
Proof
Consider the derivative operator . We know that
Take the linear operator of the differential equation. We know that
Furthermore, as is the characteristic polynomial of , it is 0 by the Cayley-Hamilton theorem.
Thus, all entries of are solutions to !
Take NFSoS . We know that we can form the columns of as a linear combination of these solutions. This forms linear combination
Where are matrices we want to find. We can solve each , as at ,
Example: Solutions to Homogeneous Systems (1)
Let there be differential system
We can easily find the FSoS for this system by finding !
Thus, we find FSoS
Note: We should expect this, as this system is equivalent to the differential equations
Whose solutions can very easily be seen as
Example: Solutions to Homogeneous Systems (2)
Let’s take a more complicated example. Let there be differential system
Find a FSoS for this system.
We begin by finding the Jordan form of . We take the characteristic polynomial of
To find eigenvalues 3 and 4. We then find an eigenvector for each eigenvalue:
Choose . We have diagonalized as
Now, we take the exponential of to find our FSoS.
Solutions to Non-Homogeneous Systems
Just like with differential equations, to find a general solution to a non-homogeneous system, we find the general solution to the corresponding homogeneous system, and add that to a specific solution of the non-homogeneous system.
How do we find this specific solution?
Variation of Parameters
Recall the variation of parameters technique, where given general solution to homogeneous equation , we find specific solution
where are functions on .
With differential systems, we perform variation of parameters similarly. Let us have differential system
where is a fundamental matrix for the corresponding homogeneous system
Suppose are the solution vectors of . We want to find a specific solution such that
Where are functions on . We can rewrite this as
Where
Now, because is a solution to the non-homogeneous solution, it must satisfy
Because we know by assumption that is a solution to the homogeneous system, it must be true that . So, we obtain
Because this must be equal to
This forces ! Furthermore, as is a fundamental matrix, it is invertible, so we can find
Finally, we can find our specific solution as
Theorem: Variation of Parameters
Suppose we have constant non-homogeneous solution
and fundamental matrix to the corresponding homogeneous system .
Then, there exists specific solution such that
Furthermore, if we have initial value problem , we have specific solution
Laplace Transforms
Recall from Ordinary Differential Equations, we defined the Laplace Transform as
which is a one-to-one linear transformation mapping functions on to functions on .
We can apply this similarly to differential systems, where
In other words, we apply the Laplace transform to each component of the vector.
Suppose we have differential system
To solve it using Laplace transforms, let be the Laplace transform of , and be the Laplace transform of .
Then,
We can take the inverse, as for sufficiently large values of , (and we just need the Laplace transform to work for some interval )!
Note that we can take the matrix out, as it is a constant matrix, so is really just taking a linear combination of .
Example 1: Laplace Transforms
Let be the Laplace transform of . Then, we find
We found a specific solution!
Non-Linear Differential Systems
Consider a non-linear differential system. As it is not linear, we cannot combine known solutions to form new solutions. In other words, our solution set does not span a vector space!
Because of this, we would have to explicitly find different solutions to solve the system, which is oftentimes not worth it!
So, instead of explicitly finding solutions, we instead describe the shape of solutions!
Given a non-linear differential system, we want to know what behavior solutions to the system take!
Autonomous Systems
Consider an autonomous system, which a differential system taking on the form
where are functions on , and does not explicitly depend on .
Note that autonomous systems can be both linear and non-linear! We first describe properties using linear systems (which we know), and generalize to non-linear systems.
For simplicity, we will only be working with non-linear autonomous systems. Given an autonomous system, we want to know the following:
- Equilibrium solutions, and behaviors of solutions near the equilibrium solution.
- Paths of solutions to the system, otherwise known as orbits.
Both of these are described below.
Equilibrium Solutions
Equilibrium and Stability
Given an autonomous system, a solution to an autonomous system is stationary / equilibrium if it is a constant (unchanging) solution. In other words, if
Thus, to find an equilibrium solution, set the system’s derivatives to 0, and solve for the components of !
Example: Equilibrium Solutions (1)
We find our stationary solutions by taking .
We perform a case analysis.
- Choosing , we have .
- choosing , we have .
Thus, our equilibrium solutions are
Example: Equilibrium Solutions (2)
We find our stationary solutions by taking .
We perform a case analysis.
- Choosing , can be any value.
- Choosing , can be any value.
Thus, we have stationary solutions
where any point on the line is a stationary solution!
Furthermore, a stationary solution is semi-stationary if all but one of the coordinates are 0.
Now say we have a solution to differential system . We call a stable solution if (informally) any solution that is sufficiently close to for stays close to for all .
More formally, this is stated as , there such that
for all .
In other words, for all solutions in any ball (centered around our solution) of size , we can find a ball of size such that all functions starting within the ball stay within the ball for all !
In 2 dimensions, instead of a ball, we look at a disk (circle) around our solution.
Furthermore, a stable solution is asymptotically stable, if any solution sufficiently close to converges to .
Otherwise, our solution is unstable. Negating the earlier definition for stability, a solution is unstable if , such that
We can find a ball for which there is no ball!
Typically, with stable solutions, we are looking to see if solutions stay within a “tube” around our changing . However, for equilibrium solutions, we are just looking at a stationary disk / ball around !
Let’s now examine the stability of linear systems, and work to see how we can use that for non-linear systems!
Stability of Linear Equilibriums
Consider a linear system given by
where is a constant matrix.
We can see that in these systems, the origin is always an equilibrium solution. Thus, with these systems, we are commonly interested in examining the stability of the equilibrium solution.
Example: Stable Equilibrium
Using our prior knowledge of constant linear systems, we know that our solution set to differential system comprises some combination of the functions .
Thus, all solutions will oscillate back in a periodic motion! So, while they will stay near the origin, they will never equal the origin, making the origin stable (but not asymptotically stable)!
Example: Asymptotically Stable Equilibrium
Using our prior knowledge of constant linear systems, we can find the solution set of this differential system as
Now, say we have any arbitrary solution
we see that as , ! What’s more, because the exponentials are negative, is the solution’s maximum value!
Thus, we see that our origin is stable, as all solutions near the origin stay near the origin (by converging inwards)!
More formally speaking, if we have an ball, we know that all functions within this ball will never escape, as they are strictly decreasing! Thus, for all balls, we choose a ball such that , as all functions within stay within .
Thus, we show that the origin is a stable equilibrium using ! Furthermore, because all solutions converge to 0 as , the origin is asymptotically stable!
Using a similar idea, we observe that so long as our solution set consists only of negative exponentials, our solutions will always converge to the origin, giving us an asymptotically stable equilibrium!
Example: Unstable Equilibrium
Using our prior knowledge of constant linear systems, we can find the solution set of this differential system as
Now, say we have any arbitrary solution
we see that for any solution such that and are not both 0, the solution diverges to !
Thus, we see that the origin is unstable, as all solutions, no matter how close, diverge!
More formally speaking, we show that , such that ,
Say we pick a ball . Then, regardless of the ball we choose, we can pick a function within this ball
such that as ,
In other words, we can always find a solution which will always drift away from the origin, no matter how close it starts to it!
Thus, our origin is an unstable solution.
There are lots of solutions which escape here! We just need to choose one to prove instability, however.
Using a similar idea, we observe that so long as we have any solution with a positive exponential, we will always have a set of solutions diverging to infinity, making our origin an unstable equilibrium!
Given the above examples, we can make the following observations:
- When all of the solutions are combinations of negative exponentials, the origin is asymptotically stable.
- When any singular solution is a positive exponential, the origin is unstable.
Thus, we see that the stability of our origin depends on which solution set comprises the system!
Thus, given that we can find solutions to linear systems using ‘s eigenvalues, it should be no surprise that ‘s eigenvalues can indicate the stability of the origin. We formalize this finding in the following theorem:
Theorem: Stability of Linear Systems
Suppose we have linear differential system
where is a constant matrix.
Then, the system has equilibrium solution (the origin), whose stability depends solely on the eigenvalues (denoted ) of , as so:
- If are all negative, then is asymptotically stable.
- If are all non-positive, and the algebraic multiplicity of all equals their geometric multiplicity, then is stable (but not asymptotically stable).
- If is positive for any singular eigenvalue, then is unstable.
Furthermore, all other solutions are stable if and only if is stable.
One major application this comes up in is in determining precision of solutions!
Example: Margins of Error
Suppose we have a linear system
We know that with initial conditions , we can find a solution
which describes how our initial values change over time.
However, in the real world, nothing is perfect! So, say we made a mistake in measuring our initial values, and have an error. Will our slightly-off solution remain a good estimate of our desired results?
We know if it will remain a good estimate if solutions in our system are stable, which we can determine based on ‘s eigenvalues.
Now, let be our error. Because we have a linear system, we have solution
Thus, to find how our error changes over time, we can find
Note that if has all negative eigenvalues, our imprecise solution actually converges to our desired solution!
Stability of Non-Linear Equilibriums
Let’s now consider equilibrium for non-linear systems. How do we know if a given equilibrium is stable or unstable?
Let’s consider a one-dimensional case
We can easily find equilibrium points . Tracing them on a number line, we can see how behaves at different intervals along this line.
From this, we can see that is a stable point (as points move towards it), whereas is an unstable point!
Note that we don’t actually care about the value of the derivative - we only care about the sign!
We now generalize this idea to higher-dimensions. Consider a non-linear differential system given by
where .
Now consider some point in this system . We define
as the open ball (disk) around this point , the set of all points within a fixed distance of .
Now let be an equilibrium point, and consider the values of the derivatives at a point very close to , which we’ll call .
We can use tangent plane approximation to approximate the functions , about as
Only for points close to !
Which allows us to approximate our system using the system:
Using the fact that is a stationary point, we know that functions and are 0 at . Furthermore, defining , we see that
Giving us system
This is called the linearization of a non-linear system about a equilibrium point, where
is called the Jacobian.
Using this linearization, we can see how points near our equilibrium point approximately behave! These behaviors are approximations, as our derivatives in the Jacobian are approximations of the actual derivatives.
Now that we’ve approximated a linear system, we can now use our earlier theorem with linear systems to determine the behavior of points around our equilibrium.
Theorem: Stability of Non-Linear Systems
Suppose we have a non-linear differential system
With equilibrium points .
Now say we have the linearized differential system about some equilibrium point .
Then, we can determine the stability of the equilibrium point depending on the eigenvalues (denoted ) of , as so:
- If are all negative, then is asymptotically stable.
- If is positive for any singular eigenvalue, then is unstable.
Note that by the theorem, we cannot say anything when there is an eigenvalue of 0!
This is because as matrices with values close to one another have approximately the same eigenvalues, we can say positive eigenvalues stay positive and negative eigenvalues stay negative, but we cannot say anything about 0 eigenvalues!
Thus, we can say an equilibrium point is asymptotically stable or unstable, but cannot tell if it’s stable or not!
Example: Stability of Non-Linear Equilibrium
Define non-linear differential system
Solving for equilibrium points by letting
We find the equilibrium points . We now determine their stability.
For , we linearize the system by defining
And calculating
But we choose and so small that any power is extremely small! So, we’ll effectively ignore them (we’re approximating the functions) to obtain
Note: We can just take the partial derivatives, but when doing that, this is in essence what we are doing!
Which is our linearized system! Taking matrix
we calculate the eigenvalues as , telling us that all solutions near the equilibrium converge to the equilibrium! So, is an asymptotically stable equilibrium.
For , we perform a similar process, and linearize the system to obtain matrix
Giving us eigenvalues . Because there is a positive eigenvalue, not all points will stay near the equilibrium, and the equilibrium is unstable.
Example: Stability of Non-Linear Equilibrium
Consider non-linear differential system
We find the equilibrium points
Additionally, we find the Jacobian by taking the partial derivatives of functions and .
Now, we perform a case analysis to determine the stability of the points.
When is even, we obtain the Jacobian matrix
With eigenvalues , and as at least one is positive, these equilibrium points are unstable.
When is odd, we obtain the Jacobian matrix
With eigenvalues , and as all eigenvalues have negative real parts, these equilibrium points are asymptotically stable.
Orbits and the Phase Plane
Orbits and Sinks/Sources
Take 2-dimensional autonomous system
We will mainly work with 2-dimensional systems here, as higher dimensions are just too complicated!
We define the orbit of a solution as the path a solution takes over some time interval. Furthermore, we define an orbit as closed (periodic solution) when it equals itself on two separate time periods.
While both orbits and solutions describe the path, the solution tells us exact position at a time, whereas an orbit cannot!
We also use this definition of an orbit for further definitions of equilibrium points.
Given an equilibrium point, if orbits drift towards the point, it is a sink, and if orbits drift away from the point, it it is a source.
Otherwise, if an equilibrium is both a sink and source, it is a saddle.
Determining an orbit is fairly easy! Observe the following:
Thus, we just need to solve to know find our slope at any point , which can be traced to give us our orbit!
We may also be able to solve the resulting equation to obtain an ellipse curve, telling us the path shape taken by all orbits!
However, this method is not the only method to determine orbits!
Given any point , we guarantee the existence of an orbit by the following theorem:
Existence and Uniqueness: Autonomous Systems (2-Dimensional)
Say we have autonomous system
where are continuously differentiable on .
Then, for any point on , there exists one and only one solution with .
This theorem generalizes to dimensions!
Existence and Uniqueness: Autonomous Systems (n-Dimensional)
Say we have autonomous system given by
Suppose that the partial derivatives of , given by , are all continuous on some open set .
Then, for any , and for any point , there exists one and only one solution defined on some open interval containing such that
This theorem also guarantees that periodic solutions obey closed curves. Otherwise, if we have periodic solution
which does not obey a closed curve, there would be multiple other solutions starting at the same point, which violates our theorem!
This can be formalized with the following theorem.
Theorem: Uniqueness of Orbits
Say we have autonomous system given by
Suppose that the partial derivatives of , given by , are all continuous on some open set .
Then, distinct orbits do not intersect - they cannot share the same points!
Furthermore, if the orbit of some solution a simple closed curve, equaling itself at some timeand furthermore, does not contain an equilibrium point, then must be a periodic.
Proof (Intuition) .
Suppose we have two distinct orbits which sharing a point
Then, we can define these orbits such that at some time , they’re both at that point, violating the existence and uniqueness theorem!
Orbits of Linear Systems
Just like before, we will first figure out how to determine the orbits for linear systems, and then generalize this to non-linear systems.
Consider a linear system given by
where is a constant matrix.
Note that if we have an eigenvector to matrix , then we can find its solution as
and because is a scalar value changing with time, ‘s direction is preserved, giving us a linear orbit along the eigenvector! Furthermore, the sign of tells us the direction of this orbit!
This is a key observation! Eigenvectors and eigenvalues can tell us the location and direction of linear orbits, which we can use to determine the other orbits!
Observe the following examples of orbits.
Example: Sink
We find the following eigenvalues, with corresponding eigenvectors
For these eigenvectors, we see we have solutions
and thus, see that for any eigenvector (or multiple of an eigenvector), the orbits converge to the origin in a linear fashion as .
Furthermore, we see that these solutions form a general solution
and when , we obtain a point not on the axes. Noting that
we see that as , all other orbits converge to the origin in a parabolic fashion!
Note that if our eigenvalues were flipped to be positive, we would have the exact same scenario, but with diverging orbits!
Also note that the parabolas asymptote towards the smaller eigenvalue!
Example: Saddle
We find the following eigenvalues, with corresponding eigenvectors
For these eigenvectors, we see we have solutions
However, unlike the previous example, the orbits diverge along one eigenvector, yet converge along the other! So, our orbits follow the approximate paths:
Example: Circular Orbits
We find eigenvalues , giving us solutions and .
Solving for the general solution, we find NFSoS to the respective linear differential equation
and use it to find
which is actually the rotation matrix!
So, given any initial points , we have an orbit given by solution
in other words, all orbits are simply clockwise circular orbits of some radius about the origin.
Note that for matrix with purely imaginary eigenvalues, we would have similar results!
Example: Inward Spiral
We find eigenvalues , giving us solutions and . We use this to find a general solution
So, for any initial position , we see that our orbit is a spiral inwards towards the origin!
Note that if the real part of our eigenvalues were positive, we would have had the exact opposite case - a spiral outwards!
In fact, from the above examples, we can note the following rules:
Theorem: Orbits and Linear Systems (2 Dimensional)
Say we have a linear system given by
with characteristic polynomial . Let and be the eigenvalues for , derived from . Then,
If are both real, and
- Both are positive, then the equilibrium is a source, and all orbits diverge parabolically (or linearly at the eigenvectors).
- Both are negative, then the equilibrium is a sink, and all orbits converge parabolically (or linearly at the eigenvectors).
- They are opposite signs, then the equilibrium is a saddle, and orbits converge along the negative eigenvalue, and diverge along the positive eigenvalue.
If are both real, and
- is diagonalizable, then all solutions either converge (if negative) or diverge (if positive) from the origin linearly.
- is not diagonalizable, then all solutions either converge (if negative) or diverge (if positive) from the origin parabolically, along ‘s eigenvector.
If are imaginary with the form , and
- , then all orbits are circles about the origin.
- , then all orbits follow a stable (converging) spiral.
- , then all orbits follow an unstable (diverging) spiral.
We use this theorem alongside the fact that the characteristic polynomial of a matrix can be given as
where and by the trace and determinant of , respectively. This gives us roots (eigenvalues)
Then, if , the eigenvalues are real, and
- If , the eigenvalues must have opposite signs.
- If , the eigenvalues have the same sign, and are negative if is negative, and positive if is positive.
Otherwise, if , the eigenvalues are complex, and can be expressed in the form .
We can use this fact, and trace a graph for and , with the behavior of orbits.

Orbits of Non-Linear Systems
Consider a non-linear differential system given by
how can we determine the orbits of this differential system?
We can use what we know for linear systems! Given some equilibrium point, we can determine the behavior of orbits around that equilibrium, which can be merged (approximately) with the orbits of other equilibrium!
So, given a non-linear differential system, we want to
- Find the equilibrium points
- Linearize the system near these equilibrium points
- Use this linearized system to trace the orbits
Let’s see an example below!
Example: Orbits and Non-Linear Systems
Suppose we have non-linear differential system
Trace the orbits of the system.
To do this, we will first find our equilibrium points, by setting the derivatives to 0.
We find points , .
Now, let’s linearize the system near these equilibrium points. We find Jacobian matrix
and use this to linearize the system.
For , we get Jacobian
Giving us eigenvalues , and because all eigenvalues are negative, points near the equilibrium take on some spiral inwards.
For , we find Jacobian
Giving us eigenvalues , and because there is a positive and negative eigenvalue, the equilibrium point is a saddle.
We now find the eigenvectors to see where the orbits converge and diverge,
where orbits will converge along , and diverge along .
We use this to sketch a graph of the orbits! Note how the orbits will approximately take on the behavior of the equilibrium they are near.
Periodic Solutions
Limit Cycles
While we are interested in finding the orbits of an autonomous system, oftentimes we are interested in its closed orbits.
We define a limit cycle as an orbit of a periodic solution, taking on some simply closed curve (a closed curve that does not intersect itself).
Because the curve does not intersect itself, it has a defined tangent along every point!
Furthermore, a limit cycle is stable if points near it spiral towards the orbit. In other words, points inside the orbit should spiral outwards, and points outside the orbit should spiral inwards.
If only one spirals to the limit cycle while the other does not, it is semi-stable. Otherwise, it is unstable.
How do we know if a system does (and does not) have limit cycles?
Determining Limit Cycles
We will use vector fields to know if a system has (or does not have) limit cycles!
Given autonomous system
we have a vector field , given by
tell us the velocity of the particle motion.
Given this vector field, we can prove the existence of a limit cycle using the following theorem:
Theorem: Poincare-Bendixson
Consider two simple closed curves, and , where is enclosed by . Define as the region between and . Suppose contains no equilibrium points.
Let be a vector field on . Then, if
- On all points of the inwards curve , points outwards
- On all points of the outwards curve , points inwards
there exists a limit cycle inside .
Intuition has no equilibrium points, no points will ever stop inside .
We know that because
Thus, if all points are pushed inwards from , and outwards from , there must necessarily be a curve where these “pushing forces” cancel one another out!
To prove a limit cycle, we find and explicitly show two curves , satisfying this theorem!
Example: Proving Existence
Consider autonomous system given by
Prove there is a limit cycle in this system.
We find the vector field as
Now, observe that given position , we can find a tangent vector to the position as
Plugging this into our equation, we obtain
We use this equation to find the curves satisfying our theorem.
For , let’s choose a circle of radius . Then,
so, along this entire circle, the vector field is pointing inwards!
For , let’s choose a circle of radius . Then,
so, along this entire circle, the vector field is pointing outwards!
Finally, we see that in the region , is never 0, so there are no equilibrium points!
Thus, by the Poincare-Bendixson Theorem, we know in the region given by
there must exist a periodic solution.
Example: Proving Existence (2)
Consider autonomous system
We know our orbits are given as
they are circles!
Let’s see another way to determine if they are circular orbits.
Given a point , we define its distance from the origin as
taking its derivative, we obtain
so, our distance never changes!
Furthermore, as we see that is our only equilibrium point, it must be true that these curves are periodic solutions!
Alternatively, we can disprove the existence of a limit cycle using the following theorems.
Theorem: Bendixson-Criterion
Suppose region is a closed bounded region which is simply connected.
Suppose is never 0 on . Then, does not contain any closed orbits.
Proof , which we'll name .
Suppose by way of contradiction that we have a closed orbit in
Because is a closed curve, by Green’s theorem we know that
Because and are never 0 on , we know our integral is either always either positive or negative. But,
is always 0, as this integral is over the curve, giving us a contradiction!
Theorem: Closed Orbits and Equilibriums
Any closed orbit contains an equilibrium point in its interior.
Thus, if a closed region does not have any equilibrium points, there cannot be any closed orbits!
Example: Proving Nonexistence
Consider autonomous system given by
where are scalar values.
We know by the Bendixson-Criterion Theorem, if
we have no periodic orbits!
Interestingly enough, as this is also a linear system, we find characteristic polynomial
to find roots
We know that if , we cannot have any periodic orbits, as there are no strictly imaginary eigenvalues! This agrees with our earlier finding!




