Small-prime bound:
ProvedApery.small_prime_boundanalysisformalizationirrationalitynumber-theoryzeta5-mo271
Small-prime bound (3.12). For every prime with (all when up to the cutoff) the Gauss valuation of is at least . This is small_prime_bound of Apery/Arith/SmallPrimeF.lean; it combines the Legendre/valuation bookkeeping (Legendre.lean, vS_eq), the binomial-basis integer-window lemma VG_eval_int_of_window and the change of basis det_basis_change. Together with inner_bound_cap and outer_bound it gives the local exponent Lp of the normaliser mN (Apery.integral_mN). Formalization Note GV, F are platform definitions.
Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceConstruction
import Definitions.Def_Zeta5_SourceArith
import Definitions.Def_Zeta5_SourceGrowthTables
import Definitions.Def_Zeta5_SourceValToolkit
open Finset Polynomial
variable {p : ℕ} [hp : Fact p.Prime]
Formal statement
namespace Apery
theorem small_prime_bound {n : ℕ} (hn : 1 ≤ n) :
GV p (F n) (-(6 * (37 * n : ℕ) * (Nat.log p (200 * n) : ℚ) + (37 * n : ℕ) * padicValNat p 24)) := by
sorry
end Apery
Source