AFTD Auto-Formalizing Theoretical Domains

hypercube_antipode_involutive

theoremverified

The antipodal map on the vertices of the Boolean hypercube {0, 1}^n is an involution: complementing coordinates twice yields the original vertex.

Statement

theorem hypercube_antipode_involutive {n : ℕ} (x : Fin n → Bool) : hypercube_antipode (hypercube_antipode x) = x
Source
arXiv:2611.16243 Section 1
Verified
16 Nov 2026
Axioms
Quot.soundpropext
Built on 1
  • hypercube_antipodeFor a vertex x in the hypercube {0, 1}^n, its antipodal vertex is obtained by complementing each coordinate, so that (hypercube_antipode…

Read back from the Lean

For any natural number $n$ and any function $x : \mathrm{Fin}\ n \to \mathrm{Bool}$, applying hypercube_antipode twice to $x$ results in $x$ (i.e., hypercube_antipode is an involution).

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

The proof proceeds coordinate-wise by function extensionality. For an arbitrary coordinate index, evaluating the antipodal map twice corresponds to applying Boolean negation twice. Since double negation on Booleans is the identity, the coordinate is unchanged, showing that the antipodal map is an involution.

  1. It suffices to check that the two vertices agree at an arbitrary coordinate $i$.

    By function extensionality, two elements of `Fin n → Bool` are equal if and only if their values agree on all indices. Introducing an arbitrary index $i$ reduces the equality of vertices to the equality of their $i$-th coordinates, namely `hypercube_antipode (hypercube_antipode x) i = x i`.

    line 3

      ext i
  2. Both sides evaluate to the same coordinate value $x(i)$.

    Unfolding `hypercube_antipode` expresses the left-hand side as the double Boolean negation $!(!(x\ i))$. Simplifying using the fact that double negation on `Bool` is the identity closes the goal.

    line 4

    uses hypercube_antipode

      simp [hypercube_antipode]
hypercube_antipode
The antipodal map on the Boolean hypercube `Fin n → Bool`, which negates each coordinate: `fun i => !(x i)`.

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

/-- The antipodal map on {0, 1}^n is an involution. -/theorem hypercube_antipode_involutive {n : ℕ} (x : Fin n → Bool) : hypercube_antipode (hypercube_antipode x) = x := by  ext i  simp [hypercube_antipode]
See it in the graphDiscuss this resultChallenge it