TCSLib

16 Boolean Analysis — Bonami

16.1 Overview

This file develops the notion of \(B\)-reasonability of a real random variable and proves the Bonami lemma: a Boolean function of degree at most \(k\) is \(9^{k}\)-reasonable under the uniform measure on the hypercube. Along the way it establishes tail and anti-concentration bounds (including the Paley–Zygmund inequality), the average/difference decomposition of a Boolean function over its last coordinate, and the associated moment and Fourier identities.

16.2 Declarations

Definition 16.1 \(B\)-reasonable random variable
#

A real random variable \(X\) on a measurable space \(\Omega \) with measure \(P\) is \(B\)-reasonable when its fourth moment is controlled by its second moment, namely

\[ \mathbb {E}[X^4] \le B \cdot \bigl(\mathbb {E}[X^2]\bigr)^2 . \]
Lemma 16.2 Tail bound for \(B\)-reasonable variables
#

If \(X\) is \(B\)-reasonable and not equivalent to \(0\) (its second moment is positive), then for every \(t \gt 0\),

\[ \Pr \bigl[\, |X| \ge t\, \lVert X\rVert _2\, \bigr] \le \frac{B}{t^4}. \]
Lemma 16.3 \(B\)-reasonability from minimal probability
#

Let \(X\) be a discrete random variable on a finite space whose law is a PMF \(\pi \). If \(\mu \gt 0\) is a lower bound on every atom probability \(\pi (\omega )\), then \(X\) is \((1/\mu )\)-reasonable.

Lemma 16.4 Paley–Zygmund inequality
#

Let \(Z \ge 0\) be a nonnegative random variable with finite first and second moments and positive mean. For every \(\theta \) with \(0 \le \theta \le 1\),

\[ \Pr \bigl[\, Z \gt \theta \, \mathbb {E}[Z]\, \bigr] \ge \frac{(1-\theta )^2\, (\mathbb {E}[Z])^2}{\mathbb {E}[Z^2]}. \]
Lemma 16.5 Anti-concentration for \(B\)-reasonable variables

If \(X\) is \(B\)-reasonable and not equivalent to \(0\), then for every \(t \in [0,1]\),

\[ \Pr \bigl[\, |X| \gt t\, \lVert X\rVert _2\, \bigr] \ge \frac{(1-t^2)^2}{B}. \]
Definition 16.6 Restriction of the last coordinate
#

Given a Boolean function \(f\) on \(n+1\) variables and a bit \(b\), the restriction \(\mathrm{restrictLast}\, f\, b\) is the function on \(n\) variables obtained by fixing the last coordinate to \(b\), i.e. \(x \mapsto f(x, b)\).

Definition 16.7 Average over the last coordinate
#

The average \(\mathrm{avgLast}\, f\) of \(f\) over its last coordinate is the function on \(n\) variables given by \(\tfrac 12\bigl(\mathrm{restrictLast}\, f\, \mathrm{false} + \mathrm{restrictLast}\, f\, \mathrm{true}\bigr)\).

Definition 16.8 Half-difference over the last coordinate
#

The half-difference \(\mathrm{diffLast}\, f\) of \(f\) over its last coordinate is the function on \(n\) variables given by \(\tfrac 12\bigl(\mathrm{restrictLast}\, f\, \mathrm{false} - \mathrm{restrictLast}\, f\, \mathrm{true}\bigr)\).

Lemma 16.9 Restriction at false

For every \(x\), the restriction of \(f\) fixing the last coordinate to false equals the sum of the average and the half-difference: \(\mathrm{restrictLast}\, f\, \mathrm{false}\, x = \mathrm{avgLast}\, f\, x + \mathrm{diffLast}\, f\, x\).

Lemma 16.10 Restriction at true

For every \(x\), the restriction of \(f\) fixing the last coordinate to true equals the difference of the average and the half-difference: \(\mathrm{restrictLast}\, f\, \mathrm{true}\, x = \mathrm{avgLast}\, f\, x - \mathrm{diffLast}\, f\, x\).

Lemma 16.11 Sum over the hypercube splits on the last bit
#

For any \(\varphi \) on the cube of dimension \(n+1\), the total sum decomposes according to the value of the last coordinate:

\[ \sum _{x \in \{ 0,1\} ^{n+1}} \varphi (x) = \sum _{x \in \{ 0,1\} ^{n}} \varphi (x,\mathrm{false}) + \sum _{x \in \{ 0,1\} ^{n}} \varphi (x,\mathrm{true}). \]
Lemma 16.12 Uniform weight halves under one extra variable
#

The uniform point weight satisfies \(\mathrm{uniformWeight}(n+1) = \mathrm{uniformWeight}(n)/2\).

For each \(S \subseteq \mathrm{Fin}\, n\), the Fourier coefficient of \(\mathrm{avgLast}\, f\) at \(S\) equals the Fourier coefficient of \(f\) at the image of \(S\) under castSucc: \(\widehat{\mathrm{avgLast}\, f}(S) = \widehat{f}(\mathrm{castSucc}(S))\).

