mondrian_rect_mul
def
Multiply all four rectangle coordinates by a.
Statement
def mondrian_rect_mul (a : ℕ) (r : ℕ × ℕ × ℕ × ℕ) : ℕ × ℕ × ℕ × ℕ- Source
- Helper for OP-280 and mondrian_perfect_partition_large_prime_iff. Related work: arXiv:2610.19193, Section 1 (perfect partitions and scaling); arXiv:2007.09639, Theorem 4.1 (available shapes and prime-power exclusions).
- Verified
- 25 Oct 2026
- Axioms
- none listed
- Used by 6
- mondrian_perfect_partition_mulMultiplying all coordinates by a positive integer preserves perfect admissible partitions.
- 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_rect_mul_areaMultiplying rectangle coordinates by a multiplies its area by a squared.
- mondrian_rect_mul_cellsA cell belongs to a rectangle with coordinates multiplied by positive a exactly when its quotient cell belongs to the original rectangle.
- mondrian_rect_mul_dimensionsMultiplying coordinates by a multiplies both side lengths by a.
- 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…
Lean source view module on GitHub
def mondrian_rect_mul (a : ℕ) (r : ℕ × ℕ × ℕ × ℕ) : ℕ × ℕ × ℕ × ℕ :=
(a * r.1, a * r.2.1, a * r.2.2.1, a * r.2.2.2)