TCSLib

329 Boolean Analysis — Noise Stability

329.1 Overview

This chapter defines uniform noise stability for dimension-indexed function classes and records the influence-to-noise reduction, Peres’s bound for linear threshold functions, and Kane’s bounds for polynomial threshold functions.

329.2 Declarations

Definition 329.1 Dimension-indexed function classes
✓

A class of functions on Boolean cubes is a family \(B=(B_n)_{n\in \mathbb N}\), where \(B_n\) is a set of real-valued functions on \(\{ 0,1\} ^{n}\).

Definition 329.2 Boolean-valued function classes
✓

For a family \(B=(B_n)_{n\in \mathbb N}\) of sets of functions \(\{ 0,1\} ^{n}\to \mathbb R\), being Boolean-valued means that every \(f\in B_n\), in every dimension \(n\), satisfies \(f(x)\in \{ -1,1\} \) for all \(x\in \{ 0,1\} ^{n}\).

Definition 329.3 Polynomial threshold classes
✓

For \(k,n\in \mathbb N\), the degree-at-most-\(k\) polynomial threshold class consists of functions \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) for which there is a real multilinear polynomial \(p\) of degree at most \(k\) such that \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) for every \(x\), where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(\operatorname {sgn}_{+}(t)=-1\) for \(t\lt 0\).

Definition 329.4 Linear threshold classes
✓

For every \(n\in \mathbb N\), the linear threshold class consists of functions \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) admitting real coefficients \(c,a_1,\ldots ,a_n\) with

\[ f(x)=\operatorname {sgn}_{+}\left(c+\sum _{i=1}^{n}a_i(-1)^{x_i}\right), \]

where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).

Definition 329.5 Uniform noise stability
✓

For a family \(B=(B_n)_{n\in \mathbb N}\) of sets of real-valued functions on \(\{ 0,1\} ^{n}\), uniform noise stability means that every member is \(\{ -1,1\} \)-valued and there exists a function \(\varepsilon :\mathbb R\to \mathbb R\) with \(0\leq \varepsilon (\delta )\leq 1\) for \(0\leq \delta \leq 1/2\) and \(\lim _{\delta \to 0^{+}}\varepsilon (\delta )=0\), such that

\[ \Pr [f(X)\neq f(Y)]\leq \varepsilon (\delta ) \quad (n\in \mathbb N,\ f\in B_n,\ 0\lt \delta \leq 1/2). \]

Here \(X\) is uniform on \(\{ 0,1\} ^{n}\) and \(Y\) is obtained by flipping each coordinate of \(X\) independently with probability \(\delta \); no range condition is imposed on \(\varepsilon \) outside \([0,1/2]\).

Definition 329.6 Negated coordinate identification
✓

For every \(n,m\in \mathbb N\), a function \(f:\{ 0,1\} ^{n}\to \mathbb R\), a vector \(z\in \{ 0,1\} ^{n}\) and a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), negating according to \(z\) and identifying according to \(\pi \) gives the function \(g:\{ 0,1\} ^{m}\to \mathbb R\) defined by

\[ g(w)=f\bigl((z_i+w_{\pi (i)}\pmod2)_{i=1}^{n}\bigr). \]
Definition 329.7 Closure under negation and identification
✓

For a family \(B=(B_n)_{n\in \mathbb N}\) of sets of real-valued functions on \(\{ 0,1\} ^{n}\), closure under input negation and identification means that, for all \(n,m\in \mathbb N\), \(f\in B_n\), \(z\in \{ 0,1\} ^{n}\) and maps \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), the function

\[ w\longmapsto f\bigl((z_i+w_{\pi (i)}\pmod2)_{i=1}^{n}\bigr) \]

belongs to \(B_m\).

Definition 329.8 Reciprocal block count
✓

For a real parameter \(\delta \), the block count is the natural number

\[ m(\delta )=\max \{ 0,\lfloor \delta ^{-1}\rfloor \} , \]

where the floor is the integer floor and \(0^{-1}\) is defined to be \(0\); in particular \(m(\delta )=0\) for \(\delta \leq 0\).

