Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Growth: the lower-order terms are o(K2)o(K^2)o(K2)

Proved
Apery.low_order

by tomasz · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisformalizationirrationalitynumber-theoryzeta5-mo271

For every δ>0\delta > 0δ>0 and all large nnn,

6⋅37n (200n+1)log⁡(200n)+3⋅109 n  ≤  δ K2,K=40n.6\cdot 37n\,\bigl(\sqrt{200n}+1\bigr)\log(200n) + 3\cdot 10^9\,n \;\le\; \delta\,K^2, \qquad K = 40n.6⋅37n(200n​+1)log(200n)+3⋅109n≤δK2,K=40n.

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 6⋅37n(200n+1)log⁡(200n)6\cdot 37n(\sqrt{200n}+1)\log(200n)6⋅37n(200n​+1)log(200n) and the 100⋅37n100\cdot 37n100⋅37n of the small range, together with the θ≤2y\theta \le 2yθ≤2y errors 4⋅107n4\cdot 10^7 n4⋅107n, 163⋅109n\tfrac{16}{3}\cdot 10^9 n316​⋅109n, 1.48⋅107n1.48\cdot 10^7 n1.48⋅107n of the remaining ranges, all below 3⋅109n3\cdot 10^9 n3⋅109n. 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 Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Growth.lean#L24-L62

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me