TCSLib

322 Boolean Analysis — Fourier Theory of Threshold Functions

322.1 Overview

This chapter relates polynomial threshold representations to Fourier uniqueness, low-degree spectral weight, noise sensitivity, and sparsity. It also records the flat spectrum and threshold sparsity of inner product modulo two, together with uniform sparse polynomial approximations.

322.2 Declarations

Let \(n,k\in \mathbb N\), let \(f,g:\{ 0,1\} ^n\to \{ -1,1\} \), and define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) and \(\widehat h(S)=\mathbb E_x[h(x)\chi _S(x)]\) using uniform expectation, for \(S\subseteq \{ 1,\ldots ,n\} \) and \(h:\{ 0,1\} ^n\to \mathbb R\). Suppose \(f(x)=\operatorname {sgn}(p(x))\) for a real multilinear polynomial \(p(x)=\sum _{|S|\le k}a_S\chi _S(x)\), where \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\). If \(\widehat g(S)=\widehat f(S)\) for every \(S\) with \(|S|\le k\), then \(g=f\).

Theorem 322.2 Linear threshold uniqueness
✓

Let \(n\in \mathbb N\) and \(f,g:\{ 0,1\} ^n\to \{ -1,1\} \), and define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) and \(\widehat h(S)=\mathbb E_x[h(x)\chi _S(x)]\) for uniform \(x\), subsets \(S\subseteq \{ 1,\ldots ,n\} \), and \(h:\{ 0,1\} ^n\to \mathbb R\). Suppose \(f(x)=\operatorname {sgn}(a_\varnothing +\sum _{i=1}^na_i(-1)^{x_i})\) for real coefficients, where \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\). If \(\widehat g(S)=\widehat f(S)\) whenever \(|S|\le 1\), then \(g=f\).

Lemma 322.3 Decay beyond the reciprocal scale
✓

For every real \(\delta \le \tfrac 12\) and natural number \(m\) satisfying \(1\lt \delta m\), one has

\[ (1-2\delta )^m\le \frac13. \]

Let \(n\in \mathbb N\), \(f:\{ 0,1\} ^n\to \{ -1,1\} \), and \(0\lt \delta \le \tfrac 12\), and define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) and \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) for uniform \(x\) and \(S\subseteq \{ 1,\ldots ,n\} \). If \(y\) is obtained from \(x\) by flipping each bit independently with probability \(\delta \), write \(\operatorname {NS}_\delta (f)=\Pr [f(x)\ne f(y)]\); then

\[ \sum _{|S|\gt \lfloor 1/\delta \rfloor }\widehat f(S)^2 \le 3\operatorname {NS}_\delta (f). \]

Let \(n\in \mathbb N\), \(f:\{ 0,1\} ^n\to \{ -1,1\} \), and \(0\lt \delta \le \tfrac 12\); write \(\operatorname {NS}_\delta (f)=\Pr [f(x)\ne f(y)]\), where \(x\) is uniform and \(y\) is obtained by independently flipping each bit of \(x\) with probability \(\delta \). There exists \(g:\{ 0,1\} ^n\to \{ -1,1\} \) of the form \(g(x)=\operatorname {sgn}(p(x))\), where \(p\) is a real multilinear polynomial of degree at most \(\lfloor 1/\delta \rfloor \), with \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\), such that

\[ \Pr _x[f(x)\ne g(x)]\le 3\operatorname {NS}_\delta (f). \]
Lemma 322.6 Correlation bounds low-degree Fourier weight
✓

Let \(n,k\in \mathbb N\), define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) on \(\{ 0,1\} ^n\) for \(S\subseteq \{ 1,\ldots ,n\} \), and let \(p(x)=\sum _Sa_S\chi _S(x)\) have real coefficients with \(a_S=0\) whenever \(|S|\gt k\). Suppose \(f:\{ 0,1\} ^n\to \mathbb R\) satisfies \(f(x)=\operatorname {sgn}(p(x))\), where \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\), and put \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) using uniform expectation. Then

\[ \bigl(\mathbb E_x|p(x)|\bigr)^2 \le \left(\sum _Sa_S^2\right)\left(\sum _{|S|\le k}\widehat f(S)^2\right). \]
Lemma 322.7 Fourier weight of the zero threshold
✓

Let \(n,k\in \mathbb N\), and let \(f:\{ 0,1\} ^n\to \mathbb R\) satisfy \(f(x)=\operatorname {sgn}(0)=1\) for every \(x\), with the convention \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\). For \(S\subseteq \{ 1,\ldots ,n\} \) define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) and \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) using uniform expectation; then

\[ \sum _{|S|\le k}\widehat f(S)^2=1. \]
Lemma 322.8 Norm bounds force low-degree weight
✓

Let \(n,k\in \mathbb N\), \(c\in \mathbb R\) with \(c\le 1\), and \(f:\{ 0,1\} ^n\to \mathbb R\), and define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) and \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) for uniform \(x\) and \(S\subseteq \{ 1,\ldots ,n\} \). Suppose \(f\) is the sign of some real multilinear polynomial of degree at most \(k\), with \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\), and assume that every real polynomial \(p(x)=\sum _{|S|\le k}a_S\chi _S(x)\) satisfies

\[ c\sum _{|S|\le k}a_S^2\le \bigl(\mathbb E_x|p(x)|\bigr)^2. \]

Then \(c\le \sum _{|S|\le k}\widehat f(S)^2\).

Theorem 322.9 Linear thresholds retain half their weight
✓

