5. Fourier Analysis
-
Lemma 5.2Blueprint label
-
«lemma:Gaussian-Fourier»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
Definition 5.3Blueprint label
-
«def:Schwartz-Space»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
Lemma 5.4Blueprint label
-
«lemma:Fourier-transform-is-automorphism»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
«lemma:Gaussian-Fourier»
- Fourier transform and Schwartz-space preliminaries.
-
Real.fourierIntegral[axiom-like (no body)]
Define the Fourier transform on Euclidean space with the normalization used by the Cohn-Elkies bound.
Code for Definition5.1●1 definition, incomplete
Associated Lean declarations
-
Real.fourierIntegral[axiom-like (no body)]
-
Real.fourierIntegral[axiom-like (no body)]
-
axiom
Real.fourierIntegral : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.Real.fourierIntegral : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Direct analytic definition.
-
Definition 5.1Blueprint label
-
«def:Fourier-Transform»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
Definition 5.3Blueprint label
-
«def:Schwartz-Space»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
Lemma 5.4Blueprint label
-
«lemma:Fourier-transform-is-automorphism»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
«def:Fourier-Transform»
- Fourier transform and Schwartz-space preliminaries.
- No associated Lean code or declarations.
The Fourier transform of a Gaussian is an explicit Gaussian.
Classical calculation.
-
Definition 5.1Blueprint label
-
«def:Fourier-Transform»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
Lemma 5.2Blueprint label
-
«lemma:Gaussian-Fourier»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
Lemma 5.4Blueprint label
-
«lemma:Fourier-transform-is-automorphism»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
«def:Fourier-Transform»
- Fourier transform and Schwartz-space preliminaries.
-
SchwartzMap[axiom-like (no body)]
Define Schwartz functions as smooth functions with rapid decay of all derivatives.
Code for Definition5.3●1 definition, incomplete
Associated Lean declarations
-
SchwartzMap[axiom-like (no body)]
-
SchwartzMap[axiom-like (no body)]
-
axiom
SchwartzMap : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.SchwartzMap : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Direct functional-analytic definition.
-
Definition 5.1Blueprint label
-
«def:Fourier-Transform»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
Lemma 5.2Blueprint label
-
«lemma:Gaussian-Fourier»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
Definition 5.3Blueprint label
-
«def:Schwartz-Space»
Group- Fourier transform and Schwartz-space preliminaries.
-
-
«def:Fourier-Transform»
- Fourier transform and Schwartz-space preliminaries.
-
SchwartzMap.fourierTransformCLM[axiom-like (no body)]
Fourier transform is an automorphism of Schwartz space.
Code for Lemma5.4●1 definition, incomplete
Associated Lean declarations
-
SchwartzMap.fourierTransformCLM[axiom-like (no body)]
-
SchwartzMap.fourierTransformCLM[axiom-like (no body)]
-
axiom
SchwartzMap.fourierTransformCLM : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.SchwartzMap.fourierTransformCLM : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Standard Schwartz-space Fourier theory.
-
Lemma 5.6Blueprint label
-
«lemma:Schwartz-summable»
Group- Summability lemmas and Poisson summation over lattices.
-
-
Theorem 5.7Blueprint label
-
«thm:Poisson-summation-formula»
Group- Summability lemmas and Poisson summation over lattices.
-
-
Theorem 5.8Blueprint label
-
«thm:smooth-fast-decay-schwartz»
Group- Summability lemmas and Poisson summation over lattices.
-
-
«lemma:Schwartz-summable»
- Summability lemmas and Poisson summation over lattices.
- No associated Lean code or declarations.
Inverse power tails are summable in the range needed for lattice summation arguments.
By comparison with convergent p-series.
-
Lemma 5.5Blueprint label
-
«lemma:inv-power-summable»
Group- Summability lemmas and Poisson summation over lattices.
-
-
Theorem 5.7Blueprint label
-
«thm:Poisson-summation-formula»
Group- Summability lemmas and Poisson summation over lattices.
-
-
Theorem 5.8Blueprint label
-
«thm:smooth-fast-decay-schwartz»
Group- Summability lemmas and Poisson summation over lattices.
-
-
«lemma:inv-power-summable»
- Summability lemmas and Poisson summation over lattices.
- No associated Lean code or declarations.
Summing Schwartz functions over lattices is absolutely convergent.
Use rapid decay together with Lemma 5.5
Inverse power tails are summable in the range needed for lattice summation arguments.
-
Lemma 5.5Blueprint label
-
«lemma:inv-power-summable»
Group- Summability lemmas and Poisson summation over lattices.
-
-
Lemma 5.6Blueprint label
-
«lemma:Schwartz-summable»
Group- Summability lemmas and Poisson summation over lattices.
-
-
Theorem 5.8Blueprint label
-
«thm:smooth-fast-decay-schwartz»
Group- Summability lemmas and Poisson summation over lattices.
-
-
«lemma:inv-power-summable»
- Summability lemmas and Poisson summation over lattices.
-
SchwartzMap.PoissonSummation_Lattices[axiom-like (no body)]
Poisson summation holds for Schwartz functions on lattices.
Code for Theorem5.7●1 definition, incomplete
Associated Lean declarations
-
SchwartzMap.PoissonSummation_Lattices[axiom-like (no body)]
-
SchwartzMap.PoissonSummation_Lattices[axiom-like (no body)]
-
axiom
SchwartzMap.PoissonSummation_Lattices : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.SchwartzMap.PoissonSummation_Lattices : PropThe universe of propositions. `Prop ≡ Sort 0`. Every proposition is propositionally equal to either `True` or `False`.
Apply the Schwartz summability lemmas and Fourier inversion machinery.
-
Lemma 5.5Blueprint label
-
«lemma:inv-power-summable»
Group- Summability lemmas and Poisson summation over lattices.
-
-
Lemma 5.6Blueprint label
-
«lemma:Schwartz-summable»
Group- Summability lemmas and Poisson summation over lattices.
-
-
Theorem 5.7Blueprint label
-
«thm:Poisson-summation-formula»
Group- Summability lemmas and Poisson summation over lattices.
-
-
«lemma:inv-power-summable»
- Summability lemmas and Poisson summation over lattices.
- No associated Lean code or declarations.
-
Lemma 8.11Blueprint label
-
«prop:a-schwartz»
Uses target in- proof
-
-
Lemma 8.24Blueprint label
-
«prop:b-schwartz»
Uses target in- proof
-
-
«prop:a-schwartz»
- proof
Smooth functions with sufficiently fast derivative decay belong to Schwartz space.
Direct from the defining seminorm bounds.