Carleson Blueprint

1.6. Proof of the Antichain Operator Proposition🔗

Let an antichain \mathfrak{A} and functions f, g as in Theorem 1.2.3 be given. We prove eq-antiprop in The density arguments as the geometric mean of two inequalities, each involving one of the two densities. One of these two inequalities will need a careful estimate formulated in Lemma 1.6.1.5 of the TT^* correlation between two tile operators. Lemma 1.6.1.5 will be proven in Proof of the Tile Correlation Lemma.

The summation of the contributions of these individual correlations will require a geometric Lemma 1.6.1.6 counting the relevant tile pairs. Lemma 1.6.1.6 will be proven in Proof of the Antichain Tile Count Lemma.

1.6.1. The density arguments🔗

We begin with the following crucial disjointedness property of the sets E(\fp) with \fp \in \mathfrak{A}.

Lemma1.6.1.1
uses 0
Used by 2
Reverse dependency previews
Preview
Lemma 1.6.1.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
markupTeXL∃∀N

Let \fp,\fp'\in \mathfrak{A}. If there exists an x\in X with x\in E(\fp)\cap E(\fp'), then \fp= \fp'.

Lean code for Lemma1.6.1.11 theorem
  • complete
    theorem tile_disjointness.{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)} (h𝔄 : IsAntichain (fun x1 x2  x1  x2) 𝔄)
      {p p' : 𝔓 X} (hp : p  𝔄) (hp' : p'  𝔄)
      (hE : ¬Disjoint (E p) (E p')) : p = p'
    theorem tile_disjointness.{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)}
      (h𝔄 :
        IsAntichain (fun x1 x2  x1  x2) 𝔄)
      {p p' : 𝔓 X} (hp : p  𝔄) (hp' : p'  𝔄)
      (hE : ¬Disjoint (E p) (E p')) : p = p'
    Lemma 6.1.1. 
Proof for Lemma 1.6.1.1
uses 0

Proof. Let \fp,\fp' and x be given. Assume without loss of generality that \ps(\fp)\le \ps(\fp'). As we have x\in E(\fp)\subset \scI(\fp) and x\in E(\fp')\subset \scI(\fp') by definition defineep, we conclude for i=1,2 that \tQ(x)\in\fc(\fp) and \tQ(x)\in\fc(\fp'). By eq-freq-dyadic we have \fc(\fp')\subset \fc(\fp). By definition straightorder, we conclude \fp\le \fp'. As \mathfrak{A} is an antichain, we conclude \fp=\fp'. This proves the lemma.

Let \mathcal{B} be the collection of balls B(\pc(\fp), 8D^{\ps(\fp)}) with \fp\in \mathfrak{A} and recall the definition of M_{\mathcal{B}} from Definition def-hlm.

Lemma1.6.1.2
uses 1used by 1markupTeXL∃∀N

Let x\in X. Then | \sum_{\fp \in \mathfrak{A}}T_{\fp} f(x)|\le 2^{102 a^3} M_{\mathcal{B}} f (x).

Lean code for Lemma1.6.1.21 theorem
  • complete
    theorem maximal_bound_antichain.{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)} (h𝔄 : IsAntichain (fun x1 x2  x1  x2) 𝔄) {f : X  }
      (hfm : Measurable f) (x : X) :
      carlesonSum 𝔄 f x‖ₑ 
        (C6_1_2 a) *
          maximalFunction MeasureTheory.volume 𝔄 𝔠
            (fun 𝔭  8 * (defaultD a) ^ 𝔰 𝔭) 1 f x
    theorem maximal_bound_antichain.{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)}
      (h𝔄 :
        IsAntichain (fun x1 x2  x1  x2) 𝔄)
      {f : X  } (hfm : Measurable f)
      (x : X) :
      carlesonSum 𝔄 f x‖ₑ 
        (C6_1_2 a) *
          maximalFunction MeasureTheory.volume
            𝔄 𝔠
            (fun 𝔭  8 * (defaultD a) ^ 𝔰 𝔭)
            1 f x
    Lemma 6.1.2. 
Proof for Lemma 1.6.1.2
uses 0

Proof. Fix x\in X. By Lemma 1.6.1.1, there is at most one \fp \in \mathfrak{A} such that T_{\fp} f(x) is not zero. If there is no such \fp, the estimate hlmbound follows.

Assume there is such a \fp. By definition of T_{\fp} we have x\in E(\fp)\subset \scI(\fp) and by the squeezing property eq-vol-sp-cube \rho(x, \pc(\fp))\le 4D^{\ps(\fp)}.

Let y\in X with K_{\ps(\fp)}(x,y)\neq 0. By definition defks of K_{\ps(\fp)} we have \frac{1}{4} D^{\ps(\fp)-1} \leq \rho(x,y) \leq \frac{1}{2} D^{\ps(\fp)}. The triangle inequality with eqtttt0 and supp-Ks1 implies \rho(\pc(\fp),y) < 8D^{\ps(\fp)}.

Using the kernel bound eqkernel-size and the lower bound in supp-Ks we obtain |K_{\ps(\fp)}(x,y)|\le \frac{2^{a^3}}{\mu(B(x,\frac 14 D^{{\ps(\fp)}-1}))}. Using D=2^{100a^2} and the doubling property doublingx 5 +100a^2 times estimates the last display by \frac{2^{5a+101a^3}}{\mu(B(x, 8D^{\ps(\fp)}))}, which, thanks to the closeness of the points x and \pc(\fp) shown in eqtttt0, is in turn bounded by \frac{2^{6a+101a^3}}{\mu(B(\pc(\fp), 8D^{\ps(\fp)}))}.

Using that |e(\mfa)| is bounded by 1 for every \mfa\in \Mf, we estimate with the triangle inequality and the above information | T_{\fp} f(x)| \le \frac{2^{6a+101 a^3}}{\mu(B(\pc(\fp), 8D^{\ps(\fp)}))} \int _{\mu(B(\pc(\fp), 8D^{\ps(\fp)}))} |f(y)|\, dy This together with a\ge 4 proves the lemma.

Set \tilde{q}=\frac {2q}{1+q}. Since 1< q\le 2, we have 1<\tilde{q}<q\le 2.

Lemma1.6.1.3
Statement uses 2
Statement dependency previews
Preview
Theorem 1.2.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1markupTeXL∃∀N

We have that \left|\int \overline{g(x)} \sum_{\fp \in \mathfrak{A}} T_{\fp} f(x)\, d\mu(x)\right|\le 2^{103a^3}({q}-1)^{-1} \dens_2(\mathfrak{A})^{\frac 1{\tilde{q}}-\frac 12} \|f\|_2\|g\|_2.

Lean code for Lemma1.6.1.31 theorem
  • complete
    theorem dens2_antichain.{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)} (h𝔄 : IsAntichain (fun x1 x2  x1  x2) 𝔄) {f : X  }
      (hfF :  (x : X), f x  F.indicator 1 x) (hf : Measurable f)
      {g : X  } (hgG :  (x : X), g x  G.indicator 1 x)
      (hg : Measurable g) :
       (x : X), (starRingEnd ) (g x) * carlesonSum 𝔄 f x‖ₑ 
        (C6_1_3 a (nnq X)) *
              dens₂ 𝔄 ^ ((2 * (nnq X) / ((nnq X) + 1))⁻¹ - 2⁻¹) *
            MeasureTheory.eLpNorm f 2 MeasureTheory.volume *
          MeasureTheory.eLpNorm g 2 MeasureTheory.volume
    theorem dens2_antichain.{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)}
      (h𝔄 :
        IsAntichain (fun x1 x2  x1  x2) 𝔄)
      {f : X  }
      (hfF :
         (x : X), f x  F.indicator 1 x)
      (hf : Measurable f) {g : X  }
      (hgG :
         (x : X), g x  G.indicator 1 x)
      (hg : Measurable g) :
       (x : X),
            (starRingEnd ) (g x) *
              carlesonSum 𝔄 f x‖ₑ 
        (C6_1_3 a (nnq X)) *
              dens₂ 𝔄 ^
                ((2 * (nnq X) /
                      ((nnq X) + 1))⁻¹ -
                  2⁻¹) *
            MeasureTheory.eLpNorm f 2
              MeasureTheory.volume *
          MeasureTheory.eLpNorm g 2
            MeasureTheory.volume
    Lemma 6.1.3 (inequality 6.1.11). 
