Matpic
mathematics, in pictures
Concept

Rounding

Replacing a quantity by a nearby whole number or simpler value, and taking on whatever that difference costs. The error it introduces is bounded by half a unit and accumulates, which is what makes a long computation's error analysis necessary.

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

Two orbits of the logistic map at 3.9, started 0.0001 apart. Two sequences from almost the same starting point, plotted together against the step number.

A difference too small to draw

Two starting points a ten-thousandth apart, under the same rule, with nothing random anywhere. Within forty steps they have nothing in common — and the rule was not doing anything to them that it does not do to everything.

dynamics · Sensitive dependence 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.

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.

applied · Apportionment Five rules, one dial. Seats for each of 5 regions at 21 settings of the rounding threshold, with the three settings that are the named methods marked; the largest region gains and the smallest loses as the threshold rises.

Five rules and one dial

Adams, Webster and Jefferson are usually taught as three rules for rounding a share. They are one rule with a number in it, and turning that number from nought to one moves seats from the smallest region to the largest, one at a time.

applied · Apportionment Which regions each rule favours. Average seats above or below exact quota for the largest and the smallest region, under each of the five methods, over 400 generated instances.

The rule with no favourites

Over four hundred instances, Jefferson's method gives the largest region a third of a seat more than its exact share and the smallest a third of a seat less. Adams reverses both. Webster's average is a hundredth of a seat, and that is not luck.

applied · Apportionment Seats to districts and to parties at once. A 4 by 3 table of seats, with every row total and every column total prescribed. The entries come from scaling the votes by one factor per row and one per column and rounding, and all the totals come out exactly right.

Seats to parties and places at once

Seats can be given to regions in proportion to one list of populations, and no rule does it perfectly. Ask for seats to regions and to parties simultaneously and the object stops being a list — and the impossibility that closed the subject does not apply.

applied · Apportionment Biproportional seats against their fair shares. A table of votes for 3 districts and 4 parties beside the seats the biproportional method gives, each with the fair share from the continuous fit, and the cell whose seats fall outside its quota marked.

The table inside every quota

Give seats to districts and parties at once, and every cell of the table has a fair share it ought to round from. A table rounding every cell to its floor or its ceiling, with every total exact, always exists. The biproportional method does not always choose one: here it gives a party 2 seats where its fair share is 3.088.

applied · Apportionment Sixteen halves in a three-by-three-by-three table of seats. A three-way table of fair shares drawn as three slices, one per group, with sixteen cells holding a half and every line total, along districts, parties and groups, equal to zero or one.

Where the rounding runs out

In two dimensions a table of seats inside every fair share always exists. Add a third family of totals — every district and party split between groups — and it need not. Sixteen halves in a three-by-three-by-three table meet every total, and no whole table does it without a seat where the fair share is nothing, because the halves close a loop of seven.

applied · Apportionment Base-φ digits of two fractions and two irrational numbers. Four rows of 72 base-φ digits each, for 1/3, 2/7, √2 − 1 and 1/π; the two fractions repeat with periods 8 and 16, the two irrational numbers show no period.

Fractions repeat and roots look random

Almost every number between 0 and 1 has base-φ digits with the frequencies Parry's measure predicts. Which particular numbers do? Every fraction, provably, does not: its expansion repeats from the first digit, with a period equal to the period of the Fibonacci numbers modulo its denominator. And √2 − 1 and 1/π, computed exactly to twelve thousand digits, match every predicted frequency to within sampling error — which proves nothing about them at all.

dynamics · Symbolic dynamics

Named alongside it

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

ApportionmentDivisor methodQuotaImpossibilityCounterexampleCounting argumentExhaustive searchExistence proofFairnessGeometric meanMatrixMonotonicity

All concepts