AFTD Auto-Formalizing Theoretical Domains

diagram_vertical_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_vertical_slide_box D b_1 b_2 x returns $c$ if $x = b_1$; $(x.1 + 1, x.2)$ if $c \in D.erase b_1$, $x \in D.erase b_1$, $x.1 \ge b_2.1$, and $x.2 \ge b_1.2$; and $x$ otherwise.

Statement

def diagram_vertical_slide_box (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) (x : ℕ × ℕ) : ℕ × ℕ
Defined in
arXiv:2611.07715, Definition 3.4(1)
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_vertical_slideThe vertical slide of a diagram $D$ with respect to cells $b_1, b_2$ is the diagram diagram_vertical_slide D b_1 b_2 obtained as the…

Read back from the Lean

A definition of a function diagram_vertical_slide_box that takes a finite set of pairs of natural numbers D, two pairs b₁, b₂ : ℕ × ℕ, and a point x : ℕ × ℕ, and returns a point in ℕ × ℕ. Let c = (b₂.1, b₁.2). 1. If x = b₁, it returns c. 2. Otherwise, if c ∈ D \ {b₁}, x ∈ D \ {b₁}, x.1 ≥ b₂.1, and x.2 ≥ b₁.2, it returns (x.1 + 1, x.2). 3. 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 vertical slide of an admissible pair. -/
def diagram_vertical_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 + 1, x.2) else x
See it in the graphDiscuss this resultChallenge it