AFTD Auto-Formalizing Theoretical Domains

is_latin_tableau

def

A filling $T$ of a Young diagram $\lambda$ is a Latin tableau of shape $\lambda$ and type $\lambda'$ if each row $i$ contains entries from $1$ through $\lambda_i$ without repetition, and no entry repeats within any column.

Statement

def is_latin_tableau (μ : YoungDiagram) (T : ℕ → ℕ → ℕ) : Prop
Defined in
arXiv:2610.29291 Definition 2.5
Verified
22 Oct 2026
Axioms
none listed
Used by 2
  • latin_partition_is_wideEvery Latin Young diagram is wide: if a Young diagram $\mu$ admits a Latin tableau of shape $\mu$ and type $\mu'$ (…
  • is_latin_partitionA partition $\lambda$ is Latin if there exists a Latin tableau of shape $\lambda$ and type $\lambda'$.

Read back from the Lean

is_latin_tableau μ T defines the proposition that for a Young diagram μ and a filling T : ℕ → ℕ → ℕ: 1. For every cell (i, j) ∈ μ, the value T i j satisfies 1 ≤ T i j and T i j ≤ μ.rowLen i. 2. For every row i and all column indices j₁ and j₂, if (i, j₁) ∈ μ and (i, j₂) ∈ μ and T i j₁ = T i j₂, then j₁ = j₂ (no repeated values within any row of μ). 3. For every column j and all row indices i₁ and i₂, if (i₁, j) ∈ μ and (i₂, j) ∈ μ and T i₁ j = T i₂ j, then i₁ = i₂ (no repeated values within any column of μ).

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

/-- Predicate stating that T is a Latin tableau of shape μ and type conjugate of μ. -/
def is_latin_tableau (μ : YoungDiagram) (T : ℕ → ℕ → ℕ) : Prop := (∀ {i j}, (i, j) ∈ μ → 1 ≤ T i j ∧ T i j ≤ μ.rowLen i) ∧
  (∀ {i j₁ j₂}, (i, j₁) ∈ μ → (i, j₂) ∈ μ → T i j₁ = T i j₂ → j₁ = j₂) ∧
  (∀ {i₁ i₂ j}, (i₁, j) ∈ μ → (i₂, j) ∈ μ → T i₁ j = T i₂ j → i₁ = i₂)
See it in the graphDiscuss this resultChallenge it