Lemma 329.9 Nonnegative stability at nonnegative correlation
✓

For every \(n\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\) and real \(\rho \geq 0\), the noise stability

\[ \operatorname {Stab}_{\rho }(f)=\sum _{S\subseteq \{ 1,\ldots ,n\} }\rho ^{|S|}\widehat f(S)^2 \]

is nonnegative, where \(\widehat f(S)=2^{-n}\sum _{x\in \{ 0,1\} ^{n}}f(x)\prod _{i\in S}(-1)^{x_i}\) is the normalized Walsh coefficient (and \(\rho ^0=1\), including at \(\rho =0\)).

Lemma 329.10 Half bound for totalized sensitivity
✓

For every \(n\in \mathbb N\), real-valued \(f:\{ 0,1\} ^{n}\to \mathbb R\) and real \(\delta \leq 1/2\), including negative \(\delta \), the total real-valued noise sensitivity satisfies

\[ \operatorname {NS}_{\delta }(f)=\frac{1-\sum _{S\subseteq \{ 1,\ldots ,n\} }(1-2\delta )^{|S|}\widehat f(S)^2}{2}\leq \frac12, \]

where \(\widehat f(S)=2^{-n}\sum _{x\in \{ 0,1\} ^{n}}f(x)\prod _{i\in S}(-1)^{x_i}\).

Lemma 329.11 Bounds on the reciprocal block count
✓

For every real \(\delta \) with \(0\lt \delta \leq 1/2\), the natural number \(m=\lfloor 1/\delta \rfloor \) satisfies

\[ 2\leq m,\qquad m\leq \frac1\delta ,\qquad \frac1{2\delta }\leq m. \]
Lemma 329.12 Square-root bound per block
✓

For every real \(\delta \) with \(0\lt \delta \leq 1/2\), setting \(m=\lfloor 1/\delta \rfloor \) gives

\[ \frac{\sqrt m}{m}\leq \sqrt2\, \sqrt\delta . \]
Lemma 329.13 A vanishing uniform sensitivity bound
✓

Let \(B=(B_n)_{n\in \mathbb N}\) be a family of sets of functions \(\{ 0,1\} ^{n}\to \{ -1,1\} \) and let \(\varepsilon :\mathbb R\to \mathbb R\) satisfy \(\varepsilon (\delta )\geq 0\) for \(0\leq \delta \leq 1/2\), \(\lim _{\delta \to 0^{+}}\varepsilon (\delta )=0\) and \(\operatorname {NS}_{\delta }(f)\leq \varepsilon (\delta )\) for every \(n\), \(f\in B_n\) and \(0\lt \delta \leq 1/2\). Then \(B\) is uniformly noise-stable: there exists \(\eta :\mathbb R\to \mathbb R\) with \(0\leq \eta (\delta )\leq 1\) on \([0,1/2]\), \(\lim _{\delta \to 0^{+}}\eta (\delta )=0\) and \(\operatorname {NS}_{\delta }(f)\leq \eta (\delta )\) for every such \(n,f,\delta \), where \(\operatorname {NS}_{\delta }(f)=\Pr [f(X)\neq f(Y)]\), \(X\) is uniform on the cube and \(Y\) flips each coordinate independently with probability \(\delta \).

Lemma 329.14 Boolean values of linear thresholds
✓

For every \(n\in \mathbb N\), every member \(f\) of the linear threshold class on \(\{ 0,1\} ^{n}\) takes values in \(\{ -1,1\} \); the class consists of functions \(f(x)=\operatorname {sgn}_{+}(c+\sum _{i=1}^{n}a_i(-1)^{x_i})\) with real coefficients, where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).

Lemma 329.15 Closure of linear threshold functions
✓

For all \(n,m\in \mathbb N\), real coefficients \(c,a_1,\ldots ,a_n\), \(z\in \{ 0,1\} ^{n}\) and maps \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), if \(f(x)=\operatorname {sgn}_{+}(c+\sum _{i=1}^{n}a_i(-1)^{x_i})\), then \(g(w)=f((z_i+w_{\pi (i)}\pmod2)_{i=1}^{n})\) is a \(\{ -1,1\} \)-valued linear threshold function on \(\{ 0,1\} ^{m}\), meaning that \(g(w)=\operatorname {sgn}_{+}(b+\sum _{j=1}^{m}u_j(-1)^{w_j})\) for some real \(b,u_1,\ldots ,u_m\). Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).

