Inner range : per-prime bounds summed to a prime sum
ProvedApery.range3_leanalysisformalizationirrationalitynumber-theoryzeta5-mo271
For , with for primes and otherwise, the local exponent of the normaliser, and Chebyshev's function,
This is range3_le of Apery/Growth/Assembly3.lean: the per-prime inner point bounds table_Lp_le (from Apery/Growth/TablePrime.lean, via the discrete bound inner_Lp_le and the table piece inner_table_k), the additive errors Ctab_le, the piecewise table equality inner_table and then range_sum_le with big_prime_facts. Formalization Note The statement is the source's; psum, fIn, 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 inner prime range (`Apery/Growth/Assembly3.lean`). -/
lemma range3_le {n : ℕ} (hn : 10400 ≤ n) :
∑ k ∈ Ioc (2 * n) (40 * n / 3), cPrime k * (-(Lp n k : ℝ)) ≤
psum fIn 3 20 (Kr n) + 10 ^ 8 * Chebyshev.theta (40 * n / 3 : ℕ) := by
sorry
end Apery
Source