is_reduced_latin_square
An 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.
Statement
def is_reduced_latin_square {n : ℕ} [NeZero n] (R : Fin n → Fin n → Fin n) : Prop
- Defined in
- arXiv:2611.07118, Perfect Partitions of Regular Bipartite Graphs, Section 1.1
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- latin_square_isA Latin square of order n: an n × n array with entries in {1, ..., n} whose rows and columns are permutations of {1, ..., n}.
- Used by 1
- 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$.
Read back from the Lean
Given a non-zero natural number $n$ (via [NeZero n]) and a function $R : \text{Fin } n \to \text{Fin } n \to \text{Fin } n$, is_reduced_latin_square R is the proposition that:
1. $R$ is a Latin square (i.e. latin_square_is R holds):
- for every row index $i : \text{Fin } n$, the map $R(i) : \text{Fin } n \to \text{Fin } n$ is injective, and
- for every column index $j : \text{Fin } n$, the map $(\lambda i \mapsto R(i, j)) : \text{Fin } n \to \text{Fin } n$ is injective;
2. for every column index $j : \text{Fin } n$, the entry in the first row is $j$ ($R(0, j) = j$); and
3. for every row index $i : \text{Fin } n$, the entry in the first column is $i$ ($R(i, 0) = i$).
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 reduced Latin square of order n: a Latin square whose first row and first column are the identity. -/ def is_reduced_latin_square {n : ℕ} [NeZero n] (R : Fin n → Fin n → Fin n) : Prop := latin_square_is R ∧ (∀ j, R 0 j = j) ∧ (∀ i, R i 0 = i)