TCSLib

125 Boolean Analysis — Low Degree Obstruction

125.1 Overview

This file completes the counting half of the Razborov–Smolensky \(\mathrm{MOD}\, q\) lower bound over the root cube \(\{ 1,\omega \} ^n \subseteq K^n\). It introduces a concrete finite candidate family — squarefree polynomials whose supports all have size at most \(D\) — proves that it is complete for degree-\(\le D\) polynomials on the cube, counts the cube, the candidate family, and Hamming balls of functions, and combines these into an explicit obstruction to low-degree approximation of the product \(\prod _i x_i\).

125.2 Declarations

Definition 125.1 Low-degree squarefree supports
✓
#

For \(n, D \in \mathbb {N}\), the type of supports of squarefree monomials of degree at most \(D\): the subtype of finsets \(s \subseteq \mathrm{Fin}\, n\) with \(\left\lvert s\right\rvert \le D\). In the displays below this type is written \(\mathcal{S}_{n,D}\).

Definition 125.2 Low-degree squarefree polynomial from coefficients
✓

Given coefficients \(c\) indexed by \(\texttt{RazborovSmolensky.LowDegreeSupport}\ n\ D\), the multivariate polynomial

\[ \sum _{\substack {s \subseteq \mathrm{Fin}\, n \\ \left\lvert s\right\rvert \le D}} c(s)\, \prod _{i \in s} X_i , \]

i.e. the sum of the squarefree monomials \(\texttt{RazborovSmolensky.squarefreeMonomial}\ s\) weighted by \(c\), with the terms of support size \(\gt D\) set to \(0\).

Theorem 125.3 Squarefree polynomial representation on the root cube
✓

Let \(K\) be a field, fix an element \(\omega \in K\), and let \(n\) be a natural number. Write \(\{ 1,\omega \} ^n\) for the set of vectors \(x = (x_1,\dots ,x_n)\) with each coordinate \(x_i \in \{ 1,\omega \} \). Then for every function \(f : \{ 1,\omega \} ^n \to K\) there exist coefficients \(c_S \in K\), indexed by the subsets \(S \subseteq \{ 1,\dots ,n\} \), such that the squarefree (multilinear) polynomial

\[ P(X_1,\dots ,X_n) \; =\; \sum _{S} c_S \prod _{i \in S} X_i \]

satisfies \(P(x) = f(x)\) for every \(x \in \{ 1,\omega \} ^n\).

Theorem 125.4 Low-degree monomials multilinearize on the root cube
✓

Let \(K\) be a field and let \(\omega \in K\) satisfy \(\omega \ne 1\). Fix \(n, D \in \mathbb {N}\), and consider a monomial \(a\, X^m\) in the variables \(X_1,\dots ,X_n\) over \(K\), given by an exponent vector \(m : \mathrm{Fin}\, n \to \mathbb {N}\) and a coefficient \(a \in K\), whose total degree \(\sum _i m_i\) is at most \(D\). Then there exist coefficients \(c : \mathcal{S}_{n,D} \to K\), indexed by the squarefree supports \(s \subseteq \mathrm{Fin}\, n\) with \(\left\lvert s\right\rvert \le D\), such that the squarefree polynomial \(\sum _{\left\lvert s\right\rvert \le D} c(s)\prod _{i \in s} X_i\) takes the same value as \(a\, X^m\) at every point \(x\) of the root cube \(\{ 1,\omega \} ^n\).

Lemma 125.5 Additivity of the coefficient-to-polynomial map
✓

Fix a field \(K\) and natural numbers \(n\) and \(D\), and let \(\mathcal{S}_{n,D}\) be the set of subsets \(s \subseteq \mathrm{Fin}\, n\) with \(\left\lvert s\right\rvert \le D\). For a coefficient function \(c \colon \mathcal{S}_{n,D} \to K\), write \(P(c) = \sum _{s \in \mathcal{S}_{n,D}} c(s)\, \prod _{i \in s} X_i\) for the associated squarefree polynomial in \(K[X_i : i \in \mathrm{Fin}\, n]\). Then for any two coefficient functions \(c_1, c_2 \colon \mathcal{S}_{n,D} \to K\) one has

\[ P(c_1 + c_2) = P(c_1) + P(c_2), \]

where \(c_1 + c_2\) denotes the pointwise sum.

Lemma 125.6 Zero coefficients yield the zero polynomial
✓

Let \(K\) be a field and let \(n, D \in \mathbb {N}\). Applying the low-degree squarefree polynomial construction to the identically zero coefficient function on \(\mathcal{S}_{n,D}\) produces the zero element of the polynomial ring \(K[X_0, \dots , X_{n-1}]\); that is,

\[ \sum _{\substack {s \subseteq \mathrm{Fin}\, n \\ \left\lvert s\right\rvert \le D}} 0 \cdot \prod _{i \in s} X_i \; =\; 0 . \]
Lemma 125.7 Additivity in the coefficients
✓

