MathLabs

Differential equations and dynamical systems

Systems of differential equations

Coupled equations x′=Ax\mathbf{x}'=A\mathbf{x} solved via eigenvalues, revealing equilibrium stability.

IntuitionIntuition: two variables pulling on each other

A single differential equation tracks one changing quantity. But rabbits and foxes, voltage and current in a circuit, or the two coordinates of a swinging pendulum change together — the rate of change of each depends on the value of the other. Writing the unknowns as a vector x=(x,y)\mathbf{x}=(x,y) and the coupling as a matrix AA, every such linear system takes the compact form x′=Ax\mathbf{x}'=A\mathbf{x}. The matrix AA can be pictured as a small directed graph: one node per variable, one weighted edge per coupling coefficient.

Directed graph with two highlighted nodes and weighted edges representing a coupling matrix A.
Phase-plane trajectories of a coupled nonlinear system (Lotka–Volterra predator–prey cycles and linear spiral/center orbits).

SchoolPrecise statement: linear systems and eigenvalues

Definition: Linear homogeneous system

A first-order linear system x′=Ax\mathbf{x}'=A\mathbf{x} with constant n×nn\times n matrix AA and unknown vector-valued function x(t)\mathbf{x}(t) is called homogeneous because every term is linear in the components of x\mathbf{x}. For n=2n=2 it packages two coupled scalar equations x′=a11x+a12yx'=a_{11}x+a_{12}y, y′=a21x+a22yy'=a_{21}x+a_{22}y into one vector equation.

x′=Ax\mathbf{x}'=A\mathbf{x}

As with a single equation, try the ansatz x=eλtv\mathbf{x}=e^{\lambda t}\mathbf{v} for a constant vector v≠0\mathbf{v}\neq \mathbf{0} and scalar λ\lambda. Substituting gives λeλtv=Aeλtv\lambda e^{\lambda t}\mathbf{v}=Ae^{\lambda t}\mathbf{v}, i.e. Av=λvA\mathbf{v}=\lambda\mathbf{v}: v\mathbf{v} must be an eigenvector of AA with eigenvalue λ\lambda. Eigenvalues are the roots of the characteristic polynomial:

det⁡(A−λI)=0\det(A-\lambda I)=0
The four qualitative types of planar equilibria, classified by the eigenvalues of AA
EigenvaluesPhase portraitStability
λ1,λ2\lambda_1,\lambda_2 real, same signNodeStable if both negative, unstable if both positive
λ1,λ2\lambda_1,\lambda_2 real, opposite signsSaddleAlways unstable
Complex, nonzero real partSpiralStable if real part negative, unstable if positive
Purely imaginaryCenterNeutrally stable (closed orbits)

UndergraduateUniversity level: theorems and proofs

If AA has two distinct real eigenvalues λ1≠λ2\lambda_1\neq\lambda_2 with eigenvectors v1,v2\mathbf{v}_1,\mathbf{v}_2, then v1,v2\mathbf{v}_1,\mathbf{v}_2 are linearly independent, and the general solution of x′=Ax\mathbf{x}'=A\mathbf{x} is x(t)=c1eλ1tv1+c2eλ2tv2\mathbf{x}(t)=c_1e^{\lambda_1t}\mathbf{v}_1+c_2e^{\lambda_2t}\mathbf{v}_2.

Why is it true?

Eigenvectors turn the coupled system into two uncoupled scalar equations along the eigendirections: each eλitvie^{\lambda_i t}\mathbf{v}_i moves purely along the line spanned by vi\mathbf{v}_i, growing or shrinking at rate λi\lambda_i, so the full motion is a blend of two independent straight-line motions.

Proof

First check eλitvie^{\lambda_i t}\mathbf{v}_i solves the system: its derivative is λieλitvi\lambda_i e^{\lambda_i t}\mathbf{v}_i, while A(eλitvi)=eλitAvi=eλitλiviA(e^{\lambda_i t}\mathbf{v}_i)=e^{\lambda_i t}A\mathbf{v}_i=e^{\lambda_i t}\lambda_i\mathbf{v}_i using Av=λvA\mathbf{v}=\lambda\mathbf{v}; the two sides match, so it is indeed a solution for i=1,2i=1,2.