Definition 329.16 Odd-multiplicity image
✓

For \(n,m\in \mathbb N\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \) and a subset \(S\subseteq \{ 1,\ldots ,n\} \), the odd-multiplicity image is the set

\[ O_{\pi }(S)=\{ j\in \{ 1,\ldots ,m\} : |\{ i\in S:\pi (i)=j\} |\text{ is odd}\} . \]
Lemma 329.17 Cardinality of the odd-multiplicity image
✓

For all \(n,m\in \mathbb N\), maps \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \) and subsets \(S\subseteq \{ 1,\ldots ,n\} \), the set \(O_{\pi }(S)=\{ j\in \{ 1,\ldots ,m\} :|\{ i\in S:\pi (i)=j\} |\text{ is odd}\} \) satisfies \(|O_{\pi }(S)|\leq |S|\).

Lemma 329.18 Parity of a sign power
✓

For every bit \(b\in \{ 0,1\} \) and natural number \(c\), setting \(s(b)=(-1)^b\) gives

\[ s(b)^c=\begin{cases} s(b)& \text{if }c\text{ is odd},\\ 1& \text{if }c\text{ is even}.\end{cases} \]
Lemma 329.19 Sign products after coordinate identification
✓

For \(n,m\in \mathbb N\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), \(S\subseteq \{ 1,\ldots ,n\} \) and \(w\in \{ 0,1\} ^{m}\), set \(O_{\pi }(S)=\{ j\in \{ 1,\ldots ,m\} :|\{ i\in S:\pi (i)=j\} |\text{ is odd}\} \); then

\[ \prod _{i\in S}(-1)^{w_{\pi (i)}}=\prod _{j\in O_{\pi }(S)}(-1)^{w_j}. \]
Lemma 329.20 Walsh characters under negated identification
✓

For \(n,m\in \mathbb N\), \(z\in \{ 0,1\} ^{n}\), \(w\in \{ 0,1\} ^{m}\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \) and \(S\subseteq \{ 1,\ldots ,n\} \), define \(\chi _A(x)=\prod _{i\in A}(-1)^{x_i}\) for subsets of the coordinate set of \(x\), and set \(O_{\pi }(S)=\{ j\in \{ 1,\ldots ,m\} :|\{ i\in S:\pi (i)=j\} |\text{ is odd}\} \); then

\[ \chi _S\bigl((z_i+w_{\pi (i)}\pmod2)_{i=1}^{n}\bigr)=\chi _S(z)\chi _{O_{\pi }(S)}(w). \]
Lemma 329.21 Closure of polynomial threshold functions
✓

For every \(k,n,m\in \mathbb N\), a function \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) of the form \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) for a real multilinear polynomial \(p\) of degree at most \(k\), every \(z\in \{ 0,1\} ^{n}\) and every map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), the function \(g(w)=f((z_i+w_{\pi (i)}\pmod2)_{i=1}^{n})\) is also \(\{ -1,1\} \)-valued and has a representation \(g(w)=\operatorname {sgn}_{+}(q((-1)^{w_1},\ldots ,(-1)^{w_m}))\) with a real multilinear polynomial \(q\) of degree at most \(k\). Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).

Lemma 329.22 Monotonicity in the allowed polynomial degree
✓

For every \(n,k,k'\in \mathbb N\) with \(k\leq k'\), every \(\{ -1,1\} \)-valued function on \(\{ 0,1\} ^{n}\) represented by \(\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) for a real multilinear polynomial \(p\) of degree at most \(k\) also admits such a representation of degree at most \(k'\), where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).

Lemma 329.23 Exclusive-or form of negated identification
✓

For every \(n,m\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\), \(z\in \{ 0,1\} ^{n}\), \(w\in \{ 0,1\} ^{m}\) and map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), define \(g(v)=f((u_i(v))_{i=1}^{n})\), where \(u_i(v)=1-v_{\pi (i)}\) when \(z_i=1\) and \(u_i(v)=v_{\pi (i)}\) when \(z_i=0\); then

