The class-basis framework: entry bounds
ProvedApery.class_frameanalysisformalizationirrationalitynumber-theoryzeta5-mo271
The class-basis framework (4.3). Let , dimensions with , weights on the basis indices of , and suppose every entry inequality holds for all classes . Then the Hankel-type determinant satisfies . This is class_frame of Apery/Arith/ClassFrame.lean: the per-class entry bounds on (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