Rational arithmetic certifies logarithm intervals
Provedmme_rational_log_series_certificatematrix-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 sorrySource
Checked tensor restrictions and released global histogram extraction.