Tarski's circle-squaring problem
{{Short description|Problem of cutting and reassembling a disk into a square}}
{{Use mdy dates|cs1-dates=ly|date=December 2024}}
{{Use list-defined references|date=December 2024}}
{{CS1 config|mode=cs2}}
Tarski's circle-squaring problem is the challenge, posed by Alfred Tarski in 1925,{{r|tarski}} to take a disc in the plane, cut it into finitely many pieces, and reassemble the pieces so as to get a square of equal area. It is possible, using pieces that are Borel sets, but not with pieces cut by Jordan curves.
Solutions
Tarski's circle-squaring problem was proven to be solvable by Miklós Laczkovich in 1990. The decomposition makes heavy use of the axiom of choice and is therefore non-constructive. Laczkovich estimated the number of pieces in his decomposition at roughly 1050. The pieces used in his decomposition are non-measurable subsets of the plane.{{r|laczkovich|laczkovich2}}
Laczkovich actually proved the reassembly can be done using translations only; rotations are not required. Along the way, he also proved that any simple polygon in the plane can be decomposed into finitely many pieces and reassembled using translations only to form a square of equal area.{{r|laczkovich|laczkovich2}}
It follows from a result of {{harvtxt|Wilson|2005}} that it is possible to choose the pieces in such a way that they can be moved continuously while remaining disjoint to yield the square. Moreover, this stronger statement can be proved as well to be accomplished by means of translations only.{{r|wilson}}
A constructive solution was given by Łukasz Grabowski, András Máthé and Oleg Pikhurko in 2016 which worked everywhere except for a set of measure zero.{{r|grabowski}} More recently, Andrew Marks and Spencer Unger gave a completely constructive solution using about Borel pieces.{{r|marks}}
Limitations
Lester Dubins, Morris W. Hirsch & Jack Karush proved it is impossible to dissect a circle and make a square using pieces that could be cut with an idealized pair of scissors (that is, having Jordan curve boundary).{{r|dubins}}
Related problems
The Bolyai–Gerwien theorem is a related but much simpler result: it states that one can accomplish such a decomposition of a simple polygon with finitely many polygonal pieces if both translations and rotations are allowed for the reassembly.{{r|laczkovich|laczkovich2}}
These results should be compared with the much more paradoxical decompositions in three dimensions provided by the Banach–Tarski paradox; those decompositions can even change the volume of a set. However, in the plane, a decomposition into finitely many pieces must preserve the sum of the Banach measures of the pieces, and therefore cannot change the total area of a set.{{r|wagon}}
See also
- Squaring the circle, a different problem: the task (which has been proven to be impossible) of constructing, for a given circle, a square of equal area with straightedge and compass alone.
References
{{Reflist|refs=
{{citation |last1=Dubins |first1=Lester |last2=Hirsch |first2=Morris W. |last3=Karush |first3=Jack |date=December 1963 |title=Scissor congruence |journal=Israel Journal of Mathematics |language=en |volume=1 |issue=4 |pages=239–247 |doi=10.1007/BF02759727 | doi-access= |issn=1565-8511}}
| last1=Grabowski | first1=Łukasz
| last2=Máthé | first2=András
| last3=Pikhurko | first3=Oleg
| date=27 April 2022
| title=Measurable equidecompositions for group actions with an expansion property
| arxiv=1601.02958
| journal=Journal of the European Mathematical Society
| volume=24
| issue=12
| pages=4277–4326
| doi=10.4171/JEMS/1189 | doi-access=free}}
- {{citation
| last1 = Hertel | first1 = Eike
| last2 = Richter | first2 = Christian
| issue = 1
| journal = Beiträge zur Algebra und Geometrie
| mr = 1990983
| pages = 47–55
| title = Squaring the circle by dissection
| url = http://www.emis.de/journals/BAG/vol.44/no.1/b44h1her.pdf
| volume = 44
| year = 2003}}.
| last = Laczkovich | first = Miklos | authorlink = Miklós Laczkovich
| journal = Journal für die Reine und Angewandte Mathematik
| doi = 10.1515/crll.1990.404.77
| mr = 1037431
| pages = 77–117
| title = Equidecomposability and discrepancy: a solution to Tarski's circle squaring problem
| volume = 1990
| year = 1990| issue = 404 | s2cid = 117762563 }}
| last = Laczkovich | first = Miklos | authorlink = Miklós Laczkovich
| contribution = Paradoxical decompositions: a survey of recent results
| location = Basel
| mr = 1341843
| pages = 159–184
| publisher = Birkhäuser
| series = Progress in Mathematics
| title = Proc. First European Congress of Mathematics, Vol. II (Paris, 1992)
| volume = 120
| year = 1994}}
| last1 = Marks | first1 = Andrew
| last2 = Unger | first2 = Spencer
| arxiv = 1612.05833
| doi = 10.4007/annals.2017.186.2.4
| issue = 2
| journal = Annals of Mathematics
| pages = 581–605
| title = Borel circle squaring
| url = https://annals.math.princeton.edu/2017/186-2/p04
| volume = 186
| year = 2017| s2cid = 738154
}}
| last = Tarski | first = Alfred | author-link = Alfred Tarski
| journal = Fundamenta Mathematicae
| page = 381
| title = Probléme 38
| volume = 7
| year = 1925}}
| first = Trevor M. | last = Wilson
| title = A continuous movement version of the Banach–Tarski paradox: A solution to De Groot's problem
| journal = Journal of Symbolic Logic
| mr = 2155273
| volume = 70
| issue = 3
| year = 2005
| pages = 946–952
| doi = 10.2178/jsl/1122038921| s2cid = 15825008
| url = https://authors.library.caltech.edu/11927/1/WILjsl05.pdf
}}
}}
Category:Euclidean plane geometry