mondrian_seven_rects_partition_defect
Let p, q be positive integers of the same parity with q < p < 7q, n = 105q and E = p² − 19q². The seven rectangles R₁, …, R₇ of (2)–(3) have positive integer sides, partition the n×n square and are pairwise noncongruent, and the defect of this partition is 140|E|.
Statement
theorem mondrian_seven_rects_partition_defect (p q : ℕ) (hpar : p % 2 = q % 2) (hqp : q < p)
(hp : p < 7 * q) :
mondrian_is_partition (105 * q) (mondrian_seven_rects p q) ∧
(mondrian_defect (mondrian_seven_rects p q) : ℤ) = 140 * |(p : ℤ) ^ 2 - 19 * (q : ℤ) ^ 2|- Formalizes
- arXiv:2610.19193 (A Bounded-Defect Construction for the Mondrian Art Problem), Proposition 1 (with the partition property stated before it).
- Verified
- 15 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- mondrian_seven_rects_is_partitionFor positive integers p, q of the same parity with q < p < 7q, the seven rectangles R₁, …, R₇ have positive integer sides, partition the…
- mondrian_seven_rects_defectWith E = p² − 19q², the defect of the seven-rectangle dissection is 140|E|.
- mondrian_is_partitionAn admissible Mondrian partition of the n×n square: at least two axis-parallel rectangles with positive integer side lengths, with…
- 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 both that the seven rectangles form a valid Mondrian partition of the $(105q) \times (105q)$ square and that the defect of this partition is $140 |p^2 - 19q^2|$. The proof directly combines the two previously proven results for these two facts into a single conjunction.
The seven rectangles partition the $(105q) \times (105q)$ square into pairwise noncongruent rectangles, and the defect of the partition is $140 |p^2 - 19q^2|$.
The goal is a conjunction of two assertions. The first conjunct, that the seven rectangles form a valid partition of the $(105q) \times (105q)$ square into pairwise noncongruent rectangles, is established directly by mondrian_seven_rects_is_partition. The second conjunct, that the defect between the maximum and minimum rectangle areas is $140 |p^2 - 19q^2|$, is established directly by mondrian_seven_rects_defect. Constructing the pair completes the proof.
uses
mondrian_seven_rects_is_partition,mondrian_seven_rects_defect⟨mondrian_seven_rects_is_partition p q hpar hqp hp, mondrian_seven_rects_defect p q hpar hqp hp⟩
mondrian_seven_rects_is_partition- For integers $p, q$ of the same parity with $q < p < 7q$, the seven specified rectangles form a valid partition of the $(105q) \times (105q)$ square into pairwise disjoint, noncongruent rectangles with positive integer dimensions.
mondrian_seven_rects_defect- For integers $p, q$ of the same parity with $q < p < 7q$, the defect of the partition (the difference between its largest and smallest rectangle areas) equals $140 |p^2 - 19q^2|$.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
theorem mondrian_seven_rects_partition_defect (p q : ℕ) (hpar : p % 2 = q % 2) (hqp : q < p) (hp : p < 7 * q) : mondrian_is_partition (105 * q) (mondrian_seven_rects p q) ∧ (mondrian_defect (mondrian_seven_rects p q) : ℤ) = 140 * |(p : ℤ) ^ 2 - 19 * (q : ℤ) ^ 2| := ⟨mondrian_seven_rects_is_partition p q hpar hqp hp, mondrian_seven_rects_defect p q hpar hqp hp⟩