Preservation of the off-line evaluator invariant
ProvedArbEcon.Off.stepO_soundarda-rh65k-transfernumber-theoryriemann-zeta
Let be valid evaluator configurations for real and order . If the defined state invariant holds after steps,
then it holds after applying at step . This is the inductive soundness step for off-line partial sums.
Preamble
import Definitions.Def_ArdaRH65K_Probes_ArbEconomics_Sound
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineEval
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineSound
import Definitions.Def_ArdaRS_Arithmetic
import Mathlib.Analysis.Complex.Exponential
import Mathlib.Analysis.Real.Pi.Bounds
import Mathlib.Analysis.SpecialFunctions.Log.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.Tactic.IntervalCases
import Theorems.Thm_ArbEcon_Off_ampl_sound
import Theorems.Thm_ArbEcon_logInc_bound
import Theorems.Thm_ArbEcon_theta_bracket
import Theorems.Thm_ArbEcon_trig_sound
/- EMZetaOfflineSound.lean -- soundness of the off-line Nat-only evaluator (EMZetaOfflineEval).
Every function of `EMZetaOfflineEval` produces a TRUE enclosure:
* `imul_sound` : the product `x · v` of a nonnegative bracket and a term ball;
* `ampl_sound` : the validated Newton root brackets `2^P m^(-σ)`, `σ = (a - b)/q`
(for ANY Newton output: the two kernel comparisons decide the bracket);
* `termTB_sound` : the term ball of `m^(-s) = m^(-σ)(cos θ - i sin θ)`, `θ = t log m`;
* `addChain_sound` : accumulator `k` receives `(log m)^k m^(-s)`;
* `stepO_sound`, `runO_sound`, `chunkO_sound` : the loop invariant `InvO` (log bracket and
the `p + 1` complex balls of `Σ_{m ≤ n} (log m)^k m^(-s)`).
The log increment and the cos/sin kernels are `ArbEcon.logInc`/`ArbEcon.trig`, whose soundness
(`ArbEcon.logInc_bound`, `ArbEcon.trig_sound`) is reused unchanged.
conjecture1_proved = False. Finite interval arithmetic; nothing here is about RH.
-/
open Real Finset
section
namespace ArbEcon
end ArbEcon
open ArbEcon
section
namespace ArbEcon.Off
end ArbEcon.Off
open ArbEcon.Off
/-! ## A. Specifications. -/
/-! ## B. The bracket-times-ball product. -/
/-! ## C. Term balls, accumulation, the log chain. -/
/-! ## D. The validated amplitude bracket. -/
/-! ## E. The term `m^(-s)`. -/
/-! ## F. The partial sums. -/
/-! ## G. One step, the run, the chunks. -/
Formal statement
theorem ArbEcon.Off.stepO_sound (c : Cfg) (o : OCfg) (σ t : ℝ) (K : ℕ) (hv : Valid c t K)
(ho : OValid c o σ) (n : ℕ) (s : StO) (hI : InvO c σ t n s) :
InvO c σ t (n + 1) (stepO c o s) := by sorry
Source