Matpic
mathematics, in pictures
Concept

Topological entropy

The rate at which the number of distinguishable orbit segments of a map multiplies with each step, measured as a logarithm. For a coded system it is the growth rate of the allowed words, and for a map of an interval it is the growth rate of the monotone pieces of its iterates.

Named by 3 essays across one field — each of them below, with the objects they name alongside it.

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.

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 · Symbolic dynamics The logistic map applied 6 times at 3.5, 3.83, 4, and its folds. Side-by-side graphs of the logistic map composed with itself, one per parameter, each labelled with how many monotone pieces it has.

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 · Symbolic dynamics The Chebyshev maps T₂, T₃, T₄ and T₅. Four small square plots of the Chebyshev polynomials of degrees two to five on the interval from minus one to one, each with the diagonal drawn; the graph of degree n sweeps between the bottom and top of the square n times.

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 · Iteration

Named alongside it

The objects these essays reach for when they reach for this one.

Periodic orbitChaosGolden ratioLogistic mapMarkov partitionCharacteristic polynomialChebyshev polynomialConjugacyEigenvalueIntermediate value theoremInvariant measureLyapunov exponent

All concepts