Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The outer-range entry bound: vpG(μX(tpol)−μ≥(tpol/D))≥wO(cs,is)+wO(ct,it)v_p^G(\mu_X(tpol) - \mu_{\ge}(tpol/D)) \ge wO(c_s,i_s) + wO(c_t,i_t)vpG​(μX​(tpol)−μ≥​(tpol/D))≥wO(cs​,is​)+wO(ct​,it​)

Proved
Apery.outer_entry

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

The outer-range entry bound (4.11). Let p≥7p \ge 7p≥7 with 40n<3p40n < 3p40n<3p, 2⋅40n<p22 \cdot 40n < p^22⋅40n<p2 and 3n<p3n < p3n<p, and let (cs,is)(c_s, i_s)(cs​,is​), (ct,it)(c_t, i_t)(ct​,it​) be two rows of the outer basis. Then the entry μX(tpol entryO)−μ≥(tpol entryO/D40n)\mu_X(tpol\,entryO) - \mu_{\ge}(tpol\,entryO / D_{40n})μX​(tpolentryO)−μ≥​(tpolentryO/D40n​) has Gauss valuation at least wO(cs,is)+wO(ct,it)wO(c_s, i_s) + wO(c_t, i_t)wO(cs​,is​)+wO(ct​,it​). This is outer_entry of Apery/Arith/OuterEntryMain.lean: writing μX=μ≥+μ<\mu_X = \mu_{\ge} + \mu_{<}μX​=μ≥​+μ<​, the pole analysis of the entry via the residues of tpol entryOtpol\,entryOtpolentryO against the tail poles, including the pairing lemma for the last two poles of a class. It is the entry bound consumed by Apery.outer_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_SourceOuter
import Definitions.Def_Zeta5_SourcePoleFun
import Definitions.Def_Zeta5_SourcePullback
import Definitions.Def_Zeta5_SourceValToolkit

open Finset Polynomial
Formal statement
namespace Apery

theorem outer_entry {m p : ℕ} [hp : Fact p.Prime] (hm : 2 * m + 1 = p) (n : ℕ)
    (hp7 : 7 ≤ p) (hK3 : 40 * n < 3 * p) (hK : 2 * (40 * n) < p ^ 2)
    (hpN : 3 * n < p) (cs : Fin (m + 1)) (is : ℕ) (ct : Fin (m + 1)) (it : ℕ) :
    GV p (μX (40 * n) (tpol (entryO hm n cs is ct it)) -
      C (μGe p (tpol (entryO hm n cs is ct it) /ₘ D (40 * n)))) (wO hm n cs is + wO hm n ct it) := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/OuterEntryMain.lean#L462-L481

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