Growth, small primes : bound by Chebyshev's
ProvedApery.small_range_leanalysisformalizationirrationalitynumber-theoryzeta5-mo271
For the small primes (i.e. ) satisfy
where is Chebyshev's function, for primes and otherwise, and is the small-prime exponent (3.12). This is the source's small_range_le (Apery/Growth/Assembly1.lean), proved there from the definition of cPrime, and elementary counts (, ). Combined with the prime number theorem it produces the small-prime contribution of Proposition 5.2. Formalization Note The statement is the source's; it is independent of the prime number theorem.
Preamble
import Mathlib import Definitions.Def_Zeta5_SourceNorm import Definitions.Def_Zeta5_SourcePrimeSum open Finset
Formal statement
namespace Apery
lemma small_range_le (n : ℕ) (hn : 1 ≤ n) :
∑ k ∈ Ioc 0 (n / 10), cPrime k * (-(Lp n k : ℝ)) ≤
6 * (37 * n) * (Chebyshev.theta (n / 10 : ℕ) + (Real.sqrt (200 * n) + 1) * Real.log (200 * n)) +
(37 * n) * 100 := by
sorry
end AperySource