Lean proof verifies 7-vertex 'Septopert' polyhedron as smallest possible nopert
Researcher Tom 7 has formally verified with the Lean proof assistant that a convex polyhedron with just 7 vertices, dubbed the Septopert, fails the Rupert property, making it a 'nopert.' The shape uses integer coordinates based on 7, 3 and 4, and the proof confirms 7 vertices is the minimum possible for any nopert in this family. The full Lean code and an STL model of the solid have been published for others to inspect or reproduce.