An $\epsilon$-test for any non-trivial property (one for which there are both satisfying inputs and inputs of large distance from the property) should use a number of queries that is at least inversely proportional in $\epsilon$. However, to the best of our knowledge there is no reference proof for this intuition. Such a proof is provided here. It is written so as to not require any prior knowledge of the related literature, and in particular does not use Yao's method.

翻译：对于任何非平凡性质（即既存在满足该性质的输入，又存在与该性质距离较大的输入）的$\epsilon$测试，其所需的查询次数至少与$\epsilon$成反比。然而，据我们所知，目前尚无针对这一直觉的参考证明。本文提供了这样一个证明。该证明的撰写方式使其不需要读者具备任何相关文献的先验知识，尤其不涉及Yao方法的使用。