The selected GapMCSP magnification frontier #
This module exposes the exact lower-bound antecedent of the selected
Oliveira--Pich--Santhanam magnification theorem. It keeps a fixed denominator
constant, the small-positive-beta quantifier, and the eventual input-length
circuit lower bound separate. It does not assert the conditional class
separation. Of the anti-checker construction, only the circuit-assembly half is
proved (AntiCheckerLemma.hasGenerators_of_hasApproximateCounterFamilies: correct
approximate-counter families yield the generators). Deriving
HasApproximateCounterFamilies from NP ⊆ P/poly, and the solver and
magnification steps, remain to be formalized.
The small-positive-beta lower bound is equivalently witnessed by one
positive cutoff.
Eventual-in-input-length lower bounds for all small beta imply the
corresponding pointwise lower bounds for all small beta.
Explicit cutoff form of the complete selected lower-bound antecedent at a fixed denominator constant.
The complete eventual lower-bound hypothesis also yields a positive solver
exponent with pointwise lower bounds throughout a small-beta tail.