Linear independence of v1,v2\mathbf{v}_1,\mathbf{v}_2: suppose c1v1+c2v2=0c_1\mathbf{v}_1+c_2\mathbf{v}_2=\mathbf{0}. Applying AA gives c1λ1v1+c2λ2v2=0c_1\lambda_1\mathbf{v}_1+c_2\lambda_2\mathbf{v}_2=\mathbf{0}. Multiplying the first relation by λ2\lambda_2 and subtracting gives c1(λ1−λ2)v1=0c_1(\lambda_1-\lambda_2)\mathbf{v}_1=\mathbf{0}; since λ1≠λ2\lambda_1\neq\lambda_2 and v1≠0\mathbf{v}_1\neq\mathbf{0}, we get c1=0c_1=0, and then c2=0c_2=0 too. So v1,v2\mathbf{v}_1,\mathbf{v}_2 are independent.

By linearity of the system (exactly as in the scalar case), any combination c1eλ1tv1+c2eλ2tv2c_1e^{\lambda_1t}\mathbf{v}_1+c_2e^{\lambda_2t}\mathbf{v}_2 solves the system. Because v1,v2\mathbf{v}_1,\mathbf{v}_2 are independent, matching any initial condition x(0)=x0\mathbf{x}(0)=\mathbf{x}_0 means solving c1v1+c2v2=x0c_1\mathbf{v}_1+c_2\mathbf{v}_2=\mathbf{x}_0 for (c1,c2)(c_1,c_2), which has a unique solution since {v1,v2}\{\mathbf{v}_1,\mathbf{v}_2\} is a basis of the plane. So every solution is captured, giving the general solution x(t)=c1eλ1tv1+c2eλ2tv2\mathbf{x}(t)=c_1e^{\lambda_1t}\mathbf{v}_1+c_2e^{\lambda_2t}\mathbf{v}_2.

For a 2×22\times 2 system x′=Ax\mathbf{x}'=A\mathbf{x} with characteristic equation λ2−(tr A)λ+det⁡A=0\lambda^2-(\text{tr}\,A)\lambda+\det A=0, the origin is asymptotically stable (every solution tends to 0\mathbf{0} as t→∞t\to\infty) if and only if tr A<0\text{tr}\,A<0 and det⁡A>0\det A>0; it is unstable if det⁡A<0\det A<0 (a saddle) or tr A>0\text{tr}\,A>0.

Why is it true?

The trace and determinant of AA are, respectively, the sum and product of its eigenvalues — so this theorem translates a statement about roots of a quadratic (both have negative real part) into a statement about two easily computed numbers, without ever solving for the eigenvalues explicitly.

Proof

By definition of the characteristic polynomial, λ2−(tr A)λ+det⁡A=0\lambda^2-(\text{tr}\,A)\lambda+\det A=0 has roots λ1,2=tr A±(tr A)2−4det⁡A2\lambda_{1,2}=\dfrac{\text{tr}\,A\pm\sqrt{(\text{tr}\,A)^2-4\det A}}{2}, and by Vieta's formulas λ1+λ2=tr A\lambda_1+\lambda_2=\text{tr}\,A and λ1λ2=det⁡A\lambda_1\lambda_2=\det A.

If det⁡A<0\det A<0, then λ1λ2<0\lambda_1\lambda_2<0, so the eigenvalues are real with opposite signs (a saddle); solutions grow without bound along the positive-eigenvalue direction, so the origin is unstable.

If det⁡A>0\det A>0 and tr A<0\text{tr}\,A<0: when the eigenvalues are real, λ1λ2>0\lambda_1\lambda_2>0 means they share a sign, and λ1+λ2<0\lambda_1+\lambda_2<0 forces that sign to be negative, so both eλ1t→0e^{\lambda_1t}\to 0 and eλ2t→0e^{\lambda_2t}\to 0; when the eigenvalues are complex conjugates α±iβ\alpha\pm i\beta, tr A=2α<0\text{tr}\,A=2\alpha<0 gives α<0\alpha<0, so the amplitude factor eαt→0e^{\alpha t}\to 0 while cos⁡(βt),sin⁡(βt)\cos(\beta t),\sin(\beta t) stay bounded. In every sub-case, every solution decays to 0\mathbf{0}: asymptotic stability.

