2.1.25Analytical Mechanics

Chaotic systems — sensitivity to initial conditions, Lyapunov exponents

1,796 words8 min readdifficulty · medium

WHAT is chaos?

WHY does "deterministic" + "unpredictable" not contradict? The equations fix the future exactly. But we never know the present exactly — we have an error δ0\delta_0. In a non-chaotic system that error grows slowly (linearly). In a chaotic system it grows like eλte^{\lambda t}, so even a microscopic δ0\delta_0 blows up to order-1 in finite time. Determinism is about the rules; predictability is about our knowledge.


HOW fast do trajectories separate? — Deriving the Lyapunov exponent

We want a number that measures the separation rate. Build it from scratch.

Step 1 — Set up two nearby trajectories. Let x(t)x(t) obey x˙=f(x)\dot x = f(x). Start a neighbour at x(0)+δ0x(0)+\delta_0. Define the separation δ(t)=x(t)x(t).\delta(t) = x'(t) - x(t). Why this step? We literally care about how the gap between two runs evolves — that gap is the thing that grows in chaos.

Step 2 — Linearise for small separation. δ˙=f(x+δ)f(x)f(x)δ.\dot\delta = f(x+\delta)-f(x) \approx f'(x)\,\delta. Why this step? While δ\delta is small, only the first derivative (the local stretching rate) matters. We Taylor-expand and keep the leading term.

Step 3 — Solve the linear growth. If f(x)f'(x) were a constant λ\lambda, then δ˙=λδδ(t)=δ0eλt\dot\delta=\lambda\delta\Rightarrow \delta(t)=\delta_0 e^{\lambda t}. In general the local rate varies, so we average it along the orbit: δ(t)δ0eλt,λlimtlimδ001tlnδ(t)δ0.|\delta(t)| \sim |\delta_0|\, e^{\lambda t}, \qquad \lambda \equiv \lim_{t\to\infty}\lim_{|\delta_0|\to0}\frac{1}{t}\ln\frac{|\delta(t)|}{|\delta_0|}. Why this step? The exponential is the only function that turns a constant relative growth rate into a clean number λ\lambda. Taking ln\ln then dividing by tt extracts that rate.

Why two limits, in this order? First δ00\delta_0\to0 keeps the linearisation honest (we only want infinitesimal separation). Then tt\to\infty averages over the whole attractor so λ\lambda is a property of the system, not of one lucky starting point.

For an nn-dimensional system there are nn exponents (the Lyapunov spectrum) λ1λ2λn\lambda_1\ge\lambda_2\ge\dots\ge\lambda_n, describing stretching along each independent direction. The maximal one λ1\lambda_1 decides chaos.


The predictability horizon (the 80/20 takeaway)

Figure — Chaotic systems — sensitivity to initial conditions, Lyapunov exponents

Worked Example 1 — The logistic map (discrete chaos)

Map: xn+1=rxn(1xn)x_{n+1}=r\,x_n(1-x_n). For maps, λ=limN1Nn=0N1lnf(xn)\lambda=\lim_{N\to\infty}\frac1N\sum_{n=0}^{N-1}\ln|f'(x_n)| with f(x)=r(12x)f'(x)=r(1-2x).

Why this formula? Each iteration multiplies a small separation by f(xn)|f'(x_n)|. After NN steps the product of these factors is f(xn)\prod|f'(x_n)|; taking 1Nln\frac1N\ln turns the product into an average log-stretch — exactly λ\lambda.

  • At r=2r=2 the map has a stable fixed point x=0.5x^*=0.5, f(x)=2(120.5)=0f'(x^*)=2(1-2\cdot0.5)=0, so λ=\lambda=-\infty direction → strongly stable, no chaos.
  • At r=4r=4 it is fully chaotic with the exact value λ=ln20.693\lambda=\ln 2\approx0.693.

Why ln2\ln2? At r=4r=4 the map is conjugate to the tent map which doubles distances each step → factor 2 → λ=ln2\lambda=\ln2.


Worked Example 2 — Predictability time for weather

Suppose λ0.4 day1\lambda \approx 0.4\ \text{day}^{-1}, initial error δ0=103\delta_0=10^{-3} (fractional), tolerable error Δ=1\Delta=1.

tpred=10.4ln1103=ln1030.4=6.90.417 days.t_{\text{pred}}=\frac{1}{0.4}\ln\frac{1}{10^{-3}}=\frac{\ln10^{3}}{0.4}=\frac{6.9}{0.4}\approx 17\ \text{days}.

Why this step? We just invert Δ=δ0eλt\Delta=\delta_0e^{\lambda t}. Now improve the sensors 1000×, δ0=106\delta_0=10^{-6}: tpred=ln1060.4=13.80.434 days.t_{\text{pred}}=\frac{\ln10^{6}}{0.4}=\frac{13.8}{0.4}\approx34\ \text{days}. A million-fold better data only doubled the horizon. That is the brutal logarithm.


Worked Example 3 — Sign of λ\lambda tells the dynamics

Damped pendulum spiralling to rest: all λi<0\lambda_i<0 (errors die). Frictionless pendulum: λ=0\lambda=0 (periodic, errors stay bounded). Driven damped pendulum in its chaotic regime: λ1>0\lambda_1>0 while iλi<0\sum_i\lambda_i<0 (volume shrinks onto a strange attractor, yet stretches within it).

Why can volume shrink while λ1>0\lambda_1>0? Dissipation contracts phase-space volume (λi<0\sum\lambda_i<0), but the flow simultaneously stretches in one direction (λ1>0\lambda_1>0) and folds — stretch-and-fold is the engine of chaos.



