mondrian_seven_rects_defect_example
For (p, q) = (13, 3) (n = 315) the seven rectangles have defect 280: the largest area is 238×60 = 14280 and the smallest 70×200 = 14000.
Statement
theorem mondrian_seven_rects_defect_example : mondrian_defect (mondrian_seven_rects 13 3) = 280- Formalizes
- arXiv:2610.19193 (A Bounded-Defect Construction for the Mondrian Art Problem), Example 1.
- Verified
- 15 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- mondrian_defectThe defect def(P) = max_{R∈P} |R| − min_{R∈P} |R| of a family of rectangles.
- mondrian_seven_rectsThe seven rectangles R₁, …, R₇ of the generic dissection of the n×n square, n = 105q, with a = 7(7q−p), b = 42q, c = 7(7q+p), d = 5(8q−p),…
The proof, explained
The theorem asserts that the seven-rectangle Mondrian partition with parameters p = 13 and q = 3 has defect 280. Because all parameters and definitions are concrete, the result is verified by direct computation: the areas of the seven rectangles range from a minimum of 14000 to a maximum of 14280, giving a defect of 14280 - 14000 = 280.
The Mondrian defect of the seven-rectangle partition with parameters p = 13 and q = 3 is 280. automation
The theorem equates concrete arithmetic expressions with no free variables. The proof uses the `first` combinator to try several automated tactics; `decide` successfully closes the goal by executing the computational definitions: it instantiates the seven rectangles for (p, q) = (13, 3), computes each rectangle's width, height, and area (yielding areas 14245, 14280, 14280, 14245, 14175, 14000, and 14000), determines the maximum (14280) and minimum (14000), and subtracts them to obtain 280.
theorem mondrian_seven_rects_defect_example : mondrian_defect (mondrian_seven_rects 13 3) = 280 := by first | (simp_all; done) | omega | decide | linarith | positivity | (aesop; done)
- The identity is verified entirely by computational evaluation via `decide`.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem mondrian_seven_rects_defect_example : mondrian_defect (mondrian_seven_rects 13 3) = 280 := by first | (simp_all; done) | omega | decide | linarith | positivity | (aesop; done)