AFTD Auto-Formalizing Theoretical Domains

is_reduced_latin_square_add

theoremverifiedformalization

For every non-zero natural number $n$, the addition table on $\text{Fin } n$ is a reduced Latin square of order $n$.

Statement

theorem is_reduced_latin_square_add (n : ℕ) [NeZero n] :
    is_reduced_latin_square (fun i j : Fin n => i + j)
Formalizes
folklore
Verified
06 Nov 2026
Axioms
Quot.soundpropext
Built on 3
  • 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.
  • latin_square_is_addSanity check: the addition table of Z/n is a Latin square.
  • 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}.

Read back from the Lean

For every non-zero natural number $n$, the addition operation on Fin n (the function mapping $(i, j) \in \text{Fin } n \times \text{Fin } n$ to $i + j$) forms a reduced Latin square.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

A Latin square is reduced when its first row and first column both match the natural ordering of indices, meaning $R(0, j) = j$ and $R(i, 0) = i$. The proof constructs the three required properties of the definition directly: it invokes the theorem `latin_square_is_add` to show addition forms a Latin square, and uses the identity laws `zero_add` and `add_zero` to show that $0 + j = j$ and $i + 0 = i$.

  1. The addition table on $\text{Fin } n$ is a reduced Latin square.

    By definition, a Latin square $R$ on $\text{Fin } n$ is reduced if it is a Latin square, its first row is the identity ($R(0, j) = j$ for all $j$), and its first column is the identity ($R(i, 0) = i$ for all $i$). This triple conjunction is assembled directly: `latin_square_is_add n` establishes that addition is a Latin square, while `zero_add` and `add_zero` show that $0$ is the left and right additive identity on $\text{Fin } n$.

    line 3

    uses latin_square_is_add, zero_add, add_zero

        is_reduced_latin_square (fun i j : Fin n => i + j) := ⟨latin_square_is_add n, zero_add, add_zero⟩
latin_square_is_add
The addition operation on $\text{Fin } n$ forms a Latin square.
zero_add
Zero is a left identity for addition: $0 + a = a$.
add_zero
Zero is a right identity for addition: $a + 0 = a$.

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The addition table on Fin n is a reduced Latin square. -/theorem is_reduced_latin_square_add (n : ℕ) [NeZero n] :    is_reduced_latin_square (fun i j : Fin n => i + j) := ⟨latin_square_is_add n, zero_add, add_zero⟩
See it in the graphDiscuss this resultChallenge it