Matpic
mathematics, in pictures
Generator

the logistic map at 3.2, iterated from 0.2

A generator in the dynamics library, called 120 times across 25 essays. Below: what it draws with nothing chosen and at each mode an essay asks for, what it checks while drawing, and everywhere it is used.

cobweb is one function. Everything below came out of it during this build, at parameters taken from the essays rather than invented for this page — so a figure here is the same figure a reader meets in an essay, and if the generator changes, this page changes with it.

With nothing chosen

the logistic map at 3.2, iterated from 0.2. A map drawn as a curve with the diagonal across it, and the staircase that iterating it produces.

x ↦ cos x: two starts, one destination

x ↦ cos x: two starts, one destination. A map whose graph is nowhere steeper than a fixed factor under one, with staircases from two different starting points converging on the same crossing, and the distance to it falling under a geometric bound.

A fixed point that attracts, and one that does not

A fixed point that attracts, and one that does not. The same map at two parameters, with the staircase walking towards the crossing in one and away in the other.

The logistic map at 2.8, and the same map applied twice

The logistic map at 2.8, and the same map applied twice. Two graphs with the diagonal across each: the map itself, whose crossings are its fixed points, and the map composed with itself twice, whose extra crossings are the points of a cycle.

How fast an iteration arrives

How fast an iteration arrives. The distance from the fixed point plotted against the step number on a logarithmic vertical axis, for two ordinary iterations and for Newton's method, whose curve bends downward.

A map drawn through the cycle 0 → 1/3 → 1, and the graph its pieces make

A map drawn through the cycle 0 → 1/3 → 1, and the graph its pieces make. The graph of a map made of two straight pieces through a cycle of three points, with the cycle drawn as a staircase, beside a two-node graph showing which piece may follow which and the matrix of that graph.

What it checks while it draws

Collected by running the family and recording what it asserted, not written here. The count is how many separate times the claim was put to the test while these drawings were made.

Where it is called

Every figure on this list is drawn by the same rule, so a change to the rule changes all of them at once. That is why the list is published.

Dynamics

A constant that does not care which map

The gaps between successive period doublings shrink by a factor. Measure that factor for the logistic map and you get 4.669. Measure it for a completely different map and you get 4.669, and nobody expected that.

 Dynamics

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.

 Analysis

A map that shrinks everything

One extra hypothesis — that every distance is shortened by at least a fixed factor — turns the existence of a fixed point into its uniqueness, an algorithm for finding it, and a bound on the error after any number of steps.

 Dynamics

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.

 Dynamics

A point that pulls, and a point that pushes

Every crossing of a curve with the diagonal is a value the rule leaves alone. Whether anything ever arrives there is decided by one number — the slope at the crossing — and the picture makes the reason obvious.

 Dynamics

A solvable chaos of every degree

The logistic map at four is chaotic and, through a change of coordinates, completely solvable: its orbits are cosines of doubling angles. The trick is not a one-off. For every whole number n there is a polynomial of degree n that multiplies angles by n instead of 2, and every one of them is exactly as solvable, has exactly nᵏ points of period k, and preserves the same distribution — and any two of them commute, which almost no two polynomials do.

 Dynamics

Almost every orbit is fair

Double a number and keep the fractional part, and do it again, and again. Where the orbit goes is written in the number's binary digits, and for almost every starting point it spends exactly a quarter of its time in each quarter of the interval. The proof is a short argument about Fourier coefficients being pushed to infinity — and it leaves room for a set of exceptions with no length at all, which includes every fraction and, for all anyone can prove, every number anyone has ever named.

 Dynamics

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.

 Dynamics

Differences round a ring

Write four numbers at the corners of a square and put on each side the difference of its two corners. Repeat with the new square. Whatever the four whole numbers are, the process reaches nought within a few steps. Write five numbers and it almost never does. Rings whose size is a power of two always finish, and every other ring settles into a cycle whose length depends on how a polynomial factors over two elements: 7 at seven, 341 at eleven, 31 at thirty-one.

 Dynamics

