Residue bound for on the poles :
ProvedApery.crude_tauXanalysisformalizationirrationalitynumber-theoryzeta5-mo271
Lemma 3.3 (crude) for the poles . Let , , of degree whose integer values are -adically integral ( for all ). Then the functional applied to with pole set has Gauss valuation at least . This is crude_tauX of Apery/Arith/SmallPrimeTau.lean; it is the residue computation underlying the small-prime bound Apery.small_prime_bound (hence Apery.integral_mN). Formalization Note tauX, resP, piPl, polyPart, dd, Lb, bin, tau, BinRep, res are platform definitions of Zeta5_SourcePoleFun; GV, VG, PlK are as before.
Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceConstruction
import Definitions.Def_Zeta5_SourceArith
import Definitions.Def_Zeta5_SourceGrowthTables
import Definitions.Def_Zeta5_SourcePoleFun
import Definitions.Def_Zeta5_SourceValToolkit
open Finset Polynomial
variable {p : ℕ} [hp : Fact p.Prime]
Formal statement
namespace Apery
theorem crude_tauX {K d : ℕ} (hK : 1 ≤ K) (hdK : 2 * K ≤ d) (A : ℚ[X]) (hA : A.natDegree ≤ d)
(hint : ∀ z : ℤ, VG p (A.eval (z : ℚ)) 0) :
GV p (tauX (C ((K.factorial : ℚ) ^ 2) * A) (PlK K))
(-6 * (Nat.log p (d + 1) : ℚ) - padicValNat p 24) := by
sorry
end Apery
Source