Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Per-class counts of the entry roots: classCount=ba+(2 or 1)(νs(a)+νt(a))\mathrm{classCount} = b_a + (2\text{ or }1)(\nu_s(a)+\nu_t(a))classCount=ba​+(2 or 1)(νs​(a)+νt​(a))

Proved
Apery.classCount_eq

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

Per-class counts of the entry roots (4.4). For p=2m+1p = 2m+1p=2m+1, dimensions LLL, basis indices s,ts, ts,t and a residue class c mod pc \bmod pcmodp, the number classCount p K (entryRoots N L s t) c\mathrm{classCount}\,p\,K\,(\mathrm{entryRoots}\,N\,L\,s\,t)\,cclassCountpK(entryRootsNLst)c of roots of DN6EsEtD_N^6 E_s E_tDN6​Es​Et​ in the class ccc, corrected by the poles, equals ba+(2 if a=0 else 1)(νs(a)+νt(a))b_{a} + (2 \text{ if } a = 0 \text{ else } 1)(\nu_s(a) + \nu_t(a))ba​+(2 if a=0 else 1)(νs​(a)+νt​(a)) with a=ccls(c)a = \mathrm{ccls}(c)a=ccls(c) and ba=Bse p K N ab_a = \mathrm{Bse}\,p\,K\,N\,aba​=BsepKNa. This is classCount_eq of Apery/Arith/ClassCount.lean (with the auxiliary card_filter_replicate, count_classRoots, count_DN, card_plc_PlK, ccls_eq_zero_iff); it converts the per-class entry inequalities into the closed form used 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 classCount_eq {p m : ℕ} [hp : Fact p.Prime] (hm : 2 * m + 1 = p) (K N : ℕ)
    (L : Fin (m + 1) → ℕ) (s t : Σ a : Fin (m + 1), Fin (L a)) (c : ZMod p) :
    classCount p K (entryRoots N L s t) c =
      Bse p K N (ccls hm c) + (if ccls hm c = 0 then 2 else 1) *
        ((nu L s (ccls hm c) : ℚ) + nu L t (ccls hm c)) := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/ClassCount.lean#L196-L230

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