Proof for Lemma 1.6.1.3
uses 0

Proof. We have f=\mathbf{1}_Ff. Using Holder's inequality, we obtain for each x\in B' and each B'\in \mathcal{B} using 1<\tilde{q}\le 2 \frac 1{\mu(B')}\int_{B'} |f(y)|\, d\mu(y) \le \left(\frac 1{\mu(B')}\int_{B'} |f(y)|^{\frac {2{\tilde{q}}}{3\tilde{q}-2}}\, d\mu(y)\right)^{\frac 32-\frac 1{\tilde{q}}} \left(\frac 1{\mu(B')}\int_{B'} \mathbf{1}_F(y)\, d\mu(y)\right)^{\frac 1{\tilde{q}}-\frac 12} \le \left(M_{\mathcal{B}} (|f|^{\frac {2{\tilde{q}}}{3{\tilde{q}}-2}})(x)\right)^{\frac 32-\frac 1{\tilde{q}}} \dens_2(\mathfrak{A})^{\frac 1{\tilde{q}}-\frac 12}. Taking the maximum over all B' containing x, we obtain M_{\mathcal{B}}|f|\le M_{\mathcal{B},\frac {2{\tilde{q}}}{3{\tilde{q}}-2} } |f| \dens_2(\mathfrak{A})^{\frac 1{\tilde{q}}-\frac 12}.

We have with Theorem 1.2.6 \left\|M_{\mathcal{B}, \frac {2{\tilde{q}}}{3{\tilde{q}}-2}} f\right\|_2\le 2^{2a}(3\tilde{q}-2)(2\tilde{q}-2)^{-1}\|f\|_2. Using 1<\tilde{q}\le 2 estimates the last display by 2^{2a+2} (\tilde{q}-1)^{-1} \|f\|_2. We obtain with Cauchy-Schwarz and then Lemma 1.6.1.2 |\int \overline{g(x)} \sum_{\fp \in \mathfrak{A}} T_{\fp} f(x)\, d\mu(x)| \le \|g\|_2 \Big\| \sum_{\fp \in \mathfrak{A}} T_{\fp} f \Big\|_2 \le 2^{102a^3}\|g\|_2 \| M_{\mathcal{B}}f \|_2. With eqttt1 and eqttt2 we can estimate the last display by \le 2^{102a^3+2a+2}(\tilde{q}-1)^{-1} \|g\|_2 \|f\|_2\dens_2(\mathfrak{A})^{\frac 1{\tilde{q}}-\frac 12} Using a\ge 4 and (\tilde q - 1)^{-1} = (q+1)/(q-1) \le 3(q-1)^{-1} proves the lemma.

Lemma1.6.1.4
Statement uses 3
Statement dependency previews
Preview
Theorem 1.2.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1markupTeXL∃∀N

Set p:=4a^4. We have \left|\int \overline{g(x)} \sum_{\fp \in \mathfrak{A}} T_{\fp} f(x)\, d\mu(x)\right|\le 2^{117a^3}\dens_1(\mathfrak{A})^{\frac 1{2p}} \|f\|_2\|g\|_2.

Lean code for Lemma1.6.1.41 theorem
  • complete
    theorem dens1_antichain.{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)} {f g : X  }
      (h𝔄 : IsAntichain (fun x1 x2  x1  x2) 𝔄) (hf : Measurable f)
      (hfF :  (x : X), f x  F.indicator 1 x) (hg : Measurable g)
      (hgG :  (x : X), g x  G.indicator 1 x) :
       (x : X), (starRingEnd ) (g x) * carlesonSum 𝔄 f x‖ₑ 
        (C6_1_4 a) * dens₁ 𝔄 ^ (8 * a ^ 4)⁻¹ *
            MeasureTheory.eLpNorm f 2 MeasureTheory.volume *
          MeasureTheory.eLpNorm g 2 MeasureTheory.volume
    theorem dens1_antichain.{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)} {f g : X  }
      (h𝔄 :
        IsAntichain (fun x1 x2  x1  x2) 𝔄)
      (hf : Measurable f)
      (hfF :
         (x : X), f x  F.indicator 1 x)
      (hg : Measurable g)
      (hgG :
         (x : X), g x  G.indicator 1 x) :
       (x : X),
            (starRingEnd ) (g x) *
              carlesonSum 𝔄 f x‖ₑ 
        (C6_1_4 a) *
              dens₁ 𝔄 ^ (8 * a ^ 4)⁻¹ *
            MeasureTheory.eLpNorm f 2
              MeasureTheory.volume *
          MeasureTheory.eLpNorm g 2
            MeasureTheory.volume
    Lemma 6.1.4. 
Proof for Lemma 1.6.1.4
uses 0

Proof. We write for the expression inside the absolute values on the left-hand side of eqttt3 \sum_{\fp \in \mathfrak{A}}\iint \overline{g(x)} \mathbf{1}_{E(\fp)}(x) {K_{\ps(\fp)}(x,y)}e(\tQ(x)(y) - \tQ(x)(x)) f(y)\, d\mu(y)\,d\mu(x) =\int \sum_{\fp \in \mathfrak{A}} \overline{T_{\fp} ^*g(y)} f(y)\, d\mu(y) with the adjoint operator T_{\fp}^*g(y)=\int_{E(\fp)} \overline{K_{\ps(\fp)}(x,y)}e(-\tQ(x)(y)+ \tQ(x)(x))g(x)\, d\mu(x). We have by expanding the square \int \Big|\sum_{\fp\in \mathfrak{A}}T^*_{\fp}g(y)\Big|^2\, d\mu(y)= \int \left(\sum_{\fp\in \mathfrak{A}} T^*_{\fp}g(y)\right) \left(\sum_{\fp'\in \mathfrak{A}}\overline{T^*_{\fp'}g(y)}\right)\, d\mu(y) \le \sum_{\fp\in \mathfrak{A}} \sum_{\fp'\in \mathfrak{A}} \Big|\int T^*_{\fp}g(y)\overline{T^*_{\fp'}g(y)}\, d\mu(y)\Big|. We split the sum into the terms with \ps(\fp')\le \ps(\fp) and \ps(\fp)< \ps(\fp'). Using the symmetry of each summand, we may switch \fp and \fp' in the second sum. Using further positivity of each summand to replace the condition \ps(\fp')< \ps(\fp) by \ps(\fp')\le \ps(\fp) in the second sum, we estimate eqtts1 by \le2 \sum_{\fp\in \mathfrak{A}} \sum_{\fp'\in \mathfrak{A}: \ps(\fp')\le \ps(\fp)} \Big|\int T^*_{\fp}g(y)\overline{T^*_{\fp'}g(y)}\, d\mu(y)\Big|.

