The outer-range framework:
ProvedApery.outer_frameanalysisformalizationirrationalitynumber-theoryzeta5-mo271
The outer-range framework. Let , and let () be integer polynomials of degree whose reductions mod split as with injective and injective on ; let weights satisfy the per-entry bound . Then , the rank- correction being the number of moments of degree . This is outer_frame of Apery/Arith/OuterFrame.lean: \mu = \mu_{<} + \mu_{\ge}, the low-rank factorisation of the -part and the low-rank determinant lemma det_lowrank_bound of Apery/Arith/LowRank.lean. It is the framework consumed by Apery.outer_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_SourceOuter import Definitions.Def_Zeta5_SourcePoleFun import Definitions.Def_Zeta5_SourcePullback import Definitions.Def_Zeta5_SourceValToolkit open Finset Polynomial Matrix
Formal statement
namespace Apery
theorem outer_frame {p : ℕ} [hp : Fact p.Prime] (hp5 : 5 ≤ p) (n : ℕ) (Ez : Fin (37 * n) → ℤ[X])
(hdegZ : ∀ s, (Ez s).natDegree < 37 * n) {ι : Type*} [Fintype ι] [DecidableEq ι]
(γ : ι → ZMod p) (hγ : Function.Injective γ) (Lc : ι → ℕ) (cls : Fin (37 * n) → ι)
(idx : Fin (37 * n) → ℕ) (hidx : ∀ a, idx a < Lc (cls a))
(hinj : ∀ a b, cls a = cls b → idx a = idx b → a = b)
(hred : ∀ a, (Ez a).map (Int.castRingHom (ZMod p)) =
(∏ c ∈ Finset.univ.erase (cls a), (X - C (γ c)) ^ Lc c) * (X - C (γ (cls a))) ^ idx a)
(w : Fin (37 * n) → ℚ) (hw : ∀ s, w s ≤ 0)
(hA : ∀ s t, GV p (μX (40 * n) (D (3 * n) ^ 6 * (Ez s).map (Int.castRingHom ℚ) *
(Ez t).map (Int.castRingHom ℚ)) -
C (μGe p ((D (3 * n) ^ 6 * (Ez s).map (Int.castRingHom ℚ) *
(Ez t).map (Int.castRingHom ℚ)) /ₘ D (40 * n)))) (w s + w t)) :
GV p (Δ n) (2 * ∑ s, w s - ((37 * n - ((2 * p + 22 * n - 3) - (37 * n - 1)) : ℕ) : ℚ)) := by
sorry
end Apery
Source