Outer-range bound:
ProvedApery.outer_boundanalysisformalizationirrationalitynumber-theoryzeta5-mo271
Outer-range bound. Let be prime, , and suppose , , . Then is bounded below by twice the sum of the outer weights over the classes (rows ) minus the rank loss . This is outer_bound of Apery/Arith/OuterEntryMain.lean (built on OuterFrame.lean, OuterBasis.lean, OuterEntries.lean); it is the outer-range local exponent of the normaliser mN (Apery.integral_mN). Formalization Note Δ, LoC, wO are platform definitions.
Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceConstruction
import Definitions.Def_Zeta5_SourceArith
import Definitions.Def_Zeta5_SourceGrowthTables
import Definitions.Def_Zeta5_SourceValToolkit
open Finset Polynomial
variable {p : ℕ} [hp : Fact p.Prime]
Formal statement
namespace Apery
theorem outer_bound {m : ℕ} (hm : 2 * m + 1 = p) (n : ℕ) (hp7 : 7 ≤ p) (hK3 : 40 * n < 3 * p)
(hK : 2 * (40 * n) < p ^ 2) (hpN : 3 * n < p) :
GV p (Δ n) (2 * ∑ c, ∑ i ∈ range (LoC hm n c), wO hm n c i -
((37 * n - ((2 * p + 22 * n - 3) - (37 * n - 1)) : ℕ) : ℚ)) := by
sorry
end Apery
Source