Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sensitivity separation 2.13519: goal

Proved
SensitivityCampaign.reach_213519

by yousofy · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

block-sensitivitysensitivitysensitivity-first-two-20261025

For every real ε>0\varepsilon>0ε>0 and natural sensitivity threshold S≥2S\ge2S≥2, there is a total Boolean function fff with s(f)≥Ss(f)\ge Ss(f)≥S and bs(f)≥s(f)213519/100000−εbs(f)\ge s(f)^{213519/100000-\varepsilon}bs(f)≥s(f)213519/100000−ε. This is the campaign proposition for the exact rational exponent 213519/100000213519/100000213519/100000.

Preamble
import Definitions.Def_SensitivityCampaign
set_option autoImplicit false
Formal statement
theorem SensitivityCampaign.reach_213519 : SensitivityCampaign.AchievesExponent (213519/100000 : ℝ) := by sorry
Source
Verified attached Lean checkpoint, Endpoint16CampaignComplete.lean and Endpoint16Mission.lean; https://prove2.me/campaigns/block-sensitivity-vs-sensitivity
Human review
  • Endorsed by Shuze Chen · Oct 28, 2026

    Confirmed by the moderator at approval.

  • Endorsed by yousofy · Oct 28, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me