TOPICS
Search

Septopert


Septopert

The septopert is a seven-vertex nopert polyhedron constructed by Murphy (2026). A nopert polyhedron admits no passage with positive clearance of a congruent copy, without turning, through a straight tunnel (Steininger and Yurkevich 2023).

It is the convex hull of the seven points (-7,7,7), (7,-7,7), (7,7,-7), (3,-4,-4), (-4,3,-4), (-4,-4,3), and (7,7,7). It has 15 edges and 10 triangular faces. Its symmetry group has Schönflies symbol C_(3v), with a threefold rotation axis along (1,1,1) and three reflection planes. The three edges meeting at (7,7,7) are mutually perpendicular (Murphy 2026).

The septopert attains the minimum possible number of vertices of a nopert polyhedron. The accompanying formalization gives a kernel-only Lean proof that every bounded convex polyhedron with nonempty interior and at most six vertices has Rupert's property (Murphy 2026). The minimality concerns the number of vertices, rather than volume or surface area.

The proof that the septopert lacks Rupert's property has a different verification requirement. Its kernel-checked theorem is conditional on the validity of certificate data. Those certificates are checked by compiled Lean code, so this step also trusts the Lean compiler and runtime (Murphy 2026). Its Nieuwland number is 1.


See also

Convex Polyhedron, Nieuwland Number, Nopert Polyhedron, Noperthedron, Prince Rupert's Problem, Rupert's Property

Explore with Wolfram|Alpha

References

Murphy, T., VII. "Noperts." GitHub. 2026. https://github.com/tom7/noperts/tree/dd77d2a7c2d8170300d4afdb887ebffad2550952.Steininger, J. and Yurkevich, S. "An Algorithmic Approach to Rupert's Problem." Math. Comput. 92, 1905-1929, 2023. https://doi.org/10.1090/mcom/3831.

Cite this as:

Weisstein, Eric W. "Septopert." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Septopert.html

Subject classifications