The cheese cut (one plane through a cube of cubes)
- Kind
- Computer-assisted theorem for every size from 3 upward
- Status
- Proved for every : Lean-verified for – and ; checked by certificates for –; unrefereed
- Prior work
- The formula is Bárány and Frankl's own construction; the theorem that it cannot be beaten was not found in the searches logged
On this page
The statement
Stack unit cubes into an cube and cut it once with a plane. A small cube counts as met when the plane passes through its inside: its 8 corners lie strictly on both sides of the plane. Let be the most small cubes one plane can meet, and let
Theorem. for every . (At , gives 6 but .)
Verification split. The theorem is proved for every : it is Lean-verified for – (including at 230) and in Challenge.lean, and checked by certificates for – by two independent exact-integer programs in the verification certificates (ZIP), for which Lean verifies the sufficiency criterion.
What is Bárány and Frankl's, and what is claimed. In the American Mathematical Monthly (2021) Bárány and Frankl proved and built a plane, perpendicular to the direction , that meets exactly cubes. So the formula is their construction, not a fit. The claim is that their construction cannot be beaten, for any . It follows that their remark, made without proof, that the construction "can be further improved by 2" for large is false for every .
The printed question it answers. Of the box they wrote: "at least 230 and at most 246 pieces ... The exact number is unknown." It is 230, by exhaustive computation, and the theorem gives the exact answer for every box from up.
Check it yourself
- by hand. Number the small cubes with in and let . Along cube , runs from to , so the plane passes through its inside exactly when is 2, 3 or 4. The 27 cubes split by as 1, 3, 6, 7, 6, 3, 1, so the cut meets cubes, and .
- : the tilt. The plain diagonal cut meets cubes. Bárány and Frankl's tilted cut keeps all 79 and adds , and : 82 .
- : the lines of cubes. Every small cube lies on one line of cubes in the direction , and a cut meets at most one cube of each line. There are lines at . The cut misses exactly 2 of them, the single cubes and , whose values start at , above 18.5. It meets cubes.
- The exact values, for to 24: 19, 35, 57, 82, 113, 147, 187, 230, 279, 331, 389, 450, 517, 587, 663, 742, 827, 915, 1009, 1106, 1209, 1315.
Worked examples
How the proof goes. Since a cut meets at most one cube of each line of cubes, the cubes it meets are minus the lines it misses, and the theorem says every cut misses at least lines. For a cut near the diagonal the missed lines are the whole-number points of six right triangles, two for each pair of axes, and a pairing argument bounds each pair of triangles from below. Earlier proved steps (on this page and the upper bound's) confine a better cut to directions near the diagonal. Then the proof splits into three ranges:
- to 15: exhaustive computer search over every really different cut.
- to 700: one computer certificate per , 685 in all. The directions still in play form a small triangle; the pairing bound changes only across finitely many lines in it, so it is enough to check every corner where two lines cross. At there are 174 lines and 4,315 corners, and . At the corner for the direction the three pairs give , exactly enough. Every corner reaches 134, and the certificate passes.
- : a hand proof, which estimates the same three pair bounds by formulas instead of a computer.
Status and who checked it
- Proved, computer-assisted, for every . An agent sent to prove or break the conjecture wrote the proof. A second agent, whose job was to refute it, re-derived every step, re-derived every constant of the hand proof for and tested its steps at 18 sizes from 700 to 1,000,001, and re-ran all 685 certificates with a program of its own (685 PASS from each program). Its bottom line: "15 claims: 13 CONFIRMED, 0 REFUTED, 0 GAP, 0 MISLABELLED, 2 UNCHECKED", with the theorem confirmed; the two unchecked claims are a sketch and an open conjecture, labelled as such.
- Current proof coverage. Lean-verified for – and (see Challenge.lean); checked by certificates for – by two separately written exact-integer programs whose sources and per-size outputs ship in the verification archive (ZIP).
- Earlier steps it uses (hand proofs by an agent, re-derived line by line by a second agent): for every , odd included (the paper writes out even and leaves odd "to the reader"); a cut through every cube of three neighbouring diagonal layers meets at most ; no cut whose direction is within of in each entry beats ; and the upper bound , on its own page.
- Checks outside the proof: exhaustive search gives for to 24 by two or three programs, and and , both ; certificates for 16 sizes past 700, up to , all pass; searches for a better cut (every direction in a cone around for to 27, the tilts Bárány and Frankl describe up to , and a random walk among directions up to ) found none.
- The "+2" remark is false for every , by the theorem. It was read in the manuscript deposited at UCL, not in the printed Monthly pages, which no agent could open.
- Open: which cuts reach (whether every best cut passes through three full diagonal layers); the four-dimensional version; a proof covering the intervening finite range entirely in Lean.
Prior work
Searches run. The agents searched OEIS by terms (no entry holds 19, 35, 57, 82, … or the other windows tried) and by words, arXiv, zbMATH, the works citing the Monthly paper and its companion paper, Zenodo, DataCite, HAL, OSF, the formal-conjectures collection and the Open Problem Garden. On 2026-11-19 a keyed CORE search made 7 requests and got 17 records: 3 relatives, none with the same claim. On 2026-11-20 the agents that proved and checked the bounds and the theorem searched again with their own logs, including GitHub and the web. No source found gives an exact beyond or tests the "+2" remark: the theorem was not found in the searches logged.
Known parts and relatives, credited to their authors.
- Bárány and Frankl (2021): the question, both bounds, , the construction that gives , and the "+2" remark.
- Math Stack Exchange question 3762021 (July 2020): one answer computes the best cut among one family of central cuts for to 9 (19, 35, 57, 81, 113, 145, 187), proves only , and has "no idea how to solve it in general". Its values equal at and fall short at 6 and 8.
- The 1995 AHSME, problem 30: the case (19 of 27).
- Bárány and Frankl's companion paper "Cells in the box and a hyperplane" (every dimension, asymptotics only); the Nayar–Tkocz survey; Kalarickal, Rotunno, Singh and Tkocz (2024), which still quotes the two printed bounds; and digital geometry, where the cubes a cut meets form a standard arithmetic plane (Reveillès, Andres).
Still owed: Google Scholar; the printed Monthly pages and MathSciNet; Croft, Falconer and Guy, Unsolved Problems in Geometry, and Brass, Moser and Pach, Research Problems in Discrete Geometry.
Further reading
- Bárány and Frankl, "How (not) to cut your cheese", Amer. Math. Monthly 128 (2021) 543–552.
- Bárány and Frankl, "Cells in the box and a hyperplane", arXiv:2004.12306
- Math Stack Exchange question 3762021
- Nayar and Tkocz, arXiv:2210.00885
- Kalarickal, Rotunno, Singh and Tkocz, arXiv:2312.13922