Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fact D.3 — both binary entropy bounds, with endpoints

Proved
EliasGlobalClock.LowerBound.binary_entropy_bounds

by mikedeng1 · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

information-theoryleader-electionp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability

For 0≤x≤10\le x\le10≤x≤1, let h(x)=−xln⁡x−(1−x)ln⁡(1−x)h(x)=-x\ln x-(1-x)\ln(1-x)h(x)=−xlnx−(1−x)ln(1−x), with h(0)=h(1)=0h(0)=h(1)=0h(0)=h(1)=0. Then both inequalities hold:

h(x)≤2ln⁡(x+1−x)≤2x(1−x).h(x)\le 2\ln\bigl(\sqrt x+\sqrt{1-x}\bigr)\le2\sqrt{x(1-x)}.h(x)≤2ln(x​+1−x​)≤2x(1−x)​.

All logarithms are natural and both constants are exactly 222. The statement includes both endpoints. These estimates relate a coordinate's binary entropy to the contention weight in Lemma 4.2.

Differences from the source:

  • encoding: the binary entropy h with h(0)=h(1)=0 → Mathlib Real.binEntropy on the closed unit interval; reason: its natural-log and zero-mass conventions agree exactly with the source
Preamble
import Mathlib
Formal statement
namespace EliasGlobalClock.LowerBound

/-- Fact D.3, printed p.36 / PDF p.37, including x=0 and x=1. -/
theorem binary_entropy_bounds (x : ℝ) (hx0 : 0 ≤ x) (hx1 : x ≤ 1) :
    Real.binEntropy x ≤ 2 * Real.log (Real.sqrt x + Real.sqrt (1 - x)) ∧
    2 * Real.log (Real.sqrt x + Real.sqrt (1 - x)) ≤
      2 * Real.sqrt (x * (1 - x)) := by sorry

end EliasGlobalClock.LowerBound
Source
Kuowen Chen, Shengquan Du, Tsvi Kopelowitz, Seth Pettie, Ben Plosk, STOC 2027 submission #1311 (October 2026), printed p.36, PDF p.37, Fact D.3 (proof continues on printed p.37, PDF p.38); https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1311.pdf
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 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