The outer-range entry bound:
ProvedApery.outer_entryanalysisformalizationirrationalitynumber-theoryzeta5-mo271
The outer-range entry bound (4.11). Let with , and , and let , be two rows of the outer basis. Then the entry has Gauss valuation at least . This is outer_entry of Apery/Arith/OuterEntryMain.lean: writing , the pole analysis of the entry via the residues of 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