Appendix A — S_N(x) ≤ e^x ≤ U_N(x) for N ≥ 1 and 0 ≤ x ≤ 1
ProvedExactDFTRefine.Main.appendix_aarithmetic-complexityfourier-transformp2o-gran-per-chapterp2o-plan-paperp2o-v1
For let and . For every ,
These bounds certify the logarithm enclosures of Table 2: an upper bound on is certified by , and a lower one by .
Differences from the source: none.
Preamble
import Mathlib import Definitions.Def_ExactDFTRefine_Main_Moments
Formal statement
namespace ExactDFTRefine.Main
/-- **Appendix A**, p. 8. For `N ≥ 1` and `0 ≤ x ≤ 1`: `S_N(x) ≤ e^x ≤ U_N(x)`, where
`S_N(x) = ∑_{j=0}^{N-1} x^j/j!` and `U_N(x) = S_N(x) + ((N + 1)/(N N!)) x^N`. -/
theorem appendix_a (N : ℕ) (hN : 1 ≤ N) (x : ℝ) (hx0 : 0 ≤ x) (hx1 : x ≤ 1) :
SN N x ≤ Real.exp x ∧ Real.exp x ≤ UN N x := by sorry
end ExactDFTRefine.Main
Source
Yao, Liu, A Numerical Refinement of an Exact Discrete Fourier Transform Bound, arXiv:2611.01257v1, p. 8, Appendix A
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.