Horizontal boundary TailLo check at height 65000
ProvedH65K.Edge.restTailLoarda-rh65k-transfernumber-theoryriemann-zeta
Here denotes the generated boundary data and the Boolean predicate is the exact checker for the lower final argument bound.
The theorem is a finite rational arithmetic certificate used in the zero-count argument.
Preamble
import Definitions.Def_ArdaRH65K_Edge65000Data set_option maxRecDepth 100000 set_option maxHeartbeats 0 open Arb4 Arb4.Q H65K.Edge
Formal statement
theorem H65K.Edge.restTailLo :
finalLoOK ((E.pc (E.m - 1)).kk - (E.pc 0).kk) E.qhi0 E.qlo1 E.Lo = true := by sorry
Source