\[ g(w)=f\bigl(z\oplus (w_{\pi (i)})_{i=1}^{n}\bigr), \]

where \(\oplus \) is coordinatewise addition modulo \(2\).

Lemma 329.24 Flipping an identified variable
✓

For \(n,m\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\), \(z\in \{ 0,1\} ^{n}\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), \(w\in \{ 0,1\} ^{m}\) and \(j\in \{ 1,\ldots ,m\} \), define \(g(v)=f(z\oplus (v_{\pi (i)})_{i=1}^{n})\), where \(\oplus \) is coordinatewise addition modulo \(2\), and write \(x^{A}\) for the vector obtained by flipping precisely the coordinates in \(A\); then

\[ g(w^{\{ j\} })=f\bigl((z\oplus (w_{\pi (i)})_{i=1}^{n})^{\pi ^{-1}(\{ j\} )}\bigr). \]

For \(n,m\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \) and \(j\in \{ 1,\ldots ,m\} \), define \(g_z(w)=f(z\oplus (w_{\pi (i)})_{i=1}^{n})\), where \(\oplus \) is coordinatewise addition modulo \(2\), and write \(x^{A}\) for the vector obtained by flipping the coordinates in \(A\); then

\[ \mathbb E_{z}\! \left[\operatorname {Inf}_j(g_z)\right] =\mathbb E_x\! \left[\frac{(f(x)-f(x^{\pi ^{-1}(\{ j\} )}))^2}{4}\right], \qquad \operatorname {Inf}_j(h)=\mathbb E_w\! \left[\frac{(h(w)-h(w^{\{ j\} }))^2}{4}\right]. \]

Each expectation is uniform on the full Boolean cube of its variable’s dimension.

Lemma 329.26 Sum of block-flip disagreements
✓

For every \(n\in \mathbb N\), positive integer \(m\), \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) and \(j\in \{ 1,\ldots ,m\} \),

\[ \sum _{\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} } \Pr _X\! \left[f(X)\neq f(X^{\pi ^{-1}(\{ j\} )})\right] =m^n\operatorname {NS}_{1/m}(f). \]

Here \(X\) is uniform on \(\{ 0,1\} ^{n}\), \(X^{A}\) flips precisely the coordinates of \(A\), and \(\operatorname {NS}_{1/m}(f)\) is \(\Pr [f(X)\neq f(Y)]\) when each coordinate of \(X\) is independently flipped with probability \(1/m\) to obtain \(Y\).

Lemma 329.27 Monotonicity of totalized noise sensitivity
✓

For every \(n\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\) and real \(\delta \leq \delta '\leq 1/2\), with no lower bound on either rate, one has \(\operatorname {NS}_{\delta }(f)\leq \operatorname {NS}_{\delta '}(f)\), where the total real-valued extension is

\[ \operatorname {NS}_{t}(f)=\frac{1-\sum _{S\subseteq \{ 1,\ldots ,n\} }(1-2t)^{|S|}\widehat f(S)^2}{2}, \qquad \widehat f(S)=2^{-n}\sum _{x\in \{ 0,1\} ^{n}}f(x)\prod _{i\in S}(-1)^{x_i}. \]
Theorem 329.28 Influence-to-noise bound for closed classes
✓

Let \(B=(B_n)_{n\in \mathbb N}\) be a family of sets of functions \(\{ 0,1\} ^{n}\to \{ -1,1\} \), closed under all substitutions \(w\mapsto (z_i+w_{\pi (i)}\pmod2)_{i=1}^{n}\) for every \(n,m\in \mathbb N\), \(z\in \{ 0,1\} ^{n}\) and map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), and let \(A:\mathbb N\to \mathbb R\) satisfy

\[ \operatorname {Inf}(f):=\sum _{i=1}^{n}\Pr _X[f(X)\neq f(X^{\{ i\} })]\leq A(n) \quad \text{for every }n\in \mathbb N,\ f\in B_n, \]

