Compare the upper integrals
ProvedLL_Decomp1525c.high_comparenumber-theory
Assume for every real , where is Chebyshev's prime logarithm sum. For every real , .
Preamble
import Mathlib import Definitions.Def_LL_Decomp1525c_P1V import Definitions.Def_LL_Decomp1525c_thetaI open Finset Real MeasureTheory intervalIntegral open scoped Classical
Formal statement
namespace LL_Decomp1525c
theorem high_compare
(h215 : ∀ y : ℝ, 678407 ≤ y → |Chebyshev.theta y - y| < y / (40 * Real.log y))
(x : ℝ) (hx : 10 ^ 52 ≤ x) :
|(∫ u in x..(2 * x), thetaI x u / Real.log u) - ∫ u in x..(2 * x), (2 * x - u) / Real.log u|
≤ x ^ 2 / (20 * Real.log x ^ 2) := by sorry
end LL_Decomp1525cSource
R. C. Vaughan, On the estimation of Schnirelman's constant, J. reine angew. Math. 290, 1977, pp. 93 to 108, p. 103, proof of Lemma 11. https://doi.org/10.1515/crll.1977.290.93
Read-back
What the Lean code literally says, in plain math · claude-haiku
Assume h215: for every real , , Mathlib's Chebyshev.theta. Then for real : . For the lower condition is automatic, so over primes . and , so no junk values. Non-strict; conditional on h215, which is assumed, not proved.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.