AFTD Auto-Formalizing Theoretical Domains

hypercube_antipode

def

For a vertex x in the hypercube {0, 1}^n, its antipodal vertex is obtained by complementing each coordinate, so that (hypercube_antipode x) i = !(x i) for all i.

Statement

def hypercube_antipode {n : ℕ} (x : Fin n → Bool) : Fin n → Bool
Defined in
arXiv:2611.16243 Section 1
Verified
16 Nov 2026
Axioms
none listed
Used by 3
  • hypercube_antipode_involutiveThe antipodal map on the vertices of the Boolean hypercube {0, 1}^n is an involution: complementing coordinates twice yields the original…
  • is_antipodal_coloringGiven n : ℕ, an edge coloring c : (hypercube_graph n).edgeSet → Bool is antipodal if for all vertices u, v : Fin n → Bool, given proofs h…
  • antipodal_coloring_exists_red_path_of_pair_labellingConditional form of the antipodal-coloring theorem: if for every K ≥ 2 there is no labelling of the vertices of Q_K by ordered pairs of…

Read back from the Lean

For a natural number n, hypercube_antipode is defined as the function taking an element x : Fin n → Bool to the element of Fin n → Bool given by mapping each index i : Fin n to the boolean negation of x i (that is, !(x 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

/-- The antipodal vertex of x in the hypercube {0, 1}^n, obtained by complementing each coordinate. -/
def hypercube_antipode {n : ℕ} (x : Fin n → Bool) : Fin n → Bool := fun i => !(x i)
See it in the graphDiscuss this resultChallenge it