Lemma 3.1 — S_6(x) ≤ e^x for x ≥ 0, and e^x ≤ S_6(x) + (7/4320)x^6 for 0 ≤ x ≤ 1
ProvedExactDFTRefine.Main.lemma_3_1arithmetic-complexityfourier-transformp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the degree-five Taylor polynomial of the exponential. Then
The two clauses have different domains: the lower bound holds on the whole half-line, the upper bound only on . These elementary enclosures are what Proposition 3.2 substitutes into each normalized moment term .
Differences from the source: none.
Preamble
import Mathlib import Definitions.Def_ExactDFTRefine_Main_Moments
Formal statement
namespace ExactDFTRefine.Main
/-- **Lemma 3.1**, p. 3. With `S_6(x) = ∑_{j=0}^{5} x^j/j!`: `S_6(x) ≤ e^x` for `x ≥ 0`, and
`e^x ≤ S_6(x) + (7/4320) x^6` for `0 ≤ x ≤ 1` (Eq. (4)). -/
theorem lemma_3_1 :
(∀ x : ℝ, 0 ≤ x → SN 6 x ≤ Real.exp x) ∧
(∀ x : ℝ, 0 ≤ x → x ≤ 1 → Real.exp x ≤ SN 6 x + 7 / 4320 * x ^ 6) := by sorry
end ExactDFTRefine.Main
Source
Yao, Liu, A Numerical Refinement of an Exact Discrete Fourier Transform Bound, arXiv:2611.01257v1, p. 3, Lemma 3.1 (Eq. (4))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.