Exponential lower bounds for the pigeonhole principle

In this paper we prove an exponential lower bound on the size of bounded-depth Frege proofs for the pigeonhole principle (PHP). We also obtain an Ω(loglogn)-depth lower bound for any polynomial-sized Frege proof of the pigeonhole principle. Our theorem nearly completes the search for the exact complexity of the PHP, as S. Buss has constructed polynomial-size, logn-depth Frege proofs for the PHP. The main lemma in our proof can be viewed as a general Håstad-style Switching Lemma for restrictions that are partial matchings. Our lower bounds for the pigeonhole principle improve on previous superpolynomial lower bounds.

[1]  Samuel R. Buss,et al.  The deduction rule and linear and near-linear proof simulations , 1993, Journal of Symbolic Logic.

[2]  Toniann Pitassi,et al.  Approximation and Small-Depth Frege Proofs , 1992, SIAM J. Comput..

[3]  Jan Kra,et al.  Lower Bounds to the Size of Constant-depth Propositional Proofs , 1994 .

[4]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[5]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[6]  Jan Krajícek,et al.  Lower bounds to the size of constant-depth propositional proofs , 1994, Journal of Symbolic Logic.

[7]  Jan Krajícek,et al.  Exponential Lower Bounds for the Pigeonhole Principle , 1992, STOC.

[8]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[9]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[10]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[11]  James F. Lynch,et al.  A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In , 1986, Cybersecurity and Cyberforensics Conference.

[12]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[13]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[14]  Samuel R. Buss.  Polynomial Size Proofs of the Propositional Pigeonhole Principle , 1987, J. Symb. Log..

[15]  Miklós Ajtai,et al.  The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[16]  Johan Håstad,et al.  Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.

[17]  Paul Beame.  Lower bounds for recognizing small cliques on CRCW PRAM's , 1990, Discret. Appl. Math..

[18]  Jeff B. Paris,et al.  Provability of the Pigeonhole Principle and the Existence of Infinitely Many Primes , 1988, J. Symb. Log..

[19]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.