Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
ExactDFTRefine.Main.lemma_3_1

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmetic-complexityfourier-transformp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let S6(x)=∑j=05xj/j!S_6(x) = \sum_{j=0}^{5} x^j/j!S6​(x)=∑j=05​xj/j! be the degree-five Taylor polynomial of the exponential. Then

S6(x)≤ex(x≥0),ex≤S6(x)+74320x6(0≤x≤1).(4)S_6(x) \le e^x \quad (x \ge 0), \qquad e^x \le S_6(x) + \frac{7}{4320}x^6 \quad (0 \le x \le 1). \tag{4}S6​(x)≤ex(x≥0),ex≤S6​(x)+43207​x6(0≤x≤1).(4)

The two clauses have different domains: the lower bound holds on the whole half-line, the upper bound only on [0,1][0, 1][0,1]. These elementary enclosures are what Proposition 3.2 substitutes into each normalized moment term m(r/145)1−C=mr145exp⁡(Clog⁡145r)m(r/145)^{1-C} = \frac{mr}{145}\exp(C\log\frac{145}{r})m(r/145)1−C=145mr​exp(Clogr145​).

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
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me