An upper bound of 2√2 for the three-dimensional sofa problem in a snake-shaped corridor

A mix of human-written and AI-generated textHuman understanding: all partsmath.MG — Metric Geometrymath.OC — Optimization and Controlcs.LO — Logic in Computer Science

Contributed by Tejasvi Singh Tomar ↗

Version 1 / Nov 15, 2026 / CC BY 4.0

Abstract

The moving sofa problem in a snake-shaped corridor, posed by O'Rourke and by Georgiev, Gómez-Serrano, Tao and Wagner, asks for the largest volume of a connected body that can be moved through a corridor of unit-square cross-section with two turns that are far apart, one in the xx–yy plane and one in the yy–zz plane. The largest reported body has volume at least 1.85584041.8558404, and Tang obtained upper bounds for this problem, the best of which is 3.40833.4083. We prove by hand that the largest volume is at most 222\sqrt2 whenever the straight section between the turns is longer than 2+22+\sqrt2. The main new tool is a sharp bound: two infinite tubes of unit-square cross-section whose axes make an angle θ\theta meet in volume at most 1/sin⁡θ1/\sin\theta. With it, Hammersley's argument for the planar moving sofa problem carries over to three dimensions. The same argument gives explicit bounds for shorter straight sections; these and the main bound have also been proved in Lean 4 with Mathlib.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716059

References

  1. J. Baek, Optimality of Gerver's sofa , arXiv:2411.19826, 2024.arXiv
  2. B. Georgiev, J. Gómez-Serrano, T. Tao and A. Z. Wagner, Mathematical exploration and discovery at scale , arXiv:2511.02864, 2025.arXiv
  3. J. L. Gerver, On moving a sofa around a corner , Geom. Dedicata 42 (1992), 267--283.
  4. J. M. Hammersley, On the enfeeblement of mathematical skills by ``Modern Mathematics'' and by similar soft intellectual trash in schools and universities , Bull. Inst. Math. Appl. 4 (1968), 66--85.
  5. Y. Kallus and D. Romik, Improved upper bounds in the moving sofa problem , Adv. Math. 340 (2018), 960--982.
  6. The mathlib Community, The Lean mathematical library , in: Proc. 9th ACM SIGPLAN Int. Conf. Certified Programs and Proofs (CPP 2020), 2020, 367--381.
  7. L. Moser, Problem 66-11: Moving furniture through a hallway , SIAM Rev. 8 (1966), 381.
  8. L. de Moura and S. Ullrich, The Lean 4 theorem prover and programming language , in: Automated Deduction -- CADE 28, Lecture Notes in Comput. Sci. 12699 , Springer, 2021, 625--635.
  9. J. O'Rourke, Sofa in a snaky 3D corridor , MathOverflow question 246914, 2016, https://mathoverflow.net/q/246914.link
  10. D. Romik, Differential equations and exact solutions in the moving sofa problem , Exp. Math. 27 (2018), 316--330.
Show all 12 referencesShow fewer references
  1. Y. Tang, An upper bound for the three-dimensional moving sofa problem in a snaky corridor , arXiv: 2610.14050, 2026.arXiv
  2. Y. Tang, New certified lower bounds for the moving sofa problem in a three-dimensional snaky corridor , arXiv:2610.14051, 2026.arXiv

Version history

  1. v1 · 10 pagesSubmitted by Tejasvi Singh TomarPublished on Zenodo: https://doi.org/10.5281/zenodo.23716059CurrentNov 15, 2026