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 has solutions built from the eigenvalues and eigenvectors of . 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 – plane as 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 and determinant of . We also prove that this classification is complete and exhaustive. The organizing object is the trace–determinant plane. This is a single picture, the -plane, that maps all possible qualitative behaviors of linear systems. Every matrix corresponds to exactly one point in this plane. That point's location, relative to a single parabola and the axis , 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 and 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.
- A planar linear system has a phase portrait fully classified by the trace and determinant of .
- Real eigenvalues of the same sign give nodes; opposite signs give saddles; complex eigenvalues give spirals (or centers if purely imaginary).
- The discriminant separates real () from complex () eigenvalues; always forces a saddle regardless of .
- 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 is coordinates on a "map of dynamics" — a single parabola and the line 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 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 ) 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 matrix, how do I quickly sketch its phase portrait using only and , without solving the system explicitly?
Let be a real matrix and consider the constant-coefficient linear system
For each initial condition , the theory of linear systems guarantees a unique solution defined for all . The trajectory (or orbit) through is the parametrized curve
drawn together with an arrow indicating the direction of increasing . The phase portrait of the system is the collection of trajectories , drawn simultaneously in the -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 is built from exponentials dressed by eigenvectors, where ranges over the eigenvalues of . 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
everything about the qualitative behavior is encoded in the two real numbers and . Real eigenvalues arise when ; a negative determinant forces the two eigenvalues to have opposite sign (one positive, one negative) because their product is ; 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 shows how the parabola and the axis divide the plane into the five basic regimes.
Notice that the parabola (where the discriminant vanishes) is where real, repeated eigenvalues occur — the boundary between nodes and spirals. The vertical axis combined with is where eigenvalues are purely imaginary — the center case. The horizontal axis is degenerate: at least one eigenvalue is zero, so the origin is not an isolated equilibrium.
Let be a real matrix with (so the origin is the unique equilibrium of ). Let , , and . Then the phase portrait of falls into exactly one of the following mutually exclusive cases, determined solely by : 1. Saddle: if . The eigenvalues are real with . All trajectories except along the two eigenvector lines diverge from the origin, asymptotically approaching the unstable eigenline as and the stable eigenline as . The origin is unstable. 2. Node (real, same-sign eigenvalues): if and . The eigenvalues are real with of the same sign as wait, same sign as each other, that sign being the sign of (since and ). If both eigenvalues are negative: the origin is asymptotically stable and every trajectory tends to the origin as , tangent to the slow eigenline. If the reverse holds with replacing ; the origin is unstable.
- If and eigenvalues are distinct with linearly independent eigenvectors, this is an improper node.
- If and is diagonalizable (i.e. ), every direction is an eigenvector: a proper node or star node, with trajectories being rays from the origin.
- If and 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 and . The eigenvalues are complex conjugates with , . Trajectories spiral around the origin, spiraling inward () if and outward if . 4. Center: if and . The eigenvalues are purely imaginary , . Every trajectory other than the origin is a closed curve (an ellipse in original coordinates) traversed periodically with period . The origin is stable (Lyapunov stable) but not asymptotically stable. These four cases are exhaustive and mutually exclusive over .
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 satisfy
This is immediate from expanding for a matrix, which follows by direct computation writing : . Since we assumed , neither eigenvalue is zero, so is the only equilibrium (the only solution of when is invertible).
Step 2: Case (saddle). Since (as ), the eigenvalues are real and distinct, say . Since , they have opposite signs; write . By the eigenvalue method (a prerequisite result), has linearly independent real eigenvectors (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
If , : the trajectory lies on the line through , and since , as and as . This is the stable eigenline. If : symmetric argument gives the unstable eigenline, with as . If : as , dominates (since ), so
since forces the second term to vanish. Symmetrically, as , the trajectory is asymptotic to the direction. Thus every trajectory off the eigenlines approaches 's line forward in time and 's line backward in time, the classic hyperbolic saddle geometry. Since along every trajectory except the stable line, the origin is unstable.
Step 3: Case , (improper node). As in Step 2, real distinct eigenvalues give independent eigenvectors and the same general solution formula. But now forces to share a sign, and tells us that sign is the sign of (if both were negative their sum would be negative, and conversely). Assume , so (relabeling so is more negative). Then for any not both zero,
since both exponentials decay. To see the direction of approach, factor out the slower-decaying (less negative) exponential :
Since , the term as provided , so the direction of tends to that of : all trajectories with become tangent to the -eigenline (the "slow" direction, associated to the eigenvalue closer to ) as . Trajectories with lie exactly on the line. As , for all nonzero solutions, so the origin is asymptotically stable () and this is a stable improper node. Reversing all inequalities handles , giving an unstable node with all motion reversed in time.
Step 4: Case , , repeated eigenvalue , diagonalizable (, proper/star node). If then every nonzero vector is an eigenvector and the general solution is : every trajectory is a ray from the origin (or through it), traversed radially outward if or inward if , with all directions equally "fast" — hence "star" or "proper" node.
Step 5: Case , , repeated eigenvalue not diagonalizable (degenerate node). By the theory of Complex and Repeated Eigenvalues, when has a repeated eigenvalue with only a one-dimensional eigenspace spanned by , there is a generalized eigenvector with , and the general solution is
If : trajectory lies on the eigenline through . If , write
As (whichever direction makes , i.e. if ), the coefficient dominates the fixed vector in the bracket, so the direction of tends to : every trajectory becomes tangent to the single eigenline as it approaches the origin, and because for (standard fact: exponential decay beats polynomial growth, provable by L'Hôpital or by the ratio test applied to ). 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 (complex eigenvalues), (spiral). Since , the eigenvalues are complex conjugates with , (nonzero because ). By the method for complex eigenvalues (prerequisite result), with complex eigenvector for eigenvalue , two real, linearly independent solutions are
and the general real solution is . In the basis (linearly independent because is a genuine complex, not real, eigenvector — otherwise the eigenvalue would be real), write -type expression; more directly, compute
because the bracket is a fixed quadratic form in evaluated along a circle, hence bounded above and below by positive constants when are linearly independent. Therefore as if , and if ; in either case the direction rotates monotonically (the angular part advances at constant rate, since ), producing a spiral: inward (stable) for , outward (unstable) for .
Step 7: Case , (center). Repeat Step 6 with : then is exactly periodic and bounded above and below by positive constants (no factor), so trajectories are closed curves, retraced with period exactly (since have period in argument ). 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 does not tend to .
Step 8: exhaustiveness and mutual exclusivity. Given , exactly one of or holds. If , exactly one of , , holds, and if , exactly one of (diagonalizable) or not holds. If , exactly one of or holds. These conditions partition 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.
∎Worked examples
Example 1 (an improper node with distinct, asymmetric eigenvalues). Consider
Compute and . Then , so by the Theorem this is a node (real, same-sign eigenvalues, since ), and since it is a stable improper node. Explicitly, , giving , . For : means , so . For : means , so . The general solution is
Both exponents are negative, confirming asymptotic stability of the origin. Since , the term decays faster; as , every trajectory with becomes tangent to , the slow eigenline. As , trajectories become asymptotic (in direction) to . This matches Step 3 of the proof exactly, with the numbers , , consistent throughout (, ✓).
Example 2 (a spiral with an asymmetric, non-unit matrix). Consider
Here , . Then , so eigenvalues are complex. Since , the Theorem predicts an unstable spiral (outward, since ). Explicitly . So , . An eigenvector for solves :
From the first row: . Take : . So , with , . By the complex-eigenvalue method, two independent real solutions are
Both carry the growing factor (), confirming instability, and the angular factor rotates with (constant) rate , 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 ✓ and ✓.
Drop the hypothesis and consider
Here and . 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 becomes , i.e. , so every point on the line is a fixed point, not just the origin. Concretely, the eigenvalues are , giving , . Eigenvector for : solves , giving — a whole line of equilibria, matching the direct computation above. Eigenvector for : . General solution: . As , trajectories with shoot off to infinity parallel to ; as , they approach the line of equilibria , 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 (equivalently, invertibility of , 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
| Situation | What happens | Common error |
|---|---|---|
| Saddle, always unstable, regardless of | Forgetting that saddles ignore entirely — trace only decides stability when | |
| Degenerate node (one eigenline, curved approach) | Confusing with the proper/star node, which needs exactly | |
| Star node, straight-ray trajectories | Assuming any repeated eigenvalue automatically gives straight rays | |
| Center: closed orbits, stable but not asymptotically stable | Calling a center "asymptotically stable" — it is only Lyapunov stable | |
| Non-isolated equilibria; classification does not apply | Forcing a saddle/node/spiral label onto a line of fixed points | |
| Nonlinear systems near equilibria | Trace–determinant picture describes the linearization; centers can be destroyed by nonlinear terms | Assuming 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
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
Why do trace and determinant alone determine the whole phase portrait?
Because the characteristic polynomial of a matrix, , depends only on and , and the qualitative shape of solutions to depends only on the type of the eigenvalues (real vs. complex, signs, multiplicity) — not on the specific entries of or the specific eigenvectors. Different matrices with the same 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 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 is a scalar multiple of the identity, ), 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 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 linearizes to a center at , 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 () replaces by , which negates but leaves unchanged (since 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 ) 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 forever, so the trajectory must wind around the origin infinitely many times as , producing either a genuine spiral () or a genuine closed loop (); it can never settle into a fixed direction the way node trajectories do.
Why is the boundary case geometrically special, and is it commonly seen in applications?
At 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 -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 -plane picture is special to matrices because a characteristic polynomial has exactly two coefficients beyond the leading one, matching and exactly. In dimensions, the characteristic polynomial has 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.