Weak-Type Bounds for Convolution on the Boolean Hypercube

Junwei Lu, Shengtao Guo, Ethan X. Fang

On the Boolean cube {−1,1}^n with uniform measure, for every fixed 0<a<1, n≥1 and u>1, convolution by the biased-coin product measure μ_a satisfies sup_{f≥0, ||f||₁=1} u·λ({T_{μ_a}f≥u})≤C_a/√(log u), with an a-dependent constant. The bound is dimension free.

Sources for this record

What was already known

Talagrand posed the bound in 1989. Chen’s reverse-heat estimate retained a (log log u)^(3/2) loss, later reduced by Xiang and Zhang to log log u.

AI involvement AI-centered

Lu, Guo and Fang credit the Odin Automatic AI Research Agent with discovering the power-coupling proof. The amount of human mathematical steering during discovery is undocumented.

The primary paper credits the AI agent with discovering the central proof; the human steering record is too thin for an autonomy claim.

Importance Major

Proves the optimal-order dimension-free weak-type convolution bound Talagrand conjectured.

Limitations

No completed check of the original AI-origin power-coupling proof or human explanation of its central mechanism is documented. Shaposhnikov’s later separate martingale proof supports the theorem but does not audit that proof; the constant is not uniform in a.

Technical verification Reported

No completed check of the original power-coupling proof is documented. A later distinct proof corroborates the theorem but does not verify this AI-origin argument.

Human understanding Few

No documented human explanation of the original central power-coupling mechanism beyond the paper’s exposition; this is an evidence default, not a finding that the authors cannot understand it.

Correction and publication history

2026-10-18 · publication

The original power-coupling proof is assessed separately from a later martingale proof.

Read this published revision