AFTD Auto-Formalizing Theoretical Domains

diagram_vertical_slide

def

The 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 image of $D$ under diagram_vertical_slide_box D b_1 b_2.

Statement

def diagram_vertical_slide (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) : Finset (ℕ × ℕ)
Defined in
arXiv:2611.07715, Definition 3.4(1)
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • diagram_vertical_slide_boxFor $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)$,…
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$…
  • DiagramSlidingTreeA sliding tree DiagramSlidingTree D on a diagram $D$ is either a leaf diagram with no crossings (…

Read back from the Lean

The definition diagram_vertical_slide D b₁ b₂ produces the finite set of pairs of natural numbers obtained by taking the image of D under diagram_vertical_slide_box D b₁ b₂. Given D : Finset (ℕ × ℕ) and b₁, b₂ : ℕ × ℕ, the function maps each point x : ℕ × ℕ to: - (b₂.1, b₁.2) if x = b₁; - (x.1 + 1, x.2) if x ≠ b₁, (b₂.1, b₁.2) ∈ D.erase b₁, x ∈ D.erase b₁, x.1 ≥ b₂.1, and x.2 ≥ b₁.2; - x otherwise.

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 diagram obtained by the vertical slide of an admissible pair. -/
def diagram_vertical_slide (D : Finset (ℕ × ℕ)) (b₁ b₂ : ℕ × ℕ) : Finset (ℕ × ℕ) := D.image (diagram_vertical_slide_box D b₁ b₂)
See it in the graphDiscuss this resultChallenge it