The existing twenty-two-level construction achieves exponent 2.13981365
ProvedSensitivityCampaign.reach_213981365block-sensitivityboolean-functionsfinite-certificatessensitivity
The sensitivity versus block-sensitivity separation holds at the exact exponent
For every positive real number and every integer threshold , there are a natural number and a total Boolean function such that
This sharpens the published exponent 2.13981 extracted from the existing twenty-two-level seed family. It uses that family's already proved sensitivity growth bound and block-sensitivity growth bound . It introduces no new graph, labeling, profile recurrence, or seed construction.
Preamble
import Definitions.Def_SensitivityCampaign
Formal statement
theorem SensitivityCampaign.reach_213981365 :
SensitivityCampaign.AchievesExponent (213981365 / 100000000 : ℝ) := by sorrySource
Numerical sharpening of the already Proved theorem Sensitivity213981.actual_seeds, https://prove2.me/theorems/e4a62ddd-b529-418d-98c1-9e04556d9a83, whose exact seed bounds are s(f_m)<=10^15*10121928^m and bs(f_m)>=(5591^4)^m. The previously published endpoint is SensitivityCampaign.reach_213981, https://prove2.me/theorems/0e93b146-3cac-42d3-b8f4-74010d06b636. The asymptotic passage uses the Proved SensitivityCampaign.finite_certificate, https://prove2.me/theorems/06deb432-c715-4a68-b79d-3078b3bc9a09. The new arithmetic certificate is 10121928^37665 < 5591^70408, verified in the Lean kernel. The logarithmic overhead argument adapts SensitivityProfileCycleGrowth.achieves_strict in the existing workspace, retaining its attribution to submission a9d25c46-43bd-4fb1-826b-0ed075b8cf0a by yousofy with Codex and the underlying community construction.