Symbolic dynamics
Named by 11 essays across 2 fields — each of them below, with the objects they name alongside it.
The orbit written as a word
Cut the interval in two and record which half each step of an orbit lands in. The orbit becomes an infinite string of two letters, the map becomes the act of deleting the first letter, and questions about trajectories turn into questions about words.
The same map in different coordinates
The tent map and the logistic map at four look nothing alike and are the same map, carried onto each other by a change of variable. Everything either one does the other does, and the change of variable is a sine squared.
Stretch, fold, and what is left
A system that pushes every pair of nearby points apart and keeps them all inside a bounded region has only one option, and it is the one a baker uses. Stretching and folding is the mechanism, and what survives infinitely many folds is a Cantor set.
A matrix that counts the returns
Draw a map straight through the cycle 0 → 1/3 → 1 and its two pieces carry each other in a fixed pattern: the left piece only across the right, the right across both. The orbits' words are then walks on a two-node graph, and the number of points that come back after n steps is the trace of that graph's matrix to the nth power — 1, 3, 4, 7, 11, 18 — each one checked by solving for the points exactly.
The word a straight line spells
A ball rolling across a square table, forever, hits walls in some order: V for a side wall, H for the end wall. Unfold the table and the ball becomes a straight line across a grid, and the order of walls becomes a word — VHVHVVHVHVVHV… for the golden slope. That word has exactly n + 1 different blocks of every length n, the fewest any word that never repeats can have; every stretch of it holds its fair share of H's to within one; and its blocks occur with at most three different frequencies.
Counting in a base that is not a whole number
Multiply by β and keep the fractional part, over and over, and the whole parts you throw away are the digits of the starting number in base β — even when β is the golden ratio. Which digit strings can ever appear is decided by one string alone: the way the number 1 is written in that base. In base φ it is .11, so 11 is the only thing forbidden; in base 1.8 it never ends, and no finite list of rules describes what is allowed.
Where a base-β orbit spends its time
Follow x ↦ βx mod 1 for a million steps and count how often the orbit visits each part of the interval. For the doubling map the answer is evenly; for the golden ratio it is a staircase with one step, spending 1.17 times the average near 0 and 0.72 times it near 1. The step sits exactly where the orbit of the number 1 lands, and in a base whose 1 never has a finite expansion the staircase has infinitely many steps.
Where the Collatz map is a coin
Extend the Collatz map from the whole numbers to the 2-adic integers — binary strings that run on for ever to the left — and it stops being mysterious. It becomes, after a change of coordinates, the simplest chaotic system there is: shifting a string of coin tosses one place. Everything about it is then known, and none of it says anything about the whole numbers, which is the most instructive failure in the whole story.
Windows counted like necklaces
The logistic map has one window of period three, two of period four, three of period five, five of period six, nine of period seven — and the sine map, which shares no algebra with it, has exactly the same numbers, in exactly the same order along the parameter. The counts are 1, 1, 1, 2, 3, 5, 9, 16, 28, 51, and they are the number of ways to thread a necklace of beads in two colours.
The word a line spells in a cube
A ball bouncing in a cube hits three kinds of wall, and the order spells a word in three letters. On a square table the word had n + 1 different blocks of length n; in the cube it has $n^2 + n + 1$ — three, seven, thirteen, twenty-one — for a direction in general position. What general position has to exclude turns out to be more than any rational relation among the three speeds.
Every loop of the butterfly links every other
The Lorenz equations have infinitely many periodic orbits, each a closed loop winding round the two lobes in its own order. Name each loop by that order — LR, LLR, LLRLR — and the linking number of any two can be read off the names, without solving anything: it is half the number of times a left-going strand passes a right-going one. Every such crossing has the same sign, so every pair of loops links, positively. Computing forty-five pairs from the equations themselves, the Gauss integral lands on the predicted whole number every time.
Named alongside it
The objects these essays reach for when they reach for this one.
Periodic orbitGolden ratioConjugacyShift mapTopological entropyBilliardsIterationItineraryLogistic mapSturmian wordUnfoldingBifurcation