Proof of Lemma 11, p. 13 — reciprocal-exponential bound
ProvedQuantumLinSys.Fourier.bound_p13complex-analysisfourier-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
For each real with ,
The bound controls the error caused by replacing an integral in the variable with a finite geometric sum.
Formalization Note The printed phrase “for all ” presupposes the reciprocals are defined. Lean explicitly excludes , where totalized division would give a meaningless instance of the inequality.
Preamble
import Mathlib import Definitions.Def_QuantumLinSys_Fourier_Setting
Formal statement
namespace QuantumLinSys.Fourier
/-- The inline reciprocal-exponential bound in the proof of Lemma 11, p. 13. -/
theorem bound_p13 (x : ℝ) (hx : x ∈ Set.Icc (-1 : ℝ) 1) (hx0 : x ≠ 0) :
‖1 / (1 - Complex.exp (-Complex.I * x)) -
1 / (Complex.I * x)‖ < 1 := by sorry
end QuantumLinSys.Fourier
Source
Childs, Kothari and Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, arXiv:1511.02306v2, proof of Lemma 11, p. 13, inline bound beginning 'Since |1/(1−e^{−ix}) − 1/(ix)| < 1'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.