AFTD Auto-Formalizing Theoretical Domains

hypercube_has_relative_opposite_pair

def

A finite set X : Finset (Fin n → Bool) contains a relative opposite pair (hypercube_has_relative_opposite_pair X) if there exists d ∈ X such that the relative opposite vector hypercube_relative_opposite X d belongs to X.

Statement

def hypercube_has_relative_opposite_pair {n : ℕ} (X : Finset (Fin n → Bool)) : Prop
Defined in
arXiv:2610.38287 Definition 1
Verified
08 Nov 2026
Axioms
none listed
Built on 1
  • hypercube_relative_oppositeGiven a finite set X : Finset (Fin n → Bool) and a Boolean vector d : Fin n → Bool, hypercube_relative_opposite X d is the Boolean vector…
Used by 1

Read back from the Lean

For a given natural number $n$ and a finite set $X$ of elements of $\text{Fin } n \to \text{Bool}$, there exists an element $d \in X$ such that the point $d'$ defined by flipping $d(i)$ (i.e., $\neg d(i)$) on every coordinate $i$ that is not constant across $X$, and leaving $d(i)$ unchanged on coordinates that are constant across $X$, is also an element of $X$.

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 set of vertices of the unit hypercube contains a relative opposite pair if there exists an element whose relative opposite point also belongs to the set. -/
def hypercube_has_relative_opposite_pair {n : ℕ} (X : Finset (Fin n → Bool)) : Prop := ∃ d ∈ X, hypercube_relative_opposite X d ∈ X
See it in the graphDiscuss this resultChallenge it