Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integer-window valuation bound: VG p (P(z)) β\mathrm{VG}\,p\,(P(z))\,\betaVGp(P(z))β for all z∈Zz \in \mathbb{Z}z∈Z

Proved
Apery.VG_eval_int_of_window

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

Let ppp be prime and P∈Q[X]P \in \mathbb{Q}[X]P∈Q[X] with deg⁡P≤d\deg P \le ddegP≤d. If all d+1d+1d+1 values P(s),P(s+1),…,P(s+d)P(s), P(s+1), \dots, P(s+d)P(s),P(s+1),…,P(s+d) of PPP at consecutive integers are ppp-adically bounded below by β\betaβ (in the sense VG p (P(s+i)) β\mathrm{VG}\,p\,(P(s+i))\,\betaVGp(P(s+i))β, i.e. either the value vanishes or β≤vp\beta \le v_pβ≤vp​ of it), then every integer value P(z)P(z)P(z), z∈Zz \in \mathbb{Z}z∈Z, 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
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/SmallPrime.lean#L54-L80 (+ BinomBasis.lean, TauBound.lean, IntPoly.lean, Val.lean)

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