MathLabs

Differential equations and dynamical systems

Chaos theory

Deterministic systems that are extremely sensitive to initial conditions, producing unpredictable long-term behavior.

IntuitionWhy can't we predict the weather two weeks out?

Weather forecasting uses the same physical laws — Newton's equations, thermodynamics — whether we predict tomorrow or next month, yet forecasts become useless after about ten days. The reason is not that the equations are wrong or the computers too slow: the atmosphere is chaotic. A butterfly flapping its wings in Brazil, changing the air temperature by a fraction of a degree, can in principle change whether a hurricane forms in the Atlantic weeks later. This is not mysticism; it is a precise mathematical property called sensitive dependence on initial conditions, discovered independently by Henri Poincaré while studying the three-body problem in the 1890s and rediscovered by the meteorologist Edward Lorenz in 1963 while rounding a computer printout from six decimal places to three.

Interactive 3D parametric surface illustrating the butterfly-shaped geometry of a chaotic attractor.
Cobweb diagram of the logistic map xn+1=rxn(1−xn)x_{n+1} = r x_n(1 - x_n): increase the control parameter rr from 2.52.5 (stable fixed point) through 3.23.2 (period-22 cycle) up to 3.83.8 (chaos).

UndergraduateSensitive dependence and the Lorenz system

Definition: Sensitive dependence on initial conditions

A dynamical system has sensitive dependence on initial conditions if two trajectories starting from nearby points, a distance δ0\delta_0 apart, separate at an exponential rate ∣δn∣≈∣δ0∣ eλn|\delta_n| \approx |\delta_0|\,e^{\lambda n}, where λ\lambda is the Lyapunov exponent. When λ>0\lambda>0, even a minuscule measurement error δ0\delta_0 grows to a macroscopic, forecast-ruining size after a finite time — exactly why weather forecasts break down after about ten days.

x˙=σ(y−x)y˙=x(ρ−z)−yz˙=xy−βz\begin{aligned} \dot x &= \sigma(y-x) \\ \dot y &= x(\rho - z) - y \\ \dot z &= xy - \beta z \end{aligned}

This is the Lorenz system, a drastic simplification of atmospheric convection: xx is proportional to the convective roll velocity, yy to the temperature difference between rising and falling currents, and zz to the distortion of the vertical temperature profile from linear. The parameter σ\sigma is the Prandtl number, ρ\rho is proportional to the Rayleigh number (how strongly the fluid is heated from below), and β\beta is a geometric factor. Lorenz's classic chaotic choice is σ=10\sigma=10, ρ=28\rho=28, β=8/3\beta=8/3 — for these values every trajectory eventually settles onto the same butterfly-shaped fractal set (the Lorenz attractor), yet which wing it is on at any given time is essentially unpredictable far in advance.

xn+1=r xn(1−xn)x_{n+1} = r\,x_n(1-x_n)

A far simpler system shows the same phenomenon: the logistic map xn+1=r xn(1−xn)x_{n+1} = r\,x_n(1-x_n), a one-dimensional model of population growth with limited resources (here xn∈[0,1]x_n\in[0,1] is the population fraction of its maximum, and rr controls the growth rate). For small rr every orbit settles to a single fixed point; as rr increases the fixed point loses stability and is replaced by a stable 2-cycle, then a 4-cycle, then an 8-cycle — a cascade of period-doubling bifurcations that accumulates at r≈3.5699r\approx3.5699 (the Feigenbaum point), beyond which the orbit typically never repeats at all. Remarkably, the rate at which the bifurcation points bunch up, δ≈4.6692\delta\approx4.6692 (the Feigenbaum constant), is the same for an enormous class of unrelated one-dimensional maps — a rare instance of a truly universal constant in nonlinear dynamics.

Long-term behavior of the logistic map as r increases
ParameterLong-term behavior
r<3r<3Single stable fixed point
r=3.2r=3.2Stable period-2 cycle
r=3.5r=3.5Stable period-4 cycle
r=3.57r=3.57Onset of chaos (accumulation of period doublings)
r=4r=4Fully chaotic; Lyapunov exponent ln⁡2\ln 2 > 0

