Mathematical and Dynamical Foundations › Fixed Points, Stability, and Attractors
World Models HandbookAll chapters Mathematical and Dynamical Foundations › Fixed Points, Stability, and AttractorsOne section · Sections in this chapter4 / 11 ↓
Reading tools Definitions & inline links
Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.
Article links
Make inline references clickable
Prediction alone does not characterize a dynamical system. Ask where trajectories end up if you let them run, and you are asking about fixed points, stability, and attractors. These concepts are not optional decoration for world modelers: they determine whether a learned model's long-horizon rollouts look like the real system or like garbage, and they explain why one-step validation can be dangerously misleading. The shift in perspective is from local to global: a transition law tells you what happens in the next instant, while attractor structure tells you what happens in the long run, and the two can come apart in ways that matter enormously.
Fixed points
A fixed point of a transition function is a state satisfying : once the system is there, it stays there in the absence of noise. For a stochastic kernel, the analogous notion is a stationary distribution, which the transition leaves unchanged.
Fixed points matter because they organize the long-term behavior of everything around them. They act as the destinations toward which nearby trajectories drift or the sources from which they flee, and the inventory of a system's fixed points is therefore a rough sketch of its entire long-run personality. A trained world model whose rollouts converge to a spurious fixed point, for example a video model that predicts the blurry mean of all plausible futures, has failed in a specifically dynamical way, even if each individual one-step prediction looked plausible. The failure is invisible to one-step metrics because the spurious fixed point is approached gradually, one defensible step at a time.
Stability by linearization
Not all fixed points are equal. Some pull nearby trajectories in; others fling them away. The distinction is captured by stability. Consider a one-dimensional discrete-time system with fixed point . Nudge the state slightly: . A Taylor expansion gives
so the perturbation evolves as . The nudge shrinks if and grows if . Linearization therefore sorts fixed points into stable (perturbations decay) and unstable (perturbations grow) ones. The intuition is geometric: the derivative measures how strongly the map stretches or compresses small intervals, and repeated application multiplies that stretch factor, so anything less than one in magnitude decays geometrically while anything greater explodes geometrically.
The same idea in higher dimensions replaces the derivative with the Jacobian matrix evaluated at the fixed point, and the condition becomes: all eigenvalues of must lie strictly inside the unit circle of the complex plane. Each eigenvalue governs perturbations along its own eigendirection, so a system can be stable along one direction and unstable along another, which is why the worst eigenvalue decides. For continuous-time systems , the condition is that all eigenvalues of the Jacobian have negative real part. If you take one piece of classical control mathematics into the rest of this handbook, make it this one, because it is exactly the diagnostic you will run, knowingly or not, whenever a learned model's rollouts blow up, oscillate, or collapse. A learned dynamics network is a function like any other; it has Jacobians at its fixed points, and its eigenvalues decide whether its imagined futures settle down or spiral apart.
Linearization is a local tool. It tells you what happens in an infinitesimal neighborhood of the fixed point and says nothing about which initial conditions eventually arrive there. That second question brings us to basins and attractors.
Attractors and basins
An attractor is a set that trajectories converge to and stay near. The main species, in increasing order of complexity:
- Fixed-point attractors: convergence to a single state, like a cup of coffee cooling to room temperature. All memory of the initial condition is eventually lost.
- Limit cycles: convergence to a repeating orbit, like a heartbeat or, as we will see shortly, a thermostat. The system forgets when it started but remembers a rhythm.
- Quasi-periodic tori: motion on two or more incommensurate frequencies, common in coupled oscillators. The motion never exactly repeats, yet remains regular and predictable over moderate horizons.
- Strange attractors: bounded but aperiodic behavior with sensitive dependence on initial conditions, the signature of chaos. The system stays in a recognizable region forever yet becomes unpredictable in detail.
Each attractor comes with a basin of attraction: the set of initial conditions that converge to it. Systems with several attractors partition their state space into basins, and which basin a trajectory starts in can matter more than any local detail of its motion. Basins introduce a discrete, qualitative sensitivity into otherwise smooth dynamics: nudge an initial condition across a basin boundary and its destiny changes completely, even though its immediate next steps barely change. Learned world models routinely distort basin boundaries, which is one reason a model can behave well in the data distribution yet fail catastrophically for the states a planner steers it toward. A planner that believes a boundary sits one place, when it actually sits somewhere else, will confidently steer across it and discover a different regime than its model promised.
The logistic map: one equation, every kind of behavior
The cleanest laboratory for these ideas is the logistic map,
a one-dimensional, deterministic, nonlinear system studied extensively by Robert May in the 1970s as a model of a self-limited population. Despite its simplicity, as the parameter increases it exhibits a fixed point, a cascade of periodic oscillations, and finally chaos. One quadratic term, one parameter, and every phenomenon in the attractor taxonomy above: this economy is why the map remains the standard first example four decades on.
We can analyze it exactly. The fixed points are and . Since , the derivative at the nonzero fixed point is , which is stable precisely when , that is, for . At the fixed point loses stability and a stable period-two cycle is born. That cycle itself loses stability at , giving way to period four, then eight, in a period-doubling cascade with remarkably universal spacing (Feigenbaum's constant ), until chaos sets in near . Each doubling is a bifurcation: a stable attractor splits in two, and the system's long-run behavior acquires one more alternating phase.
## Bifurcation diagram data: for each r, iterate the map and keep late samples
r_values = np.linspace(2.5, 4.0, 1400)
n_warmup = 400
n_keep = 220
orbit = np.full(len(r_values), 0.31)
for _ in range(n_warmup):
orbit = r_values * orbit * (1.0 - orbit)
samples = np.empty((n_keep, len(r_values)))
for j in range(n_keep):
orbit = r_values * orbit * (1.0 - orbit)
samples[j] = orbit
## Time series in three qualitatively different regimes
regime_params = {
"Stable fixed point (r = 2.8)": 2.8,
"Period-2 cycle (r = 3.2)": 3.2,
"Chaos (r = 3.9)": 3.9,
}
regime_series = {}
for name, r in regime_params.items():
v = 0.31
seq = []
for _ in range(60):
v = r * v * (1.0 - v)
seq.append(v)
regime_series[name] = np.array(seq)
## Cobweb diagram data: trace the iteration graphically in two regimes
def cobweb(r, x0, n_iter=14):
xs = [x0]
ys = [0.0]
v = x0
for _ in range(n_iter):
nxt = r * v * (1.0 - v)
xs.extend([v, v])
ys.extend([v, nxt])
xs.append(nxt)
ys.append(nxt)
v = nxt
return np.array(xs), np.array(ys)
grid_cobweb = np.linspace(0.0, 1.0, 200)
cobweb_stable_x, cobweb_stable_y = cobweb(2.8, 0.15)
cobweb_chaos_x, cobweb_chaos_y = cobweb(3.9, 0.15)
The diagram compresses the entire story into one picture: a single attracting value, then a fork into alternating values, then forks upon forks, then dense bands where the orbit never repeats. Now look at the raw time series in the three regimes, because this is what a forecaster faces.



The cobweb picture makes the linearization argument visible. At the staircase steps shrink toward the crossing of the parabola with the diagonal, because the parabola's slope there is shallower than one in magnitude. At the same construction never settles: each bounce amplifies the deviation, and the orbit wanders forever inside the unit square.


In the chaotic regime, neighboring initial conditions separate exponentially fast, with rate given by the largest Lyapunov exponent. No model, however accurate, can predict individual long-horizon outcomes there: the information about the initial condition is irrecoverably lost. What a good world model can and should reproduce is the statistical behavior, the attractor, the invariant distribution, the autocorrelation structure. This fixes the evaluation principle for chaotic systems: judge models on distributional fidelity over long horizons, not on point-prediction error, which saturates at the level of chance regardless of model quality.
There is a second lesson here for anyone training learned dynamics. A model fitted to minimize one-step squared error has no term in its objective that rewards getting the attractor right. It can achieve excellent one-step accuracy while its autonomous rollouts drift to a wrong fixed point, oscillate at the wrong frequency, or diverge entirely. The objective measures fidelity of the map; the deployment requirement is fidelity of the orbits, and the two coincide only when the map is accurate everywhere the orbit goes, which is precisely what a finite dataset cannot guarantee. We will demonstrate this failure concretely with the thermostat at the end of the chapter, and we will return to mitigation strategies, such as multi-step training objectives and rollout-based validation, repeatedly in Part VI and Part XI.