AFTD Auto-Formalizing Theoretical Domains

row_col_le

def

For 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 rightward steps ((r, c) to (r, c+1)) and downward steps ((r, c) to (r+1, c)) in the implicit closure InImplicit D connecting u to v.

Statement

def row_col_le (D : Finset (ℕ × ℕ)) (u v : ℕ × ℕ) : Prop
Defined in
arXiv:2611.07715, Definition 2.1
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • InImplicitFor a diagram given as a finite set D : Finset (ℕ × ℕ), a cell (i, j) : ℕ × ℕ is in the implicit closure InImplicit D (i, j) if it belongs…
Used by 3
  • is_semistandardFor 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,…
  • StandardYoungTableauFor a finite diagram D : Finset (ℕ × ℕ), a standard Young tableau is an equivalence toEquiv : D ≃ Finset.Icc 1 D.card from the subtype D…
  • instFintypeStandardYoungTableauThe type StandardYoungTableau D of standard Young tableaux on a finite diagram D is finite.

Read back from the Lean

row_col_le D u v defines the reflexive-transitive closure of a single-step reachability relation from u to v in ℕ × ℕ. A single step from x to y holds if and only if: 1. InImplicit D x holds, 2. InImplicit D y holds, and 3. either (x.1 = y.1 and x.2 + 1 = y.2) or (x.1 + 1 = y.1 and x.2 = y.2).

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 row-column preorder on a diagram D via paths of rightward and downward steps in the implicit closure. -/
def row_col_le (D : Finset (ℕ × ℕ)) (u v : ℕ × ℕ) : Prop := Relation.ReflTransGen (fun x y => InImplicit D x ∧ InImplicit D y ∧
  ((x.1 = y.1 ∧ x.2 + 1 = y.2) ∨ (x.1 + 1 = y.1 ∧ x.2 = y.2))) u v
See it in the graphDiscuss this resultChallenge it