UndergraduateQuantifying chaos: the Lyapunov exponent

λ=lim⁡n→∞1n∑i=0n−1ln⁡∣f′(xi)∣\lambda = \lim_{n\to\infty}\frac{1}{n}\sum_{i=0}^{n-1}\ln\left|f'(x_i)\right|

The Lyapunov exponent λ\lambda is the average, along a typical orbit x0,x1,x2,…x_0,x_1,x_2,\dots, of the logarithm of the local stretching factor ∣f′(xi)∣|f'(x_i)| at each step: it measures how fast nearby points separate on average, in the same way an interest rate measures average exponential growth. λ>0\lambda>0 means neighboring points diverge exponentially — the hallmark of chaos; λ<0\lambda<0 means they converge, as at a stable fixed point; λ=0\lambda=0 is the borderline (periodic or quasi-periodic) case.

For the logistic map f(x)=rx(1−x)f(x)=rx(1-x), the nontrivial fixed point x∗=1−1rx^* = 1-\tfrac{1}{r} is stable for 1<r<31<r<3 and loses stability exactly at r=3r=3, where it undergoes a period-doubling bifurcation into a stable 2-cycle.

Why is it true?

The derivative of the map at a fixed point measures how a tiny perturbation there grows or shrinks after one step; when its magnitude crosses 1 the point flips from attracting to repelling, and since the map's second iterate has slope (−1)2=1(-1)^2=1 exactly at that threshold, a new period-2 orbit is precisely what can bifurcate off.

Proof

Step 1 (find the fixed points). Solve rx(1−x)=xrx(1-x)=x, i.e. x[r(1−x)−1]=0x[r(1-x)-1]=0. This gives x=0x=0 or the nontrivial fixed point x∗=1−1rx^* = 1-\tfrac{1}{r}, which lies in (0,1)(0,1) precisely when r>1r>1.

Step 2 (linearize). Differentiating, f′(x)=r−2rxf'(x)=r-2rx. Evaluating at the nontrivial fixed point, f′(x∗)=r−2r(1−1r)=r−2r+2=2−rf'(x^*) = r - 2r\left(1-\tfrac1r\right) = r - 2r + 2 = 2-r, so f′(x∗)=2−rf'(x^*) = 2-r.

Step 3 (stability criterion). A fixed point is locally stable exactly when ∣f′(x∗)∣<1|f'(x^*)|<1, i.e. ∣2−r∣<1|2-r|<1, which rearranges to 1<r<31<r<3. So x∗x^* attracts nearby orbits throughout this whole range.

Step 4 (the bifurcation at r = 3). At r=3r=3 exactly, f′(x∗)=−1f'(x^*)=-1: the linearization is marginal. For rr slightly above 3, ∣f′(x∗)∣>1|f'(x^*)|>1 and x∗x^* becomes repelling. Meanwhile the second-iterate map f∘ff\circ f has, by the chain rule, derivative f′(x∗)2=1f'(x^*)^2=1 at x∗x^* exactly at r=3r=3; expanding f∘ff\circ f to higher order shows this degenerate point splits into two genuine new fixed points of f∘ff\circ f (a stable 2-cycle of ff) as rr increases past 3 — the period-doubling bifurcation.

At r=4r=4, the logistic map xn+1=r xn(1−xn)x_{n+1} = r\,x_n(1-x_n) has Lyapunov exponent ln⁡2\ln 2 for Lebesgue-almost every initial condition x0∈(0,1)x_0\in(0,1).

Why is it true?

The map at r = 4 looks nothing like a simple doubling map at first glance, but a clever change of variables (a smooth conjugacy) turns it into exactly the doubling map, whose stretching rate is obviously 2 at every point — the extra distortion introduced by the change of variables averages out to nothing over long times.

Proof