Recall Feynman: explain it to a 12-year-old

Imagine two identical toy cars released at almost the same spot down a bumpy hill of pegs (a pinball board). At first they roll side by side, but each peg they hit pushes the tiny gap between them a little wider — and the wider gap means the next peg pushes them even harder. Soon one car ends up in a totally different place from the other, even though the hill never changed. The cars follow exact rules, but because we can never place them in exactly the same spot, we can't say where they'll end up after a while. The "Lyapunov number" just measures how quickly that tiny gap doubles. Big number = gap doubles fast = we lose track quickly.


Flashcards

What property is the defining signature of chaos?
Sensitive dependence on initial conditions — nearby trajectories diverge exponentially.
Define the maximal Lyapunov exponent.
λ=limtlimδ001tln(δ(t)/δ0)\lambda=\lim_{t\to\infty}\lim_{\delta_0\to0}\frac1t\ln(|\delta(t)|/|\delta_0|), the average exponential separation rate of nearby trajectories.
What does λ>0\lambda>0, λ=0\lambda=0, λ<0\lambda<0 mean?
>0>0 chaos (separation); =0=0 marginal/periodic; <0<0 convergence to a stable attractor.
Why isn't a deterministic system always predictable?
We never know the initial state exactly, and chaos amplifies that tiny error exponentially (δδ0eλt\delta\sim\delta_0e^{\lambda t}).
Give the predictability-time formula.
tpred1λln(Δ/δ0)t_{\text{pred}}\approx\frac1\lambda\ln(\Delta/\delta_0).
Why does better initial accuracy help so little?
tpredt_{\text{pred}} depends only logarithmically on δ0\delta_0; improving accuracy by eλTe^{\lambda T} buys just time TT extra.
How can λ1>0\lambda_1>0 yet the motion stay bounded?
Local stretching (λ1>0\lambda_1>0) is combined with global folding back onto a bounded (strange) attractor.
Lyapunov exponent of the logistic map at r=4r=4?
λ=ln20.693\lambda=\ln 2\approx0.693 (it doubles separations each step).
For a map, how is λ\lambda computed?
λ=limN1Nnlnf(xn)\lambda=\lim_{N\to\infty}\frac1N\sum_{n}\ln|f'(x_n)|, the average log of the local slope along the orbit.
Three ingredients of chaos (beyond SDIC)?
Boundedness, topological mixing, and dense unstable periodic orbits.
What condition gives a dissipative strange attractor?
λ1>0\lambda_1>0 (stretching) while iλi<0\sum_i\lambda_i<0 (phase-space volume contracts).

Connections

  • Phase space and flows
  • Fixed points and linear stability analysis
  • Strange attractors and fractal dimension
  • The logistic map and period-doubling route to chaos
  • Hamiltonian chaos and the KAM theorem
  • Driven damped pendulum
  • Liouville's theorem (phase-space volume)

Concept Map

fixes future exactly

seeds tiny delta0

nearby paths diverge

Taylor keep f prime

take ln divide by t

classifies

classifies

classifies

implies

paths converge

Deterministic rules

Imperfect knowledge delta0

Sensitive dependence SDIC

Practical unpredictability

Linearise separation

Exponential growth e^lambda t

Maximal Lyapunov exponent lambda

lambda greater than 0 chaos

lambda equals 0 marginal

lambda less than 0 attractor

Hinglish (regional understanding)

Intuition Hinglish mein samjho

Chaos ka matlab "randomness" nahi hai — system bilkul deterministic hota hai, yaani rules fixed hain, same starting point se hamesha same future. Phir bhi prediction fail kyun hoti hai? Kyunki hum initial condition ko kabhi exactly nahi jaante — thoda sa error δ0\delta_0 hamesha rehta hai. Chaotic system mein yeh chhota error exponentially badhta hai: δ(t)δ0eλt\delta(t)\approx\delta_0 e^{\lambda t}. Yahi hai "butterfly effect".

Yeh λ\lambda ko Lyapunov exponent kehte hain — yeh batata hai do paas-paas trajectories kitni tezi se alag hoti hain. Agar λ>0\lambda>0 to chaos (alag ho jaati hain), λ=0\lambda=0 to periodic/regular, aur λ<0\lambda<0 to dono paas aa jaati hain (stable attractor). Isko derive karna simple hai: do nearby paths ka gap lo, Taylor expand karke δ˙=f(x)δ\dot\delta=f'(x)\delta banao, solve karo to δδ0eλt\delta\sim\delta_0 e^{\lambda t} aata hai. Bas average local stretching rate hi λ\lambda hai.

Sabse important practical baat: prediction time tpred1λln(Δ/δ0)t_{\text{pred}}\approx\frac1\lambda\ln(\Delta/\delta_0). Isme δ0\delta_0 sirf logarithm ke andar hai. Iska matlab — chahe aap apne instruments million guna accurate kar lo, prediction horizon sirf thoda sa (double) badhega. Isiliye weather 2 hafte se aage predict nahi hota, sensors kitne bhi acche ho jaayein.

Ek galti se bacho: λ>0\lambda>0 ka matlab trajectory infinity tak nahi udti. Stretching sirf local hai; system "stretch-and-fold" karke bounded strange attractor pe hi ghoomta rehta hai. Local mein door, global mein bounded — yahi chaos ka asli mazaa hai.

Go deeper — visual, from zero

Test yourself — Analytical Mechanics

Connections