Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rational dyadic bounds for finite entropy

Proved
mme_entropy_dyadic_bounds

by Robertboy18 · Sep 23, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

matrix-multiplicationregional-extraction

For any nonnegative finite function, dyadic logarithm bounds give upper and lower entropy estimates, including zero atoms. The full matrix exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_dyadic_neg_log_bounds
import Definitions.Def_mme_regional_entropy_rate_data
open scoped BigOperators
open MME.RegionRate
Formal statement
theorem mme_entropy_dyadic_bounds {W : Type*} [Fintype W]
    (p : W → ℝ) (hp : ∀ w, 0 ≤ p w) (k : W → ℕ) :
    (∑ w, p w * ((k w : ℝ) * (693147180 / 1000000000 : ℝ) + 1 -
      2 ^ k w * p w)) ≤ entropy p ∧
    entropy p ≤ ∑ w, p w * ((k w : ℝ) * (693147181 / 1000000000 : ℝ) - 1 +
      (2 ^ k w * p w)⁻¹) := by sorry
Source
Kernel-checked regional count identities and exact extraction with empty regions.

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