Sensitive dependence
Named by 10 essays across one field — each of them below, with the objects they name alongside it.
A difference too small to draw
Two starting points a ten-thousandth apart, under the same rule, with nothing random anywhere. Within forty steps they have nothing in common — and the rule was not doing anything to them that it does not do to everything.
How fast two orbits part
The word "sensitive" is an adjective. Averaging the logarithm of one derivative along an orbit turns it into a number — one that says how many steps of prediction the map allows, and whose sign says whether it allows any.
Where Newton's method goes instead
An algorithm designed to find roots, run from every starting point at once. Three roots, three basins, and a boundary at which all three are arbitrarily close — so a rule with no randomness in it has starting points whose answer cannot be predicted.
Two lobes and no cycle
Three equations, three variables, and a trajectory that never crosses itself, never repeats, and never leaves a region of zero volume. The set it settles onto is not a point, not a loop, and not a surface.
The orbit a computer draws
A chaotic orbit computed in floating point is not the orbit of the point it started from. Sometimes it is the true orbit of a nearby point, which is enough; sometimes the arithmetic simply runs out, and the picture is of the rounding.
The obstacle that makes a table chaotic
Put one round post in the middle of a square table and every trace of order goes. Two paths that start a hundred-thousandth of a degree apart end up on opposite sides of the table, and the reason is that a wall curving outwards multiplies a gap where a flat one only adds to it.
A closer start buys only time
Two trajectories from almost the same place separate exponentially, and the rate does not depend on how close they began. Halving the initial error buys one fixed interval of extra agreement, and no amount of precision buys more than a fixed number of those.
A dimension from the stretching rates
An attractor has no construction rule, so its dimension has to be counted — which was the whole case for defining dimension by counting. Kaplan and Yorke's formula computes it instead, from two numbers that describe the map and never look at the set.
Sensitivity comes free
The standard definition of chaos asks for three things: an orbit that goes everywhere, periodic orbits everywhere, and sensitive dependence on the starting point. The third, the one the word chaos is usually taken to mean, turns out to follow from the other two. A periodic point and a wandering point that start side by side must eventually part, because the wanderer has to visit places the periodic orbit never goes.
Chaos on a set nobody lands on
Stretch the interval by three and fold it, and a third of it lands outside. Almost every starting point wanders chaotically for a few steps and then leaves for good; the points that never leave form a Cantor set of no length, on which the map is as chaotic as any map can be. How fast points escape, how fast they are stretched, and how thin the surviving set is are three numbers tied by one equation: the dimension is one minus their ratio.
Named alongside it
The objects these essays reach for when they reach for this one.
ChaosLyapunov exponentOrbitIterationAttractorBifurcationDerivativeDeterminismDissipationFractal dimensionLogarithmLogistic map