Phase Portraits for Linear Systems

Consider a two-species population model. Each species' growth rate depends linearly on both populations. How do the populations evolve from an arbitrary starting point? The answer is geometric, not just algebraic. Solution curves trace out a picture in the plane, called a phase portrait. Its shape is dictated entirely by two numbers extracted from the system's matrix. This matters because for nonlinear systems near an equilibrium, the same shapes reappear. This is the content of linearization, foreshadowing Stability and Classification of Equilibria. So mastering the linear case means mastering the local geometry of almost every dynamical system encountered in practice. The big picture is this: a linear planar system x′=Ax\mathbf{x}' = A\mathbf{x} has solutions built from the eigenvalues and eigenvectors of AA. This was established in the Eigenvalue Method for Linear Systems and extended in Complex and Repeated Eigenvalues. What that earlier algebra does not immediately reveal is the shape traced out in the x1x_1–x2x_2 plane as tt varies. This article closes that gap. We classify every possible phase portrait — node, saddle, spiral, center, and the degenerate borderline cases. We do this purely in terms of the trace TT and determinant DD of AA. We also prove that this classification is complete and exhaustive. The organizing object is the trace–determinant plane. This is a single picture, the (T,D)(T,D)-plane, that maps all possible qualitative behaviors of 2×22\times2 linear systems. Every matrix AA corresponds to exactly one point in this plane. That point's location, relative to a single parabola T2=4DT^2 = 4D and the axis D=0D=0, determines the entire phase portrait up to affine equivalence. This turns an infinite family of differential equations into a finite catalogue of pictures. By the end of this article you will be able to read off, from TT and DD alone, whether trajectories spiral, curve, or fly straight past the origin. You will also have a complete, self-contained proof of why this dichotomy is exhaustive.

Key takeaways
  • A planar linear system x′=Ax\mathbf{x}' = A\mathbf{x} has a phase portrait fully classified by the trace T=tr(A)T=\mathrm{tr}(A) and determinant D=det⁡(A)D=\det(A) of AA.
  • Real eigenvalues of the same sign give nodes; opposite signs give saddles; complex eigenvalues give spirals (or centers if purely imaginary).
  • The discriminant Δ=T2−4D\Delta = T^2 - 4D separates real (Δ>0\Delta > 0) from complex (Δ<0\Delta<0) eigenvalues; D<0D<0 always forces a saddle regardless of Δ\Delta.
  • Nodes are further split into proper/star, improper, and degenerate nodes depending on eigenvector multiplicity.
  • Every trajectory of a nondegenerate linear system either converges to the origin, diverges from it, or orbits it — never crosses itself, by uniqueness of solutions.
  • Key idea: the pair (T,D)(T,D) is coordinates on a "map of dynamics" — a single parabola T2=4DT^2=4D and the line D=0D=0 carve the plane into all qualitatively distinct phase portraits.

Where this lives today

The trace–determinant classification is the entry point to linearization in nonlinear dynamics: near a hyperbolic equilibrium (one where Re(λ)≠0\mathrm{Re}(\lambda)\ne0 for all eigenvalues of the Jacobian), the Hartman–Grobman theorem guarantees the nonlinear phase portrait is topologically identical to that of the linearization, so every saddle, node, or spiral found here reappears as the local picture for far more complicated systems — predator–prey models, chemical reaction networks, and neuron firing models (e.g., the FitzHugh–Nagumo equations) all get their local geometry classified this way. In electrical engineering, RLC circuits are literally second-order linear systems, and the node/spiral/center trichotomy corresponds precisely to overdamped, underdamped, and undamped circuit response. In control theory, placing the eigenvalues of a feedback matrix in the left half-plane (ensuring T<0,D>0T<0, D>0) is exactly the condition for a stabilizing controller, and root-locus and pole-placement techniques are trace–determinant reasoning in disguise. In mechanics, the classification of centers versus spirals governs whether small oscillations persist forever (as in an idealized frictionless pendulum, a center) or decay (with friction, a spiral). Numerical methods for ODEs are validated against exactly these portraits: a good integrator must reproduce a center as closed orbits rather than artificially spiraling in or out, a subtlety at the heart of symplectic integration used in long-term simulations of planetary orbits.

Ask the tutor: Given a specific 2×22\times 2 matrix, how do I quickly sketch its phase portrait using only TT and DD, without solving the system explicitly?

DefinitionPhase Portrait of a Linear System

Let AA be a real 2×22\times 2 matrix and consider the constant-coefficient linear system

x′(t)=A x(t),x(t)=(x1(t)x2(t))∈R2.\mathbf{x}'(t) = A\,\mathbf{x}(t), \qquad \mathbf{x}(t) = \begin{pmatrix} x_1(t) \\ x_2(t)\end{pmatrix} \in \mathbb{R}^2 .

