math.MG — Metric Geometry
An upper bound of 2√2 for the three-dimensional sofa problem in a snake-shaped corridor
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 – plane and one in the – plane. The largest reported body has volume at least , and Tang obtained upper bounds for this problem, the best of which is . We prove by hand that the largest volume is at most whenever the straight section between the turns is longer than . The main new tool is a sharp bound: two infinite tubes of unit-square cross-section whose axes make an angle meet in volume at most . 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.