TCSLib

321 Boolean Analysis — Degree One

321.1 Overview

This module describes degree-one Fourier weights of subcube and Hamming-ball indicators, exponential and tail estimates for linear forms, and bounds for small sets and biased sign-valued functions. It also states the pi-over-two theorem and an improvement of any linear FKN closeness bound.

321.2 Declarations

Lemma 321.1 First-level weight as a coordinate sum
✓

Let \(n\in \mathbb N\) and let \(f:\{ 0,1\} ^n\to \mathbb R\) be a real-valued cube function, with uniform expectation \(\mathbb E[h]=2^{-n}\sum _{x\in \{ 0,1\} ^n}h(x)\) and Fourier coefficients \(\widehat f(S)=\mathbb E[f(x)\prod _{i\in S}(-1)^{x_i}]\) for \(S\subseteq \{ 0,\ldots ,n-1\} \). The degree-one Fourier weight \(W^1[f]=\sum _{|S|=1}\widehat f(S)^2\) satisfies

\[ W^1[f]=\sum _{i\lt n}\widehat f(\{ i\} )^2. \]

Let \(n\in \mathbb N\), let \(f:\{ 0,1\} ^n\to \mathbb R\) be a real-valued cube function, and let \((b_i)_{i\lt n}\) be real coefficients. With uniform expectation \(\mathbb E[h]=2^{-n}\sum _{x\in \{ 0,1\} ^n}h(x)\) and singleton Fourier coefficients \(\widehat f(\{ i\} )=\mathbb E[f(x)(-1)^{x_i}]\), one has

\[ \mathbb E\! \left[f(x)\sum _{i\lt n}b_i(-1)^{x_i}\right] =\sum _{i\lt n}b_i\widehat f(\{ i\} ). \]
Lemma 321.3 Unit linear form with prescribed correlation
✓

Let \(n\in \mathbb N\) and let \(g:\{ 0,1\} ^n\to \mathbb R\) be a real-valued cube function; write \(\mathbb E[h]=2^{-n}\sum _{x\in \{ 0,1\} ^n}h(x)\), \(\widehat g(\{ i\} )=\mathbb E[g(x)(-1)^{x_i}]\), and \(W^1[g]=\sum _{i\lt n}\widehat g(\{ i\} )^2\) for its degree-one Fourier weight. If \(W^1[g]\gt 0\), there exist real coefficients \((a_i)_{i\lt n}\) such that

\[ \sum _{i\lt n}a_i^2=1 \quad \text{and}\quad \mathbb E\! \left[g(x)\sum _{i\lt n}a_i(-1)^{x_i}\right]=\sqrt{W^1[g]}. \]

Let \(n\in \mathbb N\), let \(J\subseteq \{ 0,\ldots ,n-1\} \) be nonempty, let \(b\in \{ 0,1\} ^n\), and put \(k=|J|\) and \(q(x)=\mathbf1_{\{ x_i=b_i\ \text{for every }i\in J\} }\) for \(x\in \{ 0,1\} ^n\). Using uniform expectation \(\mathbb E[h]=2^{-n}\sum _xh(x)\), singleton Fourier coefficients \(\widehat q(\{ i\} )=\mathbb E[q(x)(-1)^{x_i}]\), and degree-one Fourier weight \(W^1[q]=\sum _{i\lt n}\widehat q(\{ i\} )^2\), one has

\[ \mathbb E[q]=\frac{1}{2^k} \quad \text{and}\quad W^1[q]=\frac{k}{2^{2k}}. \]
Theorem 321.5 Hamming-ball first-level limits
✓

For \(t\in \mathbb R\) and \(n\in \mathbb N\), define the \(\{ 0,1\} \)-valued function

\[ h_{n,t}(x)=\mathbf1_{\left\{ t\le \frac{\sum _{i\lt n}(-1)^{x_i}}{\sqrt n}\right\} }, \qquad x\in \{ 0,1\} ^n, \]