Step 1 (the conjugacy). Substitute x=sin⁡2(πy)x=\sin^2(\pi y). Using the double-angle identity, 4x(1−x)=4sin⁡2(πy)cos⁡2(πy)=sin⁡2(2πy)4x(1-x)=4\sin^2(\pi y)\cos^2(\pi y)=\sin^2(2\pi y). If we also set y′=T(y)y' = T(y) for the doubling map T(y)=2y mod 1T(y)=2y \bmod 1, then sin⁡2(πy′)=sin⁡2(2πy)\sin^2(\pi y') = \sin^2(2\pi y) matches exactly the right-hand side above, so f(h(y))=h(T(y))f(h(y)) = h(T(y)) with h(y)=sin⁡2(πy)h(y)=\sin^2(\pi y): the logistic map at r = 4 is smoothly conjugate to the doubling map.

Step 2 (Lyapunov exponent of the doubling map). The doubling map is piecewise linear with T′(y)=2T'(y)=2 everywhere it is differentiable, so along every orbit 1n∑i=0n−1ln⁡∣T′(yi)∣=ln⁡2\tfrac1n\sum_{i=0}^{n-1}\ln|T'(y_i)| = \ln 2 exactly, for every nn — the limit is trivially ln⁡2\ln 2.

Step 3 (transporting the exponent through the conjugacy). Differentiating f(h(y))=h(T(y))f(h(y))=h(T(y)) by the chain rule gives f′(h(y))h′(y)=h′(T(y))T′(y)f'(h(y))h'(y)=h'(T(y))T'(y), i.e. ln⁡∣f′(x)∣=ln⁡∣h′(T(y))∣+ln⁡∣T′(y)∣−ln⁡∣h′(y)∣\ln|f'(x)| = \ln|h'(T(y))| + \ln|T'(y)| - \ln|h'(y)| at x=h(y)x=h(y). Summing this identity along an orbit y0,y1,…,yn−1y_0,y_1,\dots,y_{n-1} and dividing by nn, the middle terms telescope: 1n∑i=0n−1ln⁡∣f′(xi)∣=ln⁡2+1n[ln⁡∣h′(yn)∣−ln⁡∣h′(y0)∣]\tfrac1n\sum_{i=0}^{n-1}\ln|f'(x_i)| = \ln2+\tfrac1n\big[\ln|h'(y_n)|-\ln|h'(y_0)|\big].

Step 4 (the boundary term vanishes). Since h′(y)=πsin⁡(2πy)h'(y)=\pi\sin(2\pi y) is bounded (its magnitude never exceeds π\pi), the bracketed term ln⁡∣h′(yn)∣−ln⁡∣h′(y0)∣\ln|h'(y_n)|-\ln|h'(y_0)| stays bounded as n→∞n\to\infty for any orbit that avoids the countably many zeros of h′h' — a set of Lebesgue measure zero. Dividing a bounded quantity by nn sends it to 00, so the Lyapunov exponent of the logistic map at r = 4 equals ln⁡2\ln 2 for almost every initial condition.

UndergraduateReal-World Applications and Worked Examples