Define for \fp\in \fP B(\fp):=B(\pc(\fp), 14D^{\ps(\fp)}) and define \mathfrak{A}(\fp):=\{\fp'\in\mathfrak{A}: \ps(\fp')\leq \ps(\fp) \land \scI(\fp') \subset B(\fp)\}. Note that by the squeezing property eq-vol-sp-cube and the doubling property doublingx applied 6 times we have \mu(B(\fp))\le 2^{6a} \mu(\scI(\fp)). Using Lemma 1.6.1.5 and eqttt4, we estimate eqtts2 by \le 2^{232a^3+6a+1} \sum_{\fp\in \mathfrak{A}} \int_{E(\fp)}|g|(y) h(\fp)\, d\mu(y) with h(\fp) defined as \frac 1{\mu(B(\fp))}\int \sum_{\fp'\in \mathfrak{A}(\fp)} {(1+d_{\fp'}(\fcc(\fp'), \fcc(\fp))^{-1/(2a^2+a^3)}}(\mathbf{1}_{E(\fp')}|g|)(y')\, d\mu(y').

Note that p>4 since a\ge 4. Let p' be the dual exponent of p, satisfying 1/p+1/p'=1. We estimate h(\fp) as defined in def-hp with Holder using |g|\le \mathbf{1}_G and E(\fp')\subset B(\fp) by \frac{\|g\mathbf{1}_{B(\fp)}\|_{p'}}{\mu(B(\fp))} \Big\|\sum_{\fp\in\mathfrak{A}(\fp)}(1+d_{\fp}(\fcc(\fp), \fcc(\fp'))^{-1/(2a^2+a^3)}\mathbf{1}_{E(\fp)}\mathbf{1}_G\Big\|_{p}. Then we apply Lemma 1.6.1.6 to estimate this by \le 2^{5a} \frac{\|g\mathbf{1}_{B(\fp)}\|_{p'}}{\mu(B(\fp))} \dens_1(\mathfrak{A})^{\frac 1p}\mu(B(\fp))^{\frac 1p}. Let \mathcal{B}' be the collection of all balls B(\fp) with \fp\in \mathfrak{A}. Then for each \fp\in \mathfrak{A} and x\in B(\fp) we have by definition def-hlm of M_{\mathcal{B}',p'} \|g\mathbf{1}_{B(\fp)}\|_{p'}\le \mu(B(\fp))^{\frac 1{p'}} M_{\mathcal{B}',p'}g(x). Hence we can estimate eqttt5 by \le 2^{5a} (M_{\mathcal{B}', p'}g(x)) \dens_1(\mathfrak{A})^{\frac 1p}.

With this estimate of h(\fp), using E(\fp)\subset B(\fp) by construction of B(\fp), we estimate eqtts3 by \le 2^{232a^3+11a + 1} { \dens_1(\mathfrak{A})^{\frac 1p}}\sum_{\fp\in \mathfrak{A}} \int_{E(\fp)}|g|(y)M_{\mathcal{B}', p'}g(y) \, dy. Using Lemma 1.6.1.1, the last display is observed to be \le 2^{232a^3+11a + 1} {\dens_1(\mathfrak{A})^{\frac 1p}} \int |g|(y)(M_{\mathcal{B}', p'}g)(y) \, dy. Applying Cauchy-Schwarz and using Theorem 1.2.6 and 1<p'<\frac 32 estimates the last display by \le 2^{232a^3+11a + 1} \dens_1(\mathfrak{A})^{\frac 1p} \|g\|_2 \|M_{\mathcal{B}', p'} g\|_2 \le 2^{232a^3+12a+3} \dens_1(\mathfrak{A})^{\frac 1p}\|g\|_2 ^2. Now Lemma 1.6.1.4 follows by applying Cauchy-Schwarz on the left-hand side and using a\ge 4.

The following basic TT^* estimate will be proved in Proof of the Tile Correlation Lemma.

Lemma1.6.1.5
Statement uses 4
Statement dependency previews
Preview
Theorem 1.2.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1markupTeXL∃∀N

Let \fp, \fp'\in \fP with \ps({\fp'})\leq \ps({\fp}). Then \left|\int T^*_{\fp'}g\overline{T^*_{\fp}g}\right| \le 2^{232a^3}\frac{(1+d_{\fp'}(\fcc(\fp'), \fcc(\fp))^{-1/(2a^2+a^3)}}{\mu(\scI(\fp))}\int_{E(\fp')}|g|\int_{E(\fp)}|g|. Moreover, the term eq-basic-TT*-est vanishes unless \scI(\fp') \subset B(\pc(\fp), 14D^{\ps(\fp)}).

Lean code for Lemma1.6.1.52 theorems
  • complete
    theorem Tile.correlation_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)]
      {p p' : 𝔓 X} (hle : 𝔰 p'  𝔰 p) {g : X  } (hg : Measurable g)
      (hg1 :  (x : X), g x  G.indicator 1 x) :
       (y : X),
            adjointCarleson p' g y *
              (starRingEnd ) (adjointCarleson p g y)‖ₑ 
        ((Tile.C6_1_5 a) *
                (1 + edist_{𝔠 p', (defaultD a) ^ 𝔰 p' / 4} (𝒬 p') (𝒬 p)) ^
                  (-(2 * a ^ 2 + a ^ 3)⁻¹) /
              MeasureTheory.volume (𝓘 p) *
            ∫⁻ (y : X) in E p', g y‖ₑ) *
          ∫⁻ (y : X) in E p, g y‖ₑ
    theorem Tile.correlation_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)]
      {p p' : 𝔓 X} (hle : 𝔰 p'  𝔰 p)
      {g : X  } (hg : Measurable g)
      (hg1 :
         (x : X), g x  G.indicator 1 x) :
       (y : X),
            adjointCarleson p' g y *
              (starRingEnd )
                (adjointCarleson p g y)‖ₑ 
        ((Tile.C6_1_5 a) *
                (1 +
                    edist_{𝔠 p',
                        (defaultD a) ^ 𝔰 p' /
                          4}
                      (𝒬 p') (𝒬 p)) ^
                  (-(2 * a ^ 2 + a ^ 3)⁻¹) /
              MeasureTheory.volume (𝓘 p) *
            ∫⁻ (y : X) in E p', g y‖ₑ) *
          ∫⁻ (y : X) in E p, g y‖ₑ
    Part 1 of Lemma 6.1.5 (eq. 6.1.43). 
  • complete
    theorem Tile.correlation_zero_of_ne_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)]
      {p p' : 𝔓 X} (hle : 𝔰 p'  𝔰 p) {g : X  }
      (hp : ¬(𝓘 p')  Metric.ball (𝔠 p) (14 * (defaultD a) ^ 𝔰 p)) :
       (y : X),
            adjointCarleson p' g y *
              (starRingEnd ) (adjointCarleson p g y)‖ₑ =
        0
    theorem Tile.correlation_zero_of_ne_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)]
      {p p' : 𝔓 X} (hle : 𝔰 p'  𝔰 p)
      {g : X  }
      (hp :
        ¬(𝓘 p') 
            Metric.ball (𝔠 p)
              (14 * (defaultD a) ^ 𝔰 p)) :
       (y : X),
            adjointCarleson p' g y *
              (starRingEnd )
                (adjointCarleson p g y)‖ₑ =
        0
    Part 2 of Lemma 6.1.5 (claim 6.1.44). 

The following lemma will be proved in Proof of the Antichain Tile Count Lemma.

Lemma1.6.1.6
uses 1used by 1markupTeXL∃∀N

Set p:=4a^4. For every \mfa\in\Mf and every antichain \mathfrak{A} we have \Big\|\sum_{\fp\in\mathfrak{A}}(1+d_{\fp}(\fcc(\fp), \mfa))^{-1/(2a^2+a^3)}\mathbf{1}_{E(\fp)}\mathbf{1}_G\Big\|_{p} \le 2^{5a}\dens_1(\mathfrak{A})^{\frac 1p}\mu\left(\cup_{\fp\in\mathfrak{A}}I_{\fp}\right)^{\frac 1p}.

Lean code for Lemma1.6.1.61 theorem
  • complete
    theorem Antichain.tile_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)]
      {𝔄 : Set (𝔓 X)} (h𝔄 : IsAntichain (fun x1 x2  x1  x2) 𝔄)
      (ϑ : (Set.range Q)) :
      MeasureTheory.eLpNorm
          (fun x 
             p with p  𝔄,
              (1 + edist_{𝔠 p, (defaultD a) ^ 𝔰 p / 4} (𝒬 p) ϑ) ^
                    (-(2 * a ^ 2 + a ^ 3)⁻¹) *
                  (E p).indicator 1 x *
                G.indicator 1 x)
          (ENNReal.ofReal (Antichain.p₆ a)) MeasureTheory.volume 
        (Antichain.C6_1_6 a) * dens₁ 𝔄 ^ (Antichain.p₆ a)⁻¹ *
          MeasureTheory.volume (⋃ p  𝔄, (𝓘 p)) ^ (Antichain.p₆ a)⁻¹
    theorem Antichain.tile_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)]
      {𝔄 : Set (𝔓 X)}
      (h𝔄 :
        IsAntichain (fun x1 x2  x1  x2) 𝔄)
      (ϑ : (Set.range Q)) :
      MeasureTheory.eLpNorm
          (fun x 
             p with p  𝔄,
              (1 +
                      edist_{𝔠 p,
                          (defaultD a) ^
                              𝔰 p /
                            4}
                        (𝒬 p) ϑ) ^
                    (-(2 * a ^ 2 +
                          a ^ 3)⁻¹) *
                  (E p).indicator 1 x *
                G.indicator 1 x)
          (ENNReal.ofReal (Antichain.p₆ a))
          MeasureTheory.volume 
        (Antichain.C6_1_6 a) *
            dens₁ 𝔄 ^ (Antichain.p₆ a)⁻¹ *
          MeasureTheory.volume
              (⋃ p  𝔄, (𝓘 p)) ^
            (Antichain.p₆ a)⁻¹
    Lemma 6.1.6. 

