Entry bound:
ProvedApery.muX_tpol_boundanalysisformalizationirrationalitynumber-theoryzeta5-mo271
Entry bound (4.5). Let , , a multiset of integers with , and the poles (-separated). If for every residue class , where and , then , where . 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