OAI/NumberTheory/EgyptianFractions/ChebyshevUpperSharp.lean
8 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.Problem337.ChebyshevUpperSharp.upperConstantline 12Source documentation
The classical upper Chebyshev constant, approximately
1.10555.def upperConstant : ℝ := 6 * ChebyshevLowerSharp.lowerConstant / 5
- lemma
OAI.Problem337.ChebyshevUpperSharp.upperConstant_posline 14 - lemma
OAI.Problem337.ChebyshevUpperSharp.upperConstant_lt_1106_div_1000line 19 - theorem
OAI.Problem337.ChebyshevUpperSharp.eventually_psi_upperline 25Source documentation
The exact finite dilation recurrence and the factorial ratio limit give the classical sharp elementary upper coefficient for
psi.theorem eventually_psi_upper (ε : ℝ) (hε : 0 < ε) : ∀ᶠ N : ℕ in atTop, Chebyshev.psi N ≤ (upperConstant + ε) * (N : ℝ) := by … - theorem
OAI.Problem337.ChebyshevUpperSharp.eventually_theta_upperline 41 - theorem
OAI.Problem337.ChebyshevUpperSharp.eventually_primeCounting_upper_of_thetaline 50Source documentation
The classical partial-summation remainder is already lower order. Hence an improved eventual coefficient for
thetatransfers without a fixed loss to the actual prime counting function.theorem eventually_primeCounting_upper_of_theta (c ε : ℝ) (hε : 0 < ε) (hθ : ∀ᶠ N : ℕ in atTop, Chebyshev.theta N ≤ c * (N : ℝ)) : ∀ᶠ N : ℕ in atTop, (Nat.primeCounting N : ℝ) ≤ (c + ε) * (N : ℝ) / Real.log (N : ℝ) := by … - theorem
OAI.Problem337.ChebyshevUpperSharp.eventually_primeCounting_upperline 74Source documentation
The classical upper Chebyshev coefficient transfers to actual primes.
theorem eventually_primeCounting_upper (ε : ℝ) (hε : 0 < ε) : ∀ᶠ N : ℕ in atTop, (Nat.primeCounting N : ℝ) ≤ (upperConstant + ε) * (N : ℝ) / Real.log (N : ℝ) := by … - theorem
OAI.Problem337.ChebyshevUpperSharp.eventually_primeCounting_upper_1106line 84