Travel from lines and circles in Alexandria and a marked ruler in Syracuse through quintics in Modena, Christiania, and Paris, pi in Freiburg, formal systems in Göttingen, Vienna, Princeton, and Cambridge, and integer equations in Leningrad. The map separates long-unsolved from impossible under stated rules.
QUESTION FOR THE ROUTE
How did mathematics turn records of failure into proofs about the limits of explicit rules—straightedge and compass, radicals, axioms, and algorithms?
WHAT THIS RIVER DOES NOT CLAIM
The river is not geography. Distance downstream stands for time passing, and the light turns from dawn to dusk as the centuries go by. The objects by each stele are symbols of the kind of event and of how each century band wrote and calculated; they do not reconstruct any real artefact. The land around each stop sketches the natural geography of the scene’s real place, and an iconic building appears only if it already stood in that year. Each scene keeps its real place and evidence basis; open it on the map to read where it happened. Every impossibility on this route has a scope. Other tools can construct, particular quintics can be approximated, stronger theories can prove some formerly undecidable statements, and restricted programs can have decidable termination. Unsolved, hard, undecidable, independent, and contradictory are not one condition.
WHAT YOU SEE ON THIS RIVER
- Diagram in the sky
- A circle and a square of equal area — impossible with ruler and compass
- Emblem at the source
- A circle and a square
- The real place around each stop
- Around each stele the land takes on the natural geography of that scene’s real place — sea or lake, plain, hills or mountains, the colour of the ground and its common trees — and, where one defines the place, its landform: a volcano, snow peaks, granite domes, a mesa, dunes, a fjord, islands, a rock hill, a gorge or loess terraces. The water near the stop takes the colour of the real river or sea, and the haze the place’s climate. A small globe on the stele marks where it is, with the route from the previous place. Where a city has an iconic building that already stood in the scene’s year, its schematic silhouette rises behind the stop and is named on the card. The land follows today’s terrain and climate as a sketch and the silhouettes are not measured reconstructions. Between stops the river itself stays symbolic.
- A figure board at every stop
- Each board draws the mathematics of that scene. When the boat arrives, the construction is drawn in and the key result rises in red. The drawings are schematic reconstructions, not historical manuscripts.
- Century bands along the banks
- to 499 · Sandstone stele · braziers · earthen villages and beacons · rafts · flocks of birds
- 1450–1749 · Marble stele · iron lanterns · three-arch bridge · windmills and clock-tower towns · sailing ships
- 1750–1899 · Cast-iron plaque · gas lamps · iron truss bridge · factory chimneys, railway and steam train · steamboats
- 1900–1969 · Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft
- 1970 onward · Glass marker · LED lights · cable-stayed bridge · glass towers, wind turbines and data centres · ferries · satellites
Where the century band changes, the boat passes under a bridge of the new band. Villages, mills, factories, pylons and towers stand for the technology of each century, not for any real place or architectural style.
01·c. 300 BCE·Alexandria(basis: Composition)
What Can Lines and Circles Build? — The Elements' Tool Grammar
The opening postulates of the Elements permit drawing a straight line between two points and a circle with a given center and radius. This sparse grammar organized countless constructions, but Euclid did not state today's global ban of “unmarked straightedge and compass only” or prove the classical problems impossible. Later readers turned the grammar into a precise set of allowed operations.
- Pause and ask
- How did postulates for lines and circles become a grammar of permitted tools?
- How thinking changed
- Read construction as a finite chain of allowed operations rather than drawing skill, turning it into a question of reachability.
- What we cannot claim
- Euclid did not state the modern global restriction to unmarked straightedge and compass or prove the three classical problems impossible.
- This place
- Alexandria’s Hellenistic editorial and teaching environment helped organize geometric results into a durable system of postulates and proofs. (Mediterranean coast · date palms · flat sand · 31.2°N 29.9°E)
- Figure board
- Only two moves — a line through two points and a circle with given center and radius — chained step by step reach an equilateral triangle.
- On the river
- A desk holding a written record · to 499 (Sandstone stele · braziers · earthen villages and beacons · rafts · flocks of birds)
02·c. 250 BCE·Syracuse(basis: Main activity)
Change the Tool and the Angle Splits into Three — Archimedes' Neusis
A construction attributed to Archimedes trisects a general angle by sliding a ruler carrying a marked length until two conditions meet, a procedure called neusis. The same goal is generally impossible with unmarked straightedge and compass but possible with a marked ruler or special curves. Impossibility belongs to a goal together with its rules.
- Pause and ask
- Why can one mark on a ruler make a formerly impossible trisection possible?
- How thinking changed
- Separate goal from tool and refine “trisection is impossible” into “general trisection is impossible with a specified tool set.”
- What we cannot claim
- Later sources mediate the attribution. A marked-ruler solution does not refute straightedge-and-compass impossibility; it changes the rules.
- This place
- Syracuse anchors Archimedes’ overlapping geometric and mechanical work and the boundary between ideal proof and mechanical construction. (Ionian coast · Etna volcano · olives · 37.1°N 15.3°E · landmark: Temple of Athena (480 BCE))
- Figure board
- A ruler marked with the radius slides between the circle and the extended diameter; where the marks fit, angle θ is cut to θ/3.
- On the river
- A place of ongoing work, marked only by the route’s emblem · to 499 (Sandstone stele · braziers · earthen villages and beacons · rafts · flocks of birds)
03·1637 CE·Leiden(basis: Publication)
Translating Geometric Problems into Degrees of Equations — Descartes
La Géométrie, printed in Leiden, advanced a way to treat segment relations algebraically and curves by equations. It opened a path for translating constructibility into properties of numbers and polynomials. Descartes did not anticipate Wantzel's 1837 theorem, but algebra became an essential shoulder for proving geometric limits.
- Pause and ask
- What becomes decidable after a geometric construction is translated into an equation?
- How thinking changed
- Express curves and lengths algebraically, opening a path from tool motions to number operations and polynomial degree.
- What we cannot claim
- Coordinate geometry and impossibility were not completed by Descartes alone, and Wantzel’s 1837 criterion should not be projected back to 1637.
- This place
- Leiden’s press sent the Geometry appendix of the Discourse on Method into French reading and wider European commentary networks. (Old Rhine · broadleaf trees · flat polders · 52.2°N 4.5°E)
- Figure board
- With a unit length 1, similar triangles give the product ab and a semicircle gives √a — segment work read as arithmetic.
- On the river
- A stack of books · 1450–1749 (Marble stele · iron lanterns · three-arch bridge · windmills and clock-tower towns · sailing ships)
04·1799 CE·Modena(basis: Main activity)
Seeking a Proof That the Formula Does Not Exist — Ruffini
Ruffini published a book claiming that general equations above degree four could not be solved by radicals. His early arguments contained assumptions and gaps that were not accepted, and contemporary response was limited. Yet he redirected Lagrange's study of permutations from searching for a formula toward proving a formula's limits, preparing a structural path toward Abel and group theory.
- Pause and ask
- After 250 years without a formula, how could one prove that no formula exists?
- How thinking changed
- Stop searching for another formula and seek structural conditions that every radical formula would have to satisfy.
- What we cannot claim
- Ruffini’s early proof is not declared complete by modern standards. Its gaps and limited reception coexist with its role in making impossibility a research program.
- This place
- Modena’s university network anchored Ruffini’s long revisions to equation theory while he taught mathematics and medicine. (Po plain · poplars · flat land · 44.6°N 10.9°E · landmark: Ghirlandina Tower (1319))
- Figure board
- From permutations of five roots, the argument seeks conditions every radical formula must meet and aims at a contradiction — with gaps left.
- On the river
- A place of ongoing work, marked only by the route’s emblem · 1750–1899 (Cast-iron plaque · gas lamps · iron truss bridge · factory chimneys, railway and steam train · steamboats)
05·1824 CE·Oslo(basis: Publication)
Proving There Is No Radical Formula for the General Quintic — Abel
At twenty-two, Abel paid to print an extremely compressed memoir in Christiania proving that no universal formula using arithmetic and radicals expresses the roots of the general quintic. It does not say quintics have no roots or cannot be approximated numerically. It is an exact impossibility relative to the permitted language of radicals.
- Pause and ask
- What exactly is forbidden by the phrase “the quintic cannot be solved”?
- How thinking changed
- Separate existence and numerical approximation from a universal expression using arithmetic operations and radicals, and rule out only the latter.
- What we cannot claim
- No radical formula for the general quintic does not prohibit special solvable quintics, numerical roots, or expressions using elliptic and modular functions.
- This place
- Christiania’s university and print setting, together with scarce personal funds, shaped Abel’s exceptionally compressed self-financed memoir. (Oslofjord · spruce and birch · wooded hills · 59.9°N 10.8°E · landmark: Akershus Fortress (1300))
- Figure board
- A quintic’s graph crosses the axis — its roots exist and can be approximated — yet unlike degrees 2–4 it has no general radical formula.
- On the river
- A stack of books · 1750–1899 (Cast-iron plaque · gas lamps · iron truss bridge · factory chimneys, railway and steam train · steamboats)
06·1830 CE·Paris(basis: Presentation)
Why Are Some Equations Solvable and Others Not? — The Galois Criterion
Galois went beyond ruling out one universal quintic formula and opened a way to decide solvability by the structure of relations preserved when roots are permuted. His 1830 Academy submission was not accepted during his life; Liouville published major manuscripts in 1846. Modern group and field terminology should not be projected unchanged backward, but symmetry had turned impossibility into structure.
- Pause and ask
- Without a general formula, how can we tell which individual equations are solvable by radicals?
- How thinking changed
- Look beyond root values to relations preserved under permutations, connecting a solvable symmetry structure with radical solutions.
- What we cannot claim
- Galois did not create all modern group theory from nothing the night before his duel. Writing, revision, preservation, and reception spanned years and people.
- This place
- The Paris Academy, schools, journals, and political upheaval formed the institutional stage for submission, rejection, preservation, and posthumous publication. (Seine banks · broadleaf trees · flat basin · 48.9°N 2.4°E · landmark: Notre-Dame de Paris (1250), Dôme des Invalides (1706))
- Figure board
- The six arrangements of three roots split into two blocks; narrowing 6 → 3 → 1 matches solving first by √ and then by ∛.
- On the river
- A desk holding a written record · 1750–1899 (Cast-iron plaque · gas lamps · iron truss bridge · factory chimneys, railway and steam train · steamboats)
07·1837 CE·Paris(basis: Publication)
Turning Two Millennia of Failed Constructions into a Theorem — Wantzel
Wantzel used the condition that straightedge-and-compass lengths arise through successive quadratic extensions to prove that doubling the cube and trisecting a general angle are impossible under those rules. Some angles can be trisected and other tools handle the general case. The theorem proves inaccessibility by specified operations, not merely a long record of failure.
- Pause and ask
- How can a long record of failure become a proof that a task cannot be done?
- How thinking changed
- Translate straightedge-and-compass construction into successive quadratic extensions and show why a required cube root cannot enter that chain.
- What we cannot claim
- Not every individual angle resists trisection. The result rules out a universal unmarked-straightedge-and-compass construction for an arbitrary angle.
- This place
- Paris engineering education and Liouville’s journal made Wantzel’s short criterion a public meeting point for ancient problems and current algebra. (Seine banks · broadleaf trees · flat basin · 48.9°N 2.4°E · landmark: Notre-Dame de Paris (1250), Dôme des Invalides (1706))
- Figure board
- Straightedge-and-compass lengths climb a tower of square-root steps (degree 1, 2, 4, 8, …); the edge ∛2 of the doubled cube cannot enter it.
- On the river
- A stack of books · 1750–1899 (Cast-iron plaque · gas lamps · iron truss bridge · factory chimneys, railway and steam train · steamboats)
08·1882 CE·Freiburg(basis: Discovery)
The Transcendence of Pi Makes Squaring the Circle Impossible — Lindemann
When Lindemann proved that pi is transcendental—not a root of any polynomial with rational coefficients—it followed that straightedge and compass cannot construct a square exactly equal in area to a given circle. Physical approximation and other tools remain possible. What is ruled out is an exact finite Euclidean construction.
- Pause and ask
- Why does the transcendence of pi end the classical circle-squaring problem?
- How thinking changed
- Connect the algebraicity required of constructible lengths with the transcendence of pi, ending a geometric problem through number classification.
- What we cannot claim
- Approximating pi or building physical shapes remains possible. The result rules out exact equality through finitely many straightedge-and-compass steps.
- This place
- Lindemann’s Freiburg appointment anchored his extension of Hermite’s work on e to the transcendence result for pi. (Dreisam riverside · fir forest · Black Forest · 48.0°N 7.8°E · landmark: Freiburg Minster (1330))
- Figure board
- A square equal to the circle needs side r√π, but π lies outside all roots of rational-coefficient polynomials, beyond constructible lengths.
- On the river
- A beacon burning brighter · 1750–1899 (Cast-iron plaque · gas lamps · iron truss bridge · factory chimneys, railway and steam train · steamboats)
09·1900 CE·Paris(basis: Presentation)
A Request for a Method Receives a Negative Answer — Hilbert's Tenth Problem
Hilbert's Paris problem list asked for a finite procedure deciding whether an integer-coefficient polynomial equation has an integer solution. The modern definition of algorithm did not yet exist, but the request was for a universal procedure that halts and answers every input. Seventy years later, the complete answer was a proof that no such procedure exists.
- Pause and ask
- Could one procedure decide the existence of integer solutions for every polynomial equation?
- How thinking changed
- Lift the solving of individual equations into the existence question for a universal procedure that halts on every integer-polynomial input.
- What we cannot claim
- Hilbert did not use the modern Turing-machine definition, and the negative answer does not make every individual Diophantine equation unsolvable.
- This place
- The Paris congress and published paper turned problems across fields into a long-term international research agenda. (Seine banks · broadleaf trees · flat basin · 48.9°N 2.4°E · landmark: Eiffel Tower (1889), Notre-Dame de Paris (1250))
- Figure board
- Does the curve of an integer-coefficient equation pass through lattice points? The request: one procedure that halts with the answer for all of them.
- On the river
- A desk holding a written record · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
10·1928 CE·Göttingen(basis: Teaching / position)
Asking for a Procedure That Decides Every Logical Sentence — The Decision Problem
Hilbert and Ackermann's textbook sharply asked whether a finite mechanical procedure can decide if a first-order sentence is valid in every interpretation. Göttingen's lectures, textbooks, and proof-theory community shared a precise goal before computation itself was fully defined. Completeness, consistency, and decidability are distinct questions.
- Pause and ask
- Is there a mechanical yes-or-no method for the validity of every first-order sentence?
- How thinking changed
- Turn the hope of proof search into the exact existence question for a decision procedure guaranteed to halt on every input.
- What we cannot claim
- Semantic completeness of first-order logic differs from decidability. Every valid formula having a proof does not supply an always-halting decision algorithm.
- This place
- Hilbert’s Göttingen school used lectures, assistant and student work, and textbooks to make formal logic’s distinct goals shared research problems. (Wooded hills · broadleaf trees · small river · 51.5°N 9.9°E · landmark: Göttingen Observatory (1816))
- Figure board
- Is a sentence like (x)(Ey) F(x, y) true in every interpretation? Wanted: a procedure that halts after finitely many steps on every input.
- On the river
- A lectern and a board · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
11·1930 CE·Königsberg(basis: Presentation)
Incompleteness Is Announced at a Meeting Expecting Completeness — Gödel
In a discussion at the Königsberg conference of September 1930, Gödel briefly announced his first incompleteness result. In the same city the next day, Hilbert delivered the speech ending “We must know, we will know.” The scenes are not a simple duel: increasingly precise formalization made it possible to state and prove a limit of formal systems.
- Pause and ask
- Why did the attempt to formalize mathematics reveal limits of formal systems?
- How thinking changed
- Move to metamathematics, studying a formal theory from outside and asking as a theorem whether it decides every arithmetic sentence.
- What we cannot claim
- Gödel’s announcement and Hilbert’s next-day speech are not reduced to a winner-loser scene. The announcement was brief and its meaning was absorbed in stages.
- This place
- The Königsberg conference connected logicians from Vienna, Göttingen, Berlin, and elsewhere through talks and discussion. (Pregel banks · broadleaf trees · flat land · 54.7°N 20.5°E · landmark: Königsberg Castle (1257))
- Figure board
- Viewed from outside the system, the tree of proofs growing from the axioms reaches neither a sentence A nor its negation ~A.
- On the river
- A desk holding a written record · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
12·1931 CE·Vienna(basis: Main activity)
A System Reads Its Own Sentences and Finds the Boundary of Proof — Incompleteness
Gödel encoded formulas and proofs as natural numbers so arithmetic could speak about its own provability. Under specified conditions, a consistent, effectively axiomatized system strong enough for arithmetic contains statements it neither proves nor disproves. This does not make every mathematical truth forever unknowable or make first-order logic itself incomplete.
- Pause and ask
- What sentences escape when a formal system reads its own proofs as numbers?
- How thinking changed
- Encode syntax and proof as arithmetic relations and construct self-reference, producing a sentence undecidable in a sufficiently strong theory.
- What we cannot claim
- The first theorem concerns consistent, effectively axiomatized systems strong enough for arithmetic, not every rule system. “True but unprovable” also requires the intended interpretation and stated conditions.
- This place
- The University of Vienna, its mathematical colloquium, and debates around the Vienna Circle supplied a community for mastering and testing formal tools. (Danube banks · broadleaf trees · Vienna Woods · 48.2°N 16.4°E · landmark: St. Stephen’s Cathedral (1433))
- Figure board
- Each symbol of a formula becomes a prime power, turning the formula into a number n; n is fed back into a formula so it speaks of itself.
- On the river
- A place of ongoing work, marked only by the route’s emblem · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
13·1936 CE·Princeton(basis: Main activity)
Refuting a Universal Decision Procedure with Lambda Calculus — Church
In Princeton, Church connected effective calculability with lambda definability and recursive functions and proved the first-order decision problem has no universal solution. Once effective procedure became a mathematical object, its impossibility became provable. Church and Turing followed independent formalisms that were soon connected as equivalent in reach.
- Pause and ask
- Can defining mechanical calculability really refute the decision problem?
- How thinking changed
- Formalize effective procedure through lambda-definable and recursive functions, then prove no universal logical decider exists within that scope.
- What we cannot claim
- The Church–Turing thesis is not a theorem restricting every physically imaginable device; it is a powerful identification of effectively calculable procedures.
- This place
- Church’s Princeton seminar, work with students Kleene and Rosser, and the Journal of Symbolic Logic network enabled rapid comparison of new computation formalisms. (Woods · broadleaf trees · gentle lowland · 40.4°N 74.7°W)
- Figure board
- Numbers written as λ-terms and functions by recursion pin down effective calculation; then a universal decider D for first-order logic is ruled out.
- On the river
- A place of ongoing work, marked only by the route’s emblem · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
14·1936 CE·Cambridge(basis: Composition)
Turning the Human Calculator into a Machine and Proving Some Runs Cannot Be Decided — Turing
Turing modeled a person reading squares, writing symbols, and following finitely stated rules as an abstract machine. A diagonal argument showed there is no universal machine deciding whether another machine will continue producing symbols, yielding a negative answer to the decision problem. This is closely related to the modern halting theorem without making every textbook formulation identical to Turing's paper.
- Pause and ask
- Can one program decide whether every other program will stop?
- How thinking changed
- Model a calculator with finite states, symbols, and tape rules, then diagonalize by turning a supposed decider back onto itself.
- What we cannot claim
- Undecidability does not prevent proving termination for particular programs. It rules out one always-correct, always-halting decider for every program and input.
- This place
- Cambridge mathematical logic and the King’s College research setting anchored Turing’s analysis of human paper calculation as an abstract machine. (River Cam · willows · flat fen edge · 52.2°N 0.1°E)
- Figure board
- A tape of squares read by a finite-state head, the diagonal of a table of machines, and a supposed decider D fed back onto itself.
- On the river
- A desk holding a written record · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
15·1970 CE·Saint Petersburg(basis: Main activity)
There Is No Universal Decider for Integer Equations — The DPRM Theorem
Matiyasevich represented exponential growth from Fibonacci numbers with Diophantine equations, resolving the remaining conjecture in Julia Robinson's program. Combined with work by Davis, Putnam, and Robinson, it proved that no algorithm always decides whether an arbitrary integer-coefficient polynomial has an integer solution. Individual equations can still be solved.
- Pause and ask
- What becomes impossible if an integer equation can encode an arbitrary computation?
- How thinking changed
- Translate recursively enumerable sets into existence of Diophantine solutions, linking an integer-equation decider to forbidden computation.
- What we cannot claim
- The result is not credited to Matiyasevich alone, and it does not make every individual integer equation humanly unsolvable; it denies a universal algorithm.
- This place
- Leningrad university and Steklov networks anchored Matiyasevich’s completion of the remaining link in the internationally connected Davis–Putnam–Robinson program. (Neva delta and gulf · birch and pine · flat · 59.9°N 30.3°E · landmark: Peter and Paul Cathedral (1733), Saint Isaac’s Cathedral (1858))
- Figure board
- Fibonacci growth is captured by an integer equation; single equations can still be settled, but no one algorithm decides them all.
- On the river
- A place of ongoing work, marked only by the route’s emblem · 1970 onward (Glass marker · LED lights · cable-stayed bridge · glass towers, wind turbines and data centres · ferries · satellites)