In the logistic map, period-doubling bifurcations occur at r₁ ≈ 3.0, r₂ ≈ 3.449, r₃ ≈ 3.544, r₄ ≈ 3.564. The differences decrease as (r_{n+1} - r_n)/(r_{n+2} - r_{n+1}) → δ ≈ 4.669. What does this geometric convergence imply?
AThe period-doubling bifurcations stop after finitely many steps
BThe bifurcations accumulate at a finite value r_∞ ≈ 3.5699..., beyond which the period is infinite — meaning the system is aperiodic (chaotic)
CThe system becomes periodic again after the accumulation point
DThe convergence ratio depends on the specific map being studied
The geometric convergence means the parameter intervals between successive doublings shrink by a factor of ≈ 4.669 each time. Since a geometric series with ratio less than 1 converges, the bifurcation values r_n approach a finite limit r_∞ ≈ 3.5699. At this point, the period has doubled infinitely many times — the orbit has infinite period, meaning it never repeats. Beyond r_∞, the dynamics are aperiodic (chaotic), though periodic windows appear. The convergence ratio δ ≈ 4.669 is universal — the same for all smooth unimodal maps.
Question 2 Multiple Choice
The bifurcation diagram of the logistic map shows chaos interspersed with periodic windows. The largest window has period 3. Inside this window, the same period-doubling cascade occurs (3 → 6 → 12 → 24 → ...). This self-similar structure means:
AThe logistic map is not truly chaotic — the periodic windows dominate
BThe bifurcation diagram has fractal structure — the period-doubling cascade repeats at every scale within every periodic window, with the same universal constants
CThe period-3 window is a different type of bifurcation unrelated to period doubling
DSelf-similarity only applies to geometric objects, not bifurcation diagrams
Every periodic window in the chaotic regime contains its own period-doubling cascade to chaos, which itself contains periodic windows, each with their own cascades — and so on at every scale. The bifurcation diagram is a fractal in parameter space. Moreover, the same Feigenbaum constants δ and α appear at every level of this self-similar structure. This is why the period-doubling route to chaos is universal: the same structure, governed by the same constants, appears in every smooth unimodal map.
Question 3 True / False
A period-doubling bifurcation in a map occurs when the multiplier (derivative of the iterated map at the periodic orbit) crosses -1.
TTrue
FFalse
Answer: True
For a fixed point of a map, stability requires |f'(x*)| < 1. A period-doubling bifurcation (flip bifurcation) occurs when the multiplier crosses -1 (not +1, which gives a saddle-node or transcritical bifurcation). When f'(x*) = -1, the orbit oscillates between overshooting and undershooting the fixed point, and beyond this point, the oscillation stabilizes into a genuine period-2 cycle. The same criterion applies to period-n orbits: the multiplier is the product of derivatives along the orbit, (f^n)'(x*) = f'(x₁)f'(x₂)...f'(x_n), and it crosses -1 at the doubling bifurcation.
Question 4 Short Answer
Explain why period-doubling is a route TO chaos rather than chaos itself.
Think about your answer, then reveal below.
Model answer: Each individual period-doubling bifurcation creates a periodic orbit with twice the period — still perfectly predictable and not chaotic. Chaos only appears at the accumulation point r_∞ where infinitely many doublings have occurred and the period has become infinite. The cascade is a route because it describes the mechanism by which the system progressively loses periodicity: the period grows as 2^n, the parameter intervals shrink geometrically, and in the limit, the orbit becomes aperiodic with sensitive dependence on initial conditions. The route is the journey from order to chaos; chaos is the destination.
This distinction matters because there are other routes to chaos: quasiperiodic breakdown (a torus loses its smooth structure), intermittency (long regular phases punctuated by increasingly frequent chaotic bursts), and crisis (a sudden expansion of a chaotic attractor). Period doubling is the most common and best-understood route, but it's not the only one.