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
- latin_square_exists_principal_isotope_avoiding_selfThe case L' = L: every Latin square of order n > 1 is avoided by one of its own principal isotopes (shift the rows cyclically).
- opposed_latin_blocking_sum_eqLet n >= 2 and let L be an n x n Latin square with symbols 0,...,n-1 (every row and every column of L is a permutation). In the opposed…
- is_reduced_latin_squareAn n × n array R on Fin n is a reduced Latin square if it is a Latin square whose first row and first column are the identity permutation.
- is_reduced_latin_square_addFor every non-zero natural number $n$, the addition table on $\text{Fin } n$ is a reduced Latin square of order $n$.
- latin_square_is_addSanity check: the addition table of Z/n is a Latin square.
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