Let \(n\in \mathbb N\) and \(f:\{ 0,1\} ^n\to \{ -1,1\} \) satisfy \(f(x)=\operatorname {sgn}(a_\varnothing +\sum _{i=1}^na_i(-1)^{x_i})\) for real coefficients, where \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\). Define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) and \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) for uniform \(x\) and \(S\subseteq \{ 1,\ldots ,n\} \); then

\[ \frac12\le \sum _{|S|\le 1}\widehat f(S)^2. \]
Theorem 322.10 Polynomial thresholds retain exponential weight
✓

Let \(n,k\in \mathbb N\), \(f:\{ 0,1\} ^n\to \{ -1,1\} \), and \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) for \(S\subseteq \{ 1,\ldots ,n\} \). Suppose \(f(x)=\operatorname {sgn}(\sum _{|S|\le k}a_S\chi _S(x))\) for real coefficients, where \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\), and define \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) using uniform expectation. Then

\[ e^{-2k}\le \sum _{|S|\le k}\widehat f(S)^2. \]
Theorem 322.11 Representing support carries Fourier mass
✓

Let \(n\in \mathbb N\), \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) on \(\{ 0,1\} ^n\), and \(p(x)=\sum _Sa_S\chi _S(x)\) be a nonzero real multilinear polynomial; let \(F\) be a finite family of subsets of \(\{ 1,\ldots ,n\} \) containing every \(S\) with \(a_S\ne 0\). Suppose \(f:\{ 0,1\} ^n\to \mathbb R\) satisfies \(f(x)=\operatorname {sgn}(p(x))\), where \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\), and define \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) using uniform expectation. Then \(1\le \sum _{S\in F}|\widehat f(S)|\).

Theorem 322.12 Boolean threshold support mass bound
✓

Let \(n\in \mathbb N\), \(f:\{ 0,1\} ^n\to \{ -1,1\} \), \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\), and \(p(x)=\sum _Sa_S\chi _S(x)\) be a nonzero real multilinear polynomial on \(\{ 0,1\} ^n\). Suppose \(f(x)=\operatorname {sgn}(p(x))\), with \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\), and let \(F\) be a finite family of subsets of \(\{ 1,\ldots ,n\} \) satisfying \(a_S\ne 0\Rightarrow S\in F\). Writing \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) for uniform \(x\), one has \(1\le \sum _{S\in F}|\widehat f(S)|\).

Let \(n\in \mathbb N\) and define \(I:\{ 0,1\} ^{2n}\to \{ -1,1\} \) by \(I(u,v)=(-1)^{\sum _{i=1}^nu_iv_i}\) for \(u,v\in \{ 0,1\} ^n\). For \(S\subseteq \{ 1,\ldots ,2n\} \) define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) and \(\widehat I(S)=\mathbb E_x[I(x)\chi _S(x)]\) using uniform expectation; every such \(S\) satisfies

\[ |\widehat I(S)|=2^{-n}. \]
Theorem 322.14 Inner product parity requires exponential sparsity
✓

Let \(n\in \mathbb N\) and define \(I(u,v)=(-1)^{\sum _{i=1}^nu_iv_i}\) for \(u,v\in \{ 0,1\} ^n\). Suppose the nonzero real multilinear polynomial \(p(x)=\sum _{S\subseteq \{ 1,\ldots ,2n\} }a_S\chi _S(x)\), where \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\), satisfies \(I(x)=\operatorname {sgn}(p(x))\) for all \(x\in \{ 0,1\} ^{2n}\), with \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\). Then \(p\) has at least \(2^n\) nonzero coefficients: \(2^n\le |\{ S:a_S\ne 0\} |\).

Theorem 322.15 Uniform approximation by sparse polynomials
✓

Let \(n\in \mathbb N\) with \(n\gt 0\), let \(f:\{ 0,1\} ^n\to \mathbb R\) be nonzero, and define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\), \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) for uniform \(x\), and \(L=\sum _{S\subseteq \{ 1,\ldots ,n\} }|\widehat f(S)|\). For every \(\delta \gt 0\) and \(s\in \mathbb N\) with \(4nL^2/\delta ^2\le s\), there exists a real multilinear polynomial \(q(x)=\sum _Sa_S\chi _S(x)\) satisfying

\[ |\{ S:a_S\ne 0\} |\le s \qquad \text{and}\qquad \max _{x\in \{ 0,1\} ^n}|f(x)-q(x)|\lt \delta . \]
Theorem 322.16 Sparse thresholds and majorities of parities
✓

Let \(n\in \mathbb N\) with \(n\gt 0\), let \(f:\{ 0,1\} ^n\to \{ -1,1\} \), define \(\chi _S(x)=(-1)^{\sum _{i\in S}x_i}\) and \(\widehat f(S)=\mathbb E_x[f(x)\chi _S(x)]\) for uniform \(x\) and \(S\subseteq \{ 1,\ldots ,n\} \), and set \(L=\sum _S|\widehat f(S)|\) and \(s=\lceil 4nL^2\rceil \). There exists a real multilinear polynomial \(p(x)=\sum _Sa_S\chi _S(x)\) with at most \(s\) nonzero coefficients such that \(f(x)=\operatorname {sgn}(p(x))\), where \(\operatorname {sgn}(t)=1\) for \(t\ge 0\) and \(-1\) for \(t\lt 0\). Moreover, there exist subsets \(S_1,\ldots ,S_s\subseteq \{ 1,\ldots ,n\} \), with repetitions allowed, and signs \(\varepsilon _1,\ldots ,\varepsilon _s\in \{ -1,1\} \) such that

\[ f(x)=\operatorname {sgn}\left(\sum _{j=1}^s\varepsilon _j\chi _{S_j}(x)\right) \qquad \text{for every }x\in \{ 0,1\} ^n. \]