Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

[Full] Theorem 6.4 — pure-gap inequality: G≥0G\ge0G≥0 on the whole retained box RSR_SRS​, S=10−4S=10^{-4}S=10−4

Open
MIBF.Balanced.full_theorem_6_4

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

bellman-inequalitycourtade-kumarp2o-gran-per-chapterp2o-plan-bookp2o-v1

Bits throughout; S=10−4S=10^{-4}S=10−4. For every (a,c,e,f)(a,c,e,f)(a,c,e,f) with

0≤a≤c≤12,a+c≥S,0<e≤H(a),0<f≤H(c)0\le a\le c\le\tfrac12,\qquad a+c\ge S,\qquad 0<e\le H(a),\qquad 0<f\le H(c)0≤a≤c≤21​,a+c≥S,0<e≤H(a),0<f≤H(c)

(a point of RSR_SRS​: a canonical feasible tuple with positive entropy coordinates, the seam a+c=Sa+c=Sa+c=S and the entropy caps included), the pure gap at the tuple (μu,μw,eu,ew)=(a,c,e,f)(\mu_u,\mu_w,e_u,e_w)=(a,c,e,f)(μu​,μw​,eu​,ew​)=(a,c,e,f) is nonnegative:

G(a,c,e,f)=L4−Rϕ ≥ 0.G(a,c,e,f)=L_4-R_\phi\ \ge\ 0 .G(a,c,e,f)=L4​−Rϕ​ ≥ 0.

By the mean reflection of [Full] Lemma 4.1 and label exchange, every positive-entropy tuple whose lower-half distances satisfy a+c≥Sa+c\ge Sa+c≥S is carried to such a point, so this is the pure-gap half of the balanced Bellman inequality.

Differences from the source:

  • reading: "The analytic reductions, the boundary and stationary-point estimates of Theorem 3.16, and Theorem 3.22 imply that …" → only the mathematical conclusion is stated; reason: those results are proved in the paper, and as hypotheses they would make the statement conditional.
  • reading: "every canonical feasible tuple with a+c≥Sa+c\ge Sa+c≥S and positive entropy coordinates" → every point of RSR_SRS​; reason: the canonical chart is 0≤a≤c≤120\le a\le c\le\tfrac120≤a≤c≤21​ ([Full] p. 29) and feasibility is e≤H(a)e\le H(a)e≤H(a), f≤H(c)f\le H(c)f≤H(c).
Preamble
import Mathlib
import Definitions.Def_MIBF_Balanced_PureGap
Formal statement
namespace MIBF.Balanced
theorem full_theorem_6_4 (a c e f : ℝ) (h : InRS a c e f) :
    0 ≤ pureGap a c e f := by sorry
end MIBF.Balanced
Source
Chen, Gohari, Javanmard, Lin, Mirrokni, Nair, Woodruff, A Proof of the Most Informative Boolean Function Conjecture, arXiv:2609.24931 (held version, sha256 35793b82…1f9f), [Full] = arXiv:2609.24931v2 reproduced in the held PDF, [Full] p. 35 (PDF 57), Theorem 6.4; canonical chart and R_S [Full] p. 29 (PDF 51)
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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