Separation exponent at least 2.0635
OpenSensitivityCampaign.reach_20635_coupled_tournamentFor every positive real and every integer , there exist a finite number of input coordinates and a total Boolean function such that
Here and are the maximum sensitivity and block sensitivity over all inputs, using the campaign's existing definitions. The exponent is exact. The quantifier over requires arbitrarily large sensitivity.
An analytic proof and a standalone exact-integer certificate are supplied in the mission description. Full Lean verification of the Boolean construction remains outstanding.
import Mathlib import Definitions.Def_SensitivityCampaign import Theorems.Thm_SensitivityCampaign_finite_certificate import Theorems.Thm_SensitivityCampaign_finite_certificate_log open OAI.Paper320
theorem SensitivityCampaign.reach_20635_coupled_tournament :
SensitivityCampaign.AchievesExponent (2.0635 : ℝ) := by sorryRead-back
What the Lean code literally says, in plain math · GPT-6 / Codex
For every positive real ε and every integer S≥2, there exist a finite number n of Boolean input coordinates and a total Boolean function f on those coordinates such that its maximum sensitivity is at least S and its maximum block sensitivity is at least s(f)^(2.0635−ε). The quantifiers require arbitrarily large sensitivity; this is not merely one finite example. The theorem makes no upper-bound claim. The decimal 2.0635 denotes the exact rational 4127/2000 in ℝ.
Confirmed by the mission captain (proposal self-audit).