Concept

Operation set

The fixed collection of moves a construction is allowed, which decides what can and cannot be reached. Changing it changes the answer completely: trisection is impossible with straightedge and compass and easy with a marked ruler.

Named by 10 essays across one field — each of them below, with the objects they name alongside it.

Two points, and everything one round of compass and straightedge adds. Two starting points with the line and circles they permit, and the four points where those objects cross.

What two points can build

A compass and a straightedge are not a craft. They are two operations on a set of points, applied over and over, and writing them that way turns "can this be drawn?" into a question with an answer.

computation · Constructible numbers
Every rational number that could be a root of x³ − 2. A table of the candidate rational roots allowed by the rational root theorem, with the polynomial's exact value at each.

The cube that will not double

Doubling a cube needs an edge in the ratio of the cube root of two. That number satisfies an equation of degree three, three does not divide any power of two, and the oldest open problem in geometry closes in a line.

computation · Constructible numbers
Which angles with a rational cosine can be cut in three. A dial of angles marked trisectable or not, beside the cubic whose rational roots decided each one.

The angle that will not divide by three

Halving an angle costs one circle. Cutting it in three means solving a cubic, and for sixty degrees that cubic has no rational root — but plenty of angles do trisect, and which ones is a question with a countable answer.

computation · Constructible numbers
A triangle cut into three pieces that make a rectangle. A triangle sliced at half its height and again down the altitude of the small triangle, beside the rectangle the same three pieces make when each top piece is turned a half turn.

Equal area is enough, and equal volume is not

Any two polygons of the same area can be cut into each other with finitely many straight cuts. The same sentence with area replaced by volume and polygon by polyhedron is false, and what blocks it is an angle.

computation · Scissors congruence
The midpoint of a segment, drawn with a compass and no straightedge. A segment with the arcs that step its length three times round one end to reach the point twice as far away, and the further arcs that send that point back to the midpoint, every one of them a circle.

The straightedge buys nothing

Every point a compass and a straightedge can construct together can be constructed by the compass alone. The straightedge draws lines nobody needs; the compass does the work, and the proof that it does is an inversion performed with arcs.

computation · Compass-only
256 consecutive pairs from xₙ₊₁ = 137xₙ + 187 mod 256. Consecutive outputs of a linear congruential generator plotted as points of a square, falling on a small family of evenly spaced parallel lines.

The planes a recurrence cannot leave

One multiplication and one addition, taken modulo a fixed number, produce a sequence that passes for random one value at a time. Taken two or three at a time it does not, and the reason is a whole-number relation that pins every point onto one of a small family of parallel lines.

computation · Pseudorandomness
An angle of 60° cut in three with one mark. A circle with a marked point on it, a straightedge laid through that point so the segment between the extended diameter and the circle equals the radius, and the third-angle it makes.

The mark that changes what is reachable

Two thousand years of failure to trisect an angle with compass and straightedge was failure at a stated set of operations. Scratch two marks on the straightedge and Archimedes trisects any angle in four steps — because the new operation solves a cubic, and the old ones could only ever solve quadratics.

computation · Neusis
A dissection that never comes apart. The three pieces of the triangle-to-rectangle dissection drawn at 4 moments of the swing. Each top piece turns about a pin at the end of the slice it stands on, and the pieces stay joined throughout.

A dissection that never comes apart

The plane theorem lets the pieces be picked up and put down anywhere. Require instead that they stay joined at their corners and swing, and the theorem survives — which was open for a century and is a much stronger statement about the same cuts.

computation · Scissors congruence
The quantity a cut cannot change and a turn can. 4 polygons, each with the spikes of its translation invariant drawn round a dial: the length of the edges facing each direction, less the length of those facing the opposite way. It vanishes everywhere for 3 of them.

Slid, but never turned

Every construction on this ladder turns its pieces. Forbid the turn — allow the pieces to be slid and nothing else — and equal area stops being enough, for a reason that is a single number attached to each direction and that a cut cannot change.

computation · Scissors congruence
What the chain costs on a 6-gon: 39 pieces. A regular 6-gon fanned into 4 triangles, each with the three cuts that turn it into a rectangle, beside the running count of the pieces the whole chain produces — 39 of them.

Finitely many, and nobody says how many

The theorem promises a dissection exists and the proof produces one. Running the proof on a hexagon produces thirty-nine pieces, ingenuity produces five, and there is no method for proving that five cannot be four.

computation · Scissors congruence

Named alongside it

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

Constructible numberAreaDissectionPolygonCongruenceConstructionImpossibilityInvariantStraightedge and compassDegree of an extensionExhaustive searchField extension

All concepts