hn.today

Smallest possible nopert polyhedra: the Septopert

github.com3 points0 comments
Screenshot of Smallest possible nopert polyhedra: the Septopert

The Septopert is a convex seven-vertex polyhedron that cannot pass through a congruent copy of itself in any orientation, a property called being a nopert. Seven vertices is the minimum possible for such a solid. Its vertices are the integer points (−7, 7, 7), (7, −7, 7), (7, 7, −7), (3, −4, −4), (−4, 3, −4), (−4, −4, 3), and (7, 7, 7); scaling or rigidly moving it preserves the property. The solid has threefold rotational and mirror symmetry, ten triangular faces, and two exact right-angle features: three mutually perpendicular edges meeting at the apex, and a projected inner triangle that forms the medial triangle of the base. These special alignments create difficult viewing directions where the usual first-order geometric test gives no clearance.

Lean verifies the nopert claim using certificates for nearly all viewing directions and specialized local certificates around the exceptional mirror, apex-edge, symmetry-axis, and face-related views. The proof relies on exact arithmetic and a kernel-checked theorem; certificate data, including roughly 732,000 table rows, is independently checked by compiled verification code. A separate theorem establishes that this is the least-height integer example in its symmetric family: no member of height below seven is a nopert. That result reduces all possibilities to 55,651 canonical tuples, classified as coplanar, having a redundant vertex, or admitting a certified Rupert passage. Together, the results give both a concrete smallest-vertex example and a formal minimality result for its family.

Read on github.com0 comments on Hacker News

Summary generated by AI from the linked article. hn.today is not affiliated with Hacker News or Y Combinator.

More in Science

The daily digest

Today's best Hacker News stories, summarized and screenshotted, one email a day.