AFTD Auto-Formalizing Theoretical Domains

diagram_horizontal_slide_box

def

For $D : \text{Finset } (\mathbb{N} \times \mathbb{N})$, $b_1, b_2, x \in \mathbb{N} \times \mathbb{N}$, and $c = (b_2.1, b_1.2)$, diagram_horizontal_slide_box D b_1 b_2 x returns $c$ if $x = b_2$; $(x.1, x.2 + 1)$ if $c \in D.erase b_2$, $x \in D.erase b_2$, $x.1 \ge b_2.1$, and $x.2 \ge b_1.2$; and $x$ otherwise.

Statement

def diagram_horizontal_slide_box (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) (x : ℕ × ℕ) : ℕ × ℕ
Defined in
arXiv:2611.07715, Definition 3.4(2)
Verified
06 Nov 2026
Axioms
none listed
Used by 2
  • terminal_boxesGiven a sliding tree t : DiagramSlidingTree D and a list $l$ of boxes representing a tableau on $D$, terminal_boxes t l transports $l$…
  • diagram_horizontal_slideThe horizontal slide of a diagram $D$ with respect to cells $b_1, b_2$ is the diagram diagram_horizontal_slide D b_1 b_2 obtained as the…

Read back from the Lean

diagram_horizontal_slide_box D b₁ b₂ x is the function taking a finite set D : Finset (ℕ × ℕ), two pairs b₁, b₂ : ℕ × ℕ, and a point x : ℕ × ℕ, and returning a point in ℕ × ℕ defined as follows: Let r := b₂.1, q := b₁.2, and c := (r, q). - If x = b₂, it returns c. - Otherwise, if c ∈ D \ {b₂}, x ∈ D \ {b₂}, x.1 ≥ r, and x.2 ≥ q, it returns (x.1, x.2 + 1). - Otherwise, it returns x.

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

/-- The box mapping under the horizontal slide of an admissible pair. -/
def diagram_horizontal_slide_box (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) (x : ℕ × ℕ) : ℕ × ℕ := let r := b₂.1; let q := b₁.2; let c := (r, q); let c_in_D'' := c ∈ D.erase b₂; if x = b₂ then c else if c_in_D'' ∧ x ∈ D.erase b₂ ∧ x.1 ≥ r ∧ x.2 ≥ q then (x.1, x.2 + 1) else x
See it in the graphDiscuss this resultChallenge it