Growth: the lower-order terms are
ProvedApery.low_orderanalysisformalizationirrationalitynumber-theoryzeta5-mo271
For every and all large ,
This is the source's low_order (Apery/Growth.lean). It absorbs the elementary error terms of the four prime ranges of the growth estimate for the normaliser: the square-root counting term and the of the small range, together with the errors , , of the remaining ranges, all below . Formalization Note The statement is the source's; it is independent of the prime number theorem.
Preamble
import Mathlib import Definitions.Def_Zeta5_SourceConstants open Filter
Formal statement
namespace Apery
lemma low_order {δ : ℝ} (hδ : 0 < δ) :
∀ᶠ n : ℕ in atTop, 6 * (37 * (n : ℝ)) * ((Real.sqrt (200 * n) + 1) * Real.log (200 * n)) +
3 * 10 ^ 9 * n ≤ δ * Kr n ^ 2 := by
sorry
end AperySource