Astronomy & Celestial Mechanics
the sky, computed
Series

Chaos — the series

5 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. A separation of 10⁻¹⁰ becomes 0.0285. The distance between two copies of Burrau's problem, started 10⁻¹⁰ apart in one coordinate of one body and then stepped in lockstep — one loop, one step size, both states advanced by it — for 60 time units. The vertical axis is logarithmic, so the straight stretch is exponential growth, and its slope is the Lyapunov exponent: 0.3413 per time unit, fitted over the 604 samples lying between ten times the starting offset and a tenth of the system's own size. That is an e-folding every 2.93 time units, so the separation multiplies by ten every 6.75 and by 7.8·10⁸ across the whole run. It has not saturated within the drawn interval: the growth rate over the last tenth of the run is still 0.6002 per time unit, 176% of the fitted exponent, and the separation has reached only 0.90% of the system's own size. The exponent is what sets a prediction horizon, and this run is drawn short of it on purpose: the straight line is the measurement, and the flat part that follows is arithmetic about how far apart two bounded systems can get.

    A prediction with an expiry date

    The inner solar system's Lyapunov time is about five million years, so a centimetre of error becomes an orbit in a hundred million. The ephemeris dies while the system survives — because the elements stay bounded when the phase does not, and only one of those is what stability means.

    part 1 · gravitation
  2. The last curve across the cylinder, before and after it breaks. Surfaces of section for the standard map at K = 0.5, 0.9716, 1.4, each 22 trajectories iterated 41 times from a column of starting values. Nothing here is placed: every dot is an iterate. At K = 0.5 the islands are separate and the space between them is filled with curves that run all the way round in θ — a trajectory cannot get from one island to the next, and one started beside the hyperbolic fixed point wanders 2.91 in p — 0.46 of a cylinder — and stops. At K = 0.9716, which is Greene's threshold to four figures, the last of those curves is on the point of going and the same trajectory still only reaches 4.84, which is 0.77 of a cylinder. At K = 1.4 it covers 6.1 cylinders: the barrier is gone and there is nothing left to stop it. That transition is what a chaotic zone in the asteroid belt is, drawn without any asteroids.

    Where the chaos comes from

    A Lyapunov time says how long a prediction lasts. It does not say what destroyed it. The mechanism is two resonances whose libration widths overlap, and the transition can be watched happening on a surface of section as one number is turned up.

    part 2 · gravitation
  3. A chaotic orbit that waits, and then moves. The momentum of one trajectory of the standard map at K = 1.2, unwrapped and counted in whole turns of 2π, against the iteration number, over 39,892 iterations. The motion inside each band is chaotic from the first step — the trajectory's Lyapunov time is 3.7 iterations — but it lingers near one integer resonance for thousands of iterations before reaching the next: the waits were 3,098, 1,464, 9,461, 15,957, 6,058, 3,854 iterations. Each arrival at the next integer resonance, drawn dashed, is marked. Between the integer resonances lie the remnants of the broken invariant curves, which no longer block the trajectory but still hold it, and each passage is quick compared with the wait before it.

    A barrier that leaks at a rate that can be computed

    When the last invariant curve between two resonances breaks, it does not vanish. It becomes a cantorus — a curve full of gaps — and a chaotic orbit has to find the gaps to get through. The time that takes grows as the cube of how close the system is to the threshold, and it has nothing to do with the Lyapunov time, which is why an orbit can be hopelessly unpredictable and still stay put for the age of the solar system.

    part 3 · gravitation
  4. How long a chaotic orbit stays away, with and without islands. The fraction of recurrence times to a small square in the chaotic sea of the standard map that exceed a given number of iterations, on logarithmic axes, counted along one orbit of 6·10⁷ iterations at K = 1.5 and K = 7 (772,165 recurrences, mean 78; 548,043 recurrences, mean 109). Dashed: exponentials with the same means. At K = 7, where the islands have all but vanished, the recurrences are exponential: the orbit forgets where it was in a few iterations. At K = 1.5 they part from the exponential after a few hundred iterations and fall instead as a power of time, with exponent 1.17 between a thousand and a hundred thousand iterations; the step at the left is the share of visits that simply stay in the square for a second iteration. A recurrence a thousand times longer than the mean is found once in 257,388 recurrences, where an exponential would give one in e to the thousand. Each mean is the area of the chaotic sea divided by the area of the square — 110 when the sea fills the torus, 78 at K = 1.5, where the islands take 29 per cent of it. The islands shorten the average absence and lengthen its tail.

    A chaotic orbit clings to the edge of order

    In a chaotic sea with no islands, an orbit forgets where it was within a few steps, and the time it stays away from any region falls off exponentially. Put islands of regular motion in the sea and the long absences multiply by factors of millions: the orbit reaches an island's edge, is caught in the hierarchy of smaller islands round it, and behaves as if it were regular for thousands of steps. The tail becomes a power law, and a rare few absences carry a large share of the orbit's whole history.

    part 4 · gravitation
  5. One orbit, chosen to spell 1, 3, 1, 4, 1, 5. The height of the particle on the axis of an equal-mass binary of eccentricity 0.3, from launch at phase 210° and speed 1.3105, found by a seeded nested search for the sequence of excursions 1, 3, 1, 4, 1, 5, in whole binary periods. Between each pair of crossings the particle's excursion lasts the listed number of periods, to the nearest whole one. Moser's theorem is about every sequence of large enough integers at small enough eccentricity and is exact; this is one finite word at one finite eccentricity, found numerically to show the kind of thing the theorem says exists.

    A particle on a line that can spell any word

    Two equal stars orbit each other, and a speck of dust moves up and down on the line through their centre, perpendicular to their orbit. It has one coordinate and cannot leave that line. In 1973 Jürgen Moser proved that for almost any list of whole numbers, as long as they are large enough, there is an orbit whose successive excursions last exactly that many periods of the stars. The list can be chosen at random, so the orbit can do anything a coin can.

    part 5 · gravitation

All series