From these lemmas it is easy to prove Theorem 1.2.3.

Proof for Theorem 1.2.3
uses 0

Proof of Theorem 1.2.3. We have \left(\frac 1{\tilde{q}} -\frac 12\right) (2-q)= \frac 1q -\frac 12. Multiplying the (2-q)-th power of eqttt9 and the (q-1)-th power of eqttt3 and estimating gives after simplification of some factors \Big|\int \overline{g(x)} \sum_{\fp \in \mathfrak{A}} T_{\fp} f(x)\, d\mu(x)\Big| \le 2^{117a^3}(q-1)^{-1} \dens_1(\mathfrak{A})^{\frac {q-1}{2p}}\dens_2(\mathfrak{A})^{\frac 1{q}-\frac 12} \|f\|_2\|g\|_2. With the definition of p, this implies Theorem 1.2.3.

1.6.2. Proof of the Tile Correlation Lemma🔗

The next lemma prepares an application of Theorem 1.2.5.

Lemma1.6.2.1
uses 0used by 1markupTeXL∃∀N

Let -S\le s_1\le s_2\le S and let x_1,x_2\in X. Define \varphi(y) := \overline{K_{s_1}(x_1, y)} K_{s_2}(x_2, y). If \varphi(y)\neq 0, then y\in B(x_1, D^{s_1}). Moreover, we have with \tau = 1/a \|\varphi\|_{C^\tau(B(x_1, 2 D^{s_1}))}\le \frac{2^{231 a^3}}{\mu(B(x_1, D^{s_1}))\mu(B(x_2, D^{s_2}))}.

Lean code for Lemma1.6.2.13 declarations
  • def Tile.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] (s₁ s₂ : ) (x₁ x₂ y : X) : 
    def Tile.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] (s₁ s₂ : )
      (x₁ x₂ y : X) : 
    Def 6.2.1 (from Lemma 6.2.1), denoted by `φ(y)` in the blueprint. 
  • complete
    theorem Tile.mem_ball_of_correlation_ne_zero.{u_1} {X : Type u_1} {a : }
      {q : } {K : X  X  } {σ₁ σ₂ : X  } {F G : Set X} [MetricSpace X]
      [ProofData a q K σ₁ σ₂ F G] {s₁ s₂ : } {x₁ x₂ y : X}
      (hy : Tile.correlation s₁ s₂ x₁ x₂ y  0) :
      y  Metric.ball x₁ ((defaultD a) ^ s₁)
    theorem Tile.mem_ball_of_correlation_ne_zero.{u_1}
      {X : Type u_1} {a : } {q : }
      {K : X  X  } {σ₁ σ₂ : X  }
      {F G : Set X} [MetricSpace X]
      [ProofData a q K σ₁ σ₂ F G] {s₁ s₂ : }
      {x₁ x₂ y : X}
      (hy :
        Tile.correlation s₁ s₂ x₁ x₂ y  0) :
      y  Metric.ball x₁ ((defaultD a) ^ s₁)
    First part of Lemma 6.2.1 (eq. 6.2.2). 
  • complete
    theorem Tile.correlation_kernel_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] {s₁ s₂ : } {x₁ x₂ : X} (hs : s₁  s₂) :
      iHolENorm (Tile.correlation s₁ s₂ x₁ x₂) x₁ (2 * (defaultD a) ^ s₁)
          (defaultτ a) 
        (Tile.C6_2_1 a) /
          (MeasureTheory.volume (Metric.ball x₁ ((defaultD a) ^ s₁)) *
            MeasureTheory.volume (Metric.ball x₂ ((defaultD a) ^ s₂)))
    theorem Tile.correlation_kernel_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] {s₁ s₂ : }
      {x₁ x₂ : X} (hs : s₁  s₂) :
      iHolENorm (Tile.correlation s₁ s₂ x₁ x₂)
          x₁ (2 * (defaultD a) ^ s₁)
          (defaultτ a) 
        (Tile.C6_2_1 a) /
          (MeasureTheory.volume
              (Metric.ball x₁
                ((defaultD a) ^ s₁)) *
            MeasureTheory.volume
              (Metric.ball x₂
                ((defaultD a) ^ s₂)))
    Second part of Lemma 6.2.1 (eq. 6.2.3). 
Proof for Lemma 1.6.2.1
uses 0

Proof. If \varphi(y) is not zero, then K_{s_1}(x_1, y) is not zero and thus supp-Ks gives eqt10.

We next have for y with eq-Ks-size |\varphi(y)|\le \frac{2^{204 a^3}}{\mu(B(x_1, D^{s_1}))\mu(B(x_2, D^{s_2}))} and for y'\neq y additionally with eq-Ks-smooth |\varphi(y)-\varphi(y')| \le |K_{s_1}(x_1,y)-K_{s_1}(x_1,y')|| K_{s_2}(x_2, y)| +|K_{s_1}(x_1, y')| |K_{s_2}(x_2, y) - K_{s_2}(x_2, y')| \le \frac{2^{229 a^3}}{\mu(B(x_1, D^{s_1}))\mu(B(x_2, D^{s_2}))} \left(\left(\frac{ \rho(y,y')}{D^{s_1}}\right)^{1/a}+ \left(\frac{ \rho(y,y')}{D^{s_2}}\right)^{1/a}\right) \le \frac{2^{230 a^3}}{\mu(B(x_1, D^{s_1}))\mu(B(x_2, D^{s_2}))} \left(\frac{ \rho(y,y')}{D^{s_1}}\right)^{1/a}. Adding the estimates suppart and holderpart gives eqt11. This proves the lemma.

The following auxiliary statement about the support of T_\fp^*g will be used repeatedly.

Lemma1.6.2.2
uses 0
Used by 2
Reverse dependency previews
Preview
Lemma 1.6.1.5
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
markupTeXL∃∀N

For each \fp\in \fP, and each y\in X, we have that T_{\fp}^* g(y)\neq 0 implies y\in B(\pc(\fp),5D^{\ps(\fp)}).

Lean code for Lemma1.6.2.21 theorem
  • complete
    theorem Tile.range_support.{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} {g : X  } {y : X} (hpy : adjointCarleson p g y  0) :
      y  Metric.ball (𝔠 p) (5 * (defaultD a) ^ 𝔰 p)
    theorem Tile.range_support.{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} {g : X  } {y : X}
      (hpy : adjointCarleson p g y  0) :
      y 
        Metric.ball (𝔠 p)
          (5 * (defaultD a) ^ 𝔰 p)
    Lemma 6.2.2. 
Proof for Lemma 1.6.2.2
uses 0

Proof. Fix \fp and y with tstargnot0. Then there exists x\in E(\fp) with \overline{K_{\ps(\fp)}(x,y)}e(-\tQ(x)(y) +\tQ(x)(x))g(x) \neq 0. As E(\fp)\subset \scI(\fp) and by the squeezing property eq-vol-sp-cube, we have \rho(x,\pc(\fp)) < 4D^{\ps(\fp)}. As K_{\ps(\fp)}(x,y)\neq 0, we have by supp-Ks that \rho(x,y)\le \frac 12 D^{\ps(\fp)}. Now ynotfar follows by the triangle inequality.

The next lemma is a geometric estimate for two tiles.

Lemma1.6.2.3
Statement uses 2
Statement dependency previews
Preview
Lemma 1.2.1.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1markupTeXL∃∀N

