11.2 The period-doubling route to chaos

In the previous lesson the logistic map’s steady state lost its stability at r=3r = 3, its multiplier passing through 1-1. The orbit responded by settling into a period-2 cycle. The natural question is what happens as rr keeps rising. The answer is a cascade — period 2, period 4, period 8, period 16, … — and it accumulates, at a rate shared by an enormous class of systems, on the threshold of chaos. This lesson follows that cascade and the universal number hiding in it.

A cycle is a fixed point of the iterated map

When the orbit alternates between two values aa and bb, neither aa nor bb is a fixed point of ff — but both are fixed points of the second iterate f(2)=fff^{(2)} = f \circ f, the map “apply ff twice.” Indeed f(a)=bf(a) = b and f(b)=af(b) = a give f(2)(a)=af^{(2)}(a) = a and f(2)(b)=bf^{(2)}(b) = b. This is the key bookkeeping move: a period-kk cycle of ff is a set of kk fixed points of the kk-th iterate f(k)f^{(k)}, and its stability is governed by the same criterion as before, now applied to f(k)f^{(k)}.

The multiplier of a 2-cycle, by the chain rule Derivation

The stability of the 2-cycle {a,b}\{a, b\} is set by the slope of f(2)f^{(2)} at either point. By the chain rule,

ddxf(2)(x)x=a=f(f(a))f(a)=f(b)f(a).\frac{d}{dx} f^{(2)}(x)\Big|_{x=a} = f'\big(f(a)\big)\, f'(a) = f'(b)\, f'(a).

The product f(a)f(b)f'(a)f'(b) is the same whether evaluated at aa or bb — a cycle has one multiplier, shared by all its points. Call it

μ2  =  f(a)f(b).\mu_2 \;=\; f'(a)\, f'(b).

The cycle is stable while μ2<1|\mu_2| < 1. Just after birth (at rr slightly above 3) the cycle is strongly attracting, μ2\mu_2 near 0. As rr climbs, μ2\mu_2 slides down toward 1-1, and when it reaches 1-1 the 2-cycle goes marginal and loses stability — exactly as the fixed point did at r=3r=3. The 2-cycle then sheds a 4-cycle, by the same mechanism applied to f(2)f^{(2)}. The pattern is self-replicating: each 2k2^k-cycle is born stable, drifts to multiplier 1-1, and bifurcates into a 2k+12^{k+1}-cycle.

This is a period-doubling bifurcation (also called a flip bifurcation, after the multiplier passing through 1-1). Each one doubles the length of the cycle. The successive thresholds for the logistic map are

r1=3,r23.449,r33.544,r43.564,  r_1 = 3, \quad r_2 \approx 3.449, \quad r_3 \approx 3.544, \quad r_4 \approx 3.564, \;\ldots

and they pile up — geometrically closer and closer together — on an accumulation point

r3.5699.r_\infty \approx 3.5699.

Beyond rr_\infty the period has doubled infinitely often; the orbit is aperiodic, and chaos has begun.

The bifurcation diagram

The standard way to see the whole cascade at once is the bifurcation diagram: for each rr, throw away a long transient and plot the values the orbit visits afterward. A stable fixed point shows as one curve; a 2-cycle as two branches; a 4-cycle as four; chaos as a dense spray of points filling intervals.

r-window: [2.500, 4.000]

Zoom the r-window into 3.54–3.57 to see the self-similar cascade — each fork is a smaller copy of the whole.

Read it left to right. A single branch holds until r=3r = 3, where it forks in two; each branch forks again near 3.449; the forking accelerates, and by r3.5699r_\infty \approx 3.5699 (marked) the branches have become a continuum — the onset of chaos. Two features reward zooming the rr-window:

Feigenbaum’s universal numbers

Measure how fast the cascade accumulates. Let Δk=rk+1rk\Delta_k = r_{k+1} - r_k be the gap between successive doublings. The gaps shrink by a nearly constant factor, and in the limit that factor is exact:

  δ  =  limkrkrk1rk+1rk  =  4.6692016  \boxed{\; \delta \;=\; \lim_{k\to\infty} \frac{r_k - r_{k-1}}{r_{k+1} - r_k} \;=\; 4.6692016\ldots \;}
where
δ\delta
the Feigenbaum constant — the ratio by which successive bifurcation gaps shrink
rkr_k
the parameter value at the k-th period-doubling

The stunning fact, discovered by Mitchell Feigenbaum in 1975–78, is that δ\delta is universal: it is the same number for the logistic map, for xrsin(πx)x \mapsto r\sin(\pi x), for any smooth map with a single quadratic-shaped hump. The detailed shape of ff does not matter; only that the maximum is locally parabolic. A second universal constant, α2.5029\alpha \approx 2.5029, sets the ratio by which the width of the branches shrinks at each doubling. Both are as fundamental to this class of transitions as π\pi is to circles.

Where universality comes from: renormalisation Derivation

Why should unrelated maps share a number? Because near rr_\infty the dynamics becomes scale-invariant, and scale-invariance is governed by a fixed point — not of the map, but of an operation on maps.

Define the renormalisation operator TT: take a map ff, iterate it twice (fff \circ f), and rescale xx by the factor α-\alpha so the new hump has the same height and width as the old. Symbolically,

(Tf)(x)  =  αf ⁣(f(x/α)).(Tf)(x) \;=\; -\alpha\, f\!\big(f(-x/\alpha)\big).

Each application of TT looks at the dynamics one period-doubling deeper, “zoomed in” by α\alpha. The cascade’s self-similarity says that under repeated TT, the details of any starting ff wash out and the map flows toward a single universal map gg — a fixed point of the operator, Tg=gTg = g. Because every quadratic-hump map is drawn to the same gg, they all inherit the same quantitative behaviour near onset. The constant δ\delta is then the dominant eigenvalue of TT linearised about gg: it measures how fast the parameter direction is stretched at each renormalisation step, which is exactly the rate at which the rkr_k converge. This renormalisation-group argument — borrowed from the theory of critical phenomena in statistical physics — is why a population model and a fluid on the verge of turbulence carry the same number.

The universality is not just theoretical. Feigenbaum’s δ\delta has been measured in convecting liquid helium and mercury, in driven nonlinear circuits, in chemical oscillators, in a dripping tap — systems with no logistic map anywhere in their description, all reproducing 4.6694.669 as they period-double into chaos.

The history — Feigenbaum's pocket calculator and a universal constant

In 1975 Mitchell Feigenbaum, at Los Alamos, was computing the bifurcation points of period-doubling maps on an HP-65 programmable calculator. The convergence was slow, so to guess where the next bifurcation would fall he computed the ratio of successive gaps — and found it tending to a constant, 4.66924.6692. Trying a completely different map, xrsin(πx)x \mapsto r\sin(\pi x), he expected a different number and got the same one. The shared constant told him the behaviour was universal, independent of the specific nonlinearity (Feigenbaum 1978).

The mechanism — a renormalisation-group fixed point in the space of maps — connected chaos to Kenneth Wilson’s contemporaneous Nobel-winning work on phase transitions, where the same mathematics explains why fluids and magnets share critical exponents. Feigenbaum’s papers were rejected repeatedly before publication; the result was so unexpected that referees did not believe a simple universal constant could govern the onset of chaos across unrelated systems.

What this gives us

The period-doubling cascade turns the vague idea of “a system becoming chaotic” into something precise and measurable:

So far everything has lived in one dimension and discrete time. The next lesson moves to continuous-time flows, where chaos first appeared historically, and meets the object the chaotic orbit lives on: the strange attractor.