mondrian_height_graph
def
The undirected graph on integer row levels whose edges are the bottom and top levels of tiles with width indivisible by d; loops are omitted.
Statement
def mondrian_height_graph (d : ℕ) (P : List (ℕ × ℕ × ℕ × ℕ)) : SimpleGraph ℕ- Source
- Helper for OP-280, arXiv:2610.19193, Section 1. Height-level networks are motivated by the graph model in arXiv:2007.09639, Section 1; the filtered graph and row-potential cut argument are developed here for the remaining cases with at least three prime factors.
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Built on 1
- mondrian_rect_widthThe width x₁ − x₀ of the rectangle (x₀, x₁, y₀, y₁).
- Used by 5
- 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_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_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
def mondrian_height_graph (d : ℕ) (P : List (ℕ × ℕ × ℕ × ℕ)) : SimpleGraph ℕ where Adj x y := x ≠ y ∧ ∃ r ∈ P, ¬ d ∣ mondrian_rect_width r ∧ ((x = r.2.2.1 ∧ y = r.2.2.2) ∨ (x = r.2.2.2 ∧ y = r.2.2.1)) symm := ⟨by intro x y h obtain ⟨hne, r, hr, hd, hxy⟩ := h refine ⟨hne.symm, r, hr, hd, ?_⟩ rcases hxy with hxy | hxy · exact Or.inr ⟨hxy.2, hxy.1⟩ · exact Or.inl ⟨hxy.2, hxy.1⟩⟩ loopless := ⟨fun x h => h.1 rfl⟩