mondrian_perfect_area_product
In a perfect n-square partition, the number of rectangles times the area of any member is n squared.
Statement
theorem mondrian_perfect_area_product (n : ℕ) (P : List (ℕ × ℕ × ℕ × ℕ))
(h : mondrian_is_partition n P) (hz : mondrian_defect P = 0)
(r : ℕ × ℕ × ℕ × ℕ) (hr : r ∈ P) :
P.length * mondrian_rect_area r = n ^ 2- Source
- arXiv:2610.19193, Section 1, and arXiv:2311.02385, Section 3 (available integer dimension pairs); helper for OP-280 and mondrian_no_perfect_partition.
- Verified
- 26 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- mondrian_partition_area_sumThe areas of an admissible partition of the n-square sum to n squared.
- mondrian_defect_zero_equalAny two rectangles in a list of defect zero have equal area.
- 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_rect_areaThe area |R| = width × height of a rectangle.
- Used by 8
- mondrian_no_perfect_three_prime_area_one_factorFor three distinct primes p,q,r with p>r+1, no perfect admissible integer square partition has common tile area q^s*r*p^a, for arbitrary…
- mondrian_large_prime_descentIf c is positive and p is a prime greater than c, any perfect partition of the c times p to the e square yields a perfect partition of the…
- mondrian_perfect_min_width_layer_countFor a perfect admissible n-square partition and prime p dividing n, suppose b is the minimum p-adic exponent of tile widths. Then b is at…
- mondrian_no_perfect_prime_power_areaNo perfect admissible partition of any integer square can have common tile area equal to a prime power p^t, including exponent zero.
- mondrian_no_perfect_two_prime_areaFor any distinct primes p and q and natural exponents s and t, no perfect admissible partition of any integer square can have common tile…
- mondrian_no_perfect_of_shape_boundThere is no perfect n-square partition if, for every k at least two and positive A with k times A equal to n squared, fewer than k…
- mondrian_no_perfect_prime_mul_prime_powFor every pair of distinct primes p and q and every natural exponent e, the square of side q times p^e has no perfect admissible integer…
- mondrian_no_perfect_two_prime_powersFor any two distinct primes p and q and arbitrary natural exponents e and f, the square of side q^f*p^e has no perfect admissible integer…
The proof, explained
Since P is a partition of an n-square into rectangles, the sum of the rectangle areas is n squared. Because the defect of P is zero, every rectangle in P must have the exact same area as r. Consequently, the sum of the areas is simply the number of rectangles times the area of r, which yields the desired equality.
It suffices to show that the product of the number of rectangles and the area of r equals the sum of the areas of all rectangles in P.
Since P partitions an n-square, mondrian_partition_area_sum establishes that the sum of the areas of the rectangles is n squared. Rewriting replaces n squared with this sum of areas.
uses
mondrian_partition_area_sumrw [← mondrian_partition_area_sum n P h]The list of rectangle areas in P is identical to replicating the area of r as many times as there are rectangles in P.
By List.eq_replicate_iff.mpr, it suffices to show that the list of areas has length equal to |P| (which holds by definition of map) and that every element equals the area of r. By List.mem_map.mp, each element in the mapped list is the area of some rectangle s in P. Since the partition has defect zero, mondrian_defect_zero_equal shows that s and r have equal area.
uses
List.eq_replicate_iff.mpr,List.mem_map.mp,mondrian_defect_zero_equalhave heq : P.map mondrian_rect_area = List.replicate P.length (mondrian_rect_area r) := by apply List.eq_replicate_iff.mpr refine ⟨by simp, ?_⟩ intro a ha obtain ⟨s, hs, rfl⟩ := List.mem_map.mp ha exact mondrian_defect_zero_equal P hz s r hs hr
The sum of the replicated areas evaluates to |P| times the area of r, establishing the equality.
Substituting the replicate list for the list of areas reduces the right-hand side to the sum of |P| copies of the area of r. Simplifying this sum yields |P| times the area of r, which matches the left-hand side.
rw [heq] simp
mondrian_partition_area_sum- In a partition of an n-square into rectangles, the sum of the areas of the rectangles equals n squared.
List.eq_replicate_iff.mpr- A list is equal to k copies of an element x if its length is k and every element in it is equal to x.
List.mem_map.mp- If an element belongs to the image of a list under a function, then it is the image of some element in the list.
mondrian_defect_zero_equal- If the defect of a rectangle partition is zero, then any two rectangles in the partition have equal area.
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_perfect_area_product (n : ℕ) (P : List (ℕ × ℕ × ℕ × ℕ)) (h : mondrian_is_partition n P) (hz : mondrian_defect P = 0) (r : ℕ × ℕ × ℕ × ℕ) (hr : r ∈ P) : P.length * mondrian_rect_area r = n ^ 2 := by rw [← mondrian_partition_area_sum n P h] have heq : P.map mondrian_rect_area = List.replicate P.length (mondrian_rect_area r) := by apply List.eq_replicate_iff.mpr refine ⟨by simp, ?_⟩ intro a ha obtain ⟨s, hs, rfl⟩ := List.mem_map.mp ha exact mondrian_defect_zero_equal P hz s r hs hr rw [heq] simp