mondrian_rect_width
def
The width x₁ − x₀ of the rectangle (x₀, x₁, y₀, y₁).
Statement
def mondrian_rect_width (r : ℕ × ℕ × ℕ × ℕ) : ℕ- Defined in
- arXiv:2610.19193 (A Bounded-Defect Construction for the Mondrian Art Problem), Sec. 1.
- Verified
- 15 Oct 2026
- Axioms
- none listed
- Used by 50
- mondrian_partition_horizontal_momentFor every integer-valued function f on row levels, the sum over an admissible n-square partition of width times the increment of f across…
- mondrian_height_graphThe undirected graph on integer row levels whose edges are the bottom and top levels of tiles with width indivisible by d; loops are…
- mondrian_partition_boundsEvery rectangle of an admissible n-square partition has positive side lengths, upper coordinates at most n, and side lengths at most n.
- 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_partition_divAn admissible partition of the a times c square, with every tile side a multiple of positive a, becomes an admissible partition of the…
- mondrian_rect_areaThe area |R| = width × height of a rectangle.
- 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_area_three_prime_factorsEvery tile area in a perfect admissible integer square partition has at least three distinct prime factors.
- 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_normalized_prime_free_width_modIn an admissible n-square partition with every width divisible by positive d and with constant normalized area C, the number of normalized…
- 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_partition_prime_free_height_countFor an admissible n-square partition into rectangles of one common positive integer area, and every prime p dividing n, the number of…
- 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_height_graph_walk_signed_heightsEvery walk in the height graph of a positive-height rectangle list is represented by a list of width-indivisible tiles with orientation…
- 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_rect_div_dimensionsDividing coordinates of a positive rectangle whose side lengths are multiples of a divides its width and height exactly by a.
- mondrian_partition_prime_free_shape_count_boundIn an admissible equal-area partition, any selected collection of tiles each having a side indivisible by q has cardinality at most the…
- mondrian_partition_floor_moment_div_widthIf positive d divides every tile width in an admissible n-square partition, dividing all widths in the quotient-row moment by d gives…
- 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_partition_floor_momentFor every natural q, the sum of width times the difference of the quotient y coordinates across each tile in an admissible n-square…
- mondrian_partition_mulMultiplying all rectangle coordinates by a positive integer a sends an admissible c-square partition to an admissible a times c square…
- 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_shape_boundA partition of the n-square whose rectangles all have area A has at most as many members as available unordered dimension pairs.
- mondrian_rect_horizontal_momentThe sum over a rectangle of the row increment f(y+1)-f(y) equals its width times the difference between f at its upper and lower y…
- 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_partition_isolated_row_functionLet d divide the square side. If an integer row-level function has increment one on a selected tile and has zero increment on every other…
- mondrian_partition_swapExchanging the x and y coordinate pairs of every rectangle preserves an admissible partition of the n-square.
- 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_rect_mul_areaMultiplying rectangle coordinates by a multiplies its area by a squared.
- mondrian_partition_isolated_height_residueLet d divide the square side. If every tile except r either has width divisible by d or height divisible by m, and r has height…
- mondrian_rect_mul_dimensionsMultiplying coordinates by a multiplies both side lengths by a.
- mondrian_partition_prime_free_height_dvdWhen d divides the square side, every common divisor of the heights of all other tiles with width indivisible by d also divides the height…
- 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_height_injectiveThe heights of the tiles in a perfect admissible square partition are pairwise distinct.
- mondrian_rect_floor_contributionWhen positive q divides a rectangle height, its width times the integer difference of quotient y coordinates is its area divided by q.
- mondrian_partition_area_one_impossibleAn admissible square partition cannot have every tile of area one.
- 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_partition_width_free_height_reachableIf d divides the square side and a tile has width indivisible by d, its bottom and top row levels remain connected in the height graph…
- mondrian_partition_row_width_sumAt every integer row y below n in an admissible n-square partition, the widths of the tiles crossing that row sum to n.
- mondrian_common_width_divides_sideEvery common divisor of the tile widths in an admissible n-square partition divides n.
- mondrian_rect_congruentTwo rectangles are congruent when they have the same side lengths, possibly after a rotation (so 2×3 and 3×2 are congruent).
- 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…
- mondrian_partition_prime_free_width_countFor an admissible n-square partition into rectangles of one common positive integer area, and every prime p dividing n, the number of…
- mondrian_height_graph_adj_of_memEvery positive-height member of the rectangle list whose width is indivisible by d gives a height-graph edge between its bottom and top…
- mondrian_partition_width_free_height_signed_relationIf d divides the square side and a selected tile has width indivisible by d, its height is a signed sum of heights of other, pairwise…
Lean source view module on GitHub
/-- Width `x₁ - x₀`. -/ def mondrian_rect_width (r : ℕ × ℕ × ℕ × ℕ) : ℕ := r.2.1 - r.1