hellinger_Z
def
The Hellinger affinity Z_rho(f) of a Boolean function f is the expected value over uniform Y of sqrt(1 - (T_rho f(Y))^2).
Statement
open scoped BigOperators in noncomputable def hellinger_Z (n : ℕ) (ρ : ℝ) (f : (Fin n → Bool) → ℝ) : ℝ
- Defined in
- scout/2610-10618-the-hellinger-conjecture-for-antipodal-boolean-functions.md:164
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Built on 1
- noise_operatorThe noise operator T_rho f on the Boolean cube is the conditional expectation E[f(X) | Y = y] where each bit of X is flipped independently…
- Used by 2
- not_antipodal_hellinger_majority_three_ratioThe statement
antipodal_hellinger_majority_three_ratiois 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…
- not_antipodal_hellinger_majority_three_ratioThe statement
Read back from the Lean
hellinger_Z is a definition that takes a natural number n, a real number ρ, and a function f : (Fin n → Bool) → ℝ, and produces the real number:
(1 / 2^n) * ∑ y : Fin n → Bool, √(1 - (noise_operator n ρ f y)^2),
which is the average over all Boolean strings y of length n of the square root of 1 minus the square of the noise operator applied to f at 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
open scoped BigOperators in /-- The Hellinger affinity quantity Z_rho(f) = E_Y sqrt(1 - (T_rho f(Y))^2). -/ noncomputable def hellinger_Z (n : ℕ) (ρ : ℝ) (f : (Fin n → Bool) → ℝ) : ℝ := (1 / (2 : ℝ) ^ n) * ∑ y : Fin n → Bool, Real.sqrt (1 - (noise_operator n ρ f y) ^ 2)