AFTD Auto-Formalizing Theoretical Domains

latin_tableaux

def

For a Young diagram μ, the set of Latin tableaux of shape μ and type μ' is the finset of fillings T from the cells of μ to natural numbers such that each entry in cell (i, j) is between 1 and the row length μ.rowLen i, and entries are distinct along each row and distinct along each column.

Statement

def latin_tableaux (μ : YoungDiagram) : Finset (μ.cells → ℕ)
Defined in
scout/2610-29291-counting-and-constructing-latin-tableaux.md:450
Verified
23 Oct 2026
Axioms
none listed
Used by 13

Read back from the Lean

Given a Young diagram μ, latin_tableaux μ is defined as the finite set of fillings T : μ.cells → ℕ (functions from the cells of μ to the natural numbers) such that: 1. For every cell c = (r, c') ∈ μ.cells, the value T c is in the closed interval [1, μ.rowLen r], i.e., 1 ≤ T c ≤ μ.rowLen r. 2. For all cells c₁, c₂ ∈ μ.cells, if c₁ and c₂ have the same row index (c₁.1.1 = c₂.1.1) and T c₁ = T c₂, then they have the same column index (c₁.1.2 = c₂.1.2) (i.e., entries are strictly distinct along each row). 3. For all cells c₁, c₂ ∈ μ.cells, if c₁ and c₂ have the same column index (c₁.1.2 = c₂.1.2) and T c₁ = T c₂, then they have the same row index (c₁.1.1 = c₂.1.1) (i.e., entries are strictly distinct along each column).

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 finset of Latin tableaux of shape μ and type μ': valid cell fillings by row-length bounded natural numbers with distinct entries along each row and column. -/
def latin_tableaux (μ : YoungDiagram) : Finset (μ.cells → ℕ) := (Fintype.piFinset fun c : μ.cells => Finset.Icc 1 (μ.rowLen c.1.1)).filter fun T =>
    (∀ (c₁ c₂ : μ.cells), c₁.1.1 = c₂.1.1 → T c₁ = T c₂ → c₁.1.2 = c₂.1.2) ∧
    (∀ (c₁ c₂ : μ.cells), c₁.1.2 = c₂.1.2 → T c₁ = T c₂ → c₁.1.1 = c₂.1.1)
See it in the graphDiscuss this resultChallenge it