AFTD Auto-Formalizing Theoretical Domains

latin_square_is

def

A Latin square of order n: an n × n array with entries in {1, ..., n} whose rows and columns are permutations of {1, ..., n}.

Statement

def latin_square_is {n : ℕ} (L : Fin n → Fin n → Fin n) : Prop
Defined in
arXiv:2610.20008 (Avoiding a partial Latin square with an isotope of a given Latin square), Sec. 1 (Latin squares as functions [n]² → [n]).
Verified
17 Oct 2026
Axioms
none listed
Used by 5

Lean source view module on GitHub

/-- `L` is a Latin square of order `n`: every row `L i` and every column `fun i => L i j` is injective, hence a permutation of `Fin n`. -/
def latin_square_is {n : ℕ} (L : Fin n → Fin n → Fin n) : Prop :=
  (∀ i, Function.Injective (L i)) ∧ ∀ j, Function.Injective fun i => L i j
See it in the graphDiscuss this resultChallenge it