Table of Contents
Fetching ...

On Approximability of Satisfiable $k$-CSPs: VI

Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer

TL;DR

A restriction inverse theorem is proved that if a random restriction of f down to $\delta n$ coordinates is $\delta$-correlated with a product function with probability at least $\delta$, then f is $2^{-\textsf{poly}(\log(1/\delta))}$-correlated with a function of the form $L\cdot P$, where $L$ is a function of degree $\textsf{poly}(1/

Abstract

We prove local and global inverse theorems for general $3$-wise correlations over pairwise-connected distributions. Let $μ$ be a distribution over $Σ\times Γ\times Φ$ such that the supports of $μ_{xy}$, $μ_{xz}$, and $μ_{yz}$ are all connected, and let $f: Σ^n \to \mathbb{C}$, $g: Γ^n \to \mathbb{C}$, $h: Φ^n \to \mathbb{C}$ be $1$-bounded functions satisfying \[ \left|\mathbb{E}_{(x,y,z) \sim μ^{\otimes n}}[f(x)g(y)h(z)]\right| \geq \varepsilon. \] In this setting, our local inverse theorem asserts that there is $δ:=\textsf{exp}(-\varepsilon^{-O_μ(1)})$ such that with probability at least $δ$, a random restriction of $f$ down to $δn$ coordinates $δ$-correlates to a product function. To get a global inverse theorem, we prove a restriction inverse theorem for general product functions, stating that if a random restriction of $f$ down to $δn$ coordinates is $δ$-correlated with a product function with probability at least $δ$, then $f$ is $2^{-\textsf{poly}(\log(1/δ))}$-correlated with a function of the form $L\cdot P$, where $L$ is a function of degree $\textsf{poly}(1/δ)$, $\|L\|_2\leq 1$, and $P$ is a product function. We show applications to property testing and to additive combinatorics. In particular, we show the following result via a density increment argument. Let $Σ$ be a finite set and $S \subseteq Σ\times Σ\times Σ$ such that: (1) $(x, x, x) \in S$ for all $x \in S$, and (2) the supports of $S_{xy}$, $S_{xz}$, and $S_{yz}$ are all connected. Then, any set $A \subseteq Σ^n$ with $|Σ|^{-n}|A| \geq Ω((\log \log \log n)^{-c})$ contains $x, y, z \in A$, not all equal, such that $(x_i,y_i,z_i) \in S$ for all $i$. This gives the first reasonable bounds for the restricted 3-AP problem over finite fields.

On Approximability of Satisfiable $k$-CSPs: VI

TL;DR

A restriction inverse theorem is proved that if a random restriction of f down to coordinates is -correlated with a product function with probability at least , then f is -correlated with a function of the form , where is a function of degree $\textsf{poly}(1/

Abstract

We prove local and global inverse theorems for general -wise correlations over pairwise-connected distributions. Let be a distribution over such that the supports of , , and are all connected, and let , , be -bounded functions satisfying \[ \left|\mathbb{E}_{(x,y,z) \sim μ^{\otimes n}}[f(x)g(y)h(z)]\right| \geq \varepsilon. \] In this setting, our local inverse theorem asserts that there is such that with probability at least , a random restriction of down to coordinates -correlates to a product function. To get a global inverse theorem, we prove a restriction inverse theorem for general product functions, stating that if a random restriction of down to coordinates is -correlated with a product function with probability at least , then is -correlated with a function of the form , where is a function of degree , , and is a product function. We show applications to property testing and to additive combinatorics. In particular, we show the following result via a density increment argument. Let be a finite set and such that: (1) for all , and (2) the supports of , , and are all connected. Then, any set with contains , not all equal, such that for all . This gives the first reasonable bounds for the restricted 3-AP problem over finite fields.

Paper Structure

This paper contains 53 sections, 54 theorems, 206 equations.

Key Result

Theorem 1

Let $\alpha>0$, let $\Sigma,\Gamma,\Phi$ be finite alphabets, and let $\mu$ be a pairwise-connected distribution over $\Sigma\times\Gamma\times\Phi$ in which the probability of each atom is at least $\alpha$. Then for every $\varepsilon>0$ there exist $d\in\mathbb{N}$ and $\delta>0$ such that the fo then there exist $L\colon \Sigma^n\to\mathbb{C}$ of degree at most $d$ and $\|L\|_2\leqslant 1$, an

Theorems & Definitions (117)

  • Definition 1.1
  • Definition 1.2
  • Theorem 1
  • Definition 1.3: Random restriction
  • Theorem 2
  • Remark
  • Theorem 3
  • Theorem 4
  • Definition 1.4
  • Definition 1.5: Swap inner product and swap norm
  • ...and 107 more