Fix a field \(K\) and natural numbers \(n, D\), and write \(\mathcal{S}_{n,D}\) for the type of subsets \(s \subseteq \mathrm{Fin}\, n\) with \(\left\lvert s\right\rvert \le D\). For a coefficient function \(c \colon \mathcal{S}_{n,D} \to K\), let \(P(c)\) denote the multivariate polynomial \(\sum _{s \in \mathcal{S}_{n,D}} c(s)\, \prod _{i \in s} X_i\) over \(K\) in the variables \(X_0, \dots , X_{n-1}\). Then for any finite index set \(S\) and any family of coefficient functions \((c_i)_{i \in S}\) with each \(c_i \colon \mathcal{S}_{n,D} \to K\), the polynomial built from the pointwise sum of coefficients equals the sum of the individual polynomials:

\[ P\! \left(\sum _{i \in S} c_i\right) = \sum _{i \in S} P(c_i). \]
Theorem 125.8 Completeness of low-degree squarefree polynomials on the root cube
✓

Let \(K\) be a field and let \(\omega \in K\) satisfy \(\omega \ne 1\). For natural numbers \(n\) and \(D\), write \(\{ 1,\omega \} ^n\) for the set of vectors \(x : \mathrm{Fin}\, n \to K\) each of whose coordinates equals \(1\) or \(\omega \), and let \(\mathcal{S}_{n,D}\) be the collection of finsets \(s \subseteq \mathrm{Fin}\, n\) with \(\left\lvert s\right\rvert \le D\). Then for every polynomial \(Q \in K[X_i : i \in \mathrm{Fin}\, n]\) of total degree at most \(D\), there exist coefficients \(c : \mathcal{S}_{n,D} \to K\) such that the squarefree polynomial \(\sum _{\left\lvert s\right\rvert \le D} c(s)\, \prod _{i \in s} X_i\) agrees with \(Q\) at every point of \(\{ 1,\omega \} ^n\).

Lemma 125.9 Total degree bound for a low-degree squarefree polynomial
✓

Let \(K\) be a field and fix \(n, D \in \mathbb {N}\). For any assignment of coefficients \(c \colon \mathcal{S}_{n,D} \to K\), indexed by the subsets \(s \subseteq \mathrm{Fin}\, n\) with \(\left\lvert s\right\rvert \le D\), the polynomial

\[ \sum _{\substack {s \subseteq \mathrm{Fin}\, n \\ \left\lvert s\right\rvert \le D}} c(s)\, \prod _{i \in s} X_i \in K[X_0, \dots , X_{n-1}] \]

has total degree at most \(D\).

Definition 125.10 Support-to-sigma injection
✓

The map sending a low-degree support \(s\) to the pair consisting of its exact cardinality \(\left\lvert s\right\rvert \in \mathrm{Fin}(D+1)\) together with \(s\) itself, viewed as an element of \(\{ t : \mathrm{Finset}(\mathrm{Fin}\, n) \mid \left\lvert t\right\rvert = \left\lvert s\right\rvert \} \). It is used as an injection for the binomial-sum bound rather than as a full equivalence.

Theorem 125.11 Binomial-sum bound on low-degree supports
✓

For natural numbers \(n\) and \(D\), let \(\mathcal{S}_{n,D}\) denote the (finite) type of low-degree squarefree supports on \(\mathrm{Fin}\, n\), that is, the subsets \(s \subseteq \mathrm{Fin}\, n\) with \(\left\lvert s\right\rvert \le D\). Then the number of such supports satisfies

\[ \left\lvert \mathcal{S}_{n,D}\right\rvert \; \le \; \sum _{t=0}^{D} \binom {n}{t}. \]
Lemma 125.12 Cardinality of the space of coefficient functions
✓
#

Fix natural numbers \(n\) and \(D\), and write \(\mathcal{S}_{n,D}\) for the type of supports of squarefree monomials of degree at most \(D\) in \(n\) variables. For any finite type \(K_0\), the number of functions from \(\mathcal{S}_{n,D}\) to \(K_0\) is

\[ \left\lvert \mathcal{S}_{n,D} \to K_0\right\rvert \; =\; \left\lvert K_0\right\rvert ^{\, \left\lvert \mathcal{S}_{n,D}\right\rvert }. \]
Definition 125.13 Root cube as Boolean strings
✓

If \(\omega \ne 1\), the explicit equivalence \(\{ 1,\omega \} ^n \simeq (\mathrm{Fin}\, n \to \mathrm{Fin}\, 2)\) that records, for each coordinate, whether its value is \(1\) or \(\omega \).

Lemma 125.14 Cardinality of the root cube
✓

Let \(K\) be a finite field and let \(\omega \in K\) with \(\omega \ne 1\). Then the root cube \(\{ 1,\omega \} ^n\), consisting of those vectors \(x : \mathrm{Fin}\, n \to K\) with \(x_i \in \{ 1,\omega \} \) for every coordinate \(i\), has exactly \(2^n\) elements.

