The Shape That Can’t Pass Through Itself

Episode Summary

Executive Summary: The episode explains the long-running geometry puzzle of Rupert’s tunnels: whether one copy of a convex polyhedron can pass through a tunnel bored in another copy of the same shape. After a historical origin story involving Prince Rupert and the cube, the discussion focuses on how computers helped identify candidate counterexamples, culminating in a newly constructed shape, the Noperthedron, that mathematicians proved cannot have a Rupert tunnel using a mix of computational search and delicate geometric bounds.

Main Topics: Rupert’s tunnel problem and geometric intuition (Priority: 5/5): A shape-copy-passing-through-itself problem is introduced through the cube example, showing how orientation changes the apparent cross-section and can make the feat possible. Historical origins with Prince Rupert of the Rhine (Priority: 3/5): The problem is traced to Prince Rupert, who famously bet on the cube case and won; his scientific curiosity in retirement set the stage for the classic puzzle. Convex polyhedra and the search for general rules (Priority: 5/5): The episode broadens from cubes to convex polyhedra, contrasting easy cases like irregular shapes with harder, more symmetric solids such as Platonic and Archimedean solids. Computers as a tool in modern geometry (Priority: 5/5): Computer search across huge families of shapes has become central, especially for testing orientations and discovering holdout cases that resist easy human analysis. The Noperthedron as a counterexample (Priority: 5/5): Two mathematicians constructed a 152-face polyhedron designed to fail Rupert’s tunnel criteria, then proved it truly has no such tunnel. Method: shadow comparison in parameter space (Priority: 4/5): The proof strategy reframes orientations as shadows and rules out regions of rotation space; especially hard near-identical orientations required a refined theorem about boundary points. Open problems and future work (Priority: 4/5): Other suspected noperts, including the snub cube and rhombicosidodecahedron, remain unresolved and may require different methods.

Key Arguments: A counterexample to a conjecture must be proved by showing impossibility in all orientations, not just by failing to find one computationally. For cubes, rotating a corner toward the viewer produces a hexagonal shadow large enough to contain a square, making a Rupert tunnel possible. Irregular shapes are often easy cases, while highly symmetric shapes are harder and historically more interesting. Computer experiments found many shapes with Rupert tunnels, but a few holdouts suggested the conjecture might fail. The Noperthedron was reverse-engineered to satisfy technical conditions that force shadow overlap failure in every orientation. A computer-assisted construction can identify a shape, but a mathematical proof is needed to exclude every possible orientation. The proof excludes not just single orientations but small neighborhoods in rotation space by using stability of shadow overlap. The remaining unresolved Archimedean solids likely need different techniques because they do not satisfy the conditions used for the Noperthedron proof.

Data Points: Cube tunnel size threshold: About 4% larger - The cube example is said to become too large for the square-to-hexagon fit if scaled up by roughly 4%. Noperthedron faces: 152 - The newly constructed counterexample shape has 152 faces. Noperthedron polygon types: 2 regular 15-gons and 150 triangular faces - The Noperthedron is described as having two big 15-sided faces with the rest triangles. Archimedean solids count: 13 - The episode notes there are 13 Archimedean solids. Unresolved Archimedean solids: 2 - Two Archimedean solids, the snub cube and rhombicosidodecahedron, still have unknown Rupert status. Platonic solids count excluding cube: 4 - The four Platonic solids mentioned besides the cube are the tetrahedron, octahedron, dodecahedron, and icosahedron. Research timeline: About 5 years - The two mathematicians involved became interested in the problem roughly five years before the episode. Researcher age: Around 30 - Jakob Steininger and Sergei Yurkiewicz are described as fairly young researchers, both around 30. Computer search scale: Hundreds of millions of shapes - The episode says mathematicians used computers to test enormous numbers of candidate shapes. Rupert tunnel theorem condition: 3 boundary points - For the delicate theorem, the shape needed certain criteria involving whether three boundary points could be found from any viewing angle.

Pivotal Quotes: "one of many examples in geometry where computers are starting to really help mathematicians to gain a lot of insight" — Erica Klarich: Describing how modern computation changed progress on the Rupert tunnel problem "The noperthedron is a shape with 152 faces" — Erica Klarich: Introducing the constructed counterexample shape "whenever you're trying to find a Rupert tunnel, you're basically comparing shadows" — Erica Klarich: Explaining the geometric proof strategy via projections

Implications: The episode shows how computation can guide pure mathematics, but also how proof still requires human theoretical structure. It leaves several shapes unresolved while demonstrating that at least one true counterexample exists.