where \(X\) is uniform on \(\{ 0,1\} ^{n}\) and \(X^{\{ i\} }\) flips coordinate \(i\). Then for every \(0\lt \delta \leq 1/2\), \(n\in \mathbb N\) and \(f\in B_n\), setting \(m=\lfloor 1/\delta \rfloor \) gives

\[ \operatorname {NS}_{\delta }(f)\leq \frac{A(m)}{m}, \]

where \(\operatorname {NS}_{\delta }(f)=\Pr [f(X)\neq f(Y)]\) and \(Y\) independently flips each coordinate of \(X\) with probability \(\delta \).

Theorem 329.29 Peres’s noise-sensitivity bound
✓

There exists a universal real constant \(C\geq 0\) such that, for every \(n\in \mathbb N\), every linear threshold function \(f(x)=\operatorname {sgn}_{+}(c+\sum _{i=1}^{n}a_i(-1)^{x_i})\) on \(\{ 0,1\} ^{n}\) with real coefficients and every \(0\lt \delta \leq 1/2\),

\[ \operatorname {NS}_{\delta }(f)\leq C\sqrt\delta . \]

Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\), and \(\operatorname {NS}_{\delta }(f)=\Pr [f(X)\neq f(Y)]\) with uniform \(X\) and independent coordinate flips of probability \(\delta \) producing \(Y\).

Theorem 329.30 Uniform stability of linear thresholds
✓

The family of linear threshold functions on Boolean cubes is uniformly noise-stable: every function has the form \(f(x)=\operatorname {sgn}_{+}(c+\sum _{i=1}^{n}a_i(-1)^{x_i})\) for real coefficients, is \(\{ -1,1\} \)-valued, and there exists \(\varepsilon :\mathbb R\to \mathbb R\) satisfying \(0\leq \varepsilon (\delta )\leq 1\) on \([0,1/2]\), \(\lim _{\delta \to 0^{+}}\varepsilon (\delta )=0\) and

\[ \Pr [f(X)\neq f(Y)]\leq \varepsilon (\delta ) \]

for every dimension \(n\in \mathbb N\), every such \(f\) and every \(0\lt \delta \leq 1/2\). Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\), \(X\) is uniform on \(\{ 0,1\} ^{n}\), and \(Y\) independently flips its coordinates with probability \(\delta \).

Lemma 329.31 Vanishing square-root polylogarithmic modulus
✓

For every natural number \(d\), with \(\log \) denoting the natural logarithm,

\[ \lim _{\delta \to 0^{+}}\sqrt\delta \, \bigl(\log (1/\delta )\bigr)^d=0. \]
Theorem 329.32 Kane’s influence bound for higher degrees
✓

There exists a universal real constant \(C\gt 0\) such that, for every \(n,k\in \mathbb N\) with \(k\geq 2\) and every \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) admitting a representation \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) by a real multilinear polynomial \(p\) of degree at most \(k\),

\[ \operatorname {Inf}(f)\leq \sqrt n\, \bigl(2^k\log (\max \{ n,2\} )\bigr)^{Ck\log (\max \{ k,2\} )}. \]

Here \(\operatorname {Inf}(f)=\sum _{i=1}^{n}\Pr _X[f(X)\neq f(X^{\{ i\} })]\), \(X\) is uniform, \(X^{\{ i\} }\) flips coordinate \(i\), \(\log \) is the natural logarithm, real powers have positive bases, and \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).

Lemma 329.33 Degree-one polynomial thresholds are linear
✓

For every \(n,k\in \mathbb N\) with \(k\leq 1\), if \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) has a representation \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) by a real multilinear polynomial \(p\) of degree at most \(k\), then there exist real \(c,a_1,\ldots ,a_n\) such that

\[ f(x)=\operatorname {sgn}_{+}\left(c+\sum _{i=1}^{n}a_i(-1)^{x_i}\right)\quad \text{for all }x\in \{ 0,1\} ^{n}, \]

where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).

Theorem 329.34 Kane’s influence bound for all degrees
✓

