probability-statistics / Analysis of Boolean functions

Talagrand’s convolution conjecture

The claim is the exact conjectured decay: ψμa(u)≤Ca/log⁡u\psi_{\mu_a}(u) \le C_a/\sqrt{\log u} for every u>1u > 1 and every nn, with CaC_a dimension-free - concretely ≲κa2(log⁡κaκa−1)1/2\lesssim \kappa_a^2(\log\frac{\kappa_a}{\kappa_a-1})^{1/2} where κa=(1+a)/(1−a)\kappa_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 log⁡log⁡u\log\log u factor disappears. That last log⁡log⁡\log\log is what stood between the previous work and Talagrand's statement.

37Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

probability-statisticsAug 16, 2026Significance 37/100Registry: unreviewed

Talagrand’s convolution conjecture

Prior state unknown→proved

The claim is the exact conjectured decay: ψμa(u)≤Ca/log⁡u\psi_{\mu_a}(u) \le C_a/\sqrt{\log u} for every u>1u > 1 and every nn, with CaC_a dimension-free - concretely ≲κa2(log⁡κaκa−1)1/2\lesssim \kappa_a^2(\log\frac{\kappa_a}{\kappa_a-1})^{1/2} where κa=(1+a)/(1−a)\kappa_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…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

The claim is the exact conjectured decay: ψμa(u)≤Ca/log⁡u\psi_{\mu_a}(u) \le C_a/\sqrt{\log u} for every u>1u > 1 and every nn, with CaC_a dimension-free - concretely ≲κa2(log⁡κaκa−1)1/2\lesssim \kappa_a^2(\log\frac{\kappa_a}{\kappa_a-1})^{1/2} where κa=(1+a)/(1−a)\kappa_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 log⁡log⁡u\log\log u factor disappears. That last log⁡log⁡\log\log is what stood between the previous work and Talagrand's statement.

The claim is the exact conjectured decay: ψμa(u)≤Ca/log⁡u\psi_{\mu_a}(u) \le C_a/\sqrt{\log u} for every u>1u > 1 and every nn, with CaC_a dimension-free - concretely ≲κa2(log⁡κaκa−1)1/2\lesssim \kappa_a^2(\log\frac{\kappa_a}{\kappa_a-1})^{1/2} where κa=(1+a)/(1−a)\kappa_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 log⁡log⁡u\log\log u factor disappears. That last log⁡log⁡\log\log is what stood between the previous work and Talagrand's statement.

Recorded attempts

Evidence graph

Connected research record