Prove2Me’s refined tournament sensitivity family
$\mathrm{bs}\ge\mathrm{s}^{\alpha-o(1)}$, $\alpha=\log(14055^8)/\log(3738277295413674)=2.1308255793978239\ldots$.
total
Description
The accepted public theorem SensitivityPrimitiveCampaign.reach_source_q5_3738277295413674_strict refines the nested tournament construction. It uses a single binary tournament labelling with ordinary defect cutoffs $(24,31,38,44,50,55)$ and source cutoff $22$, followed by an exact recursive Boolean profile. The theorem states, without construction hypotheses, that for every $\varepsilon>0$ and $S\ge2$ there is a finite total Boolean function with $\mathrm{s}\ge S$ and $\mathrm{bs}\ge\mathrm{s}^{\alpha-\varepsilon}$. The exact logarithmic quotient, rather than its rounded decimal, is the endpoint.
Cited as a witness by
-
\(\mathrm{bs}(f_j)=\Omega(\mathrm{s}(f_j)^{2.130825579397823})\)
-
\(\mathrm{fbs}(f_j)=\Omega(\mathrm{s}(f_j)^{2.130825579397823})\)
-
\(\mathrm{RC}(f_j)=\Omega(\mathrm{s}(f_j)^{2.130825579397823})\)
-
\(\mathrm{bs}(f_j)=\Omega(\lambda(f_j)^{2.130825579397823})\)
-
\(\mathrm{fbs}(f_j)=\Omega(\lambda(f_j)^{2.130825579397823})\)
-
\(\mathrm{RC}(f_j)=\Omega(\lambda(f_j)^{2.130825579397823})\)
Notes
The campaign and linked theorem were inspected on October 22, 2026. Prove2Me marks the theorem Proved (October 20), with human endorsements on October 21. This records the source’s verification status; the zoo has not independently rebuilt the Lean proof. The statement gives arbitrarily large sensitivity and arbitrarily small exponent loss, not a loss-free endpoint inequality on every member of a prescribed one-parameter family.