Lemma 16.14 Fourier coefficient of the half-difference

For each \(S \subseteq \mathrm{Fin}\, n\), the Fourier coefficient of \(\mathrm{diffLast}\, f\) at \(S\) equals the Fourier coefficient of \(f\) at the image of \(S\) under castSucc together with the last index: \(\widehat{\mathrm{diffLast}\, f}(S) = \widehat{f}\bigl(\mathrm{castSucc}(S) \cup \{ \mathrm{last}\, n\} \bigr)\).

Lemma 16.15 Expectation splits over the last coordinate

The expectation of \(\varphi \) on the cube of dimension \(n+1\) is the average of the expectations of its two restrictions:

\[ \mathbb {E}[\varphi ] = \tfrac 12\bigl(\mathbb {E}[\mathrm{restrictLast}\, \varphi \, \mathrm{false}] + \mathbb {E}[\mathrm{restrictLast}\, \varphi \, \mathrm{true}]\bigr). \]
Lemma 16.16 Fourth-power algebraic identity
#

For all real \(a, b\), \((a+b)^4 + (a-b)^4 = 2\, (a^4 + 6\, a^2 b^2 + b^4)\).

Lemma 16.17 Second-power algebraic identity
#

For all real \(a, b\), \((a+b)^2 + (a-b)^2 = 2\, (a^2 + b^2)\).

Lemma 16.18 Fourth-moment decomposition

Writing \(g = \mathrm{avgLast}\, f\) and \(h = \mathrm{diffLast}\, f\), the fourth moment of \(f\) decomposes as

\[ \mathbb {E}[f^4] = \mathbb {E}[g^4] + 6\, \mathbb {E}[g^2 h^2] + \mathbb {E}[h^4]. \]

Writing \(g = \mathrm{avgLast}\, f\) and \(h = \mathrm{diffLast}\, f\), the second moment of \(f\) decomposes as \(\mathbb {E}[f^2] = \mathbb {E}[g^2] + \mathbb {E}[h^2]\).

Lemma 16.20 Cauchy–Schwarz for the expectation

For Boolean functions \(g, h\) on the cube, \(\bigl(\mathbb {E}[g^2 h^2]\bigr)^2 \le \mathbb {E}[g^4]\cdot \mathbb {E}[h^4]\).

Lemma 16.21 Nonnegativity of \(\mathbb {E}[f^2]\)
#

For every Boolean function \(f\), \(0 \le \mathbb {E}[f^2]\).

Lemma 16.22 Nonnegativity of \(\mathbb {E}[g^2 h^2]\)

For Boolean functions \(g, h\), \(0 \le \mathbb {E}[g^2 h^2]\).

Lemma 16.23 Nonnegativity of \(\mathbb {E}[f^4]\)

For every Boolean function \(f\), \(0 \le \mathbb {E}[f^4]\).

If \(f\) has degree at most \(k\), then its average over the last coordinate \(\mathrm{avgLast}\, f\) also has degree at most \(k\).

If \(f\) has degree at most \(k\), then its half-difference over the last coordinate \(\mathrm{diffLast}\, f\) has degree at most \(k-1\).

Lemma 16.26 Degree-zero functions are constant

A Boolean function \(f\) of degree at most \(0\) is constant: \(f(x) = f(\mathrm{default})\) for all \(x\).

Lemma 16.27 Fourth moment of a constant function

For a Boolean function \(f\) of degree at most \(0\) (hence constant), \(\mathbb {E}[f^4] = \bigl(\mathbb {E}[f^2]\bigr)^2\).

Lemma 16.28 Algebraic inductive step for Bonami
#

The key algebraic inequality driving the inductive step of the Bonami lemma: for \(a, b, A, B, C \ge 0\) (with \(a, b, B, C\) nonnegative) satisfying \(A \le 9^{m+1} a^2\), \(B \le 9^m b^2\), and \(C^2 \le A\cdot B\), one has

\[ A + 6C + B \le 9^{m+1}\, (a+b)^2. \]

The main Bonami inequality stated through the expectation operator: if a Boolean function \(f\) has degree at most \(k\), then

\[ \mathbb {E}[f^4] \le 9^{k}\, \bigl(\mathbb {E}[f^2]\bigr)^2. \]
Lemma 16.30 Moments equal expectations under the uniform law

If \(P\) is a probability measure on the cube assigning each point the uniform weight, then the \(p\)-th moment of \(f\) under \(P\) coincides with the expectation \(\mathbb {E}[f^p]\).

Definition 16.31 Uniform measure on the hypercube
#

The canonical uniform probability measure on the Boolean hypercube \(\{ 0,1\} ^n\).

Lemma 16.32 Uniform measure of a point

The uniform measure assigns each point \(x\) of the cube the combinatorial uniform weight: \((\mathrm{uniformMeasure}\, n)(\{ x\} ) = \mathrm{uniformWeight}\, n\).

A Boolean function \(f\) of degree at most \(k\) is \(9^{k}\)-reasonable under the uniform measure on the hypercube.