Marks, Andrew S.; Unger, Spencer T. Borel circle squaring. (English) Zbl 1400.03064 Ann. Math. (2) 186, No. 2, 581-605 (2017). This review is taken from the the authors’ introduction (with some omissions and minor adaptations): the reviewer considers it as most informative of the content and the aim of the paper. He would like to express his appreciation for their remarkable result.In 1925, Tarski posed the problem of whether a disk and a square of the same area in the plane are equidecomposable by isometries. This problem became known as Tarski’s circle problem. In contrast to the Banach-Tarski paradox in \(\mathbb R^3\), a theorem of Tarski implies that any two Lebesgue measurable sets in \(\mathbb R^2\) that are equidecomposable by isometries must have the same Lebesgue measure, even when the pieces used in the equidecomposition are allowed to be nonmeasurable. Thus the requirement that the circle and the square have the same area is necessary.The well-known Wallace-Bolyai-Gerwien theorem states that two polygons in \(\mathbb R^2\) have the same area if and only if they dissection congruent, that is, equidecomposable by polygonal pieces where we may ignore boundaries. Hilbert’s third problem asked whether any two polyedra of the same volume are dissection congruent. Dehn famously gave a negative answer to this problem.M. Laczkovich answered Tarski’s question positively in 1990 [J. Reine Angew. Math. 404, 77–117 (1990; Zbl 0748.51017)], using only translates in his equidecomposition. In [J. London Math. Soc. 46, No. 1, 58–64 (1992; Zbl 0776.11041)], he improved this result to give a very general sufficient condition for when two bounded sets in \(\mathbb R^k\) of the same Lebesgue measure are equidecomposable by translations.Theorem [Laczkovich, 1992, loc. cit.]. If \(k \geq 1\) and \(A,B\subseteq \mathbb R^k\) are bounded sets with the same positive Lebesgue measure whose boudaries have upper Minkowski dimension less than \(k\), then \(A\) and \(B\) are equidecomposable by translations.Laczkovich’s proofs are nonconstructive and use the axiom of choice. It remained an open problem whether such equidecompositions could be done constructively. Wagon made this question precise by asking whether Tarski’s circle squaring problem could be solved using Borel pieces.In this paper, the authors answer Wagon’s question and give a completely constructive solution to Tarski’s circle squaring problem. More generally, they prove a Borel version of Laczkovich’s theorem, thus providing also a “Borel solution” to Hilbert’s third problem: any two bounded sets in \(\mathbb R^k\) with “small boundary” have the same measure if and only if they are equidecomposable by translations using Borel pieces:Theorem. If \(k\geq 1\) and \(A,B\subseteq \mathbb R^k\) are bounded Borel sets with the same positive Lebesgue measure whose boundaries have upper Minkowski dimension less than \(k\), then \(A\) and \(B\) are equidecomposable by translations using Borel pieces.A key idea in their proof is to use flows in infinite graphs as an intermediate step towards constructing equidecompositions. Laczkovich’s discrepancy estimates – the central ingredient in the proof of Laczkovich’s theorem – are used to show the convergence of this construction.Another important tool in the proof comes from the theory of orbit equivalence and Borel equivalence relations. In particular, it is used a result of S. Gao et al. [“Forcing constructions and countable Borel equivalence relations”, Preprint, arXiv:1503.07822] about special types of witnesses to the hyperfiniteness of free Borel actions on \(\mathbb Z^d\): this hyperfiniteness witness is used to turn their real-valued Borel flow between \(A\) and \(B\) into an integer-valued flow. This step in the proof also relies on the integral flow theorem, which is a corollary of the Ford-Fulkerson proof of the max-flow min-cut theorem. Reviewer: Enrico Zoli (Firenze) Cited in 2 ReviewsCited in 13 Documents MSC: 03E15 Descriptive set theory 05C21 Flows in graphs 37A20 Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations 52B45 Dissections and valuations (Hilbert’s third problem, etc.) Keywords:descriptive set theory; descriptive graph combinatorics; flows; circle squaring; hyperfiniteness; amenability Citations:Zbl 0748.51017; Zbl 0776.11041 × Cite Format Result Cite Review PDF Full Text: DOI arXiv References: [1] Aharoni, Ron; Berger, Eli; Georgakopoulos, Agelos; Perlstein, Amitai; Spr\"ussel, Philipp, The max-flow min-cut theorem for countable networks, J. Combin. Theory Ser. B. Journal of Combinatorial Theory. Series B, 101, 1-17, (2011) · Zbl 1221.05186 · doi:10.1016/j.jctb.2010.08.002 [2] Boykin, Charles M.; Jackson, Steve, Borel boundedness and the lattice rounding property. Advances in Logic, Contemp. Math., 425, 113-126, (2007) · Zbl 1129.03026 · doi:10.1090/conm/425/08121 [3] Diestel, Reinhard, Graph {T}heory, Grad. Texts in Math., 173, xviii+437 pp., (2010) · Zbl 1204.05001 [4] Dubins, Lester; Hirsch, Morris W.; Karush, Jack, Scissor congruence, Israel J. Math.. Israel Journal of Mathematics, 1, 239-247, (1963) · Zbl 0171.43002 · doi:10.1007/BF02759727 [5] Gardner, R. J., Convex bodies equidecomposable by locally discrete groups of isometries, Mathematika. Mathematika. A Journal of Pure and Applied Mathematics, 32, 1-9, (1985) · Zbl 0574.52015 · doi:10.1112/S0025579300010780 [6] Gao, Su; Jackson, Steve, Countable abelian group actions and hyperfinite equivalence relations, Invent. Math.. Inventiones Mathematicae, 201, 309-383, (2015) · Zbl 1388.03044 · doi:10.1007/s00222-015-0603-y [7] Gao, Su; Jackson, Steve; Krohne, E.; Seward, B., Forcing constructions and countable {B}orel equivalence relations, (2015) · Zbl 1526.03005 [8] Grabowski, {\L}ukasz; M\'ath\'e, Andr\'as; Pikhurko, Oleg, Measurable circle squaring, Ann. of Math. (2). Annals of Mathematics. Second Series, 185, 671-710, (2017) · Zbl 1376.52023 [9] Jackson, S.; Kechris, A. S.; Louveau, A., Countable {B}orel equivalence relations, J. Math. Log.. Journal of Mathematical Logic, 2, 1-80, (2002) · Zbl 1008.03031 · doi:10.1142/S0219061302000138 [10] Niederreiter, Heiner; Wills, J\`“org M., Diskrepanz und {D}istanz von {M}a\ss en bez\'”uglich konvexer und {J}ordanscher {M}engen, Math. Z.. Mathematische Zeitschrift, 144, 125-134, (1975) · Zbl 0295.28028 · doi:10.1007/BF01190941 [11] Kechris, A. S., Classical Descriptive Set Theory, Graduate Texts in Mathematics, 156, (1995) · Zbl 0819.04002 · doi:10.1007/978-1-4612-4190-4 [12] Kechris, A. S.; Marks, A. S., Descriptive graph, (2016) [13] Kechris, A. S.; Solecki, S.; Todorcevic, S., Borel chromatic numbers, Adv. Math., 141, 1-44, (1999) · Zbl 0918.05052 [14] Laczkovich, M., Closed sets without measurable matching, Proc. Amer. Math. Soc., 103, 894-896, (1988) · Zbl 0668.28002 · doi:10.2307/2046871 [15] Laczkovich, Mikl\'os, Equidecomposability and discrepancy; a solution of {T}arski’s circle-squaring problem, J. Reine Angew. Math.. Journal f\`“ur die Reine und Angewandte Mathematik. [Crelle”s Journal], 404, 77-117, (1990) · Zbl 0748.51017 · doi:10.1515/crll.1990.404.77 [16] Laczkovich, Mikl\'os, Decomposition of sets with small boundary, J. London Math. Soc. (2). Journal of the London Mathematical Society. Second Series, 46, 58-64, (1992) · Zbl 0776.11041 · doi:10.1112/jlms/s2-46.1.58 [17] Schmidt, Wolfgang M., Metrical theorems on fractional parts of sequences, Trans. Amer. Math. Soc.. Transactions of the American Mathematical Society, 110, 493-518, (1964) · Zbl 0199.09402 · doi:10.2307/1993695 [18] Schneider, S.; Seward, B., Locally nilpotent groups and hyperfinite equivalence relations [19] Tarski, A., Probl\'eme 38, Fund. Math., 7, 381 pp., (1925) [20] Tim\'ar, \'Ad\'am, Boundary-connectivity via graph theory, Proc. Amer. Math. Soc.. Proceedings of the American Mathematical Society, 141, 475-480, (2013) · Zbl 1259.05049 · doi:10.1090/S0002-9939-2012-11333-4 [21] Wagon, S., The Banach-Tarski Paradox, Encyclopedia of Mathematics and its Applications, 24, (1985) · Zbl 0569.43001 · doi:10.1017/CBO9780511609596 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.