Conversely if tr A>0\text{tr}\,A>0 (with det⁡A>0\det A>0, so real eigenvalues share the trace's sign, or complex with positive real part), at least one exponential factor grows, so solutions starting near but not at the origin move away: instability. This covers every sign combination, proving the equivalence.

UndergraduateReal-World Applications and Worked Examples

The classic ecological model of a predator and its prey — the Lotka–Volterra equations {x′=αx−βxyy′=δxy−γy\begin{cases}x'=\alpha x-\beta xy\\ y'=\delta xy-\gamma y\end{cases}, with prey xx, predator yy, and positive rates α,β,γ,δ\alpha,\beta,\gamma,\delta — is nonlinear, but near its equilibrium point it behaves almost exactly like the linear systems studied here: linearizing (replacing the nonlinear terms by their best linear approximation) around the coexistence equilibrium produces a matrix whose eigenvalues are purely imaginary, predicting the closed, cyclic boom-and-bust orbits actually observed in real predator-prey population data.

Example: Classifying an equilibrium: a stable node

Classify the equilibrium at the origin of x′=Ax\mathbf{x}'=A\mathbf{x} for A=(3001)A=\begin{pmatrix}3&0\\0&1\end{pmatrix} and give the general solution.

Solution

Since AA is diagonal, the eigenvalues are read off directly: λ1=3\lambda_1=3, λ2=1\lambda_2=1, with eigenvectors v1=(1,0)\mathbf{v}_1=(1,0) and v2=(0,1)\mathbf{v}_2=(0,1) respectively (the coordinate axes themselves).

Both eigenvalues are real and positive — same sign — so by the classification table this is a node; since tr A=4>0\text{tr}\,A=4>0, it is unstable (trajectories move away from the origin, faster along the xx-axis since λ1=3>λ2=1\lambda_1=3>\lambda_2=1).

By the eigenvalue theorem, the general solution is x(t)=c1e3t(1,0)+c2et(0,1)\mathbf{x}(t)=c_1e^{3t}(1,0)+c_2e^{t}(0,1), i.e. x(t)=c1e3tx(t)=c_1e^{3t}, y(t)=c2ety(t)=c_2e^{t}.

Example: Classifying an equilibrium: a saddle

Classify the equilibrium at the origin of x′=Ax\mathbf{x}'=A\mathbf{x} for A=(100−2)A=\begin{pmatrix}1&0\\0&-2\end{pmatrix}.

Solution

AA is diagonal, so λ1=1\lambda_1=1, λ2=−2\lambda_2=-2 with eigenvectors v1=(1,0)\mathbf{v}_1=(1,0), v2=(0,1)\mathbf{v}_2=(0,1); equivalently det⁡A=1⋅(−2)=−2<0\det A=1\cdot(-2)=-2<0, confirming opposite signs directly from the trace-determinant criterion.

One eigenvalue is positive and the other negative, so trajectories are attracted toward the origin along the yy-axis (since λ2=−2<0\lambda_2=-2<0) but repelled along the xx-axis (since λ1=1>0\lambda_1=1>0) — this is a saddle, and it is always unstable because almost every trajectory eventually escapes along the unstable direction.

The general solution is x(t)=c1et(1,0)+c2e−2t(0,1)\mathbf{x}(t)=c_1e^{t}(1,0)+c_2e^{-2t}(0,1); only trajectories starting exactly on the yy-axis (c1=0c_1=0) approach the origin, while every other trajectory is eventually dominated by the growing ete^{t} term.

For x′=Ax\mathbf{x}'=A\mathbf{x} with A=(3001)A=\begin{pmatrix}3&0\\0&1\end{pmatrix}, what is the general solution?

If tr A=−3\text{tr}\,A=-3 and det⁡A=2\det A=2, what type of equilibrium does the origin have?

In the linearized Lotka–Volterra system {x′=αx−βxyy′=δxy−γy\begin{cases}x'=\alpha x-\beta xy\\ y'=\delta xy-\gamma y\end{cases} near its coexistence equilibrium, the matrix has purely imaginary eigenvalues. What does this predict about predator and prey populations?

Which condition on AA guarantees the origin is unstable, regardless of the value of tr A\text{tr}\,A?

References

  1. Morris W. Hirsch, Stephen Smale, Robert L. Devaney (2013). Differential Equations, Dynamical Systems, and an Introduction to Chaos
  2. Steven H. Strogatz (2015). Nonlinear Dynamics and Chaos