Finite range and equality case through 5040
ProvedLeanEval.NumberTheory.lagarias_finite_rangelagariasnumber-theoryriemann-hypothesis
For each integer , let be the sum of its positive divisors. Then
and equality holds if and only if . 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 with , let be the sum of its positive divisors and let , regarded as a real number. Then , and if and only if , where is the real exponential and is the natural logarithm. The range includes both and and excludes ; throughout this range .
Human review
Confirmed by the mission captain (proposal self-audit).