Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rational arithmetic certifies logarithm intervals

Proved
mme_rational_log_series_certificate

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

matrix-multiplicationtensor-extraction

Two finite rational inequalities certify a real logarithm enclosure, including both series remainders and integer scaling. The root exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_dyadic_log_series_bounds
open scoped BigOperators
Formal statement
theorem mme_rational_log_series_certificate
    (q : ℚ) (hq : 0 < q) (k : ℤ) (n : ℕ) (lower upper : ℚ) :
    let t := ((2 : ℚ) ^ k * q - 1) / ((2 : ℚ) ^ k * q + 1)
    let twoCenter := 2 * ∑ i ∈ Finset.range n, (1 / 3 : ℚ) ^ (2 * i + 1) / (2 * i + 1)
    let twoError := 2 * ((1 / 3 : ℚ) ^ (2 * n + 1) / (1 - (1 / 3 : ℚ) ^ 2))
    let center := (2 * ∑ i ∈ Finset.range n, t ^ (2 * i + 1) / (2 * i + 1)) -
      (k : ℚ) * twoCenter
    let error := 2 * (|t| ^ (2 * n + 1) / (1 - t ^ 2)) + |(k : ℚ)| * twoError
    lower ≤ center - error → center + error ≤ upper →
      (lower : ℝ) ≤ Real.log (q : ℝ) ∧ Real.log (q : ℝ) ≤ (upper : ℝ) := by sorry
Source
Checked tensor restrictions and released global histogram extraction.

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