1.7. Proof of the Forest Operator Proposition
1.7.1. The pointwise tree estimate
Fix a forest (\fU, \fT). The main result of this subsection is
Lemma 1.7.1.3, we begin this section with some definitions
necessary to state the lemma.
For \fu \in \fU and x\in X, we define
\sigma (\fu, x):=\{\ps(\fp):\fp\in \fT(\fu), x\in E(\fp)\}.
This is a subset of \mathbb{Z} \cap [-S, S], so has a minimum and a
maximum. We set
\overline{\sigma} (\fu, x) := \max \sigma(\fT(\fu), x)
\underline{\sigma} (\fu, x) := \min\sigma(\fT(\fu), x).
-
TileStructure.Forest.convex_scales[complete]
For each \fu \in \fU, we have
\sigma(\fu, x) = \mathbb{Z} \cap [\underline{\sigma} (\fu, x), \overline{\sigma} (\fu, x)].
Lean code for Lemma1.7.1.1●1 theorem
Associated Lean declarations
-
TileStructure.Forest.convex_scales[complete]
-
TileStructure.Forest.convex_scales[complete]
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.convex_scales.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x : X} (hu : u ∈ t) : (↑(t.σ u x)).OrdConnected
theorem TileStructure.Forest.convex_scales.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x : X} (hu : u ∈ t) : (↑(t.σ u x)).OrdConnected
Lemma 7.1.1, freely translated.
Proof. Let s \in \mathbb{Z} with
\underline{\sigma} (\fu, x) \le s \le \overline{\sigma} (\fu, x). By
definition of \sigma, there exists \fp \in \fT(\fu) with
\ps(\fp) = \underline{\sigma} (\fu, x) and x \in E(\fp), and there
exists \fp'' \in \fT(\fu) with
\ps(\fp'') = \overline{\sigma} (\fu, x) and
x \in E(\fp'') \subset \scI(\fp''). By property coverdyadic of the dyadic
grid, there exists a cube I \in \mathcal{D} of scale s with x \in I.
By property eq-dis-freq-cover, there exists a tile \fp' \in \fP(I) with
\tQ(x) \in \fc(\fp'). By the dyadic property dyadicproperty we have
\scI(\fp) \subset \scI(\fp') \subset \scI(\fp''), and by
eq-freq-dyadic, we have \fc(\fp'') \subset \fc(\fp') \subset \fc(\fp).
Thus \fp \le \fp' \le\fp'', which gives with the convexity property
forest2 of \fT(\fu) that \fp' \in \fT(\fu), so
s \in \sigma(\fu, x).
For a nonempty collection of tiles \mathfrak{S} \subset \fP we define
\mathcal{J}_0(\mathfrak{S})
to be the collection of all dyadic cubes J \in \mathcal{D} such that
s(J) = -S or
\scI(\fp) \not\subset B(c(J), 100D^{s(J) + 1})
for all \fp \in \mathfrak{S}. We define \mathcal{J}(\mathfrak{S}) to
be the collection of inclusion maximal cubes in
\mathcal{J}_0(\mathfrak{S}).
We further define
\mathcal{L}_0(\mathfrak{S})
to be the collection of dyadic cubes L \in \mathcal{D} such that
s(L) = -S, or there exists \fp \in \mathfrak{S} with
L \subset \scI(\fp) and there exists no \fp \in \mathfrak{S} with
\scI(\fp) \subset L. We define \mathcal{L}(\mathfrak{S}) to be the
collection of inclusion maximal cubes in \mathcal{L}_0(\mathfrak{S}).
-
TileStructure.Forest.biUnion_𝓙[complete] -
TileStructure.Forest.pairwiseDisjoint_𝓙[complete] -
TileStructure.Forest.biUnion_𝓛[complete] -
TileStructure.Forest.pairwiseDisjoint_𝓛[complete]
For each \mathfrak{S} \subset \fP, we have
\bigcup_{I \in \mathcal{D}} I = \dot{\bigcup_{J \in \mathcal{J}(\mathfrak{S})}} J
and
\bigcup_{I \in \mathcal{D}} I = \dot{\bigcup_{L \in \mathcal{L}(\mathfrak{S})}} L.
Lean code for Lemma1.7.1.2●4 theorems
Associated Lean declarations
-
TileStructure.Forest.biUnion_𝓙[complete]
-
TileStructure.Forest.pairwiseDisjoint_𝓙[complete]
-
TileStructure.Forest.biUnion_𝓛[complete]
-
TileStructure.Forest.pairwiseDisjoint_𝓛[complete]
-
TileStructure.Forest.biUnion_𝓙[complete] -
TileStructure.Forest.pairwiseDisjoint_𝓙[complete] -
TileStructure.Forest.biUnion_𝓛[complete] -
TileStructure.Forest.pairwiseDisjoint_𝓛[complete]
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.biUnion_𝓙.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {𝔖 : Set (𝔓 X)} : ⋃ J ∈ TileStructure.Forest.𝓙 𝔖, ↑J = ⋃ I, ↑I
theorem TileStructure.Forest.biUnion_𝓙.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {𝔖 : Set (𝔓 X)} : ⋃ J ∈ TileStructure.Forest.𝓙 𝔖, ↑J = ⋃ I, ↑I
Part of Lemma 7.1.2
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.pairwiseDisjoint_𝓙.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {𝔖 : Set (𝔓 X)} : (TileStructure.Forest.𝓙 𝔖).PairwiseDisjoint fun I ↦ ↑I
theorem TileStructure.Forest.pairwiseDisjoint_𝓙.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {𝔖 : Set (𝔓 X)} : (TileStructure.Forest.𝓙 𝔖).PairwiseDisjoint fun I ↦ ↑I
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.biUnion_𝓛.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {𝔖 : Set (𝔓 X)} : ⋃ J ∈ TileStructure.Forest.𝓛 𝔖, ↑J = ⋃ I, ↑I
theorem TileStructure.Forest.biUnion_𝓛.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {𝔖 : Set (𝔓 X)} : ⋃ J ∈ TileStructure.Forest.𝓛 𝔖, ↑J = ⋃ I, ↑I
Part of Lemma 7.1.2
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.pairwiseDisjoint_𝓛.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {𝔖 : Set (𝔓 X)} : (TileStructure.Forest.𝓛 𝔖).PairwiseDisjoint fun I ↦ ↑I
theorem TileStructure.Forest.pairwiseDisjoint_𝓛.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {𝔖 : Set (𝔓 X)} : (TileStructure.Forest.𝓛 𝔖).PairwiseDisjoint fun I ↦ ↑I
Part of Lemma 7.1.2
Proof. Since \mathcal{J}(\mathfrak{S}) is the set of inclusion maximal cubes
in \mathcal{J}_0(\mathfrak{S}), cubes in \mathcal{J}(\mathfrak{S}) are
pairwise disjoint by dyadicproperty. The same applies to
\mathcal{L}(\mathfrak{S}).
If x \in \bigcup_{I \in \mathcal{D}} I, then there exists by
coverdyadic a cube I \in \mathcal{D} with x \in I and
s(I) = -S. Then I \in \mathcal{J}_0(\mathfrak{S}). There exists an
inclusion maximal cube in \mathcal{J}_0(\mathfrak{S}) containing I.
This cube contains x and is contained in \mathcal{J}(\mathfrak{S}).
This shows one inclusion in eq-J-partition, the other one follows from
\mathcal{J}(\mathfrak{S}) \subset \mathcal{D}.
The proof of the two inclusions in eq-L-partition is similar.
For a finite collection of pairwise disjoint cubes \mathcal{C}, define the
projection operator
P_{\mathcal{C}}f(x) :=\sum_{J\in\mathcal{C}}\mathbf{1}_J(x) \frac{1}{\mu(J)}\int_J f(y) \, \mathrm{d}\mu(y).
Given a scale -S \le s\le S and a point
x \in \bigcup_{I\in \mathcal{D}, s(I) = s} I, there exists a unique cube
in \mathcal{D} of scale s containing x by coverdyadic. We denote it
by I_s(x). Define for \mfa \in \Mf the nontangential maximal operator
T_{\mathcal{N}}^\mfa f(x) := \sup_{-S \le s_1 < S} \sup_{x' \in I_{s_1}(x)} \sup_{\substack{s_1 \le s_2 \le S\\ D^{s_2-1} \le R_Q(\mfa, x')}} \left| \sum_{s = s_1}^{s_2} \int K_s(x',y) f(y) \, \mathrm{d}\mu(y) \right|.
Define for each \fu \in \fU the auxiliary operator
S_{1,\fu}f(x)
:=\sum_{I\in\mathcal{D}} \mathbf{1}_{I}(x) \sum_{\substack{J\in \mathcal{J}(\fT(\fu))\\
J\subset B(c(I), 16 D^{s(I)})\\ s(J) \le s(I)}} \frac{D^{(s(J) - s(I))/a}}{\mu(B(c(I), 16D^{s(I)}))}\int_J |f(y)| \, \mathrm{d}\mu(y).
Define also the collection of balls
\mathcal{B} = \{B(c(I), 2^s D^{s(I)+t}) \ : \ I \in \mathcal{D}\,, 0 \le s \le S + 5\,, 0 \le t \le 2S+3\}.
The following pointwise estimate for operators associated to sets \fT(\fu)
is the main result of this subsection.
Let \fu \in \fU and L \in \mathcal{L}(\fT(\fu)). Let x, x' \in L.
Then for all bounded functions f with bounded support
\left|\sum_{\fp \in \fT(\fu)} T_{\fp}[ e(-\fcc(\fu))f](x)\right|
\leq 2^{129a^3}(M_{\mathcal{B},1}+S_{1,\fu})P_{\mathcal{J}(\fT(\fu))}|f|(x')+|T_{\mathcal{N}}^{\fcc(\fu)} P_{\mathcal{J}(\fT(\fu))}f(x')|.
Lean code for Lemma1.7.1.3●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.pointwise_tree_estimate.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x x' : X} {f : X → ℂ} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) (hx : x ∈ L) (hx' : x' ∈ L) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ‖carlesonSum ((fun x ↦ t.𝔗 x) u) (fun y ↦ Complex.exp (Complex.I * -↑((𝒬 u) y)) * f y) x‖ₑ ≤ ↑(TileStructure.Forest.C7_1_3 a) * (maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ‖f x‖) x' + t.boundaryOperator u (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ↑‖f x‖) x') + TileStructure.Forest.nontangentialMaximalFunction (𝒬 u) (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) f) x'
theorem TileStructure.Forest.pointwise_tree_estimate.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x x' : X} {f : X → ℂ} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) (hx : x ∈ L) (hx' : x' ∈ L) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ‖carlesonSum ((fun x ↦ t.𝔗 x) u) (fun y ↦ Complex.exp (Complex.I * -↑((𝒬 u) y)) * f y) x‖ₑ ≤ ↑(TileStructure.Forest.C7_1_3 a) * (maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ‖f x‖) x' + t.boundaryOperator u (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ↑‖f x‖) x') + TileStructure.Forest.nontangentialMaximalFunction (𝒬 u) (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) f) x'
Lemma 7.1.3.
Proof. By definetp, if T_{\fp}[ e(-\fcc(\fu))f](x) \ne 0, then
x \in E(\fp). Combining this with |e(\fcc(\fu)(x))| = 1, we obtain
|\sum_{\fp \in \fT(\fu)} T_{\fp}[ e(-\fcc(\fu))f](x)|
= \Bigg| \sum_{s \in \sigma(\fu, x)} \int e(-\fcc(\fu)(y) + \tQ(x)(y) + \fcc(\fu)(x) -\tQ(x)(x))\times
K_s(x,y)f(y) \, \mathrm{d}\mu(y) \Bigg|.
Using the triangle inequality, we bound this by the sum of three terms:
\le \Bigg| \sum_{s \in \sigma(\fu, x)} \int (e(-\fcc(\fu)(y) + \tQ(x)(y) + \fcc(\fu)(x) -\tQ(x)(x))-1)\times
K_s(x,y)f(y) \, \mathrm{d}\mu(y) \Bigg|
+ \Bigg| \sum_{s \in \sigma(\fu, x)} \int K_s(x,y) P_{\mathcal{J}(\fT(\fu))} f(y) \, \mathrm{d}\mu(y) \Bigg|
+ \Bigg| \sum_{s \in \sigma(\fu, x)} \int K_s(x,y) (f(y) - P_{\mathcal{J}(\fT(\fu))} f(y)) \, \mathrm{d}\mu(y) \Bigg|.
The proof is completed using the bounds for these three terms proven
respectively in Lemma 1.7.1.4, Lemma 1.7.1.5 and
Lemma 1.7.1.6.
For all \fu \in \fU, all L \in \mathcal{L}(\fT(\fu)), all
x, x' \in L and all bounded f with bounded support, we have
the estimate eq-term-A:
10 \cdot 2^{104a^3} M_{\mathcal{B}, 1}P_{\mathcal{J}(\fT(\fu))}|f|(x').
Lean code for Lemma1.7.1.4●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.first_tree_pointwise.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x x' : X} {f : X → ℂ} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) (hx : x ∈ L) (hx' : x' ∈ L) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ‖∑ i ∈ t.σ u x, ∫ (y : X), (Complex.exp (Complex.I * (-↑((𝒬 u) y) + ↑((Q x) y) + ↑((𝒬 u) x) - ↑((Q x) x))) - 1) * Ks i x y * f y‖ₑ ≤ ↑(TileStructure.Forest.C7_1_4 a) * maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ‖f x‖) x'
theorem TileStructure.Forest.first_tree_pointwise.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x x' : X} {f : X → ℂ} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) (hx : x ∈ L) (hx' : x' ∈ L) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ‖∑ i ∈ t.σ u x, ∫ (y : X), (Complex.exp (Complex.I * (-↑((𝒬 u) y) + ↑((Q x) y) + ↑((𝒬 u) x) - ↑((Q x) x))) - 1) * Ks i x y * f y‖ₑ ≤ ↑(TileStructure.Forest.C7_1_4 a) * maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ‖f x‖) x'
Lemma 7.1.4
Proof. Let s \in \sigma(\fu,x). If x, y \in X are such that
K_s(x,y)\neq 0, then, by supp-Ks, we have
\rho(x,y)\leq 1/2 D^s. By 1-Lipschitz continuity of the function
t \mapsto \exp(it) = e(t) and the property osccontrol of the metrics
d_B, it follows that
|e(-\fcc(\fu)(y)+\tQ(x)(y)+\fcc(\fu)(x)-\tQ(x)(x))-1|
\leq d_{B(x, 1/2 D^{s})}(\fcc(\fu), \tQ(x)).
Let \fp_s \in \fT(\fu) be a tile with \ps(\fp_s) = s and
x \in E(\fp_s), and let \fp' be a tile with
\ps(\fp') = \overline{\sigma}(\fu, x) and x \in E(\fp'). Using the
monotonicity property monotonedb, the doubling property firstdb
repeatedly, the definition of d_{\fp} and Lemma 1.2.1.2, we can
bound the previous display by
d_{B(x, 4 D^{s})}(\fcc(\fu), \tQ(x)) \leq 2^{4a} d_{\fp_s}(\fcc(\fu), \tQ(x)) \le 2^{4a} 2^{s - \overline{\sigma}(\fu, x)} d_{\fp'}(\fcc(\fu), \tQ(x)).
Since \fcc(\fu) \in B_{\fp'}(\fcc(\fp'), 4) by forest1 and
\tQ(x) \in \Omega(\fp') \subset B_{\fp'}(\fcc(\fp'), 1) by
eq-freq-comp-ball, this is estimated by
\le 5 \cdot 2^{4a} 2^{s - \overline{\sigma}(\fu, x)}.
Using eq-Ks-size, it follows that eq-term-A is bounded by
5\cdot 2^{103a^3} \sum_{s\in\sigma(x)}2^{s - \overline{\sigma}(\fu, x)} \frac{1}{\mu(B(x,D^s))}\int_{B(x,0.5D^{s})}|f(y)|\,\mathrm{d}\mu(y).
By eq-J-partition, the collection \mathcal{J} is a partition of
\bigcup_{I \in \mathcal{D}} I, so this is estimated by
5\cdot 2^{103a^3} \sum_{s\in\sigma(x)}2^{s - \overline{\sigma}(\fu, x)} \frac{1}{\mu(B(x,D^s))}\sum_{\substack{J \in \mathcal{J}(\fT(\fu))\\J \cap B(x, 0.5D^s) \ne \emptyset} }\int_{J}|f(y)|\,\mathrm{d}\mu(y).
This expression does not change if we replace |f| by
P_{\mathcal{J}(\fT(\fu))}|f|.
Let J \in \mathcal{J}(\fT(\fu)) with
B(x, 0.5 D^s) \cap J \ne \emptyset. By the triangle inequality and since
x \in E(\fp_s) \subset B(\pc(\fp_s), 4D^{s}), it follows that
B(\pc(\fp_s), 4.5D^s) \cap J \ne \emptyset. If s(J) \ge s and
s(J) > -S, then it follows from the triangle inequality,
eq-vol-sp-cube and defineD that
\scI(\fp_s) \subset B(c(J), 100 D^{s(J)+1}), contradicting
J \in \mathcal{J}(\mathfrak{T}(\fu)). Thus s(J) \le s - 1 or
s(J) = -S. If s(J) = -S and s(J) > s - 1, then s = -S. Thus we
always have s(J) \le s. It then follows from the triangle inequality and
eq-vol-sp-cube that J \subset B(\pc(\fp_s), 16 D^s).
Thus we can continue our chain of estimates with
5\cdot 2^{103a^3} \sum_{s\in\sigma(x)}2^{s - \overline{\sigma}(\fu, x)} \frac{1}{\mu(B(x,D^s))}\int_{B(\pc(\fp_s),16 D^s)}P_{\mathcal{J}(\fT(\fu))}|f(y)|\,\mathrm{d}\mu(y).
We have B(\pc(\fp_s), 16D^s)) \subset B(x, 32D^s), by eq-vol-sp-cube
and the triangle inequality, since x \in \scI(\fp_s). Combining this with
the doubling property doublingx, we obtain
\mu(B(\pc(\fp_s), 16D^s)) \le 2^{5a} \mu(B(x, D^s)).
Since a \ge 4, it follows that eq-term-A is bounded by
5\cdot 2^{103a^3} \sum_{s\in\sigma(x)}2^{s - \overline{\sigma}(\fu, x)} \frac{1}{\mu(B(\pc(\fp_s),16D^s))}\int_{B(\pc(\fp_s),16D^s)}P_{\mathcal{J}(\fT(\fu))}|f(y)|\,\mathrm{d}\mu(y).
Since L \in \mathcal{L}(\fT(\fu)) and x\in L \cap \scI(\fp_s), we have
s(L) \le \ps(\fp_s). It follows by dyadicproperty that
L \subset \scI(\fp_s), in particular
x' \in \scI(\fp_s) \subset B(\pc(\fp_s), 16D^s). Thus
\le 5\cdot 2^{104a^3} \sum_{s\in\sigma(x)}2^{s - \overline{\sigma}(\fu, x)} M_{\mathcal{B}, 1}P_{\mathcal{J}(\fT(\fu))}|f|(x')
\le 10\cdot 2^{104a^3} M_{\mathcal{B}, 1}P_{\mathcal{J}(\fT(\fu))}|f|(x').
This completes the estimate for term eq-term-A.
For all \fu \in \fU, all L \in \mathcal{L}(\fT(\fu)), all
x, x' \in L and all bounded f with bounded support, we have
\Bigg| \sum_{s \in \sigma(\fu, x)} \int K_s(x,y) P_{\mathcal{J}(\fT(\fu))} f(y) \, \mathrm{d}\mu(y) \Bigg| \le T_{\mathcal{N}}^{\fcc(\fu)} P_{\mathcal{J}(\fT(\fu))} f(x').
Lean code for Lemma1.7.1.5●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.second_tree_pointwise.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x x' : X} {f : X → ℂ} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) (hx : x ∈ L) (hx' : x' ∈ L) : ‖∑ i ∈ t.σ u x, ∫ (y : X), Ks i x y * TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) f y‖ₑ ≤ TileStructure.Forest.nontangentialMaximalFunction (𝒬 u) (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) f) x'
theorem TileStructure.Forest.second_tree_pointwise.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x x' : X} {f : X → ℂ} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) (hx : x ∈ L) (hx' : x' ∈ L) : ‖∑ i ∈ t.σ u x, ∫ (y : X), Ks i x y * TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) f y‖ₑ ≤ TileStructure.Forest.nontangentialMaximalFunction (𝒬 u) (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) f) x'
Lemma 7.1.5
Proof. Let s_1 = \underline{\sigma}(\fu, x). By definition, there exists a
tile \fp \in \fT(\fu) with \ps(\fp) = s_1 and x \in E(\fp). Then
x \in \scI(\fp) \cap L. By dyadicproperty and the definition of
\mathcal{L}(\fT(\fu)), it follows that L \subset \scI(\fp), so
x \in I_{s_1}(x').
Next, let s_2 = \overline{\sigma}(\fu, x) and let
\fp' \in \fT(\fu) with \ps(\fp') = s_2 and x \in E(\fp'). Since
\fp' \in \fT(\fu), we have 4\fp' \lesssim \fu. Since
\tQ(x) \in \fc(\fp'), it follows that
d_{\fp}(\fcc(\fu), \tQ(x)) \le 5.
Applying the doubling property firstdb five times, we obtain
d_{B(c(\fp), 8D^{s_2})}(\fcc(\fu), \tQ(x)) \le 5 \cdot 2^{5a}.
By the triangle inequality, we have
B(x, D^{s_2}) \subset B(c(\fp), 8 D^{s_2}), so by monotonedb
d_{B(x, D^{s_2})}(\fcc(\fu), \tQ(x)) \le 5 \cdot 2^{5a}.
Finally, by applying seconddb 100a times, we obtain
d_{B(x, D^{s_2-1})}(\fcc(\fu), \tQ(x)) \le 5 \cdot 2^{-95a} < 1.
Consequently, D^{s_2 - 1} < R_Q(\fcc(\fu), x). The lemma now follows from
the definition of T_{\mathcal{N}}.
For all \fu \in \fU, all L \in \mathcal{L}(\fT(\fu)), all
x, x' \in L and all bounded f with bounded support, we have
\Bigg| \sum_{s \in \sigma(\fu, x)} \int K_s(x,y) (f(y) - P_{\mathcal{J}(\fT(\fu))} f(y)) \, \mathrm{d}\mu(y) \Bigg|
\le 2^{128a^3} S_{1,\fu} P_{\mathcal{J}(\fT(\fu))}|f|(x').
Lean code for Lemma1.7.1.6●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/PointwiseEstimate.leancomplete
theorem TileStructure.Forest.third_tree_pointwise.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x x' : X} {f : X → ℂ} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) (hx : x ∈ L) (hx' : x' ∈ L) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ‖∑ i ∈ t.σ u x, ∫ (y : X), Ks i x y * (f y - TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) f y)‖ₑ ≤ ↑(TileStructure.Forest.C7_1_6 a) * t.boundaryOperator u (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ↑‖f x‖) x'
theorem TileStructure.Forest.third_tree_pointwise.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {x x' : X} {f : X → ℂ} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) (hx : x ∈ L) (hx' : x' ∈ L) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ‖∑ i ∈ t.σ u x, ∫ (y : X), Ks i x y * (f y - TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) f y)‖ₑ ≤ ↑(TileStructure.Forest.C7_1_6 a) * t.boundaryOperator u (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ↑‖f x‖) x'
Lemma 7.1.6
Proof. We have for J \in \mathcal{J}(\fT(\fu))
\int_J K_{s}(x,y)(1 - P_{\mathcal{J}(\fT(\fu))})f(y) \, \mathrm{d}\mu(y)
= \int_J \frac{1}{\mu(J)} \int_J K_s(x,y) - K_s(x,z) \, \mathrm{d}\mu(z) \,f(y) \, \mathrm{d}\mu(y).
By eq-Ks-smooth and eq-vol-sp-cube, we have for y, z \in J
|K_s(x,y) - K_s(x,z)| \le \frac{2^{127a^3}}{\mu(B(x, D^s))} \left(\frac{8 D^{s(J)}}{D^s}\right)^{1/a}.
Suppose that s \in \sigma(\fu, x). If K_s(x,y) \ne 0 for some
y \in J \in \mathcal{J}(\fT(\fu)) then, by supp-Ks,
y \in B(x, 0.5 D^s) \cap J \ne \emptyset. Let
\fp \in \fT(\fu) with \ps(\fp) = s and x \in E(\fp). Then
B(\pc(\fp_s), 4.5D^s) \cap J \ne \emptyset by the triangle inequality. If
s(J) \ge s and s(J) > -S, then it follows from the triangle inequality,
eq-vol-sp-cube and defineD that
\scI(\fp) \subset B(c(J), 100 D^{s(J)+1}), contradicting
J \in \mathcal{J}(\mathfrak{T}(\fu)). Thus s(J) \le s - 1 or
s(J) = -S. If s(J) = -S and s(J) > s - 1, then s = -S. So in
both cases, s(J) \le s. It then follows from the triangle inequality and
eq-vol-sp-cube that J \subset B(x, 16 D^s).
Thus, we can estimate eq-term-C by
2^{127a^3 + 3/a}\sum_{\fp\in \mathfrak{T}}\frac{\mathbf{1}_{E(\fp)}(x)}{\mu(B(x,D^{\ps(\fp)}))}\sum_{\substack{J\in \mathcal{J}(\fT(\fu))\\J\subset B(x, 16D^{\ps(\fp)})\\ s(J) \le \ps(\fp)}} D^{(s(J) - \ps(\fp))/a} \int_J |f|.
= 2^{127a^3 + 3/a}\sum_{I \in \mathcal{D}} \sum_{\substack{\fp\in \mathfrak{T}\\ \scI(\fp) = I}}\frac{\mathbf{1}_{E(\fp)}(x)}{\mu(B(x, D^{s(I)}))}\sum_{\substack{J\in \mathcal{J}(\fT(\fu))\\J\subset B(x, 16 D^{s(I)})\\ s(J) \le s(I)}} D^{(s(J) - s(I))/a} \int_J |f|.
By eq-dis-freq-cover and defineep, the sets E(\fp) for tiles
\fp with \scI(\fp) = I are pairwise disjoint. It follows from the
definition of \mathcal{L}(\fT(\fu)) that x \in \scI(\fp) if and only if
x' \in \scI(\fp), thus we can estimate the sum over
\mathbf{1}_{E(\fp)}(x) by \mathbf{1}_{I}(x').
If x \in E(\fp) then in particular x \in \scI(\fp), so by
eq-vol-sp-cube
B(c(I),16D^{s(I)}) \subset B(x, 32D^{s(I)}). By the doubling property
doublingx
\mu(B(c(I), 16D^{s(I)})) \le 2^{5a} \mu(B(x, D^{s(I)})).
Since a \ge 4 we can continue our estimate with
\le 2^{128a^3}\sum_{I \in \mathcal{D}} \frac{\mathbf{1}_{I}(x')}{\mu(B(c(I), 16D^{s(I)}))}\sum_{\substack{J\in \mathcal{J}(\fT(\fu))\\J\subset B(x, 16 D^{s(I)})\\ s(J) \le s(I)}} D^{(s(J) - s(I))/a} \int_J |f|
= 2^{128a^3} S_{1,\fu} P_{\mathcal{J}(\fT(\fu))}|f|(x').
This completes the proof.
1.7.2. An auxiliary L^2 tree estimate
In this subsection we prove the following estimate on L^2 for operators
associated to trees.
Let \fu \in \fU. Then we have for all f, g bounded with bounded support
\Bigg|\int_X \sum_{\fp \in \fT(\fu)} \bar g(y) T_{\fp}f(y) \, \mathrm{d}\mu(y) \Bigg|
\le 2^{130a^3}\|P_{\mathcal{J}(\fT(\fu))}|f|\|_{2}\|P_{\mathcal{L}(\fT(\fu))}|g|\|_{2}.
Lean code for Lemma1.7.2.1●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/L2Estimate.leancomplete
theorem TileStructure.Forest.tree_projection_estimate.{u_2} {X : Type u_2} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f g : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (hu : u ∈ t) : ‖∫ (x : X), (starRingEnd ℂ) (g x) * carlesonSum ((fun x ↦ t.𝔗 x) u) f x‖ₑ ≤ ↑(TileStructure.Forest.C7_2_1 a) * MeasureTheory.eLpNorm (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ‖f x‖) 2 MeasureTheory.volume * MeasureTheory.eLpNorm (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ‖g x‖) 2 MeasureTheory.volume
theorem TileStructure.Forest.tree_projection_estimate.{u_2} {X : Type u_2} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f g : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (hu : u ∈ t) : ‖∫ (x : X), (starRingEnd ℂ) (g x) * carlesonSum ((fun x ↦ t.𝔗 x) u) f x‖ₑ ≤ ↑(TileStructure.Forest.C7_2_1 a) * MeasureTheory.eLpNorm (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ‖f x‖) 2 MeasureTheory.volume * MeasureTheory.eLpNorm (TileStructure.Forest.approxOnCube (TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) fun x ↦ ‖g x‖) 2 MeasureTheory.volume
Lemma 7.2.1.
Below, we deduce Lemma 1.7.2.1 from Lemma 1.7.1.3 and the following estimates for the operators in Lemma 1.7.1.3.
For all bounded f with bounded support and all \mfa \in \Mf
\|T_{\mathcal{N}}^{\mfa} f\|_2 \le 2^{102a^3} \|f\|_2.
Lean code for Lemma1.7.2.2●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/L2Estimate.leancomplete
theorem TileStructure.Forest.nontangential_operator_bound.{u_2} {X : Type u_2} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {f : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (θ : Θ X) : MeasureTheory.eLpNorm (TileStructure.Forest.nontangentialMaximalFunction θ f) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_2_2 a) * MeasureTheory.eLpNorm f 2 MeasureTheory.volume
theorem TileStructure.Forest.nontangential_operator_bound.{u_2} {X : Type u_2} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {f : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (θ : Θ X) : MeasureTheory.eLpNorm (TileStructure.Forest.nontangentialMaximalFunction θ f) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_2_2 a) * MeasureTheory.eLpNorm f 2 MeasureTheory.volume
Lemma 7.2.2.
For all \fu \in \fU and all bounded functions f with bounded support
\|S_{1,\fu}f\|_2 \le 2^{12a} \|f\|_2.
Lean code for Lemma1.7.2.3●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/L2Estimate.leancomplete
theorem TileStructure.Forest.boundary_operator_bound.{u_2} {X : Type u_2} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : MeasureTheory.eLpNorm (t.boundaryOperator u f) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_2_3 a) * MeasureTheory.eLpNorm f 2 MeasureTheory.volume
theorem TileStructure.Forest.boundary_operator_bound.{u_2} {X : Type u_2} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : MeasureTheory.eLpNorm (t.boundaryOperator u f) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_2_3 a) * MeasureTheory.eLpNorm f 2 MeasureTheory.volume
Lemma 7.2.3.
Proof of Lemma 1.7.2.1. Let L \in \mathcal{L}(\fT(\fu)).
Let b(x') denote the right-hand side of Lemma 1.7.1.3. Apply
this lemma to e(\fcc(\fu)) f, to obtain for all y, x' \in L
\Bigg| \sum_{\fp \in \fT(\fu)} T_{\fp} f(y) \Bigg| \le b(x').
Hence, by taking an infimum, we have for y \in L
\Bigg| \sum_{\fp \in \fT(\fu)} T_{\fp} f(y) \Bigg| \le \inf_{x' \in L} b(x').
Integrating this estimate yields
\int_L |g(y)| \Bigg| \sum_{\fp \in \fT(\fu)} T_{\fp} f(y) \Bigg| \, \mathrm{d}\mu(y)
\le \int_L |g(y)| \times \inf_{x' \in L} b(x') \, \mathrm{d}\mu(y)
= \int_L P_{\mathcal{L}(\fT(\fu))}|g|(y) \times \inf_{x' \in L} b(x') \, \mathrm{d}\mu(y)
\le \int_L P_{\mathcal{L}(\fT(\fu))}|g|(y) \times b(y) \, \mathrm{d}\mu(y).
By definetp, we have T_{\fp} f = \mathbf{1}_{\scI(\fp)} T_{\fp} f for all
\fp \in \fP, so
\Bigg| \int \bar g(y) \sum_{\fp \in \fT(\fu)} T_{\fp} f(y) \, \mathrm{d}\mu(y) \Bigg| = \Bigg| \int_{\bigcup_{\fp \in \fT(\fu)} \scI(\fp)} \bar g(y) \sum_{\fp \in \fT(\fu)} T_{\fp} f(y) \, \mathrm{d}\mu(y) \Bigg|.
Since \mathcal{L}(\fT(\fu)) partitions
\bigcup_{\fp \in \fT(\fu)} \scI(\fp) by Lemma 1.7.1.2, we get from
the triangle inequality
\le \sum_{L \in \mathcal{L}(\fT(\fu))} \int_L |g(y)| \Bigg| \sum_{\fp \in \fT(\fu)} T_{\fp} f(y) \Bigg| \, \mathrm{d}\mu(y)
which by the above computation is bounded by
\sum_{L \in \mathcal{L}(\fT(\fu))} \int_L P_{\mathcal{L}(\fT(\fu))}|g|(y) \times b(y) \, \mathrm{d}\mu(y)
= \int_X P_{\mathcal{L}(\fT(\fu))}|g|(y) \times b(y) \, \mathrm{d}\mu(y).
Applying Cauchy-Schwarz, this is bounded by
\|P_{\mathcal{L}(\fT(\fu))}|g|\|_2 \times \|b\|_2. By Minkowski's
inequality, Theorem 1.2.6, Lemma 1.7.2.2 and
Lemma 1.7.2.3, \|b\|_2 is at most
2^{129a^3} (2^{2a+1} + 2^{12a})\|P_{\mathcal{J}(\fT(\fu))}|f|\|_2 + 2^{103a^3} \|P_{\mathcal{J}(\fT(\fu))}[e(\fcc(\fu))f]\|_2.
By the triangle inequality we have for all x \in X that
|P_{\mathcal{J}(\fT(\fu))}[e(\fcc(\fu))f]|(x) \le P_{\mathcal{J}(\fT(\fu))}|f|(x),
thus we can further estimate the above by
(2^{129a^3} (2^{2a+1} + 2^{12a}) + 2^{103a^3}) \|P_{\mathcal{J}(\fT(\fu))}|f|\|_2.
This completes the proof since a \ge 4.
Now we prove the two auxiliary lemmas. We begin with the nontangential maximal
operator T_{\mathcal{N}}.
Proof of Lemma 1.7.2.2. Fix s_1, s_2. By eq-psisum we
have for all x \in (0, \infty)
\sum_{s = s_1}^{s_2} \psi(D^{-s}x) = 1 - \sum_{s < s_1} \psi(D^{-s}x) - \sum_{s > s_1} \psi(D^{-s}x).
Since \psi is supported in [\frac{1}{4D}, \frac{1}{2}], the two sums on
the right hand side are zero for all
x \in [\frac{1}{2}D^{s_1-1}, \frac{1}{4} D^{s_2 - 1}], hence
x \in [\frac{1}{2}D^{s_1-1}, \frac{1}{4} D^{s_2}] \implies \sum_{s = s_1}^{s_2} \psi(D^{-s}x) = 1.
Since \psi is supported in [\frac{1}{4D}, \frac{1}{2}], we further have
x \notin [\frac{1}{4}D^{s_1 - 1}, \frac{1}{2}D^{s_2}] \implies \sum_{s = s_1}^{s_2} \psi(D^{-s}x) = 0.
Finally, since \psi \ge 0 and
\sum_{s \in \mathbb{Z}} \psi(D^{-s}x) = 1, we have for all x
0 \le \sum_{s = s_1}^{s_2} \psi(D^{-s}x) \le 1.
Let x' \in I_{s_1}(x) and suppose that
D^{s_2 - 1} \le R_Q(\mfa, x'). By the triangle inequality and
eq-vol-sp-cube, it holds that \rho(x,x') \le 8D^{s_1}. We have
\Bigg|\sum_{s = s_1}^{s_2} \int K_s(x',y) f(y) \, \mathrm{d}\mu(y)\Bigg|
= \Bigg|\int \sum_{s = s_1}^{s_2} \psi(D^{-s}\rho(x',y)) K(x',y) f(y) \, \mathrm{d}\mu(y)\Bigg|
\le \Bigg| \int_{8D^{s_1} < \rho(x',y) \le \frac{1}{4}D^{s_2-1}} K(x',y) f(y) \, \mathrm{d}\mu(y) \Bigg|
+ \int_{\frac{1}{4}D^{s_1-1} \le \rho(x',y) \le 8D^{s_1}} |K(x', y)| |f(y)| \, \mathrm{d}\mu(y)
+ \int_{\frac{1}{4}D^{s_2-1} \le \rho(x',y) \le \frac{1}{2}D^{s_2}} |K(x', y)| |f(y)| \, \mathrm{d}\mu(y).
The first term eq-sharp-trunc-term is at most 2T_{\tQ}^\mfa f(x), using
with R_1 := 8D^{s_1}, R_2 := \frac{1}{4}D^{s_2-1} and
R_1 < R_2 < R_{\tQ}(\mfa,x') the triangle inequality in the form
\left|\int_{R_1 < \rho(x',y) \le R_2} K(x',y) f(y) \, \mathrm{d}\mu(y) \right|
\le \left|\int_{R_1 < \rho(x',y) < R_{\tQ}(\mfa,x')} K(x',y) f(y) \, \mathrm{d}\mu(y) \right|
+ \left|\int_{R_2 < \rho(x',y) < R_{\tQ}(\mfa,x')} K(x',y) f(y) \, \mathrm{d}\mu(y) \right|.
The other two terms will be estimated by the finitary maximal function from
Theorem 1.2.6. For the second term eq-lower-bound-term we use
eqkernel-size which implies that for all y with
\rho(x', y) \ge \frac{1}{4}D^{s_1 - 1}, we have
|K(x', y)| \le \frac{2^{a^3}}{\mu(B(x', \frac{1}{4}D^{s_1 - 1}))}.
Using D=2^{100a^2} and the doubling property doublingx 7 +100a^2
times estimates the last display by
\frac{2^{7a+101a^3}}{\mu(B(x', 32D^{s_1}))}.
By the triangle inequality and eq-vol-sp-cube, we have
B(x', 8D^{s_1}) \subset B(c(I_{s_1}(x)), 16D^{s(I_{s_1}(x))}) \subset B(x', 32D^{s_1}).
Combining this with pf-nontangential-operator-bound-imeq, we conclude that
eq-lower-bound-term is at most
2^{7a + 101a^3} M_{\mathcal{B},1} f(x).
For eq-upper-bound-term we argue similarly. We have for all y with
\rho(x', y) \ge \frac{1}{4}D^{s_2-1}
|K(x', y)| \le \frac{2^{a^3}}{\mu(B(x', \frac{1}{4}D^{s_2-1}))}.
Using the doubling property doublingx 7 + 100a^2 times estimates the
last display by
\frac{2^{7a + 101a^3}}{\mu(B(x', 32 D^{s_2}))}.
Note that by dyadicproperty we have
I_{s_1}(x) \subset I_{s_2}(x), in particular x' \in I_{s_2}(x). By the
triangle inequality and eq-vol-sp-cube, we have
B(x', 8D^{s_2}) \subset B(c(I_{s_2}(x)), 16D^{s(I_{s_2}(x))}) \subset B(x', 32D^{s_2}).
Combining this, eq-upper-bound-term is at most
2^{7a+101a^3} M_{\mathcal{B},1} f(x).
Using a \ge 4, taking a supremum over all x' \in I_{s_1}(x) and then a
supremum over all -S \le s_1 < s_2 \le S, we obtain
T_{\mathcal{N}} f(x) \le 2T_{\tQ}^\mfa f(x) + 2^{102a^3} M_{\mathcal{B},1} f(x).
The lemma now follows from assumption linnontanbound,
Theorem 1.2.6 and a \ge 4.
We need the following lemma to prepare the L^2-estimate for the auxiliary
operators S_{1, \fu}.
-
TileStructure.Forest.boundary_overlap[complete]
For every cube I \in \mathcal{D}, there exist at most 2^{9a} cubes
J \in \mathcal{D} with s(J) = s(I) and
B(c(I), 16D^{s(I)}) \cap B(c(J), 16 D^{s(J)}) \ne \emptyset.
Lean code for Lemma1.7.2.4●1 theorem
Associated Lean declarations
-
TileStructure.Forest.boundary_overlap[complete]
-
TileStructure.Forest.boundary_overlap[complete]
-
theoremdefined in Carleson/ForestOperator/L2Estimate.leancomplete
theorem TileStructure.Forest.boundary_overlap.{u_2} {X : Type u_2} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] (I : Grid X) : (TileStructure.Forest.kissing I).card ≤ 2 ^ (9 * a)
theorem TileStructure.Forest.boundary_overlap.{u_2} {X : Type u_2} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] (I : Grid X) : (TileStructure.Forest.kissing I).card ≤ 2 ^ (9 * a)
Lemma 7.2.4.
Proof. Suppose that
B(c(I), 16 D^{s(I)}) \cap B(c(J), 16 D^{s(J)}) \ne \emptyset and
s(I) = s(J). Then
B(c(I), 33 D^{s(I)}) \subset B(c(J), 128 D^{s(J)}). Hence by the doubling
property doublingx
2^{9a}\mu(B(c(J), \frac{1}{4}D^{s(J)})) \ge \mu(B(c(I), 33 D^{s(I)})),
and by the triangle inequality,
B(c(J), \frac{1}{4}D^{s(J)}) is contained in
B(c(I), 33 D^{s(I)}).
If \mathcal{C} is any finite collection of cubes J \in \mathcal{D}
satisfying s(J) = s(I) and
B(c(I), 16 D^{s(I)}) \cap B(c(J), 16 D^{s(J)}) \ne\emptyset,
then it follows from eq-vol-sp-cube and pairwise disjointedness of cubes of
the same scale dyadicproperty that the balls
B(c(J), \frac{1}{4} D^{s(J)}) are pairwise disjoint. Hence
\mu(B(c(I), 33 D^{s(I)})) \ge \sum_{J \in \mathcal{C}} \mu(B(c(J), \frac{1}{4}D^{s(J)}))
\ge |\mathcal{C}| 2^{-9a} \mu(B(c(I), 33 D^{s(I)})).
Since \mu is doubling and \mu \ne 0, we have
\mu(B(c(I), 33D^{s(I)})) > 0. The lemma follows after dividing by
2^{-9a}\mu(B(c(I), 33D^{s(I)})).
Now we can bound the operators S_{1, \fu}.
Proof of Lemma 1.7.2.3. Note that by definition,
S_{1,\fu}f is a finite sum of indicator functions of cubes
I \in \mathcal{D} for each locally integrable f, and hence is bounded,
has bounded support and is integrable. Let g be another function with the
same three properties. Then \bar g S_{1,\fu}f is integrable, and we have
\Bigg|\int \bar g(y) S_{1,\fu}f(y) \, \mathrm{d}\mu(y)\Bigg|
= \Bigg|\sum_{I\in\mathcal{D}} \frac{1}{\mu(B(c(I), 16 D^{s(I)}))} \int_I \bar g(y) \, \mathrm{d}\mu(y)
\times \sum_{\substack{J\in \mathcal{J}(\fT(\fu))\,:\,J\subseteq B(c(I), 16 D^{s(I)})\\s(J)\le s(I)}} D^{(s(J)-s(I))/a}\int_J |f(y)| \,\mathrm{d}\mu(y)\Bigg|
\le \sum_{I\in\mathcal{D}} \frac{1}{\mu(B(c(I), 16D^{s(I)}))} \int_{B(c(I), 16D^{s(I)})} | g(y)| \, \mathrm{d}\mu(y)
\times \sum_{\substack{J\in \mathcal{J}(\fT(\fu))\,:\,J\subseteq B(c(I), 16 D^{s(I)})\\ s(J) \le s(I)}} D^{(s(J)-s(I))/a}\int_J |f(y)| \,\mathrm{d}\mu(y).
Changing the order of summation and using
J \subset B(c(I), 16 D^{s(I)}) to bound the first average integral by
M_{\mathcal{B},1}|g|(y) for any y \in J, we obtain
\le \sum_{J\in\mathcal{J}(\fT(\fu))}\int_J|f(y)| M_{\mathcal{B},1}|g|(y) \, \mathrm{d}\mu(y) \sum_{\substack{I \in \mathcal{D} \, : \, J\subset B(c(I),16 D^{s(I)})\\ s(I) \ge s(J)}} D^{(s(J)-s(I))/a}.
By Lemma 1.7.2.4, there are at most 2^{9a} cubes I at each scale
satisfying the inclusion J \subset B(c(I),16D^{s(I)}). Since
D^{-1/a}\le\frac12, (1 - D^{-1/a})^{-1} \le 2. Using this estimate for
the sum of the geometric series, we conclude that
eq-boundary-operator-bound-1 is at most
2^{9a+1} \sum_{J\in\mathcal{J}(\fT(\fu))}\int_J|f(y)| M_{\mathcal{B},1}|g|(y) \, \mathrm{d}\mu(y).
The collection \mathcal{J} is a partition of
\bigcup_{I \in \mathcal{D}} I, so this equals
2^{9a+1} \int_X|f(y)| M_{\mathcal{B},1}|g|(y) \, \mathrm{d}\mu(y).
Using Cauchy-Schwarz and Theorem 1.2.6, we conclude
\left|\int \bar g S_{1,\fu}f \, \mathrm{d}\mu \right| \le 2^{12a} \|g\|_2\|f\|_2.
The lemma now follows by choosing g = S_{1,\fu}f and dividing on both
sides by the finite \|S_{1,\fu}f\|_2.
1.7.3. The quantitative L^2 tree estimate
The main result of this subsection is the following quantitative bound for
operators associated to trees, with decay in the densities \dens_1 and
\dens_2.
-
TileStructure.Forest.density_tree_bound1[complete] -
TileStructure.Forest.density_tree_bound2[complete]
Let \fu \in \fU. Then for all bounded f with bounded support and bounded
g supported on G we have
\left|\int_X \bar g \sum_{\fp \in \fT(\fu)} T_{\fp }f \, \mathrm{d}\mu \right| \le 2^{181a^3} \dens_1(\fT(\fu))^{1/2} \|f\|_2\|g\|_2.
If additionally \text{support}(f) \subseteq F, then we have
\left| \int_X \bar g \sum_{\fp \in \fT(\fu)} T_{\fp }f\, \mathrm{d}\mu \right| \le 2^{282a^3} \dens_1(\fT(\fu))^{1/2} \dens_2(\fT(\fu))^{1/2} \|f\|_2\|g\|_2.
Lean code for Lemma1.7.3.1●2 theorems
Associated Lean declarations
-
TileStructure.Forest.density_tree_bound1[complete]
-
TileStructure.Forest.density_tree_bound2[complete]
-
TileStructure.Forest.density_tree_bound1[complete] -
TileStructure.Forest.density_tree_bound2[complete]
-
theoremdefined in Carleson/ForestOperator/QuantativeEstimate.leancomplete
theorem TileStructure.Forest.density_tree_bound1.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f g : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) (hu : u ∈ t) : ‖∫ (x : X), (starRingEnd ℂ) (g x) * carlesonSum ((fun x ↦ t.𝔗 x) u) f x‖ₑ ≤ ↑(TileStructure.Forest.C7_3_1_1 a) * dens₁ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm f 2 MeasureTheory.volume * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
theorem TileStructure.Forest.density_tree_bound1.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f g : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) (hu : u ∈ t) : ‖∫ (x : X), (starRingEnd ℂ) (g x) * carlesonSum ((fun x ↦ t.𝔗 x) u) f x‖ₑ ≤ ↑(TileStructure.Forest.C7_3_1_1 a) * dens₁ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm f 2 MeasureTheory.volume * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
First part of Lemma 7.3.1.
-
theoremdefined in Carleson/ForestOperator/QuantativeEstimate.leancomplete
theorem TileStructure.Forest.density_tree_bound2.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f g : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (h2f : Function.support f ⊆ F) (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) (hu : u ∈ t) : ‖∫ (x : X), (starRingEnd ℂ) (g x) * carlesonSum ((fun x ↦ t.𝔗 x) u) f x‖ₑ ≤ ↑(TileStructure.Forest.C7_3_1_2 a) * dens₁ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * dens₂ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm f 2 MeasureTheory.volume * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
theorem TileStructure.Forest.density_tree_bound2.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f g : X → ℂ} (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (h2f : Function.support f ⊆ F) (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) (hu : u ∈ t) : ‖∫ (x : X), (starRingEnd ℂ) (g x) * carlesonSum ((fun x ↦ t.𝔗 x) u) f x‖ₑ ≤ ↑(TileStructure.Forest.C7_3_1_2 a) * dens₁ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * dens₂ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm f 2 MeasureTheory.volume * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
Second part of Lemma 7.3.1.
Below, we deduce this lemma from Lemma 1.7.2.1 and the following two estimates controlling the size of support of the operator and its adjoint.
Let \fu \in \fU and L \in \mathcal{L}(\fT(\fu)). Then
\mu(L \cap G \cap \bigcup_{\fp \in \fT(\fu)} E(\fp)) \le 2^{101a^3} \dens_1(\fT(\fu)) \mu(L).
Lean code for Lemma1.7.3.2●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/QuantativeEstimate.leancomplete
theorem TileStructure.Forest.local_dens1_tree_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) : MeasureTheory.volume (↑L ∩ G ∩ ⋃ p ∈ (fun x ↦ t.𝔗 x) u, E p) ≤ ↑(TileStructure.Forest.C7_3_2 a) * dens₁ ((fun x ↦ t.𝔗 x) u) * MeasureTheory.volume ↑L
theorem TileStructure.Forest.local_dens1_tree_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {L : Grid X} (hu : u ∈ t) (hL : L ∈ TileStructure.Forest.𝓛 ((fun x ↦ t.𝔗 x) u)) : MeasureTheory.volume (↑L ∩ G ∩ ⋃ p ∈ (fun x ↦ t.𝔗 x) u, E p) ≤ ↑(TileStructure.Forest.C7_3_2 a) * dens₁ ((fun x ↦ t.𝔗 x) u) * MeasureTheory.volume ↑L
Lemma 7.3.2.
Let \fu \in \fU and J \in \mathcal{J}(\fT(\fu)). Then
\mu(F \cap J) \le 2^{201a^3} \dens_2(\fT(\fu)) \mu(J).
Lean code for Lemma1.7.3.3●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/QuantativeEstimate.leancomplete
theorem TileStructure.Forest.local_dens2_tree_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {J : Grid X} (hu : u ∈ t) (hJ : J ∈ TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) : MeasureTheory.volume (F ∩ ↑J) ≤ ↑(TileStructure.Forest.C7_3_3 a) * dens₂ ((fun x ↦ t.𝔗 x) u) * MeasureTheory.volume ↑J
theorem TileStructure.Forest.local_dens2_tree_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {J : Grid X} (hu : u ∈ t) (hJ : J ∈ TileStructure.Forest.𝓙 ((fun x ↦ t.𝔗 x) u)) : MeasureTheory.volume (F ∩ ↑J) ≤ ↑(TileStructure.Forest.C7_3_3 a) * dens₂ ((fun x ↦ t.𝔗 x) u) * MeasureTheory.volume ↑J
Lemma 7.3.3.
Proof of Lemma 1.7.3.1. Denote
\mathcal{E}(\fu) = \bigcup_{\fp \in \fT(\fu)} E(\fp).
Then we have
\left| \int_X \bar g \sum_{\fp \in \fT(\fu)} T_{\fp} f \, \mathrm{d}\mu \right| = \left| \int_X \overline{ g\mathbf{1}_{\mathcal{E}(\fu)}} \sum_{\fp \in \fT(\fu)} T_{\fp} (\mathbf{1}_{\scI(\fu)}f) \, \mathrm{d}\mu \right|.
By Lemma 1.7.2.1, this is bounded by
\le 2^{130a^3}\|P_{\mathcal{J}(\fT(\fu))}|f|\|_2 \|P_{\mathcal{L}(\fT(\fu))} |\mathbf{1}_{\mathcal{E}(\fu)}g|\|_2.
We bound the two factors separately. We have
\|P_{\mathcal{L}(\fT(\fu))} |\mathbf{1}_{\mathcal{E}(\fu)}g|\|_2 = \left( \sum_{L \in \mathcal{L}(\fT(\fu))} \frac{1}{\mu(L)} \left(\int_{L \cap \mathcal{E}(\fu)} |g(y)| \, \mathrm{d}\mu(y)\right)^2 \right)^{1/2}.
By Cauchy-Schwarz and Lemma 1.7.3.2 this is at most
\le \left( \sum_{L \in \mathcal{L}(\fT(\fu))} 2^{101a^3} \dens_1(\fT(\fu)) \int_{L \cap \mathcal{E}(\fu)} |g(y)|^2 \, \mathrm{d}\mu(y) \right)^{1/2}.
Since cubes L \in \mathcal{L}(\fT(\fu)) are pairwise disjoint by
Lemma 1.7.1.2, this is
\le 2^{51 a^3} \dens_1(\fT(\fu))^{1/2} \|g\|_2.
Similarly, we have
\|P_{\mathcal{J}(\fT(\fu))}|f|\|_2 = \left( \sum_{J \in \mathcal{J}(\fT(\fu))} \frac{1}{\mu(J)} \left(\int_J |f(y)| \, \mathrm{d}\mu(y)\right)^2 \right)^{1/2}.
By Cauchy-Schwarz, this is
\le \left( \sum_{J \in \mathcal{J}(\fT(\fu))} \int_J |f(y)|^2 \, \mathrm{d}\mu(y) \right)^{1/2}.
Since cubes in \mathcal{J}(\fT(\fu)) are pairwise disjoint by
Lemma 1.7.1.2, this is at most
\|f\|_2.
Combining eq-both-factors-tree, eq-factor-L-tree and eq-factor-J-tree
gives eq-cor-tree-est.
If f \le \mathbf{1}_F then f = f\mathbf{1}_F, so
\left( \sum_{J \in \mathcal{J}(\fT(\fu))} \frac{1}{\mu(J)} \left(\int_J |f(y)| \, \mathrm{d}\mu(y)\right)^2 \right)^{1/2}
=\left(\sum_{J \in \mathcal{J}(\fT(\fu))} \frac{1}{\mu(J)} \left(\int_{J \cap F} |f(y)| \, \mathrm{d}\mu(y)\right)^2 \right)^{1/2}.
We estimate as before, using now Lemma 1.7.3.3 and Cauchy-Schwarz,
and obtain that this is
\le 2^{101a^3} \dens_2(\fT(\fu))^{1/2} \|f\|_2.
Combining this with eq-both-factors-tree and eq-factor-L-tree gives
eq-cor-tree-est-F.
Now we prove the two auxiliary estimates.
Proof of Lemma 1.7.3.2. If the set on the right hand side is empty,
then eq-1density-estimate-tree holds. If not, then there exists
\fp \in \fT(\fu) with L \cap \scI(\fp) \ne \emptyset.
Continuing the proof of Lemma 1.7.3.2, suppose first that
there exists such \fp with \ps(\fp) \le s(L). Then by
dyadicproperty \scI(\fp) \subset L, which gives by the definition of
\mathcal{L}(\fT(\fu)) that s(L) = -S and hence L = \scI(\fp). Let
\fq \in \fT(\fu) with E(\fq) \cap L \ne \emptyset. Since
s(L) = -S \le \ps(\fq) it follows from dyadicproperty that
\scI(\fp) = L \subset \scI(\fq). We have then by
Lemma 1.2.1.2
d_{\fp}(\fcc(\fp), \fcc(\fq)) \le d_{\fp}(\fcc(\fp), \fcc(\fu)) + d_{\fp}(\fcc(\fq), \fcc(\fu))
\le d_{\fp}(\fcc(\fp), \fcc(\fu)) + d_{\fq}(\fcc(\fq), \fcc(\fu)).
Using that \fp, \fq \in \fT(\fu) and forest1, this is at most 8.
Using again the triangle inequality and Lemma 1.2.1.2, we obtain
that for each q \in B_{\fq}(\fcc(\fq), 1)
d_{\fp}(\fcc(\fp), q) \le d_{\fp}(\fcc(\fp), \fcc(\fq)) + d_{\fq}(\fcc(\fq), q) \le 9.
Thus L \cap G \cap E(\fq) \subset E_2(9, \fp). We obtain
\mu(L \cap G \cap \bigcup_{\fq \in \fT(\fu)} E(\fq)) \le \mu(E_2(9, \fp)).
By the definition of \dens_1, this is bounded by
9^a \dens_1(\fT(\fu)) \mu(\scI(\fp)) =9^a \dens_1(\fT(\fu)) \mu(L).
Since a \ge 4, eq-1density-estimate-tree follows in this case.
Now suppose that for each \fp \in \fT(\fu) with
L \cap E(\fp) \ne \emptyset, we have \ps(\fp) > s(L). Since there exists
at least one such \fp, there exists in particular at least one cube
L'' \in \mathcal{D} with L \subset L'' and s(L'') > s(L). By
coverdyadic, there exists L' \in \mathcal{D} with L \subset L' and
s(L') = s(L) + 1. By the definition of \mathcal{L}(\fT(\fu)) there
exists a tile \fp'' \in \fT(\fu) with \scI(\fp'') \subset L'.
It suffices to show that there exists a tile \fp' \in \fP(\fT(\fu)) with
\scI(\fp') = L', d_{\fp'}(\fcc(\fp'), \fcc(\fu)) < 4 and
9\fp'' \lesssim 9\fp'. For then, let \fq \in \fT(\fu) with
L \cap E(\fq) \ne \emptyset. As shown above, this implies
\ps(\fq) \ge s(L'), so by dyadicproperty L' \subset \scI(\fq). If
q \in B_{\fq}(\fcc(\fq), 1), then by a similar calculation as above, using
the triangle inequality, Lemma 1.2.1.2 and forest1, we obtain
d_{\fp'}(\fcc(\fp'), q) \le d_{\fp'}(\fcc(\fp'), \fcc(\fq)) + d_{\fq}(\fcc(\fq), q) \le 9.
Thus L \cap G \cap E(\fq) \subset E_2(9, \fp'). We deduce using the
definition definedens1 of \dens_1
\mu(L \cap G \cap \bigcup_{\fq \in \fT(\fu)} E(\fq)) \le \mu(E_2(9, \fp')) \le 9^a \dens_1(\fT(\fu)) \mu(L').
Using the doubling property doublingx, eq-vol-sp-cube, and a \ge 4
this is estimated by
9^a 2^{100a^3 + 5a}\dens_1(\fT(\fu)) \mu(L) \le 2^{101 a^3} \dens_1(\fT(\fu))\mu(L).
To show existence of \fp' with the given properties, if
\scI(\fp'') = L' we can take \fp' = \fp'', which satisfies the distance
property by forest1 and the other properties trivially. Otherwise, let
\fp' be the unique tile such that \scI(\fp') = L' and such that
\Omega(\fu) \cap \Omega(\fp') \ne \emptyset. Since
\scI(\fp') \subset \scI(\fp) and \fp \in \fT(\fu), we have
\fp' \in \fP(\fT(\fu)). Since by forest1
\ps(\fp') = s(L') \le \ps(\fp) < \ps(\fu), we have by dyadicproperty and
eq-freq-dyadic that \Omega(\fu) \subset \Omega(\fp'), and hence the
distance property. 9\fp'' \lesssim 9\fp' follows by the triangle
inequality, forest1, Lemma 1.2.1.2 and eq-freq-comp-ball. This
completes the proof.
Proof of Lemma 1.7.3.3. We prove the inequality with the constant
2^{201a^3} replaced by 2 ^ {200a^3 + 14a}; this is stronger because
a \geq 4. It suffices to show the existence of a tile \fp \in \fT(\fu)
and an r \geq 4 D ^ {\ps(\fp)} such that
J \subset B(\pc(\fp), r) and
\mu(B(\pc(\fp), r)) ≤ 2 ^ {200a^3 + 14a} \mu(J), because then it follows
from the definition definedens2 of \dens_2 that
\mu(F \cap J) \le \mu(F \cap B(\pc(\fp), r))
\le \dens_2(\fT(\fu)) \mu(B(\pc(\fp), r)) \le 2^{200a^3 + 14a} \dens_2(\fT(\fu))\mu(J).
In particular, these criteria are satisfied, with r = 4 D ^ {\ps(\fp)},
by any \fp \in \fT(\fu) such that
J \subseteq B(\pc(\fp, 4 D ^ {\ps(\fp)})) and
\mu(\scI(\fp)) \le 2^{100a^3 + 10a} \mu(J), because then by the doubling
property doublingx
\mu(B(\pc(\fp), 4 D ^ {\ps(\fp)})) \le 2^{4a} \mu(B(\pc(\fp), D ^ {\ps(\fp)} / 4))
\le 2^{4a} \mu(\scI(\fp)) \le 2^{100a^3 + 14a} \mu(J).
Suppose first that s(J) = S. Then J = I_0, so subsetmaxcube and the
fact that J \in \mathcal{J}(\fT(\fu)) \subseteq \mathcal{J}_0(\fT(\fu))
imply that s(J) = -S. Thus S = 0. It follows that J is the only
dyadic cube, so any \fp \in \fT(\fu) has \scI(\fp) = J, and therefore
satisfies J \subseteq B(\pc(\fp, 4 D ^ {\ps(\fp)})) and
\mu(\scI(\fp)) \le 2^{100a^3 + 10a} \mu(J).
It remains to consider the case s(J) < S. Then, by coverdyadic and
dyadicproperty, there exists some cube J' \in \mathcal{D} with
s(J') = s(J) + 1 and J \subset J'. By definition of
\mathcal{J}(\fT(\fu)) there exists some \fp \in \fT(\fu) such that
\scI(\fp) \subset B(c(J'), 100 D^{s(J') + 1}).
Since c(J) \in J \subset J' \subset B(c(J'), 4D^{s(J')}), the triangle
inequality, s(J') = s(J) + 1 and D=2^{100a^2} imply
B(c(J'), 204D^{s(J')+1}) \subset B(c(J), 204D^{s(J') + 1} + 4D^{s(J')})
\subset B(c(J), 2^8 D^{s(J) + 2}).
From the doubling property doublingx, D=2^{100a^2} and
eq-vol-sp-cube, we obtain
\mu(B(c(J'), 204D^{s(J') + 1})) \leq 2 ^ {200a^3 + 10a} \mu(J).
If J \subset B(\pc(\fp), 4 D^{\ps(\fp)}), then we need only check that
\mu(\scI(\fp)) \le 2^{100a^3 + 10a} \mu(J). This follows immediately from
\scI(\fp) \subset B(c(J'), 100 D^{s(J') + 1}) and
measure-comparison.
From now on we assume J \not \subset B(\pc(\fp), 4 D^{\ps(\fp)}). Since
\pc(\fp) \in \scI(\fp) \subset B(c(J'), 100 D^{s(J') + 1}),
we have by eq-vol-sp-cube and the triangle inequality
J \subset J' \subset B(c(J'), 4D^{s(J')}) \subset B(\pc(\fp), 104 D^{s(J') + 1}).
In particular this implies 104 D^{s(J') + 1} > 4D^{\ps(\fp)}. By the
triangle inequality we also have
B(\pc(\fp), 104 D^{s(J') + 1}) \subset B(c(J), 204 D^{s(J') + 1}),
so from measure-comparison,
\mu( B(\pc(\fp), 104 D^{s(J') + 1})) \le 2^{200a^3 + 10a} \mu(J),
which proves \fp satisfies the needed criteria with
r=104 D^{s(J') + 1}.
1.7.4. Almost orthogonality of separated trees
The main result of this subsection is the almost orthogonality estimate for operators associated to distinct trees in a forest in Lemma 1.7.4.4 below. We will deduce it from Lemmas Lemma 1.7.4.5 and Lemma 1.7.4.6, which are proven in Subsections Proof of the Tiles with large separation Lemma and Proof of The Remaining Tiles Lemma, respectively. Before stating it, we introduce some relevant notation.
The adjoint of the operator T_{\fp} defined in definetp is given by
T_{\fp}^* g(x) = \int_{E(\fp)} \overline{K_{\ps(\fp)}(y,x)} e(-\tQ(y)(x)+ \tQ(y)(y)) g(y) \, \mathrm{d}\mu(y).
-
TileStructure.Forest.adjoint_tile_support1[complete] -
TileStructure.Forest.adjoint_tile_support2[complete]
For each \fp \in \fP, we have
T_{\fp}^* g = \mathbf{1}_{B(\pc(\fp), 5D^{\ps(\fp)})} T_{\fp}^* \mathbf{1}_{\scI(\fp)} g.
For each \fu \in \fU and each \fp \in \fT(\fu), we have
T_{\fp}^* g = \mathbf{1}_{\scI(\fu)} T_{\fp}^* \mathbf{1}_{\scI(\fu)} g.
Lean code for Lemma1.7.4.1●2 theorems
Associated Lean declarations
-
TileStructure.Forest.adjoint_tile_support1[complete]
-
TileStructure.Forest.adjoint_tile_support2[complete]
-
TileStructure.Forest.adjoint_tile_support1[complete] -
TileStructure.Forest.adjoint_tile_support2[complete]
-
theoremdefined in Carleson/ForestOperator/AlmostOrthogonality.leancomplete
theorem TileStructure.Forest.adjoint_tile_support1.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {p : 𝔓 X} {f : X → ℂ} : adjointCarleson p f = (Metric.ball (𝔠 p) (5 * ↑(defaultD a) ^ 𝔰 p)).indicator (adjointCarleson p ((↑(𝓘 p)).indicator f))
theorem TileStructure.Forest.adjoint_tile_support1.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {p : 𝔓 X} {f : X → ℂ} : adjointCarleson p f = (Metric.ball (𝔠 p) (5 * ↑(defaultD a) ^ 𝔰 p)).indicator (adjointCarleson p ((↑(𝓘 p)).indicator f))
Part 1 of Lemma 7.4.1. Todo: update blueprint with precise properties needed on the function.
-
theoremdefined in Carleson/ForestOperator/AlmostOrthogonality.leancomplete
theorem TileStructure.Forest.adjoint_tile_support2.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u p : 𝔓 X} {f : X → ℂ} (hu : u ∈ t) (hp : p ∈ (fun x ↦ t.𝔗 x) u) : adjointCarleson p f = (↑(𝓘 u)).indicator (adjointCarleson p ((↑(𝓘 u)).indicator f))
theorem TileStructure.Forest.adjoint_tile_support2.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u p : 𝔓 X} {f : X → ℂ} (hu : u ∈ t) (hp : p ∈ (fun x ↦ t.𝔗 x) u) : adjointCarleson p f = (↑(𝓘 u)).indicator (adjointCarleson p ((↑(𝓘 u)).indicator f))
Part 2 of Lemma 7.4.1. Todo: update blueprint with precise properties needed on the function.
Proof. By forest1, E(\fp) \subset \scI(\fp) \subset \scI(\fu). Thus by
definetp*
T_{\fp}^* g(x) = T_{\fp}^* (\mathbf{1}_{\scI(\fp)} g)(x)
= \int_{E(\fp)} \overline{K_{\ps(\fp)}(y,x)} e(-\tQ(y)(x) + \tQ(y)(y)) \mathbf{1}_{\scI(\fp)}(y) g(y) \, \mathrm{d}\mu(y).
If this integral is not 0, then there exists y \in \scI(\fp) such that
K_{\ps(\fp)}(y,x) \ne 0. By supp-Ks, eq-vol-sp-cube and the triangle
inequality, it follows that
x \in B(\pc(\fp), 5 D^{\ps(\fp)}).
Thus
T_{\fp}^* g(x) = \mathbf{1}_{B(\pc(\fp), 5D^{\ps(\fp)})}(x) T_{\fp}^* (\mathbf{1}_{\scI(\fp)} g)(x).
The second claimed equation follows now since
\scI(\fp) \subset \scI(\fu) and by forest6 we have
B(\pc(\fp), 5D^{\ps(\fp)}) \subset \scI(\fu).
For all bounded g supported on G we have that
\left\| \sum_{\fp \in \fT(\fu)} T_{\fp}^* g\right\|_2 \le 2^{181a^3} \dens_1(\fT(\fu))^{1/2} \|g\|_2
\left\| \mathbf{1}_F \sum_{\fp \in \fT(\fu)} T_{\fp}^* g\right\|_2 \le 2^{282a^3} \dens_1(\fT(\fu))^{1/2} \dens_2(\fT(\fu))^{1/2} \|g\|_2.
Lean code for Lemma1.7.4.2●2 theorems
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/AlmostOrthogonality.leancomplete
theorem TileStructure.Forest.adjoint_tree_estimate.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {g : X → ℂ} (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) (hu : u ∈ t) : MeasureTheory.eLpNorm (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u) g) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_3_1_1 a) * dens₁ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
theorem TileStructure.Forest.adjoint_tree_estimate.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {g : X → ℂ} (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) (hu : u ∈ t) : MeasureTheory.eLpNorm (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u) g) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_3_1_1 a) * dens₁ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
Part 1 of Lemma 7.4.2.
-
theoremdefined in Carleson/ForestOperator/AlmostOrthogonality.leancomplete
theorem TileStructure.Forest.indicator_adjoint_tree_estimate.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {g : X → ℂ} (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) (hu : u ∈ t) : MeasureTheory.eLpNorm (F.indicator (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u) g)) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_3_1_2 a) * dens₁ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * dens₂ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
theorem TileStructure.Forest.indicator_adjoint_tree_estimate.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {g : X → ℂ} (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) (hu : u ∈ t) : MeasureTheory.eLpNorm (F.indicator (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u) g)) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_3_1_2 a) * dens₁ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * dens₂ ((fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
Part 2 of Lemma 7.4.2.
Proof. By Lemma 1.7.3.1, we have for all bounded f and g with
|g| \le \mathbf{1}_G that
\left| \int_X \overline{\sum_{\fp\in \fT(\fu)} T_{\fp}^* g} f \,\mathrm{d}\mu \right| = \left| \int_X \overline{g} \sum_{\fp \in \fT(\fu)} T_{\fp} f \,\mathrm{d}\mu \right|
\le 2^{181a^3} \dens_1(\fT(\fu))^{1/2} \|g\|_2 \|f\|_2.
Let f = \sum_{\fp \in \fT(\fu)} T_{\fp}^* g. Since
|g| \le \mathbf{1}_G, f is bounded and has bounded support. In
particular \|f\|_2 < \infty. Dividing eq-adjoint-bound by \|f\|_2
completes the proof.
The proof of the second part is similar with
f = \mathbf{1}_F \sum_{\fp \in \fT(\fu)} T_{\fp}^* g.
We define
S_{2,\fu}g := \left|\sum_{\fp \in \fT(\fu)} T_{\fp}^*g \right| + M_{\mathcal{B},1}g + |g|.
We have for all \fu \in \fU and all bounded g supported on G
\|S_{2, \fu} g\|_2 \le 2^{182a^3} \|g\|_2.
Lean code for Lemma1.7.4.3●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/AlmostOrthogonality.leancomplete
theorem TileStructure.Forest.adjoint_tree_control.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f : X → ℂ} (hu : u ∈ t) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (h2f : Function.support f ⊆ G) : MeasureTheory.eLpNorm (fun x ↦ t.adjointBoundaryOperator u f x) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_4_3 a) * MeasureTheory.eLpNorm f 2 MeasureTheory.volume
theorem TileStructure.Forest.adjoint_tree_control.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u : 𝔓 X} {f : X → ℂ} (hu : u ∈ t) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (h2f : Function.support f ⊆ G) : MeasureTheory.eLpNorm (fun x ↦ t.adjointBoundaryOperator u f x) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_4_3 a) * MeasureTheory.eLpNorm f 2 MeasureTheory.volume
Lemma 7.4.3.
Proof. This follows immediately from Minkowski's inequality,
Theorem 1.2.6 and Lemma 1.7.4.2, using that a \ge 4.
Now we are ready to state the main result of this subsection.
For any \fu_1 \ne \fu_2 \in \fU and all bounded g_1, g_2 with bounded
support, we have
\left| \int_X \sum_{\fp_1 \in \fT(\fu_1)} \sum_{\fp_2 \in \fT(\fu_2)} T^*_{\fp_1}g_1 \overline{T^*_{\fp_2}g_2 }\,\mathrm{d}\mu \right|
\le 2^{512a^3-4n} \prod_{j =1}^2 \| S_{2, \fu_j} g_j\|_{L^2(\scI(\fu_1) \cap \scI(\fu_2))}.
Lean code for Lemma1.7.4.4●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/Forests.leancomplete
theorem TileStructure.Forest.correlation_separated_trees.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {g₁ g₂ : X → ℂ} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (hg₁ : MeasureTheory.BoundedCompactSupport g₁ MeasureTheory.volume) (hg₂ : MeasureTheory.BoundedCompactSupport g₂ MeasureTheory.volume) : ‖∫ (x : X), adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) g₁ x * (starRingEnd ℂ) (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂) g₂ x)‖ₑ ≤ ↑(TileStructure.Forest.C7_4_4 a n) * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁) ∩ ↑(𝓘 u₂)).indicator (t.adjointBoundaryOperator u₁ g₁) x) 2 MeasureTheory.volume * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁) ∩ ↑(𝓘 u₂)).indicator (t.adjointBoundaryOperator u₂ g₂) x) 2 MeasureTheory.volume
theorem TileStructure.Forest.correlation_separated_trees.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {g₁ g₂ : X → ℂ} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (hg₁ : MeasureTheory.BoundedCompactSupport g₁ MeasureTheory.volume) (hg₂ : MeasureTheory.BoundedCompactSupport g₂ MeasureTheory.volume) : ‖∫ (x : X), adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) g₁ x * (starRingEnd ℂ) (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂) g₂ x)‖ₑ ≤ ↑(TileStructure.Forest.C7_4_4 a n) * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁) ∩ ↑(𝓘 u₂)).indicator (t.adjointBoundaryOperator u₁ g₁) x) 2 MeasureTheory.volume * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁) ∩ ↑(𝓘 u₂)).indicator (t.adjointBoundaryOperator u₂ g₂) x) 2 MeasureTheory.volume
Lemma 7.4.4
Proof of Lemma 1.7.4.4. By Lemma 1.7.4.1 and
dyadicproperty, the left hand side eq-lhs-sep-tree is 0 unless
\scI(\fu_1) \subset \scI(\fu_2) or
\scI(\fu_2) \subset \scI(\fu_1). Without loss of generality we assume that
\scI(\fu_1) \subset \scI(\fu_2).
Define
\mathfrak{S} := \{\fp \in \fT(\fu_1) \cup \fT(\fu_2) \ : \ d_{\fp}(\fcc(\fu_1), \fcc(\fu_2)) \ge 2^{Zn/2}\}.
Lemma 1.7.4.4 follows by combining the definition defineZ of
Z with the following two lemmas.
We have for all \fu_1 \ne \fu_2 \in \fU with
\scI(\fu_1) \subset \scI(\fu_2) and all bounded g_1, g_2 with bounded
support
\left| \int_X \sum_{\fp_1 \in \fT(\fu_1)} \sum_{\fp_2 \in \fT(\fu_2) \cap \mathfrak{S}} T^*_{\fp_1}g_1 \overline{T^*_{\fp_2}g_2 }\,\mathrm{d}\mu \right|
\le 2^{511a^3} 2^{-Zn/(4a^2 + 2a^3)} \prod_{j =1}^2 \| S_{2, \fu_j} g_j\|_{L^2(\scI(\fu_1))}.
Lean code for Lemma1.7.4.5●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.correlation_distant_tree_parts.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f₁ f₂ : X → ℂ} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hf₁ : MeasureTheory.BoundedCompactSupport f₁ MeasureTheory.volume) (hf₂ : MeasureTheory.BoundedCompactSupport f₂ MeasureTheory.volume) : ‖∫ (x : X), adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) f₁ x * (starRingEnd ℂ) (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) f₂ x)‖ₑ ≤ ↑(TileStructure.Forest.C7_4_5 a n) * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁)).indicator (t.adjointBoundaryOperator u₁ f₁) x) 2 MeasureTheory.volume * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁)).indicator (t.adjointBoundaryOperator u₂ f₂) x) 2 MeasureTheory.volume
theorem TileStructure.Forest.correlation_distant_tree_parts.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f₁ f₂ : X → ℂ} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hf₁ : MeasureTheory.BoundedCompactSupport f₁ MeasureTheory.volume) (hf₂ : MeasureTheory.BoundedCompactSupport f₂ MeasureTheory.volume) : ‖∫ (x : X), adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) f₁ x * (starRingEnd ℂ) (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) f₂ x)‖ₑ ≤ ↑(TileStructure.Forest.C7_4_5 a n) * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁)).indicator (t.adjointBoundaryOperator u₁ f₁) x) 2 MeasureTheory.volume * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁)).indicator (t.adjointBoundaryOperator u₂ f₂) x) 2 MeasureTheory.volume
Lemma 7.4.5
We have for all \fu_1 \ne \fu_2 \in \fU with
\scI(\fu_1) \subset \scI(\fu_2) and all bounded g_1, g_2 with bounded
support
\left| \int_X \sum_{\fp_1 \in \fT(\fu_1)} \sum_{\fp_2 \in \fT(\fu_2) \setminus \mathfrak{S}} T^*_{\fp_1}g_1 \overline{T^*_{\fp_2}g_2 }\,\mathrm{d}\mu \right|
\le 2^{232a^3+21a+5} 2^{-\frac{25}{101a}Zn\kappa} \prod_{j=1}^2 \|S_{2, \fu_j} g_j\|_{L^2(\scI(\fu_1))}.
Lean code for Lemma1.7.4.6●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/RemainingTiles.leancomplete
theorem TileStructure.Forest.correlation_near_tree_parts.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f₁ f₂ : X → ℂ} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hf₁ : MeasureTheory.BoundedCompactSupport f₁ MeasureTheory.volume) (hf₂ : MeasureTheory.BoundedCompactSupport f₂ MeasureTheory.volume) : ‖∫ (x : X), adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) f₁ x * (starRingEnd ℂ) (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) f₂ x)‖ₑ ≤ ↑(TileStructure.Forest.C7_4_6 a n) * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁)).indicator (t.adjointBoundaryOperator u₁ f₁) x) 2 MeasureTheory.volume * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁)).indicator (t.adjointBoundaryOperator u₂ f₂) x) 2 MeasureTheory.volume
theorem TileStructure.Forest.correlation_near_tree_parts.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f₁ f₂ : X → ℂ} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hf₁ : MeasureTheory.BoundedCompactSupport f₁ MeasureTheory.volume) (hf₂ : MeasureTheory.BoundedCompactSupport f₂ MeasureTheory.volume) : ‖∫ (x : X), adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) f₁ x * (starRingEnd ℂ) (adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) f₂ x)‖ₑ ≤ ↑(TileStructure.Forest.C7_4_6 a n) * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁)).indicator (t.adjointBoundaryOperator u₁ f₁) x) 2 MeasureTheory.volume * MeasureTheory.eLpNorm (fun x ↦ (↑(𝓘 u₁)).indicator (t.adjointBoundaryOperator u₂ f₂) x) 2 MeasureTheory.volume
Lemma 7.4.6
In the proofs of both lemmas, we will need the following observation.
-
TileStructure.Forest.𝔗_subset_𝔖₀[complete] -
TileStructure.Forest.overlap_implies_distance[complete]
Let \fu_1 \ne \fu_2 \in \fU with \scI(\fu_1) \subset \scI(\fu_2). If
\fp \in \fT(\fu_1) \cup \fT(\fu_2) with
\scI(\fp) \cap \scI(\fu_1) \ne \emptyset, then \fp \in \mathfrak{S}. In
particular, we have \fT(\fu_1) \subset \mathfrak{S}.
Lean code for Lemma1.7.4.7●2 theorems
Associated Lean declarations
-
TileStructure.Forest.𝔗_subset_𝔖₀[complete]
-
TileStructure.Forest.overlap_implies_distance[complete]
-
TileStructure.Forest.𝔗_subset_𝔖₀[complete] -
TileStructure.Forest.overlap_implies_distance[complete]
-
theoremdefined in Carleson/ForestOperator/AlmostOrthogonality.leancomplete
theorem TileStructure.Forest.𝔗_subset_𝔖₀.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) : (fun x ↦ t.𝔗 x) u₁ ⊆ t.𝔖₀ u₁ u₂
theorem TileStructure.Forest.𝔗_subset_𝔖₀.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) : (fun x ↦ t.𝔗 x) u₁ ⊆ t.𝔖₀ u₁ u₂
Part 2 of Lemma 7.4.7.
-
theoremdefined in Carleson/ForestOperator/AlmostOrthogonality.leancomplete
theorem TileStructure.Forest.overlap_implies_distance.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ p : 𝔓 X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hp : p ∈ (fun x ↦ t.𝔗 x) u₁ ∪ (fun x ↦ t.𝔗 x) u₂) (hpu₁ : ¬Disjoint ↑(𝓘 p) ↑(𝓘 u₁)) : p ∈ t.𝔖₀ u₁ u₂
theorem TileStructure.Forest.overlap_implies_distance.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ p : 𝔓 X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hp : p ∈ (fun x ↦ t.𝔗 x) u₁ ∪ (fun x ↦ t.𝔗 x) u₂) (hpu₁ : ¬Disjoint ↑(𝓘 p) ↑(𝓘 u₁)) : p ∈ t.𝔖₀ u₁ u₂
Part 1 of Lemma 7.4.7.
Proof. Suppose first that \fp \in \fT(\fu_1). Then
\scI(\fp) \subset \scI(\fu_1) \subset \scI(\fu_2), by forest1. Thus we
have by the separation condition forest5, eq-freq-comp-ball, forest1
and the triangle inequality
d_{\fp}(\fcc(\fu_1), \fcc(\fu_2)) \ge d_{\fp}(\fcc(\fp), \fcc(\fu_2)) - d_{\fp}(\fcc(\fp), \fcc(\fu_1))
\ge 2^{Z(n+1)} - 4
\ge 2^{Zn/2},
using that Z= 2^{12a}\ge 4. Hence \fp \in \mathfrak{S}.
Suppose now that \fp \in \fT(\fu_2). If
\scI(\fp) \subset \scI(\fu_1), then the same argument as above with
\fu_1 and \fu_2 swapped shows \fp \in \mathfrak{S}. If
\scI(\fp) \not \subset \scI(\fu_1) then, by dyadicproperty,
\scI(\fu_1) \subset \scI(\fp). Pick \fp' \in \fT(\fu_1), we have
\scI(\fp') \subset \scI(\fu_1) \subset \scI(\fp). Hence, by
Lemma 1.2.1.2 and the first paragraph
d_{\fp}(\fcc(\fu_1), \fcc(\fu_2)) \ge d_{\fp'}(\fcc(\fu_1), \fcc(\fu_2)) \ge 2^{Zn},
so \fp \in \mathfrak{S}.
To simplify the notation, we will write at various places throughout the proof
of Lemmas Lemma 1.7.4.5 and
Lemma 1.7.4.6 for a subset \fC \subset \fP
T_{\fC} f := \sum_{\fp \in \fC} T_{\fp} f\,, \quad\quad T_{\fC}^* g := \sum_{\fp\in\fC} T_{\fp}^* g\,.
1.7.5. Proof of the Tiles with large separation Lemma
Lemma 1.7.4.5 follows from the van der Corput estimate in Theorem 1.2.5. We apply this proposition in The van der Corput estimate. To prepare this application, we first, in A partition of unity, construct a suitable partition of unity, and show then, in Holder estimates for adjoint tree operators the Holder estimates needed to apply Theorem 1.2.5.
1.7.5.1. A partition of unity
Define
\mathcal{J}' = \{J \in \mathcal{J}(\mathfrak{S}) \ : \ J \subset \scI(\fu_1)\}.
-
TileStructure.Forest.union_𝓙₅[complete] -
TileStructure.Forest.pairwiseDisjoint_𝓙₅[complete]
We have that
\scI(\fu_1) = \dot{\bigcup_{J \in \mathcal{J}'}} J.
Lean code for Lemma1.7.5.1.1●2 theorems
Associated Lean declarations
-
TileStructure.Forest.union_𝓙₅[complete]
-
TileStructure.Forest.pairwiseDisjoint_𝓙₅[complete]
-
TileStructure.Forest.union_𝓙₅[complete] -
TileStructure.Forest.pairwiseDisjoint_𝓙₅[complete]
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.union_𝓙₅.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) : ⋃ J ∈ t.𝓙₅ u₁ u₂, ↑J = ↑(𝓘 u₁)
theorem TileStructure.Forest.union_𝓙₅.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) : ⋃ J ∈ t.𝓙₅ u₁ u₂, ↑J = ↑(𝓘 u₁)
Part of Lemma 7.5.1.
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.pairwiseDisjoint_𝓙₅.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} : (t.𝓙₅ u₁ u₂).PairwiseDisjoint fun I ↦ ↑I
theorem TileStructure.Forest.pairwiseDisjoint_𝓙₅.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} : (t.𝓙₅ u₁ u₂).PairwiseDisjoint fun I ↦ ↑I
Part of Lemma 7.5.1.
Proof. By Lemma 1.7.1.2, it remains only to show that each
J \in \mathcal{J}(\mathfrak{S}) with
J \cap \scI(\fu_1) \ne \emptyset is in \mathcal{J}'. But if
J \notin \mathcal{J}', then by dyadicproperty
\scI(\fu_1) \subset J. Pick \fp \in \fT(\fu_1) \subset \mathfrak{S}.
Then \scI(\fp) \subset J. This contradicts the definition of
\mathcal{J}(\mathfrak{S}).
For cubes J \in \mathcal{D}, denote
B(J) := B(c(J), 8D^{s(J)}).
The main result of this subsubsection is the following.
-
TileStructure.Forest.sum_χ[complete] -
TileStructure.Forest.χ_le_indicator[complete] -
TileStructure.Forest.dist_χ_le[complete]
There exists a family of functions \chi_J, J \in \mathcal{J}' such that
\mathbf{1}_{\scI(\fu_1)} = \sum_{J \in \mathcal{J}'} \chi_J,
and for all J \in \mathcal{J}' and all y,y' \in \scI(\fu_1)
0 \leq \chi_J(y) \leq \mathbf{1}_{B(J)}(y),
|\chi_J(y) - \chi_J(y')| \le 2^{227a^3} \frac{\rho(y,y')}{D^{s(J)}}.
Lean code for Lemma1.7.5.1.2●3 theorems
Associated Lean declarations
-
TileStructure.Forest.sum_χ[complete]
-
TileStructure.Forest.χ_le_indicator[complete]
-
TileStructure.Forest.dist_χ_le[complete]
-
TileStructure.Forest.sum_χ[complete] -
TileStructure.Forest.χ_le_indicator[complete] -
TileStructure.Forest.dist_χ_le[complete]
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.sum_χ.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (x : X) : ∑ J ∈ (t.𝓙₅ u₁ u₂).toFinset, t.χ u₁ u₂ J x = (↑(𝓘 u₁)).indicator 1 x
theorem TileStructure.Forest.sum_χ.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (x : X) : ∑ J ∈ (t.𝓙₅ u₁ u₂).toFinset, t.χ u₁ u₂ J x = (↑(𝓘 u₁)).indicator 1 x
Part of Lemma 7.5.2.
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.χ_le_indicator.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {x : X} {J : Grid X} (hJ : J ∈ t.𝓙₅ u₁ u₂) : t.χ u₁ u₂ J x ≤ (Metric.ball (c J) (8 * ↑(defaultD a) ^ s J)).indicator 1 x
theorem TileStructure.Forest.χ_le_indicator.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {x : X} {J : Grid X} (hJ : J ∈ t.𝓙₅ u₁ u₂) : t.χ u₁ u₂ J x ≤ (Metric.ball (c J) (8 * ↑(defaultD a) ^ s J)).indicator 1 x
Part of Lemma 7.5.2.
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.dist_χ_le.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {x x' : X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (mx : x ∈ 𝓘 u₁) (mx' : x' ∈ 𝓘 u₁) : dist (t.χ u₁ u₂ J x) (t.χ u₁ u₂ J x') ≤ ↑(TileStructure.Forest.C7_5_2 a) * dist x x' / ↑(defaultD a) ^ s J
theorem TileStructure.Forest.dist_χ_le.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {x x' : X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (mx : x ∈ 𝓘 u₁) (mx' : x' ∈ 𝓘 u₁) : dist (t.χ u₁ u₂ J x) (t.χ u₁ u₂ J x') ≤ ↑(TileStructure.Forest.C7_5_2 a) * dist x x' / ↑(defaultD a) ^ s J
Part of Lemma 7.5.2.
In the proof, we will use the following auxiliary lemma.
If J, J' \in \mathcal{J'} with
B(J) \cap B(J') \ne \emptyset,
then |s(J) - s(J')| \le 1.
Lean code for Lemma1.7.5.1.3●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.moderate_scale_change.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {J J' : Grid X} (hJ : J ∈ t.𝓙₅ u₁ u₂) (hJ' : J' ∈ t.𝓙₅ u₁ u₂) (hd : ¬Disjoint (Metric.ball (c J) (8 * ↑(defaultD a) ^ s J)) (Metric.ball (c J') (8 * ↑(defaultD a) ^ s J'))) : s J - 1 ≤ s J'
theorem TileStructure.Forest.moderate_scale_change.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {J J' : Grid X} (hJ : J ∈ t.𝓙₅ u₁ u₂) (hJ' : J' ∈ t.𝓙₅ u₁ u₂) (hd : ¬Disjoint (Metric.ball (c J) (8 * ↑(defaultD a) ^ s J)) (Metric.ball (c J') (8 * ↑(defaultD a) ^ s J'))) : s J - 1 ≤ s J'
Lemma 7.5.3 (stated somewhat differently).
Proof of Lemma 1.7.5.1.2. For each cube J \in \mathcal{J} let
\tilde\chi_J(y) = \mathbf{1}_{\scI(\fu_1)}(y)\max\{0, 8 - D^{-s(J)} \rho(y, c(J))\},
and set
a(y) = \sum_{J \in \mathcal{J}'} \tilde \chi_J(y).
We define
\chi_J(y) := \frac{\tilde \chi_J(y)}{a(y)}.
Then, due to forest6 and def-BJ, the properties eq-pao-1 and
eq-pao-2 are clearly true. Estimate eq-pao-3 follows from eq-pao-2 if
y, y' \notin B(J). Thus we can assume that y \in B(J). We have by the
triangle inequality
|\chi_J(y) - \chi_J(y')| \le \frac{|\tilde \chi_J(y) - \tilde \chi_J(y')|}{a(y)} + \frac{\tilde \chi_J(y')|a(y) - a(y')|}{a(y)a(y')}
Since \tilde \chi_J(z) \ge 4 for all
z \in B(c(J),4D^{s(J)}) \supset J and by Lemma 1.7.5.1.1, we have
that a(z) \ge 4 for all z \in \scI(\fu_1). So we can estimate the above
further by
\le 2^{-2}(|\tilde \chi_J(y) - \tilde \chi_J(y')| + \tilde \chi_J(y')|a(y) - a(y')|).
If y' \notin B(\pc(\fp), 8D^{\ps(\fp)}) then the second summand vanishes.
Else, we can estimate the above, using also that
|\tilde \chi_J(y')| \le 8, by
\le 2^{-2} |\tilde \chi_J(y) - \tilde \chi_J(y')| + 2 \sum_{\substack{J' \in \mathcal{J}'\\ B(J') \cap B(J) \ne \emptyset}}|\tilde \chi_{J'}(y) - \tilde \chi_{J'} (y')|.
By the triangle inequality, we have for all dyadic cubes I
|\tilde \chi_I(y) - \tilde \chi_I(y')| \le \rho(y, y') D^{-s(I)}.
Using this above, we obtain
|\chi_J(y) - \chi_J(y')| \le \rho(y,y') \Big( \frac{1}{4} D^{-s(J)} + 2 \sum_{\substack{J' \in \mathcal{J}'\\ B(J') \cap B(J) \ne \emptyset}} D^{-s(J')}\Big).
By Lemma 1.7.5.1.3, this is at most
\frac{\rho(y,y')}{D^{s(J)}} \left( \frac{1}{4} + 2D |\{J' \in \mathcal{J}' \ : \ B(J') \cap B(J) \ne \emptyset\}|\right).
By eq-vol-sp-cube and Lemma 1.7.5.1.1, the balls
B(c(J'), \frac{1}{4} D^{s(J')}) are pairwise disjoint. By the triangle
inequality and Lemma 1.7.5.1.3, each such ball for J' in the set of
the last display is contained in
B(c(J), 9 D^{s(J) + 1}).
By the doubling property doublingx, we further have
\mu(B(c(J), 9 D^{s(J) + 1})) \le 2^{200a^3 + 7a} \mu\Big(B(c(J'), \frac{1}{4}D^{s(J')})\Big)
for each such ball. Thus
|\{J' \in \mathcal{J}' \ : \ B(J') \cap B(J) \ne \emptyset\}| \le 2^{200a^3 + 7a}.
Recalling that D=2^{100a^2}, we obtain
\frac{1}{4} + 2D |\{J' \in \mathcal{J}' \ : \ B(J') \cap B(J) \ne \emptyset\}|\leq 2^{200a^3 + 100a^2 + 7a + 2}.
Since a\ge 4, eq-pao-3 follows.
Proof of Lemma 1.7.5.1.3. Suppose that s(J') < s(J) - 1. Then
s(J) > -S. Thus, by the definition of \mathcal{J}' there exists no
\fp \in \mathfrak{S} with
\scI(\fp) \subset B(c(J), 100D^{s(J) + 1}).
Since s(J') < s(J), there exists a cube J'' \in \mathcal{D} with
J \subset J'' and s(J'') = s(J') + 1. By the definition of
\mathcal{J}', there exists a tile \fp \in \mathfrak{S} with
\scI(\fp) \subset B(c(J''), 100 D^{s(J')+2}).
But by the triangle inequality and defineD, we have
B(c(J''), 100 D^{s(J')+2}) \subset B(c(J), 100D^{s(J) + 1}),
which contradicts eq-tile-incl-1 and tile-incl-2.
1.7.5.2. Holder estimates for adjoint tree operators
Let g_1, g_2:X \to \mathbb{C} be bounded with bounded support. Define for
J \in \mathcal{J}'
h_J(y) := \chi_J(y)\cdot(e(\fcc(\fu_1)(y)) T_{\fT(\fu_1)}^* g_1(y)) \cdot \overline{(e(\fcc(\fu_2)(y)) T_{\fT(\fu_2) \cap \mathfrak{S}}^* g_2(y))}.
The main result of this subsubsection is the following \tau-Holder estimate
for h_J, where \tau = 1/a.
We have for all J \in \mathcal{J}' that
\|h_J\|_{C^{\tau}(B(c(J), 16D^{s(J)}))} \le 2^{485a^3} \prod_{j = 1,2} (\inf_{B(c(J), \frac{1}{8}D^{s(J)})} |T_{\fT(\fu_j)}^* g_j| + \inf_J M_{\mathcal{B}, 1} |g_j|).
Lean code for Lemma1.7.5.2.1●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.holder_correlation_tree.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f₁ f₂ : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf₁ : MeasureTheory.BoundedCompactSupport f₁ MeasureTheory.volume) (hf₂ : MeasureTheory.BoundedCompactSupport f₂ MeasureTheory.volume) : iHolENorm (t.holderFunction u₁ u₂ f₁ f₂ J) (c J) (16 * ↑(defaultD a) ^ s J) (defaultτ a) ≤ ↑(TileStructure.Forest.C7_5_4 a) * t.P7_5_4 u₁ u₂ f₁ f₂ J
theorem TileStructure.Forest.holder_correlation_tree.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f₁ f₂ : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf₁ : MeasureTheory.BoundedCompactSupport f₁ MeasureTheory.volume) (hf₂ : MeasureTheory.BoundedCompactSupport f₂ MeasureTheory.volume) : iHolENorm (t.holderFunction u₁ u₂ f₁ f₂ J) (c J) (16 * ↑(defaultD a) ^ s J) (defaultτ a) ≤ ↑(TileStructure.Forest.C7_5_4 a) * t.P7_5_4 u₁ u₂ f₁ f₂ J
Lemma 7.5.4.
We will prove this lemma at the end of this section, after establishing several auxiliary results.
We begin with the following Holder continuity estimate for adjoints of operators associated to tiles.
Let \fu \in \fU and \fp \in \fT(\fu). Then for all y, y' \in X and
all bounded g with bounded support, we have
|e(\fcc(\fu)(y)) T_{\fp}^* g(y) - e(\fcc(\fu)(y')) T_{\fp}^* g(y')|
\le \frac{2^{128a^3}}{\mu(B(\pc(\fp), 4D^{\ps(\fp)}))} \left(\frac{\rho(y, y')}{D^{\ps(\fp)}}\right)^{1/a} \int_{E(\fp)} |g(x)| \, \mathrm{d}\mu(x).
Lean code for Lemma1.7.5.2.2●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.holder_correlation_tile.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u p : 𝔓 X} {x x' : X} {f : X → ℂ} (hu : u ∈ t) (hp : p ∈ (fun x ↦ t.𝔗 x) u) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : edist (Complex.exp (Complex.I * ↑((𝒬 u) x)) * adjointCarleson p f x) (Complex.exp (Complex.I * ↑((𝒬 u) x')) * adjointCarleson p f x') ≤ ↑(TileStructure.Forest.C7_5_5 a) / MeasureTheory.volume (Metric.ball (𝔠 p) (4 * ↑(defaultD a) ^ 𝔰 p)) * (edist x x' / ↑(defaultD a) ^ 𝔰 p) ^ (↑a)⁻¹ * ∫⁻ (x : X) in E p, ‖f x‖ₑ
theorem TileStructure.Forest.holder_correlation_tile.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u p : 𝔓 X} {x x' : X} {f : X → ℂ} (hu : u ∈ t) (hp : p ∈ (fun x ↦ t.𝔗 x) u) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : edist (Complex.exp (Complex.I * ↑((𝒬 u) x)) * adjointCarleson p f x) (Complex.exp (Complex.I * ↑((𝒬 u) x')) * adjointCarleson p f x') ≤ ↑(TileStructure.Forest.C7_5_5 a) / MeasureTheory.volume (Metric.ball (𝔠 p) (4 * ↑(defaultD a) ^ 𝔰 p)) * (edist x x' / ↑(defaultD a) ^ 𝔰 p) ^ (↑a)⁻¹ * ∫⁻ (x : X) in E p, ‖f x‖ₑ
Lemma 7.5.5.
Proof. By definetp*, we have
|e(\fcc(\fu)(y)) T_{\fp}^* g(y) - e(\fcc(\fu)(y')) T_{\fp}^* g(y')|
=\bigg| \int_{E(\fp)} e(\tQ(x)(x) - \tQ(x)(y) + \fcc(\fu)(y)) \overline{K_{\ps(\fp)}(x, y)} g(x)
- e(\tQ(x)(x) - \tQ(x)(y') + \fcc(\fu)(y')) \overline{K_{\ps(\fp)}(x, y')} g(x) \, \mathrm{d}\mu(x)\bigg|
\leq\int_{E(\fp)} |g(x)| |e(\tQ(x)(y) - \tQ(x)(y') - \fcc(\fu)(y) + \fcc(\fu)(y'))\overline{K_{\ps(\fp)}(x, y)}
- \overline{K_{\ps(\fp)}(x, y')}| \, \mathrm{d}\mu(x)
\leq\int_{E(\fp)} |g(x)| |e(-\tQ(x)(y) + \tQ(x)(y') + \fcc(\fu)(y) - \fcc(\fu)(y')) - 1|
\times |\overline{K_{\ps(\fp)}(x, y)}|\, \mathrm{d}\mu(x)
+ \int_{E(\fp)} |g(x)| |\overline{K_{\ps(\fp)}(x, y)} - \overline{K_{\ps(\fp)}(x, y')} |\, \mathrm{d}\mu(x).
By the oscillation estimate osccontrol, we have
|-\tQ(x)(y) + \tQ(x)(y') + \fcc(\fu)(y) - \fcc(\fu)(y')|
\le d_{B(y, 1.6\rho(y,y'))}(\tQ(x), \fcc(\fu)).
Suppose that y, y' \in B(\pc(\fp), 5D^{\ps(\fp)}), so that
\rho(y,y') \le 10D^{\ps(\fp)}. Let k \in \mathbb{Z} be such that
2^{ak}\rho(y,y') \le 10D^{\ps(\fp)} but
2^{a(k+1)} \rho(y,y') > 10D^{\ps(\fp)}. In particular, k \ge 0. Then,
using seconddb followed by firstdb, we can bound
eq-lem-tile-Holder-comp from above by
2^{-k} d_{B(\pc(\fp), 16 D^{\ps(\fp)})}(\tQ(x), \fcc(\fu)) \le 2^{6a - k} d_{\fp}(\tQ(x), \fcc(\fu)).
Since x \in E(\fp) we have \tQ(x) \in \Omega(\fp) \subset B_{\fp}(\fcc(\fp), 1),
and since \fp \in \fT(\fu) we have
\fcc(\fu) \in B_{\fp}(\fcc(\fp), 4), so this is estimated by
\le 5 \cdot 2^{6a - k}.
By definition of k, we have
-k < 1 - \frac{1}{a} \log_2\left(\frac{10 D^{\ps(\fp)}}{\rho(y,y')}\right),
which gives
|-\tQ(x)(y) + \tQ(x)(y') + \fcc(\fu)(y) - \fcc(\fu)(y')| \le 10 \cdot 2^{6a} \left(\frac{\rho(y,y')}{10 D^{\ps(\fp)}}\right)^{1/a}.
For all x \in \scI(\fp), we have by doublingx that
\mu(B(x, D^{\ps(\fp)})) \ge 2^{-3a} \mu(B(\pc(\fp), 4D^{\ps(\fp)})).
Combining the above with eq-Ks-size, eq-Ks-smooth and
eq-lem-Tile-holder-im1, we obtain
that the sum of the terms in T*Holder1b and T*Holder1 is bounded by
\frac{2^{3a}}{\mu(B(\pc(\fp), 4D^{\ps(\fp)}))} \int_{E(\fp)}|g(x)| \, \mathrm{d}\mu(x) \times
(2^{102a^3} \cdot 10 \cdot 2^{6a} \left(\frac{\rho(y,y')}{ D^{\ps(\fp)}}\right)^{1/a} + 2^{127a^3} \left(\frac{\rho(y,y')}{D^{\ps(\fp)}}\right)^{1/a})
Since \rho(y,y') \le 10 D^{\ps(\fp)}, we conclude
that the sum of the terms in T*Holder1b and T*Holder1 is bounded by
\frac{2^{128a^3}}{\mu(B(\pc(\fp), 4D^{\ps(\fp)}))} \left(\frac{\rho(y,y')}{D^{\ps(\fp)}}\right)^{1/a} \int_{E(\fp)}|g(x)| \, \mathrm{d}\mu(x).
Next, if y,y' \notin B(\pc(\fp), 5D^{\ps(\fp)}), then
T_{\fp}^*g(y) = T_{\fp}^*g(y') = 0, by Lemma 1.7.4.1. Then
T*Holder2 holds.
Finally, if y \in B(\pc(\fp), 5D^{\ps(\fp)}) and
y' \notin B(\pc(\fp), 5D^{\ps(\fp)}), then
|e(\fcc(\fu)(y)) T_{\fp}^* g(y) - e(\fcc(\fu)(y')) T_{\fp}^* g(y')| = |T_{\fp}^* g(y)|
\le \int_{E(\fp)} |K_{\ps(\fp)}(x,y)| |g(x)| \, \mathrm{d}\mu(x).
By the same argument used to prove eq-Ks-aux, this is bounded by
\le 2^{102a^3} \int_{E(\fp)} \frac{1}{\mu(B(x, D^s))} \psi(D^{-s} \rho(x,y)) |g(x)| \, \mathrm{d}\mu(x).
It follows from the definition of \psi that
\psi(x) \le \max\{0, (2 - 4x)^{1/a}\}.
Now for all x\in E(\fp), it follows by the triangle inequality and
eq-vol-sp-cube that
2 - 4D^{-\ps(\fp)}\rho(x,y)\leq 2 - 4D^{-\ps(\fp)}\rho(y, \pc(\fp)) + 4 D^{-\ps(\fp)}\rho(x, \pc(\fp))
\leq 18 - 4 D^{-\ps(\fp)} \rho(y, \pc(\fp)) \leq 4 D^{-\ps(\fp)}\rho(y,y') - 2.
Combining the above with the previous estimate on \psi, we get
\psi(D^{-\ps(\fp)}\rho(x,y)) \le 4 (D^{-\ps(\fp)}\rho(y,y'))^{1/a}.
Further, we obtain from the doubling property doublingx and
eq-vol-sp-cube that
\mu(B(x, D^{\ps(\fp)})) \ge 2^{-3a} \mu(B(\pc(\fp), 4D^{\ps(\fp)})).
Plugging this into eq-lem-Tile-holder-im2 and using a \ge 4, we get
|T_{\fp}^* g(y)| \le \frac{2^{103a^3}}{\mu(B(\pc(\fp), 4D^{\ps(\fp)}))} \left(\frac{\rho(y,y')}{D^{\ps(\fp)}}\right)^{1/a} \int_{E(\fp)} |g(x)| \, \mathrm{d}\mu(y),
which completes the proof of the lemma.
Recall that
B(J) := B(c(J), 8D^{s(J)}).
We also denote
B'(J) := B(c(J), 16D^{s(J)}),
B^\circ{}(J) := B(c(J), \frac{1}{8}D^{s(J)}).
Let \fp \in \fT(\fu_2) \setminus \mathfrak{S}, J \in \mathcal{J}' and
suppose that
B(\scI(\fp)) \cap B^\circ(J) \ne \emptyset.
Then
s(J) \le \ps(\fp) \le s(J) +3.
Lean code for Lemma1.7.5.2.3●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.limited_scale_impact.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ p : 𝔓 X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hp : p ∈ (fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (h : ¬Disjoint (Metric.ball (𝔠 p) (8 * ↑(defaultD a) ^ 𝔰 p)) (Metric.ball (c J) (8⁻¹ * ↑(defaultD a) ^ s J))) : 𝔰 p ∈ Set.Icc (s J) (s J + 3)
theorem TileStructure.Forest.limited_scale_impact.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ p : 𝔓 X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hp : p ∈ (fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (h : ¬Disjoint (Metric.ball (𝔠 p) (8 * ↑(defaultD a) ^ 𝔰 p)) (Metric.ball (c J) (8⁻¹ * ↑(defaultD a) ^ s J))) : 𝔰 p ∈ Set.Icc (s J) (s J + 3)
Lemma 7.5.6.
Proof. For the first estimate, assume that \ps(\fp) < s(J), then in
particular \ps(\fp) \le \ps(\fu_1). Since \fp \notin \mathfrak{S}, we
have by Lemma 1.7.4.7 that
\scI(\fp) \cap \scI(\fu_1) = \emptyset. Since
B\Big(c(J), \frac{1}{4} D^{s(J)}\Big) \subset \scI(J) \subset \scI(\fu_1),
this implies
\rho(c(J), \pc(\fp)) \ge \frac{1}{4}D^{s(J)}.
On the other hand
\rho(c(J), \pc(\fp)) \le \frac{1}{8} D^{s(J)} + 8 D^{\ps(\fp)},
by our assumption. Thus D^{\ps(\fp)} \ge 64^{-1} D^{s(J)}, which
contradicts defineD and a \ge 4.
For the second estimate, assume that \ps(\fp) > s(J) + 3. Since
J \in \mathcal{J}', we have J \subsetneq \scI(\fu_1). Thus there exists
J' \in \mathcal{D} with J \subset J' and s(J') = s(J) + 1, by
coverdyadic and dyadicproperty. By definition of \mathcal{J}', there
exists some \fp' \in \mathfrak{S} such that
\scI(\fp') \subset B(c(J'), 100 D^{s(J) + 2}). On the other hand, since
B(\scI(\fp)) \cap B^\circ(J) \ne \emptyset, by the triangle inequality it
holds that
B(c(J'), 100 D^{s(J) + 3}) \subset B(\pc(\fp), 10 D^{\ps(\fp)}).
Using the definition of \mathfrak{S}, we have
2^{Zn/2} \le d_{\fp'}(\fcc(\fu_1), \fcc(\fu_2)) \le d_{B(c(J'), 100 D^{s(J) + 2})}(\fcc(\fu_1), \fcc(\fu_2)).
By seconddb, this is
\le 2^{-100a} d_{B(c(J'), 100 D^{s(J) + 3})}(\fcc(\fu_1), \fcc(\fu_2))
\le 2^{-100a} d_{B(\pc(\fp), 10 D^{\ps(\fp)})}(\fcc(\fu_1), \fcc(\fu_2)),
and by firstdb and the definition of \mathfrak{S}
\le 2^{-94a} d_{\fp}(\fcc(\fu_1), \fcc(\fu_2)) \le 2^{-94a} 2^{Zn/2}.
This is a contradiction, the second estimate follows.
-
TileStructure.Forest.local_tree_control[complete]
For all J \in \mathcal{J}' and all bounded g with bounded support
\sup_{B^\circ{}(J)} |T_{\mathfrak{T}(\mathfrak{u}_2)\setminus\mathfrak{S}}^* g| \le 2^{104a^3} \inf_J M_{\mathcal{B},1}|g|
Lean code for Lemma1.7.5.2.4●1 theorem
Associated Lean declarations
-
TileStructure.Forest.local_tree_control[complete]
-
TileStructure.Forest.local_tree_control[complete]
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.local_tree_control.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ⨆ x ∈ Metric.ball (c J) (8⁻¹ * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) f x‖ₑ ≤ ↑(TileStructure.Forest.C7_5_7 a) * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
theorem TileStructure.Forest.local_tree_control.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ⨆ x ∈ Metric.ball (c J) (8⁻¹ * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) f x‖ₑ ≤ ↑(TileStructure.Forest.C7_5_7 a) * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
Lemma 7.5.7.
Proof. By the triangle inequality and since
T_{\fp}^* g = \mathbf{1}_{B(\pc(\fp), 5D^{\ps(\fp)})} T_{\fp}^* g, we have
\sup_{B^\circ{}(J)} |T_{\fT(\fu_2) \setminus\mathfrak{S}}^* g|
\leq \sup_{B^\circ{}(J)} \sum_{\substack{\fp \in \fT(\fu_2) \setminus \mathfrak{S}\\ B(\scI(\fp)) \cap B^\circ(J) \ne \emptyset}} |T_{\fp}^*g|.
By Lemma 1.7.5.2.3, this is at most
\sum_{s = s(J)}^{s(J) + 3} \sum_{\substack{\fp \in \fP, \ps(\fp) = s\\ B(\scI(\fp)) \cap B^\circ(J) \ne \emptyset}} \sup_{B^\circ{}(J)} |T_{\fp}^* g|.
If x \in E(\fp) and B(\scI(\fp)) \cap B^\circ(J) \ne \emptyset, then
B(c(J), 16D^{\ps(\fp)}) \subset B(x, 32 D^{\ps(\fp)}),
by eq-vol-sp-cube and the triangle inequality. Using the doubling property
doublingx, it follows that
\mu(B(x, D^{\ps(\fp)})) \ge 2^{-5a} \mu(B(c(J), 16D^{\ps(\fp)})).
Using definetp*, eq-Ks-size and that a \ge 4, we bound
eq-sep-tree-aux-3 by
2^{103a^3}\sum_{s = s(J)}^{s(J) + 3} \sum_{\substack{\fp \in \fP, \ps(\fp) = s\\B(\scI(\fp)) \cap B^\circ(J) \ne \emptyset}} \frac{1}{\mu(B(c(J), 16 D^s)} \int_{E(\fp)} |g| \, \mathrm{d}\mu.
For each I \in \mathcal{D}, the sets E(\fp) for \fp \in \fP with
\scI(\fp) = I are pairwise disjoint by defineep and
eq-dis-freq-cover. Further, if
B(\scI(\fp)) \cap B^\circ(J) \ne \emptyset and \ps(\fp) \ge s(J), then
E(\fp) \subset B(c(J), 16 D^{\ps(\fp)}). Thus the last display is bounded
by
2^{103a^3}\sum_{s = s(J)}^{s(J) + 3} \frac{1}{\mu(B(c(J), 16 D^s))} \int_{B(c(J), 16 D^s)} |g| \, \mathrm{d}\mu.
\le \inf_{x' \in J} 2^{103a^3 +2} M_{\mathcal{B}, 1} |g|.
The lemma follows since a \ge 4.
Let \fC = \fT(\fu_1) or \fC = \fT(\fu_2) \cap \mathfrak{S}. Then for
each J \in \mathcal{J}' and \fp \in \fC with
B(\scI(\fp)) \cap B'(J) \neq \emptyset, we have \ps(\fp) \ge s(J).
Lean code for Lemma1.7.5.2.5●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.scales_impacting_interval.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ p : 𝔓 X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hp : p ∈ (fun x ↦ t.𝔗 x) u₁ ∪ (fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) (h : ¬Disjoint (Metric.ball (𝔠 p) (8 * ↑(defaultD a) ^ 𝔰 p)) (Metric.ball (c J) (16 * ↑(defaultD a) ^ s J))) : s J ≤ 𝔰 p
theorem TileStructure.Forest.scales_impacting_interval.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ p : 𝔓 X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hp : p ∈ (fun x ↦ t.𝔗 x) u₁ ∪ (fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) (h : ¬Disjoint (Metric.ball (𝔠 p) (8 * ↑(defaultD a) ^ 𝔰 p)) (Metric.ball (c J) (16 * ↑(defaultD a) ^ s J))) : s J ≤ 𝔰 p
Lemma 7.5.8.
Proof. By Lemma 1.7.4.7, we have that in both cases,
\fC \subset \mathfrak{S}. If \fp \in \fC with
B(\scI(\fp)) \cap B'(J) \neq \emptyset and \ps(\fp) < s(J), then
\scI(\fp) \subset B(c(J), 100 D^{s(J) + 1}). Since
\fp \in \mathfrak{S}, it follows from the definition of \mathcal{J}'
that s(J) = -S, which contradicts \ps(\fp) < s(J).
Let \fC_1 = \fT(\fu_1) and
\fC_2 = \fT(\fu_2) \cap \mathfrak{S}. Then for i = 1,2 and each
J \in \mathcal{J}' and all bounded g with bounded support, we have
\sup_{B'(J)} |T_{\fC_i}^*g| \leq \inf_{B^\circ{}(J)} |T^*_{\fC_i} g| + 2^{128a^3+4a+3} \inf_{J} M_{\mathcal{B},1} |g|
and for all y,y' \in B'(J)
|e(\fcc(\fu_i)(y)) T_{\fC_i}^* g(y) - e(\fcc(\fu_i)(y')) T_{\fC_i}^* g(y')|
\le 2^{128a^3+4a+1} \left(\frac{\rho(y,y')}{D^{s(J)}}\right)^{1/a} \inf_J M_{\mathcal{B},1} |g|.
Lean code for Lemma1.7.5.2.6●3 theorems
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.global_tree_control1_edist_left.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {x x' : X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (hx : x ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J)) (hx' : x' ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J)) : edist (Complex.exp (Complex.I * ↑((𝒬 u₁) x)) * adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) f x) (Complex.exp (Complex.I * ↑((𝒬 u₁) x')) * adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) f x') ≤ ↑(TileStructure.Forest.C7_5_9d a) * (edist x x' / ↑(defaultD a) ^ s J) ^ (↑a)⁻¹ * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
theorem TileStructure.Forest.global_tree_control1_edist_left.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {x x' : X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (hx : x ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J)) (hx' : x' ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J)) : edist (Complex.exp (Complex.I * ↑((𝒬 u₁) x)) * adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) f x) (Complex.exp (Complex.I * ↑((𝒬 u₁) x')) * adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₁) f x') ≤ ↑(TileStructure.Forest.C7_5_9d a) * (edist x x' / ↑(defaultD a) ^ s J) ^ (↑a)⁻¹ * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
Equation (7.5.18) of Lemma 7.5.9 for `ℭ = t u₁`.
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.global_tree_control1_edist_right.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {x x' : X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (hx : x ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J)) (hx' : x' ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J)) : edist (Complex.exp (Complex.I * ↑((𝒬 u₂) x)) * adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) f x) (Complex.exp (Complex.I * ↑((𝒬 u₂) x')) * adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) f x') ≤ ↑(TileStructure.Forest.C7_5_9d a) * (edist x x' / ↑(defaultD a) ^ s J) ^ (↑a)⁻¹ * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
theorem TileStructure.Forest.global_tree_control1_edist_right.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {x x' : X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) (hx : x ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J)) (hx' : x' ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J)) : edist (Complex.exp (Complex.I * ↑((𝒬 u₂) x)) * adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) f x) (Complex.exp (Complex.I * ↑((𝒬 u₂) x')) * adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) f x') ≤ ↑(TileStructure.Forest.C7_5_9d a) * (edist x x' / ↑(defaultD a) ^ s J) ^ (↑a)⁻¹ * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
Equation (7.5.18) of Lemma 7.5.9 for `ℭ = t u₂ ∩ 𝔖₀ t u₁ u₂`.
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.global_tree_control1_supbound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (ℭ : Set (𝔓 X)) (hℭ : ℭ = (fun x ↦ t.𝔗 x) u₁ ∨ ℭ = (fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ⨆ x ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ℭ f x‖ₑ ≤ (⨅ x ∈ Metric.ball (c J) (8⁻¹ * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ℭ f x‖ₑ) + ↑(TileStructure.Forest.C7_5_9s a) * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
theorem TileStructure.Forest.global_tree_control1_supbound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (ℭ : Set (𝔓 X)) (hℭ : ℭ = (fun x ↦ t.𝔗 x) u₁ ∨ ℭ = (fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ⨆ x ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ℭ f x‖ₑ ≤ (⨅ x ∈ Metric.ball (c J) (8⁻¹ * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ℭ f x‖ₑ) + ↑(TileStructure.Forest.C7_5_9s a) * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
Equation (7.5.17) of Lemma 7.5.9.
Proof. Note that TreeUB follows from TreeHolder, since for
y' \in B^\circ{}(J), by the triangle inequality,
\left(\frac{\rho(y,y')}{D^{s(J)}}\right)^{1/a}\le \Big(16 + \frac{1}8\Big)^{1/a}\le 2^2.
By the triangle inequality, Lemma 1.7.4.1 and Lemma 1.7.5.2.2,
we have for all y, y' \in B'(J)
|e(\fcc(\fu_i)(y)) T_{\fC_i}^* g(y) - e(\fcc(\fu_i)(y')) T_{\fC_i}^* g(y')|
\le \sum_{\substack{\fp \in \fC_i\\ B(\scI(\fp)) \cap B'(J) \neq \emptyset}} |e(\fcc(\fu_i)(y)) T_{\fp}^* g(y) - e(\fcc(\fu_i)(y')) T_{\fp}^* g(y')|
\le 2^{128a^3}\rho(y,y')^{1/a} \sum_{\substack{\fp \in \fC_i\\ B(\scI(\fp)) \cap B'(J) \neq \emptyset}} \frac{D^{- \ps(\fp)/a}}{\mu(B(\pc(\fp), 4D^{\ps(\fp)}))} \int_{E(\fp)} |g| \, \mathrm{d}\mu.
By Lemma 1.7.5.2.5, we have \ps(\fp) \ge s(J) for all
\fp occurring in the sum. Further, for each s \ge s(J), the sets
E(\fp) for \fp \in \fP with \ps(\fp) = s are pairwise disjoint by
defineep and eq-dis-freq-cover, and contained in
B(c(J), 32D^{s}) by eq-vol-sp-cube and the triangle inequality. Using
also the doubling estimate doublingx, we obtain that the expression in the
last display can be estimated by
2^{128a^3}\rho(y,y')^{1/a} \sum_{S \ge s \ge s(J)} D^{-s/a} \frac{2^{4a}}{\mu(B(c(J), 32D^{s}))} \int_{B(c(J), 32D^{s})} |g| \, \mathrm{d}\mu
\le 2^{128a^3+4a} \left(\frac{\rho(y,y')}{D^{s(J)}}\right)^{1/a} \sum_{S \ge s \ge s(J)} D^{(s(J) - s)/a} \inf_J M_{\mathcal{B},1} |g|.
Since D^{-1/a}\le\frac12, we have
\sum_{S \ge s \ge s(J)} D^{(s(J) - s)/a} \le 2.
Estimate TreeHolder, and therefore the lemma, follow.
We have for all J \in \mathcal{J}' and all bounded g with bounded
support
\sup_{B'(J)} |T^*_{\fT(\fu_2) \cap \mathfrak{S}} g| \le \inf_{B^\circ{}(J)} |T^*_{\fT(\fu_2)} g| + 2^{129a^3} \inf_{J} M_{\mathcal{B},1}|g|.
Lean code for Lemma1.7.5.2.7●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.global_tree_control2.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ⨆ x ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) f x‖ₑ ≤ (⨅ x ∈ Metric.ball (c J) (8⁻¹ * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂) f x‖ₑ) + ↑(TileStructure.Forest.C7_5_10 a) * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
theorem TileStructure.Forest.global_tree_control2.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f : X → ℂ} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : ⨆ x ∈ Metric.ball (c J) (16 * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ ∩ t.𝔖₀ u₁ u₂) f x‖ₑ ≤ (⨅ x ∈ Metric.ball (c J) (8⁻¹ * ↑(defaultD a) ^ s J), ‖adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂) f x‖ₑ) + ↑(TileStructure.Forest.C7_5_10 a) * ⨅ x ∈ J, maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x
Lemma 7.5.10
Proof. By Lemma 1.7.5.2.6
\sup_{B'(J)} |T^*_{\fT(\fu_2) \cap \mathfrak{S}} g| \le \inf_{B^\circ{}(J)} |T_{\fT(\fu_2) \cap \mathfrak{S}}^* g| + 2^{128a^3+4a+3} \inf_{J} M_{\mathcal{B}, 1} |g|
\le \inf_{B^\circ{}(J)} |T_{\fT(\fu_2)}^* g| + \sup_{B^\circ{}(J)} |T_{\fT(\fu_2) \setminus \mathfrak{S}}^* g| + 2^{128a^3+4a+3} \inf_{J} M_{\mathcal{B}, 1} |g|,
and by Lemma 1.7.5.2.4
\le \inf_{B^\circ{}(J)} |T_{\fT(\fu_2)}^* g| + (2^{104a^3} + 2^{128a^3+4a+3}) \inf_{J} M_{\mathcal{B}, 1} |g|.
This completes the proof.
Proof of Lemma 1.7.5.2.1. Let P be the product on the right-hand
side of hHolder, and h_J be as defined in def-hj. By eq-pao-2 and
Lemma 1.7.4.1, the function h_J is supported in
B'(J) \cap \scI(\fu_1). By eq-pao-2, Lemma 1.7.5.2.6 and
Lemma 1.7.5.2.7, we have for all y \in B'(J):
|h_J(y)| \le 2^{257a^3+4a+3} P.
We have by the triangle inequality
|h_J(y) - h_J(y')|
\le |\chi_J(y) - \chi_J(y')| |T_{\fT(\fu_1)}^* g_1(y)| |T_{\fT(\fu_2) \cap \mathfrak{S}}^* g_2(y)|
+ |\chi_J(y')| |e(\fcc(\fu_1)(y)) T_{\fT(\fu_1)}^* g_1(y) - e(\fcc(\fu_1)(y')) T_{\fT(\fu_1)}^* g_1(y')| |T_{\fT(\fu_2) \cap \mathfrak{S}}^* g_2(y)|
+ |\chi_J(y')| |T_{\fT(\fu_1)}^* g_1(y')| |e(\fcc(\fu_2)(y)) T_{\fT(\fu_2) \cap \mathfrak{S}}^* g_2(y) - e(\fcc(\fu_2)(y')) T_{\fT(\fu_2) \cap \mathfrak{S}}^* g_2(y')|.
As h_J is supported in \scI(\fu_1), we can assume without loss of
generality that y' \in \scI(\fu_1). If y \notin \scI(\fu_1), then
eq-h-Lip-1 vanishes. If y \in \scI(\fu_1) then we have by eq-pao-3,
Lemma 1.7.5.2.6 and Lemma 1.7.5.2.7
that eq-h-Lip-1 is bounded by
2^{484a^3+4a+3} \frac{\rho(y,y')}{D^{s(J)}} P,
where P denotes the product on the right hand side of hHolder.
By eq-pao-2, Lemma 1.7.5.2.6 and Lemma 1.7.5.2.7, we have
the bound
2^{257a^3+4a+1} \left(\frac{\rho(y,y')}{D^{s(J)}}\right)^{1/a} P.
By eq-pao-2, and twice Lemma 1.7.5.2.6, we have
the bound
2^{256a^3+8a+5} \left(\frac{\rho(y,y')}{D^{s(J)}}\right)^{1/a} P.
Using that \rho(y,y') \le 32D^{s(J)} and a \ge 4, the lemma follows.
1.7.5.3. The van der Corput estimate
For all J \in \mathcal{J}', we have that
d_{B(J)}(\fcc(\fu_1), \fcc(\fu_2)) \ge 2^{-201a^3} 2^{Zn/2}.
Lean code for Lemma1.7.5.3.1●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/LargeSeparation.leancomplete
theorem TileStructure.Forest.lower_oscillation_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) : ↑(TileStructure.Forest.C7_5_11 a n) ≤ dist_{c J, 8 * ↑(defaultD a) ^ s J} (𝒬 u₁) (𝒬 u₂)
theorem TileStructure.Forest.lower_oscillation_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hJ : J ∈ t.𝓙₅ u₁ u₂) : ↑(TileStructure.Forest.C7_5_11 a n) ≤ dist_{c J, 8 * ↑(defaultD a) ^ s J} (𝒬 u₁) (𝒬 u₂)
Lemma 7.5.11
Proof. Since \emptyset \ne \fT(\fu_1) \subset \mathfrak{S} by
Lemma 1.7.4.7, there exists at least one tile
\fp \in \mathcal{S} with \scI(\fp) \subsetneq \scI(\fu_1). Thus
\scI(\fu_1) \notin \mathcal{J}', so J \subsetneq \scI(\fu_1). Thus
there exists a cube J' \in \mathcal{D} with J \subset J' and
s(J') = s(J) + 1, by coverdyadic and dyadicproperty. By definition of
\mathcal{J'} and the triangle inequality, there exists
\fp \in \mathfrak{S} such that
\scI(\fp) \subset B(c(J'), 100 D^{s(J') + 1}) \subset B(c(J), 128 D^{s(J)+2}).
Thus, by definition of \mathfrak{S}:
2^{Zn/2} \le d_{\fp}(\fcc(\fu_1), \fcc(\fu_2)) \le d_{B(c(J), 128 D^{s(J)+2})}(\fcc(\fu_1), \fcc(\fu_2)).
By the doubling property firstdb, this is
\le 2^{200a^3 + 4a} d_{B(J)}(\fcc(\fu_1), \fcc(\fu_2)),
which gives the lemma using a \ge 4.
Now we are ready to prove Lemma 1.7.4.5.
Proof of Lemma 1.7.4.5. The left-hand side of
eq-lhs-big-sep-tree equals
\left| \int_{X} T_{\fT(\fu_1)}^* g_1 \overline{T_{\fT(\fu_2) \cap \mathfrak{S}}^* g_2 }\right|.
By Lemma 1.7.4.1, the right hand side is supported in
\scI(\fu_1). Using eq-pao-1 of Lemma 1.7.5.1.2 and the
definition def-hj of h_J, we thus have
\le \sum_{J \in \mathcal{J}'} \left|\int_{X} e(\fcc(\fu_2)(y) - \fcc(\fu_1)(y)) h_J(y) \, \mathrm{d}\mu(y) \right|.
Using Theorem 1.2.5 with the ball B(J), we bound this by
\le 2^{7a} \sum_{J \in \mathcal{J}'} \mu(B(J)) \|h_J\|_{C^{\tau}(B'(J))} (1 + d_{B(J)}(\fcc(\fu_2), \fcc(\fu_1)))^{-1/(2a^2+a^3)}.
Using Lemma 1.7.5.2.1, Lemma 1.7.5.3.1 and a \ge 4, we
bound the above by
\le 2^{485a^3+7a+3a^3+3a} 2^{-Zn/(4a^2 + 2a^3)} \sum_{J \in \mathcal{J}'} \mu(B(J))
\times \prod_{j=1}^2 (\inf_{B^\circ{}(J)} |T_{\fT(\fu_j)}^* g_j| + \inf_J M_{\mathcal{B}, 1} g_j).
By the doubling property doublingx
\mu(B(J)) \le 2^{6a} \mu(B^\circ{}(J)),
thus
\mu(B(J)) \prod_{j=1}^2 (\inf_{B^\circ{}(J)} |T_{\fT(\fu_j)}^* g_j| + \inf_J M_{\mathcal{B}, 1} g_j)
\le 2^{6a} \int_{B^\circ{}(J)} \prod_{j=1}^2 ( |T_{\fT(\fu_j)}^* g_j|(x) + M_{\mathcal{B},1} g_j(x)) \, \mathrm{d}\mu(x)
\le 2^{6a} \int_J \prod_{j=1}^2 ( |T_{\fT(\fu_j)}^* g_j|(x) + M_{\mathcal{B},1} g_j(x)) \, \mathrm{d}\mu(x).
Summing over J \in \mathcal{J}', we obtain
the estimate eq-big-sep-1:
2^{499a^3} 2^{-Zn/(4a^2 + 2a^3)} \int_X \prod_{j=1}^2 ( |T_{\fT(\fu_j)}^* g_j|(x) + M_{\mathcal{B},1} g_j(x)) \, \mathrm{d}\mu(x).
Applying the Cauchy-Schwarz inequality, Lemma 1.7.4.5
follows.
1.7.6. Proof of The Remaining Tiles Lemma
-
TileStructure.Forest.union_𝓙₆[complete] -
TileStructure.Forest.pairwiseDisjoint_𝓙₆[complete]
We have
\scI(\fu_1) = \dot{\bigcup_{J \in \mathcal{J}'}} J.
Lean code for Lemma1.7.6.1●2 theorems
Associated Lean declarations
-
TileStructure.Forest.union_𝓙₆[complete]
-
TileStructure.Forest.pairwiseDisjoint_𝓙₆[complete]
-
TileStructure.Forest.union_𝓙₆[complete] -
TileStructure.Forest.pairwiseDisjoint_𝓙₆[complete]
-
theoremdefined in Carleson/ForestOperator/RemainingTiles.leancomplete
theorem TileStructure.Forest.union_𝓙₆.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ : 𝔓 X} (hu₁ : u₁ ∈ t) : ⋃ J ∈ t.𝓙₆ u₁, ↑J = ↑(𝓘 u₁)
theorem TileStructure.Forest.union_𝓙₆.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ : 𝔓 X} (hu₁ : u₁ ∈ t) : ⋃ J ∈ t.𝓙₆ u₁, ↑J = ↑(𝓘 u₁)
Part of Lemma 7.6.1.
-
theoremdefined in Carleson/ForestOperator/RemainingTiles.leancomplete
theorem TileStructure.Forest.pairwiseDisjoint_𝓙₆.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ : 𝔓 X} : (t.𝓙₆ u₁).PairwiseDisjoint fun I ↦ ↑I
theorem TileStructure.Forest.pairwiseDisjoint_𝓙₆.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ : 𝔓 X} : (t.𝓙₆ u₁).PairwiseDisjoint fun I ↦ ↑I
Part of Lemma 7.6.1.
Proof. By Lemma 1.7.1.2, it remains only to show that each
J \in \mathcal{J}(\fT(\fu_1)) with J \cap \scI(\fu_1) \ne \emptyset is
in \mathcal{J}'. But if J \notin \mathcal{J}', then by
dyadicproperty \scI(\fu_1) \subsetneq J. Pick \fp \in \fT(\fu_1).
Then \scI(\fp) \subsetneq J. This contradicts the definition of
\mathcal{J}(\fT(\fu_1)).
Lemma 1.7.4.6 follows from the following key estimate.
We have for all bounded f with bounded support
\|P_{\mathcal{J}'}|T_{\fT(\fu_2) \setminus \mathfrak{S}}^* g_2|\|_2 \le 2^{102a^3+21a+5} 2^{-\frac{25}{101a}Zn\kappa} \|\mathbf{1}_{\scI(\fu_1)} M_{\mathcal{B},1} |g_2|\|_2.
Lean code for Lemma1.7.6.2●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/RemainingTiles.leancomplete
theorem TileStructure.Forest.bound_for_tree_projection.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f : X → ℂ} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : MeasureTheory.eLpNorm (TileStructure.Forest.approxOnCube (t.𝓙₆ u₁) fun x ↦ ‖adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) f x‖) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_6_2 a n) * MeasureTheory.eLpNorm ((↑(𝓘 u₁)).indicator fun x ↦ maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x) 2 MeasureTheory.volume
theorem TileStructure.Forest.bound_for_tree_projection.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ : 𝔓 X} {f : X → ℂ} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hf : MeasureTheory.BoundedCompactSupport f MeasureTheory.volume) : MeasureTheory.eLpNorm (TileStructure.Forest.approxOnCube (t.𝓙₆ u₁) fun x ↦ ‖adjointCarlesonSum ((fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) f x‖) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_6_2 a n) * MeasureTheory.eLpNorm ((↑(𝓘 u₁)).indicator fun x ↦ maximalFunction MeasureTheory.volume TileStructure.Forest.𝓑 TileStructure.Forest.c𝓑 TileStructure.Forest.r𝓑 1 f x) 2 MeasureTheory.volume
Lemma 7.6.2.
We prove this lemma below. First, we deduce Lemma 1.7.4.6.
Proof of Lemma 1.7.4.6. By Lemma 1.7.2.1 and
Lemma 1.7.4.1, we have
that the left-hand side of eq-lhs-small-sep-tree is bounded by
2^{130a^3} \|P_{\mathcal{L}(\fT(\fu_1))} |\mathbf{1}_{\scI(\fu_1)}g_1| \|_2 \|P_{\mathcal{J}(\fT(\fu_1) )}|\mathbf{1}_{\scI(\fu_1)} T_{\fT(\fu_2) \setminus \mathfrak{S}}^* g_2|\|_2.
It follows from the definition of the projection operator P and Jensen's
inequality that
\|P_{\mathcal{L}(\fT(\fu_1))} |g_1\mathbf{1}_{\scI(\fu_1)}| \|_2 \le \|g_1 \mathbf{1}_{\scI(\fu_1)}\|_2.
By Lemma 1.7.6.1, a cube J \in \mathcal{J}(\fT(\fu_1)) intersects
\scI(\fu_1) if and only if J \in \mathcal{J}'. Thus
P_{\mathcal{J}(\fT(\fu_1) )}|\mathbf{1}_{\scI(\fu_1)} T_{\fT(\fu_2) \setminus \mathfrak{S}}^* g_2| = P_{\mathcal{J}'}|T_{\fT(\fu_2) \setminus \mathfrak{S}}^* g_2|.
Combining this with Lemma 1.7.6.2, the definition definekappa
and a \ge 4 proves the lemma.
We need two more auxiliary lemmas before we prove Lemma 1.7.6.2.
-
TileStructure.Forest.thin_scale_impact[complete]
If \fp \in \fT(\fu_2) \setminus \mathfrak{S} and J \in \mathcal{J'} with
B(\scI(\fp)) \cap B(J) \ne \emptyset, then
\ps(\fp) \le s(J) + 2 - \frac{Zn}{202a^3}.
Lean code for Lemma1.7.6.3●1 theorem
Associated Lean declarations
-
TileStructure.Forest.thin_scale_impact[complete]
-
TileStructure.Forest.thin_scale_impact[complete]
-
theoremdefined in Carleson/ForestOperator/RemainingTiles.leancomplete
theorem TileStructure.Forest.thin_scale_impact.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ p : 𝔓 X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hp : p ∈ (fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) (hJ : J ∈ t.𝓙₆ u₁) (hd : ¬Disjoint (Metric.ball (𝔠 p) (8 * ↑(defaultD a) ^ 𝔰 p)) (Metric.ball (c J) (8 * ↑(defaultD a) ^ s J))) : ↑(𝔰 p) ≤ ↑(s J) - TileStructure.Forest.C7_6_3 a n
theorem TileStructure.Forest.thin_scale_impact.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ u₂ p : 𝔓 X} {J : Grid X} (hu₁ : u₁ ∈ t) (hu₂ : u₂ ∈ t) (hu : u₁ ≠ u₂) (h2u : 𝓘 u₁ ≤ 𝓘 u₂) (hp : p ∈ (fun x ↦ t.𝔗 x) u₂ \ t.𝔖₀ u₁ u₂) (hJ : J ∈ t.𝓙₆ u₁) (hd : ¬Disjoint (Metric.ball (𝔠 p) (8 * ↑(defaultD a) ^ 𝔰 p)) (Metric.ball (c J) (8 * ↑(defaultD a) ^ s J))) : ↑(𝔰 p) ≤ ↑(s J) - TileStructure.Forest.C7_6_3 a n
Lemma 7.6.3.
Proof. Suppose that \ps(\fp) > s(J) + 2 -\frac{Zn}{202a^3} =: s(J) - s_1.
Then, we have s_1 + 2 \ge 0 so
\rho(\pc(\fp), c(J)) \le 8D^{s(J)}+8D^{\ps(\fp)} \le 16 D^{\ps(\fp) + s_1 + 2}.
There exists a tile \fq \in \fT(\fu_1). By forest1, it satisfies
\scI(\fq) \subsetneq \scI(\fu_1). Thus \scI(\fu_1) \notin \mathcal{J}'.
It follows that J \subsetneq \scI(\fu_1). By coverdyadic and
dyadicproperty, there exists a cube J' \in \mathcal{D} with
J \subset J' and s(J') = s(J) + 1. By definition of \mathcal{J}',
there exists a tile \fp' \in \fT(\fu_1) with
\scI(\fp') \subset B(c(J'), 100 D^{s(J') + 1}).
By the triangle inequality, the definition defineD and a \ge 4, we have
B(c(J'), 100 D^{s(J')+1}) \subset B(\pc(\fp), 128 D^{\ps(\fp) + s_1 + 2}).
Since \fp' \in \fT(\fu_1) and \scI(\fu_1) \subset \scI(\fu_2), we have
by forest5
d_{\fp'}(\fcc(\fp'), \fcc(\fu_2)) > 2^{Z(n+1)}.
Hence, by forest1, the triangle inequality and using that by defineZ
Z(n+1) = 2^{12a}(n+1) \ge 3
d_{\fp'}(\fcc(\fu_1), \fcc(\fu_2)) > 2^{Z(n+1)} - 4 \ge 2^{Z(n+1) - 1}.
It follows that
2^{Z(n+1)-1} \le d_{\fp'}(\fcc(\fu_1), \fcc(\fu_2)) \le d_{B(\pc(\fp), 128 D^{\ps(\fp) + s_1+ 2})}(\fcc(\fu_1), \fcc(\fu_2)).
Using firstdb, we obtain
\le 2^{9a + 100a^3 (s_1+3)} d_{\fp}(\fcc(\fu_1), \fcc(\fu_2)).
Since \fp' \notin \mathfrak{S} this is bounded by
\le 2^{9a + 100a^3 (s_1+3)} 2^{Zn/2}.
Thus
Z n/2 + Z - 1 \le 9a + 100a^3(s_1 + 3),
contradicting the definition of s_1.
For each J \in \mathcal{J}' and all s, we have
\frac{1}{\mu(J)} \int_J \Bigg(\sum_{\substack{I \in \mathcal{D}, s(I) = s(J) - s\\ I \cap \scI(\fu_1) = \emptyset\\ J \cap B(I) \ne \emptyset}} \mathbf{1}_{B(I)}\bigg)^2 \, \mathrm{d}\mu \le 2^{14a+1} (8 D^{-s})^\kappa.
Lean code for Lemma1.7.6.4●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/RemainingTiles.leancomplete
theorem TileStructure.Forest.square_function_count.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ : 𝔓 X} {J : Grid X} (hJ : J ∈ t.𝓙₆ u₁) {s' : ℤ} : ⨍⁻ (x : X) in ↑J, (∑ I with s I = s J - s' ∧ Disjoint ↑I ↑(𝓘 u₁) ∧ ¬Disjoint (↑J) (Metric.ball (c I) (8 * ↑(defaultD a) ^ s I)), (Metric.ball (c I) (8 * ↑(defaultD a) ^ s I)).indicator 1 x) ^ 2 ∂MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_6_4 a s')
theorem TileStructure.Forest.square_function_count.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} {u₁ : 𝔓 X} {J : Grid X} (hJ : J ∈ t.𝓙₆ u₁) {s' : ℤ} : ⨍⁻ (x : X) in ↑J, (∑ I with s I = s J - s' ∧ Disjoint ↑I ↑(𝓘 u₁) ∧ ¬Disjoint (↑J) (Metric.ball (c I) (8 * ↑(defaultD a) ^ s I)), (Metric.ball (c I) (8 * ↑(defaultD a) ^ s I)).indicator 1 x) ^ 2 ∂MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_6_4 a s')
Lemma 7.6.4.
Proof. Since J \in \mathcal{J}' we have J \subset \scI(\fu_1). Thus, if
B(I) \cap J \ne \emptyset then
B(I) \cap J \subset \{x \in J \ : \ \rho(x, X \setminus J) \le 8D^{s(I)}\}.
Furthermore, for each s the balls B(I) with s(I) = s have bounded
overlap: Consider the collection \mathcal{D}_{s,x} of all
I \in \mathcal{D} with x \in B(I) and s(I) = s. By
eq-vol-sp-cube and dyadicproperty, the balls
B(c(I), \frac{1}{4} D^{s(I)}), I \in \mathcal{D}_{s,x} are disjoint, and
by the triangle inequality, they are contained in B(x, 9 D^{s}). By the
doubling property doublingx, we have
\mu(B(x, 9D^{s})) \le 2^{7a} \mu(B(c(I), \frac{1}{4} D^{s(I)}))
for each I \in \mathcal{D}_{s,x}.
Thus
\mu(B(x, 9D^{s})) \ge \sum_{I \in \mathcal{D}_{s,x}} \mu(B(c(I), \frac{1}{4} D^{s(I)})) \ge 2^{-7a} |\mathcal{D}_{s,x}| \mu(B(x, 9D^{s})).
Dividing by the positive \mu(B(x, 9D^{s})), we obtain that for each x
\Bigg(\sum_{\substack{I \in \mathcal{D}, s(I) = s(J) - s\\ I \cap \scI(\fu_1) = \emptyset\\ J \cap B(I) \ne \emptyset}} \mathbf{1}_{B(I)}(x) \bigg)^2 \le |\mathcal{D}_{s(J) - s,x}|^2 \le 2^{14a}.
Combining this with the previous inclusion and the small boundary property
eq-small-boundary, noting that 8D^{s(I)}=8D^{-s}D^{s(J)}, the lemma
follows.
Proof of Lemma 1.7.6.2. Expanding the definition of
P_{\mathcal{J}'}, we have
\|P_{\mathcal{J}'}|T_{\fT(\fu_2) \setminus \mathfrak{S}}^* g_2|\|_2
= \left(\sum_{J \in \mathcal{J}'} \frac{1}{\mu(J)} \left(\int_J \left| \sum_{\fp \in \fT(\fu_2) \setminus \mathfrak{S}} T_{\fp}^* g_2(y) \right| \, \mathrm{d}\mu(y) \right)^2 \right)^{1/2}.
By Lemma 1.7.4.1, the innermost sum in the last display is 0 if
J \cap B(\scI(\fp)) = \emptyset. Then we split that sum according to the
scale of \fp relative to the scale of J. By Lemma 1.7.6.3,
s_1 \le s(J) - \ps(\fp) \le 2S with
s_1 := \lfloor\frac{Zn}{202a^3} - 2\rfloor
= \left(\sum_{J \in \mathcal{J}'} \frac{1}{\mu(J)} \left(\int_J \left| \sum_{s=s_1}^{2S} \sum_{\substack{\fp \in \fT(\fu_2) \setminus \mathfrak{S}\\ \ps(\fp) = s(J) - s\\ J \cap B(\scI(\fp)) \ne \emptyset}} T_{\fp}^* g_2(y) \right| \, \mathrm{d}\mu(y) \right)^2 \right)^{1/2}.
Then we apply the triangle inequality and Minkowski's inequality to get
\le \sum_{s=s_1}^{2S} \left( \sum_{J \in \mathcal{J}'} \frac{1}{\mu(J)} \left(\int_J \sum_{\substack{\fp \in \fT(\fu_2) \setminus \mathfrak{S}\\ \ps(\fp) = s(J) - s\\ J \cap B(\scI(\fp)) \ne \emptyset}} |T_{\fp}^* g_2(y)| \, \mathrm{d}\mu(y) \right)^2\right)^{1/2}.
We have by Lemma 1.7.4.1 and eq-Ks-size
|T_{\fp}^* g_2(y)| \le 2^{102a^3} \mathbf{1}_{B(\pc(\fp), 8D^{\ps(\fp)})}(y) \int_{E(\fp)} \frac{1}{\mu(B(x, D^{\ps(\fp)}))} |g_2(x)| \, \mathrm{d}\mu(x).
Using the doubling property doublingx, it follows that
\mu(B(\pc(\fp), 8D^{\ps(\fp)})) \le 2^{4a} \mu(B(x, D^{\ps(\fp)})).
Thus, using also a \ge 4
|T_{\fp}^* g_2(y)| \le 2^{102a^3+4a} \mathbf{1}_{B(\pc(\fp), 8D^{\ps(\fp)})}(y) \frac{1}{\mu(B(\pc(\fp), 8D^{\ps(\fp)}))} \int_{E(\fp)} |g_2(x)| \, \mathrm{d}\mu(x).
Since for each I \in \mathcal{D} the sets E(\fp), \fp \in \fP(I) are
disjoint, it follows that
\int_J \sum_{\substack{\fp \in \fT(\fu_2) \setminus \mathfrak{S}\\ \scI(\fp) = I\\ J \cap B(\scI(\fp)) \ne \emptyset}} |T_{\fp}^* g_2(y)| \, \mathrm{d}\mu
\le 2^{102a^3+4a} \int_J \mathbf{1}_{B(I)} \frac{1}{\mu(B(\pc(\fp), 8D^{\ps(\fp)}))} \int_{B(\pc(\fp), 8D^{\ps(\fp)})} |g_2(x)| \, \mathrm{d}\mu(x)
\le 2^{102a^3+4a} \int_J M_{\mathcal{B},1} |g_2|(y) \mathbf{1}_{B(I)}(y) \, \mathrm{d}\mu(y).
By Lemma 1.7.4.7, we have
\scI(\fp) \cap \scI(\fu_1) = \emptyset for all
\fp \in \fT(\fu_2) \setminus \mathfrak{S}. Thus we can estimate
eq-sep-tree-small-1 by
2^{102a^3+4a} \sum_{s=s_1}^{2S} \left( \sum_{J \in \mathcal{J}'} \frac{1}{\mu(J)} \left(\int_J \sum_{\substack{I \in \mathcal{D}, s(I) = s(J) - s\\ I \cap \scI(\fu_1) = \emptyset\\ J \cap B(I) \ne \emptyset}} M_{\mathcal{B},1} |g_2| \mathbf{1}_{B(I)} \, \mathrm{d}\mu \right)^2\right)^{1/2}\,,
which is by Cauchy-Schwarz at most
2^{102a^3+4a} \sum_{s=s_1}^{2S} \left( \sum_{J \in \mathcal{J}'} \int_J ( M_{\mathcal{B},1} |g_2|)^2 \, \mathrm{d}\mu \times \frac{1}{\mu(J)} \int_J \left(\sum_{\substack{I \in \mathcal{D}, s(I) = s(J) - s\\ I \cap \scI(\fu_1) = \emptyset\\ J \cap B(I) \ne \emptyset}} \mathbf{1}_{B(I)}\right)^2 \, \mathrm{d}\mu \right)^{1/2}.
Using Lemma 1.7.6.4, we bound this by
2^{102a^3+4a} \sum_{s=s_1}^{2S} \left(2^{14a+1} (8 D^{-s})^\kappa \sum_{J \in \mathcal{J}'} \int_J (M_{\mathcal{B},1} |g_2|)^2\right)^{1/2},
and since dyadic cubes in \mathcal{J}' form a partition of \scI(\fu_1)
by Lemma 1.7.6.1, \kappa \le 1 by definekappa, and a \ge 4
\le 2^{102a^3+11a+2} \sum_{s=s_1}^{2S} D^{-s\kappa/2} \|\mathbf{1}_{\scI(\fu_1)} M_{\mathcal{B},1} |g_2|\|_2
\le 2^{102a^3+11a+2} D^{-s_1 \kappa /2} \frac{1}{1 - D^{-\kappa/2}} \|\mathbf{1}_{\scI(\fu_1)} M_{\mathcal{B},1} |g_2|\|_2.
By convexity of t \mapsto D^{-t} and since D \ge 2, we have for all
0 \le t \le 1
D^{-t} \le 1 - t(1 - 1/D) \le 1 - \frac{1}{2}t.
Using this for t = \kappa/2 and using that
s_1 = \frac{Zn}{202a^3} - 2 and the definitions defineD and
definekappa of \kappa and D
\le 2^{102a^3+11a+2} 2^{-100a^2(\frac{Zn}{202a^3} - 3) \frac{\kappa}{2}} \frac{2}{\kappa} \|\mathbf{1}_{\scI(\fu_1)} M_{\mathcal{B},1} |g_2|\|_2
= 2^{102a^3+21a+4} 2^{150a^2\kappa} 2^{-\frac{100}{404a}Zn\kappa} \|\mathbf{1}_{\scI(\fu_1)} M_{\mathcal{B},1} |g_2|\|_2.
Using the definition definekappa of \kappa and a \ge 4, the lemma
follows.
1.7.7. Forests
In this subsection, we complete the proof of Theorem 1.2.4 from the results of the previous subsections.
Define an n-row to be an n-forest (\fU, \fT), i.e. satisfying
conditions forest1 - forest6, such that in addition the sets
\scI(\fu), \fu \in \fU are pairwise disjoint.
-
TileStructure.Forest.rowDecomp[complete] -
TileStructure.Forest.biUnion_rowDecomp[complete] -
TileStructure.Forest.pairwiseDisjoint_rowDecomp[complete]
Let (\fU, \fT) be an n-forest. Then there exists a decomposition
\fU = \dot{\bigcup_{1 \le j \le 2^n}} \fU_j
such that for all j = 1, \dotsc, 2^n the pair
(\fU_j, \fT|_{\fU_j}) is an n-row.
Lean code for Lemma1.7.7.1●3 declarations
Associated Lean declarations
-
TileStructure.Forest.rowDecomp[complete]
-
TileStructure.Forest.biUnion_rowDecomp[complete]
-
TileStructure.Forest.pairwiseDisjoint_rowDecomp[complete]
-
TileStructure.Forest.rowDecomp[complete] -
TileStructure.Forest.biUnion_rowDecomp[complete] -
TileStructure.Forest.pairwiseDisjoint_rowDecomp[complete]
-
defdefined in Carleson/ForestOperator/Forests.leancomplete
def TileStructure.Forest.rowDecomp.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} (t : TileStructure.Forest X n) (j : ℕ) : TileStructure.Row X n
def TileStructure.Forest.rowDecomp.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} (t : TileStructure.Forest X n) (j : ℕ) : TileStructure.Row X n
The row-decomposition of a tree, defined in the proof of Lemma 7.7.1. The indexing is off-by-one compared to the blueprint.
-
theoremdefined in Carleson/ForestOperator/Forests.leancomplete
theorem TileStructure.Forest.biUnion_rowDecomp.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} : ⋃ j, ⋃ (_ : j < 2 ^ n), (t.rowDecomp j).𝔘 = t.𝔘
theorem TileStructure.Forest.biUnion_rowDecomp.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} : ⋃ j, ⋃ (_ : j < 2 ^ n), (t.rowDecomp j).𝔘 = t.𝔘
Part of Lemma 7.7.1
-
theoremdefined in Carleson/ForestOperator/Forests.leancomplete
theorem TileStructure.Forest.pairwiseDisjoint_rowDecomp.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} : (Set.Iio (2 ^ n)).PairwiseDisjoint fun x ↦ (t.rowDecomp x).𝔘
theorem TileStructure.Forest.pairwiseDisjoint_rowDecomp.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} : (Set.Iio (2 ^ n)).PairwiseDisjoint fun x ↦ (t.rowDecomp x).𝔘
Part of Lemma 7.7.1
Proof. Define recursively \fU_j to be a maximal disjoint set of tiles
\fu in
\fU \setminus \bigcup_{j' < j} \fU_{j'}
with inclusion maximal \scI(\fu). Properties forest1, -forest6 for
(\fU_j, \fT|_{\fU_k}) follow immediately from the corresponding properties
for (\fU, \fT), and the cubes \scI(\fu), \fu \in \fU_j are disjoint
by definition. The collections \fU_j are also disjoint by definition.
Now we show by induction on j that each point is contained in at most
2^n - j cubes \scI(\fu) with
\fu \in \fU \setminus \bigcup_{j' \le j} \fU_{j'}. This implies that
\bigcup_{j = 1}^{2^n} \fU_j = \fU, which completes the proof of the Lemma.
For j = 0 each point is contained in at most 2^n cubes by forest3. For
larger j, if x is contained in any cube \scI(\fu) with
\fu \in \fU \setminus \bigcup_{j' < j} \fU_{j'}, then it is contained in a
maximal such cube. Thus it is contained in a cube in \scI(\fu) with
\fu \in \fU_j. Thus the number
\fu \in \fU \setminus \bigcup_{j' \le j} \fU_{j'} with
x\in \scI(\fu) is zero, or is less than the number of
\fu \in \fU \setminus \bigcup_{j' \le j-1} \fU_{j'} with
x \in \scI(\fu) by at least one.
We pick a decomposition of the forest (\fU, \fT) into 2^n n-rows
(\fU_j, \fT_j) := (\fU_j, \fT|_{\fU_j})
as in Lemma 1.7.7.1. To save some space in the proofs of the
remaining lemmas in this section we will write
T_{\fC} = \sum_{\fp \in \fC} T_{\fp},\qquad T_{\fC}^* = \sum_{\fp \in \fC} T_{\fp}^*,
T_{\mathfrak{R}_j} = \sum_{\fu \in \fU_j} T_{\fT(\fu)},\qquad T_{\mathfrak{R}_j}^* = \sum_{\fu \in \fU_j} T_{\fT(\fu)}^*.
-
TileStructure.Forest.row_bound[complete] -
TileStructure.Forest.indicator_row_bound[complete]
For each 1 \le j \le 2^n and each bounded g supported on G we have
\left\| T_{\mathfrak{R}_j}^*g \right\|_2 \le 2^{182a^3} 2^{-n/2} \|g\|_2
and
\left\| \mathbf{1}_F T_{\mathfrak{R}_j}^*g \right\|_2 \le 2^{283a^3} 2^{-n/2} \dens_2(\bigcup_{\fu\in \fU}\fT(\fu))^{1/2} \|g\|_2.
Lean code for Lemma1.7.7.2●2 theorems
Associated Lean declarations
-
TileStructure.Forest.row_bound[complete]
-
TileStructure.Forest.indicator_row_bound[complete]
-
TileStructure.Forest.row_bound[complete] -
TileStructure.Forest.indicator_row_bound[complete]
-
theoremdefined in Carleson/ForestOperator/Forests.leancomplete
theorem TileStructure.Forest.row_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n j : ℕ} {t : TileStructure.Forest X n} {g : X → ℂ} (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) : MeasureTheory.eLpNorm (t.adjointCarlesonRowSum j g) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_7_2_1 a n) * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
theorem TileStructure.Forest.row_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n j : ℕ} {t : TileStructure.Forest X n} {g : X → ℂ} (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) : MeasureTheory.eLpNorm (t.adjointCarlesonRowSum j g) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_7_2_1 a n) * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
-
theoremdefined in Carleson/ForestOperator/Forests.leancomplete
theorem TileStructure.Forest.indicator_row_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n j : ℕ} {t : TileStructure.Forest X n} {g : X → ℂ} (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) : MeasureTheory.eLpNorm (F.indicator (t.adjointCarlesonRowSum j g)) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_7_2_2 a n) * dens₂ (⋃ u ∈ t, (fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
theorem TileStructure.Forest.indicator_row_bound.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n j : ℕ} {t : TileStructure.Forest X n} {g : X → ℂ} (hg : MeasureTheory.BoundedCompactSupport g MeasureTheory.volume) (h2g : Function.support g ⊆ G) : MeasureTheory.eLpNorm (F.indicator (t.adjointCarlesonRowSum j g)) 2 MeasureTheory.volume ≤ ↑(TileStructure.Forest.C7_7_2_2 a n) * dens₂ (⋃ u ∈ t, (fun x ↦ t.𝔗 x) u) ^ 2⁻¹ * MeasureTheory.eLpNorm g 2 MeasureTheory.volume
Proof. Since for each j the top cubes \scI(\fu), \fu \in \fU_j are
disjoint, we have for all bounded g supported on G by
Lemma 1.7.4.1
\left\|\mathbf{1}_F \sum_{\fu \in \fU_j} \sum_{\fp \in \fT(\fu)} T_{\fp}^* g\right\|_2^2 = \left\|\mathbf{1}_F \sum_{\fu \in \fU_j} \sum_{\fp \in \fT(\fu)} \mathbf{1}_{\scI(\fu)} T_{\fp}^* \mathbf{1}_{\scI(\fu)} g\right\|_2^2
= \sum_{\fu \in \fU_j} \int_{\scI(\fu)} \left| \mathbf{1}_F \sum_{\fp \in \fT(\fu)} T_{\fp}^* \mathbf{1}_{\scI(\fu)} g\right|^2 \, \mathrm{d}\mu \le \sum_{\fu \in \fU_j} \left\|\mathbf{1}_F \sum_{\fp \in \fT(\fu)} T_{\fp}^* \mathbf{1}_G \mathbf{1}_{\scI(\fu)} g\right\|_2^2.
Applying Lemma 1.7.4.2 and the density assumption forest4, then
taking square roots, we obtain
\left\| \mathbf{1}_F T_{\mathfrak{R}_j}^*g \right\|_2 \le 2^{282a^3} 2^{(4a+1-n)/2} \dens_2(\bigcup_{\fu\in \fU}\fT(\fu))^{1/2} \left( \sum_{\fu \in \fU_j} \left\| \mathbf{1}_{\scI(\fu)} g\right\|_2^2 \right)^{1/2}.
Again by disjointedness of the cubes \scI(\fu), this is estimated by
2^{282a^3} 2^{(4a+1-n)/2} \dens_2(\bigcup_{\fu\in \fU}\fT(\fu))^{1/2} \|g\|_2.
Thus eq-row-bound-2 follows, since a \ge 4. The proof of
eq-row-bound-1 is the same up to replacing F by X.
-
TileStructure.Forest.row_correlation[complete]
For all 1 \le j,j' \le 2^n with j\ne j' and for all bounded
g_1, g_2 supported on G, it holds that
\left| \int T_{\mathfrak{R}_j}^*g_1 \overline{T_{\mathfrak{R}_{j'}}^*g_2} \, \mathrm{d}\mu \right| \le 2^{876a^3-4n}\|g_1\|_2 \|g_2\|_2.
Lean code for Lemma1.7.7.3●1 theorem
Associated Lean declarations
-
TileStructure.Forest.row_correlation[complete]
-
TileStructure.Forest.row_correlation[complete]
-
theoremdefined in Carleson/ForestOperator/Forests.leancomplete
theorem TileStructure.Forest.row_correlation.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n j j' : ℕ} {t : TileStructure.Forest X n} {f₁ f₂ : X → ℂ} (lj : j < 2 ^ n) (lj' : j' < 2 ^ n) (hn : j ≠ j') (hf₁ : MeasureTheory.BoundedCompactSupport f₁ MeasureTheory.volume) (nf₁ : Function.support f₁ ⊆ G) (hf₂ : MeasureTheory.BoundedCompactSupport f₂ MeasureTheory.volume) (nf₂ : Function.support f₂ ⊆ G) : ‖∫ (x : X), t.adjointCarlesonRowSum j f₁ x * (starRingEnd ℂ) (t.adjointCarlesonRowSum j' f₂ x)‖ₑ ≤ ↑(TileStructure.Forest.C7_7_3 a n) * MeasureTheory.eLpNorm f₁ 2 MeasureTheory.volume * MeasureTheory.eLpNorm f₂ 2 MeasureTheory.volume
theorem TileStructure.Forest.row_correlation.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n j j' : ℕ} {t : TileStructure.Forest X n} {f₁ f₂ : X → ℂ} (lj : j < 2 ^ n) (lj' : j' < 2 ^ n) (hn : j ≠ j') (hf₁ : MeasureTheory.BoundedCompactSupport f₁ MeasureTheory.volume) (nf₁ : Function.support f₁ ⊆ G) (hf₂ : MeasureTheory.BoundedCompactSupport f₂ MeasureTheory.volume) (nf₂ : Function.support f₂ ⊆ G) : ‖∫ (x : X), t.adjointCarlesonRowSum j f₁ x * (starRingEnd ℂ) (t.adjointCarlesonRowSum j' f₂ x)‖ₑ ≤ ↑(TileStructure.Forest.C7_7_3 a n) * MeasureTheory.eLpNorm f₁ 2 MeasureTheory.volume * MeasureTheory.eLpNorm f₂ 2 MeasureTheory.volume
Lemma 7.7.3.
Proof. We have by Lemma 1.7.4.1 and the triangle inequality that
\left| \int T_{\mathfrak{R}_j}^*g_1 \overline{T_{\mathfrak{R}_{j'}}^*g_2} \, \mathrm{d}\mu \right|
\le \sum_{\fu \in \fU_j} \sum_{\fu' \in \fU_{j'}} \left| \int T^*_{\fT_j(\fu)} (\mathbf{1}_{\scI(\fu)} g_1) \overline{T^*_{\fT_{j'}(\fu')} (\mathbf{1}_{\scI(\fu')} g_2)} \, \mathrm{d}\mu \right|.
By Lemma 1.7.4.4, this is bounded by
2^{512a^3-4n} \sum_{\fu \in \fU_j} \sum_{\fu' \in \fU_{j'}} \|S_{2,\fu} (\mathbf{1}_{\scI(\fu)}g_1)\|_{L^2(\scI(\fu')\cap \scI(\fu)} \|S_{2, \fu'} (\mathbf{1}_{\scI(\fu')}g_2)\|_{L^2(\scI(\fu')\cap\scI(\fu))}.
We apply the Cauchy-Schwarz inequality in the form
\sum_{i \in M} a_i b_i \le (\sum_{i \in M} a_i^2 )^{1/2}(\sum_{i \in M} b_i^2 )^{1/2}
to the outer two sums:
\le 2^{512a^3-4n} \left(\sum_{\fu \in \fU_j} \sum_{\fu' \in \fU_{j'}} \|S_{2,\fu} (\mathbf{1}_{\scI(\fu)}g_1)\|_{L^2(\scI(\fu')\cap \scI(\fu))}^2 \right)^{1/2}
\left(\sum_{\fu \in \fU_j} \sum_{\fu' \in \fU_{j'}} \|S_{2,\fu'} (\mathbf{1}_{\scI(\fu')}g_2)\|_{L^2(\scI(\fu')\cap\scI(\fu))}^2 \right)^{1/2}.
We can now estimate the factor involving g_1 as follows:
\sum_{\fu \in \fU_j}\sum_{\fu' \in \fU_{j'}} \|S_{2,\fu} (\mathbf{1}_{\scI(\fu)}g_1)\|_{L^2(\scI(\fu')\cap \scI(\fu))}^2
= \sum_{\fu \in \fU_j}\sum_{\fu' \in \fU_{j'}} \int_{\scI(\fu) \cap \scI(\fu')} |S_{2,\fu} (\mathbf{1}_{\scI(\fu)}(y)g_1(y))|^2 \, \mathrm{d}\mu(y).
By pairwise disjointedness of the sets \scI(\fu') for \fu' \in \fU_{j'},
we have
\le \sum_{\fu \in \fU_j}\int_{\scI(\fu)} |S_{2,\fu} (\mathbf{1}_{\scI(\fu)}(y)g_1(y))|^2 \, \mathrm{d}\mu(y) \le \sum_{\fu \in \fU_j}\int_{X} |S_{2,\fu} (\mathbf{1}_{\scI(\fu)}(y)g_1(y))|^2 \, \mathrm{d}\mu(y)
= \sum_{\fu \in \fU_j}\|S_{2,\fu} (\mathbf{1}_{\scI(\fu)}g_1)\|_2^2.
By Lemma 1.7.4.3 we now estimate:
\le \sum_{\fu \in \fU_j}(2^{182a^3})^2 \|\mathbf{1}_{\scI(\fu)}g_1\|_2^2.
By pairwise disjointedness of the sets \scI(\fu) for \fu \in \fU_j
(and writing out the definition of L^2-norms), we have
\le (2^{182a^3})^2 \|g_1\|_2^2.
Arguing similarly for g_2, we obtain the desired inequality.
Define for 1 \le j \le 2^n
E_j := \bigcup_{\fu \in \fU_j} \bigcup_{\fp \in \fT(\fu)} E(\fp).
The sets E_j, 1 \le j \le 2^n are pairwise disjoint.
Lean code for Lemma1.7.7.4●1 theorem
Associated Lean declarations
-
theoremdefined in Carleson/ForestOperator/Forests.leancomplete
theorem TileStructure.Forest.pairwiseDisjoint_rowSupport.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} : (Set.Iio (2 ^ n)).PairwiseDisjoint t.rowSupport
theorem TileStructure.Forest.pairwiseDisjoint_rowSupport.{u_1} {X : Type u_1} {a : ℕ} {q : ℝ} {K : X → X → ℂ} {σ₁ σ₂ : X → ℤ} {F G : Set X} [MetricSpace X] [ProofData a q K σ₁ σ₂ F G] [TileStructure Q (defaultD a) (defaultκ a) (defaultS X) (cancelPt X)] {n : ℕ} {t : TileStructure.Forest X n} : (Set.Iio (2 ^ n)).PairwiseDisjoint t.rowSupport
Lemma 7.7.4
Proof. Suppose that \fp \in \fT(\fu) and \fp' \in \fT(\fu') with
\fu \ne \fu' and x \in E(\fp) \cap E(\fp'). Suppose without loss of
generality that \ps(\fp) \le \ps(\fp'). Then
x \in \scI(\fp) \cap \scI(\fp') \subset \scI(\fu'). By dyadicproperty it
follows that \scI(\fp) \subset \scI(\fu'). By forest5, it follows that
d_{\fp}(\fcc(\fp), \fcc(\fu')) > 2^{Z(n+1)}.
By the triangle inequality. Lemma 1.2.1.2 and forest1 it follows
that
d_{\fp}(\fcc(\fp), \fcc(\fp')) \ge d_{\fp}(\fcc(\fp), \fcc(\fu')) - d_{\fp}(\fcc(\fp'), \fcc(\fu'))
> 2^{Z(n+1)} - d_{\fp'}(\fcc(\fp'), \fcc(\fu'))
\ge 2^{Z(n+1)} - 4.
Since Z \ge 3 by defineZ, it follows that
\fcc(\fp') \notin B_{\fp}(\fcc(\fp), 1), so \Omega(\fp') \not\subset \Omega(\fp)
by eq-freq-comp-ball. Hence, by eq-freq-dyadic,
\Omega(\fp) \cap \Omega(\fp') = \emptyset. But if
x \in E(\fp) \cap E(\fp') then Q(x) \in \Omega(\fp) \cap \Omega(\fp').
This is a contradiction, and the lemma follows.
Now we prove Theorem 1.2.4.
Proof of Theorem 1.2.4. By definetp*, we have for each j
T_{\mathfrak{R}_j}^*g = \sum_{\fu \in \fU_j} \sum_{\fp \in \fT(\fu)} T_{\fp}^* g = \sum_{\fu \in \fU_j} \sum_{\fp \in \fT(\fu)} T_{\fp}^* \mathbf{1}_{E_j} g = T_{\mathfrak{R}_j}^* \mathbf{1}_{E_j} g.
Hence, by Lemma 1.7.7.1 and the triangle inequality,
\left\|\sum_{\fu \in \fU} \sum_{\fp \in \fT(\fu)} T^*_{\fp} g\right\|_2^2 = \left\|\sum_{j = 1}^{2^n} T^*_{\mathfrak{R}_{j}} g\right\|_2^2 = \left\|\sum_{j=1}^{2^n} T^*_{\mathfrak{R}_{j}} \mathbf{1}_{E_j} g\right\|_2^2
= \int_X \left|\sum_{j=1}^{2^n} T^*_{\mathfrak{R}_{j}} \mathbf{1}_{E_j} g\right|^2 \, \mathrm{d}\mu
\le \sum_{j=1}^{2^n} \|T_{\mathfrak{R}_j}^* \mathbf{1}_{E_j} g\|_2^2 + \sum_{j =1}^{2^n} \sum_{\substack{j' = 1\\j' \ne j}}^{2^n} \left| \int_X \overline{ T_{\mathfrak{R}_j}^* \mathbf{1}_{E_j} g} T_{\mathfrak{R}_{j'}}^* \mathbf{1}_{E_{j'}} g \right| \, \mathrm{d}\mu\, .
We use Lemma 1.7.7.2 to estimate each term in the first sum, and
Lemma 1.7.7.3 to bound each term in the second sum:
\le 2^{566a^3-n} \sum_{j = 1}^{2^n} \|\mathbf{1}_{E_j} g\|_2^2 + 2^{876a^3-4n}\sum_{j=1}^{2^n}\sum_{j' = 1}^{2^n} \|\mathbf{1}_{E_j} g\|_2 \|\mathbf{1}_{E_{j'}}g\|_2.
By Cauchy-Schwarz in the second two sums, this is at most
2^{876a^3} (2^{-n} + 2^{n}2^{-4n}) \sum_{j = 1}^n \|\mathbf{1}_{E_j} g\|_2^2,
and by disjointedness of the sets E_j, this is at most
2^{877a^3 - n} \|g\|_2^2.
Taking square roots, it follows that for all g
\left\|\sum_{\fu \in \fU} \sum_{\fp \in \fT(\fu)} T_{\fp}^* g\right\|_2 \le 2^{439a^3-\frac{n}{2}} \|g\|_2.
On the other hand, we have by disjointedness of the sets E_j from
Lemma 1.7.7.4 and the triangle inequality
\left\|\mathbf{1}_G \sum_{\fu \in \fU} \sum_{\fp \in \fT(\fu)} T_{\fp} f\right\|_2^2 = \left\|\sum_{j=1}^{2^n} \mathbf{1}_{E_j} \mathbf{1}_G T_{\mathfrak{R}_{j}} f\right\|_2^2 \le \sum_{j = 1}^{2^n} \|\mathbf{1}_{E_j} \mathbf{1}_G T_{\mathfrak{R}_{j}} f\|_2^2 \le \sum_{j = 1}^{2^n} \|\mathbf{1}_G T_{\mathfrak{R}_{j}} f\|_2^2.
Now with |f| \le \mathbf{1}_F and Lemma 1.7.7.2 we obtain
\| \mathbf{1}_G T_{\mathfrak{R}_j} f \|_2^2 = \left| \int_X \overline{\mathbf{1}_G T_{\mathfrak{R}_j} f} T_{\mathfrak{R}_j} f \right| = \left| \int_X \overline{T_{\mathfrak{R}_j}^* \mathbf{1}_G T_{\mathfrak{R}_j} f} \mathbf{1}_F f \right| \le \|f\|_2 \| \mathbf{1}_F T_{\mathfrak{R}_j}^* \mathbf{1}_G T_{\mathfrak{R}_j} f \|_2 \le 2^{283a^3-n/2} \dens_2(\bigcup_{\fu\in \fU}\fT(\fu))^{1/2} \| \mathbf{1}_G T_{\mathfrak{R}_j} f \|_2 \|f\|_2.
Dividing this last inequality by the finite
\| \mathbf{1}_G T_{\mathfrak{R}_j} f \|_2, substituting back and taking
square roots we get
\left\|\mathbf{1}_G \sum_{\fu \in \fU} \sum_{\fp \in \fT(\fu)} T_{\fp} f\right\|_2 \le 2^{283a^3} \dens_2(\bigcup_{\fu\in \fU}\fT(\fu))^{\frac{1}{2}} 2^{-\frac{n}{2}} (\sum_{j = 1}^{2^n} \|f\|_2^2)^{\frac{1}{2}} = 2^{283a^3} \dens_2(\bigcup_{\fu\in \fU}\fT(\fu))^{\frac{1}{2}} \|f\|_2.
Theorem 1.2.4 follows by taking the product of the
(2 - \frac{2}{q})-th power of eq-forest-bound-1 and the
(\frac{2}{q} - 1)-st power of eq-forest-bound-2.