Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The class-basis framework: entry bounds ⇒vpG(Δn)≥2∑sws\Rightarrow v_p^G(\Delta n) \ge 2\sum_s w_s⇒vpG​(Δn)≥2∑s​ws​

Proved
Apery.class_frame

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

The class-basis framework (4.3). Let p=2m+1≥5p = 2m+1 \ge 5p=2m+1≥5, dimensions LaL_aLa​ with ∑aLa=37n\sum_a L_a = 37n∑a​La​=37n, weights www on the basis indices Ea,iE_{a,i}Ea,i​ of Ea,i=∏c≠a(t+c2)Lc(t+a2)iE_{a,i} = \prod_{c \neq a} (t + c^2)^{L_c} (t + a^2)^iEa,i​=∏c=a​(t+c2)Lc​(t+a2)i, and suppose every entry inequality ws+wt+4≤classCount p (40n) (entryRoots (3n) L s t) cw_s + w_t + 4 \le \mathrm{classCount}\,p\,(40n)\,(\mathrm{entryRoots}\,(3n)\,L\,s\,t)\,cws​+wt​+4≤classCountp(40n)(entryRoots(3n)Lst)c holds for all classes ccc. Then the Hankel-type determinant satisfies vpG(Δn)≥2∑swsv_p^G(\Delta n) \ge 2\sum_s w_svpG​(Δn)≥2∑s​ws​. This is class_frame of Apery/Arith/ClassFrame.lean: the per-class entry bounds on μX(tpol M/DK)\mu_X(tpol\,M/D_K)μX​(tpolM/DK​) (Apery.muX_tpol_bound) and the unimodularity of the class bases (Apery.coeffMat_det_unit) combine through det_basis_change and the pullback to give the determinant bound. It is the framework consumed by Apery.inner_bound_cap.

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_SourcePoleFun
import Definitions.Def_Zeta5_SourcePullback
import Definitions.Def_Zeta5_SourceValToolkit

open Finset Polynomial
Formal statement
namespace Apery

theorem class_frame {p : ℕ} [hp : Fact p.Prime] (hp5 : 5 ≤ p) {m : ℕ} (hm : 2 * m + 1 = p)
    (n : ℕ) (L : Fin (m + 1) → ℕ) (hL : ∑ c, L c = 37 * n)
    (w : (Σ a : Fin (m + 1), Fin (L a)) → ℚ)
    (hsep : Sep p (PlK (40 * n))) (hK : 40 * n < p ^ 2)
    (hdeg : 5 + 2 * (18 * n + 2 * (37 * n)) - 2 * (40 * n) + 1 < p ^ 2)
    (hentry : ∀ s t : (Σ a : Fin (m + 1), Fin (L a)), ∀ c : ZMod p,
      w s + w t + 4 ≤ classCount p (40 * n) (entryRoots (3 * n) L s t) c) :
    GV p (Δ n) (2 * ∑ s, w s) := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/ClassFrame.lean#L97-L168 (+ ClassCount.lean sq_injective)

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