Hellinger contraction with arbitrary Boolean output bias
For every , every Boolean function , and every , writing and , one has , with equality for signed coordinates .
The analytical reductions and structure of the proof are sound, but the final conclusion relies on finite exact-arithmetic certificates (Tables 2, 3, 4, and 5) generated by external scripts in verification/ that are not included in the PDF and cannot be independently verified from the manuscript alone.
“Theorem 1.1 (Hellinger conjecture). For every n ≥ 1, every Boolean function f : {−1, 1}n → {−1, 1}, and every ρ ∈ [−1, 1], writing m = Ef, one has H(m) − EH(Tρf) ≤ 1 − H(ρ). (1.1) Both expectations are with respect to the uniform probability measure.” · Show in paper