Erdős Problem #1124
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (not automatically the live result).
Subject areas: geometry.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Can a square be cut into finitely many pieces and reassembled into a circle of the same area?
Erdős Problem #1124 is Tarski's circle-squaring problem, admired by Erdős. The surprising answer is yes, even when the allowed motions are translations only.
The word “pieces” is essential. The existence theorem does not say the square can be cut along a finite collection of straight lines or with ordinary physical scissors. The pieces in the original result are highly nonconstructive.
A small example
A unit square has area one. A disk with the same area must have radius
because its area is \(\pi r^2=1\).
This exact calculation establishes the necessary area normalization. It does not produce even one of the pieces required to translate the square into the disk.
Translations preserve the geometry of every piece. The hard part is choosing a finite partition that matches the two shapes globally despite their different boundaries.
What is known
Miklós Laczkovich (1990) established Tarski's conjecture in the affirmative, proving a finite translation equidecomposition between a disk and a square of equal area. It is a striking application of discrepancy estimates and combinatorics to geometric dissection.
Later work, including Marks and Unger, examined versions with additional regularity of the pieces, notably Borel equidecompositions. Such refinements should be treated as distinct theorems with their own assumptions, not as automatic consequences of the 1990 construction.
The original pieces need not be individually Lebesgue measurable, so a naive measure argument about each piece is not a proof of the existence theorem.
GCL's current state
Authenticated source audit #2395 distinguishes exact finite equidecomposition from approximate discretized matching and verifies the area normalization.
GCL has not independently reproduced Laczkovich's 1990 proof or any later regularity refinement.
What remains
Read the original theorem and proof carefully, including the number and regularity of pieces, whether translations alone suffice, and subsequent Borel-strengthened results. An illustrative grid approximation would remain only an approximation.
Sources and claim boundaries
Erdős #1124; Erdős (1981), p. 30; Laczkovich (1990); Marks–Unger later work; authenticated GCL return. The finite-translation theorem is externally proved, not newly verified here. Unaccepted draft.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2395 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.