Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms

摘要

We show that the known bounded-depth proofs of the Weak Pigeonhole Principle (PHP{sub}n){sup}(2n) in size n{sup}(O(log(n))) are not optimal in terms of size. More precisely, we give a size-depth trade-off upper bound: there are proofs of size n{sup}(O(d(log(n))){sup}(2/d)) and depth O(d). This solves an open problem of Maciel et al. (Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, 2000). Our technique requires formalizing the ideas underlying Nepomnjascij's Theorem which might be of independent interest. Moreover, our result implies a proof of the unboundedness of primes in ho with a provably weaker 'large number assumption' than previously needed.