Stability and Classification of Equilibria
Suppose a population of two competing species sits at a delicate balance point. Will a small disturbance fade away, oscillate forever, or explode? This question, and thousands like it in mechanics, circuits, chemistry, and economics, reduces near equilibrium to a single piece of linear algebra: the eigenvalues of a matrix. The remarkable fact is that the entire qualitative behavior of a linear planar system is captured by just two numbers extracted from that matrix. These are its trace and its determinant. These two numbers can be plotted on a single plane. That plane organizes every possible phase portrait into contiguous regions. This matters because nonlinear systems are, near their fixed points, governed to leading order by exactly this linear theory, via linearization. Knowing the complete classification of linear planar equilibria is therefore the indispensable first tool for understanding any planar dynamical system. This applies from the Lotka–Volterra equations to the Van der Pol oscillator. The trace-determinant plane turns an eigenvalue computation into a single glance at a picture. The big picture is this: a linear system has its long-term behavior at the origin entirely determined by the sign and nature of the eigenvalues of . Those eigenvalues are the roots of a quadratic polynomial. Its coefficients are exactly and . Different regions of the -plane correspond to nodes, saddles, spirals, centers, and degenerate cases. These regions are separated by explicit curves and lines. This article builds the classification from first principles. It proves the central stability theorem rigorously. It works through two asymmetric numerical examples. It also shows exactly which hypothesis is doing the work when the classification threatens to break down. Namely, this concerns the case of repeated eigenvalues and the delicate marginal case of centers.
- A linear planar system has eigenvalues that are roots of .
- Stability of the origin is governed entirely by the real parts of these eigenvalues — this is the content of the central theorem.
- The trace-determinant plane divides into regions: saddles (), nodes, spirals, and centers, separated by the axis and the parabola .
- Repeated eigenvalues sit exactly on the discriminant parabola and split into two sub-cases: proper nodes (only if is a scalar multiple of ) and improper nodes.
- Purely imaginary eigenvalues (centers) are a razor's-edge case: an arbitrarily small nonlinear perturbation can turn a center into a spiral, so the classification for linear systems does not automatically transfer to nonlinear ones at that boundary.
- Key idea: the pair is a complete, computable invariant that classifies every linear planar equilibrium without ever solving for eigenvalues explicitly.
Where this lives today
The trace-determinant classification is the entry point for linear stability analysis in nearly every applied field that models continuous change. In population biology, the Jacobian of the Lotka–Volterra predator-prey equations at a coexistence equilibrium is evaluated and its checked to determine whether populations spiral toward a steady coexistence or oscillate without damping — the classic result that undamped Lotka–Volterra dynamics sit exactly on the center line is a textbook illustration of the fragility discussed in the warning above. In electrical engineering, the same linear analysis governs circuits: the discriminant directly controls whether a circuit is overdamped (node), critically damped (repeated eigenvalue), or underdamped (spiral), with the trace playing the role of (negative) damping and the determinant playing the role of the squared natural frequency. In control theory, engineers deliberately place the eigenvalues of a closed-loop system matrix using feedback gains, and the trace-determinant plane gives an immediate visual target: engineers push into the upper-left "stable spiral" or "stable node" region to guarantee asymptotic stability of a controlled plant, a technique underlying everything from cruise control to aircraft autopilots. In numerical analysis and dynamical systems computing, the classification underlies bifurcation theory: as a parameter varies, the point traces a path in the plane, and qualitative changes in behavior (Hopf bifurcations, saddle-node bifurcations) occur precisely when this path crosses the boundary curves identified in the classification — the vertical axis (with ) for Hopf bifurcations, and the horizontal axis for saddle-node bifurcations. This connects directly to Phase Portraits for Linear Systems and to the broader theory built on The Matrix Exponential, and the eigenvalue framework here is the linear backbone beneath the study of Nonlinear Systems and Linearization.
Ask the tutor: How does adding a small nonlinear term to a linear center determine whether the resulting equilibrium becomes a stable spiral, an unstable spiral, or remains a genuine center?
Let be a real matrix and consider the linear system
The origin is always an equilibrium (fixed point) of this system, since . Define the trace and the determinant . The eigenvalues of (possibly complex, possibly equal) are the roots of the characteristic polynomial
so that and , and the discriminant is . The origin is called:
- asymptotically stable if as for every solution, and every neighborhood of contains a smaller neighborhood that no trajectory starting in it ever leaves;
- stable (Lyapunov stable, not necessarily asymptotic) if every neighborhood of contains a neighborhood such that any trajectory starting in stays in for all ;
- unstable if it is not stable.
The classification of the equilibrium (saddle, node, spiral, center, etc.) refers to the geometric type of the phase portrait near , determined by as developed below. A system for which every trajectory near the origin has this qualitative behavior arbitrarily close to as well is said to have that behavior globally (since the system is linear, all trajectories are defined for all and the local and global pictures coincide).
Intuition
Think of the plane whose horizontal axis is the trace and vertical axis is the determinant . Every real matrix is a single point in this plane — many different matrices can share the same point, but they all produce qualitatively the same phase portrait, because the classification only depends on . The characteristic equation has roots
The quantity under the square root, , is zero exactly on the parabola . Above this parabola () the eigenvalues are a complex-conjugate pair, giving spirals or centers; below it () they are real, giving nodes or saddles. Crossing (the horizontal axis) is special: one eigenvalue passes through zero, since . Below this axis, forces the two real eigenvalues to have opposite signs — a saddle, always unstable, regardless of . Crossing the vertical axis inside the region (complex eigenvalues) sends a spiral from decaying to growing, or turns it into the marginal case of a center when exactly.
The picture makes the qualitative rule visible: stability (left half-plane, ) sits to the left of the vertical axis whenever , instability to the right, and the entire lower half-plane is saddle territory no matter what is. The red parabola is the frontier between real and complex eigenvalues — nodes below it, spirals/centers above it.
Let be a real matrix with , , , and eigenvalues as above. Consider . Then exactly one of the following holds, and the origin's stability and geometric type are as stated: 1. (, saddle.) The eigenvalues are real with , hence of opposite sign. The origin is a saddle point and is unstable. 2. (, , node.) The eigenvalues are real, distinct, and same-signed (since ). The origin is a node:
- if : both eigenvalues negative, the node is asymptotically stable;
- if : both eigenvalues positive, the node is unstable.
3. (, , , repeated real eigenvalue.) There is a single real eigenvalue of algebraic multiplicity two. The origin is a degenerate node (proper if is a scalar matrix, improper otherwise):
- if : asymptotically stable;
- if : unstable.
4. (, , , spiral.) The eigenvalues are complex conjugates with . The origin is a spiral (focus):
- if : asymptotically stable;
- if : unstable.
5. (, , center.) The eigenvalues are purely imaginary, . The origin is a center: every trajectory (other than the origin itself) is a closed periodic orbit, and the origin is stable but not asymptotically stable. 6. (, degenerate.) At least one eigenvalue is zero, so is singular and there is a whole line (the kernel of ) of equilibria. The origin is not asymptotically stable; it is stable only in the sub-case (one negative eigenvalue, one zero eigenvalue, with the zero eigenvalue's eigenspace consisting entirely of equilibria) and unstable if . In every case where both eigenvalues have nonzero real part (cases 1–4), the origin is called a hyperbolic equilibrium, and asymptotic stability holds if and only if and , i.e. if and only if both eigenvalues have strictly negative real part.
We prove the theorem by explicit construction of the fundamental solutions in each case, using the real Jordan canonical form of , and then reading off the asymptotics as . This is the standard technique of classification via Jordan form, and it is non-circular: it uses only linear algebra (existence of Jordan/real-canonical form for real matrices) and elementary calculus of the exponential and trigonometric functions, none of which presuppose the present theorem.
Step 1: Reduction to canonical form. Every real matrix is similar, via some invertible real or complex change of basis , to exactly one of the following canonical forms , according to its eigenvalue type: (a) if has two distinct real eigenvalues ; (b) if has a repeated real eigenvalue and is not itself (non-diagonalizable case); (c) if exactly (repeated eigenvalue, already diagonal — the proper node/star case); (d) , , if has complex eigenvalues . This is a standard fact from linear algebra (Jordan canonical form over , converted to a real canonical form by taking real and imaginary parts of a complex eigenvector in case (d)); we take it as known, since it is prerequisite algebra, not part of the ODE theory being developed. If , then becomes (since is a constant invertible matrix, ), and being invertible and continuous with continuous inverse means iff , and stability of the origin for one system is equivalent to stability for the other (a linear change of coordinates is a homeomorphism fixing the origin, so it preserves every topological stability property and preserves orbit-closedness). Trace and determinant are similarity invariants (, ), so computed from agree with those from . It therefore suffices to prove the theorem for each canonical form .
Step 2: Case (a), distinct real eigenvalues — proves items 1, 2. Here for arbitrary constants (immediate by solving the decoupled scalar equations , ). Here , . If : have opposite signs; say . Along the -axis (), solutions grow like ; along the -axis they decay to . Every neighborhood of the origin contains points with arbitrarily small, and for these, , so such trajectories leave any fixed bounded neighborhood of the origin. Hence the origin is not stable: this is the saddle, unstable, proving item 1. If and (automatic here since eigenvalues distinct) with : then and force both (if one were , the product could not be positive while the sum is negative, unless both are negative — check: if both were positive the sum would be positive, contradiction; if one were zero the product would be zero, contradiction; if they had opposite sign the product would be negative, contradiction; so both negative). Then as , and moreover for , , so trajectories starting close to stay close (indeed monotonically closer along each axis, and by the triangle inequality bounded by the initial norm times a decaying exponential overall once ). This gives both stability and convergence to : asymptotically stable node. If , : symmetric argument with both gives for every nonzero initial condition, so the origin is unstable: unstable node. This proves item 2 in both sub-cases.
Step 3: Case (b), repeated eigenvalue, non-diagonalizable — proves item 3. Here with , , so automatically, consistent with item 3's hypothesis. Solving gives ; then is linear first-order, solved by integrating factor :
So . If (i.e. ), then exponentially, and as well (exponential decay dominates any polynomial growth, a standard calculus fact: for , by L'Hôpital or by comparison with for large ). Hence . For stability: given , since is bounded on by a constant times (the function is bounded on for , attaining a finite maximum ), we get for all , giving Lyapunov stability, hence together with convergence, asymptotic stability. If (), taking gives , so unstable. This is the improper (degenerate) node, proving item 3's non-scalar sub-case; the case exactly gives , straight-line trajectories through the origin (a proper node or star point), with the identical stability dichotomy by the same exponential estimate.
Step 4: Case (d), complex eigenvalues — proves items 4 and 5. Here , , , , and , consistent with the case-4/5 hypotheses (). Passing to polar coordinates , in the -plane, direct differentiation of along solutions gives
so (for ), giving . Meanwhile satisfies (a similar computation with ), so , a steady rotation at constant angular speed . If (): monotonically and, since is monotonically non-increasing in (as ), for all : this gives both convergence to the origin and Lyapunov stability, hence asymptotic stability. Trajectories spiral inward while rotating: stable spiral. If (): , giving instability: unstable spiral. This proves item 4. If (): for all — every trajectory is a circle of constant radius in the -coordinates, traversed at constant angular speed , hence a closed periodic orbit of period . In the original -coordinates, traces a closed curve (an ellipse, the linear image of a circle) since is periodic with period and is a fixed linear map, so for all . Since exactly, for any choosing (more simply: the norm of never changes, and ) shows every trajectory starting within of the origin stays within of it for all time. This gives Lyapunov stability. But does not converge to for any nonzero initial condition (it has constant, positive for all ), so it is not asymptotically stable. This is the center, proving item 5.
Step 5: Case — proves item 6. If , one eigenvalue (say ) is zero. If we are in case (a) with : . The entire axis (i.e. the -eigenspace, ) consists of fixed points of the flow, since there. If (), trajectories with converge to the point on this line, not to the origin (unless ), yet stay within of their starting horizontal distance, bounded — giving stability of the origin (small perturbations stay small, though they do not decay to ) but not asymptotic stability, since points on the equilibrium line never move. If (), for any , giving instability. If then and either (every point is a fixed point, trivially stable, not asymptotically stable) or is nilpotent nonzero (case (b) with ), giving , unbounded whenever : unstable. This establishes item 6.
Step 6: Hyperbolic summary. Collecting cases 1–4: asymptotic stability occurred precisely when and , across the diagonalizable, repeated-eigenvalue, and complex sub-cases uniformly — and this is exactly the condition that both eigenvalues have strictly negative real part, since when complex, and both real eigenvalues are negative iff their sum is negative and product positive (shown in Step 2). Item 6, , was excluded from "hyperbolic" by definition since a zero eigenvalue has zero real part. This completes the proof of every case, hence the theorem.
∎Worked examples
Example 1 — a stable improper node arising from a damped mechanical system. Consider a linear system arising from a mass-spring-damper reduction (deliberately asymmetric, non-diagonal):
Compute
Discriminant: . Since exactly and , we are in case 3 of the theorem: a repeated real eigenvalue, . Check directly: , confirming (double). Since , the theorem predicts an asymptotically stable degenerate node. Is it proper or improper? (since ), so it is the improper case, matching Step 3 of the proof (non-diagonalizable Jordan block). We verify by finding the eigenvector: gives , so spans a one-dimensional eigenspace — confirming non-diagonalizability (a matrix with a repeated eigenvalue and only a one-dimensional eigenspace is defective). A generalized eigenvector solves : , satisfied by . The general solution is
As , dominates the linear factor , so for every choice of — matching the theorem's prediction of asymptotic stability, and the trajectories approach the origin tangent to the eigenvector direction , the signature geometric feature of an improper node.
Example 2 — an unstable spiral from a feedback loop. Consider
Compute
Discriminant , and , : case 4 of the theorem, an unstable spiral. Directly: . So , , matching and exactly, confirming the formula from the proof. By the polar computation in Step 4 of the proof (applied after transforming to real Jordan form), : the radius in the transformed coordinates grows without bound, and the angle rotates at constant rate . Concretely, one real Jordan basis is given by where is a complex eigenvector for : solving , i.e. , the first row gives ; taking gives , so . Thus , and the real general solution is
which spirals outward (the factor ) while rotating with angular frequency — an unstable spiral exactly as the trace-determinant criterion predicted, without ever needing this explicit solution to draw the conclusion.
The theorem's cases 1–2 assumed distinct real eigenvalues; suppose instead we tried to naively extend the node formula to the repeated-eigenvalue case by simply setting . This gives — but this formula was derived assuming is diagonalizable, and it silently loses a dimension of solutions when and is not diagonalizable, since the general solution to a system needs two linearly independent solutions and for the single eigenvector only gives one. Take with , as in Example 1's Jordan block. Here , , : this sits exactly on the discriminant parabola, so it is not covered by the distinct-real-eigenvalue case at all. If one incorrectly applied the diagonalizable-case formula, assuming a second linearly independent eigenvector exists, one would predict a family of straight-line trajectories through the origin in two independent eigendirections — a proper (star) node. But has only the single eigendirection (check: ), so there is no second straight-line solution. The actual solutions, as derived in the proof's Step 3, are — curves that approach the origin tangent to the single eigendirection , definitely not straight lines for . This shows exactly why the theorem must isolate as its own case (item 3) with its own proof (Step 3, using a generalized eigenvector and an integrating factor), rather than being swept in as a limiting case of item 2's formula: the qualitative geometry (improper node with tangent approach, versus a naive prediction of two straight eigendirections) genuinely changes, and only the correct Jordan-block computation captures it.
Scope, edge cases & common traps
| Situation | What can go wrong | Correct statement |
|---|---|---|
| exactly | Assuming two independent straight-line solutions always exist | Only if (proper node); else improper node with a term |
| , (center) | Assuming the nonlinear system also has a center | False in general — nonlinear terms can turn a linear center into a spiral (structural instability) |
| Calling the origin "asymptotically stable" whenever | Never asymptotically stable when : a whole line of equilibria persists | |
| Checking before concluding instability | Unnecessary — alone forces a saddle, unstable regardless of | |
| Applying the theorem to a nonlinear system directly | Using of the Jacobian at a non-hyperbolic point ( or ) to conclude nonlinear stability | Linearization only determines nonlinear stability at hyperbolic equilibria (Hartman–Grobman); non-hyperbolic cases require higher-order analysis |
The mathematician behind it
Origins · 1 minAleksandr Mikhailovich Lyapunov and how this was discovered
Lyapunov's 1892 doctoral dissertation, The General Problem of the Stability of Motion, established the modern definitions of stability used throughout this article and proved that the linearization of a system correctly predicts stability whenever the linear part is hyperbolic — the theoretical justification for treating -based classification as more than a curiosity about linear systems. His work synthesized earlier results on small oscillations (going back to Lagrange and Poincaré's qualitative theory of differential equations) into a rigorous, general framework applicable to nonlinear systems as well.
Why do trace and determinant alone determine the entire phase portrait type?
Because the eigenvalues of a matrix are exactly the two roots of , and by Vieta's formulas the sum of the roots is and the product is . Any two numbers satisfying produce the identical qualitative long-term behavior in the linear ODE — real part sign, whether eigenvalues are real or complex, and whether they're repeated — since the solution formulas depend only on the eigenvalues (and generalized eigenvectors, whose existence pattern is also fully determined once pin down ). So is a complete invariant of the qualitative type, even though it does not determine the exact eigenvectors or the precise shape of the trajectories.
What exactly is the difference between "stable" and "asymptotically stable"?
Stable (Lyapunov stable) only requires that trajectories starting close to the equilibrium stay close forever; it says nothing about whether they approach the equilibrium. Asymptotic stability requires both that property and convergence to the equilibrium as . A center is the sharpest illustration: trajectories are closed loops that stay at a fixed distance from the origin forever, satisfying Lyapunov stability, but they never get closer to the origin, so it is not asymptotically stable. Every asymptotically stable equilibrium is automatically Lyapunov stable, but the converse is false, precisely because of examples like the center.
If , is the origin still an isolated equilibrium?
No. When , the matrix is singular, meaning it has a nontrivial kernel: every vector in that kernel is also mapped to zero by , hence is itself an equilibrium of . So the origin sits on an entire line (or, if , an entire plane) of equilibria, and it cannot be asymptotically stable, since nearby equilibria on that line simply stay put rather than converging to the origin. This is why the classification theorem treats as a separate, always-non-hyperbolic case.
Does the trace-determinant classification apply directly to nonlinear systems?
Only indirectly, through linearization, and only when the linearization is hyperbolic. The Hartman–Grobman theorem guarantees that near a hyperbolic equilibrium (Jacobian with in the planar case, i.e. no eigenvalue with zero real part), the nonlinear system's phase portrait is topologically the same as its linearization's. But at non-hyperbolic points — especially centers, where — nonlinear terms can completely change the qualitative picture, turning a linear center into a nonlinear spiral. So the plane classifies linear systems exactly, and nonlinear systems only away from its boundary curves.
How does one remember which region is which without redoing the eigenvalue algebra each time?
Memorize four facts and derive the rest instantly. First, is always a saddle (opposite-signed real eigenvalues), independent of . Second, means a degenerate line of equilibria. Third, above the parabola eigenvalues are complex (spiral/center territory); below it, real (node/saddle territory). Fourth, within either territory, the sign of alone decides stable versus unstable, because is twice the common real part of the eigenvalues (or their sum). Combining these four facts lets you read off the classification from without ever solving the characteristic polynomial explicitly.
Can two matrices with the same trace and determinant have visually different phase portraits?
They can differ in orientation, scaling, and the specific eigenvector directions, but not in qualitative type. For instance, two different node matrices with the same might have their stable/fast and stable/slow eigendirections at different angles, giving trajectories that curve differently in the plane, but both are still asymptotically stable nodes with straight-line solutions along two eigendirections. The theorem's classification is by topological type (saddle, node, spiral, center, and their stability), not by the exact geometric picture, which additionally depends on the eigenvectors of (equivalently, on the change-of-basis matrix used in the proof).
Why does the proof require the real Jordan canonical form instead of working with directly?
Working directly with a general requires solving a coupled linear system whose solution formulas depend messily on all four entries. Jordan form isolates exactly the invariant information — the eigenvalues and whether is diagonalizable — and reduces the ODE to a decoupled or nearly-decoupled system solvable by inspection. Since a linear coordinate change is a homeomorphism of the plane fixing the origin, it cannot alter any topological stability property or the trace/determinant values, so proving the theorem for the canonical forms is fully equivalent to proving it for itself, while being vastly simpler.