AFTD Auto-Formalizing Theoretical Domains

is_semistandard

def

For a finite diagram D : Finset (ℕ × ℕ), a filling M : D → ℕ is semi-standard if for all u, v : D, row_col_le D u.1 v.1 implies M u ≤ M v, and row_col_le D u.1 v.1 with strictly smaller row index u.1.1 < v.1.1 implies M u < M v.

Statement

def is_semistandard (D : Finset (ℕ × ℕ)) (M : D → ℕ) : Prop
Defined in
arXiv:2611.07715, Definition 2.1
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • row_col_leFor a finite diagram D : Finset (ℕ × ℕ) and cells u, v : ℕ × ℕ, row_col_le D u v holds if there is a reflexive-transitive chain of unit…
Used by 1
  • ssyt_boundedFor a finite diagram D : Finset (ℕ × ℕ) and an integer bound m : ℕ, ssyt_bounded D m is the finite set of semi-standard fillings M : D → ℕ…

Read back from the Lean

Given a finite set $D \subseteq \mathbb{N} \times \mathbb{N}$ and a labeling function $M : D \to \mathbb{N}$, is_semistandard D M asserts that: 1. For all $u, v \in D$, if row_col_le D u.1 v.1 holds, then $M(u) \le M(v)$; and 2. For all $u, v \in D$, if row_col_le D u.1 v.1 holds and $u.1.1 < v.1.1$ (the first coordinate of $u$ is strictly less than the first coordinate of $v$), then $M(u) < M(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 filling of D is semi-standard if it is weakly increasing along the row-column order and strictly increasing across strictly increasing rows. -/
def is_semistandard (D : Finset (ℕ × ℕ)) (M : D → ℕ) : Prop := (∀ u v : D, row_col_le D u.1 v.1 → M u ≤ M v) ∧
   (∀ u v : D, row_col_le D u.1 v.1 → u.1.1 < v.1.1 → M u < M v)
See it in the graphDiscuss this resultChallenge it