Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rational dyadic bounds for negative logarithms

Proved
mme_dyadic_neg_log_bounds

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

matrix-multiplicationregional-extraction

For every positive real number, rescaling by any nonnegative power of two gives rationally anchored upper and lower bounds for its negative logarithm. The full matrix exponent bound remains a separate obligation.

Preamble
import Mathlib.Analysis.Complex.ExponentialBounds
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
Formal statement
theorem mme_dyadic_neg_log_bounds (x : ℝ) (hx : 0 < x) (k : ℕ) :
    (k : ℝ) * (693147180 / 1000000000 : ℝ) + 1 - 2 ^ k * x ≤ -Real.log x ∧
    -Real.log x ≤ (k : ℝ) * (693147181 / 1000000000 : ℝ) - 1 +
      (2 ^ k * x)⁻¹ := 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