Theme

The same thing twice — page 2

Two constructions that look unrelated and turn out to be the same object wearing different clothes.
(p ∨ q) ∧ ¬r, drawn on the cube of 8 assignments. The assignments as corners of a cube, joined when they differ in one variable, with the satisfying corners filled. Logic

A formula is a corner of a cube

A formula about three letters is a set of eight rows. Written as a table that is a list; drawn on a cube it is a shape — and the shape is what almost every later question in this field turns out to be about.

Post's five classes, and which connectives escape them. A table of connectives against the five closed classes, with the completeness verdict for each. Logic

One connective is enough

Of the sixteen ways to combine two truth values, exactly two can build all the others by themselves. Which two is not obvious, and the reason turns out to be five properties that a connective either has or escapes.

j is one more than i, counting round — as a grid, with both quantifier readings. A grid of marks for a relation, with the row and column facts the two quantifier orders ask about. Logic

Every row, or one column

For every person there is someone who loves them, and there is someone who loves everyone, are the same six words in a different order. Draw the relation as a grid and they become two obviously different questions — one about rows, one about columns.

A tableau for ((p → q) ∧ (q → r)) → (p → r). A branching tree of formulas, each branch ending in a contradiction or in a description of a counterexample. Logic

The tree that closes

To prove a formula, assume it false and take it apart. Every branch ends in a contradiction, or one of them describes exactly how it could have been false — and either way the tree is the answer, drawn.

A line, a point, and many parallels. A disc whose lines are arcs meeting the boundary at right angles, showing several lines through one point that never meet a given line. Logic

Two worlds that both obey the rules

A statement is independent of a list of axioms when there is a structure satisfying the axioms where it holds and another where it fails. That is not a claim about what nobody has managed to prove — it is a proof that nobody can.

A closed interval and an open one, matched point for point. Two number lines, one closed and one open, with arrows showing the countable sequence of points that has to move. Logic

Two injections make a bijection

If each of two collections fits inside the other without collisions, they are the same size. That sounds obvious and is not, because neither injection needs to be onto — and the proof is a rule for deciding which of the two to follow, one chain at a time.

A set, its negation, and its double negation. Four bars on one number line showing an open set, its negation, their union, and the double negation. Logic

The middle that is not excluded

Either it is raining or it is not. Drop that as an axiom and what is left is still a logic — one with models made of open sets and of stages of knowledge, in which a set and its negation between them miss the boundary.

The tower ℚ ⊂ ℚ(√2) ⊂ ℚ(√2, √3). A tower of field extensions with the degree of each step, beside the multiplication table of the basis. Computation

Every step is a square root

A line meets a line by solving a linear equation and a circle by solving a quadratic one. There is no third case, so the numbers a construction reaches can only ever double in complexity — and a doubling is a thing that can be counted.

Which regular polygons a compass and straightedge can draw, up to 100. A grid of the integers with the constructible ones filled in, each verdict computed two independent ways. Computation

Which polygons can be drawn

Three sides yes, seven no, seventeen yes. The list of constructible regular polygons is neither everything nor almost nothing, and the pattern in it is a fact about which numbers are one less than a power of two.

A code on the 3-cube, and the balls around its words. The corners of a hypercube with the chosen codewords marked and the words within one error of each shaded. Computation

Distance is a picture

A message is a corner of a cube and an error is a step along an edge. Everything a code can do is decided by how far apart the corners it uses are — and that is a fact about a drawing.

The syndrome of 1011010, and the bit it names. A parity-check matrix over a received word, with the resulting syndrome matched against the table of single-error syndromes. Computation

Finding the error without reading the message

Three parity checks on a seven-bit word produce three bits. If they are all zero nothing is wrong; otherwise they are the number of the position that broke. The message is never consulted, because the answer does not depend on it.

A degree-2 polynomial over GF(11), and the 7 values sent. A grid of the finite field with the polynomial's value at each point marked, and the transmitted symbols picked out. Computation

A polynomial through the gaps

Write the message as the coefficients of a polynomial and send its values instead. Any k of them determine the polynomial, so it does not matter which ones are lost — and it does not matter how many, as long as k survive.

The Fano plane, and the incidence table behind it. Seven points joined by six straight lines and one circle, beside the seven-by-seven table of which point lies on which line. Computation

Seven points, seven lines

