Strict harmonic-tail upper bound:
Provedharmonic_tail_lt_loganalysisharmoniclogarithmnumber-theory
Strict harmonic-vs-log bound. For naturals ,
equivalently . Proved from the strict per-term inequality (which follows from applied at ) summed against the telescoping identity .
Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Algebra.BigOperators.Intervals set_option autoImplicit false open scoped BigOperators open Finset
Formal statement
theorem harmonic_tail_lt_log (a b : ℕ) (ha : 1 ≤ a) (hab : a < b) :
(∑ j ∈ Finset.Ico a b, (1 : ℝ) / (j + 1)) < Real.log ((b:ℝ) / a) := by sorrySource
Standard comparison of the harmonic partial sum with the logarithm (integral test, strict because is strictly decreasing). Used e.g. in Siegel 2001 (J. Algorithms 38:184-236) for at the homogeneous rate.