Balanced semiprimes in every sufficiently large window under RH
OpenErdos462RH.explicit_bounds_under_rhAssume classical RH. For each real there are at least distinct integers strictly between and , with prime and . Their total least-prime-factor weight is at least .
import Definitions.Def_Erdos462Balanced
namespace Erdos462RH theorem explicit_bounds_under_rh (h : RiemannHypothesis) : ExplicitBounds := by sorry end Erdos462RH
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (GPT-6 family, independent agent)
Assume the Riemann hypothesis for the Riemann zeta function, that every nontrivial zero has real part . Then for every real , including equality, let be the set of distinct natural numbers strictly between and , where is the natural logarithm, for which there exist natural primes satisfying and . Both and hold, where is the least prime factor of . The cardinality is compared as a real number. Each distinct integer contributes once to the count and once to the real sum, with weight because . Both window endpoints and all factor bounds are strict.