Critical-line zero list from an accepted sharp band certificate
ProvedRS5.bandZeros_of_ok_primearda-rh65k-transfernumber-theoryriemann-zeta
Let be a nonempty finite list of samples, with real heights and stored Boolean signs. Suppose the sharp Boolean band checker accepts this list, and let be its number of adjacent sign changes. Then there are strictly increasing real numbers such that
where is completed zeta. The list of zeros is empty when .
This turns an accepted sharp band of integer checks into a list of distinct critical-line zeros.
Preamble
import Definitions.Def_ArdaRH65K_DlvpTheta
import Definitions.Def_ArdaRH65K_Probes_ArbEconomics_Sound
import Definitions.Def_ArdaRH65K_RS4_Sound
import Definitions.Def_ArdaRH65K_RS5_Band
import Definitions.Def_ArdaRH65K_RS5_Sound
import Definitions.Def_ArdaRH65K_RS5_Z
import Definitions.Def_ArdaRH65K_RSTheta
import Definitions.Def_ArdaRH65K_RS_B2
import Definitions.Def_ArdaRH65K_RS_B3
import Definitions.Def_ArdaRH65K_RS_B3Sharp
import Definitions.Def_ArdaRH65K_RS_C0
import Definitions.Def_ArdaRH65K_RS_Entire
import Definitions.Def_ArdaRH65K_RS_Fold
import Definitions.Def_ArdaRH65K_RS_Kernel
import Definitions.Def_ArdaRH65K_RS_Mellin
import Definitions.Def_ArdaRH65K_RS_Strip
import Definitions.Def_ArdaRH65K_ThetaConverge
import Definitions.Def_ArdaRH65K_ThetaValue
import Definitions.Def_ArdaRH65K_XiLineZeros
import Definitions.Def_ArdaRS_Arithmetic
import Definitions.Def_ArdaRS_Band
import Definitions.Def_ArdaRS_BandSharp
import Definitions.Def_ArdaRS_Config64
import Definitions.Def_ArdaRS_Dyadic
import Definitions.Def_ArdaRS_DyadicOps
import Definitions.Def_ArdaRS_Evaluator
import Mathlib
import Mathlib.Algebra.Ring.GeomSum
import Mathlib.Analysis.Analytic.Uniqueness
import Mathlib.Analysis.Calculus.Deriv.MeanValue
import Mathlib.Analysis.Complex.Exponential
import Mathlib.Analysis.Complex.ExponentialBounds
import Mathlib.Analysis.PSeries
import Mathlib.Analysis.Real.Pi.Bounds
import Mathlib.Analysis.SpecialFunctions.Complex.Arg
import Mathlib.Analysis.SpecialFunctions.Gamma.Beta
import Mathlib.Analysis.SpecialFunctions.Gamma.Deligne
import Mathlib.Analysis.SpecialFunctions.ImproperIntegrals
import Mathlib.Analysis.SpecialFunctions.Integrals.Basic
import Mathlib.Analysis.SpecialFunctions.Log.Deriv
import Mathlib.Analysis.SpecialFunctions.Pow.Deriv
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Analysis.SpecialFunctions.Trigonometric.ArctanDeriv
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Bounds
import Mathlib.MeasureTheory.Function.Floor
import Mathlib.MeasureTheory.Integral.IntegralEqImproper
import Mathlib.MeasureTheory.Integral.IntervalIntegral.IntegrationByParts
import Mathlib.NumberTheory.LSeries.RiemannZeta
import Mathlib.NumberTheory.ZetaValues
import Mathlib.Tactic
import Mathlib.Tactic.IntervalCases
import Theorems.Thm_RS5_chain_zeros
import Theorems.Thm_RS5_sampleOK_prime_sign
namespace XiLineZeros
end XiLineZeros
/- RS5_BandSharp.lean -- lane B5, RSC0 Phase 3: the band certificate over the SHARPENED predicate
`RS5.bandOK'` (margin (3/5) t^(-3/4), every sample at t >= 4250). Theorems BESIDE `RS5_Band`
(imported read-only; the generic `chain_zeros`, `ltH_real`, `BandZeros` and its gluing are reused).
## Headlines (no `sorry`, no `native_decide`, no new axioms)
* `band_sound'` : `bandOK' (s0 :: rest) = true` gives a strictly increasing list of
`chgBy Sample.pos (s0 :: rest)` on-line zeros of `riemannZeta` strictly inside
`(s0.t, (lastOf s0 rest).t)` -- the same conclusion as `band_sound`;
* `bandZeros_of_ok'` : the same as `BandZeros`, so sharpened chunks glue with old ones
(`BandZeros.glue`).
conjecture1_proved = False. Finitely many certified zeros; nothing about RH.
-/
open Complex
section
namespace RS5
end RS5
open RS5
noncomputable section
Formal statement
theorem RS5.bandZeros_of_ok_prime (s0 : Sample) (rest : List Sample) (h : bandOK' (s0 :: rest) = true) :
BandZeros s0.t (lastOf s0 rest).t (chgBy Sample.pos (s0 :: rest)) := by sorry
Source