AFTD Auto-Formalizing Theoretical Domains

hypercube_reflected_join

def

Given a coordinate subset T of Fin n and Boolean vectors x and y, hypercube_reflected_join T x y is the reflected join of x and y with respect to T, defined by hypercube_coord_reflect T (hypercube_coord_reflect T x ⊔ hypercube_coord_reflect T y).

Statement

def hypercube_reflected_join {n : ℕ} (T : Finset (Fin n)) (x y : Fin n → Bool) : Fin n → Bool
Defined in
arXiv:2610.38287 Eq. (15)
Verified
08 Nov 2026
Axioms
none listed
Built on 1
  • hypercube_coord_reflectGiven a coordinate subset T of Fin n and a Boolean vector x : Fin n → Bool, hypercube_coord_reflect T x is the Boolean vector obtained by…
Used by 2

Read back from the Lean

hypercube_reflected_join is a definition that takes an implicit natural number n, a subset T : Finset (Fin n) of coordinates, and two Boolean vectors x, y : Fin n → Bool. It returns the Boolean vector Fin n → Bool obtained by applying hypercube_coord_reflect T to the pointwise supremum (⊔) of hypercube_coord_reflect T x and hypercube_coord_reflect T y.

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

/-- Reflected join of two Boolean vectors with respect to a coordinate subset T. -/
def hypercube_reflected_join {n : ℕ} (T : Finset (Fin n)) (x y : Fin n → Bool) : Fin n → Bool := hypercube_coord_reflect T (hypercube_coord_reflect T x ⊔ hypercube_coord_reflect T y)
See it in the graphDiscuss this resultChallenge it