Outer range : per-prime bounds summed to a prime sum
ProvedApery.range4_leanalysisformalizationirrationalitynumber-theoryzeta5-mo271
For , with for primes and otherwise, the local exponent of the normaliser, , and Chebyshev's function,
This is range4_le of Apery/Growth/Assembly3.lean: the per-prime outer point bounds outer_Lp_le (from Apery/Growth/OuterPrime.lean) and the additive errors Cout_le are summed over the range with range_sum_le and big_prime_facts. Formalization Note The statement is the source's; psum, Eout, Lp, cPrime, Kr are the platform definitions.
Preamble
import Mathlib import Definitions.Def_Zeta5_SourceGrowth import Definitions.Def_Zeta5_SourceGrowthTables import Definitions.Def_Zeta5_SourcePrimeSum import Definitions.Def_Zeta5_SourceConstants import Definitions.Def_Zeta5_SourceNorm open Finset
Formal statement
namespace Apery
/-- The outer prime range (`Apery/Growth/Assembly3.lean`). -/
lemma range4_le {n : ℕ} (hn : 10400 ≤ n) :
∑ k ∈ Ioc (40 * n / 3) (2 * (37 * n)), cPrime k * (-(Lp n k : ℝ)) ≤
psum Eout (20 / 37) 3 (Kr n) + 10 ^ 5 * Chebyshev.theta (2 * (37 * n) : ℕ) := by
sorry
end Apery
Source