Courtade–Kumar conjecture

For every integer n≥1n\ge 1, every Boolean function f ⁣:{−1,1}n→{−1,1}f\colon\{-1,1\}^n\to\{-1,1\}, and every noise parameter ρ∈[0,1]\rho\in[0,1], let XX be uniformly distributed on {−1,1}n\{-1,1\}^n, let Z1,…,ZnZ_1,\ldots,Z_n be independent random variables with P(Zi=1)=(1+ρ)/2\mathbb{P}(Z_i=1)=(1+\rho)/2 and P(Zi=−1)=(1−ρ)/2\mathbb{P}(Z_i=-1)=(1-\rho)/2, independently of XX, and define Yi=XiZiY_i=X_iZ_i. Then I(f(X);Y)≤1−h2((1−ρ)/2)I(f(X);Y)\le 1-h_2((1-\rho)/2), where II denotes mutual information and h2(p)=−plog⁡2p−(1−p)log⁡2(1−p)h_2(p)=-p\log_2 p-(1-p)\log_2(1-p). Equality is attained by a dictator function f(x)=xjf(x)=x_j for some j∈{1,…,n}j\in\{1,\ldots,n\}.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed solved

An unrefereed September 2026 preprint claims to settle the conjecture, but the proof has not yet been independently confirmed.

The Courtade–Kumar conjecture asserts that dictators maximize noisy information among Boolean functions on the discrete cube. Courtade and Kumar posed it in 2013; the newly announced work claims a proof in full generality.

Known results

  • Verified computationally in dimensions n≤7n\le 7 (2015 source describing the state of the problem).
  • Partial Fourier-analytic and stability results (2021).
  • Dictators proved locally optimal; computer-assisted proof of the balanced case for ρ∈[0,0.914]\rho\in[0,0.914] (2024).

September 2026 claimed proof

On September 22, 2026, Vahab Mirrokni announced a claimed full proof and reported Lean verification of analytic parts; another announcement attributes a parallel approach to Sol/Astra. The cited arXiv preprint is unrefereed, and the retrieved evidence does not independently verify the proof.

Current status (as of September 2026): a full proof is claimed in new preprints, but the conjecture remains unverified; the earlier partial results are established.

Sources

Solutions 0

No solutions have been posted yet.