Horizontal boundary Head check at height 65000
ProvedH65K.Edge.restHeadarda-rh65k-transfernumber-theoryriemann-zeta
Here denotes the generated boundary data and the Boolean predicate is the exact checker for partition and endpoint continuity bookkeeping.
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.restHead :
(Nat.ble 1 E.m && Nat.ble 1 E.tn && eqB (E.x 0) (ofNat 2) &&
eqB (E.x E.m) (ofInt (-1)) &&
(List.range (E.m - 1)).all (fun j => decide (|(E.pc (j + 1)).kk - (E.pc j).kk| ≤ 3)) &&
eqB (E.pc 0).σQ (ofNat 2) && eqB (E.pc (E.m - 1)).σQ (ofInt (-1))) = true := by sorry
Source