Separation exponent at least from coupled target and guard profiles
ProvedSensitivityCampaign.reach_21301_coupledblock-sensitivityboolean-functionscoupled-profilemultiple-defect-labelingsensitivitysensitivity-21301
For every real and every integer , there exist a natural number and a total Boolean function satisfying
Sensitivity and block sensitivity are maximized over all inputs, and the sensitive blocks are nonempty and pairwise disjoint. The dimension and function may depend on and . The exact exponent is . In particular, setting gives the fixed exponent with arbitrarily large sensitivity.
Preamble
import Mathlib import Definitions.Def_SensitivityCampaign import Theorems.Thm_SensitivityCampaign_finite_certificate import Theorems.Thm_SensitivityCampaign_finite_certificate_log open OAI.Paper320
Formal statement
theorem SensitivityCampaign.reach_21301_coupled :
SensitivityCampaign.AchievesExponent (2.1301 : ℝ) := by sorrySource
Original multiple-defect labeling and coupled target/guard periodic construction developed for yousofy with Codex (2026-10-20), with fifteen nested predicates, K=14207, R=7922, G=201838849 and C=32057676379612508934192581. The proof includes every new combinatorial lemma and actual Boolean-family assembly. It retains the generic nested-predicate tournament foundation and attribution from Robin Kothari and Codex, accepted 2.075 proof, Prove2Me submission 819ad4c6-aa25-48ca-82e9-c8df39c182c0, https://prove2.me/theorems/49fdd176-c319-4f1e-b15f-b1fd5130f0bc. Accepted preceding checkpoints: https://prove2.me/theorems/cf005af0-93b2-44c1-991f-ddab41d85874 and https://prove2.me/theorems/e9d89148-5d69-4758-8795-53a8de4c8bfc.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.