Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.6 (Riemann–Lebesgue) — F : L¹(ℝⁿ) → C_∞(ℝⁿ) is bounded and injective, ‖f̂‖_∞ ≤ (2π)^{−n/2}‖f‖₁

Proved
TeschlQM.Free.riemann_lebesgue

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

fourier-transformharmonic-analysisp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1

Let C∞(Rn)C_\infty(\mathbb R^n)C∞​(Rn) be the Banach space of continuous functions f:Rn→Cf : \mathbb R^n \to \mathbb Cf:Rn→C vanishing at ∞\infty∞, with the sup norm. For f∈L1(Rn)f \in L^1(\mathbb R^n)f∈L1(Rn) the Fourier transform f^(p)=(2π)−n/2∫e−ipxf(x) dnx\hat f(p) = (2\pi)^{-n/2}\int e^{-ipx} f(x)\,d^nxf^​(p)=(2π)−n/2∫e−ipxf(x)dnx lies in C∞(Rn)C_\infty(\mathbb R^n)C∞​(Rn) and satisfies

∥f^∥∞≤(2π)−n/2∥f∥1,\|\hat f\|_\infty \le (2\pi)^{-n/2}\|f\|_1 ,∥f^​∥∞​≤(2π)−n/2∥f∥1​,

and the map f↦f^f \mapsto \hat ff↦f^​ from L1(Rn)L^1(\mathbb R^n)L1(Rn) to C∞(Rn)C_\infty(\mathbb R^n)C∞​(Rn) is injective.

This is the basic mapping property of the Fourier transform on L1L^1L1.

Formalization Note. "Vanishes at ∞\infty∞" is convergence to 000 along the cocompact filter; the sup-norm bound is stated pointwise for every ppp; injectivity says that two integrable functions with the same transform agree almost everywhere.

Preamble
import Mathlib
import Definitions.Def_TeschlQM_Free_fourier
Formal statement
namespace TeschlQM.Free

open MeasureTheory Filter Topology

/-- Teschl, Lemma 7.6 (Riemann–Lebesgue), p. 165: for `f ∈ L¹(ℝⁿ)` the Fourier transform `f̂`
(Teschl's normalization (7.3)) lies in `C_∞(ℝⁿ)` (continuous and vanishing at infinity), satisfies
`‖f̂‖_∞ ≤ (2π)^{-n/2} ‖f‖₁` (7.16), and the map `f ↦ f̂` is injective on `L¹(ℝⁿ)`
(functions equal almost everywhere are identified). -/
theorem riemann_lebesgue (n : ℕ) (f : EuclideanSpace ℝ (Fin n) → ℂ) (hf : Integrable f volume) :
    Continuous (fourier n f) ∧
      Tendsto (fourier n f) (cocompact (EuclideanSpace ℝ (Fin n))) (𝓝 0) ∧
      (∀ p, ‖fourier n f p‖ ≤ ((2 * Real.pi) ^ ((n : ℝ) / 2))⁻¹ * ∫ x, ‖f x‖) ∧
      (∀ g : EuclideanSpace ℝ (Fin n) → ℂ, Integrable g volume →
        fourier n f = fourier n g → f =ᵐ[volume] g) := by sorry

end TeschlQM.Free
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 165, Lemma 7.6
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let n∈Nn\in\mathbb Nn∈N, and let f:Rn→Cf:\mathbb R^n\to\mathbb Cf:Rn→C be Lebesgue integrable on Euclidean Rn\mathbb R^nRn. Write

f^(p)=1(2π)n/2∫Rne−i⟨p,x⟩f(x) dx,\widehat f(p)=\frac{1}{(2\pi)^{n/2}}\int_{\mathbb R^n} e^{-i\langle p,x\rangle}f(x)\,dx ,f​(p)=(2π)n/21​∫Rn​e−i⟨p,x⟩f(x)dx,

and define g^\widehat gg​ the same way for any other function ggg, as a Bochner integral that is 000 when its integrand is not integrable. The statement asserts all four of the following.

  1. f^\widehat ff​ is continuous on Rn\mathbb R^nRn.
  2. f^(p)→0\widehat f(p)\to 0f​(p)→0 along the cocompact filter. That is, for every ε>0\varepsilon>0ε>0 there is a compact K⊆RnK\subseteq\mathbb R^nK⊆Rn with ∣f^(p)∣<ε|\widehat f(p)|<\varepsilon∣f​(p)∣<ε for all p∉Kp\notin Kp∈/K.
  3. For every ppp,
∣f^(p)∣  ≤  1(2π)n/2∫Rn∣f(x)∣ dx.|\widehat f(p)|\;\le\;\frac{1}{(2\pi)^{n/2}}\int_{\mathbb R^n}|f(x)|\,dx .∣f​(p)∣≤(2π)n/21​∫Rn​∣f(x)∣dx.
  1. For every integrable g:Rn→Cg:\mathbb R^n\to\mathbb Cg:Rn→C: if f^(p)=g^(p)\widehat f(p)=\widehat g(p)f​(p)=g​(p) for every ppp, then f=gf=gf=g almost everywhere.

Degenerate cases. When n=0n=0n=0, R0\mathbb R^0R0 is a single point of measure 111 and f^\widehat ff​ is the constant f(0)f(0)f(0):

  • Clause 1 is trivial.
  • Clause 2 holds vacuously, because the whole space is compact and so the cocompact filter is trivial.
  • Clause 3 reads ∣f(0)∣≤∣f(0)∣|f(0)|\le|f(0)|∣f(0)∣≤∣f(0)∣.
  • Clause 4 says f(0)=g(0)f(0)=g(0)f(0)=g(0) implies f=gf=gf=g at the point.

No non-integrable fff is covered, since integrability of fff is a hypothesis.

Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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