1.11. Proof of The Classical Carleson Theorem
The convergence of partial Fourier sums is proved in The classical Carleson theorem in two steps. In the first step, we establish convergence on a suitable dense subclass of functions. We choose smooth functions as subclass; the convergence is stated in Lemma 1.11.1.2 and proved in Smooth functions. In the second step, one controls the relevant error of approximating a general function by a function in the subclass. This is stated in Lemma 1.11.1.3 and proved in Difference control.
The proof relies on a bound on the real Carleson maximal operator stated in
Lemma 1.11.1.5 and proved in Carleson on the real line, which involves
showing that the real line fits into the setting of
Proof of Metric Space Carleson, overview.
This latter proof refers to the two-sided variant of the Carleson theorem,
Theorem 1.10.1. Two assumptions in
Theorem 1.1.1.1 require more work. The boundedness of the
operator T_r defined earlier is established in Lemma 1.11.1.6;
this lemma is proved in The truncated Hilbert transform. The cancellative property is
verified by Lemma 1.11.1.7, which is proved in
The proof of the van der Corput Lemma. Several further auxiliary lemmas are stated and
proved in The classical Carleson theorem; the proof of one of these auxiliary lemmas,
Lemma 1.11.1.10, is done in
Partial sums as orthogonal projections.
All subsections past The classical Carleson theorem are mutually independent.
1.11.1. The classical Carleson theorem
Let a uniformly continuous 2\pi-periodic function
f:\mathbb{R}\to \mathbb{C} and \epsilon>0 be given. Let
C_{a,q} := \frac{2^{474a^3}}{(q-1)^6}
denote the constant from Theorem 1.10.1. Define
\epsilon' := \frac {\epsilon} {4 C_\epsilon},
where
C_\epsilon = \left(\frac{8}{\pi\epsilon}\right)^\frac{1}{2} C_{4,2} + \pi.
Since f is continuous and periodic, f is uniformly continuous. Thus,
there is a 0<\delta<\pi such that for all x,x' \in \mathbb{R} with
|x-x'|\le \delta we have
|f(x)-f(x')|\le \epsilon'.
Define
f_0:=f \ast \phi_\delta,
where \phi_\delta is a nonnegative smooth bump function with
\supp(\phi_\delta) \subset (-\delta,\delta) and
\int_\mathbb{R} \phi_\delta(x)\,dx = 1.
The function f_0 is 2\pi-periodic. The function f_0 is smooth
and therefore measurable. The function f_0 satisfies, for all
x\in \mathbb{R},
|f(x)-f_0(x)|\le \epsilon'.
Lean code for Lemma1.11.1.1●1 theorem
Associated Lean declarations
-
close_smooth_approx_periodic[complete]
-
close_smooth_approx_periodic[complete]
-
theoremdefined in Carleson/Classical/Approximation.leancomplete
theorem close_smooth_approx_periodic {T : ℝ} {f : ℝ → ℂ} (unicontf : UniformContinuous f) (periodicf : Function.Periodic f T) {ε : ℝ} (εpos : ε > 0) : ∃ f₀, ContDiff ℝ (↑⊤) f₀ ∧ Function.Periodic f₀ T ∧ ∀ (x : ℝ), ‖f x - f₀ x‖ ≤ ε
theorem close_smooth_approx_periodic {T : ℝ} {f : ℝ → ℂ} (unicontf : UniformContinuous f) (periodicf : Function.Periodic f T) {ε : ℝ} (εpos : ε > 0) : ∃ f₀, ContDiff ℝ (↑⊤) f₀ ∧ Function.Periodic f₀ T ∧ ∀ (x : ℝ), ‖f x - f₀ x‖ ≤ ε
Periodicity follows directly from the definitions. The other properties are part of the Lean library.
We prove this in Smooth functions:
-
fourierConv_ofTwiceDifferentiable[complete]
There exists some N_0 \in \mathbb{N} such that for all N>N_0 and
x\in [0,2\pi] we have
|S_N f_0(x)-f_0(x)|\le \frac \epsilon 4.
Lean code for Lemma1.11.1.2●1 theorem
Associated Lean declarations
-
fourierConv_ofTwiceDifferentiable[complete]
-
fourierConv_ofTwiceDifferentiable[complete]
-
theoremdefined in Carleson/Classical/Approximation.leancomplete
theorem fourierConv_ofTwiceDifferentiable {f : ℝ → ℂ} (periodicf : Function.Periodic f (2 * Real.pi)) (fdiff : ContDiff ℝ 2 f) {ε : ℝ} (εpos : ε > 0) : ∃ N₀, ∀ N > N₀, ∀ x ∈ Set.Icc 0 (2 * Real.pi), ‖f x - partialFourierSum N f x‖ ≤ ε
theorem fourierConv_ofTwiceDifferentiable {f : ℝ → ℂ} (periodicf : Function.Periodic f (2 * Real.pi)) (fdiff : ContDiff ℝ 2 f) {ε : ℝ} (εpos : ε > 0) : ∃ N₀, ∀ N > N₀, ∀ x ∈ Set.Icc 0 (2 * Real.pi), ‖f x - partialFourierSum N f x‖ ≤ ε
We prove this in Difference control:
There is a set E \subset \mathbb{R} with Lebesgue measure
|E|\le \epsilon such that for all
x\in [0,2\pi)\setminus E we have
\sup_{N\ge 0} |S_N f(x)-S_N f_0(x)| \le \frac \epsilon 4.
Lean code for Lemma1.11.1.3●1 theorem
Associated Lean declarations
-
control_approximation_effect'[complete]
-
control_approximation_effect'[complete]
-
theoremdefined in Carleson/Classical/ControlApproximationEffectContinuous.leancomplete
theorem control_approximation_effect' {δ ε : NNReal} (δpos : 0 < δ) (εpos : 0 < ε) {g : ℝ → ℂ} (g_measurable : Measurable g) (g_periodic : Function.Periodic g (2 * Real.pi)) (g_bound : ∀ (x : ℝ), ‖g x‖ ≤ ↑(C_control_approximation_effect' δ ε)) : MeasureTheory.distribution (fun x ↦ ⨆ N, ‖partialFourierSum N g x‖ₑ) (↑δ) (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ ↑ε
theorem control_approximation_effect' {δ ε : NNReal} (δpos : 0 < δ) (εpos : 0 < ε) {g : ℝ → ℂ} (g_measurable : Measurable g) (g_periodic : Function.Periodic g (2 * Real.pi)) (g_bound : ∀ (x : ℝ), ‖g x‖ ≤ ↑(C_control_approximation_effect' δ ε)) : MeasureTheory.distribution (fun x ↦ ⨆ N, ‖partialFourierSum N g x‖ₑ) (↑δ) (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ ↑ε
We are now ready to prove Theorem 1.1.1. We first prove a version with explicit exceptional sets.
-
exceptional_set_carleson'[complete]
Let f be a 2\pi-periodic complex-valued continuous function on
\mathbb{R}. For all \epsilon>0, there exists a Borel set
E\subset [0,2\pi] with Lebesgue measure |E|\le \epsilon and a positive
integer N_0 such that for all x\in [0,2\pi]\setminus E and all integers
N>N_0, we have
|f(x)-S_N f(x)|\le \epsilon.
Lean code for Theorem1.11.1.4●1 theorem
Associated Lean declarations
-
exceptional_set_carleson'[complete]
-
exceptional_set_carleson'[complete]
-
theoremdefined in Carleson/Classical/ClassicalCarleson.leancomplete
theorem exceptional_set_carleson' {f : ℝ → ℂ} (cont_f : Continuous f) (periodic_f : Function.Periodic f (2 * Real.pi)) {δ ε : NNReal} (δpos : 0 < δ) (εpos : 0 < ε) : ∃ N₀, MeasureTheory.distribution (fun x ↦ ⨆ N, ⨆ (_ : N > N₀), ‖f x - partialFourierSum N f x‖ₑ) (↑δ) (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ ↑ε
theorem exceptional_set_carleson' {f : ℝ → ℂ} (cont_f : Continuous f) (periodic_f : Function.Periodic f (2 * Real.pi)) {δ ε : NNReal} (δpos : 0 < δ) (εpos : 0 < ε) : ∃ N₀, MeasureTheory.distribution (fun x ↦ ⨆ N, ⨆ (_ : N > N₀), ‖f x - partialFourierSum N f x‖ₑ) (↑δ) (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ ↑ε
Let N_0 be as in Lemma 1.11.1.2. For every
x\in [0,2\pi)\setminus E and every N>N_0 we have by the triangle
inequality
|f(x)-S_N f(x)| \le |f(x)-f_0(x)|+|f_0(x)-S_N f_0(x)|+|S_N f_0(x)-S_N f(x)|.
Using Lemma 1.11.1.1,
Lemma 1.11.1.2, and
Lemma 1.11.1.3, the right-hand side is bounded by
\epsilon' + \frac\epsilon4 + \frac\epsilon4 \le \epsilon. This shows the
desired estimate for the given E and N_0.
Now we turn to the proof of the statement of Carleson theorem given in the introduction.
Proof of Theorem 1.1.1. By applying
Theorem 1.11.1.4 with a sequence of
\epsilon_n := 2^{-n}\delta for n\ge 1 and taking the union of
corresponding exceptional sets E_n, we see that outside a set of measure
\delta, the partial Fourier sums converge pointwise for N\to \infty.
Applying this with a sequence of \delta shrinking to zero and taking the
intersection of the corresponding exceptional sets, which has measure zero,
we see that the Fourier series converges outside a set of measure zero.
Let \kappa:\mathbb{R}\to\mathbb{C} be defined by \kappa(0)=0,
by
\kappa(x)=\frac{1-|x|}{1-e^{ix}}
for 0<|x|<1, and by \kappa(x)=0 for |x|\ge 1.
This function is continuous at every point x with |x|>0.
The proof of Lemma 1.11.1.3 will use Lemma 1.11.1.5, which is proved in Carleson on the real line as an application of Theorem 1.1.1.1.
Let F,G be Borel subsets of \mathbb{R} with finite measure. Let f
be a bounded measurable function on \mathbb{R} with
|f|\le \mathbf{1}_F. Then
\left|\int_G Tf(x)\,dx\right| \le C_{4,2}|F|^{\frac12}|G|^{\frac12},
where
Tf(x)=\sup_{n\in\mathbb{Z}}\sup_{r>0}
\left|\int_{r<|x-y|<1} f(y)\kappa(x-y)e^{iny}\,dy\right|.
Lean code for Lemma1.11.1.5●1 theorem
Associated Lean declarations
-
rcarleson[complete]
-
rcarleson[complete]
-
theoremdefined in Carleson/Classical/CarlesonOnTheRealLineContinuous.leancomplete
theorem rcarleson {F G : Set ℝ} (hF : MeasurableSet F) (hG : MeasurableSet G) (f : ℝ → ℂ) (hmf : Measurable f) (hf : ∀ (x : ℝ), ‖f x‖ ≤ F.indicator 1 x) : ∫⁻ (x : ℝ) in G, carlesonOperatorReal K f x ≤ ↑(C10_0_1 4 2) * MeasureTheory.volume G ^ 2⁻¹ * MeasureTheory.volume F ^ 2⁻¹
theorem rcarleson {F G : Set ℝ} (hF : MeasurableSet F) (hG : MeasurableSet G) (f : ℝ → ℂ) (hmf : Measurable f) (hf : ∀ (x : ℝ), ‖f x‖ ≤ F.indicator 1 x) : ∫⁻ (x : ℝ) in G, carlesonOperatorReal K f x ≤ ↑(C10_0_1 4 2) * MeasureTheory.volume G ^ 2⁻¹ * MeasureTheory.volume F ^ 2⁻¹
One of the main assumptions of Theorem 1.10.1,
concerning the operator T_r defined earlier, is verified by the following
lemma, which is proved in The truncated Hilbert transform.
Let 0<r. Let f be a bounded measurable function on \mathbb{R}.
Then
\|H_rf\|_2\le 2^9\|f\|_2,
where
H_rf(x):=T_rf(x)=\int_{r\le |x-y|}\kappa(x-y)f(y)\,dy.
Lean code for Lemma1.11.1.6●1 theorem
Associated Lean declarations
-
Hilbert_strong_2_2[complete]
-
Hilbert_strong_2_2[complete]
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem Hilbert_strong_2_2 ⦃r : ℝ⦄ (hr : 0 < r) : MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2 MeasureTheory.volume MeasureTheory.volume ↑(C_Ts 4)
theorem Hilbert_strong_2_2 ⦃r : ℝ⦄ (hr : 0 < r) : MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2 MeasureTheory.volume MeasureTheory.volume ↑(C_Ts 4)
The next lemma will be used to verify that the collection \mathfrak{A} of
modulation functions in our application of Theorem 1.1.1.1
satisfies the condition eq-vdc-cond. It is proved in
The proof of the van der Corput Lemma.
Let \alpha\le\beta be real numbers. Let
g:\mathbb{R}\to\mathbb{C} be a measurable function and assume
\|g\|_{\operatorname{Lip}(\alpha,\beta)}
:=\sup_{\alpha\le x\le\beta}|g(x)|
+\frac{|\beta-\alpha|}{2}
\sup_{\alpha\le x<y\le\beta}\frac{|g(y)-g(x)|}{|y-x|}<\infty.
Then, for every n\in\mathbb{Z},
\int_\alpha^\beta g(x)e^{inx}\,dx
\le 2\pi|\beta-\alpha|\|g\|_{\operatorname{Lip}(\alpha,\beta)}
(1+|n||\beta-\alpha|)^{-1}.
Lean code for Lemma1.11.1.7●1 theorem
Associated Lean declarations
-
van_der_Corput[complete]
-
van_der_Corput[complete]
-
theoremdefined in Carleson/Classical/VanDerCorput.leancomplete
theorem van_der_Corput {a b : ℝ} (hab : a ≤ b) {n : ℤ} {φ : ℝ → ℂ} {B K : NNReal} (h1 : LipschitzOnWith K φ (Set.Ioo a b)) (h2 : ∀ x ∈ Set.Ioo a b, ‖φ x‖ ≤ ↑B) : ‖∫ (x : ℝ) in a..b, Complex.exp (Complex.I * ↑n * ↑x) * φ x‖ ≤ 2 * Real.pi * (b - a) * (↑B + ↑K * (b - a) / 2) * (1 + ↑|n| * (b - a))⁻¹
theorem van_der_Corput {a b : ℝ} (hab : a ≤ b) {n : ℤ} {φ : ℝ → ℂ} {B K : NNReal} (h1 : LipschitzOnWith K φ (Set.Ioo a b)) (h2 : ∀ x ∈ Set.Ioo a b, ‖φ x‖ ≤ ↑B) : ‖∫ (x : ℝ) in a..b, Complex.exp (Complex.I * ↑n * ↑x) * φ x‖ ≤ 2 * Real.pi * (b - a) * (↑B + ↑K * (b - a) / 2) * (1 + ↑|n| * (b - a))⁻¹
We close this section with five lemmas that are used across the following subsections.
-
dirichletKernel_eq[complete] -
partialFourierSum_eq_conv_dirichletKernel[complete]
For every 2\pi-periodic bounded measurable f and every N\ge 0,
S_Nf(x)=\frac{1}{2\pi}\int_0^{2\pi} f(y)K_N(x-y)\,dy,
where K_N is the 2\pi-periodic continuous function on
\mathbb{R} given by
\sum_{n=-N}^N e^{inx'}.
If e^{ix'}\ne 1, then
K_N(x')=\frac{e^{iNx'}}{1-e^{-ix'}}
+\frac{e^{-iNx'}}{1-e^{ix'}}.
Lean code for Lemma1.11.1.8●2 theorems
Associated Lean declarations
-
dirichletKernel_eq[complete]
-
partialFourierSum_eq_conv_dirichletKernel[complete]
-
dirichletKernel_eq[complete] -
partialFourierSum_eq_conv_dirichletKernel[complete]
-
theoremdefined in Carleson/Classical/DirichletKernel.leancomplete
theorem dirichletKernel_eq {N : ℕ} {x : ℝ} (h : Complex.exp (Complex.I * ↑x) ≠ 1) : dirichletKernel N x = dirichletKernel' N x
theorem dirichletKernel_eq {N : ℕ} {x : ℝ} (h : Complex.exp (Complex.I * ↑x) ≠ 1) : dirichletKernel N x = dirichletKernel' N x
Second part of Lemma 11.1.8 (Dirichlet kernel) from the paper.
-
theoremdefined in Carleson/Classical/DirichletKernel.leancomplete
theorem partialFourierSum_eq_conv_dirichletKernel {N : ℕ} {f : ℝ → ℂ} {x : ℝ} (h : IntervalIntegrable f MeasureTheory.volume 0 (2 * Real.pi)) : partialFourierSum N f x = 1 / (2 * ↑Real.pi) * ∫ (y : ℝ) in 0..2 * Real.pi, f y * dirichletKernel N (x - y)
theorem partialFourierSum_eq_conv_dirichletKernel {N : ℕ} {f : ℝ → ℂ} {x : ℝ} (h : IntervalIntegrable f MeasureTheory.volume 0 (2 * Real.pi)) : partialFourierSum N f x = 1 / (2 * ↑Real.pi) * ∫ (y : ℝ) in 0..2 * Real.pi, f y * dirichletKernel N (x - y)
First part of lemma 11.1.8 (Dirichlet kernel) from the blueprint.
By definitions and interchanging sum and integral,
S_Nf(x)=\sum_{n=-N}^N \widehat f_n e^{inx}
=\sum_{n=-N}^N\frac{1}{2\pi}\int_0^{2\pi} f(y)e^{in(x-y)}\,dy.
Thus
S_Nf(x)=\frac{1}{2\pi}\int_0^{2\pi}
f(y)\sum_{n=-N}^Ne^{in(x-y)}\,dy.
This proves the first statement of the lemma. By a telescoping sum, for every
x'\in\mathbb{R} we have
\left(e^{\frac12 ix'}-e^{-\frac12 ix'}\right)
\sum_{n=-N}^Ne^{inx'}
= e^{(N+\frac12)ix'}-e^{-(N+\frac12)ix'}.
If e^{ix'}\ne 1, the first factor on the left-hand side is not zero and we
may divide by it to obtain
\sum_{n=-N}^Ne^{inx'}
=\frac{e^{i(N+\frac12)x'}}{e^{\frac12 ix'}-e^{-\frac12 ix'}}
-\frac{e^{-i(N+\frac12)x'}}{e^{\frac12 ix'}-e^{-\frac12 ix'}}
=\frac{e^{iNx'}}{1-e^{-ix'}}
+\frac{e^{-iNx'}}{1-e^{ix'}}.
This proves the second part of the lemma.
Let \eta>0 and
-2\pi+\eta\le x\le 2\pi-\eta with |x|\ge\eta. Then
|1-e^{ix}|\ge \frac{2}{\pi}\eta.
Lean code for Lemma1.11.1.9●1 theorem
Associated Lean declarations
-
lower_secant_bound'[complete]
-
lower_secant_bound'[complete]
-
theoremdefined in Carleson/Classical/Basic.leancomplete
theorem lower_secant_bound' {η x : ℝ} (le_abs_x : η ≤ |x|) (abs_x_le : |x| ≤ 2 * Real.pi - η) : 2 / Real.pi * η ≤ ‖1 - Complex.exp (Complex.I * ↑x)‖
theorem lower_secant_bound' {η x : ℝ} (le_abs_x : η ≤ |x|) (abs_x_le : |x| ≤ 2 * Real.pi - η) : 2 / Real.pi * η ≤ ‖1 - Complex.exp (Complex.I * ↑x)‖
We have
|1-e^{ix}|=\sqrt{(1-\cos x)^2+\sin^2x}\ge |\sin x|.
For 0\le x\le \pi/2, concavity of \sin on [0,\pi],
together with \sin(0)=0 and \sin(\pi/2)=1, gives
|\sin x|\ge \frac{2}{\pi}x\ge \frac{2}{\pi}\eta.
The remaining intervals
x\in \frac{m\pi}{2}+[0,\frac{\pi}{2}] for
m\in\{-4,-3,-2,-1,1,2,3\} are handled similarly.
The following lemma will be proved in Partial sums as orthogonal projections.
Let f be a bounded 2\pi-periodic measurable function. Then, for all
N\ge 0,
\|S_Nf\|_{L^2[0,2\pi]}\le \|f\|_{L^2[0,2\pi]}.
Lean code for Lemma1.11.1.10●1 theorem
Associated Lean declarations
-
spectral_projection_bound[complete]
-
spectral_projection_bound[complete]
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem spectral_projection_bound {f : ℝ → ℂ} {n : ℕ} (hmf : AEMeasurable f MeasureTheory.volume) : MeasureTheory.eLpNorm ((Set.Ioc 0 (2 * Real.pi)).indicator (partialFourierSum n f)) 2 MeasureTheory.volume ≤ MeasureTheory.eLpNorm ((Set.Ioc 0 (2 * Real.pi)).indicator f) 2 MeasureTheory.volume
theorem spectral_projection_bound {f : ℝ → ℂ} {n : ℕ} (hmf : AEMeasurable f MeasureTheory.volume) : MeasureTheory.eLpNorm ((Set.Ioc 0 (2 * Real.pi)).indicator (partialFourierSum n f)) 2 MeasureTheory.volume ≤ MeasureTheory.eLpNorm ((Set.Ioc 0 (2 * Real.pi)).indicator f) 2 MeasureTheory.volume
Lemma 11.1.10.
For x,y\in\mathbb{R} with x\ne y,
|\kappa(x-y)|\le 2^2(2|x-y|)^{-1}.
Lean code for Lemma1.11.1.11●1 theorem
Associated Lean declarations
-
Hilbert_kernel_bound[complete]
-
Hilbert_kernel_bound[complete]
-
theoremdefined in Carleson/Classical/HilbertKernel.leancomplete
theorem Hilbert_kernel_bound {x y : ℝ} : ‖K x y‖ ≤ 2 ^ 2 / (2 * |x - y|)
theorem Hilbert_kernel_bound {x y : ℝ} : ‖K x y‖ ≤ 2 ^ 2 / (2 * |x - y|)
Fix x\ne y. If \kappa(x-y)=0, the estimate is immediate. Otherwise
0<|x-y|<1, and
|\kappa(x-y)|=
\left|\frac{1-|x-y|}{1-e^{i(x-y)}}\right|.
Using Lemma 1.11.1.9,
|\kappa(x-y)|\le \frac{1}{|1-e^{i(x-y)}|}
\le \frac{2}{|x-y|},
which proves the stated bound.
For x,y,y'\in\mathbb{R} with x\ne y,y' and
2|y-y'|\le |x-y|,
we have
|\kappa(x-y)-\kappa(x-y')|
\le 2^8\frac{1}{|x-y|}\frac{|y-y'|}{|x-y|}.
Lean code for Lemma1.11.1.12●1 theorem
Associated Lean declarations
-
Hilbert_kernel_regularity[complete]
-
Hilbert_kernel_regularity[complete]
-
theoremdefined in Carleson/Classical/HilbertKernel.leancomplete
theorem Hilbert_kernel_regularity {x y y' : ℝ} : 2 * |y - y'| ≤ |x - y| → ‖K x y - K x y'‖ ≤ 2 ^ 8 * (1 / |x - y|) * (|y - y'| / |x - y|)
theorem Hilbert_kernel_regularity {x y y' : ℝ} : 2 * |y - y'| ≤ |x - y| → ‖K x y - K x y'‖ ≤ 2 ^ 8 * (1 / |x - y|) * (|y - y'| / |x - y|)
Upon replacing y by y-x and y' by y'-x in the left-hand side of
the closeness assumption, we can assume that x=0. Then the assumption
implies that y and y' have the same sign. Since
\kappa(y)=\bar\kappa(-y), we can assume that they are both positive, and
then it follows that
\frac{y}{2}\le y'.
We distinguish four cases.
If y,y'\le 1, then
|\kappa(-y)-\kappa(-y')|
=\left|\frac{1-y}{1-e^{-iy}}-\frac{1-y'}{1-e^{-iy'}}\right|
and by the fundamental theorem of calculus this equals
\left|\int_{y'}^y
\frac{-1+e^{-it}+i(1-t)e^{it}}{(1-e^{-it})^2}\,dt\right|.
Using y'\ge y/2 and Lemma 1.11.1.9, we bound this by
\le |y-y'|\sup_{\frac{y}{2}\le t\le 1}\frac{3}{|1-e^{-it}|^2}
\le 3|y-y'|\left(2\frac{2}{y}\right)^2
\le 2^6\frac{|y-y'|}{|y|^2}.
If y\le 1 and y'>1, then \kappa(-y')=0 and the first case gives
|\kappa(-y)-\kappa(-y')|
=|\kappa(-y)-\kappa(-1)|
\le 2^6\frac{|y-1|}{|y|^2}
\le 2^6\frac{|y-y'|}{|y|^2}.
Similarly, if y>1 and y'\le 1, then \kappa(-y)=0 and the first
case gives
|\kappa(-y)-\kappa(-y')|
=|\kappa(-y')-\kappa(-1)|
\le 2^6\frac{|y'-1|}{|y'|^2}
\le 2^6\frac{|y-y'|}{|y'|^2}.
Using again y'\ge y/2, this is bounded by
\le 2^6\frac{|y-y'|}{|y/2|^2}
=2^8\frac{|y-y'|}{|y|^2}.
Finally, if y,y'>1, then
|\kappa(-y)-\kappa(-y')|=0
\le 2^8\frac{|y-y'|}{|y|^2}.
1.11.2. Smooth functions
Let f:\mathbb{R} \to \mathbb{C} be 2\pi-periodic and continuously
differentiable, and let n \in \mathbb{Z}\setminus \{0\}. Then
\widehat{f}_n = \frac{1}{i n} \widehat{f'}_n.
Lean code for Lemma1.11.2.1●1 theorem
Associated Lean declarations
-
fourierCoeffOn_of_hasDerivAt[complete]
-
fourierCoeffOn_of_hasDerivAt[complete]
-
theoremdefined in Mathlib/Analysis/Fourier/AddCircle.leancomplete
theorem fourierCoeffOn_of_hasDerivAt {a b : ℝ} (hab : a < b) {f f' : ℝ → ℂ} {n : ℤ} (hn : n ≠ 0) (hf : ∀ x ∈ Set.uIcc a b, HasDerivAt f (f' x) x) (hf' : IntervalIntegrable f' MeasureTheory.volume a b) : fourierCoeffOn hab f n = 1 / (-2 * ↑Real.pi * Complex.I * ↑n) * ((fourier (-n)) ↑a * (f b - f a) - (↑b - ↑a) * fourierCoeffOn hab f' n)
theorem fourierCoeffOn_of_hasDerivAt {a b : ℝ} (hab : a < b) {f f' : ℝ → ℂ} {n : ℤ} (hn : n ≠ 0) (hf : ∀ x ∈ Set.uIcc a b, HasDerivAt f (f' x) x) (hf' : IntervalIntegrable f' MeasureTheory.volume a b) : fourierCoeffOn hab f n = 1 / (-2 * ↑Real.pi * Complex.I * ↑n) * ((fourier (-n)) ↑a * (f b - f a) - (↑b - ↑a) * fourierCoeffOn hab f' n)
Express Fourier coefficients of `f` on an interval in terms of those of its derivative.
This is part of the Lean library.
-
hasSum_fourier_series_of_summable[complete]
Let f:\mathbb{R}\to \mathbb{C} satisfy
\sum_{n\in \mathbb{Z}} |\widehat{f}_n| < \infty.
Then
\sup_{x\in [0,2\pi]} |f(x) - S_N f(x)| \rightarrow 0
as N \rightarrow \infty.
Lean code for Lemma1.11.2.2●1 theorem
Associated Lean declarations
-
hasSum_fourier_series_of_summable[complete]
-
hasSum_fourier_series_of_summable[complete]
-
theoremdefined in Mathlib/Analysis/Fourier/AddCircle.leancomplete
theorem hasSum_fourier_series_of_summable {T : ℝ} [hT : Fact (0 < T)] {f : C(AddCircle T, ℂ)} (h : Summable (fourierCoeff ⇑f)) : HasSum (fun i ↦ fourierCoeff (⇑f) i • fourier i) f
theorem hasSum_fourier_series_of_summable {T : ℝ} [hT : Fact (0 < T)] {f : C(AddCircle T, ℂ)} (h : Summable (fourierCoeff ⇑f)) : HasSum (fun i ↦ fourierCoeff (⇑f) i • fourier i) f
If the sequence of Fourier coefficients of `f` is summable, then the Fourier series converges uniformly to `f`.
This is part of the Lean library.
-
fourierConv_ofTwiceDifferentiable[complete]
Let f:\mathbb{R}\to \mathbb{C} be 2\pi-periodic and twice continuously
differentiable. Then
\sup_{x\in [0,2\pi]} |f(x) - S_N f(x)| \rightarrow 0
as N \rightarrow \infty.
Lean code for Lemma1.11.2.3●1 theorem
Associated Lean declarations
-
fourierConv_ofTwiceDifferentiable[complete]
-
fourierConv_ofTwiceDifferentiable[complete]
-
theoremdefined in Carleson/Classical/Approximation.leancomplete
theorem fourierConv_ofTwiceDifferentiable {f : ℝ → ℂ} (periodicf : Function.Periodic f (2 * Real.pi)) (fdiff : ContDiff ℝ 2 f) {ε : ℝ} (εpos : ε > 0) : ∃ N₀, ∀ N > N₀, ∀ x ∈ Set.Icc 0 (2 * Real.pi), ‖f x - partialFourierSum N f x‖ ≤ ε
theorem fourierConv_ofTwiceDifferentiable {f : ℝ → ℂ} (periodicf : Function.Periodic f (2 * Real.pi)) (fdiff : ContDiff ℝ 2 f) {ε : ℝ} (εpos : ε > 0) : ∃ N₀, ∀ N > N₀, ∀ x ∈ Set.Icc 0 (2 * Real.pi), ‖f x - partialFourierSum N f x‖ ≤ ε
By Lemma 1.11.2.2, it suffices to show that the
Fourier coefficients \widehat{f}_n are summable. Applying
Lemma 1.11.2.1 twice and using the fact that f'' is
continuous and therefore bounded on [0,2\pi], we compute
\sum_{n\in \mathbb{Z}} |\widehat{f}_n|
= |\widehat{f}_0| + \sum_{n\in \mathbb{Z}\setminus \{0\}} \frac {1}{n^2} |\widehat{f''}_n|
\le |\widehat{f}_0| + \left(\sup_{x\in [0,2\pi]} |f(x)| \right) \cdot
\sum_{n\in \mathbb{Z}\setminus \{0\}} \frac {1}{n^2}<\infty.
Lemma 1.11.1.2 now follows directly from Lemma 1.11.2.3.
1.11.3. The truncated Hilbert transform
Let M_n be the modulation operator on measurable 2\pi-periodic
functions defined by
M_ng(x)=g(x)e^{inx}.
Define the approximate Hilbert transform by
L_Ng=\frac1N\sum_{n=0}^{N-1}M_{n+N}S_{N+n}M_{-N-n}g.
For every bounded measurable 2\pi-periodic function g,
\|L_Ng\|_{L^2[0,2\pi]}\le \|g\|_{L^2[0,2\pi]}.
Lean code for Lemma1.11.3.1●1 theorem
Associated Lean declarations
-
modulated_averaged_projection[complete]
-
modulated_averaged_projection[complete]
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem modulated_averaged_projection {g : ℝ → ℂ} {n : ℕ} (hmg : AEMeasurable g MeasureTheory.volume) : MeasureTheory.eLpNorm ((Set.Ioc 0 (2 * Real.pi)).indicator (approxHilbertTransform n g)) 2 MeasureTheory.volume ≤ MeasureTheory.eLpNorm ((Set.Ioc 0 (2 * Real.pi)).indicator g) 2 MeasureTheory.volume
theorem modulated_averaged_projection {g : ℝ → ℂ} {n : ℕ} (hmg : AEMeasurable g MeasureTheory.volume) : MeasureTheory.eLpNorm ((Set.Ioc 0 (2 * Real.pi)).indicator (approxHilbertTransform n g)) 2 MeasureTheory.volume ≤ MeasureTheory.eLpNorm ((Set.Ioc 0 (2 * Real.pi)).indicator g) 2 MeasureTheory.volume
Lemma 11.3.1.
We have
\|M_ng\|_{L^2[0,2\pi]}^2
=\int_0^{2\pi}|e^{inx}g(x)|^2\,dx
=\int_0^{2\pi}|g(x)|^2\,dx
=\|g\|_{L^2[0,2\pi]}^2.
By the triangle inequality, the square root of this identity, and
Lemma 1.11.1.10,
\|L_Ng\|_{L^2[0,2\pi]}
=\left\|\frac1N\sum_{n=0}^{N-1}
M_{n+N}S_{N+n}M_{-N-n}g\right\|_{L^2[0,2\pi]}
\le \frac1N\sum_{n=0}^{N-1}
\|M_{n+N}S_{N+n}M_{-N-n}g\|_{L^2[0,2\pi]}
= \frac1N\sum_{n=0}^{N-1}
\|S_{N+n}M_{-N-n}g\|_{L^2[0,2\pi]}
\le \frac1N\sum_{n=0}^{N-1}\|M_{-N-n}g\|_{L^2[0,2\pi]}
=\|g\|_{L^2[0,2\pi]}.
-
Function.Periodic.intervalIntegral_add_eq[complete] -
intervalIntegral.integral_comp_sub_right[complete]
Let f be a bounded 2\pi-periodic function. For any
0\le x\le 2\pi,
\int_0^{2\pi}f(y)\,dy
=\int_{-x}^{2\pi-x}f(y)\,dy
=\int_{-\pi}^{\pi}f(y-x)\,dy.
Lean code for Lemma1.11.3.2●2 theorems
Associated Lean declarations
-
Function.Periodic.intervalIntegral_add_eq[complete]
-
intervalIntegral.integral_comp_sub_right[complete]
-
Function.Periodic.intervalIntegral_add_eq[complete] -
intervalIntegral.integral_comp_sub_right[complete]
-
theoremdefined in Mathlib/MeasureTheory/Integral/IntervalIntegral/Periodic.leancomplete
theorem Function.Periodic.intervalIntegral_add_eq.{u_1} {E : Type u_1} [NormedAddCommGroup E] {f : ℝ → E} {T : ℝ} [NormedSpace ℝ E] (hf : Function.Periodic f T) (t s : ℝ) : ∫ (x : ℝ) in t..t + T, f x = ∫ (x : ℝ) in s..s + T, f x
theorem Function.Periodic.intervalIntegral_add_eq.{u_1} {E : Type u_1} [NormedAddCommGroup E] {f : ℝ → E} {T : ℝ} [NormedSpace ℝ E] (hf : Function.Periodic f T) (t s : ℝ) : ∫ (x : ℝ) in t..t + T, f x = ∫ (x : ℝ) in s..s + T, f x
If `f` is a periodic function with period `T`, then its integral over `[t, t + T]` does not depend on `t`.
-
theoremdefined in Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.leancomplete
theorem intervalIntegral.integral_comp_sub_right.{u_5} {E : Type u_5} [NormedAddCommGroup E] [NormedSpace ℝ E] {a b : ℝ} (f : ℝ → E) (d : ℝ) : ∫ (x : ℝ) in a..b, f (x - d) = ∫ (x : ℝ) in a - d..b - d, f x
theorem intervalIntegral.integral_comp_sub_right.{u_5} {E : Type u_5} [NormedAddCommGroup E] [NormedSpace ℝ E] {a b : ℝ} (f : ℝ → E) (d : ℝ) : ∫ (x : ℝ) in a..b, f (x - d) = ∫ (x : ℝ) in a - d..b - d, f x
By periodicity and change of variables,
\int_{-x}^0 f(y)\,dy
=\int_{-x}^0 f(y+2\pi)\,dy
=\int_{2\pi-x}^{2\pi} f(y)\,dy.
Breaking up the domain of integration and using this identity gives
\int_0^{2\pi}f(y)\,dy
=\int_0^{2\pi-x}f(y)\,dy+\int_{2\pi-x}^{2\pi}f(y)\,dy
=\int_0^{2\pi-x}f(y)\,dy+\int_{-x}^0f(y)\,dy
=\int_{-x}^{2\pi-x}f(y)\,dy.
The second identity follows by substituting y by y-x.
Let f and g be bounded nonnegative measurable 2\pi-periodic
functions on \mathbb{R}. Then
\left(\int_0^{2\pi}\left(\int_0^{2\pi}
f(y)g(x-y)\,dy\right)^2\,dx\right)^{\frac12}
\le \|f\|_{L^2[0,2\pi]}\|g\|_{L^1[0,2\pi]}.
Lean code for Lemma1.11.3.3●1 theorem
Associated Lean declarations
-
young_convolution[complete]
-
young_convolution[complete]
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem young_convolution {f g : ℝ → ℝ} (hmf : AEMeasurable f MeasureTheory.volume) (hmg : AEMeasurable g MeasureTheory.volume) (periodic_g : Function.Periodic g (2 * Real.pi)) : MeasureTheory.eLpNorm (fun x ↦ ∫ (y : ℝ) in 0..2 * Real.pi, f y * g (x - y)) 2 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ MeasureTheory.eLpNorm f 2 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) * MeasureTheory.eLpNorm g 1 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi)))
theorem young_convolution {f g : ℝ → ℝ} (hmf : AEMeasurable f MeasureTheory.volume) (hmg : AEMeasurable g MeasureTheory.volume) (periodic_g : Function.Periodic g (2 * Real.pi)) : MeasureTheory.eLpNorm (fun x ↦ ∫ (y : ℝ) in 0..2 * Real.pi, f y * g (x - y)) 2 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ MeasureTheory.eLpNorm f 2 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) * MeasureTheory.eLpNorm g 1 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi)))
Lemma 11.3.3.
Using Fubini and Lemma 1.11.3.2, we have
\int_0^{2\pi}\int_0^{2\pi}f(y)^2g(x-y)\,dy\,dx
=\int_0^{2\pi}f(y)^2\int_0^{2\pi}g(x-y)\,dx\,dy
=\int_0^{2\pi}f(y)^2\int_0^{2\pi}g(x)\,dx\,dy
=\|f\|_{L^2[0,2\pi]}^2\|g\|_{L^1[0,2\pi]}.
Let h be the nonnegative square root of g; then h is bounded and
2\pi-periodic with h^2=g. By Cauchy--Schwarz and the preceding
identity, the square of the left-hand side is at most
\int_0^{2\pi}\left(\int_0^{2\pi}f(y)^2g(x-y)\,dy\right)
\left(\int_0^{2\pi}g(x-y)\,dy\right)\,dx
=\|f\|_{L^2[0,2\pi]}^2\|g\|_{L^1[0,2\pi]}^2.
Taking square roots proves the lemma.
For 0<r<1, define the kernel k_r to be the 2\pi-periodic
function
k_r(x):=\min\left(r^{-1},1+\frac{r}{|1-e^{ix}|^2}\right),
where the minimum is understood to be r^{-1} when 1=e^{ix}.
Let g,f be bounded measurable 2\pi-periodic functions. Let
0<r<\pi. Assume |g(x)|\le k_r(x) for all x. Let
h(x)=\int_0^{2\pi}f(y)g(x-y)\,dy.
Then
\|h\|_{L^2[0,2\pi]}\le 17\|f\|_{L^2[-\pi,\pi]}.
Lean code for Lemma1.11.3.4●1 theorem
Associated Lean declarations
-
integrable_bump_convolution[complete]
-
integrable_bump_convolution[complete]
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem integrable_bump_convolution {f g : ℝ → ℝ} (hf : MeasureTheory.MemLp f ⊤ MeasureTheory.volume) (hg : MeasureTheory.MemLp g ⊤ MeasureTheory.volume) (periodic_g : Function.Periodic g (2 * Real.pi)) {r : ℝ} (hr : r ∈ Set.Ioo 0 Real.pi) (hle : ∀ (x : ℝ), |g x| ≤ niceKernel r x) : MeasureTheory.eLpNorm (fun x ↦ ∫ (y : ℝ) in 0..2 * Real.pi, f y * g (x - y)) 2 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ 17 * MeasureTheory.eLpNorm f 2 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi)))
theorem integrable_bump_convolution {f g : ℝ → ℝ} (hf : MeasureTheory.MemLp f ⊤ MeasureTheory.volume) (hg : MeasureTheory.MemLp g ⊤ MeasureTheory.volume) (periodic_g : Function.Periodic g (2 * Real.pi)) {r : ℝ} (hr : r ∈ Set.Ioo 0 Real.pi) (hle : ∀ (x : ℝ), |g x| ≤ niceKernel r x) : MeasureTheory.eLpNorm (fun x ↦ ∫ (y : ℝ) in 0..2 * Real.pi, f y * g (x - y)) 2 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ 17 * MeasureTheory.eLpNorm f 2 (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi)))
Lemma 11.3.4.
By monotonicity of the integral and the pointwise bound on g,
\|g\|_{L^1[0,2\pi]}\le \int_0^{2\pi}k_r(x)\,dx.
Using the symmetry k_r(x)=k_r(-x), the assumption, and
Lemma 1.11.1.9, the last display is
2\int_0^\pi \min\left(\frac1r,1+\frac{r}{|1-e^{ix}|^2}\right)\,dx
\le 2\int_0^r\frac1r\,dx
+2\int_r^\pi\left(1+\frac{64r}{x^2}\right)\,dx
\le 2+2\pi+2\left(\frac{4r}{r}-\frac{4r}{\pi}\right)\le 17.
Together with Lemma 1.11.3.3, this proves the lemma.
-
continuous_dirichletApprox[complete] -
periodic_dirichletApprox[complete] -
approxHilbertTransform_eq_dirichletApprox[complete] -
dist_dirichletApprox_le[complete]
Let 0<r<1, and let N be the smallest integer larger than
1/r. There is a 2\pi-periodic continuous function L' on
\mathbb{R} such that, for all 0\le x\le 2\pi and all
2\pi-periodic bounded measurable functions f,
L_Nf(x)=\frac1{2\pi}\int_0^{2\pi}f(y)L'(x-y)\,dy.
Moreover, for all -\pi\le x\le \pi,
\left|L'(x)-\mathbf{1}_{\{y:\,r<|y|<1\}}\kappa(x)\right|
\le 12k_r(x).
Lean code for Lemma1.11.3.5●4 theorems
Associated Lean declarations
-
continuous_dirichletApprox[complete]
-
periodic_dirichletApprox[complete]
-
approxHilbertTransform_eq_dirichletApprox[complete]
-
dist_dirichletApprox_le[complete]
-
continuous_dirichletApprox[complete] -
periodic_dirichletApprox[complete] -
approxHilbertTransform_eq_dirichletApprox[complete] -
dist_dirichletApprox_le[complete]
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem continuous_dirichletApprox {n : ℕ} : Continuous (dirichletApprox n)
theorem continuous_dirichletApprox {n : ℕ} : Continuous (dirichletApprox n)
Lemma 11.3.5, part 1.
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem periodic_dirichletApprox (n : ℕ) : Function.Periodic (dirichletApprox n) (2 * Real.pi)
theorem periodic_dirichletApprox (n : ℕ) : Function.Periodic (dirichletApprox n) (2 * Real.pi)
Lemma 11.3.5, part 2.
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem approxHilbertTransform_eq_dirichletApprox {f : ℝ → ℂ} (hf : MeasureTheory.MemLp f ⊤ MeasureTheory.volume) {n : ℕ} {x : ℝ} : approxHilbertTransform n f x = ↑(2 * Real.pi)⁻¹ * ∫ (y : ℝ) in 0..2 * Real.pi, f y * dirichletApprox n (x - y)
theorem approxHilbertTransform_eq_dirichletApprox {f : ℝ → ℂ} (hf : MeasureTheory.MemLp f ⊤ MeasureTheory.volume) {n : ℕ} {x : ℝ} : approxHilbertTransform n f x = ↑(2 * Real.pi)⁻¹ * ∫ (y : ℝ) in 0..2 * Real.pi, f y * dirichletApprox n (x - y)
Lemma 11.3.5, part 3.
-
theoremdefined in Carleson/Classical/HilbertStrongType.leancomplete
theorem dist_dirichletApprox_le {r : ℝ} (hr : r ∈ Set.Ioo 0 1) {n : ℕ} (hn : n = ⌈r⁻¹⌉₊) {x : ℝ} (hx : x ∈ Set.Icc (-Real.pi) Real.pi) : dist (dirichletApprox n x) ({y | |y| ∈ Set.Ico r 1}.indicator k x) ≤ 12 * niceKernel r x
theorem dist_dirichletApprox_le {r : ℝ} (hr : r ∈ Set.Ioo 0 1) {n : ℕ} (hn : n = ⌈r⁻¹⌉₊) {x : ℝ} (hx : x ∈ Set.Icc (-Real.pi) Real.pi) : dist (dirichletApprox n x) ({y | |y| ∈ Set.Ico r 1}.indicator k x) ≤ 12 * niceKernel r x
Lemma 11.3.5, part 4. The kernel `dirichletApprox` approximates well the kernel of the Hilbert transform, on `[-π, π]`, up to an error which is uniformly bounded in `L^1` (as it is bounded by a constant multiple of `niceKernel`).
By definition and Lemma 1.11.1.8,
L_Ng(x)=\frac1N\sum_{n=0}^{N-1}
\int_0^{2\pi}e^{-i(N+n)x}K_{N+n}(x-y)e^{i(N+n)y}g(y)\,dy.
This has the required convolution form with
L'(x)=\frac1N\sum_{n=0}^{N-1}K_{N+n}(x)e^{-i(N+n)x}.
With the exponential-sum formula eqksumexp from Lemma 1.11.1.8,
we have |K_N(x)|\le 2N+1 for every x, and hence
|L'(x)|\le \frac1N\sum_{n=0}^{N-1}(2N+2n+1)\le 4N\le 2^3r^{-1}.
Therefore, for |x|\in [0,r)\cup(1,\pi], we have
\left|L'(x)-\mathbf{1}_{\{y:\,r<|y|<1\}}(x)\kappa(x)\right|
=|L'(x)|\le 2^3r^{-1}.
This proves eqdifflhil for |x|\in[0,r) since k_r(x)=r^{-1} in this
case.
For e^{ix}\ne 1, the Hilbert-form expression eqksumhil from
Lemma 1.11.1.8 gives
L'(x)=\frac1N\sum_{n=0}^{N-1}
\left(\frac{e^{i(N+n)x}}{1-e^{-ix}}+
\frac{e^{-i(N+n)x}}{1-e^{ix}}\right)e^{i(N+n)x}
=\frac1N\sum_{n=0}^{N-1}
\left(\frac{e^{i2(N+n)x}}{1-e^{-ix}}+\frac1{1-e^{ix}}\right)
and hence
L'(x)=\frac{1}{1-e^{ix}}
+\frac1N\frac{e^{i2Nx}}{1-e^{-ix}}\sum_{n=0}^{N-1}e^{i2nx}.
Therefore
L'(x)-\mathbf{1}_{\{y:\,r<|y|<1\}}\kappa(x)
=L''(x)+
\frac{1-\mathbf{1}_{\{y:\,r<|y|<1\}}(x)(1-|x|)}{1-e^{ix}},
where
L''(x):=\frac1N\frac{e^{i2Nx}}{1-e^{-ix}}\sum_{n=0}^{N-1}e^{i2nx}.
For x\in[-\pi,r]\cup[r,\pi], using Lemma 1.11.1.9 gives
\left|\frac{1-\mathbf{1}_{\{y:\,r<|y|<1\}}(x)(1-|x|)}{1-e^{ix}}\right|
=\left|\frac{\min(|x|,1)}{1-e^{ix}}\right|
\le \frac{2\min(|x|,1)}{|x|}
\le 2k_r(x).
It remains to estimate L''. If the real part of e^{ix} is negative,
then 1\le |1-e^{-ix}|\le 2, so
|L''(x)|\le \frac1N\sum_{n=0}^{N-1}1=1
\le 1+\frac{r}{|1-e^{ix}|^2}.
If the real part is positive and still e^{ix}\ne\pm1, telescoping gives
(1-e^{2ix})\sum_{n=0}^{N-1}e^{i2nx}=1-e^{i2Nx}.
As e^{2ix}\ne1, we may divide by 1-e^{2ix} and insert this into
eqhil3 to obtain
L''(x)=\frac1N\frac{e^{i2Nx}}{1-e^{-ix}}
\frac{1-e^{i2Nx}}{1-e^{2ix}},
and, using the nonnegativity of the real part of e^{ix},
|L''(x)|\le \frac2N\frac1{|1-e^{ix}|}\frac1{|1-e^{2ix}|}
=\frac2N\frac1{|1-e^{ix}|^2}\frac1{|1+e^{ix}|}
\le \frac{2r}{|1-e^{ix}|^2}
\le 2\left(1+\frac{r}{|1-e^{ix}|^2}\right).
For |x|\in [r,\pi], one checks
1+\frac{r}{|1-e^{ix}|^2}\le 5k_r(x). Thus the estimates above show that
|L''(x)|\le 10k_r(x) in this range. Together with the previous
2k_r(x) bound, this proves eqdifflhil for |x|\in[r,\pi]. Since
|x|\in[0,r) was covered by eqdiffzero, this completes the proof.
We now prove Lemma 1.11.1.6.
Proof of Lemma 1.11.1.6. We first show that if f is
supported in [1,4], then
\|H_rf\|_{L^2[2,3]}\le 2^8\|f\|_{L^2(\mathbb{R})}.
Let \tilde f be the 2\pi-periodic extension of f to
\mathbb{R}, and let N be the smallest integer larger than 1/r.
Then the identity eqdifflhil shows that the kernels of H_r and 2\pi L_N
differ by at most 12k_r on [-\pi,\pi]. Consider x\in[2,3]. When computing
H_rf(x) and 2\pi L_Nf(x), the kernels are computed at points of the
form x-y with f(y)\ne0, hence y\in[1,4]. Since x\in[2,3], the
difference x-y is bounded in absolute value by 2 and therefore belongs
to [-\pi,\pi], where the above bound holds.
Thus for x\in[2,3],
|H_r\tilde f(x)|\le 2\pi |L_N\tilde f(x)|
+12\left|\int_0^{2\pi}k_r(x-y)\tilde f(y)\,dy\right|.
Taking the L^2 norm and using subadditivity gives
\|H_r\tilde f\|_{L^2[2,3]}\le
2\pi\|L_N\tilde f\|_{L^2[0,2\pi]}
+12\left(\int_0^{2\pi}
\left|\int_0^{2\pi}k_r(x-y)\tilde f(y)\,dy\right|^2\,dx\right)^{1/2}.
Since \kappa is supported in [-1,1], H_r\tilde f agrees with
H_rf on [2,3]. Using
Lemma 1.11.3.1 and
Lemma 1.11.3.4, gives
\|H_rf\|_{L^2[2,3]}
\le 2\pi\|f\|_{L^2[0,2\pi]}+12\cdot 17\|f\|_{L^2[0,2\pi]},
which gives the short-support estimate.
Suppose now that f is supported in [c,c+3] for some c\in\mathbb{R}.
Then g(x)=f(x-c+1) is supported in [1,4]. By a change of variables in
def-H-r, H_rg(x)=H_rf(x-c+1). Thus, by the short-support estimate,
\|H_rf\|_{L^2[c+1,c+2]}\le 2^8\|f\|_2.
Let now f be arbitrary. Since \kappa(x)=0 for |x|>1, for all
x\in[c+1,c+2] we have
H_rf(x)=H_r(f\mathbf{1}_{[c,c+3]})(x). Thus
\int_{c+1}^{c+2}|H_rf(x)|^2\,dx
=\int_{c+1}^{c+2}|H_r(f\mathbf{1}_{[c,c+3]})(x)|^2\,dx.
Applying the short-support bound gives
\le 2^{16}\int_c^{c+3}|f(x)|^2\,dx.
Summing over all c\in\mathbb{Z} gives
\int_{\mathbb{R}}|H_rf(x)|^2\,dx
\le 3\cdot 2^{16}\int_{\mathbb{R}}|f(x)|^2\,dx.
This completes the proof.
1.11.4. The proof of the van der Corput Lemma
Proof of Lemma 1.11.1.7. Let g be Lipschitz continuous as in
the lemma. If n=0, then
\int_\alpha^\beta g(x)\,dx
\le |\beta-\alpha|\sup_{\alpha\le x\le\beta}|g(x)|
\le |\beta-\alpha|\|g\|_{\operatorname{Lip}(\alpha,\beta)}
(1+|n||\beta-\alpha|)^{-1}.
Assume now n\ne 0; by symmetry we may suppose n>0.
If \beta-\alpha<\pi/n, the triangle inequality gives
\left|\int_\alpha^\beta g(x)e^{inx}\,dx\right|
\le |\beta-\alpha|\sup_{x\in[\alpha,\beta]}|g(x)|
\le 2\pi|\beta-\alpha|\|g\|_{\operatorname{Lip}(\alpha,\beta)}
(1+|n||\beta-\alpha|)^{-1}.
Now suppose \pi/n\le \beta-\alpha. Since
e^{in(x+\pi/n)}=-e^{inx}, we write
\int_\alpha^\beta g(x)e^{inx}\,dx
=\frac12\int_\alpha^\beta g(x)e^{inx}\,dx
-\frac12\int_\alpha^\beta g(x)e^{in(x+\pi/n)}\,dx.
We split the first integral at \alpha+\pi/n and the second one at
\beta-\pi/n, and make a change of variables in the second part of the first
integral to obtain
=\frac12\int_\alpha^{\alpha+\pi/n}g(x)e^{inx}\,dx
-\frac12\int_{\beta-\pi/n}^{\beta}g(x)e^{in(x+\pi/n)}\,dx
+\frac12\int_{\alpha+\pi/n}^{\beta}
\left(g(x)-g\left(x-\frac{\pi}{n}\right)\right)e^{inx}\,dx.
The sum of the first two terms is, by the triangle inequality, bounded by
\frac{\pi}{n}\sup_{x\in[\alpha,\beta]}|g(x)|.
The third term is, by the triangle inequality, at most
\frac12\int_{\alpha+\pi/n}^{\beta}
\left|g(x)-g\left(x-\frac{\pi}{n}\right)\right|\,dx
\le \frac{|\beta-\alpha|}{2}\frac{\pi}{n}
\sup_{\alpha\le x<y\le\beta}\frac{|g(x)-g(y)|}{|x-y|}.
Adding the two terms, we obtain
\left|\int_\alpha^\beta g(x)e^{-inx}\,dx\right|
\le \frac{\pi}{n}\|g\|_{\operatorname{Lip}(\alpha,\beta)}.
This completes the proof of the lemma, using that with
\frac{\pi}{n}\le \beta-\alpha,
\frac{\pi}{n}
=\frac{2\pi|\beta-\alpha|}{2n|\beta-\alpha|}
\le
2\pi|\beta-\alpha|(1+n|\beta-\alpha|)^{-1},
as required.
1.11.5. Partial sums as orthogonal projections
This subsection proves Lemma 1.11.1.10.
Proof of Lemma 1.11.1.10. The functions
e_n:x\mapsto e^{inx} form an orthonormal basis in
L^2[-\pi,\pi], which is already in Mathlib. Therefore
\|S_Nf\|^2_{L^2[-\pi,\pi]}
=\left\|\sum_{n=-N}^N \langle\widehat f_n,e_n\rangle_{L^2[-\pi,\pi]}\right\|^2_{L^2[-\pi,\pi]}
=\sum_{n=-N}^N|\widehat f_n|
\le \sum_{n\in\mathbb{Z}}|\widehat f_n|
=\|f\|_{L^2[-\pi,\pi]}.
This completes the proof.
1.11.6. Difference control
-
Dirichlet_Hilbert_diff[complete]
For all N\in\mathbb{Z} and
x\in [-\pi,\pi]\setminus\{0\},
\left|K_N(x) - \left(e^{-iNx}\kappa(x) +
\overline{e^{-iNx}\kappa(x)}\right)\right| \le \pi.
Lean code for Lemma1.11.6.1●1 theorem
Associated Lean declarations
-
Dirichlet_Hilbert_diff[complete]
-
Dirichlet_Hilbert_diff[complete]
-
theoremdefined in Carleson/Classical/ControlApproximationEffectBasic.leancomplete
theorem Dirichlet_Hilbert_diff {N : ℕ} {x : ℝ} (hx : x ∈ Set.Icc (-Real.pi) Real.pi) : ‖dirichletKernel' N x - (Complex.exp (Complex.I * (-↑N * ↑x)) * k x + (starRingEnd ℂ) (Complex.exp (Complex.I * (-↑N * ↑x)) * k x))‖ ≤ Real.pi
theorem Dirichlet_Hilbert_diff {N : ℕ} {x : ℝ} (hx : x ∈ Set.Icc (-Real.pi) Real.pi) : ‖dirichletKernel' N x - (Complex.exp (Complex.I * (-↑N * ↑x)) * k x + (starRingEnd ℂ) (Complex.exp (Complex.I * (-↑N * ↑x)) * k x))‖ ≤ Real.pi
Let N\in\mathbb{Z} and
x\in [-\pi,\pi]\setminus\{0\}. With Lemma 1.11.1.8,
we obtain
K_N(x) - \left(e^{-iNx}\kappa(x) + \overline{e^{-iNx}\kappa(x)}\right)
= e^{-iNx}\frac{\min(|x|,1)}{1-e^{ix}}
+ e^{iNx}\frac{\min(|x|,1)}{1-e^{-ix}}.
Using Lemma 1.11.1.9 with
\eta = \min(|x|,1), we bound
\left|K_N(x) - \left(e^{-iNx}\kappa(x) +
\overline{e^{-iNx}\kappa(x)}\right)\right|
\le \frac{\min(|x|,1)}{|1-e^{ix}|}
+ \frac{\min(|x|,1)}{|1-e^{-ix}|}
\le \frac{\pi}{2}+\frac{\pi}{2}=\pi.
-
partialFourierSum_bound[complete]
Let g:\mathbb{R}\to\mathbb{C} be a measurable
2\pi-periodic function such that, for some \delta>0 and every
x\in\mathbb{R},
|g(x)|\le \delta.
Then for every x\in [0,2\pi] and N>0,
|S_N g(x)| \le \frac{1}{2\pi}(Tg(x)+T\bar g(x))+\pi\delta.
Lean code for Lemma1.11.6.2●1 theorem
Associated Lean declarations
-
partialFourierSum_bound[complete]
-
partialFourierSum_bound[complete]
-
theoremdefined in Carleson/Classical/ControlApproximationEffectBasic.leancomplete
theorem partialFourierSum_bound {g : ℝ → ℂ} (periodic_g : Function.Periodic g (2 * Real.pi)) (hg : IntervalIntegrable g MeasureTheory.volume 0 (2 * Real.pi)) {N : ℕ} {x : ℝ} (hx : x ∈ Set.Icc 0 (2 * Real.pi)) : ‖partialFourierSum N g x‖ₑ ≤ operatorBound g x
theorem partialFourierSum_bound {g : ℝ → ℂ} (periodic_g : Function.Periodic g (2 * Real.pi)) (hg : IntervalIntegrable g MeasureTheory.volume 0 (2 * Real.pi)) {N : ℕ} {x : ℝ} (hx : x ∈ Set.Icc 0 (2 * Real.pi)) : ‖partialFourierSum N g x‖ₑ ≤ operatorBound g x
Let x\in [0,2\pi] and N>0. With Lemma 1.11.1.8 we have
|S_N g(x)| = \frac{1}{2\pi}
\left|\int_0^{2\pi} g(y)K_N(x-y)\,dy\right|.
Using the 2\pi-periodicity of g and K_N, we shift the integration
domain and obtain
\frac{1}{2\pi}
\left|\int_{x-\pi}^{x+\pi} g(y)K_N(x-y)\,dy\right|.
By the triangle inequality, this is bounded by
\frac{1}{2\pi}\left|\int_{x-\pi}^{x+\pi}
g(y)\left(K_N(x-y)-\max(|x-y|,0)K_N(x-y)\right)\,dy\right|
plus
\frac{1}{2\pi}\left|\int_{x-\pi}^{x+\pi}
g(y)\max(|x-y|,0)K_N(x-y)\,dy\right|.
All integrals are well defined, since K_N is bounded by 2N+1.
Using
\max(|x-y|,0)K_N(x-y)
= e^{-iN(x-y)}\kappa(x-y)+
\overline{e^{-iN(x-y)}\kappa(x-y)},
Lemma 1.11.6.1, and the bound on g, the integrable
difference term is at most \pi\delta. By dominated convergence and since
\kappa(x-y)=0 for |x-y|>1, the singular term equals
\frac{1}{2\pi}\lim_{r\to 0^+}\left|
\int_{r<|x-y|<1} g(y)\max(|x-y|,0)K_N(x-y)\,dy\right|.
Bounding the limit by a supremum, rewriting with the preceding identity, and
using the triangle inequality gives
\le \frac{1}{2\pi}\sup_{r>0}\left|
\int_{r<|x-y|<1} g(y)e^{-iNy}\kappa(x-y)\,dy\right|
+ \frac{1}{2\pi}\sup_{r>0}\left|
\int_{r<|x-y|<1} \overline g(y)e^{-iNy}\kappa(x-y)\,dy\right|.
By the definition of T, this is bounded by
\frac{1}{2\pi}(Tg(x)+T\bar g(x)).
-
carlesonOperatorReal_measurable[complete]
Let f be a bounded measurable function on \mathbb{R}. Then Tf,
as defined earlier, is measurable.
Lean code for Lemma1.11.6.3●1 theorem
Associated Lean declarations
-
carlesonOperatorReal_measurable[complete]
-
carlesonOperatorReal_measurable[complete]
-
theoremdefined in Carleson/Classical/CarlesonOperatorReal.leancomplete
theorem carlesonOperatorReal_measurable {f : ℝ → ℂ} (meas_f : MeasureTheory.AEStronglyMeasurable f MeasureTheory.volume) (hf : ∀ (x : ℝ), MeasureTheory.IntegrableOn f (Set.Ioo x (x + 2)) MeasureTheory.volume) : Measurable (carlesonOperatorReal K f)
theorem carlesonOperatorReal_measurable {f : ℝ → ℂ} (meas_f : MeasureTheory.AEStronglyMeasurable f MeasureTheory.volume) (hf : ∀ (x : ℝ), MeasureTheory.IntegrableOn f (Set.Ioo x (x + 2)) MeasureTheory.volume) : Measurable (carlesonOperatorReal K f)
Since a countable supremum of measurable functions is measurable, it suffices
to show that for every n\in\mathbb{Z},
x \mapsto \sup_{r>0}\left|
\int_{r<|x-y|<1} f(y)\kappa(x-y)e^{iny}\,dy\right|
is measurable. Fix n\in\mathbb{Z}. For each x\in\mathbb{R}, the map
r \mapsto \left|\int_{r<|x-y|<1}
f(y)\kappa(x-y)e^{iny}\,dy\right|
is continuous on (0,\infty), because the integrand is locally bounded on
0<|x-y|<1 by the assumptions on f and
Lemma 1.11.1.11. Hence, for each x\in\mathbb{R},
\sup_{r>0}\left|\int_{r<|x-y|<1}
f(y)\kappa(x-y)e^{iny}\,dy\right|
=\sup_{r\in\mathbb{Q}_{>0}}\left|\int_{r<|x-y|<1}
f(y)\kappa(x-y)e^{iny}\,dy\right|.
The right-hand side is again a countable supremum, so it remains to prove
that for every r\in\mathbb{Q}_{>0},
x \mapsto \left|\int_{r<|x-y|<1}
f(y)\kappa(x-y)e^{iny}\,dy\right|
= \left|\int \mathbf{1}_{\{r<|x-\cdot|<1\}}(y)
f(y)\kappa(x-y)e^{iny}\,dy\right|
is measurable. This follows because the integrand is measurable in
(x,y).
-
control_approximation_effect'[complete]
Let g:\mathbb{R}\to\mathbb{C} be a measurable 2\pi-periodic function
such that, for some \delta>0 and every x\in\mathbb{R},
|g(x)|\le \delta.
Then for every \epsilon>0, there exists a measurable set
E\subset [0,2\pi] with |E|<\epsilon such that, for every
x\in [0,2\pi]\setminus E and N>0,
|S_N g(x)|\le C_\epsilon\delta,
where
C_\epsilon =
\left(\frac{8}{\pi\epsilon}\right)^\frac{1}{2}C_{4,2}+\pi.
Lean code for Lemma1.11.6.4●1 theorem
Associated Lean declarations
-
control_approximation_effect'[complete]
-
control_approximation_effect'[complete]
-
theoremdefined in Carleson/Classical/ControlApproximationEffectContinuous.leancomplete
theorem control_approximation_effect' {δ ε : NNReal} (δpos : 0 < δ) (εpos : 0 < ε) {g : ℝ → ℂ} (g_measurable : Measurable g) (g_periodic : Function.Periodic g (2 * Real.pi)) (g_bound : ∀ (x : ℝ), ‖g x‖ ≤ ↑(C_control_approximation_effect' δ ε)) : MeasureTheory.distribution (fun x ↦ ⨆ N, ‖partialFourierSum N g x‖ₑ) (↑δ) (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ ↑ε
theorem control_approximation_effect' {δ ε : NNReal} (δpos : 0 < δ) (εpos : 0 < ε) {g : ℝ → ℂ} (g_measurable : Measurable g) (g_periodic : Function.Periodic g (2 * Real.pi)) (g_bound : ∀ (x : ℝ), ‖g x‖ ≤ ↑(C_control_approximation_effect' δ ε)) : MeasureTheory.distribution (fun x ↦ ⨆ N, ‖partialFourierSum N g x‖ₑ) (↑δ) (MeasureTheory.volume.restrict (Set.Ioc 0 (2 * Real.pi))) ≤ ↑ε
Define
E := \left\{x\in [0,2\pi]\;:\;
\sup_{N>0}|S_Ng(x)|>C_\epsilon\delta\right\}.
Then the desired bound on S_Ng(x) is clear outside E, and it remains
to show that |E|\le \epsilon. By Lemma 1.11.6.2,
E \subset
\left\{x\in[0,2\pi]\;:\;
C_\epsilon\delta <
\frac{1}{2\pi}(Tg(x)+T\bar g(x))+\pi\delta\right\}
\subset E_1\cup E_2,
where
E_1:=\{x\in[0,2\pi]\;:\;\pi(C_\epsilon-\pi)\delta<Tg(x)\}
and
E_2:=\{x\in[0,2\pi]\;:\;\pi(C_\epsilon-\pi)\delta<T\bar g(x)\}.
By Lemma 1.11.6.3, E_1 and E_2 are
measurable. Thus
\pi(C_\epsilon-\pi)\delta |E_1|
\le \int_{E_1} Tg(x)\,dx
= \delta\int_{E_1} T(\delta^{-1}g\mathbf{1}_{[-\pi,3\pi]})(x)\,dx.
Applying Lemma 1.11.1.5 with F=[-\pi,3\pi] and G=E_1,
this is bounded by
\delta\cdot C_{4,2}|F|^\frac{1}{2}|E_1|^\frac{1}{2}
\le (4\pi)^\frac{1}{2}C_{4,2}\delta |E_1|^\frac{1}{2}.
Rearranging gives
|E_1| \le
\left(\frac{(4\pi)^\frac{1}{2}C_{4,2}}
{\pi(C_\epsilon-\pi)}\right)^2
=\frac{\epsilon}{2}.
The same estimate holds for |E_2|. The result follows from
|E|\le |E_1|+|E_2|.
Lemma 1.11.1.3 follows directly from
Lemma 1.11.6.4 with \delta:=\epsilon'.
1.11.7. Carleson on the real line
We prove Lemma 1.11.1.5.
Consider the standard distance function \rho(x,y)=|x-y| on the real
line \mathbb{R}.
-
instProperSpaceReal[complete] -
locallyCompact_of_proper[complete] -
Real.instCompleteSpace[complete]
The space (\mathbb{R},\rho) is a complete locally compact metric space.
Lean code for Lemma1.11.7.1●3 theorems
Associated Lean declarations
-
instProperSpaceReal[complete]
-
locallyCompact_of_proper[complete]
-
Real.instCompleteSpace[complete]
-
instProperSpaceReal[complete] -
locallyCompact_of_proper[complete] -
Real.instCompleteSpace[complete]
-
theoremdefined in Mathlib/Topology/MetricSpace/ProperSpace.leancomplete
theorem instProperSpaceReal : ProperSpace ℝ
theorem instProperSpaceReal : ProperSpace ℝ
-
theoremdefined in Mathlib/Topology/MetricSpace/ProperSpace.leancomplete
theorem locallyCompact_of_proper.{u} {α : Type u} [PseudoMetricSpace α] [ProperSpace α] : LocallyCompactSpace α
theorem locallyCompact_of_proper.{u} {α : Type u} [PseudoMetricSpace α] [ProperSpace α] : LocallyCompactSpace α
A proper space is locally compact
-
theoremdefined in Mathlib/Topology/UniformSpace/Real.leancomplete
theorem Real.instCompleteSpace : CompleteSpace ℝ
theorem Real.instCompleteSpace : CompleteSpace ℝ
This is part of the Lean library.
For x\in\mathbb{R} and R>0, the ball B(x,R) is the interval
(x-R,x+R).
Lean code for Lemma1.11.7.2●1 theorem
Associated Lean declarations
-
Real.ball_eq_Ioo[complete]
-
Real.ball_eq_Ioo[complete]
-
theoremdefined in Mathlib/Topology/MetricSpace/Pseudo/Defs.leancomplete
theorem Real.ball_eq_Ioo (x r : ℝ) : Metric.ball x r = Set.Ioo (x - r) (x + r)
theorem Real.ball_eq_Ioo (x r : ℝ) : Metric.ball x r = Set.Ioo (x - r) (x + r)
Let x'\in B(x,R). By definition, |x'-x|<R, hence
x'<x+R and x'>x-R. Thus x'\in (x-R,x+R). Conversely, if
x'\in(x-R,x+R), then x'-x<R and x-x'<R, so |x'-x|<R and
x'\in B(x,R).
We consider the Lebesgue measure \mu on \mathbb{R}.
The measure \mu is a sigma-finite nonzero Radon-Borel measure on
\mathbb{R}.
Lean code for Lemma1.11.7.3●1 theorem
Associated Lean declarations
-
instIsAddHaarMeasureVolume[complete]
-
instIsAddHaarMeasureVolume[complete]
-
theoremdefined in Mathlib/MeasureTheory/Measure/Haar/OfBasis.leancomplete
theorem instIsAddHaarMeasureVolume.{u_3} {E : Type u_3} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E] : MeasureTheory.volume.IsAddHaarMeasure
theorem instIsAddHaarMeasureVolume.{u_3} {E : Type u_3} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E] : MeasureTheory.volume.IsAddHaarMeasure
This is part of the Lean library.
For every x\in\mathbb{R} and R>0,
\mu(B(x,R))=2R.
Lean code for Lemma1.11.7.4●1 theorem
Associated Lean declarations
-
Real.volume_ball[complete]
-
Real.volume_ball[complete]
-
theoremdefined in Mathlib/MeasureTheory/Measure/Lebesgue/Basic.leancomplete
theorem Real.volume_ball (a r : ℝ) : MeasureTheory.volume (Metric.ball a r) = ENNReal.ofReal (2 * r)
theorem Real.volume_ball (a r : ℝ) : MeasureTheory.volume (Metric.ball a r) = ENNReal.ofReal (2 * r)
By Lemma 1.11.7.2,
\mu(B(x,R))=\mu((x-R,x+R))=2R.
For every x\in\mathbb{R} and R>0,
\mu(B(x,2R))=2\mu(B(x,R)).
Lean code for Lemma1.11.7.5●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ToMathlib/MeasureTheory/Measure/IsDoubling.leancomplete
theorem MeasureTheory.InnerProductSpace.IsDoubling.{u_1} {E : Type u_1} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [MeasurableSpace E] [BorelSpace E] [FiniteDimensional ℝ E] : MeasureTheory.volume.IsDoubling (2 ^ Module.finrank ℝ E)
theorem MeasureTheory.InnerProductSpace.IsDoubling.{u_1} {E : Type u_1} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [MeasurableSpace E] [BorelSpace E] [FiniteDimensional ℝ E] : MeasureTheory.volume.IsDoubling (2 ^ Module.finrank ℝ E)
By Lemma 1.11.7.4,
\mu(B(x,2R))=4R=2\mu(B(x,R)).
The preceding four lemmas show that (\mathbb{R},\rho,\mu,4) is a doubling
metric measure space. Indeed, we even show that
(\mathbb{R},\rho,\mu,1) is a doubling metric measure space, but we may
relax the estimate in Lemma 1.11.7.5 to conclude that
(\mathbb{R},\rho,\mu,4) is a doubling metric measure space.
For each n\in\mathbb{Z} define
\mathfrak{a}_n:\mathbb{R}\to\mathbb{R} by
\mathfrak{a}_n(x)=nx. Let \mathfrak{A} be the collection
\{\mathfrak{a}_n:n\in\mathbb{Z}\}. For every n\in\mathbb{Z} we have
\mathfrak{a}_n(0)=0. Define
d_{B(x,R)}(\mathfrak{a}_n,\mathfrak{a}_m):=2R|n-m|.
For every R>0 and x\in\mathbb{R}, the function
d_{B(x,R)} is a metric on \mathfrak{A}.
Lean code for Lemma1.11.7.6●1 definition
Associated Lean declarations
-
instFunctionDistancesReal[complete]
-
instFunctionDistancesReal[complete]
-
defdefined in Carleson/Classical/CarlesonOnTheRealLineBasic.leancomplete
def instFunctionDistancesReal : FunctionDistances ℝ ℝ
def instFunctionDistancesReal : FunctionDistances ℝ ℝ
This follows immediately from the fact that the standard metric on
\mathbb{Z} is a metric.
For every R>0 and x\in\mathbb{R}, and for all
n,m\in\mathbb{Z},
\sup_{y,y'\in B(x,R)} |ny-ny'-my+my'|\le 2|n-m|R.
Lean code for Lemma1.11.7.7●1 theorem
Associated Lean declarations
-
oscillation_control[complete]
-
oscillation_control[complete]
-
theoremdefined in Carleson/Classical/CarlesonOnTheRealLineBasic.leancomplete
theorem oscillation_control {x r : ℝ} {f g : Θ ℝ} : localOscillation (Metric.ball x r) (coeΘ f) (coeΘ g) ≤ ENNReal.ofReal (dist_{x, r} f g)
theorem oscillation_control {x r : ℝ} {f g : Θ ℝ} : localOscillation (Metric.ball x r) (coeΘ f) (coeΘ g) ≤ ENNReal.ofReal (dist_{x, r} f g)
The right-hand side is the supremum of
|(n-m)(y-x)-(n-m)(y'-x)|
over y,y'\in B(x,R). The estimate follows from the triangle inequality.
For any x,x'\in\mathbb{R} and R,R'>0 with
B(x,R)\subset B(x',R'), and for any n,m\in\mathbb{Z},
d_{B(x,R)}(\mathfrak{a}_n,\mathfrak{a}_m)
\le d_{B(x',R')}(\mathfrak{a}_n,\mathfrak{a}_m).
Lean code for Lemma1.11.7.8●1 theorem
Associated Lean declarations
-
frequency_monotone[complete]
-
frequency_monotone[complete]
-
theoremdefined in Carleson/Classical/CarlesonOnTheRealLineBasic.leancomplete
theorem frequency_monotone {x₁ x₂ r R : ℝ} {f g : Θ ℝ} (h : Metric.ball x₁ r ⊆ Metric.ball x₂ R) : dist_{x₁, r} f g ≤ dist_{x₂, R} f g
theorem frequency_monotone {x₁ x₂ r R : ℝ} {f g : Θ ℝ} (h : Metric.ball x₁ r ⊆ Metric.ball x₂ R) : dist_{x₁, r} f g ≤ dist_{x₂, R} f g
This follows immediately from the definition of d_{B(x,R)} and
R\le R'.
For any x,x'\in\mathbb{R} and R>0 with
x\in B(x',2R), and any n,m\in\mathbb{Z},
d_{B(x',2R)}(\mathfrak{a}_n,\mathfrak{a}_m)
\le 2d_{B(x,R)}(\mathfrak{a}_n,\mathfrak{a}_m).
Lean code for Lemma1.11.7.9●1 theorem
Associated Lean declarations
-
frequency_ball_doubling[complete]
-
frequency_ball_doubling[complete]
-
theoremdefined in Carleson/Classical/CarlesonOnTheRealLineBasic.leancomplete
theorem frequency_ball_doubling {x₁ x₂ r : ℝ} {f g : Θ ℝ} : dist_{x₂, 2 * r} f g ≤ 2 * dist_{x₁, r} f g
theorem frequency_ball_doubling {x₁ x₂ r : ℝ} {f g : Θ ℝ} : dist_{x₂, 2 * r} f g ≤ 2 * dist_{x₁, r} f g
With eqcarl4, both sides of firstdb1 are equal to 4R|n-m|. This
proves the lemma.
For any x,x'\in\mathbb{R} and R>0 with
B(x,R)\subset B(x',2R), and any n,m\in\mathbb{Z},
2d_{B(x,R)}(\mathfrak{a}_n,\mathfrak{a}_m)
\le d_{B(x',2R)}(\mathfrak{a}_n,\mathfrak{a}_m).
Lean code for Lemma1.11.7.10●1 theorem
Associated Lean declarations
-
frequency_ball_growth[complete]
-
frequency_ball_growth[complete]
-
theoremdefined in Carleson/Classical/CarlesonOnTheRealLineBasic.leancomplete
theorem frequency_ball_growth {x₁ x₂ r : ℝ} {f g : Θ ℝ} : 2 * dist_{x₁, r} f g ≤ dist_{x₂, 2 * r} f g
theorem frequency_ball_growth {x₁ x₂ r : ℝ} {f g : Θ ℝ} : 2 * dist_{x₁, r} f g ≤ dist_{x₂, 2 * r} f g
With eqcarl4, both sides of seconddb1 are equal to 4R|n-m|. This
proves the lemma.
For every x\in\mathbb{R}, R>0, n\in\mathbb{Z}, and R'>0,
there exist m_1,m_2,m_3\in\mathbb{Z} such that
B'\subset B_1\cup B_2\cup B_3,
where
B'=\{\mathfrak{a}\in\mathfrak{A}:d_{B(x,R)}(\mathfrak{a},\mathfrak{a}_n)<2R'\}
and, for j=1,2,3,
B_j=\{\mathfrak{a}\in\mathfrak{A}:d_{B(x,R)}(\mathfrak{a},\mathfrak{a}_{m_j})<R'\}.
Lean code for Lemma1.11.7.11●1 theorem
Associated Lean declarations
-
integer_ball_cover[complete]
-
integer_ball_cover[complete]
-
theoremdefined in Carleson/Classical/CarlesonOnTheRealLineBasic.leancomplete
theorem integer_ball_cover {x R R' : ℝ} {f : WithFunctionDistance x R} : CoveredByBalls (ball_{x, R} f (2 * R')) 3 R'
theorem integer_ball_cover {x R R' : ℝ} {f : WithFunctionDistance x R} : CoveredByBalls (ball_{x, R} f (2 * R')) 3 R'
Let m_1 be the largest integer smaller than or equal to
n-\frac{R'}{2R}. Let m_2=n. Let m_3 be the smallest integer larger
than or equal to n+\frac{R'}{2R}.
Let \mathfrak{a}_{n'}\in B'. Then, with the definition of
d_{B(x,R)}, we have
2R|n-n'|<2R'.
Assume first n'\le m_1. Then
R|m_1-n'|=R(m_1-n')=R(m_1-n)+R(n-n')
<-\frac{R'}{2}+R'=\frac{R'}{2},
so \mathfrak{a}_{n'}\in B_1.
Assume next m_1<n'<m_3. Then \mathfrak{a}_{n'}\in B_2.
Assume finally that m_3\le n'. Then
R|m_3-n'|=R(n'-m_3)=R(n'-n)+R(n-m_3)
<R'-\frac{R'}{2}=\frac{R'}{2},
so \mathfrak{a}_{n'}\in B_3. This completes the proof.
For any x\in\mathbb{R} and R>0, and any function
\varphi:X\to\mathbb{C} supported on B'=B(x,R) such that
\|\varphi\|_{\operatorname{Lip}(B')}
=\sup_{x\in B'}|\varphi(x)|
+R\sup_{x,y\in B',x\ne y}\frac{|\varphi(x)-\varphi(y)|}{\rho(x,y)}
is finite, and for any n,m\in\mathbb{Z},
\left|\int_{B'}e(\mathfrak{a}_n(x)-\mathfrak{a}_m(x))
\varphi(x)\,d\mu(x)\right|
\le 2\pi\mu(B')\frac{\|\varphi\|_{\operatorname{Lip}(B')}}
{1+d_{B'}(\mathfrak{a}_n,\mathfrak{a}_m)}.
Lean code for Lemma1.11.7.12●1 theorem
Associated Lean declarations
-
real_van_der_Corput[complete]
-
real_van_der_Corput[complete]
-
theoremdefined in Carleson/Classical/CarlesonOnTheRealLineBasic.leancomplete
theorem real_van_der_Corput : IsCancellative ℝ (defaultτ 4)
theorem real_van_der_Corput : IsCancellative ℝ (defaultτ 4)
Set n'=n-m. We need to prove
\left|\int_{x-R}^{x+R} e^{in'y}\varphi(y)\,dy\right|
\le 4\pi R\|\varphi\|_{\operatorname{Lip}(B')}
(1+2R|n'|)^{-1}.
This follows from Lemma 1.11.1.7 with
\alpha=x-R and \beta=x+R.
The preceding chain of lemmas establishes that \mathfrak{A} is a
cancellative compatible collection of functions on
(\mathbb{R},\rho,\mu,4). Some statements are stronger than needed for
a=4, but can be relaxed to the assumptions of Theorem 1.1.1.1
and the desired conclusion.
With \kappa as above, define K:\mathbb{R}\times\mathbb{R}\to\mathbb{C}
by
K(x,y):=\kappa(x-y).
The function K is continuous outside the diagonal x=y and vanishes on
the diagonal, hence it is measurable.
By Lemma 1.11.1.11 and
Lemma 1.11.1.12, K is a two-sided
Calderon--Zygmund kernel on (\mathbb{R},\rho,\mu,4).
Lemma 1.11.1.6 verifies the required truncated-operator
bound. Thus all assumptions of Theorem 1.10.1
are satisfied, and applying that theorem proves Lemma 1.11.1.5.