TCSLib

119 Boolean Analysis — Restriction Card Tail

119.1 Overview

Under a Bernoulli(\(p\))-random restriction with free-coordinate set \(J\), the count \(\left\lvert U \cap J\right\rvert \) of free coordinates inside a fixed set \(U\) behaves like a \(\mathrm{Binomial}(\left\lvert U\right\rvert , p)\) variable. This module computes its first and second moments from the marginal \(\Pr [T \subseteq J] = p^{\left\lvert T\right\rvert }\) and derives the elementary Chebyshev lower-tail bounds \(\Pr [\left\lvert U \cap J\right\rvert \lt k] \le 3/(4k)\) and \(\Pr [\left\lvert U \cap J\right\rvert \ge k] \ge 1/4\) used by the restriction \(\Rightarrow \) Fourier-concentration transfer (O’Donnell Lemma 4.21), together with the complement rule for Bernoulli-restriction probabilities.

119.2 Declarations

Lemma 119.1 Indicator of a subset lying among free variables as a coordinate product
✓

Let \(\rho \) be a restriction on \(n\) variables — a map assigning each index \(i \in \{ 0,\dots ,n-1\} \) either a fixed Boolean value or the free mark — and let \(T \subseteq \{ 0,\dots ,n-1\} \). Then the indicator of the event that every index in \(T\) is free under \(\rho \) factors as a product over all \(n\) coordinates:

\[ \mathbf{1}\bigl[\, T \subseteq \{ i : \rho (i)\ \text{is free}\} \, \bigr] \; =\; \prod _{i=0}^{n-1} c_i, \]

where the factor \(c_i\) equals \(\mathbf{1}[\rho (i)\ \text{is free}]\) when \(i \in T\) and equals \(1\) otherwise.

Theorem 119.2 Free-set marginal of a Bernoulli restriction
✓

Fix \(n \in \mathbb {N}\), a real parameter \(p\), and a subset \(T \subseteq \{ 1, \dots , n\} \) of the coordinates. Draw a Bernoulli(\(p\)) random restriction \(\rho \) on \(n\) variables, and write \(J\) for its set of free variables (the coordinates \(\rho \) leaves unset). Then the probability that every coordinate of \(T\) is left free is

\[ \Pr \bigl[\, T \subseteq J\, \bigr] \; =\; p^{\left\lvert T\right\rvert }, \]

that is, the total Bernoulli weight of those restrictions whose free variables include \(T\) equals \(p^{\left\lvert T\right\rvert }\).

Lemma 119.3 Free-variable count as a sum of indicators
✓

Let \(\rho \) be a restriction on \(n\) variables, and let \(U \subseteq \{ 1,\dots ,n\} \) be a set of indices. Then the number of indices in \(U\) at which \(\rho \) is free (unset), viewed as a real number, equals

\[ \left\lvert U \cap J\right\rvert = \sum _{i \in U} \mathbf{1}[\rho (i)\ \text{is free}], \]

where \(J\) is the set of free variables of \(\rho \) and each summand is \(1\) when \(\rho (i)\) is unset and \(0\) otherwise.

Lemma 119.4 Total Bernoulli weight of restrictions leaving a coordinate free
✓

Fix a real parameter \(p\) and a coordinate \(i\) among the \(n\) variables. Summing the Bernoulli weight of \(\rho \) over all restrictions \(\rho \) on \(n\) variables that leave \(i\) free — that is, those for which \(i\) is a free variable of \(\rho \) — gives

\[ \sum _{\rho \, :\, i \text{ free in } \rho } p^{\, |F(\rho )|}\left(\tfrac {1-p}{2}\right)^{\, n-|F(\rho )|} = p, \]

where \(F(\rho )\) denotes the set of free variables of \(\rho \).

Lemma 119.5 Probability that two fixed coordinates are both free
✓

Fix \(n\) and two distinct variables \(i \neq j\) among the \(n\) variables, and let \(p \in \mathbb {R}\). Write \(w_p(\rho )\) for the Bernoulli weight of a restriction \(\rho \) on \(n\) variables, namely \(p^{k}\left(\tfrac {1-p}{2}\right)^{n-k}\) where \(k\) is the number of free variables of \(\rho \). Then, summing over all such restrictions, the total weight carried by those \(\rho \) that leave both \(i\) and \(j\) free equals \(p^2\); that is,

\[ \sum _{\rho } w_p(\rho )\, \mathbf{1}[\rho (i)\text{ free}]\, \mathbf{1}[\rho (j)\text{ free}] = p^2. \]
Lemma 119.6 First moment of the free-variable count under a Bernoulli restriction
✓

