Matpic
mathematics, in pictures
Theme

Small cases lie — page 2

Patterns that hold for every example anyone would check by hand, and then stop. The cases within reach are not a sample of the cases.
Hamilton's method on 27 seats and 5 regions. A worksheet of populations, exact quotas, floors, remainders and the seats Hamilton's method awards to 5 regions. Applied

The seat that vanishes when the house grows

Twenty-seven whole seats have to be divided between five regions whose exact shares are 15.417, 7.209, 1.755, 1.431 and 1.188. Every rule for rounding those five numbers breaks something, and the instance drawn here breaks all three of the classical ways at once.

 The link that makes every traveller later. Four nodes and two routes, with the equilibrium flow and travel time before a zero-cost link is added between A and B and after. The travel time rises from 10 to 12. Applied

The road that makes everyone later

An equilibrium is a state nobody can improve alone, which is a much weaker thing than a state anybody would choose. Adding a link that costs nothing to use makes every traveller in this network strictly slower, and the arithmetic says by exactly how much.

 All 24 arrangements of 4 objects, and the 9 that move every one. Every permutation of 4 objects drawn as a grid of cells, with the diagonal — where an object stays where it began — shaded, and the arrangements that avoid it entirely marked. Probability

Nobody gets their own hat

Hand back a pile of hats at random and ask for the chance that not one person gets their own. The answer barely moves as the crowd grows — it is a third and a bit at four people, and a third and a bit at four thousand.

 Four staircases against a quarter circle, all of length 2. A quarter circle with staircases of 1, 2, 4, 16 steps drawn over it; each hugs the curve more closely than the last and every one of them is exactly 2 long. Analysis

The staircase that is not the diagonal

A staircase can be made to follow a quarter circle as closely as anyone likes. Its length is 2 at every stage and the arc's length is 1.5708, and no amount of refinement closes the gap — which is a fact about length rather than about staircases.

 five values, unevenly weighted, and the mass outside 3 standard deviations. A distribution drawn as bars, with the windows one and a half, two and three standard deviations wide marked. The probability outside each window is summed and compared with the bound that knows only the variance. Probability

How far from the average a thing can be

Knowing only an average and a spread — nothing about the shape, nothing about the number of outcomes, nothing about symmetry — the chance of landing three standard deviations out is at most one in nine. And there is a distribution that lands there exactly that often, so the bound cannot be improved.

 The diagonal of a box, by using the theorem twice. A box 12 by 4 by 3 with the diagonal of its floor drawn, and the diagonal of the box standing on it; the two right triangles share a side and give the sum of three squares. Geometry

Two right angles and the diagonal of a box

The theorem applied once gives the diagonal of a floor. Applied again, standing on the first result, it gives the diagonal of the room — and the pattern does not stop at three, which is where a fact about triangles quietly becomes the definition of distance.

 A right triangle on a sphere. A spherical triangle with a right angle where the equator meets a meridian and legs of 50 and 60 degrees; its hypotenuse is shorter than the flat theorem predicts. Geometry

The triangle that a globe gets wrong

On a sphere, a right triangle with legs of fifty and sixty degrees has a hypotenuse of seventy-two, not seventy-eight. The theorem is not approximately true there — it is false, and what replaces it says exactly how much room the surface has.

 A solid where V − E + F is 0. a slab with one hole through it, drawn as a wireframe. Its 32 vertices, 64 edges and 32 faces give an alternating sum of 0 rather than 2. Topology

The solid where the answer is not two

A slab with a hole through it has flat faces, straight edges and sixteen corners, and its alternating sum is zero. It is not a trick and not a degenerate case — it is the object that shows the theorem had a hypothesis nobody had written down.

 Time spent on one side of the axis. The exact distribution of the number of steps a 40-step fair walk spends above the axis. It is U-shaped: the extremes are the likeliest outcomes and an even split is the rarest. Probability

Half the time is the rarest answer

In a fair game of many rounds, the fraction of the time one side is ahead is not usually near a half. It is usually near nought or one, and an even split is the single least likely outcome there is.

 A walk with a barrier at each end. Three games played to absorption on a table of 12, beside the chance of ruin from each starting stake — a straight line, because the walk is fair. Probability

Two barriers and a fair game

A fair walk between two absorbing barriers is ruined with a probability that is a straight line in the starting stake, and lasts for a number of steps that is the product of what each side can lose. Both facts come from the same two-line recurrence, and both are bad news for the smaller player.

 One swap frees a colour. A vertex of degree five whose neighbours carry five different colours, before and after a Kempe chain is recoloured. The swap frees one colour for the middle vertex. Discrete

Five colours, and a chain that can be followed

The four-colour theorem cannot be checked by a person. The five-colour theorem can, in a page, and the argument that does it is the one Kempe thought had settled four — with the exact step where it fails visible in the picture.

 Seven regions on a doughnut, each touching all six others. A brick pattern of seven labelled regions on a torus, drawn as a rectangle whose opposite edges are identified. Every pair of regions shares a border, so no two may take the same colour. Discrete

