Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The outer-range framework: vpG(Δ)≥2∑w−rv_p^G(\Delta) \ge 2\sum w - rvpG​(Δ)≥2∑w−r

Proved
Apery.outer_frame

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

The outer-range framework. Let p≥5p \ge 5p≥5, and let EsE_sEs​ (s<37ns < 37ns<37n) be integer polynomials of degree <37n< 37n<37n whose reductions mod ppp split as ∏c≠cls(s)(X−γc)Lc(X−γcls(s))idx(s)\prod_{c \ne cls(s)} (X - \gamma_c)^{L_c} (X - \gamma_{cls(s)})^{idx(s)}∏c=cls(s)​(X−γc​)Lc​(X−γcls(s)​)idx(s) with γ\gammaγ injective and (cls,idx)(cls, idx)(cls,idx) injective on {(cls(s),idx(s))}\{(cls(s), idx(s))\}{(cls(s),idx(s))}; let weights w≤0w \le 0w≤0 satisfy the per-entry bound vpG(μX(D3n6EsEt)−μ≥(D3n6EsEt/D40n))≥ws+wtv_p^G\big(\mu_X(D_{3n}^6 E_s E_t) - \mu_{\ge}(D_{3n}^6 E_s E_t / D_{40n})\big) \ge w_s + w_tvpG​(μX​(D3n6​Es​Et​)−μ≥​(D3n6​Es​Et​/D40n​))≥ws​+wt​. Then vpG(Δn)≥2∑sws−(37n−(2p+22n−3−(37n−1)))v_p^G(\Delta_n) \ge 2\sum_s w_s - (37n - (2p + 22n - 3 - (37n - 1)))vpG​(Δn​)≥2∑s​ws​−(37n−(2p+22n−3−(37n−1))), the rank-rrr correction being the number of moments of degree ≥2p−3\ge 2p-3≥2p−3. This is outer_frame of Apery/Arith/OuterFrame.lean: \mu = \mu_{<} + \mu_{\ge}, the low-rank factorisation of the μ≥\mu_{\ge}μ≥​-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
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/OuterFrame.lean#L96-L215

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