There exists a universal real constant \(C\gt 0\) such that, for every \(n,k\in \mathbb N\), including \(n=0\) and \(k=0\), and every \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) represented as \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) by a real multilinear polynomial \(p\) of degree at most \(k\),

\[ \operatorname {Inf}(f)\leq \sqrt n\, \bigl(2^k\log (\max \{ n,2\} )\bigr)^{Ck\log (\max \{ k,2\} )}. \]

Here \(\operatorname {Inf}(f)=\sum _{i=1}^{n}\Pr _X[f(X)\neq f(X^{\{ i\} })]\), \(X\) is uniform, \(X^{\{ i\} }\) flips coordinate \(i\), \(\log \) is the natural logarithm, real powers have positive bases, and \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).

Lemma 329.35 Bounding a real logarithmic exponent
✓

For real \(L,E\) and \(d\in \mathbb N\) with \(L\geq \log 2\) and \(0\leq E\leq d\), where \(\log \) is the natural logarithm, one has

\[ L^E\leq (\log 2)^{-d}L^d, \]

with real exponentiation on the positive bases \(L\) and \(\log 2\).

Lemma 329.36 Block-count polylogarithmic estimate
✓

For \(k,d\in \mathbb N\) and real \(E,\delta \) with \(0\leq E\leq d\) and \(0\lt \delta \leq 1/2\), setting \(m=\lfloor 1/\delta \rfloor \) gives

\[ \frac{\sqrt m\, \bigl(2^k\log (\max \{ m,2\} )\bigr)^E}{m} \leq \sqrt2\, (2^k)^E(\log 2)^{-d}\sqrt\delta \, \bigl(\log (1/\delta )\bigr)^d, \]

where \(\log \) is the natural logarithm and the powers with real exponents have positive bases.

Theorem 329.37 Kane’s influence and noise-sensitivity bounds
✓

For \(n,k\in \mathbb N\), let a degree-at-most-\(k\) polynomial threshold function mean \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) of the form \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) for a real multilinear polynomial \(p\) of degree at most \(k\), with \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\); there exists a universal \(C_0\gt 0\) such that every such function satisfies

\[ \operatorname {Inf}(f)\leq \sqrt n\, \bigl(2^k\log (\max \{ n,2\} )\bigr)^{C_0k\log (\max \{ k,2\} )}. \]

In addition, for every fixed \(k\in \mathbb N\) with \(k\gt 0\), there exist a real \(C_k\geq 0\) and a natural number \(d_k\) such that every dimension \(n\in \mathbb N\), every degree-at-most-\(k\) polynomial threshold function \(f\) and every \(0\lt \delta \leq 1/2\) satisfy

\[ \operatorname {NS}_{\delta }(f)\leq C_k\sqrt\delta \, \bigl(\log (1/\delta )\bigr)^{d_k}. \]

Here \(\operatorname {Inf}(f)=\sum _{i=1}^{n}\Pr _X[f(X)\neq f(X^{\{ i\} })]\), \(X\) is uniform, \(X^{\{ i\} }\) flips coordinate \(i\), \(\operatorname {NS}_{\delta }(f)=\Pr [f(X)\neq f(Y)]\) when \(Y\) independently flips each coordinate of \(X\) with probability \(\delta \), and \(\log \) is the natural logarithm.

Theorem 329.38 Uniform stability of polynomial thresholds
✓

For every fixed \(k\in \mathbb N\), including \(k=0\), the degree-at-most-\(k\) polynomial threshold functions form a uniformly noise-stable family: there exists \(\varepsilon :\mathbb R\to \mathbb R\) with \(0\leq \varepsilon (\delta )\leq 1\) for \(0\leq \delta \leq 1/2\) and \(\lim _{\delta \to 0^{+}}\varepsilon (\delta )=0\) such that

\[ \Pr [f(X)\neq f(Y)]\leq \varepsilon (\delta ) \]

for every \(n\in \mathbb N\), \(0\lt \delta \leq 1/2\) and \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) admitting a representation \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) with a real multilinear polynomial \(p\) of degree at most \(k\). Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\), \(X\) is uniform on \(\{ 0,1\} ^{n}\) and \(Y\) independently flips each coordinate of \(X\) with probability \(\delta \).