Generator

The seven ways to specify a fold

A generator in the axioms and construction library, called 35 times across 12 essays. Below: what it draws at its defaults and at the arguments the essays give it, what it checked while drawing, and everywhere it is used.

axiom-set is one function. Everything below came out of it during this build, at arguments 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 when the generator changes, this page changes with it.

At its defaults

The seven ways to specify a foldThe Huzita–Hatori axioms: every fold that can be specified by bringing existing points and lines into coincidence. The list is complete — six were catalogued in 1991, the seventh in 2001, and no eighth exists. The sixth is the one a compass cannot reach.axiom 1through two pointslinearaxiom 2point onto pointlinearaxiom 3line onto linelinearaxiom 4through a point, square to a linelinearaxiom 5point onto a line, through a pointquadraticaxiom 6two points onto two linescubicaxiom 7point onto a line, square to a linelinearthe degree each axiom can solve — one of them is why paper beats the compass

which: [1, 2, 4]

The seven ways to specify a foldThe Huzita–Hatori axioms: every fold that can be specified by bringing existing points and lines into coincidence. The list is complete — six were catalogued in 1991, the seventh in 2001, and no eighth exists. The sixth is the one a compass cannot reach.axiom 1through two pointslinearaxiom 2point onto pointlinearaxiom 4through a point, square to a linelinearthe degree each axiom can solve — one of them is why paper beats the compass

sub: "axiom-solutions", view: "count", trials: 4000

How many folds an axiom actually namesFive of the seven single-fold operations, each given points and lines drawn at random inside a square. The bar is the average number of folds the alignment admits. Three of them always name exactly one; placing a line on a line names two; and placing a point on a line through a second point names two, one or none, depending on a distance.the bar is how many folds the alignment names, averaged over the trialsa1 — the fold through two points1.000.0% none · 0.0% twoa2 — one point onto another1.000.0% none · 0.0% twoa3 — one line onto another2.000.0% none · 100.0% twoa4 — a perpendicular through a point1.000.0% none · 0.0% twoa5 — a point onto a line, through a point1.5223.8% none · 76.2% twoan alignment with no fold is not a failed construction; it is an alignment the paper cannot make

sub: "axiom-solutions", view: "onpaper", trials: 4000

Which folds land on the paperThe same alignments, asked a second question: of the folds each axiom names, how many are creases that actually cross the sheet. Placing one line on another bisects the angle where they meet, and where they meet may be off the paper — so one of its two bisectors is often a line the folder cannot reach.the bar is the share of the named folds whose crease reaches the papera1 — the fold through two points100.0%4,000 of 4,000 named foldsa2 — one point onto another100.0%4,000 of 4,000 named foldsa3 — one line onto another86.7%6,939 of 8,000 named foldsa4 — a perpendicular through a point100.0%4,000 of 4,000 named foldsa5 — a point onto a line, through a point100.0%6,094 of 6,094 named foldsthe axioms that take two lines are the ones that can name a fold off the edge of the sheet

What it checked while it drew

Collected by running this generator with a listener on the assertions, not written here. The count is how many separate times this build put that claim to the test.

Where it is called

Changing this generator changes every figure on this list, which is what makes the list worth publishing rather than keeping in a check script.

A fold needs something to align

Every axiom names things that must already be on the paper — a point to fold onto a point, a line to bring to a line. So what a folder can build is bounded by what they can refer to, and that set is finite at every depth: nine references after one fold, several hundred after two, and every one of them computable in advance.

An axiom may name no fold

The seven operations are stated about points and lines in a plane, and a plane has no edges. On a square, three of them always name exactly one fold and always land it on the paper; placing a line on a line names two, and 13.3% of the folds it specifies are creases the sheet never reaches; and placing a point on a line through a second point names two folds, one, or — 23.8% of the time — none at all.

Cheap where it reaches

Two folds from a bare square put marks at a half, a third, a quarter, a fifth, a sixth, an eighth and a twelfth — and at no seventh, ninth or eleventh at all. A rule that reaches every fraction takes n folds to reach one nth. The systematic route and the short one disagree everywhere, and neither of them knows about the other.

Folding beats the compass, by exactly one degree

Straightedge and compass solve quadratics. A single fold solves cubics. That one-step difference settles two problems Greek geometry could not, and leaves a third exactly as impossible as it was.

One crossing, and then another

Folding a strip into thirds by Fujimoto's method halves the error at every fold and never reaches a third. There is a construction that arrives instead: cross the square's diagonal with a line through the mark you already have, and the crossing lands on the next fraction exactly — one fold per step, all the way down.

One fold at a time, and there are exactly seven of them

A fold is specified by bringing points and lines into coincidence. There are seven ways to do that, the list is provably complete, and one of the seven does something no compass can.

The axiom that names two folds

Bring one line onto another and the operation is satisfied by either of two folds, always exactly perpendicular to one another, creasing the paper in completely different places. Over four thousand random line pairs on a square, both folds land on the sheet two thousand nine hundred and sixty-five times, and the statement of the axiom does not say which one is meant. The fifth axiom is worse: its two answers are at any angle at all, from half a degree apart to square.

The largest triangle in a square

The biggest equilateral triangle a square sheet holds is tilted by exactly fifteen degrees and uses 46.4% of the paper. Both numbers come out of a quadratic — which means a compass reaches this optimum too, and folding's advantage is not needed here at all.

The numbers a fold reaches

Folding solves cubics, which is one fact about one fold. The reason the subject has a theory rather than a bag of tricks is a second fact about all of them: the lengths a folder can mark are closed under addition, subtraction, multiplication, division, square roots and cube roots. Constructions can therefore be built out of constructions — and no tower of them ever arrives at a fifth root.

What each axiom is worth

The list of seven folds is complete, and the proof of that says nothing at all about whether its members are independent or equal. Measured on a bare square, one of the four elementary axioms supplies every fold the others cannot and the other three supply nothing. Two rounds later the ranking has inverted, and the one that carried the first round is the least productive of the four.

Which of the seven survive

The seven axioms are the complete list of ways one fold can be specified by aligning marked things. Every one of them names points and lines on a sheet, three of them quietly assume that a line has two sides, and on a closed sheet a line need not — so the list is complete for a disc and shorter for anything else.

Why the list stops at seven

The seven axioms are not seven useful folds somebody collected. They are every fold there is, and the proof is an exercise in counting degrees of freedom that takes about a minute.

Every generator · The axioms and construction field · The patterns a reader can fold