Preprint

A Proof of the Most Informative Boolean Function Conjecture

Zi-Jie Chen Amin Gohari Adel Javanmard Hong-Hao Lin V. Mirrokni Chandra Nair David P. Woodruff

Sep 2026 · 0 citations

Computer Science Mathematics

TL;DR

The present work builds on the differential-equation method, itself a limiting form of the auxiliary-receiver approach in network information theory using a continuum of degraded receivers, and gives a computer-assisted proof of the Courtade--Kumar conjecture.

Abstract

Let $X$ be uniform on $\{-1,1\}^n$, let $Y$ be obtained by passing its coordinates independently through a binary symmetric channel with crossover probability $p$, and let $g:\{-1,1\}^n\to\{0,1\}$ be a Boolean function. We give a computer-assisted proof of the Courtade--Kumar conjecture $I(g(X);Y)\le1-H_2(p)$, where $H_2$ is binary entropy, with equality attained by dictator functions. The present work builds on the differential-equation method, itself a limiting form of the auxiliary-receiver approach in network information theory using a continuum of degraded receivers. The proof proceeds from a local inequality to a dimension-independent bound on entropy production. Differentiation along the Boolean noise semigroup expresses entropy production as an average of edge costs. The key estimate is therefore an unrestricted Bellman inequality with two mean constraints and two entropy constraints, allowing arbitrary couplings of the edge variables. This paper and its supplement provide the proofs and computational verification records. The document is lengthy because it is designed to be entirely self-contained, deriving all proofs from first principles and reproducing the proofs of cited results. We also give a self-contained expository note explaining the reduction to a low-dimensional inequality and the ideas behind the key lower bounds. The entire proof, including all numerical certificates, has been formally verified in Lean end-to-end, and is available online.

arXiv Semantic Scholar

View source

Similar papers

Preprint Sep 2026

A Resolution of Friedgut's Conjecture on Influential Coalitions

We prove that, for every constant $\varepsilon>0$ and every function $f:\Sigma^n\to\{0, 1\}$, there is a coalition of $O(n/\sqrt{\log n})$ coordinates and a target output $b\in\{0, 1\}$ such that, after the remaining coordinates are sampled uniformly and independently, the coalition can choose its values to make the ou...

Eshan Chattopadhyay, Mohit Gurumukhani · 0 citations

Preprint Sep 2026

Free-Probabilistic State Evolution and Random Matrix Discrepancy

Let $A_1,\ldots,A_n$ be independent $d \times d$ real symmetric Gaussian random matrices, and consider the linear operator $A(x) = n^{-1/2}\sum_{i=1}^n x_i A_i$, $x\in \mathbb{R}^n$. We construct an iterative algorithm in the Approximate Message Passing family which iterates over $A$ and its adjoint $A^*$, and establis...

August Y. Chen, A. El Alaoui · 0 citations

Preprint Aug 2026

Shannon's problem on the monotonicity of entropy and a Conjecture of Tao

Let $X_1,X_2,\ldots$ be i.i.d. finitely supported random variables in a torsion-free abelian group, and write $S_k=X_1+\cdots+X_k$, and $H(S_k)$ is the Shannon entropy $S_k$, for all $k \ge 1$. We prove that, for every fixed $n\geq1$, \[ H(S_{n+1})-H(S_n) \geq \frac12\log\frac{n+1}{n} -o_{H(X_1)\to\infty}(1), \] unifor...

Zi-Ran Liu · 0 citations

Preprint Sep 2026

Proof of the Kahn Saks Conjecture

Let $\mathbb{P}(x\prec y)$ be the probability that $x$ precedes $y$ in a uniformly random linear extension of an $n$-element poset $P$, and define the balancing coefficient to be $\delta(x,y)=\min(\mathbb{P}(x\prec y),\mathbb{P}(y\prec x))$ with $\delta(P)=\max_{x,y}\delta(x,y)$. We prove (Theorem 1) that sufficiently...

Max Aires · 1 citation · ⚡1

Preprint Aug 2026

A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs

Let $X_H$ denote the number of copies of a fixed graph $H$ in $G_{n, p}$. Gilmer and Kopparty conjectured that $X_H$ satisfies a local central limit theorem (LCLT) provided that $H$ is connected, $p \gg n^{-1/m(H)}$, and $n^2 (1-p) \gg 1$, where $m(H)$ is the maximum density. Following the work of Berkowitz, Sah and Sa...

Asaf Cohen Antonir, Ilay Hoshen, M. Zhukovskii · 1 citation

Preprint Sep 2026

Random Permutation Matrices Form a Basis with High Probability

Let $d_n=(n-1)^2+1$, the dimension of the real linear span of the $n\times n$ permutation matrices. We prove that $d_n$ independent uniformly random permutation matrices are linearly independent with probability $1-O(n^{-1/2})$. Conditioning on distinctness gives the same conclusion for a uniformly random $d_n$-element...

Yi-Jun Jiang · 0 citations