AFTD Auto-Formalizing Theoretical Domains

block_latin_filling

def

The filling assigning to cell $(i, j)$ in row $i$ the value $(\lambda_i - w \cdot (j/w + 1)) + 1 + ((t_i + (j \bmod w)) \bmod w)$, where $t_i$ is the number of rows below $i$ of the same length.

Statement

def block_latin_filling (μ : YoungDiagram) (w : ℕ) (i j : ℕ) : ℕ
Defined in
arXiv:2610.29291 Theorem 3.4 proof
Verified
22 Oct 2026
Axioms
none listed
Built on 1

Read back from the Lean

The function block_latin_filling takes a Young diagram μ, a natural number w, a row index i : ℕ, and a column index j : ℕ, and returns the natural number: (μ.rowLen i - w * (j / w + 1)) + 1 + ((young_diagram_same_len_rows_below μ i + (j % w)) % w), where division and subtraction are operations on ℕ (with truncated subtraction).

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 explicit block Latin filling function for cell (i, j) with block width w. -/
def block_latin_filling (μ : YoungDiagram) (w : ℕ) (i j : ℕ) : ℕ := (μ.rowLen i - w * (j / w + 1)) + 1 + ((young_diagram_same_len_rows_below μ i + (j % w)) % w)
See it in the graphDiscuss this resultChallenge it