Generator

One cake, one halving cut at 4/9, and two measures of it

A generator in the applied library, called 47 times across 8 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.

divide 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

One cake, one halving cut at 4/9, and two measures of it. A cake as a bar with two step valuations above and below it, the cutter's halving cut marked, and a table of both people's exact value of each piece.

Two rooms, two housemates, one crossing

Two rooms, two housemates, one crossing. A line of 13 rent splits alternating between two housemates, each dot coloured by the room chosen; the choices change between neighbouring points once, where a fair split lies.

Dividing a rent of 90 three ways, on a 9-step grid

Dividing a rent of 90 three ways, on a 9-step grid. A triangle of possible rent splits, triangulated into 81 small triangles, with each grid point coloured by the room its housemate would pick; 3 small triangles have all three rooms.

Envy left at the best fully labelled triangle, as the grid refines

Envy left at the best fully labelled triangle, as the grid refines. Dots for the smallest remaining envy on grids of 3 to 24 steps, falling under the curve 2·90/K, with the odd counts of fully labelled triangles listed.

A rent split nobody envies

A rent split nobody envies. A table of three housemates' values minus rents for three rooms at the split 28.5, 33, 28.5, each housemate's assigned room shaded and at least as good for it as the others.

Every allocation of 3 indivisible items, and not one of them envy-free

Every allocation of 3 indivisible items, and not one of them envy-free. A value matrix for indivisible goods with the round-robin allocation shaded, the exhaustive counts of envy-free and EF1 allocations, and a control matrix on which envy-free allocations do exist.

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.

Applied

A rent nobody envies

Three housemates, three rooms that are not alike, one rent. Every way of splitting the rent is a point of a triangle; ask, at each point of a fine grid, which room one housemate would take at those prices, taking turns so that each small triangle has one corner for each of them. Sperner's lemma then promises a small triangle where all three would choose different rooms — and as the grid is refined, the envy at that triangle shrinks to nothing.

Applied

Envy-free, up to one item

A cake can be cut anywhere, and every guarantee about fair cutting was bought with that freedom. Take the knife away and the exhaustive search over every allocation of three objects returns nothing envy-free at all — so the subject weakened the word until taking turns was enough to reach it.

Applied

Envy that any single item would cure

Envy-free up to one item lets a person's envy be excused if removing the envied bundle's best item would cure it. The stronger standard asks that removing any item would — even the one that person values least. Every allocation of three people's items can be searched, and an allocation meeting the stronger standard was there every time; for two people cut and choose finds one, for three it took until 2020 to prove, and for four nobody knows.

Applied

How many cuts a fair share costs

Every person can be guaranteed a share of a cake worth at least one n-th by their own measure, and the oldest rule that does it asks about n²/2 questions. Splitting the people into halves and the cake at a median mark asks about n log n — and a theorem says nothing can ask fewer. Fairness has a price, and it can be counted.

Applied

One cuts and the other chooses

The oldest rule in fair division promises each of two people at least half the cake by their own measure, and it keeps that promise exactly. It does not promise what the word "fair" is usually asked to carry, and the gap opens the moment the two measures disagree across the cut.

Topology

One line that halves them both

Two shapes lying anywhere on a page, of any sizes and any shapes at all. There is always a single straight line that cuts both of them into two equal halves at once — and finding it needs no cleverness, only the observation that a quantity which reverses sign has to pass through zero.

Applied

The product that makes a division fair

Divide goods to make the total happiness as large as possible and the result can be monstrously unfair; make the least happy person as happy as possible and it can waste. Multiply the people's values together and maximise the product instead, and something unexpected happens — nobody envies anybody when goods can be split, and nobody envies by more than one item when they cannot.

Applied

Three people and a trimmed piece

For two people, one cut and one choice deliver a division nobody would swap out of. For three, the same promise costs a trimming, a residue and a choosing order contrived so that an advantage once given cannot be taken back — and the verdict is not three numbers but a whole three-by-three matrix.

The whole library · What the figures prove