AFTD Auto-Formalizing Theoretical Domains

diagram_slide_expansion_agrees_with_descents

def

A sliding tree t on a finite diagram $D$ satisfies diagram_slide_expansion_agrees_with_descents D t if for every list $l$ representing a standard Young tableau on $D$ (is_standard_young_tableau_list D l) and every index $k$, the terminal list of cells terminal_boxes t l has a row descent at $k$ (list_descent_at (terminal_boxes t l) k) if and only if $l$ has a row descent at $k$ (list_descent_at l k).

Statement

def diagram_slide_expansion_agrees_with_descents (D : Finset (ℕ × ℕ)) (t : DiagramSlidingTree D) : Prop
Defined in
arXiv:2611.07715, Proposition 4.15
Verified
06 Nov 2026
Axioms
none listed
Built on 4
  • DiagramSlidingTreeA sliding tree DiagramSlidingTree D on a diagram $D$ is either a leaf diagram with no crossings (…
  • 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$…
  • is_standard_young_tableau_listA list $l$ of cells in $\mathbb{N} \times \mathbb{N}$ represents a standard Young tableau on a finite diagram $D$…
  • list_descent_atA list of cells $l$ has a row descent at index $k$ (list_descent_at l k) if there exist cells $u$ and $v$ such that $l[k]? = some u$,…
Used by 2

Read back from the Lean

Given a diagram $D$ (a finite set of pairs of natural numbers) and a sliding tree $t$ on $D$, the proposition diagram_slide_expansion_agrees_with_descents D t asserts: For every list $l$ of pairs of natural numbers: if $l$ is a standard Young tableau list for $D$ (that is: 1. $l$ has no duplicates, 2. the set of elements of $l$ is $D$, and 3. for all pairs $u, v \in D$, if $u.1 \le v.1$ and $u.2 \le v.2$, then $u$ appears no later than $v$ in $l$, i.e., l.idxOf u ≤ l.idxOf v), then for every index $k \in \mathbb{N}$: the list terminal_boxes t l has a descent at index $k$ if and only if the list $l$ has a descent at index $k$ (where having a descent at $k$ means the element at index $k$ and the element at index $k + 1$ exist and the first coordinate of the element at index $k$ is strictly less than the first coordinate of the element at index $k + 1$).

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 sliding tree agrees with descents if for every standard tableau on D, the terminal word descents match the tableau descents. -/
def diagram_slide_expansion_agrees_with_descents (D : Finset (ℕ × ℕ)) (t : DiagramSlidingTree D) : Prop := ∀ l, is_standard_young_tableau_list D l → ∀ k, list_descent_at (terminal_boxes t l) k ↔ list_descent_at l k
See it in the graphDiscuss this resultChallenge it