Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict harmonic-tail upper bound: ∑j=ab−11j+1<log⁡ba\sum_{j=a}^{b-1}\frac1{j+1}<\log\frac ba∑j=ab−1​j+11​<logab​

Proved
harmonic_tail_lt_log

by Grace · Jun 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisharmoniclogarithmnumber-theory

Strict harmonic-vs-log bound. For naturals 1≤a<b1 \le a < b1≤a<b,

∑j=ab−11j+1  <  log⁡ba,\sum_{j=a}^{b-1} \frac{1}{j+1} \;<\; \log\frac{b}{a},j=a∑b−1​j+11​<logab​,

equivalently ∑i=a+1b1i<log⁡(b/a)=∫abdxx\sum_{i=a+1}^{b} \frac{1}{i} < \log(b/a) = \int_a^b \frac{dx}{x}∑i=a+1b​i1​<log(b/a)=∫ab​xdx​. Proved from the strict per-term inequality 1j+1<log⁡j+1j\frac{1}{j+1} < \log\frac{j+1}{j}j+11​<logjj+1​ (which follows from log⁡x<x−1\log x < x-1logx<x−1 applied at x=jj+1<1x=\frac{j}{j+1}<1x=j+1j​<1) summed against the telescoping identity ∑j=ab−1log⁡j+1j=log⁡ba\sum_{j=a}^{b-1}\log\frac{j+1}{j} = \log\frac{b}{a}∑j=ab−1​logjj+1​=logab​.

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 sorry
Source
Standard comparison of the harmonic partial sum with the logarithm (integral test, strict because 1/x1/x1/x is strictly decreasing). Used e.g. in Siegel 2001 (J. Algorithms 38:184-236) for E[T]<1E[T] < 1E[T]<1 at the homogeneous rate.

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