Integer-window valuation bound: for all
ProvedApery.VG_eval_int_of_windowanalysisformalizationirrationalitynumber-theoryzeta5-mo271
Let be prime and with . If all values of at consecutive integers are -adically bounded below by (in the sense , i.e. either the value vanishes or of it), then every integer value , , is bounded in the same way. This is VG_eval_int_of_window of Apery/Arith/SmallPrime.lean, proved from the binomial basis (newton), the Bernoulli functional bound tau_bound and the valuation toolkit VG/GV. It is the integer-point input of the small-prime bound for Apery.integral_mN. Formalization Note VG is the platform definition of Zeta5_SourceValToolkit.
Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceValToolkit
open Finset Polynomial
variable {p : ℕ} [hp : Fact p.Prime]
Formal statement
namespace Apery
theorem VG_eval_int_of_window {P : ℚ[X]} {d : ℕ} (hd : P.natDegree ≤ d) (s : ℤ) {β : ℚ}
(hv : ∀ i ≤ d, VG p (P.eval ((s + i : ℤ) : ℚ)) β) (z : ℤ) : VG p (P.eval (z : ℚ)) β := by
sorry
end Apery
Source