Inner per-prime bound, discrete form:
ProvedApery.inner_Lp_leanalysisformalizationirrationalitynumber-theoryzeta5-mo271
For , odd with , and the degree condition, and every level in the admissible window , the local exponent satisfies
with , , , the layer-cake function, and the class counts. This is inner_Lp_le of Apery/Growth/InnerPrime.lean (discrete form). Formalization Note Lp, layer, hIn, aCnt, Bmax, kloI, ktopI, L0I, Mcut are the platform definitions.
Preamble
import Mathlib import Definitions.Def_Zeta5_SourceConstants import Definitions.Def_Zeta5_SourceNorm import Definitions.Def_Zeta5_SourceGrowthTables import Definitions.Def_Zeta5_SourceGrowthErrors open Finset
Formal statement
namespace Apery
theorem inner_Lp_le {p : ℕ} [hp : Fact p.Prime] {n : ℕ} (hn : 33 ≤ n)
(hodd : 2 * (p / 2) + 1 = p) (hp7 : 7 ≤ p) (hsmall : ¬ p * Mcut ≤ 40 * n)
(hin : 3 * p ≤ 40 * n) (hsq : 2 * (40 * n) < p ^ 2)
(hdeg : 5 + 2 * (18 * n + 2 * (37 * n)) - 2 * (40 * n) + 1 < p ^ 2)
(k : ℤ) (hk1 : kloI n p ≤ k) (hk2 : k ≤ ktopI n p) :
-(Lp n p : ℝ) ≤ -2 * (37 * n : ℕ) * ((40 * n / p : ℕ) : ℝ) +
12 * (37 * n : ℕ) * ((3 * n / p : ℕ) : ℝ) + 2 * layer p 1000 (37 * n : ℕ) -
(37 * n : ℕ) * (k : ℝ) +
2 * ∑ c ∈ Icc 1 (p / 2), hIn n p k (aCnt p (40 * n % p) c) (aCnt p (3 * n % p) c) +
((k - kloI n p : ℤ) : ℝ) * (L0I n p : ℝ) + 2 * Bmax n p + 1 := by
sorry
end Apery
Source