mondrian_rect_swap
def
Exchange the x and y coordinate pairs of an integer rectangle.
Statement
def mondrian_rect_swap (r : ℕ × ℕ × ℕ × ℕ) : ℕ × ℕ × ℕ × ℕ- Source
- Helper for OP-280: modular shape inventories for the zero-defect question in arXiv:2610.19193, Section 1. The weighted row and prime-free count argument is developed here; it supplements the available-shape counting in arXiv:2311.02385, Section 3.
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 5
- 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_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_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_swapExchanging the x and y coordinate pairs of every rectangle preserves an admissible partition of the n-square.
Lean source view module on GitHub
open scoped BigOperators def mondrian_rect_swap (r : ℕ × ℕ × ℕ × ℕ) : ℕ × ℕ × ℕ × ℕ := (r.2.2.1, r.2.2.2, r.1, r.2.1)