# Edit Create an Image Page: Systems of Linear Differential Equations

To create an image page, simply complete the form below and then hit the 'Save Page' button at the bottom of the form. As you complete the form, remember that one of the main goals of the Math Images Project is to provide explanations of the images on our site at various levels, so that everyone can understand some of the math behind the images. Try to complete the form as fully as possible, but remember that other users will have the opportunity to add more information to your image pages in the future. Also, please note that by contributing to the Math Images Project, you agree to comply to the guidelines as stated in our general disclaimer.

As always, thank you for your contributions! --The Math Images Project

If you need help filling out this page, please consult our Help sections: Want to Contribute and Math Resources.

Note: * Indicates a required field.

Please note: When you are filling in the below explanations, you should feel free to use standard wikitext.

 Image Title*: Upload a Math Image Differential equations have always been a popular research topic due to their various applications. A system of linear differential equations is no exception; it can be used to model arms races, simple predator prey models, and more. In 1945, the United States dropped atomic bombs on the Japanese cities Hiroshima and Nagasaki, ending World War II and establishing itself as a new superpower. The Soviet Union, while an ally of the United States during WWII, feared the bomb and spent the next few years developing their own atomic bomb, finally detonating their first nuclear weapon in 1949. This marked the beginning of a long and expensive arms race between the two powers. The competition for nuclear might, along with the countries' different ideologies (communism vs. capitalism), caused a political and psychological war during the second half of the 20th century, now known as the Cold War. During this period, both powers invested tremendous resources into their technology and weaponry, worried that the other was pulling ahead. We will attempt to build a simple model to see the effects of the nuclear arms race. What type of model would fit best? Consider these two images. [[Image:US_spending.JPG|thumb|Figure 1|700px|center]] [[Image:Soviet_spending.JPG|thumb|Figure 2|700px|center]] Note that, starting in 1947, the Soviet Union rapidly increased its defense spending (Figure 2). The United States responded in kind beginning in 1948 (Figure 1). From that point on, the spending of the two powers pushed and pulled, staying within a fairly narrow range (the two higher points of United States defense spending around 1953 and 1968 are related to the Korean and Vietnam Wars). These fluctuating changes are connected with each power's analysis of both its own defense spending and that of the other power. The more the United States is already spending on defense, the less willing it is to spend on defense the following year. However, the more the Soviet Union spends on defense, the more likely the United States will be to increase its defense spending to not be left behind. With this dynamic, we can analyze the defense spending of each country by analyzing the '''change''' in defense spending from year to year. Since derivatives are the mathematical tool to analyze change, we will build our model around derivatives. Let ''x''(''t'') and ''y''(''t'') be the defense spending of the United States and the Soviet Union respectively at time ''t'' (in years). Then ''x''′(''t'') is the derivative of ''x'' over ''t'' and it represents how much the U.S. spending changes over ''t'' years. Likewise, ''y''′(''t'') is the derivative of ''y'' over ''t'' and it represents how much the Soviet spending changes over ''t'' years. As mentioned above, the rate of U.S. defense spending depends negatively on its current defense spending and positively on the Soviet Union's current defense spending. Correspondingly, the rate of Soviet defense spending depends negatively on its current defense spending and positively on the United States's current defense spending. The model's starting point is the year in which the arms race started, when ''t'' = 0. Let ''x''0 and ''y''0 be the ''initial''(''t'' = 0) defense spending of the United States and the Soviet Union respectively The following equations fit these conditions. :$x'(t) = ax(t) + by(t)\quad\quad\quad x(0) = x_0$ , where ''a'' is negative and ''b'' is positive. :$y'(t) = cx(t) + dy(t)\quad\quad\quad\, y(0) = y_0$ , where ''c'' is positive and ''d'' is negative. This is a linked system of first order linear differential equations. In other words, equation ''x''′(''t'') states that the United States lowers its budget by ''a'' dollars for every dollar it spent the previous year, and raises it by ''b'' dollars for every dollar in the Soviet Union's budget. Equation ''y''′(''t'') states that the Soviet Union lowers its budget by ''d'' for every dollar it spent the previous year, and raises it by ''c'' dollars for every dollar in the United States's budget. Note: We must use our model with a degree of skepticism because there are far more factors affecting the arms race than just the two countries' defense spending, such as available money/resources and the spending requirements of other important programs. Nevertheless, our model is useful for analyzing the general outline of the Cold War arms race and predicting its outcomes. ===Introduction to Systems of Linear Differential Equations=== We clarify a few '''terms''': *A '''differential equation''' is an equation that contains both function(s) and their derivatives. *A''' ''nth'' order''' differential equation only involves up to the ''nth'' derivative of any function. *A '''linked system''' of differential equations has at least one function or derivative that is found in at least two equations in the system. *The expressions of '''linear equations''' are [http://en.wikipedia.org/wiki/Linear_combinations linear combinations] of functions. Each equation in our system is a linear combination of functions ''x''(''t'') and ''y''(''t'') and both have one derivative of either ''x'' or ''y''. Hence we have a linked system of first order linear differential equations. We can use eigentheory to solve for any system of first order linear differential equations. Indeed, the outcome of our nuclear arms race model depends on the eigenvalues (read the More Mathematical Explanation for details). ==Solving the Two Dimensional System== In order to understand how a system of linear differential equations is useful in making sense of the Cold War Arms Race, we first need to understand the general system. The general system of linear differential equations in two dimensions is :$x'(t) = ax(t) + by(t) \quad\quad\quad x(0) = x_0$ :$y'(t) = cx(t) + dy(t) \quad\quad\quad\, y(0) = y_0$. Since we are solving the general system, the coefficients ''a'', ''b'', ''c'', and ''d'' are elements of ALL numbers (including imaginary numbers). We can write this system with [[Matrix|matrices]] in the form :$\vec{u}'=A\vec{u}$,    where     $A=\begin{bmatrix} a & b \\ c & d \end{bmatrix}$,     $\vec{u} = \begin{bmatrix} x \\ y \end{bmatrix}$,    and     $\vec{u}' = \begin{bmatrix} x' \\ y' \end{bmatrix}$. In order to gain an understanding on how to solve this equation, we consider the one dimensional case. ===The One Dimensional Case=== If the two dimensional case involved the equation :$\vec{u}' = A\vec{u}$ with ''A'' a 2x2 matrix, then the ''A'' in the equation of the one dimensional case must be a 1x1 matrix, or just a constant. Consequently, $\vec{u}$ will actually be ''u'' instead; it is no longer a vector. Hence the one dimensional equation is :$u' = ku$, where ''k'' is a real number. Solving this requires basic knowledge of calculus. We can write this as :$u' = \frac{du}{dt} = ku$ (remember that ''u'' is a function of ''t'') :$\frac{1}{u} du = kdt$ (rearranged variables). Integrate both sides: :$\int \frac{1}{u} du = \int kdt$ :$ln(u) = kt + c$ :$e^{ln(u)} = e^{kt+c}$ :$u = e^{kt}e^{c}$ :$u = Ce^{kt}$. (So ''C'' = ''ec''.) Now we can apply the initial condition. Note that :$u(0) = C(1) = C$, so ''u''(0) = ''C''. Thus the solution to the one dimensional case is :$u(t) = u_0e^{kt}$. ===Back to the Two Dimensional System=== The solution to the one dimensional case suggests that the solution to $\vec{u}' = A\vec{u}$ is $\vec{u}(t) = e^{At}\vec{u}_0$. We will explore the concept of raising ''e'' to a matrix later. Since the solution to the one dimensional case is ''u'' = ''Cekt'', a good guess of the solution to the two dimensional case is $\vec{u}(t) = \vec{v} e^{\lambda t}$ for some scalar λ and vector $\vec{v} = \begin{bmatrix} p \\ q \end{bmatrix}$. We plug our guess, where $\begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} e^{\lambda t} p \\ e^{\lambda t} q \end{bmatrix}$, into the original equations and find λ and $\vec{v}$ that work. We verify our guess by plugging it into our original system: :$x'(t) = p \lambda e^{\lambda t} = ap e^{\lambda t} + bq e^{\lambda t}$ :$y'(t) = q \lambda e^{\lambda t} = cp e^{\lambda t} + dq e^{\lambda t}$ After we divide by ''eλt'' (which is never 0), we can rewrite this system as $\lambda \vec{v} = A \vec{v}$. Thus, our guess is correct if and only if λ is an [[Eigenvalues and Eigenvectors|eigenvalue]] and $\vec{v}$ is an [[Eigenvalues and Eigenvectors|eigenvector]] of ''A''. Now we must account for the fact that a 2x2 matrix can have two eigenvalues, λ1 and λ2. Since differentiation is a linear operator, we know that the solution to our system is linear. We write the general solution as a linear combination :$\vec{u} = e^{\lambda_1 t} \vec{v}_1 + e^{\lambda_2 t} \vec{v}_2 . We now apply our initial condition. When ''t'' = 0, our general solution becomes :[itex] \vec{u}(0) = \vec{v}_1 + \vec{v}_2$. It is rare that $\vec{v}_1$ and $\vec{v}_2$ add up to the initial condition, so how do we solve this? Based on the solution to the one dimensional system, we hope to multiply the two vectors by real number constants ''c''1 and ''c''2. We must first check that this still works for our system. {{SwitchPreview|HideMessage=Click here to hide the verification!|ShowMessage=Click here to show the verification! |PreviewText=|FullText= By multiplying constants to each term of our general solution, our new proposed solution is :$\vec{u} = c_1 e^{\lambda_1 t} \vec{v}_1 + c_2 e^{\lambda_2 t} \vec{v}_2$. We verify this by plugging it into our matrix equation $\vec{u} = A\vec{u}$. :$\vec{u}' = \lambda_1 c_1 e^{\lambda_1 t} \vec{v}_1 + \lambda_2 c_2 e^{\lambda_2 t} \vec{v}_2$ :\begin{align} A\vec{u} &= A(c_1 e^{\lambda_1 t} \vec{v}_1 + c_2 e^{\lambda_2 t} \vec{v}_2) \\ &= A(c_1 e^{\lambda_1 t} \vec{v}_1) + A(c_2 e^{\lambda_2 t} \vec{v}_2) \text{ (Matrix multiplication is distributive.)} \\ &= c_1 e^{\lambda_1 t} (A \vec{v}_1) + c_2 e^{\lambda_2 t} (A \vec{v}_2) \text{ (Scalars pass through.)} \\ &= c_1 e^{\lambda_1 t} (\lambda_1 \vec{v}_1) + c_2 e^{\lambda_2 t} (\lambda_2 \vec{v}_2) \\ &= \lambda_1 c_1 e^{\lambda_1 t} \vec{v}_1 + \lambda_2 c_2 e^{\lambda_2 t} \vec{v}_2 \quad \blacksquare \end{align} In fact, multiplying constants by the terms is equivalent to finding a linear combination of our basis vectors $e^{\lambda_1 t} \vec{v}_1$ and $e^{\lambda_2 t} \vec{v}_2$. Remember that differentiation is a linear transformation, so linear combinations of existing solutions are solutions as well. }} Now that we have a more refined general solution, we need to know how to solve for the constants. Our initial condition now becomes :$\vec{u}(0) = \begin{bmatrix} x_0 \\ y_0 \end{bmatrix} = c_1\begin{bmatrix} p_1 \\ q_1 \end{bmatrix} + c_2\begin{bmatrix} p_2 \\ q_2 \end{bmatrix}$. We can rewrite this as :$\begin{bmatrix} p_1 & p_2 \\ q_1 & p_2 \end{bmatrix} \begin{bmatrix} c_1 \\ c_2 \end{bmatrix} = \begin{bmatrix} x_0 \\ y_0 \end{bmatrix}$, which can be solved using Gaussian elimination. Thus we have our particular solution for any initial condition. With the constants solvable, our general solution is :$\vec{u} = c_1 e^{\lambda_1 t} \vec{v}_1 + c_2 e^{\lambda_2 t} \vec{v}_2$. ==Arms Race Example== We will solve a system that follows the rules of our arms race model. Since all the variables of the real Cold War arms race are hard to model, we will make assumptions about the actions of the United States and the Soviet Union. Assume that the United States lowers its budget by 3 dollars for every dollar it spent the previous year, and raises it by 6 dollars for every dollar in the Soviet Union's budget. Further assume that the Soviet Union lowers its budget by 2 dollars for every dollar it spent the previous year, and raises it by 5 dollars for every dollar in the United States budget. Finally, assume that the United States defense spending is 130 billion dollars and the Soviet Union defense spending is 150 billion dollars at ''t'' = 0. :$x'(t) = -3x(t) + 6y(t) \quad\quad\quad x(0)=13$ :$y'(t) = 5x(t) - 2y(t) \quad\quad\quad\;\;\; y(0)=15$. The values of ''x'' and ''y'' are in tens of billions of dollars. All of the constants are made up, but they let us study how this hypothetical situation would develop. We can rewrite this as :$\begin{bmatrix} x' \\ y' \end{bmatrix} = \begin{bmatrix} -3 & 6 \\ 5 & -2 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix}$. [[Eigenvalues and Eigenvectors#Eigenvalues|To find the eigenvalues]] of ''A'', remember that λ is an eigenvalue if and only if the determinant of (''A'' - λ''I'') is 0: :\begin{align} |A-\lambda I| &= \begin{vmatrix} -3-\lambda & 6 \\ 5 & -2-\lambda \end{vmatrix} \\ &= (-3-\lambda)(-2-\lambda) - 30 \\ &= \lambda^2 + 5\lambda - 24 \\ &= (\lambda + 8)(\lambda - 3) = 0 \end{align} So our eigenvalues are λ = -8, 3. Using the eigenvalues, [[Eigenvalues and Eigenvectors#Eigenvectors|find the eigenvectors]]: :For λ1 = -8: $A-\lambda I = \begin{bmatrix} 5&6 \\ 5&6 \end{bmatrix}$, so $\vec{v}_1 = \begin{bmatrix} -6 \\ 5 \end{bmatrix}$. :For λ2 = 3: $A-\lambda I = \begin{bmatrix} -6&6 \\ 5&-5 \end{bmatrix}$, so $\vec{v}_2 = \begin{bmatrix} 1 \\ 1 \end{bmatrix}$. Now we will find the constants for our initial condition. Remember that we can use Gaussian elimination to find them. :Start with $\left[\begin{array}{rr|r} -6 & 1 & 13 \\ 5 & 1 & 15 \end{array}\right]$, after Gaussian elimination --> $\left[\begin{array}{rr|r} 1 & 0 & \frac{2}{11} \\[6pt] 0 & 1 & \frac{155}{11} \end{array}\right]$, so ''c''1 = 211 and ''c''2 = 15511. Finally, we just plug all of our values back into our general solution to get our particular solution. :$\vec{u} = \begin{bmatrix} x \\ y \end{bmatrix} = \frac{2}{11} e^{-8t} \begin{bmatrix} -6 \\ 5 \end{bmatrix} + \frac{155}{11} e^{3t} \begin{bmatrix} 1 \\ 1 \end{bmatrix}$ Thus we have the equations :$x(t) = \frac{-12}{11} e^{-8t} + \frac{155}{11} e^{3t}$ :$y(t) = \frac{10}{11} e^{-8t} + \frac{155}{11} e^{3t}$. These equations satisfy both the system of differential equations and the initial condition (check if doubtful). We can now use these equations to help analyze the results of our hypothetical arms race. The results will happen many years later, so we can get a good estimate by taking the limit of ''x''(''t'') and ''y''(''t'') as t goes to ∞. As ''t'' gets larger, ''e''-8''t'' becomse a smaller and smaller fraction, but ''e''3''t'' grows exponentially without bound in both equations. So: :$\lim_{t \to \infty}x(t) = \infty$ (does not exist) :$\lim_{t \to \infty}y(t) = \infty$ (does not exist) The results of this hypothetical arms race are disastrous; they indicate that tensions between the United States and Soviet Union will cause the arms race to spiral out of control, with both countries investing more and more of their resources in defense. The outcome of that is the economic collapse of at least one of the two powers. Thus, both countries should lessen the military and nuclear competition to avoid national turmoil. We can represent our arms race example visually: [[Image:Arms_race2.JPG|thumb|Figure 3|700px|center]] This is a vector field of all the paths in our made up model. The horizontal axis represent U.S. defense spending, and the vertical axis represent Soviet defense spending. In order to find the solution path for our initial condition, find the point (13, 15) on the plot and follow the arrows. While the vector field of all four quadrants is displayed, we are mainly interested in the first quadrant; it makes no sense for either country to have negative defense spending. Note that regardless of where the initial condition is in the first quadrant, the arrows lead to positive infinity. This is an ''unstable'' system, or a system that will diverge without bound. Mathematically, the only factors that determine the stability of a system are its eigenvalues (more about this later). Figure 3 also shows the vital role of the eigenvectors. Using Geometer's Sketchpad, we calculated the slopes of the two predominant lines. Line ''AC'' corresponds to $\vec{v}_1 = \begin{bmatrix} 1 \\ 1 \end{bmatrix}$; we know this because the line and eigenvector share the same slope. Similarly, line ''AB'' corresponds to $\vec{v}_2 = \begin{bmatrix} -6 \\ 5 \end{bmatrix}$, which we know because the line and eigenvector share the same slope of 5-6, or -0.833. These eigenvectors dictate the possible paths our model will follow given different initial conditions. ==The Complex Eigenvalue Case== So far, we have explored systems with real eigenvalues. Now we will investigate a system that contains [[Complex Numbers|complex]] eigenvalues. In physics, springs are modeled by an equation known as Hooke's law. In an ideal environment (no air resistance, no friction, no heat generated by movement, etc.), an object of mass ''m'', when set into motion attached to a spring, should oscillate forever. Hooke's law states that the mass's displacement ''x'' from the equilibrium position, and the force ''F'' the spring exerts on the mass at time ''t'' is linearly related to ''x'' by ''k'', the spring constant. This constant quantifies the stiffness of the spring. Furthermore, this linear relationship is negative; the force is acting in a direction opposite of the displacement. We can write Hooke's law as :$F = -kx$. We combine Hooke's law with Newton's second law of motion, ''F'' = ''ma'', to get :$F = ma = -kx$, so $a = -\frac{k}{m} x$. Remember that acceleration ''a'' is the second derivative of displacement ''x''. Thus we observe that Hooke's law is actually the differential equation :$x'' = -\frac{k}{m} x$. For the sake of simplicity, we assume ''k'' = ''m'' = 1. The only function in our differential equation is the displacement ''x'', and it's a function of time ''t''. The goal is to find the equation for ''x'' in terms of ''t''. Note that our equation is actually a '''second order''' differential equation. So how do we solve this? We transform the equation into two first order differential equations by introducing a dummy variable ''y''. Set $y = x'$, so $x'' = y' = -x$. In physics, ''y'' is the velocity of the mass at time ''t''. The derivative of displacement is velocity. At time ''t'' = 0, the displacement is ''x''0 and the velocity is always 0 (the velocity of the mass the instant it is released is 0). Now we have the system of first order linear differential equations :$x' = y \quad\quad\quad x(0) = x_0$ :$y' = -x \quad\quad\, y(0) = 0$. From here, solving this is the same as solving any other system of first order linear differential equations. We write this as the matrix equation :$\vec{u}' = \begin{bmatrix} x' \\ y' \end{bmatrix} = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = A \vec{u}$. Solve for the eigenvalues of ''A'': :$|A-\lambda I| = \begin{vmatrix} 0-\lambda & 1 \\ -1 & 0-\lambda \end{vmatrix} = \lambda^2 + 1 = 0$ So our eigenvalues are λ = ''i'', -''i''. Using these eigenvalues, we find the eigenvectors. :For λ1 = ''i'': $A-\lambda I = \begin{bmatrix} -i & 1 \\ -1 & -i \end{bmatrix}$, so $\vec{v}_1 = \begin{bmatrix} 1 \\ i \end{bmatrix}$. :For λ2 = -''i'': $A-\lambda I = \begin{bmatrix} i & 1 \\ -1 & i \end{bmatrix}$, so $\vec{v}_2 = \begin{bmatrix} 1 \\ -i \end{bmatrix}$. Now we will find the constants for our initial condition. Since we do not have a specific starting value for ''x'', we will solve the system of equations instead of use Gaussian Elimination. When ''t'' = 0, we have :$x(0) = x_0 = c_1 + c_2$ and $y(0) = 0 = ic_1 - ic_2$. Looking at the second equation, we see that since ''ic''1 = ''ic''2, ''c''1 = ''c''2. Since the constants are equal, we will just call both constants ''c''. We plug this into the first equation and we get ''x''0 = 2''c'', so ''c'' = ''x''02. Our general solution is then :$\vec{u} = \begin{bmatrix} x \\ y \end{bmatrix} = \frac{x_0}{2} \left(e^{it} \begin{bmatrix} 1 \\ i \end{bmatrix} + e^{-it} \begin{bmatrix} 1 \\ -i \end{bmatrix} \right)$. Remember that we are only interested in ''x'', the displacement of the mass. The general equation for ''x'' is :$x(t) = \frac{x_0}{2}(e^{it}+e^{-it})$. Our solution still has complex numbers. We use [[Euler's Formula]] to understand what raising ''e'' to complex numbers means. Euler's formula states :$e^{ix} = \cos x + i\sin x$ for any ''x''. We now use Euler's formula in the equation for ''x'': :\begin{align} x(t) &= \frac{x_0}{2}(e^{it}+e^{-it}) \\ &= \frac{x_0}{2}(e^{it}+e^{i(-t)}) \\ &= \frac{x_0}{2}(\cos t + i\sin t + \cos(-t) + i\sin(-t)) \\ &= \frac{x_0}{2}(\cos t + i\sin t + \cos t - i\sin t) \text{ *}\\ &= \frac{x_0}{2}(2 \cos t) \\ &= x_0 \cos t \text{.} \end{align} :*Recall that cos(-''x'') = cos(''x'') and sin(-''x'') = -sin''x''. The form of our solution is a constant multiplied by a function, quite similar to the real eigenvalue case. The main difference is the function; the function for the complex eigenvalue case is trigonometric while the function for the real eigenvalue case is exponential. This provides insight to the nature of complex numbers. Complex numbers might not be so "imaginary" after all; they seem to reside in a realm parallel to real numbers. Just like with real eigenvalues, we can use a vector field to visualize our solution: [[Image:Complex_eigenvalue.JPG|thumb|Figure 4|700px|center]] This solution is very interesting. Unlike the arms race model, we are interested in all four quadrants, since velocity and displacement can be negative. Note that regardless of where we start (except the origin), we will just orbit the origin in a perfect circle. Does that make sense? In an ideal spring system, the mass moves back and forth forever. Furthermore, the displacement and the velocity are negatively related. The velocity is at a maximum when the displacement is 0, and the displacement is at a maximum when the velocity is 0. Note that the vector field portrays both properties. Analyzing the stability of the system, the system does not move toward zero, but neither does it go to infinity. We call this type of system ''neutrally stable'': ''neutrally'' because it doesn't approach the origin and ''stable'' because it doesn't reach infinity. The different stabilities of the arms race model and Hooke's law give more insight into how important eigenvalues are to the stability of a system. ==Stability of the Two Dimensional System== We judge the stability of a system by what happens as time approaches infinity. Each system also has an '''equilibrium point'''. In our arms race example and the complex eigenvalue example, the '''equilibrium point''' is just the origin (in most cases it's the origin). An '''unstable''' system will approach infinity as time approaches infinity, and a '''stable''' system will not. There are two types of stable systems: '''asymptotically stable''' systems and '''neutrally stable''' systems. Neutrally stable systems orbit in a closed path around the equilibrium point (like Hooke's law). Asymptotically stable systems approach the equilibrium point as time approaches infinity. The arms race example that we worked through is a case of an unstable system with a '''saddle equilibrium point'''. As mentioned above, the eigenvalues of a system are the only things required to determine the system's stability. We use our arms race example to help explain this. Since we judge the stability of a system by what as when time approaches infinity, we can take the limit of our solution as time approaches infinity. Note that the only factors that affect the outcome of the solution (whether it converges or diverges) are the exponents on the ''e''′s, and the exponents of the ''e''′s are based on the eigenvalues. Thus, we can explore the relationship between the eigenvalues of our system and its stability. For a 2x2 matrix, [[Eigenvalues and Eigenvectors#Another way of writing the Characteristic Polynomial|another way of writing the characteristic polynomial]] is :$\lambda^2 - \text{tr}A\lambda + \text{det}A = 0$. Thus we know by the quadratic formula that :$\lambda_1 = \frac{1}{2} \left( trA + \sqrt{(trA)^2 - 4detA} \right)$ :$\lambda_2 = \frac{1}{2} \left( trA - \sqrt{(trA)^2 - 4detA} \right)$. With these in mind, we will analyze each type of stability and derive inequalities for λ in terms of det''A'' and tr''A''. ===Stable Systems=== ====Asymptotically Stable==== For asymptotically stable systems, we want the system to approach the equilibrium point. That means we want the real component of our eigenvalues to be negative. Note that tr''A'' must be negative. For the real eigenvalue case, we look at λ1 because if the real component of λ1 is negative, then the real components of λ2 is negative as well. We observe :$\lambda_1 = \frac{1}{2} \left( \text{tr}A + \sqrt{(\text{tr}A)^2 - 4\text{det}A} \right)<0$ :$\text{tr}A < -\sqrt{(\text{tr}A)^2 - 4\text{det}A}$ :$(\text{tr}A)^2 > (\text{tr}A)^2 - 4\text{det}A$ (Squared both sides, note that since tr''A'' < 0, the inequality sign changes.) :$\text{det}A > 0$. This condition also works for the complex eigenvalue case since det''A'' must be greater than 0 in order for the eigenvalues to be complex. The only difference between real and complex eigenvalues otherwise is how they converge to the equilibrium point. For complex eigenvalues, the vector field spirals into the equilibrium point. For real eigenvalues, the vector approaches the equilibrium point in some other curve. Regardless, we conclude that a system is asymptotically stable if and only if det''A'' > 0 and tr''A'' < 0. ====Neutrally Stable==== Hooke's law is an example of a neutrally stable system. A property of a neutrally stable system is that it must have purely imaginary eigenvalues. The existence of a real number within the eigenvalues causes the system to approach either the equilibrium point or infinity. In order to have purely imaginary eigenvalues, we must have tr''A'' = 0 and the expression under the square root to be less than zero. Since tr''A'' = 0, we have -4det''A'' < 0, so det''A'' > 0. Thus a system is neutrally stable if and only if det''A'' > 0 and tr''A'' = 0. ===Unstable Systems=== Unstable systems approach infinity as time passes, so the real component of the eigenvalue must be positive. We look at λ2 this time since if the real component of λ2 is positive, the real component of λ1 is positive as well. For the real eigenvalue case, we have :$\lambda_2 = \frac{1}{2} \left( \text{tr}A - \sqrt{(\text{tr}A)^2 - 4\text{det}A} \right) > 0$ :$\text{tr}A > \sqrt{(\text{tr}A)^2 - 4\text{det}A}$ :$(\text{tr}A)^2 > (\text{tr}A)^2 - 4\text{det}A$ (Squared both sides. Since both are positive, no need to change inequality sign.) :$\text{det}A > 0$. We get the same result as the asymptotically stable case (except tr''A'' > 0, and we stated before that this condition also holds for the complex eigenvalue case. Thus a system is unstable if and only if det''A'' > 0 and tr''A'' > 0. ====Saddle Point==== A special case arises when we observe the region around the equilibrium point and notice that half of the region is unstable and the other half is unstable. In this case, the equilibrium point is called a saddle point. The eigenvalues for this case are of opposite sign: one is positive and the other negative. Hence the eigenvalues must also be real, since complex eigenvalues cannot have different real components (tr''A'' is fixed). The arms race example is a great example of a saddle point. Observe that at the origin, the vectors from quadrant II and IV seem to be stable while the vectors from quadrant I and III seem to be unstable. Regardless of half the vector field seeming to be stable, we still characterize this case as unstable. Remember how in finding the limits of our solution, the result approached infinity. While the part of the expression with the negative eigenvalue converged to a number, the other part diverged to infinity, forcing the entire system toward infinity. Thus the only way for a saddle point system to be stable is for the initial condition to be a scalar multiple of the negative eigenvalue's eigenvector. Look at Figure 3 for what a system with a saddle point looks like. Unlike the previous few cases, tr''A'' has no obvious restriction. We split this into 3 cases: tr''A'' < 0, tr''A'' = 0, tr''A'' > 0. '''Case 1 (tr''A'' < 0)''' λ2 is always negative, so we focus on making λ1 positive. :$\lambda_1 = \frac{1}{2} \left( \text{tr}A + \sqrt{(\text{tr}A)^2 - 4\text{det}A} \right) > 0$ :$\sqrt{(\text{tr}A)^2 - 4\text{det}A} > -tA$ :$(\text{tr}A)^2 - 4\text{det}A > (\text{tr}A)^2$ (Squared both sides. Since -tr''A'' is positive, we do not need to change sign.) :$\text{det}A < 0$ The only condition for case 1 is det''A'' < 0. '''Case 2 (tr''A'' = 0)''' We rewrite λ1 and λ2 taking into account tr''A'' = 0. :$\lambda_1 = \frac{1}{2} sqrt{-4\text{det}A}$ :$\lambda_2 = -\frac{1}{2} sqrt{-4\text{det}A}$ We need real numbers, so det''A'' = 0. With that condition, λ1 is automatically positive and λ2 is automatically negative. Thus the only condition for case 2 is once again det''A'' < 0. '''Case 3 (tr''A'' > 0)''' λ1 is always positive, so we focus on making λ2 negative. :$\lambda_2 = \frac{1}{2} \left( \text{tr}A - \sqrt{(\text{tr}A)^2 - 4\text{det}A} \right) < 0$ :$\text{tr}A < \sqrt{(\text{tr}A)^2 - 4\text{det}A}$ :$(\text{tr}A)^2 < (\text{tr}A)^2 - 4\text{det}A$ (Squared both sides. Since tr''A'' is positive, we do not need to change sign.) :$\text{det}A < 0$ The only condition for case 3 is det''A'' < 0. All three cases resulted in the same condition. Thus the '''only condition''' to create a saddle point is det''A'' < 0. ===Conclusion=== We summarize our findings here. The conditions for each case are listed below. Stable System :*Asymptotically stable: ''detA'' > 0 and ''trA'' < 0. :*Neutrally stable: ''detA'' > 0 and ''trA'' = 0. Unstable :*No saddle point: ''detA'' > 0 and ''trA'' > 0. :*With saddle point: ''detA'' < 0. We can use a graph to summarize all our results. [[Image:Capture.JPG|thumb|Figure 5|700px|center]] ==The More Rigorous Proof== {{SwitchPreview|HideMessage=Click here to hide the more rigorous proof.|ShowMessage=Click here to show the more rigorous proof. |PreviewText=Requires a competent understanding of infinite series, Taylor Series, and Matrix algebra.|FullText= We claimed above that the solution to $\vec{u}' = A\vec{u}$ is $\vec{u}(t) = e^{At}\vec{u}_0$. Using [[Taylor Series]], we define :$e^A = \sum_{n=0}^{\infty}\frac{A^n}{n!}$ for a ''k''×''k'' matrix ''A''. Note: ''A''0 = ''I''. Now we have to show that $\vec{u} = e^{tA}\vec{u}_0$ solves $\vec{u}'=A\vec{u}$: :\begin{align} \vec{u}' = \frac{d}{dt} (e^{tA} \vec{u}_0) & = \frac{d}{dt} \left( \left(\sum_{n=0}^{\infty}\frac{tA^n}{n!} \right) \vec{u}_0 \right) \\ & = \left( \frac{d}{dt}\sum_{n=0}^{\infty}\frac{t^nA^n}{n!} \right)\vec{u}_0 \text{ (}\vec{u}_0 \text{ is a constant)} \\ & = \left( \sum_{n=0}^{\infty} \frac{d}{dt} \left( \frac{t^nA^n}{n!} \right) \right) \vec{u}_0 \\ & = \left( \sum_{n=1}^{\infty}\frac{n t^{n-1} A^n}{n!} \right) \vec{u}_0 \text{ (Note the index change)} \\ & = \left( A \sum_{n=1}^{\infty} \frac{t^{n-1}A^{n-1}}{(n-1)!} \right) \vec{u}_0 \\ & = \left( A \sum_{j=0}^{\infty} \frac{(tA)^j}{j!} \right) \vec{u}_0 \\ & = Ae^{tA} \vec{u}_0 = A \vec{u} \quad \blacksquare \end{align}. So we know that $\vec{u} = e^{tA}\vec{u}_0$ solves $\vec{u}'=A\vec{u}$. But what does $e^{tA}\vec{u}_0$ mean? We use diagonalization. If the sum of the dimensions of a square [[Matrix|matrix]] ''A'''s eigenspaces is equal to dim(''A''), then we can write ''A'' as $A=PLP^{-1}$, where ''P'' has the eigenvectors of ''A'' as its columns and ''L'' is a diagonal matrix with the eigenvalues of ''A'' as its diagonal entries. The eigenvalues of ''A'' in ''L'' must match up with the eigenvectors in ''P'', meaning that if we choose a random eigenvector/column (say this is the ''k''th eigenvector/column) of ''P'', then the eigenvalue in the ''k''th column of ''L'' must correspond to that eigenvector. Let us first consider ''etA''. :\begin{align} e^{tA} = e^{t(PLP^{-1})} = e^{P(tL)P^{-1}} &= \sum_n \frac{(PtLP^{-1})^n}{n!} \\ &= \sum_n \frac{P(tL)^nP^{-1}}{n!} \text{ (Here we use } (PLP^{-1})^n = P(L)^nP^{-1} \text{, which is a property of diagonalization.)} \\ &= P \left(\sum_n \frac{(tL)^n}{n!} \right) P^{-1} \\ &= P \left(\sum_n \begin{bmatrix} (\lambda_1 t)^n/n! & & & \\ & (\lambda_2 t)^n/n! & & \\ & & \ddots & \\ & & & (\lambda_k t)^n/n! \end{bmatrix} \right) P^{-1} \\ &= P \begin{bmatrix} \displaystyle\sum\limits_{n} (\lambda_1 t)^n/n! & & & \\ & \displaystyle\sum\limits_{n} (\lambda_2 t)^n/n! & & \\ & & \ddots & \\ & & & \displaystyle\sum\limits_{n} (\lambda_k t)^n/n! \end{bmatrix} P^{-1} \\ &= P \begin{bmatrix} e^{\lambda_1 t} & & & \\ & e^{\lambda_2 t} & & \\ & & \ddots & \\ & & & e^{\lambda_k t} \end{bmatrix} P^{-1} \text{ (Remember Taylor Series.)} \end{align} Before we continue, consider $P^{-1}\vec{u}_0$. Remember in solving the two dimensional case, we made up constants ''c''1 and ''c''2 to satisfy the initial condition. For this more rigorous proof, we define :$\vec{c} = \begin{bmatrix} c_1 \\ c_2 \\ \vdots \\ c_k \end{bmatrix}$. We solve for the constants by knowing that $P \vec{c} = \vec{u}_0$, so $\vec{c} = P^{-1} \vec{u}_0$. Thus :\begin{align} e^{tA}\vec{u}_0 &= P \begin{bmatrix} e^{\lambda_1 t} & & & \\ & e^{\lambda_2 t} & & \\ & & \ddots & \\ & & & e^{\lambda_k t} \end{bmatrix} P^{-1}\vec{u}_0 \\ &= P \begin{bmatrix} e^{\lambda_1 t} & & & \\ & e^{\lambda_2 t} & & \\ & & \ddots & \\ & & & e^{\lambda_k t} \end{bmatrix} \vec{c} \\ &= P \begin{bmatrix} c_1 e^{\lambda_1 t} \\ c_2 e^{\lambda_2 t} \\ \vdots \\ c_k e^{\lambda_k t} \end{bmatrix} \\ &= \sum_{i=1}^k c_i e^{\lambda_i t} \vec{v}_i \text{ .} \end{align} When ''k'' = 2, note that this final expression expands into our two dimensional general solution. Thus the solution to any system of differential equations that can be written in the form $\vec{u}' = A\vec{u}$ is a linear combination of exponential functions with the eigenvectors and eigenvalues of ''A''. }} |WhyInteresting=We have shown how linear differential equations are applicable to many situations. They can model basic arms races and Hooke's law with a high degree of accuracy. We can use linear differential equations for any system that has derivatives and functions written as linear combinations of one another. Such systems include heat flow, bank interest, basic predator-prey models, and population through time. Through the Hooke's law case, we saw that our method for solving linear differential equations also works for second order equations. In fact, we can write any ''k'' order differential equation as a system of ''k'' first-order differential equations. Even if we ignore their applicability, linear differential equations are fascinating topics to study. They help show how differentiation is a linear transformation by writing the system as a matrix equation and deriving a linear combination as the solution. Furthermore, they emphasize the importance of eigentheory. Without eigentheory, we could not have solved the equations, much less determined the stability of our system. Eigentheory is not just a matrix stretching or shrinking a vector; it contains one of the core ideas of linear algebra - scalar multiplication. Coupled with one of the other core ideas of linear algebra - linear combinations - eigentheory is an essential tool for linear algebra and all of mathematics. |Field=Calculus |Field2=Dynamic Systems |other=Linear Algebra, Single Variable Calculus |References= |InProgress=Yes } Algebra Analysis Calculus Dynamic Systems Fractals Geometry Graph Theory Number Theory Polyhedra Probability Topology Other None Algebra Analysis Calculus Dynamic Systems Fractals Geometry Graph Theory Number Theory Polyhedra Probability Topology Other None Algebra Analysis Calculus Dynamic Systems Fractals Geometry Graph Theory Number Theory Polyhedra Probability Topology Other Yes, it is.