TaoFivePrimes.rh_high_height_turing_offset
ProvedTaoFivePrimes.rh_high_height_turing_offsetnumerical-verificationriemann-zetatao-five-primes
A monotone integer discrepancy is zero at a central point when a real function equals that discrepancy plus a proposed residual, its left integral has a lower bound, its right integral has an upper bound, and the proposed residual satisfies the corresponding strict margin tests. This is a generic Turing offset criterion. All relations, integrability and integral bounds are explicit hypotheses; no zeta count or RH window is asserted.
Preamble
import Mathlib open Set MeasureTheory
Formal statement
theorem TaoFivePrimes.rh_high_height_turing_offset (a c b B : ℝ) (hac : a≤c) (hcb : c≤b)
(d : ℝ → ℤ) (S V : ℝ → ℝ)
(hmono : MonotoneOn d (Icc a b))
(hrel : ∀ t ∈ Icc a b, S t=(d t:ℝ)+V t)
(hSL : IntervalIntegrable S volume a c)
(hSR : IntervalIntegrable S volume c b)
(hVL : IntervalIntegrable V volume a c)
(hVR : IntervalIntegrable V volume c b)
(hboundL : -B≤∫ t in a..c, S t)
(hboundR : (∫ t in c..b, S t)≤B)
(hmarginL : (∫ t in a..c, V t)<c-a-B)
(hmarginR : B-(b-c)<∫ t in c..b, V t) : d c=0 := by sorrySource
Elementary monotone integer-offset and integral comparison argument underlying Turing completeness checks. See Timothy Trudgian, Improvements to Turing's Method, arXiv:0903.1885, Section 2.1. This theorem proves only the abstract offset criterion; no analytic zeta integral estimate is assumed as an axiom or proved here. The surrounding xi/theta project retains attribution to sometik179 (c9908072-d99a-4431-aad8-a72c6352619a) and Gabewhigham.