Chaos theory is not just about weather: it explains why heart-rhythm monitors watch for the onset of chaotic fibrillation, why secure chaotic communication systems mix a message into a chaotic carrier signal that only a receiver with the exact same parameters can decode, why population-ecology models with a high reproduction rate rr can swing wildly even with no external randomness, and why engineers design electronic circuits (such as Chua's circuit) specifically to generate chaotic signals for random-number generation and encryption. In every case the same two computations recur: locate and linearize the equilibria or periodic orbits, and estimate the Lyapunov exponent that tells you how fast a small error explodes.

Example: A population that oscillates forever: the period-2 cycle at r = 3.2

A fishery models next year's stock fraction by the logistic map xn+1=r xn(1−xn)x_{n+1} = r\,x_n(1-x_n) with growth parameter r=3.2r=3.2 (above the period-doubling threshold r=3r=3). Find the two population levels the stock alternates between, once transients die out.

Solution

Points of a period-2 cycle satisfy f(f(x))=xf(f(x))=x without being fixed points themselves, so f(f(x))−xf(f(x))-x must vanish. Expanding f(f(x))−xf(f(x))-x and dividing out the two roots that are the ordinary fixed points x=0x=0 and x∗=1−1/rx^*=1-1/r (which already solve f(x)=xf(x)=x, hence trivially f(f(x))=xf(f(x))=x) leaves the genuinely new factor r2x2−r(r+1)x+(r+1)=0r^2x^2-r(r+1)x+(r+1)=0.

This is a quadratic in xx. By the quadratic formula, x=(r+1)±(r−3)(r+1)2rx=\dfrac{(r+1)\pm\sqrt{(r-3)(r+1)}}{2r}.

Plugging in r=3.2r=3.2: the numerator terms are r+1=4.2r+1=4.2 and (r−3)(r+1)=0.2×4.2=0.84(r-3)(r+1)=0.2\times4.2=0.84, so 0.84≈0.9165\sqrt{0.84}\approx0.9165 and 2r=6.42r=6.4. This gives x≈{0.513, 0.799}x\approx\{0.513,\ 0.799\}.

So the fishery's stock settles into an oscillation, alternately about 51.3%51.3\% and 80.0%80.0\% of carrying capacity every other year — a genuinely periodic population cycle produced by a completely deterministic rule, well before the system becomes chaotic.

Example: Why ten days? Estimating the weather's forecast horizon

Atmospheric models have an estimated Lyapunov exponent of about λ≈0.9\lambda\approx0.9 per day. Two forecast runs start δ0=10−6\delta_0=10^{-6} (in normalized units) apart, representing an essentially perfect initial measurement. Estimate how large this tiny difference has grown after n=10n=10 days, and comment on what it means for forecasting.

Solution

By the definition of the Lyapunov exponent, small errors grow (on average) like δn≈δ0 eλn\delta_n \approx \delta_0\,e^{\lambda n}.

With λ≈0.9\lambda\approx0.9 per day and n=10n=10 days, the exponent is λn≈0.9×10=9\lambda n \approx 0.9\times10=9, so the growth factor is e9≈8103e^{9}\approx8103.

Starting from δ0=10−6\delta_0=10^{-6}, after ten days the error has grown to δ10≈10−6×8103≈8.1×10−3\delta_{10}\approx10^{-6}\times8103\approx8.1\times10^{-3} — a roughly eight-thousand-fold amplification of an initially minuscule, essentially unmeasurable difference.

Since real measurement and modeling errors are already far larger than 10−610^{-6} in relative terms, this exponential blow-up is exactly why operational forecasts, however good the physics and however powerful the computer, lose all skill within about one to two weeks: it is a mathematical horizon set by λ\lambda, not an engineering limitation.

ResearchOpen frontier: rigorous chaos and high-dimensional turbulence

For the logistic map f(x)=rx(1−x)f(x)=rx(1-x) with nontrivial fixed point x∗=1−1rx^* = 1-\tfrac{1}{r}, what is the derivative f′(x∗)f'(x^*) in terms of rr?

Two weather-forecast runs start δ0=10−6\delta_0=10^{-6} (normalized units) apart. Using δn≈δ0eλn\delta_n\approx\delta_0 e^{\lambda n} with λ≈0.9\lambda\approx0.9 per day, by roughly what factor has the separation grown after n=10n=10 days?

At which parameter value rr does the logistic map's nontrivial fixed point x∗=1−1rx^* = 1-\tfrac{1}{r} first lose stability via period-doubling?

A dynamical system has Lyapunov exponent λ>0\lambda>0. What does this indicate?

References

  1. Steven H. Strogatz (2015). Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering
  2. Edward N. Lorenz (1963). Deterministic Nonperiodic Flow
  3. Robert M. May (1976). Simple mathematical models with very complicated dynamics
  4. Warwick Tucker (2002). A Rigorous ODE Solver and Smale's 14th Problem