08-31-2026, 10:36 PM
Mohr–Mascheroni Theorem
The Mohr–Mascheroni theorem is a striking result in classical Euclidean geometry: every construction that can be carried out using a straightedge and compass can, in principle, be performed using only a compass. Straight lines themselves cannot be drawn, but a line can be represented by two constructed points lying on it. The proof works by showing that the essential straightedge-and-compass operations—especially finding intersections of lines and intersections between lines and circles—can ultimately be replaced by compass-only constructions, often using geometric inversion.
However, the section on the validity of the theorem exposes an important logical subtlety. The compass-only construction depends fundamentally on the Archimedean axiom: for suitable positive lengths $a$ and $b$, some integer $n$ exists such that $na>b$. In certain stages of the construction, one may therefore have to repeat an operation until a sufficiently large multiple of a distance has been produced. There is no fixed upper bound on how many repetitions may be necessary. Thus, if a geometric construction is defined as a finite “straight-line program” containing a predetermined number of operations, the Mohr–Mascheroni theorem does not quite fit that traditional definition.
One possible solution, proposed by Erwin Engeler, is to regard geometric constructions as algorithms that may contain loops and conditional instructions. This makes the Mohr–Mascheroni construction legitimate, but creates a deeper problem: once unlimited looping and enumeration are permitted, constructions that intuitively ought to be impossible may become possible merely by searching indefinitely. For example, in the rational plane $\mathbb{Q}^2$, one could enumerate rational points and lines until a desired parallel line appears and thereby obtain constructions normally impossible with a straightedge alone. The issue therefore becomes partly philosophical and computational: what exactly should count as a legitimate geometric construction?
Key takeaways
ARTICLE
The Mohr–Mascheroni theorem is a striking result in classical Euclidean geometry: every construction that can be carried out using a straightedge and compass can, in principle, be performed using only a compass. Straight lines themselves cannot be drawn, but a line can be represented by two constructed points lying on it. The proof works by showing that the essential straightedge-and-compass operations—especially finding intersections of lines and intersections between lines and circles—can ultimately be replaced by compass-only constructions, often using geometric inversion.
However, the section on the validity of the theorem exposes an important logical subtlety. The compass-only construction depends fundamentally on the Archimedean axiom: for suitable positive lengths $a$ and $b$, some integer $n$ exists such that $na>b$. In certain stages of the construction, one may therefore have to repeat an operation until a sufficiently large multiple of a distance has been produced. There is no fixed upper bound on how many repetitions may be necessary. Thus, if a geometric construction is defined as a finite “straight-line program” containing a predetermined number of operations, the Mohr–Mascheroni theorem does not quite fit that traditional definition.
One possible solution, proposed by Erwin Engeler, is to regard geometric constructions as algorithms that may contain loops and conditional instructions. This makes the Mohr–Mascheroni construction legitimate, but creates a deeper problem: once unlimited looping and enumeration are permitted, constructions that intuitively ought to be impossible may become possible merely by searching indefinitely. For example, in the rational plane $\mathbb{Q}^2$, one could enumerate rational points and lines until a desired parallel line appears and thereby obtain constructions normally impossible with a straightedge alone. The issue therefore becomes partly philosophical and computational: what exactly should count as a legitimate geometric construction?
Key takeaways
- The theorem says compass alone is theoretically as powerful as straightedge + compass for constructible points.
- Its proof relies on the Archimedean property and may require an arbitrarily large number of steps.
- Consequently, the theorem raises a distinction between a fixed finite construction and an algorithmic construction involving loops.
- This is an interesting bridge between classical geometry, foundations of mathematics, and computational theory.
ARTICLE
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