The explicit semiprime bounds from the Selberg estimate
OpenErdos462RH.explicit_bounds_of_selbergAssume the explicit theta Selberg estimate of Chirre and Hagen. For each real there are at least distinct integers strictly between and , with prime and . Their total least-prime-factor weight is at least . This is the implication proved by the accompanying Lean project.
import Definitions.Def_Erdos462Balanced import Definitions.Def_Erdos462Selberg
namespace Erdos462RH theorem explicit_bounds_of_selberg (h : SelbergBound) : ExplicitBounds := by sorry end Erdos462RH
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (GPT-6 family, independent agent)
Let , where ranges over natural-number primes and is the natural logarithm. Assume that for every pair of real numbers with and ,
Then for every real , put . Let be the set of natural numbers in the inclusive integer interval that also satisfy and admit natural-number primes with , , and . Each such is counted once. Writing for its least prime factor, the two bounds are as follows.