The ten minimum universal sets of MacMahon cubes

Jason Davies

A universal inventory of MacMahon cubes needs at least twelve cubes. There are exactly ten labelled inventories of size twelve, the two-triangle sets in Conway’s tableau. The classification allows repeated varieties and proves that none occurs in a minimum inventory.

What was already known

Haraguchi proved the minimum size of twelve and gave a construction. Johnson and Roldán conjectured the count and the two-triangle characterization for inventories of distinct varieties.

AI involvement AI-led

Davies directed the project. The source credits GPT-6-Astra with the classification proof, exhaustive solvers, Lean and manuscript, and Claude Opus 5.5 with paper review.

Importance Notable

The proof classifies all minimum inventories and shows that repeated cube varieties do not create further minima.

Technical verification Formal (Lean)

The pinned project reports Lean proof of the minimum-size classification and multiset extension, and kernel checks of 300 inventory-target witnesses in the signed-axis geometry model.

Formal checking

The pinned project reports Lean proof of the minimum-size classification and multiset extension, and kernel checks of 300 inventory-target witnesses in the signed-axis geometry model.

Checker
Jason Davies, reporting Lean 4 verification
Scope
The pinned project reports Lean proof of the minimum-size classification and multiset extension, and kernel checks of 300 inventory-target witnesses in the signed-axis geometry model.
Basis
Reported by the linked checker

Human understanding Few

The source’s proof and review are credited to AI. A human explanation of the new classification argument is undocumented.

Correction and publication history