For each initial condition x(0)=x0∈R2\mathbf{x}(0) = \mathbf{x}_0 \in \mathbb{R}^2, the theory of linear systems guarantees a unique solution x(t;x0)\mathbf{x}(t;\mathbf{x}_0) defined for all t∈Rt\in\mathbb{R}. The trajectory (or orbit) through x0\mathbf{x}_0 is the parametrized curve

γx0={ x(t;x0):t∈R }⊂R2,\gamma_{\mathbf{x}_0} = \{\, \mathbf{x}(t;\mathbf{x}_0) : t \in \mathbb{R} \,\} \subset \mathbb{R}^2,

drawn together with an arrow indicating the direction of increasing tt. The phase portrait of the system is the collection of trajectories {γx0:x0∈R2}\{\gamma_{\mathbf{x}_0} : \mathbf{x}_0 \in \mathbb{R}^2\}, drawn simultaneously in the x1x2x_1x_2-plane (the phase plane). Two phase portraits are considered qualitatively equivalent (topologically conjugate) if one can be mapped to the other by an invertible linear change of coordinates that preserves the direction of time flow (or reverses it consistently).

Intuition

Every trajectory of x′=Ax\mathbf{x}'=A\mathbf{x} is built from exponentials eλte^{\lambda t} dressed by eigenvectors, where λ\lambda ranges over the eigenvalues of AA. The qualitative picture — whether solutions blow up, decay, spiral, or oscillate on closed loops — depends only on the sign and type of these eigenvalues, not on their exact values. Since the eigenvalues are roots of the characteristic polynomial

λ2−Tλ+D=0,T=tr(A), D=det⁡(A),\lambda^2 - T\lambda + D = 0, \qquad T = \mathrm{tr}(A),\ D = \det(A),

everything about the qualitative behavior is encoded in the two real numbers TT and DD. Real eigenvalues arise when T2−4D≥0T^2 - 4D \geq 0; a negative determinant forces the two eigenvalues to have opposite sign (one positive, one negative) because their product is D=λ1λ2D = \lambda_1\lambda_2; equal-magnitude opposite-sign real parts with a nonzero imaginary part give a center, an unusual borderline case where trajectories are closed ellipses forever, neither approaching nor leaving the origin. The picture below is the master map: plotting every matrix as the point (T,D)(T,D) shows how the parabola T2=4DT^2 = 4D and the axis D=0D = 0 divide the plane into the five basic regimes.

Figure
The trace–determinant plane: each region is a distinct phase portrait
T D T² = 4D saddles (D<0) stable nodes unstable nodes stable spirals unstable spirals centers on T = 0, D>0 (D>0 line, above origin)

Notice that the parabola T2=4DT^2=4D (where the discriminant vanishes) is where real, repeated eigenvalues occur — the boundary between nodes and spirals. The vertical axis T=0T=0 combined with D>0D>0 is where eigenvalues are purely imaginary — the center case. The horizontal axis D=0D=0 is degenerate: at least one eigenvalue is zero, so the origin is not an isolated equilibrium.

TheoremTrace–Determinant Classification of Planar Linear Systems