Seven regions on a doughnut

A map on a torus can need seven colours, and the proof is a picture — seven regions, each sharing a border with all six others. The plane needed a computer and eighty-six years; the harder surface was settled in 1890 by drawing something.

 Averages of a heavy-tailed quantity, which never settle. Running averages of draws from a Cauchy distribution, which jump rather than converge, beside the cumulative distributions of averages of 1, 4 and 16 draws, which lie on top of one another. Probability

An average that never settles

The average of many independent quantities is supposed to steady as their number grows. For one famous distribution it does not steady at all — the average of a thousand draws has exactly the same distribution as a single draw, and no amount of further averaging changes it.

 How fast a sum becomes a bell curve. The largest gap between the distribution of a standardised sum and the bell curve, against the number of terms, on logarithmic axes. Both summands fall along a line of slope about minus a half. Probability

How fast the bell arrives

The limit theorem says a standardised sum approaches the bell curve and says nothing about when. The rate is one over the square root of the number of terms, the constant in front is made of the third moment, and both are visible.

 The chance the average clears 0.75, against the number of draws. The exact probability that the average of n draws exceeds a fixed level, on a logarithmic scale, falling along a straight line whose slope is the rate function, with the normal approximation drawn beside it and diverging. Probability

The tail is not a bell

The limit theorem describes a window of width one over the root of n around the mean; ask instead for the chance that an average lands a fixed distance away and the answer falls exponentially, at a rate computed from the summand before any n is chosen.

 The quaternion multiplication table, from i² = j² = k² = ijk = −1. A four-by-four multiplication table of the quaternion units, with the row giving the left factor, every entry computed from Hamilton's rule, and the pair that differs between the two orders marked. Algebra

A multiplication that remembers the order

Four characters — i² = j² = k² = ijk = −1 — define a multiplication in which ab and ba are different numbers. Everything follows from them, including the fact that a rotation of a solid body has two names, and that two full turns are needed to get one of them home.

 256 consecutive pairs from xₙ₊₁ = 137xₙ + 187 mod 256. Consecutive outputs of a linear congruential generator plotted as points of a square, falling on a small family of evenly spaced parallel lines. Computation

The planes a recurrence cannot leave

One multiplication and one addition, taken modulo a fixed number, produce a sequence that passes for random one value at a time. Taken two or three at a time it does not, and the reason is a whole-number relation that pins every point onto one of a small family of parallel lines.

 The rotation number against the parameter at K = 1. The measured rotation number of a circle map plotted against its parameter, forming a staircase that is flat over an interval at each simple rational. Dynamics

The staircase that is flat almost everywhere

A map of the circle advances by an average amount each step. Plot that average against the parameter driving it and the graph is flat over an interval at every rational, rises only on a set of measure zero, and still climbs from nothing to one.

 xⁿ at 5 values of n, and the limit. Several members of the sequence xⁿ drawn on one pair of axes with the function they settle on, and the largest gap between each member and that limit reported. Analysis

A limit that forgets to be continuous

Every one of the functions x, x², x³, … is as smooth as anything could be, and every column of the picture settles down. What they settle on has a jump in it — and the quantity that sees the difference is the largest gap anywhere, which is a number about the whole graph rather than about any point of it.

 The chance of being connected, against the chance of an edge. Curves of the exact probability that a random graph on three to six labelled points is connected, plotted against the probability of each individual edge. Probability

The moment everything joins up

Add edges to a set of points one chance at a time and the graph goes from dust to a single piece — not gradually, but over a window that narrows as the point count grows. The last obstacle is almost always a single point with no edge at all, and that is what fixes where the change happens.

 The regular solids of four dimensions. 5-cell, tesseract, 16-cell, 24-cell, each turned in four dimensions and projected to the page; the edges are the pairs of vertices at the shortest distance apart. Geometry

Six in four dimensions, and three forever after

The count of regular solids goes five in three dimensions, six in four, and then three in every dimension above — for good. Four dimensions is the last place anything unusual happens, and it happens twice.

 How closely a fraction can come, and the barrier that says no closer. Two panels at very different scales: the approximations to √2, which stay above the barrier a degree-two number obeys, and the truncations of a constructed number, which fall below every barrier drawn. Number

Approached too fast to be algebraic

An algebraic number of degree d cannot be approached by fractions faster than the denominator's dth power. So a number that is approached faster than that is the root of no polynomial at all — and one can be built by choosing where its decimal digits go.

 A square's worth of points, on a line. A unit square with a point marked, the decimal places of its two coordinates woven into one number, and that number marked on a line beneath. Logic

A line with as many points as a square

Interleave the decimal places of two numbers and one number comes out; take every other place back and the two return. The square has no more points than the segment, and dimension turns out to be invisible to counting.

 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. 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.

All themes