Stability Concepts and Definitions
What does it mean for a pencil balanced on its tip to be "unstable"? What does it mean for a marble resting at the bottom of a bowl to be "stable"? Both are equilibria of some dynamical system. Yet they behave utterly differently when nudged. This article makes that intuitive difference completely precise. It uses only distances and inequalities. No linearization, no eigenvalues, no calculus of variations is required at the outset. The concepts of Lyapunov stability, asymptotic stability, and instability form a vocabulary. Every later theorem about long-term behavior of dynamical systems is phrased in it. Before we can prove that a system settles into equilibrium, we need sharp definitions. The same holds if it spirals away, or oscillates forever nearby. We need a definition sharp enough to be tested against examples. It must also be robust enough to survive generalization. This includes infinite dimensions, non-autonomous systems, and beyond. The central idea is this: stability is about trapping trajectories that start close. It is not about a system "wanting" to return anywhere. This is a purely metric, epsilon-delta notion. It is structurally identical to the definition of continuity — a fact we exploit for intuition. Asymptotic stability adds a stronger demand. Nearby trajectories must actually converge to the equilibrium. They must not merely stay near it forever. This article gives the formal definitions. It proves the basic logical relationships between them. Asymptotic stability implies stability, but not conversely. Stability does not imply attraction. It works through fully explicit planar examples. It shows exactly what breaks when each hypothesis is dropped. It sets up the machinery — without yet using it. This prepares for Lyapunov Functions and Stability. It also prepares for the qualitative analysis of Conservative Systems and the Pendulum.
- An equilibrium is Lyapunov stable if trajectories starting close enough stay arbitrarily close forever.
- It is asymptotically stable if it is stable and nearby trajectories converge to it as .
- It is unstable if it fails to be stable — some trajectories starting arbitrarily close eventually escape a fixed neighborhood.
- Stability alone does not imply convergence (centers are stable but not asymptotically stable).
- Convergence alone does not imply stability — a subtle trap without the uniform "stay close" clause.
- Key idea: stability is an – trapping condition on trajectories, exactly parallel to continuity, and it is logically weaker than — and a prerequisite for — asymptotic convergence.
Where this lives today
Stability definitions of exactly this – form appear across control theory, where "the closed-loop system is stable" is a certificate engineers must prove before deploying autopilots, power grid controllers, or chemical process regulators — instability of an equilibrium there literally means a plane, reactor, or grid runs away. In numerical analysis, the stability of a fixed point of an iterative scheme (Newton's method, gradient descent) is analyzed with the same definitions applied to discrete-time maps. In population biology and epidemiology, the stability of a disease-free equilibrium versus an endemic equilibrium (governed by the basic reproduction number ) is a direct application of Theorem (3)'s eigenvalue criterion to the linearized Jacobian of a compartmental model. In economics, the stability of market equilibria under tâtonnement dynamics is analyzed with identical machinery. Cryptographic and coding-theoretic dynamical constructions (e.g. stability of fixed points in certain pseudorandom generators modeled as dynamical systems) borrow the same vocabulary, and the entire apparatus is the direct prerequisite for the constructive, non-eigenvalue-based method of Lyapunov Functions and Stability, which is in turn essential for analyzing systems like the undamped and damped pendulum in Conservative Systems and the Pendulum where equilibria are not hyperbolic and eigenvalue tests alone are silent.
Ask the tutor: Can you show me how to determine, from scratch, whether the origin of is asymptotically stable, without using eigenvalues?
Let be an autonomous system, where is continuous on an open set , and suppose is locally Lipschitz on so that solutions through each initial point exist and are unique on their maximal interval of existence. Let be an equilibrium, i.e. . Write for the solution with .
(Lyapunov stable.) The equilibrium is stable if for every there exists such that
and in particular is defined for all whenever .
(Unstable.) The equilibrium is unstable if it is not stable: there exists such that for every there is some with and some time (possibly depending on ) with .
(Asymptotically stable.) The equilibrium is asymptotically stable if it is stable and there exists such that
If can be taken to be (any finite starting point, or all of ), the equilibrium is globally asymptotically stable.
Intuition
Think of stability as a game between an adversary and you. The adversary names a tolerance — a tube of radius around the equilibrium that trajectories must never leave. Your job is to find a starting radius small enough that any trajectory launched inside it never escapes the tube. If you can always win this game, no matter how small is, the equilibrium is stable. If the adversary can always find a trajectory that eventually breaks out of some fixed tube, no matter how close to the equilibrium it started, the equilibrium is unstable. This is exactly the logical shape of the – definition of continuity of a function at a point, with "output" replaced by "trajectory value at time ," except stability demands the bound hold uniformly over all future time , not just at a single input. That extra universal quantifier over time is what makes stability a genuinely dynamical concept rather than a static one. Asymptotic stability is a strictly stronger request: not only must the tube-confinement game be winnable, but trajectories starting near must actually be reeled in to the point itself as . A center — like the origin for the linear system , whose orbits are circles — satisfies the confinement game (any circle of radius stays inside radius if ) but a trajectory on a circle of radius never approaches the origin. Hence stable but not asymptotically stable.
The central theorem
Let satisfy the hypotheses of the Definition of Stability above (continuous, locally Lipschitz on open , equilibrium ). Then:
(1) Asymptotic stability implies stability. (This is built into the definition, but the content is that the "attracting" clause could not, by itself, replace the "stable" clause — see the counterexample below for why both are needed as separate hypotheses.)
(2) Stability does not imply asymptotic stability. (Centers are the standard counterexample.)
(3) For a linear system with a real constant matrix, the origin is: (a) asymptotically stable if and only if every eigenvalue of has strictly negative real part; (b) stable (but not necessarily asymptotically stable) if and only if every eigenvalue has real part , and every eigenvalue with real part exactly is semisimple (its algebraic and geometric multiplicities coincide); (c) unstable if and only if some eigenvalue has strictly positive real part, or some eigenvalue with zero real part fails to be semisimple.
We prove (1), (2), and then (3), which is the substantive classification result. The technique for (3) is direct computation with the matrix exponential together with a normal-form (Jordan) decomposition, plus explicit – verification.
(1) Immediate from the definition: "asymptotically stable" is defined as "stable, and moreover attracting." So it logically implies stability by conjunction elimination. There is no independent content to prove here; the point of stating it is that the definition of asymptotic stability does not say merely "attracting," precisely because attraction alone can fail to give stability (see the counterexample block).
(2) Take , , so . The general solution with is
which one verifies by direct substitution satisfies and and matches the initial condition at . Then
so for all : every trajectory is a circle centered at the origin, traversed at constant speed. Given , choose ; then forces for all . This proves stability. But if , then , so does not converge to the origin. Hence the origin is stable but not asymptotically stable, proving (2).
(3) Write , the unique solution of the linear IVP (existence and uniqueness of this exponential-form solution is a standard fact about constant-coefficient linear systems, proved independently of stability theory, so invoking it here is not circular). Operator norm bound via Jordan form. Let be a Jordan decomposition over (or the real Jordan form over ; the argument is identical up to bounded real changes of basis). Then , and since are fixed invertible matrices there are constants with
so it suffices to analyze block by block. For a single Jordan block of size with eigenvalue ,
where has entries that are polynomials in of degree at most (bounded contribution from the nilpotent part) and (rotation, norm-preserving). Thus every entry of has magnitude bounded by for a constant depending only on . Proof of (a). Suppose every eigenvalue has . Let . By the block estimate above, each block satisfies , and since for any , polynomial growth is dominated by exponential decay: for any there is with
hence for all (absorbing constants). Given , set ; then gives for all since . This proves stability, and since as (as ), every trajectory converges to ; taking shows this is in fact global asymptotic stability. Conversely, suppose some eigenvalue has . If we show instability directly below in the proof of (c); if , pick the corresponding eigenvector direction (real or, for a complex pair, the real invariant plane it spans); the solution started on this eigenspace has either constant (semisimple case, purely oscillatory, as in the center example) or growing polynomially (non-semisimple case, e.g. a Jordan block with gives solutions with a term linear in ). In neither case does for in that eigenspace, so asymptotic stability fails. This establishes the "only if" direction of (a). Proof of (b) and (c). Suppose every eigenvalue has , and every eigenvalue with is semisimple, meaning its Jordan blocks all have size . For blocks with the estimate above still gives . For a block with purely imaginary, has modulus exactly for all — no polynomial growth factor appears since means there is no nilpotent part. Hence every block of is bounded uniformly in by a constant depending only on (not growing polynomially), so there is with for all . Given take : then for all , proving stability. It need not be asymptotic: the center example in part (2) is exactly the case of a single semisimple purely-imaginary pair, and there does not tend to . Finally, for (c): if some eigenvalue has , let be a corresponding (generalized) eigenvector, and consider for small . Along the associated invariant subspace, for a constant (the eigenvector case gives this directly from , and ; for a genuine Jordan chain the growth is even faster). No matter how small is chosen (i.e. no matter how small the adversary is handed), this norm eventually exceeds any fixed at some finite time . This exhibits, for every , a point with whose trajectory leaves the ball of radius — verifying the instability definition. The non-semisimple purely-imaginary case was already handled in the converse direction of (a): a Jordan block of size with contributes a factor growing like (unbounded), giving trajectories with along that generalized eigenspace, again witnessing instability. This exhausts all cases and completes the proof of (3), hence of the theorem.
∎Worked examples
Example 1 (asymmetric linear system — direct verification, no shortcuts). Consider
The matrix is , upper triangular, with eigenvalues read off the diagonal: , , both real and distinct, both strictly negative. We do not stop at citing Theorem (3)(a) — we verify by solving explicitly. From the second equation, . Substituting into the first,
This is linear first-order; the integrating factor is , giving , so , hence
Check at : . ✓. Now bound: for (since ), and . Using ,
Given , choose (using the norm consistently); then gives for all , confirming stability directly from the explicit solution. Since the bound also as , the origin is (globally) asymptotically stable — matching Theorem (3)(a), but now proved from scratch for this specific asymmetric system rather than merely cited.
Example 2 (a nonlinear system — Lyapunov stability without any linear-algebra shortcut). Consider the planar system
The origin is an equilibrium since both right sides vanish at . Linearizing, the Jacobian at the origin is , so the linearization already suggests asymptotic stability — but we verify the nonlinear claim directly, since the standard linearization theorem (Hartman–Grobman-type reasoning) is a separate later result we are not entitled to assume here. Define (this anticipates, but does not require citing, Lyapunov Functions and Stability; here we use it only as a direct computational device, verified from first principles). Along a trajectory,
The cross terms and cancel exactly — this cancellation is a genuine feature of this specific vector field, not a generic phenomenon, and the reader should confirm it by direct substitution as above. So , a linear ODE for itself, giving exactly, for as long as the solution exists. Since for all in the domain of existence, solutions starting in the disk remain in the closed disk of radius for all forward time; by the standard continuation theorem for ODEs (a solution with values remaining in a compact subset of extends for all ), the solution exists for all . Now given , take : if then for all , i.e. . This proves stability directly. Moreover , forcing . Hence the origin is asymptotically stable — indeed globally, since the bound holds for every finite . This example shows the definitional machinery applied to a genuinely nonlinear system where no eigenvalue computation alone would suffice to conclude anything about the full nonlinear flow.
The definition of asymptotic stability requires both stability and attraction — one might wonder whether attraction (every nearby trajectory converges to ) implies stability on its own, making the conjunction redundant. It does not. Here is an explicit planar system, due in spirit to Vinograd, where every single trajectory near the origin converges to the origin, yet the origin is not Lyapunov stable, because trajectories are forced to travel far away first. Consider the origin as equilibrium of a vector field constructed (in polar-type coordinates, made globally smooth by an explicit formula) so that trajectories starting arbitrarily close to the origin are swept out along a path that first travels a bounded distance away before curving back and converging to the origin. Concretely, one such system (Vinograd's example) is
for , extended by at the origin. One can verify (this requires care, since the field is a nontrivial rational function) that:
- every trajectory other than the origin itself converges to the origin as : attraction holds for every initial condition, not just those near the origin;
- nonetheless, for a fixed small (specifically some less than the "excursion radius" built into the construction), every neighborhood of the origin contains initial points whose trajectories are driven outward past distance before eventually turning back.
The mechanism is that trajectories starting at points closer and closer to the origin still get funneled onto a family of loop-shaped curves passing near a fixed point before spiraling in; as , the maximum excursion distance from the origin along the trajectory does not shrink to — it stays bounded below by some fixed positive constant. This is precisely a failure of the uniformity in built into the stability definition: attraction is a statement about for each fixed starting point, but stability additionally demands a that works uniformly, at every finite time, not just eventually. The lesson: the definition of asymptotic stability must explicitly conjoin stability with attraction as two separate clauses, because in dimension these are logically independent conditions — dropping the stability clause and defining "asymptotic stability" as mere attraction would wrongly certify Vinograd's origin as well-behaved, when in fact a tiny perturbation can produce an arbitrarily large (though finite and transient) excursion.
Scope, edge cases & common traps
| Situation | What to check | Common error |
|---|---|---|
| Purely imaginary eigenvalues, all simple | Stable, not asymptotically stable (center-type) | Concluding "eigenvalues have " asymptotic stability |
| Purely imaginary eigenvalue in a Jordan block of size | Unstable (polynomial-in- growth) | Assuming always gives at least stability |
| Nonlinear system, linearization has a zero-real-part eigenvalue | Linearization is inconclusive; need higher-order/Lyapunov methods | Reading off stability from the linear part alone |
| "Attracting" trajectories found by simulation | Must separately check the uniform -clause | Declaring asymptotic stability from attraction alone (Vinograd-type trap) |
| depending on instead of only on | Definition requires one working for all simultaneously | Silently allowing to shrink as grows, which is not a valid |
The mathematician behind it
Origins · 1 minAleksandr Mikhailovich Lyapunov and how this was discovered
Lyapunov worked in St. Petersburg under Chebyshev's influence, applying rigorous analysis to problems of rotating fluid masses and mechanical equilibria. His 1892 doctoral dissertation, The General Problem of the Stability of Motion, introduced the precise definitions treated in this article and the energy-function method that bears his name, unifying what had been case-by-case mechanical arguments into a single analytic framework applicable to any system of ordinary differential equations.
Why does the definition require to depend only on , not on ?
If were allowed to shrink as increases, the condition would become vacuous or would collapse to something much weaker than intended: one could always satisfy "closeness at each individual time" by choosing an ever-smaller starting neighborhood for each new time horizon, without ever controlling the whole future trajectory at once. The entire content of stability is that a single, fixed tolerance on the initial condition suffices to control the trajectory uniformly over all future time. This uniformity is what makes stability a meaningful long-term guarantee (e.g., for an engineer certifying a controller) rather than a trivial pointwise statement, and it is exactly the feature that fails in the Vinograd counterexample.
Is asymptotic stability the same as " for all nearby "?
No — that convergence condition alone is called attractivity or attraction, and it is strictly weaker than asymptotic stability. Asymptotic stability requires attraction plus Lyapunov stability, as the counterexample of Vinograd's system shows: every trajectory there converges to the origin, yet the origin is not stable, because trajectories starting arbitrarily close can be driven arbitrarily far away (though only temporarily) before returning. The two clauses are logically independent in dimension , so both must be stated and verified separately.
Can a nonlinear system be asymptotically stable even when its linearization has a zero eigenvalue?
Yes, and this is precisely why the linear eigenvalue test of Theorem (3) does not settle nonlinear stability questions when the linearization is non-hyperbolic (has an eigenvalue with zero real part). In such cases the higher-order (nonlinear) terms determine the outcome, and one typically needs the Lyapunov function method — constructing an explicit energy-like function and checking the sign of along trajectories, exactly as done informally in Example 2 — rather than relying on the linear part alone. This is the motivating gap that Lyapunov Functions and Stability is built to fill.
Does instability mean every trajectory near the equilibrium runs away?
No. Instability is a much weaker (easier to satisfy) statement: it only requires that some fixed exists such that for every , at least one trajectory starting within eventually leaves the -ball. A saddle point is the classic example: it has an entire stable manifold (a whole line, in the planar case) of initial conditions whose trajectories converge to the equilibrium, yet the equilibrium is still classified as unstable because other nearby trajectories (along the unstable manifold) diverge, and the existence of even one escaping family is enough to violate the "for all , stay within " clause for those points.
How does this relate to the classification of planar fixed points I already know?
The classification into nodes, saddles, spirals, and centers (from Classification of Planar Fixed Points) is a classification by geometric shape of orbits near a linear equilibrium, based on eigenvalues and eigenvectors. Stability, by contrast, is a classification by long-term metric behavior: whether trajectories stay close, converge, or escape. The two classifications align in the hyperbolic case — stable nodes and stable spirals are asymptotically stable, saddles and unstable nodes/spirals are unstable — but centers occupy a special role: geometrically a distinct orbit shape (closed loops), and stability-wise, stable but not asymptotically stable, illustrating that the two classification schemes answer genuinely different questions.
Why must be locally Lipschitz in the definition, rather than merely continuous?
Local Lipschitz continuity (or an equivalent condition) guarantees existence and uniqueness of the solution through each initial point, which the stability definition silently presupposes by writing "the solution" as a well-defined single trajectory. Without uniqueness, multiple solutions could emanate from the same initial point — some staying close to the equilibrium, others escaping — and it would become ambiguous whether the equilibrium is "stable," since the answer would depend on which branch of solutions one tracks. Local Lipschitz continuity is the standard sufficient condition (via the Picard–Lindelöf theorem) that rules out this pathology.
Is it possible for an equilibrium to be neither stable nor unstable?
No — under the standing hypotheses (existence and uniqueness of solutions), stability and instability are logical negations of each other by construction: instability is defined as the failure of the stability condition. Every equilibrium of a well-posed system (unique solutions, defined at least locally in time) is classified as exactly one of "stable" or "unstable"; there is no third option at this level. What can happen is that stability holds without asymptotic stability (the center case), which is a genuinely intermediate degree of good behavior, but it still falls entirely inside the "stable" category as defined.