Let AA be a real 2×22\times 2 matrix with det⁡A≠0\det A \ne 0 (so the origin is the unique equilibrium of x′=Ax\mathbf{x}'=A\mathbf{x}). Let T=tr(A)T = \mathrm{tr}(A), D=det⁡AD = \det A, and Δ=T2−4D\Delta = T^2 - 4D. Then the phase portrait of x′=Ax\mathbf{x}' = A\mathbf{x} falls into exactly one of the following mutually exclusive cases, determined solely by (T,D)(T,D): 1. Saddle: if D<0D < 0. The eigenvalues λ1,λ2\lambda_1,\lambda_2 are real with λ1<0<λ2\lambda_1 < 0 < \lambda_2. All trajectories except along the two eigenvector lines diverge from the origin, asymptotically approaching the unstable eigenline as t→+∞t\to+\infty and the stable eigenline as t→−∞t\to-\infty. The origin is unstable. 2. Node (real, same-sign eigenvalues): if D>0D>0 and Δ≥0\Delta \geq 0. The eigenvalues are real with λ1,λ2\lambda_1,\lambda_2 of the same sign as −- wait, same sign as each other, that sign being the sign of TT (since λ1+λ2=T\lambda_1+\lambda_2=T and λ1λ2=D>0\lambda_1\lambda_2=D>0). If T<0T<0 both eigenvalues are negative: the origin is asymptotically stable and every trajectory tends to the origin as t→∞t \to \infty, tangent to the slow eigenline. If T>0T>0 the reverse holds with t→−∞t\to -\infty replacing t→∞t \to \infty; the origin is unstable.

  • If Δ>0\Delta > 0 and eigenvalues are distinct with linearly independent eigenvectors, this is an improper node.
  • If Δ=0\Delta = 0 and AA is diagonalizable (i.e. A=λIA = \lambda I), every direction is an eigenvector: a proper node or star node, with trajectories being rays from the origin.
  • If Δ=0\Delta = 0 and AA is not diagonalizable (a repeated eigenvalue with a one-dimensional eigenspace), this is a degenerate node, with trajectories tangent to the single eigenline.

3. Spiral (Focus): if Δ<0\Delta < 0 and T≠0T \ne 0. The eigenvalues are complex conjugates α±iβ\alpha \pm i\beta with α=T/2≠0\alpha = T/2 \ne 0, β=−Δ/2>0\beta = \sqrt{-\Delta}/2 > 0. Trajectories spiral around the origin, spiraling inward (t→∞t\to\infty) if T<0T<0 and outward if T>0T>0. 4. Center: if Δ<0\Delta < 0 and T=0T = 0. The eigenvalues are purely imaginary ±iβ\pm i\beta, β=D>0\beta = \sqrt{D}>0. Every trajectory other than the origin is a closed curve (an ellipse in original coordinates) traversed periodically with period 2π/β2\pi/\beta. The origin is stable (Lyapunov stable) but not asymptotically stable. These four cases are exhaustive and mutually exclusive over {(T,D):D≠0}\{(T,D): D\ne 0\}.

Proof

We use the eigenvalue method: solve the characteristic equation, exhibit the general solution explicitly in each regime, and read off the geometry directly from the exponential/trigonometric formulas. This is a direct proof by case analysis on the discriminant, not relying on any classification theorem stated for nonlinear systems (avoiding circularity with Stability and Classification of Equilibria, which is a consequence of this result, not a tool used here).

Step 1: the characteristic equation and its roots. The eigenvalues of AA satisfy

λ2−Tλ+D=0,λ=T±T2−4D2=T±Δ2.\lambda^2 - T\lambda + D = 0, \qquad \lambda = \frac{T \pm \sqrt{T^2-4D}}{2} = \frac{T\pm\sqrt{\Delta}}{2}.

This is immediate from expanding det⁡(A−λI)=λ2−(trA)λ+det⁡A\det(A - \lambda I) = \lambda^2 - (\mathrm{tr} A)\lambda + \det A for a 2×22\times 2 matrix, which follows by direct computation writing A=(abcd)A = \begin{pmatrix} a & b\\ c& d\end{pmatrix}: det⁡(A−λI)=(a−λ)(d−λ)−bc=λ2−(a+d)λ+(ad−bc)=λ2−Tλ+D\det(A-\lambda I) = (a-\lambda)(d-\lambda) - bc = \lambda^2 - (a+d)\lambda + (ad-bc) = \lambda^2 - T\lambda + D. Since we assumed D=λ1λ2≠0D = \lambda_1\lambda_2 \ne 0, neither eigenvalue is zero, so x=0\mathbf{x}=\mathbf{0} is the only equilibrium (the only solution of Ax=0A\mathbf{x}=\mathbf{0} when AA is invertible).

Step 2: Case D<0D<0 (saddle). Since Δ=T2−4D>T2≥0\Delta = T^2 - 4D > T^2 \geq 0 (as −4D>0-4D>0), the eigenvalues are real and distinct, say λ1<λ2\lambda_1 < \lambda_2. Since λ1λ2=D<0\lambda_1\lambda_2 = D<0, they have opposite signs; write λ1<0<λ2\lambda_1<0<\lambda_2. By the eigenvalue method (a prerequisite result), AA has linearly independent real eigenvectors v1,v2\mathbf{v}_1,\mathbf{v}_2 (distinct real eigenvalues of a real matrix always admit linearly independent eigenvectors, by the standard linear-algebra fact that eigenvectors of distinct eigenvalues are linearly independent), and the general solution is

x(t)=c1eλ1tv1+c2eλ2tv2.\mathbf{x}(t) = c_1 e^{\lambda_1 t}\mathbf{v}_1 + c_2 e^{\lambda_2 t}\mathbf{v}_2 .

If c2=0c_2 = 0, c1≠0c_1\ne0: the trajectory lies on the line through v1\mathbf{v}_1, and since λ1<0\lambda_1<0, x(t)→0\mathbf{x}(t)\to \mathbf{0} as t→∞t\to\infty and ∥x(t)∥→∞\|\mathbf{x}(t)\|\to\infty as t→−∞t\to -\infty. This is the stable eigenline. If c1=0,c2≠0c_1=0,c_2\ne0: symmetric argument gives the unstable eigenline, with x(t)→0\mathbf{x}(t)\to\mathbf 0 as t→−∞t\to-\infty. If c1,c2≠0c_1,c_2\ne 0: as t→+∞t\to+\infty, eλ2te^{\lambda_2 t} dominates eλ1te^{\lambda_1 t} (since λ2>0>λ1\lambda_2>0>\lambda_1), so

x(t)=eλ2t(c2v2+c1e(λ1−λ2)tv1)→∞ in direction v2,\mathbf{x}(t) = e^{\lambda_2 t}\left(c_2\mathbf{v}_2 + c_1 e^{(\lambda_1-\lambda_2)t}\mathbf{v}_1\right) \to \infty \text{ in direction } \mathbf{v}_2,

since (λ1−λ2)<0(\lambda_1-\lambda_2)<0 forces the second term to vanish. Symmetrically, as t→−∞t\to-\infty, the trajectory is asymptotic to the v1\mathbf{v}_1 direction. Thus every trajectory off the eigenlines approaches v2\mathbf{v}_2's line forward in time and v1\mathbf{v}_1's line backward in time, the classic hyperbolic saddle geometry. Since ∥x(t)∥→∞\|\mathbf{x}(t)\|\to\infty along every trajectory except the stable line, the origin is unstable.

Step 3: Case D>0D>0, Δ>0\Delta > 0 (improper node). As in Step 2, real distinct eigenvalues λ1≠λ2\lambda_1\ne \lambda_2 give independent eigenvectors and the same general solution formula. But now λ1λ2=D>0\lambda_1\lambda_2 = D>0 forces λ1,λ2\lambda_1,\lambda_2 to share a sign, and λ1+λ2=T\lambda_1+\lambda_2=T tells us that sign is the sign of TT (if both were negative their sum would be negative, and conversely). Assume T<0T<0, so λ1<λ2<0\lambda_1<\lambda_2<0 (relabeling so λ1\lambda_1 is more negative). Then for any c1,c2c_1,c_2 not both zero,

∥x(t)∥→0 as t→+∞,\|\mathbf{x}(t)\| \to 0 \text{ as } t\to +\infty,

since both exponentials decay. To see the direction of approach, factor out the slower-decaying (less negative) exponential eλ2te^{\lambda_2 t}:

x(t)=eλ2t(c2v2+c1e(λ1−λ2)tv1).\mathbf{x}(t) = e^{\lambda_2 t}\left(c_2 \mathbf{v}_2 + c_1 e^{(\lambda_1 - \lambda_2)t}\mathbf{v}_1\right).

Since λ1−λ2<0\lambda_1 - \lambda_2 < 0, the term e(λ1−λ2)t→0e^{(\lambda_1-\lambda_2)t}\to 0 as t→∞t\to\infty provided c2≠0c_2 \ne 0, so the direction of x(t)\mathbf{x}(t) tends to that of v2\mathbf{v}_2: all trajectories with c2≠0c_2\ne 0 become tangent to the v2\mathbf{v}_2-eigenline (the "slow" direction, associated to the eigenvalue closer to 00) as t→∞t\to\infty. Trajectories with c2=0c_2=0 lie exactly on the v1\mathbf{v}_1 line. As t→−∞t\to -\infty, ∥x(t)∥→∞\|\mathbf{x}(t)\|\to\infty for all nonzero solutions, so the origin is asymptotically stable (T<0T<0) and this is a stable improper node. Reversing all inequalities handles T>0T>0, giving an unstable node with all motion reversed in time.

Step 4: Case D>0D>0, Δ=0\Delta=0, repeated eigenvalue λ=T/2\lambda = T/2, diagonalizable (A=λIA=\lambda I, proper/star node). If A=λIA = \lambda I then every nonzero vector is an eigenvector and the general solution is x(t)=eλtx(0)\mathbf{x}(t) = e^{\lambda t}\mathbf{x}(0): every trajectory is a ray from the origin (or through it), traversed radially outward if λ>0\lambda>0 or inward if λ<0\lambda<0, with all directions equally "fast" — hence "star" or "proper" node.

Step 5: Case D>0D>0, Δ=0\Delta = 0, repeated eigenvalue not diagonalizable (degenerate node). By the theory of Complex and Repeated Eigenvalues, when AA has a repeated eigenvalue λ=T/2\lambda=T/2 with only a one-dimensional eigenspace spanned by v\mathbf v, there is a generalized eigenvector w\mathbf{w} with (A−λI)w=v(A-\lambda I)\mathbf w = \mathbf v, and the general solution is

x(t)=c1eλtv+c2eλt(tv+w).\mathbf x(t) = c_1 e^{\lambda t}\mathbf v + c_2 e^{\lambda t}(t\mathbf v + \mathbf w).

If c2=0c_2 = 0: trajectory lies on the eigenline through v\mathbf v. If c2≠0c_2\ne 0, write

x(t)=eλt[(c1+c2t)v+c2w].\mathbf x(t) = e^{\lambda t}\Big[ (c_1 + c_2 t)\mathbf v + c_2 \mathbf w \Big].

As t→±∞t\to \pm\infty (whichever direction makes eλt→0e^{\lambda t}\to 0, i.e. t→+∞t\to +\infty if λ<0\lambda<0), the coefficient (c1+c2t)(c_1+c_2 t) dominates the fixed vector c2wc_2\mathbf w in the bracket, so the direction of x(t)\mathbf x(t) tends to ±v\pm\mathbf v: every trajectory becomes tangent to the single eigenline as it approaches the origin, and ∥x(t)∥→0\|\mathbf x(t)\|\to 0 because teλt→0t e^{\lambda t}\to 0 for λ<0\lambda <0 (standard fact: exponential decay beats polynomial growth, provable by L'Hôpital or by the ratio test applied to tneλtt^n e^{\lambda t}). This produces the characteristic "combed" degenerate node, distinct in shape from the star node of Step 4 because trajectories are curved, tangent to one line, rather than straight rays.

Step 6: Case Δ<0\Delta<0 (complex eigenvalues), T≠0T\ne0 (spiral). Since Δ<0\Delta<0, the eigenvalues are complex conjugates λ=α±iβ\lambda = \alpha\pm i\beta with α=T/2\alpha = T/2, β=−Δ/2>0\beta = \sqrt{-\Delta}/2>0 (nonzero because Δ<0\Delta<0). By the method for complex eigenvalues (prerequisite result), with complex eigenvector v=p+iq\mathbf{v} = \mathbf{p}+i\mathbf{q} for eigenvalue α+iβ\alpha+i\beta, two real, linearly independent solutions are

u(t)=eαt(pcos⁡βt−qsin⁡βt),w(t)=eαt(psin⁡βt+qcos⁡βt),\mathbf u(t) = e^{\alpha t}\big(\mathbf p\cos\beta t - \mathbf q \sin \beta t\big), \quad \mathbf w(t) = e^{\alpha t}\big(\mathbf p \sin \beta t + \mathbf q\cos\beta t\big),

and the general real solution is x(t)=c1u(t)+c2w(t)\mathbf x(t) = c_1\mathbf u(t) + c_2 \mathbf w(t). In the basis {p,q}\{\mathbf p, \mathbf q\} (linearly independent because v\mathbf v is a genuine complex, not real, eigenvector — otherwise the eigenvalue would be real), write x(t)=eαtR(t)(cos⁡(βt+ϕ)∗)\mathbf{x}(t) = e^{\alpha t} R(t) \binom{\cos(\beta t + \phi)}{\ast}-type expression; more directly, compute

∥x(t)∥2=e2αt[a bounded, periodic, strictly positive (for (c1,c2)≠0) function of t],\|\mathbf x(t)\|^2 = e^{2\alpha t}\big[\text{a bounded, periodic, strictly positive (for } (c_1,c_2)\ne 0\text{) function of } t\big],

because the bracket is a fixed quadratic form in cos⁡βt,sin⁡βt\cos\beta t,\sin\beta t evaluated along a circle, hence bounded above and below by positive constants when p,q\mathbf p,\mathbf q are linearly independent. Therefore ∥x(t)∥→0\|\mathbf x(t)\| \to 0 as t→∞t\to\infty if α=T/2<0\alpha = T/2<0, and ∥x(t)∥→∞\|\mathbf x(t)\|\to\infty if α>0\alpha>0; in either case the direction rotates monotonically (the angular part βt\beta t advances at constant rate, since β≠0\beta\ne0), producing a spiral: inward (stable) for T<0T<0, outward (unstable) for T>0T>0.

Step 7: Case Δ<0\Delta<0, T=0T=0 (center). Repeat Step 6 with α=0\alpha=0: then ∥x(t)∥2\|\mathbf x(t)\|^2 is exactly periodic and bounded above and below by positive constants (no e2αte^{2\alpha t} factor), so trajectories are closed curves, retraced with period 2π/β2\pi/\beta exactly (since cos⁡,sin⁡\cos,\sin have period 2π/β2\pi/\beta in argument βt\beta t). The origin is Lyapunov stable, since nearby trajectories stay on nearby bounded closed curves and never approach or leave the origin, but it is not asymptotically stable, since ∥x(t)∥\|\mathbf x(t)\| does not tend to 00.

Step 8: exhaustiveness and mutual exclusivity. Given D≠0D\ne 0, exactly one of D<0D<0 or D>0D>0 holds. If D>0D>0, exactly one of Δ>0\Delta>0, Δ=0\Delta=0, Δ<0\Delta<0 holds, and if Δ=0\Delta=0, exactly one of A=λIA=\lambda I (diagonalizable) or not holds. If Δ<0\Delta<0, exactly one of T=0T=0 or T≠0T\ne0 holds. These conditions partition {(T,D):D≠0}\{(T,D):D\ne0\} into exactly the cases enumerated, each shown above to produce the claimed geometry, and no matrix can satisfy two of these mutually exclusive numerical conditions simultaneously. ■\blacksquare

∎

Worked examples

Example 1 (an improper node with distinct, asymmetric eigenvalues). Consider

A=(−412−3).A = \begin{pmatrix} -4 & 1 \\ 2 & -3\end{pmatrix}.

Compute T=−4+(−3)=−7T = -4+(-3) = -7 and D=(−4)(−3)−(1)(2)=12−2=10D = (-4)(-3) - (1)(2) = 12-2=10. Then Δ=T2−4D=49−40=9>0\Delta = T^2-4D = 49-40 = 9 > 0, so by the Theorem this is a node (real, same-sign eigenvalues, since D>0D>0), and since T<0T<0 it is a stable improper node. Explicitly, λ=−7±32\lambda = \dfrac{-7\pm 3}{2}, giving λ1=−5\lambda_1 = -5, λ2=−2\lambda_2 = -2. For λ1=−5\lambda_1=-5: (A+5I)v=0(A+5I)\mathbf v=0 means (1122)v=0\begin{pmatrix}1&1\\2&2\end{pmatrix}\mathbf v = 0, so v1=(1,−1)T\mathbf v_1 = (1,-1)^T. For λ2=−2\lambda_2=-2: (A+2I)v=0(A+2I)\mathbf v = 0 means (−212−1)v=0\begin{pmatrix}-2&1\\2&-1\end{pmatrix}\mathbf v=0, so v2=(1,2)T\mathbf v_2 = (1,2)^T. The general solution is

x(t)=c1e−5t(1−1)+c2e−2t(12).\mathbf x(t) = c_1 e^{-5t}\binom{1}{-1} + c_2 e^{-2t}\binom{1}{2}.

Both exponents are negative, confirming asymptotic stability of the origin. Since ∣λ1∣=5>∣λ2∣=2|\lambda_1|=5 > |\lambda_2|=2, the e−5te^{-5t} term decays faster; as t→∞t\to\infty, every trajectory with c2≠0c_2\ne0 becomes tangent to v2=(1,2)T\mathbf v_2 = (1,2)^T, the slow eigenline. As t→−∞t\to -\infty, trajectories become asymptotic (in direction) to v1=(1,−1)T\mathbf v_1=(1,-1)^T. This matches Step 3 of the proof exactly, with the numbers λ1=−5,λ2=−2\lambda_1=-5,\lambda_2=-2, D=10D=10, T=−7T=-7 consistent throughout (λ1λ2=10=D\lambda_1\lambda_2 = 10 = D, λ1+λ2=−7=T\lambda_1+\lambda_2=-7=T ✓).

Figure
Improper node: trajectories bend from the fast eigenline (1,-1) onto the slow eigenline (1,2)
x₁ x₂ slow eigenline v₂=(1,2), λ=-2 fast eigenline v₁=(1,-1), λ=-5 origin (stable node)

Example 2 (a spiral with an asymmetric, non-unit matrix). Consider

A=(15−23).A = \begin{pmatrix} 1 & 5 \\ -2 & 3 \end{pmatrix}.

Here T=1+3=4T = 1+3=4, D=(1)(3)−(5)(−2)=3+10=13D = (1)(3)-(5)(-2) = 3+10=13. Then Δ=16−52=−36<0\Delta = 16 - 52 = -36 < 0, so eigenvalues are complex. Since T=4≠0T=4\ne 0, the Theorem predicts an unstable spiral (outward, since T>0T>0). Explicitly λ=4±−362=2±3i\lambda = \dfrac{4\pm\sqrt{-36}}{2} = 2 \pm 3i. So α=2\alpha = 2, β=3\beta = 3. An eigenvector for λ=2+3i\lambda = 2+3i solves (A−(2+3i)I)v=0(A - (2+3i)I)\mathbf v = 0:

(−1−3i5−21−3i)v=0.\begin{pmatrix} -1-3i & 5 \\ -2 & 1-3i\end{pmatrix}\mathbf v = 0.

From the first row: (−1−3i)v1+5v2=0⇒v2=(1+3i)5v1(-1-3i)v_1 + 5v_2 = 0 \Rightarrow v_2 = \dfrac{(1+3i)}{5}v_1. Take v1=5v_1=5: v2=1+3iv_2 = 1+3i. So v=(51+3i)=(51)+i(03)=p+iq\mathbf v = \binom{5}{1+3i} = \binom{5}{1} + i\binom{0}{3} = \mathbf p + i\mathbf q, with p=(5,1)T\mathbf p = (5,1)^T, q=(0,3)T\mathbf q=(0,3)^T. By the complex-eigenvalue method, two independent real solutions are

u(t)=e2t[(51)cos⁡3t−(03)sin⁡3t],w(t)=e2t[(51)sin⁡3t+(03)cos⁡3t].\mathbf u(t) = e^{2t}\left[\binom{5}{1}\cos 3t - \binom{0}{3}\sin 3t\right], \qquad \mathbf w(t) = e^{2t}\left[\binom{5}{1}\sin 3t + \binom{0}{3}\cos 3t\right].

Both carry the growing factor e2te^{2t} (α=2>0\alpha=2>0), confirming instability, and the angular factor rotates with (constant) rate β=3\beta=3, confirming a genuine spiral rather than any straight-line motion — no real eigenvector exists here since the eigenvalues are non-real, so unlike Example 1 there is no invariant line at all; every trajectory (other than the origin) is a spiral curve winding outward, consistent with Step 6 of the proof, with λ1λ2=(2+3i)(2−3i)=4+9=13=D\lambda_1\lambda_2 = (2+3i)(2-3i) = 4+9=13=D ✓ and λ1+λ2=4=T\lambda_1+\lambda_2 = 4 = T ✓.

Counterexamplewhy D≠0D \ne 0 is needed

Drop the hypothesis det⁡A≠0\det A \ne 0 and consider

A=(2−21−1).A = \begin{pmatrix} 2 & -2 \\ 1 & -1 \end{pmatrix}.

Here T=2+(−1)=1T = 2 + (-1) = 1 and D=(2)(−1)−(−2)(1)=−2+2=0D = (2)(-1) - (-2)(1) = -2+2 = 0. The Theorem's classification — saddle, node, spiral, or center — simply does not apply, and indeed the conclusion fails: the origin is not an isolated equilibrium. The equation Ax=0A\mathbf x = 0 becomes 2x1−2x2=02x_1 - 2x_2=0, i.e. x1=x2x_1=x_2, so every point on the line x1=x2x_1=x_2 is a fixed point, not just the origin. Concretely, the eigenvalues are λ=1±1−02=1±12\lambda = \dfrac{1\pm\sqrt{1-0}}{2} = \dfrac{1\pm1}{2}, giving λ1=0\lambda_1 = 0, λ2=1\lambda_2 = 1. Eigenvector for λ1=0\lambda_1=0: solves Av=0A\mathbf v=0, giving v1=(1,1)T\mathbf v_1=(1,1)^T — a whole line of equilibria, matching the direct computation above. Eigenvector for λ2=1\lambda_2=1: (A−I)v=0⇒(1−21−2)v=0⇒v2=(2,1)T(A-I)\mathbf v = 0 \Rightarrow \begin{pmatrix}1&-2\\1&-2\end{pmatrix}\mathbf v=0 \Rightarrow \mathbf v_2 = (2,1)^T. General solution: x(t)=c1(1,1)T+c2et(2,1)T\mathbf x(t) = c_1(1,1)^T + c_2 e^{t}(2,1)^T. As t→∞t\to\infty, trajectories with c2≠0c_2\ne0 shoot off to infinity parallel to (2,1)T(2,1)^T; as t→−∞t\to-\infty, they approach the line of equilibria c1(1,1)Tc_1(1,1)^T, not a single point. There is no isolated saddle, node, spiral, or center: the phase portrait is a continuum of parallel rays converging (in backward time) onto an entire line of rest points. This shows why the hypothesis D≠0D\ne 0 (equivalently, invertibility of AA, equivalently the origin being an isolated equilibrium) cannot be dropped from the Theorem — without it, the classification's four categories do not exhaust the possibilities, and a fundamentally different geometric object (a line of equilibria with transverse flow) appears instead.

Scope, edge cases & common traps

SituationWhat happensCommon error
D<0D<0Saddle, always unstable, regardless of TTForgetting that saddles ignore TT entirely — trace only decides stability when D>0D>0
D>0, Δ=0, A≠λID>0,\ \Delta=0,\ A\ne\lambda IDegenerate node (one eigenline, curved approach)Confusing with the proper/star node, which needs A=λIA=\lambda I exactly
D>0, Δ=0, A=λID>0,\ \Delta=0,\ A=\lambda IStar node, straight-ray trajectoriesAssuming any repeated eigenvalue automatically gives straight rays
Δ<0, T=0\Delta<0,\ T=0Center: closed orbits, stable but not asymptotically stableCalling a center "asymptotically stable" — it is only Lyapunov stable
D=0D=0Non-isolated equilibria; classification does not applyForcing a saddle/node/spiral label onto a line of fixed points
Nonlinear systems near equilibriaTrace–determinant picture describes the linearization; centers can be destroyed by nonlinear termsAssuming a center in the linearization implies a center for the full nonlinear system

The mathematician behind it

Origins · 1 minJules Henri Poincaré and how this was discovered
JH
Jules Henri Poincaré
1854–1912 · Founder of the qualitative theory of differential equations and dynamical systems, at the University of Paris

Henri Poincaré revolutionized the study of differential equations by shifting attention away from finding explicit formulas for solutions and toward understanding their qualitative behavior — whether orbits spiral, cycle, or diverge — without solving the equations at all. His 1881–1886 papers "Mémoire sur les courbes définies par une équation différentielle" introduced exactly the classification of equilibrium points (which he called singular points) into nodes ("nœuds"), saddles ("cols"), foci ("foyers"), and centers ("centres") — the very vocabulary and geometric taxonomy used in this article. This was part of his broader program, motivated originally by celestial mechanics and the three-body problem, to understand the long-term behavior of dynamical systems geometrically. His insight that a linear approximation near an equilibrium reveals the local phase portrait — the linearization principle underlying the trace–determinant method — became foundational to the modern theory of dynamical systems.

Origins · 1 minhow this was discovered
History
- 1854: Henri Poincaré born in Nancy, France.
- 1881: Poincaré begins publishing "Mémoire sur les courbes définies par une équation différentielle," introducing the classification of singular points.
- 1885: King Oscar II of Sweden's prize competition on the three-body problem spurs Poincaré's qualitative methods.
- 1892: "Les méthodes nouvelles de la mécanique céleste" further develops phase-space geometric techniques.
- 1912: Poincaré dies in Paris; his qualitative classification remains the standard language for planar dynamical systems.
Why do trace and determinant alone determine the whole phase portrait?

Because the characteristic polynomial of a 2×22\times2 matrix, λ2−Tλ+D\lambda^2 - T\lambda + D, depends only on TT and DD, and the qualitative shape of solutions to x′=Ax\mathbf x'=A\mathbf x depends only on the type of the eigenvalues (real vs. complex, signs, multiplicity) — not on the specific entries of AA or the specific eigenvectors. Different matrices with the same (T,D)(T,D) can have completely different eigenvectors, meaning the orientation of the phase portrait (which lines are the eigenlines, how stretched the spiral is) differs, but the topological type — saddle, node, spiral, center — is identical. This is why (T,D)(T,D) functions as a complete coordinate system for qualitative type, even though it does not pin down the exact picture.

What's the geometric difference between a proper (star) node and an improper node?

In a proper/star node, every direction is an eigenvector (this only happens when AA is a scalar multiple of the identity, A=λIA=\lambda I), so trajectories are exactly straight rays from the origin, radiating outward or inward symmetrically in all directions with no preferred direction. In an improper node, there are exactly two eigendirections (with distinct eigenvalues), and trajectories are curved, becoming tangent to the slow eigenline (the one with the eigenvalue smaller in magnitude) as they approach or leave the origin. The improper node is by far the generic case; the star node is a knife-edge special case requiring AA to already be diagonal-like.

Can a center exist for a genuinely nonlinear system, not just its linearization?

Yes, but it requires extra structure — typically the system must be Hamiltonian, reversible, or otherwise possess a conserved quantity that forces closed orbits, because generically the nonlinear terms perturb a linear center into a weak spiral (this is the classical center-focus problem). The frictionless pendulum θ′′=−sin⁡θ\theta'' = -\sin\theta linearizes to a center at θ=0\theta=0, and indeed the full nonlinear pendulum also has a true center there because energy is conserved. Without such a conservation law, a linear center is not robust: arbitrarily small nonlinear perturbations can turn it into a stable or unstable spiral, which is precisely why centers are called a non-hyperbolic, structurally unstable case.

How does the direction of time affect saddle, node, and spiral pictures?

Reversing time (t→−tt \to -t) replaces AA by −A-A, which negates TT but leaves DD unchanged (since det⁡(−A)=(−1)2det⁡A=det⁡A\det(-A) = (-1)^2\det A = \det A in two dimensions). So saddles map to saddles (their stable and unstable eigenlines simply swap roles), stable nodes become unstable nodes with the same eigenlines, and stable spirals become unstable spirals winding the same way but now growing instead of decaying. Centers are invariant under time reversal up to reversing the direction of traversal around each closed orbit. This symmetry is a quick way to generate the unstable counterpart of any stable example.

Does every matrix with complex eigenvalues necessarily produce visible spiraling, or could it look like a node?

Complex eigenvalues (equivalently Δ<0\Delta<0) always produce genuine rotation in the phase plane, never node-like straight-line approach, because there is no real eigenvector at all — a real eigenvector would force a real eigenvalue. The angular coordinate of any nonzero solution advances at the constant nonzero rate β=−Δ/2\beta = \sqrt{-\Delta}/2 forever, so the trajectory must wind around the origin infinitely many times as t→±∞t\to\pm\infty, producing either a genuine spiral (T≠0T\ne0) or a genuine closed loop (T=0T=0); it can never settle into a fixed direction the way node trajectories do.

Why is the boundary case Δ=0\Delta = 0 geometrically special, and is it commonly seen in applications?

At Δ=0\Delta=0 the two eigenvalues collide into a single repeated real eigenvalue, marking the exact transition point between the oscillatory spiral regime and the non-oscillatory node regime — physically, this is the boundary of critical damping in a damped oscillator, the precise threshold value of a damping coefficient below which the system oscillates (underdamped, spiral) and above which it does not (overdamped, node). It is a measure-zero set in the (T,D)(T,D)-plane (a single parabola), so "generic" matrices avoid it, but it is engineered deliberately in applications such as shock absorbers, where critical damping is the design target for fastest return to equilibrium without overshoot.

Is the trace-determinant classification specific to two dimensions, or does something similar work in higher dimensions?

The clean (T,D)(T,D)-plane picture is special to 2×22\times2 matrices because a 2×22\times2 characteristic polynomial has exactly two coefficients beyond the leading one, matching TT and DD exactly. In nn dimensions, the characteristic polynomial has nn independent coefficients (related to all the elementary symmetric functions of the eigenvalues, not just the first and last), so no single two-parameter diagram captures all qualitative types; classification becomes a matter of counting eigenvalues with positive, negative, and zero real parts (and further sub-cases from Jordan blocks), generalizing the saddle/node/spiral trichotomy into higher-dimensional stable/unstable/center manifold theory.

Before this

Where this leads