AFTD Auto-Formalizing Theoretical Domains

is_signed_dictator

def

For 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 number s : ℝ with s = 1 ∨ s = -1 such that for all x : Fin n → Bool, g x = s * (if x i then -1 else 1).

Statement

def is_signed_dictator (n : ℕ) (g : (Fin n → Bool) → ℝ) : Prop
Defined in
scout/2610-10618-the-hellinger-conjecture-for-antipodal-boolean-functions.md:150
Verified
01 Nov 2026
Axioms
none listed
Used by 3
  • not_antipodal_hellinger_majority_three_ratioThe statement antipodal_hellinger_majority_three_ratio is false: The theorem statement claims that dictator_dist 3 majority_three = 1 /…
  • antipodal_hellinger_signed_dictator_equalityFor every real number ρ with 0 < ρ < 1, every natural number n with 0 < n, and every signed dictator g : (Fin n → Bool) → ℝ satisfying…
  • dictator_distThe dictator distance delta(f) of a real-valued function f : (Fin n → Bool) → ℝ on the hypercube Fin n → Bool is the infimum over all…

Read back from the Lean

The property that a function g : (Fin n → Bool) → ℝ is a signed dictator: there exist a coordinate index i : Fin n and a sign s : ℝ such that s = 1 or s = -1, and for every x : Fin n → Bool, g x equals s * (if x i then -1 else 1).

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 g : (Fin n → Bool) → ℝ is a signed dictator. -/
def is_signed_dictator (n : ℕ) (g : (Fin n → Bool) → ℝ) : Prop := ∃ (i : Fin n) (s : ℝ), (s = 1 ∨ s = -1) ∧ ∀ x, g x = s * (if x i then -1 else 1)
See it in the graphDiscuss this resultChallenge it