Answers are grounded in this paper and cite their sources.
The onto functional pigeonhole principle with $n+k$ pigeons and n holes has a polynomialcalculus refutation of degree $1$ over Fₚ when p k, and one of degreepvₚ(k) in general, by a criterion of Riis. We study the lower bound when p dividesk. In Lean~4 we prove that the degree is exactly p when p divides k exactly once(n≥2p-3), at least $p+1$ when p² divides k (n≥2p-1), and at least $5$ for $p=2$,$k=8$ (n≥7). With written proofs that rest on named published theorems and have beenchecked by AI reviewers but not by people, we show that the degree is exactly pvₚ(k)for n≥2pvₚ(k)-1, so that for surplus p^ it grows as p^; we give twofurther mechanisms, one through Nullstellensatz designs (degree at least 2^ withexplicit thresholds) and one degree by degree (exact degree p² when vₚ(k)=2); and werecord five errata in two of the sources these proofs use, among them a gap in the publishedproof of a theorem we would otherwise have used. Every statement carries itsevidence tier. All results were produced by AI research agents under the author's direction.
No takes yet. Share an insight, caveat, or question.
Björn Lindheim (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: