Soundness of an off-line remainder certificate
ProvedArbEcon.Off.remOddG_soundarda-rh65k-transfernumber-theoryriemann-zeta
Let , , , , and let be natural numbers. If the defined certificate for these inputs returns true with rational bound , then, for ,
The quotients use Lean's real division. This validates the off-line remainder.
Preamble
import Definitions.Def_ArdaRH65K_Probes_ArbEconomics_Sound
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_EMZetaOfflineCheck
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineCore
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineEval
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineSound
import Definitions.Def_ArdaRH65K_Turing121_EMZetaTail
import Definitions.Def_ArdaRH65K_Turing121_Probes_ArbEconomics_Zeta
import Definitions.Def_ArdaRS_Arithmetic
import Definitions.Def_ArdaRS_Config64
import Mathlib.Analysis.Analytic.Uniqueness
import Mathlib.Analysis.Complex.Exponential
import Mathlib.Analysis.Real.Pi.Bounds
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.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
import Theorems.Thm_ArbEcon_Off_rpow_neg_le_of_pow
import Theorems.Thm_ZetaReflection_EMOff_em_zeta_orderK_enclosure_odd_ext
namespace ArbEcon
end ArbEcon
namespace ArbEcon.OrderK
end ArbEcon.OrderK
namespace ZetaReflection
end ZetaReflection
namespace ZetaReflection.EMHigh
end ZetaReflection.EMHigh
/- EMZetaOfflineCheck.lean -- lane offline: the KERNEL-ONLY assembly of an order-(2K+1)
Euler-Maclaurin enclosure of ζ(σ + i t) at a rational `σ = (a - b)/q` (any sign, `σ > -2K`) and a
dyadic `t = tn / 2^tq > 0`.
* `gpochG`, `pochRI_eq_gpochG` -- the Gaussian-integer rising factorial
`(q u)^k (σ + i t)_k` (`u = 2^tq`);
* `corrDataG`, `corr_eqG` -- the exact correction factor `emCorr K (σ + i t) N` as
`(BreN + i BimN) / BD` in integers;
* `pnG`, `pochNormSq_eq_pnG` -- the remainder numerator `Π_{j<k} ((sN + j q)² u² + tn² q²)`;
* `rpow_neg_le_of_pow` -- `N^(-σ) ≤ Rn/Rd` from `Rd^q N^b ≤ Rn^q N^a`;
* `remOddG`, `remOddG_sound` -- the odd-saw remainder of `EMOff.em_zeta_orderK_enclosure_odd_ext`
(valid off the line, `σ > -2K`) as `EN/ED`;
* `zeta_ballG` -- the evaluator balls after `N-1` and `N` terms plus any remainder
bound give balls for `Re ζ(s)`, `Im ζ(s)`;
* `checkG`, `checkG_sound` -- ONE Boolean checker (run by `decide +kernel`) and its
soundness: `lo/D ≤ Re ζ(σ + i t) ≤ hi/D`, same for `Im`.
conjecture1_proved = False. Finite interval arithmetic at one point; nothing about RH.
-/
open Complex ZetaReflection ZetaReflection.EMHigh
open scoped Nat Real
section
namespace ArbEcon
end ArbEcon
open ArbEcon
section
namespace ArbEcon.Off
end ArbEcon.Off
open ArbEcon.Off
open ArbEcon.OrderK (betaN Lbeta )
/-! ## A. The Gaussian-integer rising factorial at `σ = sN/q`, `t = tn/u`. -/
/-! ## B. The remainder numerator and `N^(-σ)`. -/
/-! ## C. The odd-saw remainder certificate, off the line. -/
Formal statement
theorem ArbEcon.Off.remOddG_sound (K N : ℕ) (hN : 1 ≤ N) (a b q u tn : ℕ) (hq : 0 < q) (hu : 0 < u)
(htn : 0 < tn) (σ t : ℝ) (hσ : σ = ((a : ℝ) - b) / q) (ht : t = (tn : ℝ) / u) (Qp Rn Rd : ℕ)
(hok : (remOddG K a b q u tn N Qp Rn Rd).1 = true) :
‖riemannZeta (sOfG σ t) - emFinite K (sOfG σ t) N‖
≤ ((remOddG K a b q u tn N Qp Rn Rd).2.1 : ℝ) / ((remOddG K a b q u tn N Qp Rn Rd).2.2 : ℝ) := by sorry
Source