Fixed-point sine and cosine evaluation bounds
ProvedArbEcon.taylor_fixedarda-rh65k-transfernumber-theoryriemann-zeta
Let be nonnegative integers, , and . Let and assume . Put . Let be the defined integer Horner evaluator, and let and be the respective descending divisor lists and for . Define
Then
This verifies the fixed-point Taylor core used by the trigonometric checker.
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
import Theorems.Thm_ArbEcon_cos_sin_taylor
import Theorems.Thm_ArbEcon_horner_err
/- 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 -/
/-! ## D. the theta interval -/
/-! ## E. Horner: real recursion, closed form, fixed-point error -/
/-! ## F. Taylor remainders for cos / sin through `Complex.exp_bound` -/
/-! ## G. cos / sin of theta: reduction, Taylor core, rotation -/
Formal statement
theorem ArbEcon.taylor_fixed (P K mag tau : ℕ) (hmag : mag * 16 ≤ 13 * 2 ^ P)
(htau : (2 : ℝ) ^ P * taylorBnd K ≤ tau) :
let one := 2 ^ P
let w := Nat.shiftRight (Nat.mul mag mag) P
let C := horner one w ((divList fcos K).map (fun d : ℕ => one * d)) one
let S0 := Nat.shiftRight (Nat.mul mag (horner one w ((divList fsin K).map (fun d : ℕ => one * d)) one)) P
|(C : ℝ) - 2 ^ P * Real.cos ((mag : ℝ) / 2 ^ P)| ≤ 3 + tau ∧
|(S0 : ℝ) - 2 ^ P * Real.sin ((mag : ℝ) / 2 ^ P)| ≤ 4 + tau ∧ C ≤ one ∧ S0 ≤ one := by sorry
Source