Sharp binary-information contraction on the discrete cube
For every finite , every soft binary channel , and , , where is the nonnegative increasing branch on , and for , every soft coordinate with attains equality.
The proof is complete and rigorous: positive-time smoothing ensures interior values, Walsh character expansion ensures , and continuity of at handles the limit without requiring finite initial entropy production.
“Theorem 1.1 (Sharp soft-channel contraction). For every finite n ≥ 0, every u : Ωn → [−1, 1], and −1 ≤ ρ ≤ 1, I(Tρu) ≤ ψ(|ρ| ψ−1(I(u))). (1.1) The inverse is the nonnegative increasing branch on [0, L]. For n ≥ 1, every soft coordinate u(x) = axi, |a| ≤ 1, attains equality.” · Show in paper