Integer brackets for a scaled reciprocal square root
ProvedArbEcon.sqrt_bracketarda-rh65k-transfernumber-theoryriemann-zeta
Let be nonnegative integers and . Put . If , set and . If and , set and ; otherwise set and . Then
These integer bounds certify the evaluator’s reciprocal-square-root enclosure.
Preamble
import Definitions.Def_ArdaRH65K_Probes_ArbEconomics_Sound
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
/- Probes/ArbEconomics_Sound.lean -- soundness of the Nat-only zeta evaluator (ArbEconomics_Eval).
Every function of `ArbEconomics_Eval` is shown to produce a TRUE enclosure:
* `logInc` : `S <= (log m - log (m-1)) 2^P <= S + K + T`
(Mathlib `Real.hasSum_pow_div_log_of_abs_lt_one`, `abs_log_sub_add_sum_range_le`);
* `termOf` : `Rlo <= 2^P / sqrt m <= Rhi` for ANY Newton iterate (two-sided validation);
* `trig` : cos/sin balls of `theta` from the (pi/2)-reduction, the Horner scheme
(Mathlib `Complex.exp_bound`) and the quadrant rotation;
* `step`/`run` : the loop invariant `Inv` (log bracket + Re/Im balls of the partial zeta sum).
The main theorem `run_sound` turns a kernel-checked chunk equation
`St.beq (run cfg L s) s' = true` into `Inv n s -> Inv (n + L) s'`.
conjecture1_proved = False. Finite interval arithmetic; nothing here is about RH.
-/
open Real Finset
section
namespace ArbEcon
end ArbEcon
open ArbEcon
/-! ## A. floor division / shifts, cast to ℝ -/
/-! The evaluator calls the kernel primitives directly; these `rfl` lemmas translate them back to
notation for the proofs. -/
/-! ## B. the log increment -/
/-! ## C. the square-root bracket -/
Formal statement
theorem ArbEcon.sqrt_bracket (P m g : ℕ) (hm : 1 ≤ m) :
((Bool.rec 0 (Bool.rec (Nat.div (2 ^ (2 * P)) (Nat.mul m g)) g
(Nat.ble (Nat.mul (Nat.mul g g) m) (2 ^ (2 * P)))) (Nat.ble 1 g) : ℕ) : ℝ)
≤ (2 : ℝ) ^ P / Real.sqrt m ∧
(2 : ℝ) ^ P / Real.sqrt m ≤ ((Bool.rec (2 ^ P) (Bool.rec g
(Nat.add (Nat.div (2 ^ (2 * P)) (Nat.mul m g)) 1)
(Nat.ble (Nat.mul (Nat.mul g g) m) (2 ^ (2 * P)))) (Nat.ble 1 g) : ℕ) : ℝ) := by sorry
Source