Matpic
mathematics, in pictures
Concept

Substitution

A rule that replaces each symbol of a word, or each tile of a tiling, by a fixed pattern of symbols or smaller tiles. Repeating it grows a whole word or tiling from one seed, and the matrix counting what each piece becomes fixes how often each piece appears in the limit.

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

A straight line across a grid, and the word of walls it crosses. A line of slope 0.6180 crossing a unit grid, with each crossing marked V or H, beside the same path folded into a square as a billiard trajectory; the word begins VHVHVVHVHVVHVVHVHVVH.

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.

dynamics · Billiards A patch of Penrose's rhombs. A disc of Penrose rhombus tiling after 5 subdivisions, thick and thin rhombs shaded differently: 550 thick and 340 thin half-rhombs.

Tiles that never repeat

Two rhombs with angles taken from the pentagon, cut each into halves, and cut each half into smaller copies of the two halves by a fixed rule. Repeat, and the pieces fill the plane with no gaps and no overlaps, in a pattern with five-fold stars everywhere and no period anywhere. The reason it cannot repeat is a single number: thick tiles outnumber thin ones by φ, and a repeating pattern would make that ratio a fraction.

geometry · Golden ratio Unifying f(x, g(x)) with f(h(y), g(z)). Three term trees: f(x, g(x)), f(h(y), g(z)), and their common instance f(h(y), g(h(y))) under the most general unifier x ↦ h(y), z ↦ h(y).

Two terms made equal, and no more

Resolution with variables needs two literals to clash, and they clash only after something has been substituted for their variables. There are infinitely many substitutions that would do. One of them is the most general — every other is it followed by something more — and an algorithm of four rewriting rules finds it or proves there is none. That single computation turns the search for instances from guessing into arithmetic.

logic · Resolution

Named alongside it

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

ComplexityFibonacciGolden ratioAperiodicityBilliardsEigenvectorIrrational rotationPenrose tilingProof systemQuantifierRefutationResolution

All concepts