Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finite range and equality case through 5040

Proved
LeanEval.NumberTheory.lagarias_finite_range

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

lagariasnumber-theoryriemann-hypothesis

For each integer 1≤n≤50401\le n\le50401≤n≤5040, let σ(n)\sigma(n)σ(n) be the sum of its positive divisors. Then

σ(n)≤Hn+exp⁡(Hn)log⁡(Hn),\sigma(n)\le H_n+\exp(H_n)\log(H_n),σ(n)≤Hn​+exp(Hn​)log(Hn​),

and equality holds if and only if n=1n=1n=1. This is the bounded verification reported in the proof of Theorem 1.1, not the universal criterion. Its formal proof must certify the real exponential and logarithm comparisons; floating-point evidence alone is insufficient.

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_finite_range (n : ℕ) (hn : 0 < n) (hbound : n ≤ 5040) :
    (((σ 1 n : ℕ) : ℝ) ≤ (harmonic n : ℝ) +
      Real.exp (harmonic n : ℝ) * Real.log (harmonic n : ℝ)) ∧
      ((((σ 1 n : ℕ) : ℝ) = (harmonic n : ℝ) +
      Real.exp (harmonic n : ℝ) * Real.log (harmonic n : ℝ)) ↔ n = 1) := 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. 8, proof of Theorem 1.1, finite verification (unnumbered).
Read-back

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

For every natural number nnn with 0<n≤50400<n\le 50400<n≤5040, let σ1(n)=∑d∣n, d>0d\sigma_1(n)=\sum_{d\mid n,\ d>0}dσ1​(n)=∑d∣n, d>0​d be the sum of its positive divisors and let Hn=∑j=1n1/jH_n=\sum_{j=1}^{n}1/jHn​=∑j=1n​1/j, regarded as a real number. Then σ1(n)≤Hn+exp⁡(Hn)log⁡(Hn)\sigma_1(n)\le H_n+\exp(H_n)\log(H_n)σ1​(n)≤Hn​+exp(Hn​)log(Hn​), and σ1(n)=Hn+exp⁡(Hn)log⁡(Hn)\sigma_1(n)=H_n+\exp(H_n)\log(H_n)σ1​(n)=Hn​+exp(Hn​)log(Hn​) if and only if n=1n=1n=1, where exp⁡\expexp is the real exponential and log⁡\loglog is the natural logarithm. The range includes both n=1n=1n=1 and n=5040n=5040n=5040 and excludes n=0n=0n=0; throughout this range Hn>0H_n>0Hn​>0.

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