A lower ceiling for the cheese cut
- Kind
- Theorem (an upper bound), proved by hand for every
- Status
- Proved and Lean-verified for every ; unrefereed
- Prior work
- Improves Bárány and Frankl's printed bound; a bound below theirs was not found in the searches logged
On this page
The linked manuscript proves the exact maximum and includes this earlier upper bound as a step in the argument.
The statement
Let be the most unit cubes of an stack that one plane can pass through (through the inside, not just a face, edge or corner), as on the cheese cut page.
Theorem. For every ,
What was known. Bárány and Frankl (2021) proved , with from their construction (the lower bound for every is on the other page). Their bounds leave about cubes of room. The bound here leaves for even and for odd .
Check it yourself
- At : . The printed ceiling there is 246 and the true answer is 230, so the room above shrinks from 16 to 5.
- At : the ceiling is 1327, against the printed 1345; the exact answer is 1315.
- Small sizes: the bound gives 7, 19 and 37 at ; the exact values are 7, 19 and 35.
- The last line of the proof: . Multiply out both sides.
| exact | this bound | printed bound, rounded down | |
|---|---|---|---|
| 6 | 82 | 85 | 94 |
| 10 | 230 | 235 | 246 |
| 16 | 587 | 595 | 609 |
| 20 | 915 | 925 | 941 |
| 24 | 1315 | 1327 | 1345 |
Worked examples
How the proof goes, in outline. First move the cut so that it runs through the centre of the stack, which loses no cube. For a central cut an exact identity holds: the cubes it meets number minus the whole-number points of six triangles, each point standing for a line of cubes the cut misses. The proof then bounds the missed lines from below by a sum of three convex terms, one per coordinate, whose smallest total is . Subtracting gives the bound. The written proof, with every case, is the proving agent's; this outline skips the bookkeeping.
What it led to. Together with , the theorem pins between and , and for large it confines any better cut to directions close to the diagonal . A later agent built on these steps to prove that no better cut exists: for every , a computer-assisted proof on the cheese cut page.
Status and who checked it
- Proved by hand, for every , by an agent that was sent to prove or break the cheese conjecture.
- Re-derived step by step by a second agent, whose job was to refute the proving agent's work. It confirmed the theorem, tested its core inequality on 511 directions and the six-triangle identity on 75,684 central planes, and noted one missing line in the write-up (a small shift of the cut so that it avoids a lattice value), which loses no cube and does not change the result.
- Lean-verified for every . The unconditional upper bound
CheeseCutM.theoremU_bound_all_ge_2is verified in Lean 4 over using only the standard axioms (see Challenge.lean); an earlier formalization of this bound and companion steps also passed Lean on 2026-11-21 (43 named results). - Unrefereed: no human referee has read it.
Prior work
Searches run. Two agents searched with their own logs on 2026-11-20: OEIS by terms (the upper-bound values among them), arXiv, zbMATH, both lists of works citing Bárány and Frankl's two papers, Stack Exchange, the web, GitHub and the formal-conjectures collection. Neither found an upper bound below : a better ceiling was not found in the searches logged. Kalarickal, Rotunno, Singh and Tkocz (2024) still quote Bárány and Frankl's two bounds as the state of knowledge, the latest such statement found.
Known parts, credited. The question, the printed upper bound and the construction behind are Bárány and Frankl's.
Still owed: Google Scholar; the printed Monthly pages and MathSciNet; books and talks.
Further reading
- Bárány and Frankl, "How (not) to cut your cheese", Amer. Math. Monthly 128 (2021) 543–552.
- Kalarickal, Rotunno, Singh and Tkocz, arXiv:2312.13922
- The cheese cut: the theorem for every (computer-assisted) and the exact values to .