is_antipodal
def
A function f from the Boolean hypercube {0,1}^n to the reals is an antipodal Boolean function if it takes values in {-1, 1} and reverses sign under the global bit flip: f(not x) = -f(x) for all x.
Statement
def is_antipodal (n : ℕ) (f : (Fin n → Bool) → ℝ) : Prop
- Defined in
- scout/2610-10618-the-hellinger-conjecture-for-antipodal-boolean-functions.md:147
- Verified
- 01 Nov 2026
- Axioms
- none listed
Read back from the Lean
For a natural number n and a function f : (Fin n → Bool) → ℝ, is_antipodal n f asserts that:
1. For every boolean vector x : Fin n → Bool, f x = 1 or f x = -1; and
2. For every boolean vector x : Fin n → Bool, evaluating f at the pointwise boolean negation of x (i.e., fun i ↦ !(x i)) equals -f x (the real arithmetic negation of f 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
/-- Predicate that a function on {0,1}^n is an antipodal Boolean function taking values in {-1, 1}. -/ def is_antipodal (n : ℕ) (f : (Fin n → Bool) → ℝ) : Prop := (∀ x, f x = 1 ∨ f x = -1) ∧ ∀ x, f (fun i ↦ !x i) = -f x