Let \fp_1, \fp_2\in \fP with B(\pc(\fp_1),5D^{\ps(\fp_1)}) \cap B(\pc(\fp_2),5D^{\ps(\fp_2)}) \ne \emptyset and \ps({\fp_1})\leq \ps({\fp_2}). For each x_1\in E(\fp_1) and x_2\in E(\fp_2) we have 1+d_{\fp_1}(\fcc(\fp_1), \fcc(\fp_2))\le 2^{8a}(1 + d_{B(x_1, D^{\ps(\fp_1)})}(\tQ(x_1),\tQ(x_2))).

Lean code for Lemma1.6.2.31 theorem
  • complete
    theorem Tile.uncertainty.{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)]
      (ha : 1  a) {p₁ p₂ : 𝔓 X} (hle : 𝔰 p₁  𝔰 p₂)
      (hinter :
        (Metric.ball (𝔠 p₁) (5 * (defaultD a) ^ 𝔰 p₁) 
            Metric.ball (𝔠 p₂) (5 * (defaultD a) ^ 𝔰 p₂)).Nonempty)
      {x₁ x₂ : X} (hx₁ : x₁  E p₁) (hx₂ : x₂  E p₂) :
      1 + edist_{𝔠 p₁, (defaultD a) ^ 𝔰 p₁ / 4} (𝒬 p₁) (𝒬 p₂) 
        (Tile.C6_2_3 a) *
          (1 + edist_{x₁, (defaultD a) ^ 𝔰 p₁} (Q x₁) (Q x₂))
    theorem Tile.uncertainty.{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)]
      (ha : 1  a) {p₁ p₂ : 𝔓 X}
      (hle : 𝔰 p₁  𝔰 p₂)
      (hinter :
        (Metric.ball (𝔠 p₁)
              (5 * (defaultD a) ^ 𝔰 p₁) 
            Metric.ball (𝔠 p₂)
              (5 *
                (defaultD a) ^
                  𝔰 p₂)).Nonempty)
      {x₁ x₂ : X} (hx₁ : x₁  E p₁)
      (hx₂ : x₂  E p₂) :
      1 +
          edist_{𝔠 p₁,
              (defaultD a) ^ 𝔰 p₁ / 4}
            (𝒬 p₁) (𝒬 p₂) 
        (Tile.C6_2_3 a) *
          (1 +
            edist_{x₁, (defaultD a) ^ 𝔰 p₁}
              (Q x₁) (Q x₂))
    Lemma 6.2.3 (edist version). 
Proof for Lemma 1.6.2.3
uses 0

Proof. Let i\in \{1,2\}. By definition defineep of E, we have \tQ(x_i)\in \fc(\fp_i). With eq-freq-comp-ball we then conclude d_{\fp_i}(\tQ(x_i),\fcc(\fp_i)) < 1. We have by the triangle inequality and eq-vol-sp-cube that \scI(\fp_1) \subset B(\pc(\fp_2),14D^{\ps(\fp_2)}). Thus, using again eq-vol-sp-cube and the doubling property firstdb d_{\fp_1}(\tQ(x_2), \fcc(\fp_2)) \le 2^{6a} d_{\fp_2}(\tQ(x_2), \fcc(\fp_2)) \le 2^{6a}. By the triangle inequality, we obtain from dponetwo and tgeo0.5 1+d_{\fp_1}(\fcc(\fp_1), \fcc(\fp_2))\le 2 + 2^{6a} +d_{\fp_1}(\tQ(x_1), \tQ(x_2)). As x_1\in \scI(\fp_1) by definition defineep of E, we have by the squeezing property eq-vol-sp-cube d(x_1,\pc(\fp_1))\le 4D^{\ps(\fp_1)} and thus by eq-vol-sp-cube again and the triangle inequality \scI(\fp_1)\subset B(x_1,8D^{\ps(\fp_1)}). We thus estimate the right-hand side of tgeo1 with monotonicity monotonedb of the metrics d_B by \le 2 + 2^{6a} + d_{B(x_1,8D^{\ps(\fp_1)})}(\tQ(x_1), \tQ(x_2)). This is further estimated by applying the doubling property firstdb three times by \le 2 + 2^{6a} +2^{3a}d_{B_1(x_1, D^{\ps(\fp_1)})}(\tQ(x_1), \tQ(x_2)). Now tgeo follows with a\ge 4.

We now prove Lemma 1.6.1.5.

Proof for Lemma 1.6.1.5
uses 0

Proof of Lemma 1.6.1.5. We begin with eq-basic-TT*-est. By Lemma 1.6.2.2, the left-hand side of eq-basic-TT*-est vanishes if B(\pc(\fp'),5D^{\ps(\fp')}) \cap B(\pc(\fp),5D^{\ps(\fp)}) = \emptyset. Thus we can assume for the remainder of the proof that B(\pc(\fp'),5D^{\ps(\fp')}) \cap B(\pc(\fp),5D^{\ps(\fp)}) \neq \emptyset. We expand the left-hand side of eq-basic-TT*-est as \left|\int \int_{E(\fp')} \overline{K_{\ps(\fp')}(x_1,y)}e(-\tQ(x_1)(y)+ \tQ(x_1)(x_1))g(x_1)\, d\mu(x_1) \right. \times \left.\int_{E(\fp)} {K_{\ps(\fp)}(x_2,y)}e(\tQ(x_2)(y) -\tQ(x_2)(x_2))\overline{g(x_2)}\, d\mu(x_2)\, d\mu(y)\right|. By Fubini and the triangle inequality and the fact |e(\tQ(x_i)(x_i))|=1 for i=1,2, we can estimate tstartstar and tstartstar' from above by \int_{E(\fp')} \int_{E(\fp)} {\bf I}(x_1, x_2)\, d\mu(x_1)d\mu(x_2), with {\bf I}(x_1, x_2):= \left|\int e(-\tQ(x_1)(y)+\tQ(x_2)(y))\varphi_{x_1,x_2}(y) d\mu(y) \, g(x_1)g(x_2)\right|.