A geometry with seven points, in which every two points lie on exactly one line and every two lines meet in exactly one point. There are no parallels, the whole thing is built out of the two-element field, and one of its lines has to be drawn as a circle.

Two polytopes, two optima, one number. The feasible regions of a linear program and of its dual, side by side, each with its optimal vertex, and a number line on which the gap between the two optima closes to nothing. Applied

Two numbers that have to meet

Every linear program has a shadow — a second program built from the same numbers read the other way, whose minimum can never fall below the first's maximum. That much is a one-line calculation; the theorem is that the two numbers are always exactly equal.

The value of a 2×3 zero-sum game, named from both sides. The row chooser's expected payoff against each column as a line over the mixing probability, with the lower envelope and its maximum, beside the same construction from the column chooser's side. Both give 19/15. Applied

The value from both sides

Two choosers move at the same instant, and each asks the cautious question — how much can be guaranteed, whatever the other does. With pure choices the two answers are usually different numbers; allow a probability and they are forced to be the same one.

Every relabelling of a 4-gon's corners, and the 8 that are motions. All 24 permutations of the corners drawn one by one, with the 8 that preserve every distance marked; the rest deform the polygon and are not symmetries. Algebra

Eight ways to leave a square alone

A square can be picked up and put back so that nothing looks different. There are exactly eight ways to do it, and the number is not asserted here — it is what a search through all twenty-four relabellings of the corners comes back with.

16 colourings in 6 classes. Every way of colouring the corners, with the ones a motion carries to each other placed on the same row; the number of rows is the number of genuinely different colourings. Algebra

Colourings nobody can tell apart

Sixteen ways to colour four corners in two colours, and only six of them are genuinely different. The count can be got by pooling the sixteen — or by never forming a single class and instead averaging how many colourings each motion leaves untouched.

The unit square, mapped: area × 5. The unit square and the parallelogram it becomes under a linear map, with the area of that parallelogram computed from its own corners and set against ad − bc. Algebra

The number that says how much room is left

A linear map takes the unit square to a parallelogram. The area of that parallelogram is one number, it is computable from the four entries of the matrix, and almost everything the determinant is used for is a restatement of that sentence.

The image of four circles, turning 0 to 3 times. The polynomial applied to circles of four radii, each image drawn as a closed loop with the origin marked, and the number of times the loop goes round it. Algebra

A loop that cannot miss the middle

Feed a circle into a polynomial and a closed loop comes out. A small circle gives a loop that does not enclose the origin; a large one gives a loop that goes round it as many times as the degree. Something has to happen in between, and that something is a root.

Waiting for all 6 kinds. One bar per new kind: the expected number of draws needed to see a kind not yet seen, rising as fewer of them are left, and adding to 14.70 draws in total. Probability

How long until every one turns up

Draw at random from six equally likely kinds until all six have appeared. The wait is not six draws, and it is not sixty; it is fourteen point seven, and the number is a harmonic sum wearing a hat.

A rule for moving between 3 states. 3 states drawn as circles with an arrow for every move the rule allows, labelled with its chance; a dashed loop is the chance of staying put. Probability

The rule that forgets where it came from

A walk between a few states, with the next step decided by the current one and nothing else. Run it long enough and the starting point stops mattering — but only when two conditions hold, and both of them have a picture in which they fail.

The four ways to glue a square's edges in pairs. Squares with their edges arrowed to show which is glued to which and which way round, each with the vertices, edges and faces the gluing leaves, and the surface those numbers name. Topology

Every surface is a sphere with handles

Take a square and say which edges are to be glued to which, and which way round. Four such rules give four different surfaces — and two numbers computed from the rule, without ever building the surface, say which one.

A closed walk on the 3-cube changing one place at a time. The corners of a 3-dimensional cube with a path through every one of them exactly once, each step moving along an edge, and the last corner one step from the first. Discrete

A walk that changes one thing at a time

Counting from nothing to fifteen in binary changes four digits at once somewhere in the middle. There is another order through the same sixteen words in which every step changes exactly one — and it is a closed walk on a four-dimensional cube.

One perimeter of 300, spent five ways. Regular polygons all of the same perimeter, drawn to scale beside the circle of that perimeter, with the area each encloses and the ratio 4πA/L². Geometry

The most area a fence can hold

One length of boundary, and the question of what shape to bend it into. The answer is a circle, everybody knows it, and the argument that convinced the nineteenth century turned out to prove something slightly different.

All themes