probability-statistics / Analysis of Boolean functions
Talagrand’s convolution conjecture
The claim is the exact conjectured decay: ψμa(u)≤Ca/logu for every u>1 and every n, with Ca dimension-free - concretely ≲κa2(logκa−1κa)1/2 where κa=(1+a)/(1−a).
What is new is one step in a three-paper chain rather than a proof from scratch, and the paper is explicit about it. Chen's reverse-heat and Boolean-bridge framework and Xiang-Zhang's localized terminal-discrepancy method are taken as given; the addition is a power coupling that splits each reverse edge ratio into two geometric powers, producing a switched exponential weight that restores the exact reverse jump rate of the perturbed coordinate. Because the frozen exponent then has a fixed numerator, no growing stopping buffer is needed and the loglogu factor disappears. That last loglog is what stood between the previous work and Talagrand's statement.
The claim is the exact conjectured decay: ψμa(u)≤Ca/logu for every u>1 and every n, with Ca dimension-free - concretely ≲κa2(logκa−1κa)1/2 where κa=(1+a)/(1−a).
What is new is one step in a three-paper chain rather than a proof from scratch, and the paper is explicit about it. Chen's reverse-heat and Boolean-bridge framework and X…
The claim is the exact conjectured decay: ψμa(u)≤Ca/logu for every u>1 and every n, with Ca dimension-free - concretely ≲κa2(logκa−1κa)1/2 where κa=(1+a)/(1−a).
What is new is one step in a three-paper chain rather than a proof from scratch, and the paper is explicit about it. Chen's reverse-heat and Boolean-bridge framework and Xiang-Zhang's localized terminal-discrepancy method are taken as given; the addition is a power coupling that splits each reverse edge ratio into two geometric powers, producing a switched exponential weight that restores the exact reverse jump rate of the perturbed coordinate. Because the frozen exponent then has a fixed numerator, no growing stopping buffer is needed and the loglogu factor disappears. That last loglog is what stood between the previous work and Talagrand's statement.
The claim is the exact conjectured decay: ψμa(u)≤Ca/logu for every u>1 and every n, with Ca dimension-free - concretely ≲κa2(logκa−1κa)1/2 where κa=(1+a)/(1−a).
What is new is one step in a three-paper chain rather than a proof from scratch, and the paper is explicit about it. Chen's reverse-heat and Boolean-bridge framework and Xiang-Zhang's localized terminal-discrepancy method are taken as given; the addition is a power coupling that splits each reverse edge ratio into two geometric powers, producing a switched exponential weight that restores the exact reverse jump rate of the perturbed coordinate. Because the frozen exponent then has a fixed numerator, no growing stopping buffer is needed and the loglogu factor disappears. That last loglog is what stood between the previous work and Talagrand's statement.