Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Entry bound: vpG(μX(tpol M/DK))≥min⁡c(ec−ℓc)−4v_p^G(\mu_X(tpol\,M/D_K)) \ge \min_c(e_c - \ell_c) - 4vpG​(μX​(tpolM/DK​))≥minc​(ec​−ℓc​)−4

Proved
Apery.muX_tpol_bound

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

Entry bound (4.5). Let p≥5p \ge 5p≥5, K<p2K < p^2K<p2, MMM a multiset of integers with 5+2∣M∣−2K+1<p25 + 2|M| - 2K + 1 < p^25+2∣M∣−2K+1<p2, and PlK KPlK\,KPlKK the poles ±1,…,±K\pm 1, \dots, \pm K±1,…,±K (ppp-separated). If β≤ec−ℓc\beta \le e_c - \ell_cβ≤ec​−ℓc​ for every residue class c mod pc \bmod pcmodp, where ec=[c=0]⋅5+#{γ∈M:γ≡c}+#{γ∈M:γ≡−c}e_c = [c = 0]\cdot 5 + \#\{\gamma \in M : \gamma \equiv c\} + \#\{\gamma \in M : \gamma \equiv -c\}ec​=[c=0]⋅5+#{γ∈M:γ≡c}+#{γ∈M:γ≡−c} and ℓc=#{r∈PlK K:r≡c}\ell_c = \#\{r \in PlK\,K : r \equiv c\}ℓc​=#{r∈PlKK:r≡c}, then vpG(μX(tpol M/DK))≥β−4v_p^G(\mu_X(tpol\,M / D_K)) \ge \beta - 4vpG​(μX​(tpolM/DK​))≥β−4, where tpol M=∏γ∈M(t+γ2)tpol\,M = \prod_{\gamma \in M} (t + \gamma^2)tpolM=∏γ∈M​(t+γ2). This is μX_tpol_bound of Apery/Arith/TEntry.lean; it is the entry estimate used by the class-basis framework class_frame toward Apery.inner_bound_cap. Formalization Note Sep, PlK, μX, GV are platform definitions; tpol, plc of Zeta5_SourceInner. The published name is ASCII muX_tpol_bound (source μX_tpol_bound).

Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceConstruction
import Definitions.Def_Zeta5_SourceArith
import Definitions.Def_Zeta5_SourceGrowthTables
import Definitions.Def_Zeta5_SourceInner
import Definitions.Def_Zeta5_SourcePoleFun
import Definitions.Def_Zeta5_SourcePullback
import Definitions.Def_Zeta5_SourceValToolkit

open Finset Polynomial

variable {p : ℕ} [hp : Fact p.Prime]
Formal statement
namespace Apery

theorem muX_tpol_bound {p : ℕ} [Fact p.Prime] (hp5 : 5 ≤ p) (K : ℕ) (M : Multiset ℤ)
    (hsep : Sep p (PlK K)) (hK : K < p ^ 2) (hdeg : 5 + 2 * M.card - 2 * K + 1 < p ^ 2) (β : ℚ)
    (hβ : ∀ c : ZMod p, β ≤ ((if c = 0 then 5 else 0) +
      (M.filter fun γ : ℤ => (γ : ZMod p) = c).card +
      (M.filter fun γ : ℤ => (γ : ZMod p) = -c).card : ℕ) - (plc p (PlK K) c).card) :
    GV p (μX K (tpol M)) (β - 4) := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/TEntry.lean (+ DirectPoly.lean, DirectBound.lean)

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