Balanced products in the strict interval
DefinitionErdos462BalancedCount distinct integers , where and are primes and . The set used in the explicit theorem imposes both and . The assertion called ExplicitBounds puts simultaneous lower bounds on the cardinality and on the total weight of this set for real .
import Definitions.Def_Erdos462Window
namespace Erdos462RH
open scoped BigOperators
def Balanced (x : ℝ) (n : ℕ) : Prop :=
x < (n : ℝ) ∧ ∃ p q : ℕ, p.Prime ∧ q.Prime ∧ n = p*q ∧
Real.sqrt x / 2 < q ∧ (q : ℝ) < Real.sqrt x ∧ Real.sqrt x < p ∧
(p : ℝ) < 3 * Real.sqrt x
noncomputable def products (x : ℝ) : Finset ℕ := by
classical exact (window 384 x).filter (Balanced x)
noncomputable def interiorProducts (x : ℝ) : Finset ℕ := by
classical exact (products x).filter (fun n => (n:ℝ) < x + width 384 x)
def ExplicitBounds : Prop := ∀ x : ℝ, 96*10^36 ≤ x →
(14/3)*Real.sqrt x ≤ ((interiorProducts x).card:ℝ) ∧
14/9 ≤ ∑ n ∈ interiorProducts x, weight n
end Erdos462RH
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (GPT-6 family, independent agent)
Balanced. For any real number and any natural number (including ), is balanced at if and only if and there exist natural primes such that and . All four factor bounds are strict. In particular, , and no satisfies the definition when , since and the real square root used here is for negative .
Products. For each real , put , with the natural logarithm. The resulting finite set consists of the distinct natural numbers in the inclusive interval from to for which and there exist natural primes satisfying and . Thus is always excluded, while an integer equal to is included if it satisfies the factor conditions and exceeds . The elements are the numbers , each occurring once. The set is empty for .
Interior products. For each real , put , with the natural logarithm. The resulting finite set consists exactly of the distinct natural numbers such that and there exist natural primes satisfying and . Both window endpoints are excluded even when they are integers. Each product value occurs once, and the set is empty for .
Explicit bounds. This is the proposition that for every real the following two inequalities hold simultaneously. Let be the set of distinct natural numbers such that , where is the natural logarithm, and such that for some natural primes satisfying . Then and , where is the least prime factor of . The cardinality is compared as a real number, and the sum has one real term per distinct , equal to . The threshold is included, and both bounds concern the same set with both window endpoints excluded.