Consequences of a successful compact point check
ProvedArb4.ptCheckC_specarda-rh65k-transfernumber-theoryriemann-zeta
Let be compact point data and suppose . Write for its truncation index, for its remainder-check tuple, for its phase lower bound, and for its signed center and radius. Then
The symbols denote exactly the projections and checks in the compact point data.
Preamble
import Definitions.Def_ArdaRH65K_Probes_ArbEconomics_Sound
import Definitions.Def_ArdaRH65K_RSTheta
import Definitions.Def_ArdaRH65K_ThetaConverge
import Definitions.Def_ArdaRH65K_ThetaValue
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Line
import Definitions.Def_ArdaRH65K_Turing121_ArctanTaylor
import Definitions.Def_ArdaRH65K_Turing121_DiffractionCore
import Definitions.Def_ArdaRH65K_Turing121_DlvpTheta
import Definitions.Def_ArdaRH65K_Turing121_DlvpZetaRateEffective
import Definitions.Def_ArdaRH65K_Turing121_EMZeta
import Definitions.Def_ArdaRH65K_Turing121_EMZetaComplex
import Definitions.Def_ArdaRH65K_Turing121_EMZetaHigh
import Definitions.Def_ArdaRH65K_Turing121_EMZetaHighCheck
import Definitions.Def_ArdaRH65K_Turing121_EMZetaTail
import Definitions.Def_ArdaRH65K_Turing121_H1000Line
import Definitions.Def_ArdaRH65K_Turing121_H1000Phase
import Definitions.Def_ArdaRH65K_Turing121_H1000Point
import Definitions.Def_ArdaRH65K_Turing121_KernelGammaEnvelope
import Definitions.Def_ArdaRH65K_Turing121_Probes_ArbEconomics_Zeta
import Definitions.Def_ArdaRH65K_Turing121_RHInBoxAnalytic
import Definitions.Def_ArdaRH65K_Turing121_StripRepr
import Definitions.Def_ArdaRH65K_Turing121_StripReprR1
import Definitions.Def_ArdaRH65K_Turing121_TuringBand
import Definitions.Def_ArdaRH65K_XiLineZeros
import Definitions.Def_ArdaRS_Arithmetic
import Definitions.Def_ArdaRS_Config64
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.BohrMollerup
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.IntervalCases
/- Arb4_Line.lean -- lane Arb4 (h1000 compaction): the on-line sign certificate of a Turing band
with the evaluator states recomputed in the kernel (brick K4 in EM form, `H1000Line`).
The band modules `H1000Line_Bxx` of lane h1000-prep store, per grid point, the two evaluator
states after `N - 1` and `N` Dirichlet terms as computable definitions (compiled to IR: about
20 KB of olean per point). Here a point is `mkPt tn tq N Q r k nl m pos`, whose states ARE the
evaluator runs (`ArbEcon.run`), so `H1000Line.ptCheck (mkPt …)` recomputes them, and a whole band
is ONE Boolean `bandB` run by ONE `decide +kernel`:
* `mkPt` -- a point record with recomputed states;
* `allB`, `allB_sound` -- every point of a list passes `H1000Line.ptCheck`;
* `bandB`, `bandB_sound` -- the band: `allB` and `H1000Line.bandOk` give the band's verbatim
`hLine` (`n` increasing zeros of `completedRiemannZeta` on the critical
line in `[T0, T1]`) through `H1000Line.band_sound`.
Trust: every theorem is proved from its stated hypotheses; axioms [propext, Classical.choice,
Quot.sound] (Arb4_AxiomGuard). No `sorry`. conjecture1_proved = False. Finite interval
arithmetic and the intermediate value theorem; nothing here bears on the Riemann Hypothesis.
-/
section
namespace Arb4
end Arb4
open Arb4
/-! ## Points with the states computed ONCE (no `dirOk` comparison) -/
open H1000Line
Formal statement
theorem Arb4.ptCheckC_spec {p : H1000Line.LinePt} (h : ptCheckC p = true) :
2 ≤ p.N ∧ (remP p).1 = true ∧ 0 < (remP p).2.2 ∧ phaseOk p.tn p.tq p.k = true ∧
0 ≤ thLo p ∧ (p.pos = true → sRad p < sCtr p) ∧ (p.pos = false → sCtr p + sRad p < 0) := by sorry
Source