## Abstract

Given a function f : [N]k ! [M]k, the Z-test is a three query test for checking if a function f is a direct product, namely if there are functions g1, . . . gk : [N] ! [M] such that f(x1, . . . , xk) = (g1(x1), . . . gk(xk)) for every input x 2 [N]k. This test was introduced by Impagliazzo et. al. (SICOMP 2012), who showed that if the test passes with probability ϵ > exp(- p k) then f is (ϵ) close to a direct product function in some precise sense. It remained an open question whether the soundness of this test can be pushed all the way down to exp(-k) (which would be optimal). This is our main result: we show that whenever f passes the Z test with probability ϵ > exp(-k), there must be a global reason for this: namely, f must be close to a product function on some (ϵ) fraction of its domain. Towards proving our result we analyze the related (two-query) V-test, and prove a "restricted global structure" theorem for it. Such theorems were also proven in previous works on direct product testing in the small soundness regime. The most recent work, by Dinur and Steurer (CCC 2014), analyzed the V test in the exponentially small soundness regime. We strengthen their conclusion of that theorem by moving from an "in expectation" statement to a stronger "concentration of measure" type of statement, which we prove using hyper-contractivity. This stronger statement allows us to proceed to analyze the Z test. We analyze two variants of direct product tests. One for functions on ordered tuples, as above, and another for functions on sets, f : [N] k ! [M]k. The work of Impagliazzo et. al was actually focused only on functions of the latter type, i.e. on sets. We prove exponentially small soundness for the Z-test for both variants. Although the two appear very similar, the analysis for tuples is more tricky and requires some additional ideas.

Original language | English |
---|---|

Title of host publication | 32nd Computational Complexity Conference, CCC 2017 |

Editors | Ryan O'Donnell |

Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |

Pages | 29:1-29:50 |

Number of pages | 50 |

Volume | 79 |

ISBN (Electronic) | 9783959770408 |

ISBN (Print) | 3959770405 |

DOIs | |

State | Published - 1 Aug 2017 |

Event | 32nd Computational Complexity Conference, CCC 2017 - Riga, Latvia Duration: 6 Jul 2017 → 9 Jul 2017 |

### Publication series

Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Volume | 79 |

ISSN (Print) | 1868-8969 |

### Conference

Conference | 32nd Computational Complexity Conference, CCC 2017 |
---|---|

Country/Territory | Latvia |

City | Riga |

Period | 6/07/17 → 9/07/17 |

## Keywords

- Agreement
- Direct Product Testing
- Property Testing

## All Science Journal Classification (ASJC) codes

- Software