Arb4 Line certificate definitions
DefinitionArdaRH65K_Turing121_Arb4_Linearda-rh65k-transfernumber-theoryriemann-zeta
This bundle defines compact critical-line sample records and ordered-band checks. Let be the set of declarations it provides. Among its named definitions are
The accompanying theorems establish the mathematical properties of these definitions.
Definition code
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_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.
-/
namespace Arb4
/-- A grid point at `t = tn / 2^tq` whose evaluator states are the evaluator runs themselves (after
`N - 1` and `N` terms), so the kernel recomputes them in `ptCheck`. -/
noncomputable def mkPt (tn tq N Q r k nl m : ℕ) (pos : Bool) : H1000Line.LinePt :=
⟨tn, tq, N,
ArbEcon.run (ArbEcon.OrderK.cfg64 tn tq) (N - 2) (ArbEcon.St.init (ArbEcon.OrderK.cfg64 tn tq)),
ArbEcon.run (ArbEcon.OrderK.cfg64 tn tq) 1
(ArbEcon.run (ArbEcon.OrderK.cfg64 tn tq) (N - 2) (ArbEcon.St.init (ArbEcon.OrderK.cfg64 tn tq))),
Q, r, k, nl, m, pos⟩
/-! ## Points with the states computed ONCE (no `dirOk` comparison) -/
/-- The data of a grid point (the states are the evaluator runs, not data). -/
structure PtD where
tn : ℕ
tq : ℕ
N : ℕ
Q : ℕ
r : ℕ
k : ℕ
nl : ℕ
m : ℕ
pos : Bool
/-- The point record of `d`, its states the evaluator runs. -/
noncomputable def PtD.pt (d : PtD) : H1000Line.LinePt := mkPt d.tn d.tq d.N d.Q d.r d.k d.nl d.m d.pos
open H1000Line in
/-- `H1000Line.ptCheck` without the `dirOk` comparisons: for a point whose states ARE the evaluator
runs there is nothing to compare, and the kernel evaluates every run once. -/
noncomputable def ptCheckC (p : H1000Line.LinePt) : Bool :=
decide (2 ≤ p.N) && (remP p).1 && decide (0 < (remP p).2.2) && phaseOk p.tn p.tq p.k &&
decide (0 ≤ thLo p) &&
(bif p.pos then decide (sRad p < sCtr p) else decide (sCtr p + sRad p < 0))
/-- **The band checker** (states computed once per point). -/
noncomputable def bandC (T0n T0d T1n T1d n : ℕ) (ds : List PtD) : Bool :=
ds.all (fun d => ptCheckC d.pt) && H1000Line.bandOk T0n T0d T1n T1d n (ds.map PtD.pt)
end Arb4
def ArdaRH65K_Turing121_Arb4_Line : Nat := 0
Source