Fair in base two and not in base six

Almost every number has digits that look like fair coin tosses in every base, and almost no number anyone can name is known to. Stoneham's number, 1/(3·2³) + 1/(9·2⁹) + 1/(27·2²⁷) + …, is one of the few: its binary digits are provably fair. Written in base 6 the same number has a run of 121 zeros starting at the 730th digit, and a longer one at every power of three after — because in base 6 each of its terms is a terminating fraction, and the gaps between them never fill.

 Dynamics

Fractions repeat and roots look random

Almost every number between 0 and 1 has base-φ digits with the frequencies Parry's measure predicts. Which particular numbers do? Every fraction, provably, does not: its expansion repeats from the first digit, with a period equal to the period of the Fibonacci numbers modulo its denominator. And √2 − 1 and 1/π, computed exactly to twelve thousand digits, match every predicted frequency to within sampling error — which proves nothing about them at all.

 Dynamics

How fast the staircase arrives

The slope at a crossing decides whether an orbit reaches it. The same number decides how fast — and when the slope is zero the arithmetic changes kind, from a fixed factor per step to a doubling of the correct digits.

 Analysis

Root two, raised to itself for ever

Stack √2 to the power √2 to the power √2 without end and the tower settles at exactly 2. Solve the equation for a tower equal to 4 and √2 appears again, and that answer is false. The bases that give a limit run from e^(−e) to e^(1/e), the slope at the crossing decides everything, and a sum over labelled trees turns out to be the same number.

 Dynamics

The cosines of the powers of two

Start at cos 1 and apply x ↦ 2x² − 1 over and over. The map is chaotic and exactly solvable: the k-th point is cos(2ᵏ), the cosine of two to the k radians. Iterate it in floating point and the computed orbit leaves the true one after 51 steps. Read the binary digits of 1/(2π) instead and the true orbit can be followed for as long as digits can be computed — here 262,080 steps — and at that length it is as fair as any orbit can look. Whether it stays fair is a question about those digits, and nobody can answer it.

 Dynamics

The entropy in a single orbit

Topological entropy measures how fast all the orbits of a map come apart, which sounds like a property of every orbit at once. For a map with one fold it is decided by just one: the orbit of the turning point. Read that orbit as a string of signs, make a power series of it, and the entropy is minus the logarithm of the series' first zero — ln 2 at the top of the logistic family, ln φ in the window of three, and nought where the signs become the Thue–Morse sequence.

 Dynamics

The folds that measure chaos

Apply the logistic map six times and its graph goes up and down 38 times at r = 3.5 and 64 times at r = 4. How fast that number of folds multiplies with each further step is the map's topological entropy: zero through the whole cascade of period doublings, log of the golden ratio in the window of three, log 2 at the top — and it never decreases as r rises.

 Dynamics

The histogram an orbit leaves

When no single step of an orbit is worth reporting, what is left is where it spends its time. That distribution is not uniform, it does not depend on where the orbit started, and it can be computed in closed form.

 Dynamics

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.

 Dynamics

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.

 Dynamics

The road paved with doublings

Turn one dial slowly and watch what a map settles into. It settles on a point, then on two points, then four, then eight — faster and faster, and the doublings run out at a parameter that is finite.

 Dynamics

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.

 Dynamics

The staircase that shows the whole orbit

Take a number, feed it to a rule, feed the answer back in. There is a way of drawing that on the rule's own graph which turns the entire future of a starting point into a shape — and the shape is legible.

 Dynamics

Two humps and one entropy

A map of an interval with one hump has its chaos measured by one number, the entropy, and that number never decreases as the hump rises. Give the map two turning points — a hump and a dip — and the parameter space becomes a plane. The entropy is no longer a function of one setting, and the question becomes whether the maps of a given entropy form one connected curve or several. John Milnor conjectured one. Counting the laps of every cubic's iterates exactly, over the whole plane of hump heights and dip depths, draws the curves — and each comes out whole.

 Dynamics

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.

 Dynamics

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.

The whole library · What the figures prove