Per-class counts of the entry roots:
ProvedApery.classCount_eqanalysisformalizationirrationalitynumber-theoryzeta5-mo271
Per-class counts of the entry roots (4.4). For , dimensions , basis indices and a residue class , the number of roots of in the class , corrected by the poles, equals with and . 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