AFTD Auto-Formalizing Theoretical Domains

diagram_has_no_implicit_boxes

def

A finite diagram D in ℕ² has no implicit boxes if whenever two cells of D lie in the same row (respectively, column), every cell between them in that row (respectively, column) also belongs to D.

Statement

def diagram_has_no_implicit_boxes (D : Finset (ℕ × ℕ)) : Prop
Defined in
arXiv:2611.07715 Definition 2.1
Verified
06 Nov 2026
Axioms
none listed

Read back from the Lean

A finite set $D$ of pairs of natural numbers satisfies diagram_has_no_implicit_boxes if and only if both of the following hold: 1. For all $i, j_1, j_2, j \in \mathbb{N}$, if $(i, j_1) \in D$, $(i, j_2) \in D$, $j_1 \le j$, and $j \le j_2$, then $(i, j) \in D$ (each row of $D$ is order-convex / an interval in $\mathbb{N}$). 2. For all $i_1, i_2, j, i \in \mathbb{N}$, if $(i_1, j) \in D$, $(i_2, j) \in D$, $i_1 \le i$, and $i \le i_2$, then $(i, j) \in D$ (each column of $D$ is order-convex / an interval in $\mathbb{N}$).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A diagram D has no implicit boxes if it is closed under filling gaps within any row or column. -/
def diagram_has_no_implicit_boxes (D : Finset (ℕ × ℕ)) : Prop := (∀ i j₁ j₂ j, (i, j₁) ∈ D → (i, j₂) ∈ D → j₁ ≤ j → j ≤ j₂ → (i, j) ∈ D) ∧
   (∀ i₁ i₂ j i, (i₁, j) ∈ D → (i₂, j) ∈ D → i₁ ≤ i → i ≤ i₂ → (i, j) ∈ D)
See it in the graphDiscuss this resultChallenge it