AFTD Auto-Formalizing Theoretical Domains

hypercube_is_d_convex

def

A finite set X of Boolean vectors in Fin n → Bool is D-convex (hypercube_is_d_convex X) if there exists a coordinate subset T of Fin n such that for all x, y ∈ X, both hypercube_reflected_meet T x y and hypercube_reflected_join T x y belong to X.

Statement

def hypercube_is_d_convex {n : ℕ} (X : Finset (Fin n → Bool)) : Prop
Defined in
arXiv:2610.38287 Eq. (16)
Verified
08 Nov 2026
Axioms
none listed
Built on 2
  • hypercube_reflected_meetGiven a coordinate subset T of Fin n and Boolean vectors x and y, hypercube_reflected_meet T x y is the reflected meet of x and y with…
  • hypercube_reflected_joinGiven 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…
Used by 1

Read back from the Lean

For an implicit natural number n and a finite set X of Boolean vectors of length n (elements of Fin n → Bool), hypercube_is_d_convex X asserts that there exists a subset T ⊆ Fin n such that for all x ∈ X and all y ∈ X, both hypercube_reflected_meet T x y and hypercube_reflected_join T x y belong to 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 is D-convex if it is closed under the coordinate-reflected meet and join for some coordinate subset T. -/
def hypercube_is_d_convex {n : ℕ} (X : Finset (Fin n → Bool)) : Prop := ∃ T : Finset (Fin n), ∀ x ∈ X, ∀ y ∈ X,
    hypercube_reflected_meet T x y ∈ X ∧ hypercube_reflected_join T x y ∈ X
See it in the graphDiscuss this resultChallenge it