English

Constant Degree Direct Product Testers with Small Soundness

Computational Complexity 2024-07-18 v3 Combinatorics

Abstract

Let XX be a dd-dimensional simplicial complex. A function F ⁣:X(k){0,1}kF\colon X(k)\to \{0,1\}^k is said to be a direct product function if there exists a function f ⁣:X(1){0,1}f\colon X(1)\to \{0,1\} such that F(σ)=(f(σ1),,f(σk))F(\sigma) = (f(\sigma_1), \ldots, f(\sigma_k)) for each kk-face σ\sigma. In an effort to simplify components of the PCP theorem, Goldreich and Safra introduced the problem of direct product testing, which asks whether one can test if F ⁣:X(k){0,1}kF\colon X(k)\to \{0,1\}^k is correlated with a direct product function by querying FF on only 22 inputs. Dinur and Kaufman conjectured that there exist bounded degree complexes with a direct product test in the small soundness regime. We resolve their conjecture by showing that for all δ>0\delta>0, there exists a family of high-dimensional expanders with degree Oδ(1)O_{\delta}(1) and a 22-query direct product tester with soundness δ\delta. We use the characterization given by a subset of the authors and independently by Dikstein and Dinur, who showed that some form of non-Abelian coboundary expansion (which they called "Unique-Games coboundary expansion") is a necessary and sufficient condition for a complex to admit such direct product testers. Our main technical contribution is a general technique for showing coboundary expansion of complexes with coefficients in a non-Abelian group. This allows us to prove that the high dimensional expanders constructed by Chapman and Lubotzky satisfies the necessary conditions, thus admitting a 2-query direct product tester with small soundness.

Cite

@article{arxiv.2402.00850,
  title  = {Constant Degree Direct Product Testers with Small Soundness},
  author = {Mitali Bafna and Noam Lifshitz and Dor Minzer},
  journal= {arXiv preprint arXiv:2402.00850},
  year   = {2024}
}
R2 v1 2026-06-28T14:34:57.246Z