Lemma 125.15 Counting functions on the root-of-unity cube
✓

Let \(K\) be a finite field, let \(\omega \in K\) with \(\omega \ne 1\), and let \(n \in \mathbb {N}\). Writing \(\{ 1,\omega \} ^n\) for the set of vectors \(x : \mathrm{Fin}\, n \to K\) each of whose coordinates equals \(1\) or \(\omega \), the number of functions \(\{ 1,\omega \} ^n \to K\) is

\[ \left\lvert K\right\rvert ^{\, 2^n}. \]
Theorem 125.16 Hamming-ball bound for function spaces
✓

Let \(\alpha \) and \(\beta \) be finite types, fix a function \(\mathrm{center} : \alpha \to \beta \), and let \(e \in \mathbb {N}\). Then the number of functions \(f : \alpha \to \beta \) that disagree with \(\mathrm{center}\) on at most \(e\) points of \(\alpha \) — that is, for which \(\left\lvert \{ a \in \alpha : \mathrm{center}(a) \ne f(a)\} \right\rvert \le e\) — satisfies

\[ \left\lvert \{ \, f : \alpha \to \beta \; :\; \left\lvert \{ a \in \alpha : \mathrm{center}(a) \ne f(a)\} \right\rvert \le e \, \} \right\rvert \; \le \; \sum _{t=0}^{e} \binom {\left\lvert \alpha \right\rvert }{t}\, \left\lvert \beta \right\rvert ^{\, t}. \]
Theorem 125.17 Volume bound for a Hamming ball on the root cube
✓

Let \(K\) be a finite field, let \(\omega \in K\), and let \(n, e \in \mathbb {N}\). Write \(\{ 1,\omega \} ^n\) for the root cube of vectors \(x : \{ 0,\dots ,n-1\} \to K\) each of whose coordinates equals \(1\) or \(\omega \), and consider functions \(f : \{ 1,\omega \} ^n \to K\), the Hamming distance between two such functions being the number of points of the cube on which they differ. For any function \(\mathrm{center} : \{ 1,\omega \} ^n \to K\), the number of functions whose Hamming distance from \(\mathrm{center}\) is at most \(e\) satisfies

\[ \left\lvert \{ \, f : \{ 1,\omega \} ^n \to K \; \mid \; f \text{ differs from } \mathrm{center} \text{ on at most } e \text{ points}\, \} \right\rvert \; \le \; \sum _{t=0}^{e} \binom {\, \left\lvert \{ 1,\omega \} ^n\right\rvert \, }{t}\, \left\lvert K\right\rvert ^{\, t}, \]

where \(\left\lvert \{ 1,\omega \} ^n\right\rvert \) is the number of points of the cube and \(\left\lvert K\right\rvert \) is the number of elements of \(K\).

Let \(K\) be a finite field, let \(\omega \in K\) satisfy \(\omega \neq 1\), and fix natural numbers \(n, D, e, B\). Suppose the ball bound

\[ \sum _{t=0}^{e} \binom {2^n}{t}\, \left\lvert K\right\rvert ^{\, t} \; \le \; B \]

holds, together with the strict counting inequality

\[ \left\lvert K\right\rvert ^{\, 2^n} \; \gt \; \left\lvert \mathcal{S}_{n,D} \to K\right\rvert \cdot B . \]

Then it is not the case that every function \(f : \{ 1,\omega \} ^n \to K\) admits a multivariate polynomial \(Q \in K[X_i : i \in \mathrm{Fin}\, n]\) of total degree at most \(D\) that disagrees with \(f\) on at most \(e\) points of the cube \(\{ 1,\omega \} ^n\); that is, some \(f\) fails to be approximated in this sense by any such \(Q\).

Theorem 125.19 No low-degree approximation of the coordinate product on the root cube
✓

Let \(K\) be a finite field and let \(\omega \in K\) satisfy \(\omega \neq 0\) and \(\omega \neq 1\), and fix natural numbers \(n, d, e, B\). Suppose that

\[ \sum _{t=0}^{e} \binom {2^{n}}{t}\, \left\lvert K\right\rvert ^{t} \; \le \; B \]

and that

\[ \left\lvert K\right\rvert ^{2^{n}} \; \gt \; \left\lvert \, \mathcal{S}_{n,\lfloor n/2\rfloor + d} \to K\, \right\rvert \cdot B , \]

where \(\left\lvert \mathcal{S}_{n,\lfloor n/2\rfloor + d} \to K\right\rvert \) is the number of functions from \(\mathcal{S}_{n,\lfloor n/2\rfloor + d}\) to \(K\). Then there is no polynomial \(P \in K[X_1,\dots ,X_n]\) of total degree at most \(d\) whose bad count against the coordinate product \(x \mapsto \prod _{i} x_i\) on the root cube \(\{ 1,\omega \} ^{n}\) is at most \(e\); that is, every such \(P\) disagrees with \(\prod _i x_i\) at more than \(e\) points of \(\{ 1,\omega \} ^n\).