Rational dyadic bounds for negative logarithms
Provedmme_dyadic_neg_log_boundsmatrix-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 sorrySource
Kernel-checked regional count identities and exact extraction with empty regions.