where the quotient at \(n=0\) is taken to be \(0\). Write \(\mathbb E_n[h]=2^{-n}\sum _{x\in \{ 0,1\} ^n}h(x)\), \(\widehat h(\{ i\} )=\mathbb E_n[h(x)(-1)^{x_i}]\), and \(W^1[h]=\sum _{i\lt n}\widehat h(\{ i\} )^2\) for the degree-one Fourier weight; let \(\varphi (u)=(2\pi )^{-1/2}e^{-u^2/2}\) and \(\overline\Phi (t)=\int _t^\infty \varphi (u)\, du\) be the standard Gaussian density and upper tail. For every real \(t\), both limits hold as \(n\to \infty \) through the natural numbers:

\[ \mathbb E_n[h_{n,t}]\longrightarrow \overline\Phi (t) \quad \text{and}\quad W^1[h_{n,t}]\longrightarrow \varphi (t)^2. \]
Lemma 321.6 Exponential moment of a unit linear form
✓

Let \(n\in \mathbb N\) and let \((a_i)_{i\lt n}\) be real coefficients with \(\sum _{i\lt n}a_i^2=1\). For the linear form \(L(x)=\sum _{i\lt n}a_i(-1)^{x_i}\) on \(\{ 0,1\} ^n\), with uniform expectation \(\mathbb E[h]=2^{-n}\sum _{x\in \{ 0,1\} ^n}h(x)\), every \(t\in \mathbb R\) satisfies

\[ \mathbb E[e^{tL(x)}]\le e^{t^2/2}. \]
Theorem 321.7 Truncated first moment of a linear form
✓

Let \(n\in \mathbb N\), let \((a_i)_{i\lt n}\) be real coefficients with \(\sum _{i\lt n}a_i^2=1\), and let \(s\in \mathbb R\) satisfy \(s\ge 1\). For \(L(x)=\sum _{i\lt n}a_i(-1)^{x_i}\) on \(\{ 0,1\} ^n\) and uniform expectation \(\mathbb E[h]=2^{-n}\sum _{x\in \{ 0,1\} ^n}h(x)\), one has

\[ \mathbb E\! \left[|L(x)|\, \mathbf1_{\{ |L(x)|\ge s\} }\right] \le (2s+2)e^{-s^2/2}. \]
Theorem 321.8 Level-one inequality for small sets
✓

For \(n\in \mathbb N\) and a real-valued function \(h\) on \(\{ 0,1\} ^n\), write \(\mathbb E[h]=2^{-n}\sum _{x\in \{ 0,1\} ^n}h(x)\), \(\widehat h(\{ i\} )=\mathbb E[h(x)(-1)^{x_i}]\), and \(W^1[h]=\sum _{i\lt n}\widehat h(\{ i\} )^2\) for its degree-one Fourier weight. There exists a real constant \(C\ge 0\) such that, for every \(n\in \mathbb N\), every \(f:\{ 0,1\} ^n\to \mathbb R\) satisfying \(f(x)\in \{ 0,1\} \) for every \(x\), and every real \(\alpha \) with \(\mathbb E[f]=\alpha \) and \(0\lt \alpha \le \tfrac 12\), one has

\[ W^1[f]\le C\alpha ^2\log (\alpha ^{-1}), \]

where \(\log \) is the natural logarithm.

Theorem 321.9 Pi-over-two bound and stability
✓

For \(n\in \mathbb N\) and a real-valued function \(f\) on \(\{ 0,1\} ^n\), use uniform expectation \(\mathbb E[h]=2^{-n}\sum _xh(x)\), singleton Fourier coefficients \(\widehat f(\{ i\} )=\mathbb E[f(x)(-1)^{x_i}]\), degree-one Fourier weight \(W^1[f]=\sum _{i\lt n}\widehat f(\{ i\} )^2\), and degree-one part \(L_f(x)=\sum _{i\lt n}\widehat f(\{ i\} )(-1)^{x_i}\); define \(\tau (r)=1\) for \(r\ge 0\) and \(\tau (r)=-1\) for \(r\lt 0\). There exists a real constant \(C\ge 0\) such that, for every \(n\in \mathbb N\), every sign-valued function \(f:\{ 0,1\} ^n\to \{ -1,1\} \), and every real \(\varepsilon \ge 0\) with \(|\widehat f(\{ i\} )|\le \varepsilon \) for every \(i\lt n\), one has

