Unconditional V01-independence of a certified hitting-set principle
Martin Kolář
Abstract
We show that a certified formalization of the hitting-set-existence axiom of Atserias and Tzameret, instantiated on the parity-based Nisan-Wigderson compression class of Khaniki, is independent of the two-sorted theory V01 of AC0-reasoning, unconditionally: V01 proves neither it nor its negation. The same holds for the corresponding certified dual weak pigeonhole principle, whose refutation is witnessed by a single seed that certified-computes every string of the model simultaneously. The mechanism is a bounded-arithmetic transfer of Atserias-Tzameret's reduction from hitting sets to the dual weak pigeonhole principle: the amplification half of that reduction, the sole source of its NP-oracle, is unnecessary at the native stretch of the Nisan-Wigderson map, and the compression half becomes a V01-provable implication once circuit evaluation is replaced by its certified ΣB0 unfolding. This is, to our knowledge, the first independence result for a derandomization-flavoured existence principle at the AC0-reasoning level, and it makes explicit the bridge between the Khaniki Nisan-Wigderson line and the Atserias-Tzameret reverse mathematics of hitting sets.
Create a lesson
Related papers
An Optimal Separation Between Certificate Complexity and Approximate Degree
Kaspars Balodis
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
Gregory Morse
A note on the Σ2P-completeness of the Frobenius number
Thomas Rothvoss
The Complexity of Coverability-Like Problems in Elementary Object Systems: Data-Nets to the Rescue
Francesco Di Cosmo, Soumodev Mal, Tephilla Prince
It's Hard to PArcK
Kyle Burke, Jeffrey Leman, Craig Tennenhouse
Hardness of Approximation of Rank Aggregation on Ulam Metric
Sk Ruhul Azgor, Diptarka Chakraborty, Le Van Cuong et al.