AFTD Auto-Formalizing Theoretical Domains

dictator_dist

def

The dictator distance delta(f) of a real-valued function f : (Fin n → Bool) → ℝ on the hypercube Fin n → Bool is the infimum over all signed dictators g : (Fin n → Bool) → ℝ satisfying is_signed_dictator n g of (1 / (2 : ℝ) ^ n) * ∑ x : Fin n → Bool, if f x ≠ g x then 1 else 0.

Statement

open scoped BigOperators in
noncomputable def dictator_dist (n : ℕ) (f : (Fin n → Bool) → ℝ) : ℝ
Defined in
scout/2610-10618-the-hellinger-conjecture-for-antipodal-boolean-functions.md:977
Verified
01 Nov 2026
Axioms
none listed
Built on 1
  • is_signed_dictatorFor a natural number n, a real-valued function g : (Fin n → Bool) → ℝ is a signed dictator if there exist an index i : Fin n and a real…
Used by 2

Read back from the Lean

Given a dimension n : ℕ and a function f : (Fin n → Bool) → ℝ, dictator_dist n f is defined as the infimum over all functions g : (Fin n → Bool) → ℝ satisfying is_signed_dictator n g of the normalized Hamming distance to g, namely (1 / 2^n) * ∑ x : Fin n → Bool, if f x ≠ g x then 1 else 0.

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

open scoped BigOperators in
/-- The distance of a Boolean function f to the nearest signed dictator under the uniform distribution. -/
noncomputable def dictator_dist (n : ℕ) (f : (Fin n → Bool) → ℝ) : ℝ := ⨅ (g : (Fin n → Bool) → ℝ) (_ : is_signed_dictator n g),
    (1 / (2 : ℝ) ^ n) * ∑ x : Fin n → Bool, if f x ≠ g x then 1 else 0
See it in the graphDiscuss this resultChallenge it