Fix \(n\) and a real number \(p\), and let \(\rho \) range over all restrictions on the \(n\) variables, each weighted by its Bernoulli weight \(w_p(\rho )\). Writing \(J(\rho )\) for the set of free variables of \(\rho \), then for every set \(U\) of variables,

\[ \sum _{\rho } w_p(\rho )\, \left\lvert U \cap J(\rho )\right\rvert \; =\; p\, \left\lvert U\right\rvert . \]

Equivalently, when \(0 \le p \le 1\) so that \(w_p\) is a probability distribution, the expected number of free variables landing in \(U\) is \(p\, \left\lvert U\right\rvert \).

Lemma 119.7 Second moment of the free-coordinate count
✓

Fix \(n \in \mathbb {N}\), a parameter \(p \in \mathbb {R}\), and a set of coordinates \(U \subseteq \mathrm{Fin}\, n\). For a restriction \(\rho \) on \(n\) variables write \(J(\rho )\) for its set of free variables. Summing over all such restrictions, each weighted by its Bernoulli weight, one has

\[ \sum _{\rho } p^{\left\lvert J(\rho )\right\rvert }\left(\tfrac {1-p}{2}\right)^{\, n - \left\lvert J(\rho )\right\rvert } \left\lvert U \cap J(\rho )\right\rvert ^2 \; =\; p\, \left\lvert U\right\rvert + p^2\bigl(\left\lvert U\right\rvert ^2 - \left\lvert U\right\rvert \bigr). \]
Lemma 119.8 Variance of the free-coordinate count
✓

Let \(0 \le p \le 1\), and let \(U \subseteq \mathrm{Fin}\, n\) be a set of coordinates. For a restriction \(\rho \) on \(n\) variables, write \(w_p(\rho )\) for its Bernoulli weight and \(F(\rho )\) for its set of free variables. Then the \(w_p\)-weighted average, over all restrictions \(\rho \) on \(n\) variables, of the squared deviation of \(\left\lvert U \cap F(\rho )\right\rvert \) from \(p\left\lvert U\right\rvert \) satisfies

\[ \sum _{\rho }\, w_p(\rho )\, \bigl(p\left\lvert U\right\rvert - \left\lvert U \cap F(\rho )\right\rvert \bigr)^2 \; =\; p\, \left\lvert U\right\rvert \, (1 - p). \]
Theorem 119.9 Lower-tail bound for free coordinates in a set
✓

Let \(p \in \mathbb {R}\) satisfy \(0 \le p \le 1\), let \(U \subseteq \mathrm{Fin}\, n\) be a finite set of coordinates, and let \(k\) be a positive integer with \(3k \le p\, \left\lvert U\right\rvert \). Writing \(J\) for the set of free variables of a Bernoulli(\(p\))-random restriction \(\rho \) on \(n\) variables, the probability that fewer than \(k\) coordinates of \(U\) remain free satisfies

\[ \Pr \bigl[\, \left\lvert U \cap J\right\rvert \lt k\, \bigr] \; \le \; \frac{3}{4k}. \]
Lemma 119.10 Complement rule for the Bernoulli restriction measure
✓

Fix \(n\) and a parameter \(p\) with \(0 \le p \le 1\), and consider the Bernoulli(\(p\)) random restriction on \(n\) variables, under which each restriction \(\rho \) receives weight \(p^{k}\, \bigl(\tfrac {1-p}{2}\bigr)^{\, n-k}\), where \(k\) is the number of free variables of \(\rho \). For any decidable predicate \(E\) on restrictions, writing \(\Pr [E]\) for the total weight of the restrictions satisfying \(E\), the probability that \(E\) fails equals one minus the probability that \(E\) holds:

\[ \Pr [\lnot E] = 1 - \Pr [E]. \]
Theorem 119.11 Lower bound on the free coordinates within a set
✓

Fix \(n\) and a parameter \(p\) with \(0 \le p \le 1\), let \(U \subseteq \mathrm{Fin}\, n\) be a set of coordinates, and let \(k \ge 1\) be an integer satisfying \(3k \le p\, \left\lvert U\right\rvert \). Draw a Bernoulli(\(p\)) random restriction \(\rho \) on \(n\) variables, and let \(J\) denote its set of free variables. Then

\[ \Pr \bigl[\, k \le \left\lvert U \cap J\right\rvert \, \bigr] \; \ge \; \frac{1}{4}. \]