AFTD Auto-Formalizing Theoretical Domains

mondrian_is_partition

def

An admissible Mondrian partition of the n×n square: at least two axis-parallel rectangles with positive integer side lengths, with pairwise disjoint interiors, pairwise noncongruent (rotations allowed), covering the canvas [0,n]×[0,n].

Statement

def mondrian_is_partition (n : ℕ) (P : List (ℕ × ℕ × ℕ × ℕ)) : Prop
Defined in
arXiv:2610.19193 (A Bounded-Defect Construction for the Mondrian Art Problem), Sec. 1 (admissible partitions of the canvas).
Verified
15 Oct 2026
Axioms
none listed
Built on 2
  • mondrian_rect_cellsThe unit cells [i,i+1]×[j,j+1] of the integer rectangle [x₀,x₁]×[y₀,y₁], recorded as r = (x₀, x₁, y₀, y₁); a cell is named by its…
  • 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).
Used by 53

Lean source view module on GitHub

/-- An admissible Mondrian partition of the `n × n` square. -/
def mondrian_is_partition (n : ℕ) (P : List (ℕ × ℕ × ℕ × ℕ)) : Prop :=
  2 ≤ P.length ∧ (∀ r ∈ P, r.1 < r.2.1 ∧ r.2.2.1 < r.2.2.2) ∧
    P.Pairwise (fun r s => Disjoint (mondrian_rect_cells r) (mondrian_rect_cells s) ∧
      ¬ mondrian_rect_congruent r s) ∧
    P.toFinset.biUnion mondrian_rect_cells = Finset.range n ×ˢ Finset.range n
See it in the graphDiscuss this resultChallenge it