Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Harmonic upper comparison (Lagarias Lemma 3.2)

Proved
LeanEval.NumberTheory.lagarias_harmonic_upper_bound

by xuanji · Sep 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

lagariasnumber-theoryriemann-hypothesis

Let γ\gammaγ be Euler's constant. For every natural number n≥20n\ge20n≥20,

Hn+exp⁡(Hn)log⁡(Hn)≤eγnlog⁡log⁡n+7nlog⁡n.H_n+\exp(H_n)\log(H_n)\le e^\gamma n\log\log n+\frac{7n}{\log n}.Hn​+exp(Hn​)log(Hn​)≤eγnloglogn+logn7n​.

This unconditional upper estimate retains both the source's numerical constant and its threshold; neither is an assumed asymptotic placeholder.

Preamble
import Mathlib.NumberTheory.ArithmeticFunction.Misc
import Mathlib.NumberTheory.Harmonic.Defs
import Mathlib.NumberTheory.LSeries.RiemannZeta
import Mathlib.NumberTheory.Harmonic.EulerMascheroni

open scoped ArithmeticFunction.sigma
Formal statement
namespace LeanEval.NumberTheory

theorem lagarias_harmonic_upper_bound (n : ℕ) (hn : 20 ≤ n) :
    (harmonic n : ℝ) +
      Real.exp (harmonic n : ℝ) * Real.log (harmonic n : ℝ) ≤
      Real.exp Real.eulerMascheroniConstant * (n : ℝ) * Real.log (Real.log (n : ℝ)) +
        7 * (n : ℝ) / Real.log (n : ℝ) := by sorry

end LeanEval.NumberTheory
Source
Jeffrey C. Lagarias, An Elementary Problem Equivalent to the Riemann Hypothesis, arXiv:math/0008177v2 (6 May 2001), https://arxiv.org/abs/math/0008177v2, p. 7, Lemma 3.2, equation (3.7).
Read-back

What the Lean code literally says, in plain math · gpt-6-astra

For every natural number nnn with n≥20n\ge 20n≥20, let Hn=∑k=1n1/kH_n=\sum_{k=1}^{n}1/kHn​=∑k=1n​1/k, regarded as a real number, and let γ=lim⁡m→∞(Hm−log⁡(m+1))\gamma=\lim_{m\to\infty}(H_m-\log(m+1))γ=limm→∞​(Hm​−log(m+1)) be the Euler–Mascheroni constant. Then Hn+eHnlog⁡Hn≤eγnlog⁡(log⁡n)+7n/log⁡nH_n+e^{H_n}\log H_n\le e^\gamma n\log(\log n)+7n/\log nHn​+eHn​logHn​≤eγnlog(logn)+7n/logn, where log⁡\loglog denotes the natural logarithm. The hypothesis excludes n=0n=0n=0 and ensures that all logarithm arguments and the denominator log⁡n\log nlogn in this inequality are positive.

Human review
  • Endorsed by Shuze Chen · Sep 6, 2026

  • Endorsed by xuanji · Sep 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me