We estimate for fixed x_1\in E(\fp') and x_2\in E(\fp) the inner integral of eqa1 with Theorem 1.2.5. The function \varphi:=\varphi_{x_1,x_2} satisfies the assumptions of Theorem 1.2.5 with z = x_1 and R = D^{s_1} by Lemma 1.6.2.1. We obtain with B':= B(x_1, D^{\ps(\fp')}) {\bf I}(x_1, x_2) \le 2^{8a} \mu(B') \|{\varphi}\|_{C^\tau(B')} (1 + d_{B'}(\tQ(x_1),\tQ(x_2)))^{-1/(2a^2+a^3)}|g(x_1)g(x_2)| \le \frac{2^{231a^3+8a}} {\mu(B(x_2, D^{\ps(\fp)}))} (1 + d_{B'}(\tQ(x_1),\tQ(x_2)))^{-1/(2a^2+a^3)}. Using intersec5B, Lemma 1.6.2.3 and a\ge 1 estimates eqa1.5 by \le \frac{2^{231a^3 + 8a + 1}} {\mu(B(x_2, D^{\ps(\fp)}))} (1+d_{\fp'}(\fcc(\fp'), \fcc(\fp)))^{-1/(2a^2+a^3)}|g(x_1)g(x_2)|. As x_2\in \scI(\fp) by definition defineep of E, we have by eq-vol-sp-cube \rho(x_2,\pc(\fp)) < 4D^{\ps(\fp)} and thus by eq-vol-sp-cube again and the triangle inequality \scI(\fp)\subset B(x_2,8D^{\ps(\fp)}). Using three iterations of the doubling property doublingx give \mu(\scI(\fp))\le 2^{3a}\mu(B(x_2,D^{\ps(\fp)})). With a\ge 4 and eqa2 we conclude eq-basic-TT*-est.

Now assume the left-hand side of eq-basic-TT*-est is not zero. There is a y\in X with T^*_{\fp'}g(y)\overline{T^*_{\fp}g(y)}\neq 0 By the triangle inequality and Lemma 1.6.2.2, we conclude \rho(\pc(\fp),\pc(\fp'))\le \rho(\pc(\fp),y) +\rho(\pc(\fp'),y) \le 5D^{\ps(\fp)}+5D^{\ps(\fp')}\le 10 D^{\ps(\fp)}. By the squeezing property eq-vol-sp-cube and the triangle inequality, we conclude \scI(\fp') \subset B(\pc(\fp), 14D^{\ps(\fp)}). This completes the proof of Lemma 1.6.1.5.

1.6.3. Proof of the Antichain Tile Count Lemma🔗

Lemma1.6.3.1
uses 1used by 1markupTeXL∃∀N

Let \mfa\in \Mf and N\ge0 be an integer. Let \fp, \fp'\in \fP with d_{\fp}(\fcc(\fp), \mfa)\le 2^N d_{\fp'}(\fcc(\fp'), \mfa)\le 2^N. Assume \scI(\fp)\subset \scI(\fp') and \ps(\fp)<\ps(\fp'). Then 2^{N+2}\fp\lesssim 2^{N+2} \fp'.

Lean code for Lemma1.6.3.11 theorem
  • complete
    theorem Antichain.tile_reach.{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)]
      {ϑ : Θ X} {N : } {p p' : 𝔓 X}
      (hp : dist_{𝔠 p, (defaultD a) ^ 𝔰 p / 4} (𝒬 p) ϑ  2 ^ N)
      (hp' : dist_{𝔠 p', (defaultD a) ^ 𝔰 p' / 4} (𝒬 p') ϑ  2 ^ N)
      (hI : 𝓘 p  𝓘 p') (hs : 𝔰 p < 𝔰 p') :
      smul (2 ^ (N + 2)) p  smul (2 ^ (N + 2)) p'
    theorem Antichain.tile_reach.{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)]
      {ϑ : Θ X} {N : } {p p' : 𝔓 X}
      (hp :
        dist_{𝔠 p, (defaultD a) ^ 𝔰 p / 4}
            (𝒬 p) ϑ 
          2 ^ N)
      (hp' :
        dist_{𝔠 p', (defaultD a) ^ 𝔰 p' / 4}
            (𝒬 p') ϑ 
          2 ^ N)
      (hI : 𝓘 p  𝓘 p') (hs : 𝔰 p < 𝔰 p') :
      smul (2 ^ (N + 2)) p 
        smul (2 ^ (N + 2)) p'
    Lemma 6.3.1. 
Proof for Lemma 1.6.3.1
uses 0

Proof. By Lemma 1.2.1.2, we have d_{\fp}(\fcc(\fp'),\mfa) \le d_{\fp'}(\fcc(\fp'),\mfa) \le 2^{N}. Together with eqassumedismfa and the triangle inequality, we obtain d_{\fp}(\fcc(\fp'),\fcc(\fp))\le 2^{N+1}. Now assume \mfa'\in B_{\fp'}(\fcc(\fp'),2^{N+2}). By the doubling property firstdb, applied five times, we have d_{B(\pc(\fp'),8D^{\ps(\fp')})}(\fcc(\fp'),\mfa') < 2^{5a+N+2}. We have by the squeezing property eq-vol-sp-cube \pc(\fp)\in B(\pc(\fp'),4D^{\ps(\fp')}). Hence by the triangle inequality B(\pc(\fp), 4D^{\ps(\fp')}) \subseteq B(\pc(\fp'),8D^{\ps(\fp')}). Together with ageo1 and monotonicity monotonedb of d d_{B(\pc(\fp),4D^{\ps(\fp')})}(\fcc(\fp'),\mfa') < 2^{5a+N+2}. Using the doubling property seconddb 5a+2 times gives d_{B(\pc(\fp),2^{2-5a^2-2a}D^{\ps(\fp')})}(\fcc(\fp'),\mfa') < 2^{N}. Using \ps(\fp)<\ps(\fp') and D=2^{100a^2} and a\ge 4 gives d_{\fp}(\fcc(\fp'),\mfa') < 2^{N}. With the triangle inequality and eqdistqpqp, d_{\fp}(\fcc(\fp),\mfa') < 2^{N+2}. This shows B_{\fp'}(\fcc(\fp'),2^{N+2})\subset B_{\fp}(\fcc(\fp),2^{N+2}). This implies lp'lp'' and completes the proof of the lemma.

For \mfa \in \Mf and N\ge 0 define \mathfrak{A}_{\mfa,N}:=\{\fp\in\mathfrak{A}: 2^{N}\le 1+d_{\fp}(\fcc(\fp), \mfa) < 2^{N+1}\}.

Lemma1.6.3.2
uses 0used by 1markupTeXL∃∀N

Let \mfa \in \Mf, N\ge 0 and L\in \mathcal{D}. Then \sum_{\fp\in\mathfrak{A}_{\mfa,N}:\scI(\fp)=L}\mu(E(\fp)\cap G)\le 2^{a(N+5)}\dens_1(\mathfrak{A})\mu(L).

Lean code for Lemma1.6.3.21 theorem
  • complete
    theorem Antichain.stack_density.{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)) (ϑ : Θ X) (N : ) (L : Grid X) :
       p  (Antichain.𝔄_aux 𝔄 ϑ N).toFinset with 𝓘 p = L,
          MeasureTheory.volume (E p  G) 
        2 ^ (a * (N + 5)) * dens₁ 𝔄 * MeasureTheory.volume L
    theorem Antichain.stack_density.{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)) (ϑ : Θ X) (N : )
      (L : Grid X) :
      
          p 
            (Antichain.𝔄_aux 𝔄 ϑ
                N).toFinset with
          𝓘 p = L,
          MeasureTheory.volume (E p  G) 
        2 ^ (a * (N + 5)) * dens₁ 𝔄 *
          MeasureTheory.volume L
    Lemma 6.3.2. 
Proof for Lemma 1.6.3.2
uses 0

Proof. Let \mfa,N,L be given and set \mathfrak{A}':=\{\fp\in\mathfrak{A}_{\mfa,N}:\scI(\fp)=L\}. Let \fp\in\mathfrak{A}'. We have by definition definedens1 using \lambda=2 and the squeezing property eq-freq-comp-ball \mu(E(\fp)\cap G)\le \mu(E_2(2, \fp))\le 2^{a}\dens_1(\mathfrak{A}')\mu(L). By the covering property thirddb, applied N+4 times, there is a collection \Mf' of at most 2^{a(N+4)} elements such that B_{\fp}(\mfa, 2^{N+1})\subset \bigcup_{\mfa'\in \Mf'} B_{\fp}(\mfa', 0.2). As each \fcc(\fp') with \fp'\in \mathfrak{A}' is contained in the left-hand side of eqanti-4 by definition, it is in at least one B_{\fp}(\mfa', 0.2) with \mfa'\in \Mf'.

For two different \fp',\fp''\in \mathfrak{A}', we have by eq-dis-freq-cover that \fc(\fp') and \fc(\fp'') are disjoint and thus by the squeezing property eq-freq-comp-ball we have for every \mfa'\in \Mf' \mfa'\not\in B_{\fp}(\fcc(\fp'), 0.2)\cap B_{\fp}(\fcc(\fp''), 0.2). Hence at most one of \fcc(\fp') and \fcc(\fp'') is in B_{\fp}(\mfa', 0.2). It follows that there are at most 2^{a(N+4)} elements in \mathfrak{A}'. Adding eqanti-3 over \mathfrak{A}' proves eqanti-1.

Lemma1.6.3.3
Statement uses 2
Statement dependency previews
Preview
Lemma 1.6.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1markupTeXL∃∀N

Let \mfa\in\Mf and N be an integer. Let \fp_{\mfa} be a tile with \mfa\in B_{\fp_{\mfa}}(\fcc(\fp_{\mfa}), 2^{N+1}). Then we have \sum_{\fp\in\mathfrak{A}_{\mfa,N}: \ps(\fp_{\mfa})<\ps(\fp)}\mu(E(\fp)\cap G \cap \scI(\fp_{\mfa})) \le \mu (E_2(2^{N+3},\fp_{\mfa})).

Lean code for Lemma1.6.3.32 theorems
  • complete
    theorem Antichain.local_antichain_density.{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)} (h𝔄 : IsAntichain (fun x1 x2  x1  x2) 𝔄) (ϑ : Θ X)
      (N : ) {p' : 𝔓 X}
      (hp' :
        ϑ  ball_{𝔠 p', (defaultD a) ^ 𝔰 p' / 4} (𝒬 p') (2 ^ (N + 1))) :
       p  (Antichain.𝔄_aux 𝔄 ϑ N).toFinset with 𝔰 p' < 𝔰 p,
          MeasureTheory.volume (E p  G  (𝓘 p')) 
        MeasureTheory.volume (E₂ (2 ^ (N + 3)) p')
    theorem Antichain.local_antichain_density.{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)}
      (h𝔄 :
        IsAntichain (fun x1 x2  x1  x2) 𝔄)
      (ϑ : Θ X) (N : ) {p' : 𝔓 X}
      (hp' :
        ϑ 
          ball_{𝔠 p',
              (defaultD a) ^ 𝔰 p' / 4}
            (𝒬 p') (2 ^ (N + 1))) :
      
          p 
            (Antichain.𝔄_aux 𝔄 ϑ
                N).toFinset with
          𝔰 p' < 𝔰 p,
          MeasureTheory.volume
            (E p  G  (𝓘 p')) 
        MeasureTheory.volume
          (E₂ (2 ^ (N + 3)) p')
    Lemma 6.3.3. 
  • complete
    theorem Antichain.Ep_inter_G_inter_Ip'_subset_E2.{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)} (ϑ : Θ X) (N : ) {p p' : 𝔓 X}
      (hpin : p  (Antichain.𝔄_aux 𝔄 ϑ N).toFinset)
      (hp' : ϑ  ball_{𝔠 p', (defaultD a) ^ 𝔰 p' / 4} (𝒬 p') (2 ^ (N + 1)))
      (hs : 𝔰 p' < 𝔰 p) (h𝓘 : ((𝓘 p')  (𝓘 p)).Nonempty) :
      E p  G  (𝓘 p')  E₂ (2 ^ (N + 3)) p'
    theorem Antichain.Ep_inter_G_inter_Ip'_subset_E2.{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)} (ϑ : Θ X) (N : )
      {p p' : 𝔓 X}
      (hpin :
        p  (Antichain.𝔄_aux 𝔄 ϑ N).toFinset)
      (hp' :
        ϑ 
          ball_{𝔠 p',
              (defaultD a) ^ 𝔰 p' / 4}
            (𝒬 p') (2 ^ (N + 1)))
      (hs : 𝔰 p' < 𝔰 p)
      (h𝓘 : ((𝓘 p')  (𝓘 p)).Nonempty) :
      E p  G  (𝓘 p')  E₂ (2 ^ (N + 3)) p'
    We prove inclusion 6.3.24 for every `p ∈ (𝔄_aux 𝔄 ϑ N)` with `𝔰 p' < 𝔰 p` such that
    `(𝓘 p : Set X) ∩ (𝓘 p') ≠ ∅`. The variable `p'` corresponds to `𝔭_ϑ` in the blueprint. 
Proof for Lemma 1.6.3.3
uses 0

Proof. Let \fp be any tile in \mathfrak{A}_{\mfa,N} with \ps(\fp_{\mfa})<\ps(\fp). By definition of E, the tile contributes zero to the sum on the left-hand side of eqanti-0.5 unless \scI(\fp)\cap \scI(\fp_{\mfa}) \neq \emptyset, which we may assume. With \ps(\fp_{\mfa})<\ps(\fp) and the dyadic property dyadicproperty we conclude \scI(\fp_{\mfa})\subset \scI(\fp). We conclude from \fp \in \mathfrak{A}_{\mfa,N} that \mfa \in B_\fp(\fcc(\fp), 2^{N+1}). With Lemma 1.6.3.1 and the assumption on \fp_\mfa, we conclude 2^{N+3}\fp_{\mfa} \lesssim 2^{N+3}\fp. By definition definee2 of E_2, we conclude E(\fp)\cap G \cap \scI(\fp_{\mfa}) \subset E_2(2^{N+3},\fp_{\mfa}). Using disjointedness of the various E(\fp) with \fp\in \mathfrak{A} by Lemma 1.6.1.1, we obtain eqanti-0.5. This proves the lemma.

Lemma1.6.3.4
Statement uses 2
Statement dependency previews
Preview
Lemma 1.6.3.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1markupTeXL∃∀N

Let \mfa\in Q(X) and let N\ge 0 be an integer. Then we have \sum_{\fp\in\mathfrak{A}_{\mfa,N}}\mu(E(\fp)\cap G) \le 2^{101a^3+Na}\dens_1(\mathfrak{A})\mu\left(\cup_{\fp\in\mathfrak{A}}I_{\fp}\right).

Lean code for Lemma1.6.3.41 theorem
  • complete
    theorem Antichain.global_antichain_density.{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)} (h𝔄 : IsAntichain (fun x1 x2  x1  x2) 𝔄)
      (ϑ : (Set.range Q)) (N : ) :
       p  (Antichain.𝔄_aux 𝔄 (↑ϑ) N).toFinset,
          MeasureTheory.volume (E p  G) 
        (Antichain.C6_3_4 a N) * dens₁ 𝔄 *
          MeasureTheory.volume (⋃ p  𝔄, (𝓘 p))
    theorem Antichain.global_antichain_density.{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)}
      (h𝔄 :
        IsAntichain (fun x1 x2  x1  x2) 𝔄)
      (ϑ : (Set.range Q)) (N : ) :
      
          p 
            (Antichain.𝔄_aux 𝔄 (↑ϑ)
                N).toFinset,
          MeasureTheory.volume (E p  G) 
        (Antichain.C6_3_4 a N) * dens₁ 𝔄 *
          MeasureTheory.volume
            (⋃ p  𝔄, (𝓘 p))
    Lemma 6.3.4. 
Proof for Lemma 1.6.3.4
uses 0

Proof. Fix \mfa and N. Let \mathfrak{A}' be the set of \fp\in\mathfrak{A}_{\mfa,N} such that \scI(\fp)\cap G is not empty and s(\fp) > -S. Let \mathfrak{A}_{-S} be the set of \fp\in\mathfrak{A}_{\mfa,N} such that \scI(\fp)\cap G is not empty and s(\fp) = -S. Then we have \sum_{\fp\in\mathfrak{A}_{\mfa,N}}\mu(E(\fp)\cap G) = \sum_{\fp\in\mathfrak{A}'}\mu(E(\fp)\cap G) + \sum_{\fp\in\mathfrak{A}_{-S}}\mu(E(\fp)\cap G).

We start by estimating the contribution of \mathfrak{A}_{-S}. Let \mathcal{L}_{-S} be the collection of dyadic cubes \scI(\fp) with \fp \in \mathfrak{A}_{-S}. They all have scale -S, by definition of \mathcal{L}_{-S}, and hence they are pairwise disjoint by the dyadic property dyadicproperty. We write \sum_{\fp\in\mathfrak{A}_{-S}}\mu(E(\fp)\cap G) = \sum_{L \in \mathcal{L}_{-S}} \sum_{\fp\in\mathfrak{A}_{-S}, \scI(\fp) = L} \mu(E(\fp)\cap G), and using Lemma 1.6.3.2, we estimate \le 2^{a(N+5)} \dens_1(\mathfrak{A}) \sum_{L \in \mathcal{L}_{-S}} \mu(L) \le 2^{a(N+5)} \dens_1(\mathfrak{A}) \mu\left(\cup_{\fp\in\mathfrak{A}}I_{\fp}\right).

We turn to \mathfrak{A}'. Let \mathcal{L} be the collection of dyadic cubes I\in\mathcal{D} such that I \le \scI(\fp) for some \fp\in\mathfrak{A}' and such that \scI(\fp)\not \subset I for all \fp\in\mathfrak{A}'. By coverdyadic, for each \fp \in \mathfrak{A}' and each x\in \scI(\fp)\cap G, there is I\in \mathcal{D} with s(I)=-S and x\in I. By dyadicproperty, we have I\subset \scI(\fp). Since for all \fp' \in \mathfrak{A}' we have s(\fp') > -S, we have I \in \mathcal{L}. Hence \scI(\fp)\subset \bigcup\{I\in \mathcal{D}: s(I)=-S, I\subset \scI(\fp)\}\subset \bigcup \mathcal{L}. As each I\in \mathcal{L} satisfies I\subset \scI(\fp) for some \fp in \mathfrak{A'}, we conclude \bigcup\mathcal{L}=\bigcup_{\fp \in \mathfrak{A}'}\scI(\fp). Let \mathcal{L}^* be the set of maximal elements in \mathcal{L} with respect to set inclusion. By dyadicproperty, the elements in \mathcal{L}^* are pairwise disjoint and we have \bigcup\mathcal{L}^*=\bigcup_{\fp \in \mathfrak{A}'}\scI(\fp). Using the partition eqdecAprime into elements of \mathcal{L} in eqanti0, it suffices to show for each L\in \mathcal{L}^* \sum_{\fp\in\mathfrak{A}'}\mu(E(\fp)\cap G \cap L) \le 2^{101a^3+aN} \dens_1(\mathfrak{A})\mu(L).

Fix L\in \mathcal{L}^*. By definition of \mathcal{L}^*, there exists an element \fp'\in \mathfrak{A}' such that L\subset \scI(\fp'). Pick such an element \fp' in \mathfrak{A} with minimal \ps(\fp'). As \scI(\fp')\not \subset L by definition of L, we have with dyadicproperty that s(L)< \ps(\fp'). In particular s(L)<S, thus L \ne I_0 and hence by subsetmaxcube there exists a cube J \in \mathcal{D} with L \subsetneq J. By coverdyadic, there is an L'\in \mathcal{D} with s(L')=s(L)+1 and L \le L'. By dyadicproperty, we have L\subset L'.

We split the left-hand side of eqanti0 as \sum_{\fp\in\mathfrak{A}':\scI(\fp)=L'}\mu(E(\fp)\cap G\cap L) + \sum_{\fp\in\mathfrak{A}':\scI(\fp)\neq L'}\mu(E(\fp)\cap G\cap L).

We first estimate eqanti1 with Lemma 1.6.3.2 by \le \sum_{\fp\in\mathfrak{A}':\scI(\fp)=L'}\mu(E(\fp)\cap G\cap L')\le 2^{a(N+5)}\dens_1(\mathfrak{A})\mu(L').

We turn to eqanti2. Consider the element \fp'\in \mathfrak{A}' as above with L\subset \scI(\fp') and s(L)<\ps(\fp'). As L\subset L' and s(L')=s(L)+1, we conclude with the dyadic property that L'\subset \scI(\fp'). By maximality of L, we have L'\not\in \mathcal{L}. This together with the existence of the given \fp'\in \mathfrak{A} with L'\subset \scI(\fp') shows by definition of \mathcal{L} that there exists \fp''\in \mathfrak{A}' with \scI(\fp'')\subset L'.

If \scI(\fp'') = L', then we set \fp_{\mfa} = \fp'' and note that as \fp'' \in \mathfrak{A}_{\mfa,N} \mfa \in B(\fcc(\fp''), 2^{N+1}).

If \scI(\fp'') \ne L', then it follows that s(\fp'') < s(L'). By the covering property eq-dis-freq-cover, there exists a unique \fp_{\mfa} with \scI(\fp_{\mfa})=L' such that \mfa\in \fc(\fp_{\mfa}). We take this as the definition of \fp_\mfa in this case. Note that \mfa\in B(\fcc(\fp_{\mfa}), 1) so by Lemma 1.6.3.1, we conclude 2^{N+3}\fp'' \lesssim 2^{N+3}\fp_{\mfa}. This clearly also holds in the case \scI(\fp'') = L', since then \fp'' = \fp_\mfa. Furthermore, in both cases it also holds that \mfa\in B_{\fp_{\mfa}}(\fcc(\fp_{\mfa}), 2^{N+1}).

As \fp''\in \mathfrak{A}', we have by definition definedens1 of \dens_1 that \mu(E_2(2^{N+3}, \fp_{\mfa}))\le 2^{Na+3a}\dens_1(\mathfrak{A}) {\mu(L')}. Now let \fp be any tile in the summation set in eqanti2, that is, \fp\in \mathfrak{A}' and \scI(\fp)\neq L'. Then \scI(\fp)\cap L\neq \emptyset. It follows by the dyadic property dyadicproperty and the definition of L that L\subset \scI(\fp) and L\neq \scI(\fp). By dyadicproperty, we have s(L)<\ps(\fp) and thus s(L')\le \ps(\fp). By dyadicproperty again, we have L'\subset \scI(\fp). As L'\neq \scI(\fp), we conclude s(L)<\ps(\fp). By Lemma 1.6.3.3, we can thus estimate eqanti2 by \sum_{\fp\in\mathfrak{A}':\scI(\fp)\neq L'}\mu(E(\fp)\cap G\cap L') \le \mu (E_2(2^{N+3},\fp_{\mfa})).

With the decomposition in eqanti1 and eqanti2 and the estimates equanti1.5, eqanti-0.5, pmfadens we obtain the estimate \sum_{\fp\in\mathfrak{A}'}\mu(E(\fp)\cap G \cap L) \le (2^{a(N+5)}+2^{Na+3a})\dens_1(\mathfrak{A})\mu(L').

Using s(L')=s(L)+1 and D=2^{100a^2} and the squeezing property eq-vol-sp-cube and the doubling property doublingx 100a^2+4 times, we obtain \mu(L')\le 2^{100a^3+4a}\mu(L). Inserting in eqanti3.14, adding the estimate eq_minus_S and using a\ge 4 gives eqanti0. This completes the proof of the lemma.

We turn to the proof of Lemma 1.6.1.6.

Proof for Lemma 1.6.1.6
uses 0

Proof of Lemma 1.6.1.6. Using that \mathfrak{A} is the disjoint union of the \mathfrak{A}_{\mfa,N} with N\ge 0, we estimate the left-hand side eq-antichain-Lp with the triangle inequality by \le \sum_{N\ge 0} \left\|\sum_{\fp\in \mathfrak{A}_{\mfa,N}} 2^{-N/(2a^2+a^3)}\mathbf{1}_{E(\fp)} \mathbf{1}_G\right\|_{p}. We consider each individual term in this sum and estimate its p-th power. Using that for each x\in X by Lemma 1.6.1.1 there is at most one \fp\in \mathfrak{A} with x\in E(\fp), we have \left\|\sum_{\fp\in \mathfrak{A}_{\mfa,N}} 2^{-N/(2a^2+a^3)}\mathbf{1}_{E(\fp)} \mathbf{1}_G\right\|_{p}^p =\int\Big(\sum_{\fp\in \mathfrak{A}_{\mfa,N}}2^{-N/(2a^2+a^3)}\mathbf{1}_{E(\fp)\cap G}(x)\Big)^p\, d\mu(x) =\int\sum_{\fp\in\mathfrak{A}_{\mfa,N}}2^{-pN/(2a^2+a^3)}\mathbf{1}_{E(\fp)\cap G}(x)\, d\mu(x) = 2^{-pN/(2a^2+a^3)} \sum_{\fp\in\mathfrak{A}_{\mfa,N}}\mu(E(\fp)\cap G).

Using Lemma 1.6.3.4, we estimate the last display by \le 2^{-pN/(2a^2+a^3)+101a^3+Na}\dens_1(\mathfrak{A})\mu\left(\cup_{\fp\in\mathfrak{A}}\scI(\fp)\right). Using that a\ge 4 and since p = 4a^4, we have pN/(2a^2+a^3)\ge 4a^4N/(3a^3) \ge Na+N. Hence we have for eqanti21 the upper bound \le 2^{101a^3-N}\dens_1(\mathfrak{A})\mu\left(\cup_{\fp\in\mathfrak{A}}\scI(\fp)\right).

Taking the p-th root and summing over N\ge 0 gives for eqanti23 the upper bound \le \left(\sum_{N\ge 0} 2^{-N/p}\right)2^{101a^3/p}\dens_1(\mathfrak{A})^{{\frac{1}{p}}}\mu\left(\cup_{\fp\in\mathfrak{A}}\scI(\fp)\right)^{{\frac{1}{p}}} = \left(1-2^{-1/p}\right)^{-1} 2^{101a^3/p} \dens_1(\mathfrak{A})^{\frac 1p}\mu\left(\cup_{\fp\in\mathfrak{A}}\scI(\fp)\right)^{\frac 1p}. Using that p = 4a^4 and a \ge 4, this proves the lemma.