\[ W^1[f]\le \frac2\pi +C\varepsilon \quad \text{and}\quad \left( \frac2\pi -\varepsilon \le W^1[f] \ \Longrightarrow \Pr [f(x)\ne \tau (L_f(x))]\le C\sqrt\varepsilon \right), \]

where the probability is uniform on the cube.

Definition 321.10 Linear FKN closeness property
✓

For \(C\in \mathbb R\), define the linear FKN closeness property \(\mathcal F(C)\) as follows: for every \(n\in \mathbb N\) with \(n\gt 0\), every sign-valued function \(f:\{ 0,1\} ^n\to \{ -1,1\} \), and every real \(\delta \) with \(0\le \delta \le 1\) and \(1-\delta \le W^1[f]\), there exist an index \(i\lt n\) and a sign \(s\in \{ 1,-1\} \) such that

\[ \Pr [f(x)\ne s\, d_i(x)]\le C\delta . \]

Here \(d_i(x)=(-1)^{x_i}\) is the \(i\)th dictator, the probability is uniform on \(\{ 0,1\} ^n\), and \(W^1[f]=\sum _{i\lt n}\widehat f(\{ i\} )^2\) is the degree-one Fourier weight with \(\widehat f(\{ i\} )=2^{-n}\sum _{x\in \{ 0,1\} ^n}f(x)(-1)^{x_i}\).

Let \(n\in \mathbb N\) and let \(f:\{ 0,1\} ^n\to \{ -1,1\} \) be sign-valued, with uniform expectation \(\mathbb E[h]=2^{-n}\sum _{x\in \{ 0,1\} ^n}h(x)\), singleton Fourier coefficients \(\widehat f(\{ i\} )=\mathbb E[f(x)(-1)^{x_i}]\), and degree-one Fourier weight \(W^1[f]=\sum _{i\lt n}\widehat f(\{ i\} )^2\). For every real \(\delta \) satisfying \(0\le 1-\delta \) and \(1-\delta \le |\mathbb E[f]|\), one has

\[ W^1[f]\le 4\delta ^2\log \! \left(\frac2\delta \right). \]

The logarithm is natural, and at \(\delta =0\) both \(2/\delta \) and \(\log (2/\delta )\) are interpreted as \(0\).

For any dimension \(d\in \mathbb N\) and real-valued function \(h\) on \(\{ 0,1\} ^d\), set \(\widehat h(\{ j\} )=2^{-d}\sum _{x\in \{ 0,1\} ^d}h(x)(-1)^{x_j}\) and \(W^1[h]=\sum _{j\lt d}\widehat h(\{ j\} )^2\) for its singleton Fourier coefficients and degree-one Fourier weight, and let every probability on a cube be uniform. Let \(C\in \mathbb R\) satisfy \(C\ge 1\), and assume that for every \(m\in \mathbb N\) with \(m\gt 0\), every \(g:\{ 0,1\} ^m\to \{ -1,1\} \), and every real \(\eta \) with \(0\le \eta \le 1\) and \(1-\eta \le W^1[g]\), there exist \(j\lt m\) and \(u\in \{ 1,-1\} \) with \(\Pr [g(x)\ne u(-1)^{x_j}]\le C\eta \). Then for every \(n\in \mathbb N\) with \(n\gt 0\), every sign-valued \(f:\{ 0,1\} ^n\to \{ -1,1\} \), and every real \(\delta \) with \(0\le \delta \le 1\) and \(1-\delta \le W^1[f]\), there exist \(i\lt n\) and \(s\in \{ 1,-1\} \) such that

\[ \Pr [f(x)\ne s(-1)^{x_i}] \le \frac\delta 4+16C^2\delta ^2\max \! \left\{ \log \! \left(\frac1{C\delta }\right),1\right\} , \]

where \(\log \) is natural and, at \(\delta =0\), \(1/(C\delta )\) and its logarithm are interpreted as \(0\).