mondrian_defect
def
The defect def(P) = max_{R∈P} |R| − min_{R∈P} |R| of a family of rectangles.
Statement
def mondrian_defect (P : List (ℕ × ℕ × ℕ × ℕ)) : ℕ- Defined in
- arXiv:2610.19193 (A Bounded-Defect Construction for the Mondrian Art Problem), Sec. 1 (def(P)).
- Verified
- 15 Oct 2026
- Axioms
- none listed
- Built on 1
- mondrian_rect_areaThe area |R| = width × height of a rectangle.
- Used by 36
- mondrian_seven_rects_defectWith E = p² − 19q², the defect of the seven-rectangle dissection is 140|E|.
- mondrian_no_perfect_sixThe integer square of side six has no perfect admissible partition.
- 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_perfect_prime_free_side_countsIn any perfect admissible partition of an integer n-square, every prime p dividing n divides both the number of tiles with width not…
- 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_partition_mulMultiplying all coordinates by a positive integer preserves perfect admissible partitions.
- mondrian_perfect_area_three_prime_factorsEvery tile area in a perfect admissible integer square partition has at least three distinct prime factors.
- mondrian_pell_family_defect_280For n₀ = 315, n₁ = 106785, n_{j+2} = 340n_{j+1} − n_j: for every j the n_j×n_j square has a Mondrian partition into seven pairwise…
- 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_partition_width_dvd_of_height_two_chainsIf d divides the square side and all width-indivisible tiles have heights in two superincreasing chains C*p^a and C*r*p^a, with p>r+1 and…
- mondrian_min_defectM(n): the minimum defect over all admissible Mondrian partitions of the n×n square (⊤ when there is none).
- mondrian_defect_zero_equalAny two rectangles in a list of defect zero have equal area.
- mondrian_two_prime_area_sides_dvdFor a perfect admissible square partition with common area q^s*p^t and q dividing the square side, both dimensions of every tile are…
- 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_perfect_partition_divDividing coordinates by a preserves perfect admissible partitions when a is positive and divides every tile side.
- 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_perfect_height_component_countFor a perfect admissible n-square partition and prime p dividing n, each connected component of the height graph contains a number of…
- mondrian_defect_zero_of_equalA rectangle list whose members all have the same area has defect zero, including the empty list.
- mondrian_seven_rects_partition_defectLet 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)…
- mondrian_three_prime_common_area_sides_divideFor primes p,q,r with p>r+1, if q divides the square side and every tile in a perfect admissible partition has area q^s*r*p^a, then q…
- mondrian_seven_rects_defect_geWithin the seven-rectangle family, the defect is always at least 280 (in particular never 0): if p, q are odd then p² − 19q² ≡ 2 (mod 4),…
- mondrian_two_prime_area_width_dvdFor a perfect admissible square partition with common area q^s*p^t and q dividing the square side, every tile width is divisible by q.
- mondrian_partition_width_dvd_of_height_prime_chainSuppose d divides the square side and all tiles whose widths are indivisible by d have heights C times powers of a fixed prime p, with…
- mondrian_seven_rects_defect_exampleFor (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.
- mondrian_perfect_partition_div_common_areaIf q divides the square side and both dimensions of every tile in a perfect partition, and the common area is q^2 times B, coordinate…
- 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_min_defect_sevenM₇(n): the minimum defect over admissible Mondrian partitions of the n×n square into exactly seven rectangles (⊤ when there is none).
- mondrian_liminf_min_defect_seven_leliminf_{n→∞} M₇(n) ≤ 280: infinitely many squares have a seven-rectangle Mondrian partition with defect at most 280.
- mondrian_no_perfect_six_mul_prime_powFor every prime p greater than six and every natural e, the square of side six times p to the e has no perfect admissible partition.
- mondrian_perfect_width_free_count_ne_twoIn a perfect admissible square partition, for any divisor d of the square side, exactly two tiles cannot have widths indivisible by d.
- mondrian_perfect_area_productIn a perfect n-square partition, the number of rectangles times the area of any member is n squared.
- mondrian_perfect_partition_large_prime_iffFor every positive integer c, prime p greater than c, and natural exponent e, the square of side c times p to the e has a perfect…
- mondrian_perfect_height_injectiveThe heights of the tiles in a perfect admissible square partition are pairwise distinct.
- 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_prime_powerNo square whose integer side length is a prime power has a perfect admissible partition.
- 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…
Lean source view module on GitHub
/-- The defect: largest minus smallest rectangle area. -/ def mondrian_defect (P : List (ℕ × ℕ × ℕ × ℕ)) : ℕ := ((P.map mondrian_rect_area).max?.getD 0) - ((P.map mondrian_rect_area).min?.getD 0)