AFTD Auto-Formalizing Theoretical Domains

is_standard_young_tableau_list

def

A list $l$ of cells in $\mathbb{N} \times \mathbb{N}$ represents a standard Young tableau on a finite diagram $D$ (is_standard_young_tableau_list D l) if $l$ has no duplicate elements (l.Nodup), the set of elements in $l$ equals $D$ (l.toFinset = D), and whenever $u, v \in D$ satisfy $u.1 \le v.1$ and $u.2 \le v.2$, $u$ appears before or at $v$ in $l$ ($l.idxOf u \le l.idxOf v$).

Statement

def is_standard_young_tableau_list (D : Finset (ℕ × ℕ)) (l : List (ℕ × ℕ)) : Prop
Defined in
arXiv:2611.07715, Section 2.1 and Lemma 3.12
Verified
06 Nov 2026
Axioms
none listed
Used by 2

Read back from the Lean

A finite set of pairs of natural numbers D and a list of pairs of natural numbers l satisfy is_standard_young_tableau_list D l if and only if all of the following hold: 1. l contains no duplicate elements (l.Nodup); 2. the set of elements in l is equal to D (l.toFinset = D); 3. for all pairs of natural numbers u and v, if u ∈ D, v ∈ D, the first coordinate of u is less than or equal to the first coordinate of v (u.1 ≤ v.1), and the second coordinate of u is less than or equal to the second coordinate of v (u.2 ≤ v.2), then the index of u in l is less than or equal to the index of v in l (l.idxOf u ≤ l.idxOf v).

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 list of cells is a standard Young tableau on D if it lists all cells of D without duplicates in an order extending the componentwise product order. -/
def is_standard_young_tableau_list (D : Finset (ℕ × ℕ)) (l : List (ℕ × ℕ)) : Prop := l.Nodup ∧ l.toFinset = D ∧ ∀ u v : ℕ × ℕ, u ∈ D → v ∈ D → u.1 ≤ v.1 → u.2 ≤ v.2 → l.idxOf u ≤ l.idxOf v
See it in the graphDiscuss this resultChallenge it