AFTD Auto-Formalizing Theoretical Domains

int_square_symmetry_one_one_false

theoremverified

The identity is among the eight square symmetries (signs +1, no swap).

Statement

theorem int_square_symmetry_one_one_false (v : ℤ × ℤ) : int_square_symmetry 1 1 false v = v
Source
Sanity lemma for the square symmetries, arXiv:2610.16562 (The Davenport constant of low-dimensional boxes).
Verified
14 Oct 2026
Axioms
propext
Built on 1
  • int_square_symmetryThe eight symmetries of the square [−m, m]² acting on ℤ²: an optional swap of the two coordinates followed by a sign on each coordinate.

The proof, explained

The theorem states that applying the square symmetry with unit signs $(+1, +1)$ and no coordinate swap acts as the identity on any vector $v \in \mathbb{Z} \times \mathbb{Z}$. The proof unfolds `int_square_symmetry`, reduces the false conditional branch to $(1 \cdot v_1, 1 \cdot v_2)$, and simplifies this directly to $v$.

  1. $\operatorname{int\_square\_symmetry}(1, 1, \text{false}, v) = v$ automation

    Unfolding the definition of `int_square_symmetry`, the boolean flag $\text{false}$ selects the unswapped branch $((1 : \mathbb{Z}) \cdot v_1, (1 : \mathbb{Z}) \cdot v_2)$. The simplifier reduces the multiplications by 1 to $v_1$ and $v_2$, and pair eta-reduction identifies $(v_1, v_2)$ with $v$.

    line 2

    uses int_square_symmetry

      simp [int_square_symmetry]
int_square_symmetry
The definition of the symmetry action on a vector $v \in \mathbb{Z} \times \mathbb{Z}$ given signs $e_1, e_2 \in \mathbb{Z}^\times$ and a boolean coordinate-swap flag, mapping $v$ to $(e_1 v_2, e_2 v_1)$ if the flag is true and $(e_1 v_1, e_2 v_2)$ otherwise.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem int_square_symmetry_one_one_false (v : ℤ × ℤ) : int_square_symmetry 1 1 false v = v := by  simp [int_square_symmetry]
See it in the graphDiscuss this resultChallenge it