Matpic
mathematics, in pictures
Concept

Measure zero

The property of a set that can be covered by intervals of total length as small as desired. Every countable set has it, and so do uncountable ones such as the Cantor set — so it is a notion of smallness quite separate from how many members a set has.

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

Middle thirds removed 6 times over. The interval with its middle third removed, then the middle third of each survivor, and so on. The lengths removed are a geometric series adding to the whole interval.

Almost none of it left, and still uncountably many

Remove the middle third of an interval, then the middle third of each piece left, and keep going. The lengths removed add to exactly the whole interval, so nothing measurable survives — and what survives can be paired off one for one with every point of the interval that was started with.

analysis · Measure The algebraic numbers, arriving in finite batches. A stretch of the number line with the roots of integer polynomials marked, each at the height of the smallest polynomial that catches it, and the count of polynomials at each height.

Countable, and everywhere

The numbers a polynomial can catch arrive in finite batches, so they can be listed. They are also in every interval, however short. Being listable turns out to say nothing whatever about being sparse.

logic · Cardinality A set with no interval in it and half its length left, after 6 stages. Stages of removing a shrinking middle from every surviving interval, with the total length left printed at each stage, and the middle-thirds construction of the same depth drawn beneath for comparison.

No interval in it, and length to spare

The middle-thirds set has no length because the removed pieces add to one. Remove shrinking middles instead and they add to a half — leaving a set that still contains no interval anywhere, and still has half the length it started with.

analysis · Measure The rationals covered by intervals of total length 0.1800. Intervals of rapidly shrinking length placed around the rationals of the unit interval in the order they are listed, with the union of them drawn as a single band beneath.

Covering a set from outside

To say how long a set is, cover it with intervals and add their lengths, then take the smallest total any covering achieves. That definition is short, obviously right for an interval, and gives the rationals a length of nothing.

analysis · Measure Two indicators, and the upper sum that will not come down. A partition of the unit interval drawn against the middle-thirds set and against a set of positive length, above a chart of each one's upper sum as the partition is refined.

Which functions can be added up

Riemann's integral works when the upper and lower sums close on each other. The exact condition for that, found once measure existed to state it in, is that the points where the function jumps have measure zero — which some nowhere dense sets fail.

analysis · Measure The classes, a selection from them, and the translates that cannot have a length. Points of several classes of the unit interval under translation by rationals, drawn one class per row, above rows showing rational translates of a selection that never overlap.

A set that has no size at all

Slide the unit interval along itself by every rational and the points fall into classes. Choose one point from each and the resulting set has no length — not zero, not positive, none: countably many disjoint copies of it would have total length nought or infinity, and the union needs something in between.

analysis · Measure How long four orbits of the doubling map spend in each quarter. Grouped bars for four starting points of the doubling map, each group showing the fraction of time the orbit spends in each quarter of the unit interval, against a dashed line at one quarter.

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 · Iteration The Cantor function has length 2. The graph of a singular or partly singular increasing function on the unit interval with an inscribed polygon, beside a table of inscribed lengths by stage and the value the derivative formula gives.

The length the derivative never sees

The Cantor function climbs from 0 to 1 with a slope of zero almost everywhere, so the formula ∫√(1 + f′²) dx says its graph has length 1 — the length of a flat line. The inscribed polygons say 2. Mix it half and half with the diagonal and the length becomes exactly the golden ratio, while the formula still reports only the part the slope can see.

analysis · Arc length A line in every direction in the plane over GF(7), in 31 points. A square grid of the points of a small finite plane with the points of a Kakeya set filled, beside a list of the lines it contains, one for each direction.

No set with a line in every direction is small

In the plane over the integers modulo 7 there are 49 points and lines in 8 directions. A set holding a whole line in every direction needs 31 of the points — more than half — and in any dimension such a set fills a fixed share of the space. In the real plane the same sets can have area zero. Over a finite field one polynomial of low degree shows they cannot be small.

computation · Finite fields Three sizes of infinity, and the collections that have each. ℵ₀: the fractions, the algebraic numbers, every finite text, every definition of a number; 2^ℵ₀: the real numbers, the continuous functions, the open sets, the closed sets, the Borel sets; 2^(2^ℵ₀): all functions, all sets of reals, the non-Borel sets, the measurable sets.

What counting can prove exists

There are only as many continuous functions as points of a line, only as many Borel sets, only countably many definitions — and more sets of reals than any of those. So counting proves that discontinuous functions, non-Borel sets and undefinable numbers exist without exhibiting one. It cannot prove that a set with no length exists, because the sets that have a length are exactly as numerous as all sets, and that difference turns out to be the difference between what the axioms force and what they merely allow.

logic · Cardinality Riemann's function on one period, with its one kind of smooth point. R(x) = Σ sin(n²x)/n² on [0, 2π]; R(π) = 0 with derivative −1/2; R(π/2) = 1.2336, a cusp.

The slope a Gauss sum leaves behind

Riemann is said to have offered sin x + sin(4x)/4 + sin(9x)/9 + … as a continuous function with no derivative anywhere. It has one after all, at π and at every π times an odd number over an odd number, and the slope there is always exactly −1/2. Computed with a million terms, the function's behaviour at every fraction is read off a single number — a quadratic Gauss sum — and the slope appears exactly where that number is zero.

analysis · Uniform convergence

Named alongside it

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

Cantor setMeasureCountabilityDense setLimitGeometric seriesAxiom of choiceCardinalityDerivativeFourier seriesIntervalSelf-similarity

All concepts