Robin conditional upper bound (Lagarias Proposition 3.1)
OpenLeanEval.NumberTheory.lagarias_robin_upper_boundAssume the Riemann hypothesis. For every natural number ,
Here is Euler's constant. This is the non-strict formulation in Lagarias's Proposition 3.1, attributed there to Robin's Theorem 1. It is a major conditional analytic theorem to formalize, not an assumption made available for free and not a request to prove RH.
import Mathlib.NumberTheory.ArithmeticFunction.Misc import Mathlib.NumberTheory.Harmonic.Defs import Mathlib.NumberTheory.LSeries.RiemannZeta import Mathlib.NumberTheory.Harmonic.EulerMascheroni open scoped ArithmeticFunction.sigma
namespace LeanEval.NumberTheory
theorem lagarias_robin_upper_bound (hRH : RiemannHypothesis) (n : ℕ) (hn : 5041 ≤ n) :
((σ 1 n : ℕ) : ℝ) ≤
Real.exp Real.eulerMascheroniConstant * (n : ℝ) * Real.log (Real.log (n : ℝ)) := by sorry
end LeanEval.NumberTheory
Read-back
What the Lean code literally says, in plain math · gpt-6-astra
Assume the Riemann hypothesis in the following precise form: every satisfying , for every natural number , and has real part , where is the Riemann zeta function. Then, for every natural number with , the sum of its positive divisors, regarded as a real number, satisfies , where is the Euler–Mascheroni constant and denotes the natural logarithm. The lower bound on excludes and ensures both logarithms have positive arguments.
Confirmed by the mission captain (proposal self-audit).