AFTD Auto-Formalizing Theoretical Domains

is_latin_partition

def

A partition $\lambda$ is Latin if there exists a Latin tableau of shape $\lambda$ and type $\lambda'$.

Statement

def is_latin_partition (μ : YoungDiagram) : Prop
Defined in
arXiv:2610.29291 Definition 2.5
Verified
22 Oct 2026
Axioms
none listed
Built on 1
  • is_latin_tableauA filling $T$ of a Young diagram $\lambda$ is a Latin tableau of shape $\lambda$ and type $\lambda'$ if each row $i$ contains entries from…
Used by 1
  • latin_partition_is_wideEvery Latin Young diagram is wide: if a Young diagram $\mu$ admits a Latin tableau of shape $\mu$ and type $\mu'$ (…

Read back from the Lean

Given a Young diagram μ, is_latin_partition μ asserts that there exists a filling T : ℕ → ℕ → ℕ such that: 1. For every cell (i, j) ∈ μ, the value T i j satisfies 1 ≤ T i j ≤ μ.rowLen i (the value is between 1 and the length of row i); 2. For any row i and column indices j₁, j₂, if (i, j₁) ∈ μ, (i, j₂) ∈ μ, and T i j₁ = T i j₂, then j₁ = j₂ (entries in any row of μ are strictly distinct); 3. For any column j and row indices i₁, i₂, if (i₁, j) ∈ μ, (i₂, j) ∈ μ, and T i₁ j = T i₂ j, then i₁ = i₂ (entries in any column of μ are strictly distinct).

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 Young diagram is Latin if it admits a Latin tableau of shape μ and type conjugate of μ. -/
def is_latin_partition (μ : YoungDiagram) : Prop := ∃ T : ℕ → ℕ → ℕ, is_latin_tableau μ T
See it in the graphDiscuss this resultChallenge it