Carleson Blueprint

1.10. Two-sided Metric Space Carleson🔗

We prove a variant of Theorem 1.1.1.1 for a two-sided Calderon--Zygmund kernel on the doubling metric measure space (X,\rho,\mu,a). This means a one-sided Calderon--Zygmund kernel K which additionally satisfies, for all x,x',y\in X with x\ne y and 2\rho(x,x')\le \rho(x,y), |K(x,y)-K(x',y)| \le \left(\frac{\rho(x,x')}{\rho(x,y)}\right)^{\frac1a} \frac{2^{a^3}}{V(x,y)}. By the additional regularity, we can weaken the assumption nontanbound to a family of operators that is easier to work with in applications. Namely, for r>0, x\in X, and a bounded measurable function f:X\to\mathbb{C} supported on a set of finite measure, define T_r f(x) := \int_{r\le\rho(x,y)} K(x,y)f(y)\,d\mu(y) = \int_{X\setminus B(x,r)} K(x,y)f(y)\,d\mu(y).

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

For all integers a\ge 4 and real numbers 1<q\le 2, the following holds. Let (X,\rho,\mu,a) be a doubling metric measure space. Let \Mf be a cancellative compatible collection of functions and let K be a two-sided Calderon--Zygmund kernel on (X,\rho,\mu,a). Assume that for every bounded measurable function g on X supported on a set of finite measure and all r>0 we have \|T_r g\|_2 \le 2^{a^3}\|g\|_2. Then for all Borel sets F and G in X and all Borel functions f:X\to\mathbb{C} with |f|\le\mathbf{1}_F, we have, with T defined in def-main-op, \left|\int_G T f\,d\mu\right| \le \frac{2^{474a^3}}{(q-1)^6} \mu(G)^{1-\frac1q}\mu(F)^{\frac1q}.

Lean code for Theorem1.10.11 theorem
  • complete
    theorem two_sided_metric_carleson.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {q q' : NNReal}
      {F G : Set X} {K : X  X  } [IsTwoSidedKernel a K]
      [CompatibleFunctions  X (defaultA a)] [IsCancellative X (defaultτ a)]
      (ha : 4  a) (hq : q  Set.Ioc 1 2) (hqq' : q.HolderConjugate q')
      (hF : MeasurableSet F) (hG : MeasurableSet G)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2
            MeasureTheory.volume MeasureTheory.volume (C_Ts a))
      {f : X  } (hmf : Measurable f)
      (hf :  (x : X), f x  F.indicator 1 x) :
      ∫⁻ (x : X) in G, carlesonOperator K f x 
        (C10_0_1 a q) * MeasureTheory.volume G ^ (↑q')⁻¹ *
          MeasureTheory.volume F ^ (↑q)⁻¹
    theorem two_sided_metric_carleson.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {q q' : NNReal} {F G : Set X}
      {K : X  X  } [IsTwoSidedKernel a K]
      [CompatibleFunctions  X (defaultA a)]
      [IsCancellative X (defaultτ a)]
      (ha : 4  a) (hq : q  Set.Ioc 1 2)
      (hqq' : q.HolderConjugate q')
      (hF : MeasurableSet F)
      (hG : MeasurableSet G)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType
            (czOperator K r) 2 2
            MeasureTheory.volume
            MeasureTheory.volume (C_Ts a))
      {f : X  } (hmf : Measurable f)
      (hf :
         (x : X), f x  F.indicator 1 x) :
      ∫⁻ (x : X) in G,
          carlesonOperator K f x 
        (C10_0_1 a q) *
            MeasureTheory.volume G ^ (↑q')⁻¹ *
          MeasureTheory.volume F ^ (↑q)⁻¹

For the remainder of this chapter, fix an integer a\ge 4, a doubling metric measure space (X,\rho,\mu,a) and a two-sided Calderon--Zygmund kernel K as in Theorem 1.10.1. The following lemma is proved in Proof of Cotlar's Inequality.

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

Assume two-sided-Hr-bound-assumption holds. Then, for every bounded measurable function g : X \to \C supported on a set of finite measure, we have \|T_*g\|_2\le 2^{3a^3}\|g\|_2.

Lean code for Lemma1.10.21 theorem
  • theorem nontangential_from_simple.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {K : X  X  }
      [IsTwoSidedKernel a K] (ha : 4  a)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2
            MeasureTheory.volume MeasureTheory.volume (C_Ts a)) :
      MeasureTheory.HasBoundedStrongType (nontangentialOperator K) 2 2
        MeasureTheory.volume MeasureTheory.volume (C10_0_2 a)
    theorem nontangential_from_simple.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {K : X  X  } [IsTwoSidedKernel a K]
      (ha : 4  a)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType
            (czOperator K r) 2 2
            MeasureTheory.volume
            MeasureTheory.volume (C_Ts a)) :
      MeasureTheory.HasBoundedStrongType
        (nontangentialOperator K) 2 2
        MeasureTheory.volume
        MeasureTheory.volume (C10_0_2 a)
    Lemma 10.0.2. The formal statement includes the measurability of the operator. 
Proof for Theorem 1.10.1
uses 0

Proof of Theorem 1.10.1. Let 1<q\le 2 be a real number. Let \Theta be a cancellative compatible collection of functions. By the assumption two-sided-Hr-bound-assumption, we can apply Lemma 1.10.2 to obtain, for every bounded measurable g:X\to\C supported on a set of finite measure, \|T_*g\|_2\le 2^{3a^3}\|g\|_2. Define K'(x,y):= 2^{-2a^3} K(x,y). Then K' is a two-sided Calderon--Zygmund kernel on (X,\rho,\mu,a). Denote the corresponding maximally truncated non-tangential singular operator by T_*' and the corresponding generalized Carleson operator by T'. With original-operator-assumption, we obtain for g as above \|T_*'g\|_2\le 2^{a^3}\|g\|_2. Applying Theorem 1.1.1.1 for K' yields that for all Borel sets F and G in X and all Borel functions f:X\to\C with |f|\le \mathbf{1}_F, we have \left|\int_G T'f\,\mathrm{d}\mu\right| \le \frac{2^{450a^3}}{(q-1)^6} \mu(G)^{1-\frac1q}\mu(F)^{\frac1q}. This finishes the proof since, for all x\in X, T'f(x)=2^{-2a^3}Tf(x).

The proof of Lemma 1.10.2 relies on the following auxiliary lemma, which is proved in Calderon--Zygmund Decomposition.

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

Let f:X\to\C be a bounded measurable function supported on a set of finite measure and assume for some r>0 that for every bounded measurable function g:X\to\C supported on a set of finite measure, \|T_rg\|_2\le 2^{a^3}\|g\|_2. Then for all \alpha>0, we have \mu\left(\{x\in X:|T_rf(x)|>\alpha\}\right) \le \frac{2^{a^3+19a}}{\alpha}\int |f(y)|\,d\mu(y).

Lean code for Lemma1.10.31 theorem
  • theorem czOperator_weak_1_1.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r : }
      {K : X  X  } [IsTwoSidedKernel a K] (ha : 4  a) (hr : 0 < r)
      (hT :
        MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2
          MeasureTheory.volume MeasureTheory.volume (C_Ts a)) :
      MeasureTheory.HasBoundedWeakType (czOperator K r) 1 1
        MeasureTheory.volume MeasureTheory.volume (C10_0_3 a)
    theorem czOperator_weak_1_1.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r : } {K : X  X  }
      [IsTwoSidedKernel a K] (ha : 4  a)
      (hr : 0 < r)
      (hT :
        MeasureTheory.HasBoundedStrongType
          (czOperator K r) 2 2
          MeasureTheory.volume
          MeasureTheory.volume (C_Ts a)) :
      MeasureTheory.HasBoundedWeakType
        (czOperator K r) 1 1
        MeasureTheory.volume
        MeasureTheory.volume (C10_0_3 a)
    Lemma 10.0.3, formulated differently. The blueprint version is basically this after
    unfolding `HasBoundedWeakType`, `wnorm` and `wnorm'`. 

Throughout Calderon--Zygmund Decomposition and Proof of Cotlar's Inequality, for any measurable bounded function w:X\to\C, let Mw:X\to[0,\infty) denote the corresponding Hardy--Littlewood maximal function defined in Theorem 1.2.6. In some cases a stronger formalization of Theorem 1.2.6 is used, where w is not necessarily bounded; in particular it is applied to T_rg. Apart from Theorem 1.2.6, these two subsections have no dependencies in the previous chapters.

1.10.1. Proof of Cotlar's Inequality🔗

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

For all real numbers x\ge 4, \sum_{n=0}^\infty 2^{-\frac{n}{x}}\le 2^x.

Lean code for Lemma1.10.1.11 theorem
  • complete
    theorem geometric_series_estimate {x : } (hx : 2  x) :
      ∑' (n : ), 2 ^ (-n / x)  2 ^ x
    theorem geometric_series_estimate {x : }
      (hx : 2  x) :
      ∑' (n : ), 2 ^ (-n / x)  2 ^ x
    Lemma 10.1.1 
Proof for Lemma 1.10.1.1
uses 0

Proof. By convexity, for all 0\le\lambda\le1, 2^{\lambda(-\frac14)}\le \lambda 2^{-\frac14}+(1-\lambda)2^0. For \lambda:=\frac4x, we obtain 2^{-\frac1x}\le 1-(1-2^{-\frac14})\frac4x. We conclude \sum_{n=0}^\infty 2^{-\frac nx} =\frac1{1-2^{-\frac1x}} \le\frac1{4(1-2^{-\frac14})}x\le2^x.

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

Let 0<r, x\in X, and let g:X\to\C be a bounded measurable function supported on a set of finite measure. Then for all x' with \rho(x,x')\le r, we have \left|T_r g(x)-T_r g(x')\right| \le 2^{a^3+2a+2}Mg(x).

Lean code for Lemma1.10.1.21 theorem
  • theorem estimate_x_shift.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r : }
      {K : X  X  } {x x' : X} [IsTwoSidedKernel a K] (ha : 4  a)
      {g : X  } (hg : BoundedFiniteSupport g MeasureTheory.volume)
      (hr : 0 < r) (hx : dist x x'  r) :
      edist (czOperator K r g x) (czOperator K r g x') 
        (C10_1_2 a) * globalMaximalFunction MeasureTheory.volume 1 g x
    theorem estimate_x_shift.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r : } {K : X  X  } {x x' : X}
      [IsTwoSidedKernel a K] (ha : 4  a)
      {g : X  }
      (hg :
        BoundedFiniteSupport g
          MeasureTheory.volume)
      (hr : 0 < r) (hx : dist x x'  r) :
      edist (czOperator K r g x)
          (czOperator K r g x') 
        (C10_1_2 a) *
          globalMaximalFunction
            MeasureTheory.volume 1 g x
    Lemma 10.1.2 
Proof for Lemma 1.10.1.2
uses 0

Proof. By definition, \left|T_rg(x)-T_rg(x')\right| =\left|\int_{r\le\rho(x,y)}K(x,y)g(y)\,d\mu(y) -\int_{r\le\rho(x',y)}K(x',y)g(y)\,d\mu(y)\right|. We split the first integral into the domains r\le\rho(x,y)<2r and 2r\le\rho(x,y). The integral over the first domain is estimated by \int_{r\le\rho(x,y)<2r}|K(x,y)||g(y)|\,d\mu(y). For the second domain, \rho(x,x')\le r and the triangle inequality imply r\le\rho(x',y). We therefore combine it with the corresponding part of the second integral and estimate it by \left|\int_{2r\le\rho(x,y)}(K(x,y)-K(x',y))g(y)\,d\mu(y)\right|. The remaining part of the second integral is estimated by \int_{r\le\rho(x',y),\ r\le\rho(x,y)<2r}|K(x',y)||g(y)|\,d\mu(y).

Using the bound on K and the doubling condition, the first term is at most \frac{2^{a^3}}{\mu(B(x,r))} \int_{r\le\rho(x,y)<2r}|g(y)|\,d\mu(y) \le \frac{2^{a^3}2^a}{\mu(B(x,2r))} \int_{\rho(x,y)<2r}|g(y)|\,d\mu(y) \le 2^{a^3+a}Mg(x). Similarly, on the domain of the third term the triangle inequality and the assumption on x' give \rho(x',y)<3r, so that term is at most \frac{2^{a^3}}{\mu(B(x',r))} \int_{\rho(x',y)<4r}|g(y)|\,d\mu(y) \le 2^{a^3+2a}Mg(x).

For the remaining term, kernel smoothness gives \int_{2r\le\rho(x,y)} \left(\frac{\rho(x,x')}{\rho(x,y)}\right)^{\frac1a} \frac{2^{a^3}}{V(x,y)}|g(y)|\,d\mu(y). Decomposing into dyadic annuli and using the triangle inequality bounds this by \begin{aligned} &\sum_{j=1}^\infty\int_{2^jr\le\rho(x,y)<2^{j+1}r} \left(\frac{\rho(x,x')}{\rho(x,y)}\right)^{\frac1a} \frac{2^{a^3}}{V(x,y)}|g(y)|\,d\mu(y)\\ &\quad\le \sum_{j=1}^\infty 2^{-\frac ja} \frac{2^{a^3+a}}{\mu(B(x,2^{j+1}r))} \int_{\rho(x,y)<2^{j+1}r}|g(y)|\,d\mu(y)\\ &\quad\le 2^{a^3+a}\sum_{j=1}^\infty2^{-\frac ja}Mg(x) \le 2^{a^3+2a}Mg(x), \end{aligned} where the last step uses Lemma 1.10.1.1. Summing the three estimates proves the lemma.

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

Let 0<r\le R, x\in X, and let g:X\to\C be a bounded measurable function supported on a set of finite measure. Then for all x'\in X with \rho(x,x')\le\frac R4, we have \left|T_Rg(x)\right| \le \left|T_r\left(g-g\mathbf{1}_{B(x,\frac R2)}\right)(x')\right| +2^{a^3+4a+1}Mg(x).

Lean code for Lemma1.10.1.31 theorem
  • theorem cotlar_control.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r R : }
      {K : X  X  } {x x' : X} [IsTwoSidedKernel a K] (ha : 4  a)
      {g : X  } (hg : BoundedFiniteSupport g MeasureTheory.volume)
      (hr : r  Set.Ioc 0 R) (hx : dist x x'  R / 4) :
      czOperator K R g x‖ₑ 
        czOperator K r ((Metric.ball x (R / 2)).indicator g) x'‖ₑ +
          (C10_1_3 a) * globalMaximalFunction MeasureTheory.volume 1 g x
    theorem cotlar_control.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r R : } {K : X  X  } {x x' : X}
      [IsTwoSidedKernel a K] (ha : 4  a)
      {g : X  }
      (hg :
        BoundedFiniteSupport g
          MeasureTheory.volume)
      (hr : r  Set.Ioc 0 R)
      (hx : dist x x'  R / 4) :
      czOperator K R g x‖ₑ 
        czOperator K r
              ((Metric.ball x
                      (R / 2)).indicator
                g)
              x'‖ₑ +
          (C10_1_3 a) *
            globalMaximalFunction
              MeasureTheory.volume 1 g x
    Lemma 10.1.3 
Proof for Lemma 1.10.1.3
uses 0

Proof. Let x and x' be given with \rho(x,x')\le\frac R4. By Lemma 1.10.1.2, |T_Rg(x)|\le |T_Rg(x')|+2^{a^3+2a+2}Mg(x). We have T_Rg(x')=\int_{R\le\rho(x',y)}K(x',y)g(y)\,d\mu(y). On this domain, \frac R2\le\rho(x,y), hence \begin{aligned} T_Rg(x') &=\int_{R\le\rho(x',y)}K(x',y) \left(g-g\mathbf{1}_{B(x,\frac R2)}\right)(y)\,d\mu(y)\\ &=T_R\left(g-g\mathbf{1}_{B(x,\frac R2)}\right)(x'). \end{aligned} It follows that |T_Rg(x)|\le \left|T_R\left(g-g\mathbf{1}_{B(x,\frac R2)}\right)(x')\right| +2^{a^3+2a+2}Mg(x). Moreover, \begin{aligned} &(T_r-T_R)\left(g-g\mathbf{1}_{B(x,\frac R2)}\right)(x')\\ &\quad=\int_{B(x',R)\setminus B(x',r)}K(x',y) \left(g-g\mathbf{1}_{B(x,\frac R2)}\right)(y)\,d\mu(y)\\ &\quad=\int_{B(x',R)\setminus(B(x',r)\cup B(x,\frac R2))} K(x',y)g(y)\,d\mu(y). \end{aligned} Since \frac R2\le\rho(x,y) together with \rho(x,x')\le\frac R4 implies \frac R4\le\rho(x',y), the absolute value of this integral is at most \begin{aligned} &\frac{2^{a^3}}{\mu(B(x',\frac R4))} \int_{B(x,2R)\setminus B(x',\frac R4)}|g(y)|\,d\mu(y)\\ &\quad\le \frac{2^{a^3+a}}{\mu(B(x',\frac R2))} \int_{B(x,2R)}|g(y)|\,d\mu(y)\\ &\quad\le 2^{a^3+a} \frac{\mu(B(x,2R))}{\mu(B(x,\frac R4))}Mg(x) \le 2^{a^3+4a}Mg(x). \end{aligned} The triangle inequality now proves the lemma.

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

Assume the two-sided T_r bound. Let 0<r\le R, x\in X, and let g:X\to\C be a bounded measurable function supported on a set of finite measure. Let F_1 be the set of all x'\in B(x,\frac R4) such that |T_rg(x')|>4M(T_rg)(x). Then \mu(F_1)\le\mu(B(x,\frac R4))/4.

Moreover, let F_2 be the set of all x'\in B(x,\frac R4) such that \left|T_r\left(g\mathbf{1}_{B(x,\frac R2)}\right)(x')\right| >2^{a^3+20a+2}Mg(x). Then \mu(F_2)\le\mu(B(x,\frac R4))/4.

Lean code for Lemma1.10.1.42 theorems
  • theorem cotlar_set_F₁.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r R : }
      {K : X  X  } {x : X} [IsTwoSidedKernel a K] (hr : 0 < r)
      (hR : r  R) {g : X  }
      (hg : BoundedFiniteSupport g MeasureTheory.volume) :
      (MeasureTheory.volume.restrict (Metric.ball x (R / 4)))
          {x' |
            4 *
                globalMaximalFunction MeasureTheory.volume 1
                  (czOperator K r g) x <
              czOperator K r g x'‖ₑ} 
        MeasureTheory.volume (Metric.ball x (R / 4)) / 4
    theorem cotlar_set_F₁.{u_1} {X : Type u_1} {a : }
      [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r R : } {K : X  X  } {x : X}
      [IsTwoSidedKernel a K] (hr : 0 < r)
      (hR : r  R) {g : X  }
      (hg :
        BoundedFiniteSupport g
          MeasureTheory.volume) :
      (MeasureTheory.volume.restrict
            (Metric.ball x (R / 4)))
          {x' |
            4 *
                globalMaximalFunction
                  MeasureTheory.volume 1
                  (czOperator K r g) x <
              czOperator K r g x'‖ₑ} 
        MeasureTheory.volume
            (Metric.ball x (R / 4)) /
          4
    Part 1 of Lemma 10.1.4 about `F₁`. 
  • theorem cotlar_set_F₂.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r R : }
      {K : X  X  } {x : X} [IsTwoSidedKernel a K] (ha : 4  a)
      (hr : 0 < r) (hR : r  R)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2
            MeasureTheory.volume MeasureTheory.volume (C_Ts a))
      {g : X  } (hg : BoundedFiniteSupport g MeasureTheory.volume) :
      (MeasureTheory.volume.restrict (Metric.ball x (R / 4)))
          {x' |
            (C10_1_4 a) *
                globalMaximalFunction MeasureTheory.volume 1 g x <
              czOperator K r ((Metric.ball x (R / 2)).indicator g) x'‖ₑ} 
        MeasureTheory.volume (Metric.ball x (R / 4)) / 4
    theorem cotlar_set_F₂.{u_1} {X : Type u_1} {a : }
      [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r R : } {K : X  X  } {x : X}
      [IsTwoSidedKernel a K] (ha : 4  a)
      (hr : 0 < r) (hR : r  R)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType
            (czOperator K r) 2 2
            MeasureTheory.volume
            MeasureTheory.volume (C_Ts a))
      {g : X  }
      (hg :
        BoundedFiniteSupport g
          MeasureTheory.volume) :
      (MeasureTheory.volume.restrict
            (Metric.ball x (R / 4)))
          {x' |
            (C10_1_4 a) *
                globalMaximalFunction
                  MeasureTheory.volume 1 g x <
              czOperator K r
                  ((Metric.ball x
                        (R / 2)).indicator
                    g)
                  x'‖ₑ} 
        MeasureTheory.volume
            (Metric.ball x (R / 4)) /
          4
    Part 2 of Lemma 10.1.4 about `F₂`. 
Proof for Lemma 1.10.1.4
uses 0

Proof. Let r, R, x, and g be given. If M(T_rg)(x)=0, then T_rg is zero almost everywhere and the estimate for F_1 is trivial. Assume M(T_rg)(x)>0. Then \begin{aligned} M(T_rg)(x) &\ge \frac1{\mu(B(x,\frac R4))} \int_{B(x,\frac R4)}|T_rg(x')|\,dx'\\ &\ge \frac1{\mu(B(x,\frac R4))} \int_{F_1}4M(T_rg)(x)\,dx'. \end{aligned} Dividing by M(T_rg)(x) gives 1\ge\frac4{\mu(B(x,\frac R4))}\mu(F_1), which is the desired bound for F_1.

For F_2, we may similarly assume Mg(x)>0. By Lemma 1.10.3, its measure is at most \frac{2^{a^3+19a}}{2^{a^3+20a+2}Mg(x)} \int\left|g\mathbf{1}_{B(x,\frac R2)}\right|(y)\,d\mu(y) \le \frac1{2^{a+2}Mg(x)}\mu(B(x,\tfrac R2))Mg(x) \le\frac{\mu(B(x,\frac R4))}{4}. This proves the desired bound for F_2.

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

Assume the two-sided T_r bound. Let 0<r\le R, x\in X, and let g:X\to\C be a bounded measurable function supported on a set of finite measure. Then |T_Rg(x)|\le 2^2M(T_rg)(x)+2^{a^3+20a+3}Mg(x).

Lean code for Lemma1.10.1.51 theorem
  • theorem cotlar_estimate.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r R : }
      {K : X  X  } {x : X} [IsTwoSidedKernel a K] (ha : 4  a)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2
            MeasureTheory.volume MeasureTheory.volume (C_Ts a))
      {g : X  } (hg : BoundedFiniteSupport g MeasureTheory.volume)
      (hr : r  Set.Ioc 0 R) :
      czOperator K R g x‖ₑ 
        4 *
            globalMaximalFunction MeasureTheory.volume 1 (czOperator K r g)
              x +
          (C10_1_5 a) * globalMaximalFunction MeasureTheory.volume 1 g x
    theorem cotlar_estimate.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r R : } {K : X  X  } {x : X}
      [IsTwoSidedKernel a K] (ha : 4  a)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType
            (czOperator K r) 2 2
            MeasureTheory.volume
            MeasureTheory.volume (C_Ts a))
      {g : X  }
      (hg :
        BoundedFiniteSupport g
          MeasureTheory.volume)
      (hr : r  Set.Ioc 0 R) :
      czOperator K R g x‖ₑ 
        4 *
            globalMaximalFunction
              MeasureTheory.volume 1
              (czOperator K r g) x +
          (C10_1_5 a) *
            globalMaximalFunction
              MeasureTheory.volume 1 g x
    Lemma 10.1.5 
Proof for Lemma 1.10.1.5
uses 0

Proof. By Lemma 1.10.1.4, the set of all x'\in B(x,\frac R4) such that at least one of the two exceptional conditions is satisfied has measure less than or equal to \mu(B(x,\frac R4))/2, and hence is not all of B(x,\frac R4). Pick an x'\in B(x,\frac R4) such that both conditions are not satisfied. Applying Lemma 1.10.1.3 for this x' and using the triangle inequality estimates the left-hand side of the Cotlar estimate by 4M(T_rg)(x)+2^{a^3+20a+2}Mg(x)+2^{a^3+4a+1}Mg(x). This proves the lemma.

For the next lemma, define T_*^rg(x):=\sup_{r<R}\sup_{x'\in B(x,R)}|T_Rg(x')|.

Lemma1.10.1.6
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

Assume the two-sided T_r bound. For every r>0 and every bounded measurable function g supported on a set of finite measure, the function T_*^rg is lower-semicontinuous and \|T_*^rg\|_2\le 2^{a^3+24a+6}\|g\|_2.

Lean code for Lemma1.10.1.62 theorems
  • theorem simple_nontangential_operator.{u_1} {X : Type u_1} {a : }
      [MetricSpace X] [MeasureTheory.DoublingMeasure X (defaultA a)]
      {r : } {K : X  X  } [IsTwoSidedKernel a K] (ha : 4  a)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2
            MeasureTheory.volume MeasureTheory.volume (C_Ts a))
      (hr : 0 < r) :
      MeasureTheory.HasBoundedStrongType (simpleNontangentialOperator K r) 2
        2 MeasureTheory.volume MeasureTheory.volume (C10_1_6 a)
    theorem simple_nontangential_operator.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r : } {K : X  X  }
      [IsTwoSidedKernel a K] (ha : 4  a)
      (hT :
         r > 0,
          MeasureTheory.HasBoundedStrongType
            (czOperator K r) 2 2
            MeasureTheory.volume
            MeasureTheory.volume (C_Ts a))
      (hr : 0 < r) :
      MeasureTheory.HasBoundedStrongType
        (simpleNontangentialOperator K r) 2 2
        MeasureTheory.volume
        MeasureTheory.volume (C10_1_6 a)
    Lemma 10.1.6. The formal statement includes the measurability of the operator.
    See also `simple_nontangential_operator_le` 
  • theorem lowerSemicontinuous_simpleNontangentialOperator.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r : }
      {K : X  X  } {g : X  } :
      LowerSemicontinuous (simpleNontangentialOperator K r g)
    theorem lowerSemicontinuous_simpleNontangentialOperator.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r : } {K : X  X  } {g : X  } :
      LowerSemicontinuous
        (simpleNontangentialOperator K r g)
    Part of Lemma 10.1.6. 
Proof for Lemma 1.10.1.6
uses 0

Proof. For fixed \lambda, rewriting x'\in B(x,R) as x\in B(x',R) gives \{x:T_*^rg(x)>\lambda\} =\bigcup_{r<R}\bigcup_{\{x':|T_Rg(x')|>\lambda\}}B(x',R). The right-hand side is open, hence T_*^rg is lower-semicontinuous by definition.

For the second part, Lemma 1.10.1.2 and the triangle inequality give, for every x\in X, T_*^rg(x)\le 2^{a^3+2a+2}Mg(x)+\sup_{r<R}|T_Rg(x)|. Using Lemma 1.10.1.5 further gives T_*^rg(x) \le 2^{a^3+2a+2}Mg(x)+2^{a^3+20a+3}Mg(x)+2^2M(T_rg)(x). Taking the L^2 norm and applying Theorem 1.2.6 with a=4, p_2=2, and p_1=1, we obtain \begin{aligned} \|T_*^rg\|_2 &\le 2^{a^3+20a+4}\|Mg\|_2+2^2\|M(T_rg)\|_2\\ &\le 2^{a^3+24a+5}\|g\|_2+2^{4a+3}\|T_rg\|_2. \end{aligned} The assumed T_r bound now gives \|T_*^rg\|_2 \le 2^{a^3+24a+5}\|g\|_2+2^{a^3+4a+3}\|g\|_2, which proves the claimed inequality.

To pass from the one-sided truncations in T_r and T_*^r to the two-sided truncation in T_*, the following two lemmas show that the integral in the definition of the non-tangential operator can be exchanged for an integral over the difference of two balls.

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

Let f:X\to\C be a bounded measurable function supported on a set of finite measure, and let x\in X and R>0. Then, for all \epsilon>0, there is some \delta>0 such that \left|\int_{R<\rho(x,y)<R+\delta}K(x,y)f(y)\,d\mu(y)\right|\le\epsilon and \left|\int_{R-\delta<\rho(x,y)<R}K(x,y)f(y)\,d\mu(y)\right|\le\epsilon.

Lean code for Lemma1.10.1.72 theorems
  • theorem small_annulus_right.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {K : X  X  }
      {x : X} [IsTwoSidedKernel a K] {g : X  }
      (hg : BoundedFiniteSupport g MeasureTheory.volume) {R₁ R₂ : }
      (hR₁ : 0 < R₁) :
      ContinuousWithinAt
        (fun R₂   (y : X) in Set.Annulus.oo x R₁ R₂, K x y * g y)
        (Set.Ioo R₁ R₂) R₁
    theorem small_annulus_right.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {K : X  X  } {x : X}
      [IsTwoSidedKernel a K] {g : X  }
      (hg :
        BoundedFiniteSupport g
          MeasureTheory.volume)
      {R₁ R₂ : } (hR₁ : 0 < R₁) :
      ContinuousWithinAt
        (fun R₂ 
           (y : X) in Set.Annulus.oo x R₁ R₂,
            K x y * g y)
        (Set.Ioo R₁ R₂) R₁
    Part of Lemma 10.1.7, reformulated. 
  • theorem small_annulus_left.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {K : X  X  }
      {x : X} [IsTwoSidedKernel a K] {g : X  }
      (hg : BoundedFiniteSupport g MeasureTheory.volume) {R₁ R₂ : }
      (hR₁ : 0  R₁) :
      ContinuousWithinAt
        (fun R   (y : X) in Set.Annulus.oo x R R₂, K x y * g y)
        (Set.Ioo R₁ R₂) R₂
    theorem small_annulus_left.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {K : X  X  } {x : X}
      [IsTwoSidedKernel a K] {g : X  }
      (hg :
        BoundedFiniteSupport g
          MeasureTheory.volume)
      {R₁ R₂ : } (hR₁ : 0  R₁) :
      ContinuousWithinAt
        (fun R 
           (y : X) in Set.Annulus.oo x R R₂,
            K x y * g y)
        (Set.Ioo R₁ R₂) R₂
    Part of Lemma 10.1.7, reformulated 
Proof for Lemma 1.10.1.7
uses 0

Proof. We prove only the second inequality; the first is analogous. The integrand is bounded in X\setminus B(x,\frac R2). Thus, for 0<\delta\le\frac R2, its absolute value is at most \frac{2^{a^3}}{\mu(B(x,\frac R2))}\sup_{y\in X}|f(x)| \cdot\mu\bigl(\{y\in X:R-\delta<\rho(x,y)<R\}\bigr). By continuity from above of \mu, the right factor becomes arbitrarily small as \delta\to0. Hence, for sufficiently small \delta, the whole expression is at most \epsilon.

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

Let f:X\to\C be a bounded measurable function supported on a set of finite measure. For all x\in X, T_*f(x)=\sup_{R_1<R_2}\sup_{x'\in B(x,R_1)} \left|\int_{B(x',R_2)\setminus B(x',R_1)}K(x',y)f(y)\,d\mu(y)\right|.

Lean code for Lemma1.10.1.81 theorem
  • theorem nontangential_operator_boundary.{u_1} {X : Type u_1} {a : }
      [MetricSpace X] [MeasureTheory.DoublingMeasure X (defaultA a)]
      {K : X  X  } {x : X} [IsTwoSidedKernel a K] {f : X  }
      (hf : BoundedFiniteSupport f MeasureTheory.volume) :
      nontangentialOperator K f x =
         R₂,
           R₁  Set.Ioo 0 R₂,
             x'  Metric.ball x R₁,
               (y : X) in Metric.ball x' R₂ \ Metric.ball x' R₁,
                  K x' y * f y‖ₑ
    theorem nontangential_operator_boundary.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {K : X  X  } {x : X}
      [IsTwoSidedKernel a K] {f : X  }
      (hf :
        BoundedFiniteSupport f
          MeasureTheory.volume) :
      nontangentialOperator K f x =
         R₂,
           R₁  Set.Ioo 0 R₂,
             x'  Metric.ball x R₁,
               (y : X) in
                  Metric.ball x' R₂ \
                    Metric.ball x' R₁,
                  K x' y * f y‖ₑ
    Lemma 10.1.8. 
Proof for Lemma 1.10.1.8
uses 0

Proof. We prove two inequalities. Let \epsilon>0, R_1<R_2, and x'\in B(x,R_1). For sufficiently small \delta>0, \begin{aligned} &\left|\int_{R_1<\rho(x',y)<R_2}K(x',y)f(y)\,d\mu(y)\right|\\ &\quad\le \left|\int_{R_1<\rho(x',y)<R_1+\delta}K(x',y)f(y)\,d\mu(y)\right|\\ &\qquad+ \left|\int_{R_1+\delta\le\rho(x',y)<R_2}K(x',y)f(y)\,d\mu(y)\right|. \end{aligned} By Lemma 1.10.1.7, choose \delta so that the first term on the right is at most \epsilon; we may assume R_1+\delta<R_2. The second term is bounded by the right-hand side of the claimed equality. Thus the expression is at most \epsilon+\sup_{R_1<R_2}\sup_{x'\in B(x,R_1)} \left|\int_{B(x',R_2)\setminus B(x',R_1)}K(x',y)f(y)\,d\mu(y)\right|. The inequality remains true after taking the suprema over R_1<R_2 and \rho(x,x')<R_1. Since \epsilon is arbitrary, this proves the first inequality.

For the other direction, let again \epsilon>0, R_1<R_2, and x'\in B(x,R_1). For \delta>0, \begin{aligned} &\left|\int_{B(x',R_2)\setminus B(x',R_1)}K(x',y)f(y)\,d\mu(y)\right|\\ &\quad\le \left|\int_{R_1-\delta<\rho(x',y)<R_1}K(x',y)f(y)\,d\mu(y)\right|\\ &\qquad+ \left|\int_{R_1-\delta<\rho(x',y)<R_2}K(x',y)f(y)\,d\mu(y)\right|. \end{aligned} By Lemma 1.10.1.7, choose \delta so that the first term on the right is at most \epsilon; we may assume \rho(x,x')<R_1-\delta. The second term is bounded by the left-hand side of the claimed equality. Hence the expression is at most \epsilon+\sup_{R_1<R_2}\sup_{x'\in B(x,R_1)} \left|\int_{R_1<\rho(x',y)<R_2}K(x',y)f(y)\,d\mu(y)\right|. Taking the same suprema and letting \epsilon tend to zero proves the second inequality.

Proof for Lemma 1.10.2
uses 0

Proof of Lemma 1.10.2. Fix g as in the lemma. Applying Lemma 1.10.1.6 with a sequence of r tending to zero and using Lebesgue monotone convergence gives \|T_*^0g\|_2\le 2^{a^3+24a+6}\|g\|_2, where T_*^0g(x):=\sup_{0<R}\sup_{x'\in B(x,R)} \left|\int_{X\setminus B(x',R)}K(x',y)g(y)\,d\mu(y)\right|. By Lemma 1.10.1.8 and the triangle inequality, \begin{aligned} T_*g(x) &\le\sup_{0<R_1<R_2}\sup_{x'\in B(x,R_1)} \left|\int_{X\setminus B(x',R_1)}K(x',y)g(y)\,d\mu(y)\right|\\ &\quad+\sup_{0<R_1<R_2}\sup_{x'\in B(x,R_1)} \left|\int_{X\setminus B(x',R_2)}K(x',y)g(y)\,d\mu(y)\right|. \end{aligned} The first integral does not depend on R_2. In the second summand, enlarge the supremum to all x'\in B(x,R_2), after which the integral does not depend on R_1. Therefore \begin{aligned} T_*g(x) &\le\sup_{0<R_1}\sup_{x'\in B(x,R_1)} \left|\int_{X\setminus B(x',R_1)}K(x',y)g(y)\,d\mu(y)\right|\\ &\quad+\sup_{0<R_2}\sup_{x'\in B(x,R_2)} \left|\int_{X\setminus B(x',R_2)}K(x',y)g(y)\,d\mu(y)\right|. \end{aligned} Applying the triangle inequality to the L^2 norm and the bound for T_*^0g twice proves the claimed estimate and completes the proof.

1.10.2. Calderon--Zygmund Decomposition🔗

Calderon--Zygmund decomposition is a tool for extending L^2 bounds to L^p bounds with p<2, or to the weak (1,1) endpoint bound. It is classical and can be found in Stein's book.

The following lemma is Theorem 3.1(b) in Stein's book. Its proof uses Theorem 1.2.6.

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

Let f:X\to\C be bounded, measurable, and supported on a set of finite measure, and let \alpha>0. Then \mu(\{x\in X:Mf(x)>\alpha\}) \le\frac{2^{2a}}{\alpha}\int|f(y)|\,d\mu(y).

Lean code for Lemma1.10.2.11 theorem
  • theorem maximal_theorem.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] :
      MeasureTheory.HasBoundedWeakType
        (globalMaximalFunction MeasureTheory.volume 1) 1 1
        MeasureTheory.volume MeasureTheory.volume (C10_2_1 a)
    theorem maximal_theorem.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)] :
      MeasureTheory.HasBoundedWeakType
        (globalMaximalFunction
          MeasureTheory.volume 1)
        1 1 MeasureTheory.volume
        MeasureTheory.volume (C10_2_1 a)
    Lemma 10.2.1, formulated differently.
    The blueprint version is basically this after unfolding `HasBoundedWeakType`, `wnorm` and `wnorm'`.
    
Proof for Lemma 1.10.2.1
uses 0

Proof. By definition, for each x\in X with Mf(x)>\alpha, there is a ball B_x containing x such that \alpha\mu(B_x)<\int_{B_x}|f(y)|\,d\mu(y). Since \{x\in X:Mf(x)>\alpha\} is open and \mu is inner regular on open sets, it suffices to prove \mu(E)\le\frac{2^{2a}}{\alpha}\int|f(y)|\,d\mu(y) for every compact E contained in this set. By compactness, choose a finite subcollection \mathcal B\subset\{B_x:x\in E\} covering E. Applying the finite ball-union estimate gives \alpha\mu\left(\bigcup\mathcal B\right) \le2^{2a}\int|f(y)|\,d\mu(y). Consequently, \mu(E)\le\mu\left(\bigcup\mathcal B\right) \le\frac{2^{2a}}{\alpha}\int|f(y)|\,d\mu(y).

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

Let f be a bounded measurable function supported on a set of finite measure. Then, for \mu-almost every x, \lim_{n\to\infty}\frac1{\mu(B_n)}\int_{B_n}f(y)\,dy=f(x), where \{B_n\}_{n\ge1} is a sequence of balls containing x, with radii r_n>0 satisfying \lim_{n\to\infty}r_n=0.

Lean code for Lemma1.10.2.21 theorem
  • theorem lebesgue_differentiation.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      (hf : BoundedFiniteSupport f MeasureTheory.volume) :
      ∀ᵐ (x : X),
         c r,
          Filter.Tendsto (fun i   (y : X) in Metric.ball (c i) (r i), f y)
              Filter.atTop (nhds (f x)) 
            Filter.Tendsto r Filter.atTop (nhdsWithin 0 (Set.Ioi 0)) 
               (i : ), x  Metric.ball (c i) (r i)
    theorem lebesgue_differentiation.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  }
      (hf :
        BoundedFiniteSupport f
          MeasureTheory.volume) :
      ∀ᵐ (x : X),
         c r,
          Filter.Tendsto
              (fun i 
                 (y : X) in
                  Metric.ball (c i) (r i),
                  f y)
              Filter.atTop (nhds (f x)) 
            Filter.Tendsto r Filter.atTop
                (nhdsWithin 0 (Set.Ioi 0)) 
               (i : ),
                x  Metric.ball (c i) (r i)
    Lemma 10.2.2. 
Proof for Lemma 1.10.2.2
uses 0

Proof. This follows from the Lebesgue differentiation theorem, which is already formalized in Lean.

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

In a doubling metric measure space (X,\rho,\mu,a), every disjoint family of balls B_j=B(x_j,r_j), j\in J, is countable.

Lean code for Lemma1.10.2.31 theorem
  • theoremdefined in Mathlib/Topology/Bases.lean
    complete
    theorem Pairwise.countable_of_isOpen_disjoint.{u, u_2} {α : Type u}
      [t : TopologicalSpace α] [TopologicalSpace.SeparableSpace α]
      {ι : Type u_2} {s : ι  Set α}
      (hd : Pairwise (Function.onFun Disjoint s))
      (ho :  (i : ι), IsOpen (s i)) (hne :  (i : ι), (s i).Nonempty) :
      Countable ι
    theorem Pairwise.countable_of_isOpen_disjoint.{u,
        u_2}
      {α : Type u} [t : TopologicalSpace α]
      [TopologicalSpace.SeparableSpace α]
      {ι : Type u_2} {s : ι  Set α}
      (hd :
        Pairwise (Function.onFun Disjoint s))
      (ho :  (i : ι), IsOpen (s i))
      (hne :  (i : ι), (s i).Nonempty) :
      Countable ι
    In a separable space, a family of nonempty disjoint open sets is countable. 
Proof for Lemma 1.10.2.3
uses 0

Proof. Choose an arbitrary x\in X as reference point. For q,Q\in\mathbb Q_+, let J_{q,Q} be the set of all j\in J such that B_j\subset B(x,Q) and r_j\ge q. It suffices to prove that all J_{q,Q} are finite. Indeed, for every j\in J_{q,Q}, \mu(B(x,Q)) \le\mu(B(x_j,2Q)) =\mu\left(B\left(x_j,\frac{2Q}{r_j}r_j\right)\right) \le2^{a\log_2\left\lceil\frac{2Q}{r_j}\right\rceil}\mu(B_j). Since the balls B_j are disjoint, |J_{q,Q}|\mu(B(x,Q)) \le2^{a\log_2\left\lceil\frac{2Q}{q}\right\rceil} \sum_{j\in J_{q,Q}}\mu(B_j) \le2^{a\log_2\left\lceil\frac{2Q}{q}\right\rceil}\mu(B(x,Q)), and hence |J_{q,Q}|\le2^{a\log_2\lceil2Q/q\rceil}.

The following lemma corresponds to Lemma 3.2 in Stein's book, with the proof of the bounded-intersection property taken from the proof of Proposition 7.1. Whenever B_j=B(x_j,r_j), write B_{n,j}=B(x_j,nr_j).

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

Given an open set O\ne X, there is a countable family of balls B_j=B(x_j,r_j) such that the B_j are pairwise disjoint, \bigcup_jB_{3,j}=O, B_{7,j}\cap(X\setminus O)\ne\emptyset for every j, and every x\in O belongs to at most 2^{6a} of the balls B_{3,j}.

Lean code for Lemma1.10.2.41 theorem
  • theorem ball_covering.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {O : Set X}
      (hO : IsOpen O  O  Set.univ) :
       c r,
        (Set.univ.PairwiseDisjoint fun i  Metric.ball (c i) (r i)) 
           i, Metric.ball (c i) (3 * r i) = O 
            (∀ (i : ),
                0 < r i  ¬Disjoint (Metric.ball (c i) (7 * r i)) O) 
               x  O,
                {i | x  Metric.ball (c i) (3 * r i)}.encard 
                  (2 ^ (6 * a))
    theorem ball_covering.{u_1} {X : Type u_1} {a : }
      [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {O : Set X}
      (hO : IsOpen O  O  Set.univ) :
       c r,
        (Set.univ.PairwiseDisjoint fun i 
            Metric.ball (c i) (r i)) 
           i, Metric.ball (c i) (3 * r i) =
              O 
            (∀ (i : ),
                0 < r i 
                  ¬Disjoint
                      (Metric.ball (c i)
                        (7 * r i))
                      O) 
               x  O,
                {i |
                      x 
                        Metric.ball (c i)
                          (3 * r i)}.encard 
                  (2 ^ (6 * a))
    Lemma 10.2.4. 
Proof for Lemma 1.10.2.4
uses 0

Proof. For x\in O, define \delta(x):=\sup\{\delta\in\mathbb R:B(x,\delta)\subset O\}. Since O is open and O\ne X, we have 0<\delta(x)<\infty. By Zorn's lemma, choose a maximal disjoint subfamily of \{B(x,\delta(x)/6):x\in O\}. By Lemma 1.10.2.3, this gives a countable family B_j=B(x_j,\delta(x_j)/6), j\in J. Pairwise disjointness, B_{7,j}\cap(X\setminus O)\ne\emptyset, and \bigcup_jB_{3,j}\subset O are immediate.

For the reverse inclusion, if B(x,\delta(x)/6)\cap B(y,\delta(y)/6)\ne\emptyset, then \delta(x)\le\rho(x,y)+\delta(y) \le\frac{\delta(x)}6+\frac{7\delta(y)}6, so \delta(x)\le2\delta(y). Given z\in O, maximality yields some j\in J with B(z,\delta(z)/6)\cap B_j\ne\emptyset. Hence \rho(z,x_j)<\frac{\delta(z)}6+\frac{\delta(x_j)}6 \le\frac{3\delta(x_j)}6=3r_j, so z\in B_{3,j}.

For bounded intersection, suppose z\in\bigcap_{k=1}^NB_{3,j_k}. For 1\le k\le N, we have \delta(z)\le\rho(z,x_{j_k})+\delta(x_{j_k}) \le\frac{3\delta(x_{j_k})}{2} and \delta(x_{j_k})\le\rho(x_{j_k},z)+\delta(z) \le\frac{\delta(x_{j_k})}{2}+\delta(z), so \delta(x_{j_k})\le2\delta(z). Thus B(z,\delta(z)/6)\subset B(x_{j_k},5r_{j_k}) and B_{j_k}\subset B(z,8\delta(z)/6). Using pairwise disjointness, \begin{aligned} N\mu(B(z,\tfrac{\delta(z)}6)) &\le\sum_{k=1}^N\mu(B(x_{j_k},5r_{j_k}))\\ &\le2^{3a}\sum_{k=1}^N\mu(B_{j_k})\\ &\le2^{3a}\mu(B(z,\tfrac{8\delta(z)}6))\\ &\le2^{6a}\mu(B(z,\tfrac{\delta(z)}6)). \end{aligned} Therefore N\le2^{6a}.

Most of the next lemma and its proof is taken from Theorem 4.2 in Stein's book.

Lemma1.10.2.5
Statement uses 3
Statement dependency previews
Preview
Lemma 1.10.2.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Lemma 1.10.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
markupTeXL∃∀N

Let f be a bounded, almost-everywhere measurable function supported on a set of finite measure, and let \alpha>\mu(X)^{-1}\int |f|\,d\mu. Then there exist a bounded, almost-everywhere measurable function g supported on a set of finite measure, a countable family of balls B_{3,j} (allowing B_{3,1}=X in the special case \mu(X)<\infty) such that each x\in X belongs to at most 2^{6a} of them, and a countable family of almost-everywhere measurable functions \{b_j\}_{j\in J} such that f(x)=g(x)+\sum_j b_j(x) for every x\in X, and the following properties hold:

  • |g(x)|\le 2^{3a}\alpha for almost every x\in X;

  • \int |g(y)|\,d\mu(y)\le\int |f(y)|\,d\mu(y);

  • \operatorname{supp}b_j\subset B_{3,j} and \int_{B_{3,j}}b_j(x)\,d\mu(x)=0 for every j;

  • \int_{B_{3,j}}|b_j(x)|\,d\mu(x) \le 2^{2a+1}\alpha\mu(B_{3,j}) for every j;

  • \sum_j\mu(B_{3,j})\le \frac{2^{4a}}{\alpha}\int|f(y)|\,d\mu(y); and

  • \sum_j\int_{B_{3,j}}|b_j(y)|\,d\mu(y) \le2\int|f(y)|\,d\mu(y).

Lean code for Lemma1.10.2.516 theorems
  • theorem encard_czBall3_le.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hX : GeneralCase f α} {y : X} :
      {i | y  czBall3 hX i}.encard  (2 ^ (6 * a))
    theorem encard_czBall3_le.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hX : GeneralCase f α} {y : X} :
      {i | y  czBall3 hX i}.encard 
        (2 ^ (6 * a))
    Part of Lemma 10.2.5 (general case). 
  • theorem tsum_czRemainder'.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} (hX : GeneralCase f α) (x : X) :
      ∑' (i : ), czRemainder' hX i x = czRemainder f α x
    theorem tsum_czRemainder'.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      (hX : GeneralCase f α) (x : X) :
      ∑' (i : ), czRemainder' hX i x =
        czRemainder f α x
    Part of Lemma 10.2.5, this is essentially (10.2.16) (both cases). 
  • theorem aemeasurable_czApproximation.{u_1} {X : Type u_1} {a : }
      [MetricSpace X] [MeasureTheory.DoublingMeasure X (defaultA a)]
      {f : X  } {α : ENNReal} {hf : AEMeasurable f MeasureTheory.volume} :
      AEMeasurable (czApproximation f α) MeasureTheory.volume
    theorem aemeasurable_czApproximation.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        AEMeasurable f MeasureTheory.volume} :
      AEMeasurable (czApproximation f α)
        MeasureTheory.volume
    Part of Lemma 10.2.5 (both cases). 
  • theorem czApproximation_add_czRemainder.{u_1} {X : Type u_1} {a : }
      [MetricSpace X] [MeasureTheory.DoublingMeasure X (defaultA a)]
      {f : X  } {α : ENNReal} {x : X} :
      czApproximation f α x + czRemainder f α x = f x
    theorem czApproximation_add_czRemainder.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal} {x : X} :
      czApproximation f α x +
          czRemainder f α x =
        f x
    Part of Lemma 10.2.5, equation (10.2.16) (both cases).
    This is true by definition, the work lies in `tsum_czRemainder'` 
  • theorem enorm_czApproximation_le.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hf : BoundedFiniteSupport f MeasureTheory.volume}
      ( : ⨍⁻ (x : X), f x‖ₑ  α) :
      ∀ᵐ (x : X), czApproximation f α x‖ₑ  2 ^ (3 * a) * α
    theorem enorm_czApproximation_le.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        BoundedFiniteSupport f
          MeasureTheory.volume}
      ( : ⨍⁻ (x : X), f x‖ₑ  α) :
      ∀ᵐ (x : X),
        czApproximation f α x‖ₑ 
          2 ^ (3 * a) * α
    Part of Lemma 10.2.5, equation (10.2.17) (both cases). 
  • theorem enorm_czApproximation_le_infinite.{u_1} {X : Type u_1} {a : }
      [MetricSpace X] [MeasureTheory.DoublingMeasure X (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf : BoundedFiniteSupport f MeasureTheory.volume}
      (hX : GeneralCase f α) :
      ∀ᵐ (x : X), czApproximation f α x‖ₑ  2 ^ (3 * a) * α
    theorem enorm_czApproximation_le_infinite.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        BoundedFiniteSupport f
          MeasureTheory.volume}
      (hX : GeneralCase f α) :
      ∀ᵐ (x : X),
        czApproximation f α x‖ₑ 
          2 ^ (3 * a) * α
    Equation (10.2.17) specialized to the general case. 
  • theorem eLpNorm_czApproximation_le.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hf : BoundedFiniteSupport f MeasureTheory.volume}
      ( : 0 < α) :
      MeasureTheory.eLpNorm (czApproximation f α) 1 MeasureTheory.volume 
        MeasureTheory.eLpNorm f 1 MeasureTheory.volume
    theorem eLpNorm_czApproximation_le.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        BoundedFiniteSupport f
          MeasureTheory.volume}
      ( : 0 < α) :
      MeasureTheory.eLpNorm
          (czApproximation f α) 1
          MeasureTheory.volume 
        MeasureTheory.eLpNorm f 1
          MeasureTheory.volume
    Part of Lemma 10.2.5, equation (10.2.18) (both cases). 
  • theorem support_czRemainder'_subset.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hX : GeneralCase f α} {i : } :
      Function.support (czRemainder' hX i)  czBall3 hX i
    theorem support_czRemainder'_subset.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hX : GeneralCase f α} {i : } :
      Function.support (czRemainder' hX i) 
        czBall3 hX i
    Part of Lemma 10.2.5, equation (10.2.19) (general case). 
  • theorem integral_czRemainder'.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hX : GeneralCase f α} {i : } :
       (x : X), czRemainder' hX i x = 0
    theorem integral_czRemainder'.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hX : GeneralCase f α} {i : } :
       (x : X), czRemainder' hX i x = 0
    Part of Lemma 10.2.5, equation (10.2.20) (general case). 
  • theorem integral_czRemainder.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hf : BoundedFiniteSupport f MeasureTheory.volume}
      (hX : ¬GeneralCase f α) ( : 0 < α) :
       (x : X), czRemainder f α x = 0
    theorem integral_czRemainder.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        BoundedFiniteSupport f
          MeasureTheory.volume}
      (hX : ¬GeneralCase f α) ( : 0 < α) :
       (x : X), czRemainder f α x = 0
    Part of Lemma 10.2.5, equation (10.2.20) (finite case). 
  • theorem eLpNorm_czRemainder'_le.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hf : BoundedFiniteSupport f MeasureTheory.volume}
      {hX : GeneralCase f α} {i : } :
      MeasureTheory.eLpNorm (czRemainder' hX i) 1 MeasureTheory.volume 
        2 ^ (2 * a + 1) * α * MeasureTheory.volume (czBall3 hX i)
    theorem eLpNorm_czRemainder'_le.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        BoundedFiniteSupport f
          MeasureTheory.volume}
      {hX : GeneralCase f α} {i : } :
      MeasureTheory.eLpNorm
          (czRemainder' hX i) 1
          MeasureTheory.volume 
        2 ^ (2 * a + 1) * α *
          MeasureTheory.volume (czBall3 hX i)
    Part of Lemma 10.2.5, equation (10.2.21) (general case). 
  • theorem eLpNorm_czRemainder_le.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hf : BoundedFiniteSupport f MeasureTheory.volume}
      (hX : ¬GeneralCase f α) ( : ⨍⁻ (x : X), f x‖ₑ < α) :
      MeasureTheory.eLpNorm (czRemainder f α) 1 MeasureTheory.volume 
        2 ^ (2 * a + 1) * α * MeasureTheory.volume Set.univ
    theorem eLpNorm_czRemainder_le.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        BoundedFiniteSupport f
          MeasureTheory.volume}
      (hX : ¬GeneralCase f α)
      ( : ⨍⁻ (x : X), f x‖ₑ < α) :
      MeasureTheory.eLpNorm (czRemainder f α)
          1 MeasureTheory.volume 
        2 ^ (2 * a + 1) * α *
          MeasureTheory.volume Set.univ
    Part of Lemma 10.2.5, equation (10.2.21) (finite case). 
  • theorem tsum_volume_czBall3_le.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} (hf : BoundedFiniteSupport f MeasureTheory.volume)
      (hX : GeneralCase f α) ( : 0 < α) :
      ∑' (i : ), MeasureTheory.volume (czBall3 hX i) 
        2 ^ (4 * a) / α * MeasureTheory.eLpNorm f 1 MeasureTheory.volume
    theorem tsum_volume_czBall3_le.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      (hf :
        BoundedFiniteSupport f
          MeasureTheory.volume)
      (hX : GeneralCase f α) ( : 0 < α) :
      ∑' (i : ),
          MeasureTheory.volume
            (czBall3 hX i) 
        2 ^ (4 * a) / α *
          MeasureTheory.eLpNorm f 1
            MeasureTheory.volume
    Part of Lemma 10.2.5, equation (10.2.22) (general case). 
  • theorem volume_univ_le.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} (hf : BoundedFiniteSupport f MeasureTheory.volume)
      (hX : ¬GeneralCase f α) ( : 0 < α) :
      MeasureTheory.volume Set.univ 
        2 ^ (2 * a) / α * MeasureTheory.eLpNorm f 1 MeasureTheory.volume
    theorem volume_univ_le.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      (hf :
        BoundedFiniteSupport f
          MeasureTheory.volume)
      (hX : ¬GeneralCase f α) ( : 0 < α) :
      MeasureTheory.volume Set.univ 
        2 ^ (2 * a) / α *
          MeasureTheory.eLpNorm f 1
            MeasureTheory.volume
    Part of Lemma 10.2.5, equation (10.2.22) (finite case). 
  • theorem tsum_eLpNorm_czRemainder'_le.{u_1} {X : Type u_1} {a : }
      [MetricSpace X] [MeasureTheory.DoublingMeasure X (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf : BoundedFiniteSupport f MeasureTheory.volume}
      (hX : GeneralCase f α) :
      ∑' (i : ),
          MeasureTheory.eLpNorm (czRemainder' hX i) 1 MeasureTheory.volume 
        2 * MeasureTheory.eLpNorm f 1 MeasureTheory.volume
    theorem tsum_eLpNorm_czRemainder'_le.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        BoundedFiniteSupport f
          MeasureTheory.volume}
      (hX : GeneralCase f α) :
      ∑' (i : ),
          MeasureTheory.eLpNorm
            (czRemainder' hX i) 1
            MeasureTheory.volume 
        2 *
          MeasureTheory.eLpNorm f 1
            MeasureTheory.volume
    Part of Lemma 10.2.5, equation (10.2.23) (general case). 
  • theorem tsum_eLpNorm_czRemainder_le.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {f : X  }
      {α : ENNReal} {hf : BoundedFiniteSupport f MeasureTheory.volume}
      (hX : ¬GeneralCase f α) ( : ⨍⁻ (x : X), f x‖ₑ < α) :
      MeasureTheory.eLpNorm (czRemainder f α) 1 MeasureTheory.volume 
        2 * MeasureTheory.eLpNorm f 1 MeasureTheory.volume
    theorem tsum_eLpNorm_czRemainder_le.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal}
      {hf :
        BoundedFiniteSupport f
          MeasureTheory.volume}
      (hX : ¬GeneralCase f α)
      ( : ⨍⁻ (x : X), f x‖ₑ < α) :
      MeasureTheory.eLpNorm (czRemainder f α)
          1 MeasureTheory.volume 
        2 *
          MeasureTheory.eLpNorm f 1
            MeasureTheory.volume
    Part of Lemma 10.2.5, equation (10.2.23) (finite case). 
Proof for Lemma 1.10.2.5
uses 0

Proof. Put E_\alpha:=\{x\in X:Mf(x)>\alpha\}. This set is open. First suppose E_\alpha\ne X. Apply Lemma 1.10.2.4 to O=E_\alpha, obtaining balls B_j, j\in J, and identify J with \mathbb N. Define inductively Q_j:=B_{3,j}\setminus\left(\bigcup_{i<j}Q_i\cup\bigcup_{i>j}B_i\right). Then B_j\subset Q_j\subset B_{3,j}, the Q_j are pairwise disjoint, and \bigcup_jQ_j=E_\alpha. Define g(x):=\begin{cases} f(x),&x\in X\setminus E_\alpha,\\ \displaystyle\frac1{\mu(Q_j)}\int_{Q_j}f(y)\,d\mu(y),&x\in Q_j, \end{cases} and b_j(x):=\mathbf 1_{Q_j}(x)\left(f(x)- \frac1{\mu(Q_j)}\int_{Q_j}f(y)\,d\mu(y)\right). The decomposition, support, and mean-zero properties follow immediately. The function g is bounded and its support is contained in \operatorname{supp}f\cup\bigcup_jQ_j; the maximal theorem therefore shows that this support has finite measure.

If x\notin E_\alpha, every ball B containing x satisfies \frac1{\mu(B)}\int_B|f(y)|\,d\mu(y)\le\alpha. Lemma 1.10.2.2 gives |f(x)|\le\alpha for almost every such x. If x\in E_\alpha, then x\in Q_j for some j, while \frac1{\mu(B_{7,j})}\int_{B_{7,j}}|f(y)|\,d\mu(y)\le\alpha because B_{7,j} meets X\setminus E_\alpha. Hence |g(x)|\le\frac1{\mu(Q_j)}\int_{Q_j}|f(y)|\,d\mu(y) \le\frac1{\mu(B_j)}\int_{B_{7,j}}|f(y)|\,d\mu(y) \le2^{3a}\alpha.

For the L^1 estimate on g, pairwise disjointness gives \begin{aligned} \int|g(z)|\,d\mu(z) &\le\int_{X\setminus E_\alpha}|f(z)|\,d\mu(z) +\sum_j\int_{Q_j}\frac1{\mu(Q_j)} \int_{Q_j}|f(y)|\,d\mu(y)\,d\mu(z)\\ &=\int|f(z)|\,d\mu(z). \end{aligned} The triangle inequality also yields \int_{B_{3,j}}|b_j(y)|\,d\mu(y) \le2\int_{Q_j}|f(y)|\,d\mu(y). Using the estimate on B_{7,j}, the right side is at most 2^{2a+1}\alpha\mu(B_{3,j}). Summing the preceding inequality over j proves the total L^1 bound for the bad parts. Finally, the maximal theorem gives \sum_j\mu(B_{3,j}) \le2^{2a}\sum_j\mu(B_j) \le2^{2a}\mu(E_\alpha) \le\frac{2^{4a}}\alpha\int|f(y)|\,d\mu(y).

It remains to consider E_\alpha=X. Lemma 1.10.2.1 implies \mu(X)<\infty. Set g:=\frac1{\mu(X)}\int|f(y)|\,d\mu(y),\qquad b_1:=f-g, and take B_{3,1}=X. All decomposition, support, mean-zero, and L^1 properties are immediate. The hypothesis gives g<\alpha, and \int|b_1(y)|\,d\mu(y) \le2\int|f(y)|\,d\mu(y)\le2\alpha\mu(X), which proves both bad-part estimates. The maximal theorem also gives \mu(X)\le\frac{2^{2a}}\alpha\int|f(y)|\,d\mu(y), and finishes the proof.

We use Lemma 1.10.2.5 to prove Lemma 1.10.3. For the rest of this section, fix f:X\to\mathbb C, r>0, and \alpha>0 as in that lemma. Define c:=2^{-a^3-12a-4},\qquad \alpha':=c\alpha. If \alpha'\le\mu(X)^{-1}\int|f|\,d\mu, then \mu\{x\in X:|T_rf(x)|>\alpha\} \le\mu(X)\le\frac1{\alpha'}\int|f(y)|\,d\mu(y) \le\frac{2^{a^3+19a}}\alpha\int|f(y)|\,d\mu(y), which is the desired weak (1,1) estimate. Hence assume \alpha'>\mu(X)^{-1}\int|f|\,d\mu. Applying the decomposition at height \alpha' gives f=g+b=g+\sum_jb_j with all the preceding properties. Write B_{3,j}=B(x_j,3r_j) and let B_{6,j}=B(x_j,6r_j). Then \mu(B_{6,j})\le2^a\mu(B_{3,j}). Finally set \Omega:=\bigcup_jB_{6,j}. The following lemmas estimate T_rg and T_rb separately.

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

We have \mu\{x\in X:|T_rg(x)|>\alpha/2\} \le\frac{2^{2a^3+3a+2}c}{\alpha}\int|f(y)|\,d\mu(y).

Lean code for Lemma1.10.2.61 theorem
  • theorem estimate_good.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r : }
      {K : X  X  } [IsTwoSidedKernel a K] {f : X  } {α : ENNReal}
      (hf : BoundedFiniteSupport f MeasureTheory.volume)
      ( : ⨍⁻ (x : X), f x‖ₑ / (c10_0_3 a) < α)
      (hT :
        MeasureTheory.HasBoundedStrongType (czOperator K r) 2 2
          MeasureTheory.volume MeasureTheory.volume (C_Ts a)) :
      MeasureTheory.distribution
          (czOperator K r (czApproximation f (α' a α))) (α / 2)
          MeasureTheory.volume 
        (C10_2_6 a) / α * MeasureTheory.eLpNorm f 1 MeasureTheory.volume
    theorem estimate_good.{u_1} {X : Type u_1} {a : }
      [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r : } {K : X  X  }
      [IsTwoSidedKernel a K] {f : X  }
      {α : ENNReal}
      (hf :
        BoundedFiniteSupport f
          MeasureTheory.volume)
      ( :
        ⨍⁻ (x : X), f x‖ₑ / (c10_0_3 a) < α)
      (hT :
        MeasureTheory.HasBoundedStrongType
          (czOperator K r) 2 2
          MeasureTheory.volume
          MeasureTheory.volume (C_Ts a)) :
      MeasureTheory.distribution
          (czOperator K r
            (czApproximation f (α' a α)))
          (α / 2) MeasureTheory.volume 
        (C10_2_6 a) / α *
          MeasureTheory.eLpNorm f 1
            MeasureTheory.volume
    Lemma 10.2.6 
Proof for Lemma 1.10.2.6
uses 0

Proof. Monotonicity of the integral gives \mu\{x\in X:|T_rg(x)|>\alpha/2\} \le\frac4{\alpha^2}\int|T_rg(y)|^2\,d\mu(y). Using the strong L^2 assumption, followed by the pointwise and L^1 bounds on g, the right side is at most \frac{4\cdot2^{2a^3}}{\alpha^2}\int|g(y)|^2\,d\mu(y) \le\frac{2^{2a^3+3a+2}c}{\alpha}\int|g(y)|\,dy \le\frac{2^{2a^3+3a+2}c}{\alpha}\int|f(y)|\,d\mu(y).

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

Let x\in X\setminus\Omega. Then |T_rb(x)|\le3F(x)+\alpha/8, where F(x):=2^{a^3+2a+1}c\alpha\sum_{j\in J} \left(\frac{3r_j}{\rho(x,x_j)}\right)^{1/a} \frac{\mu(B_{3,j})}{V(x,x_j)}.

Lean code for Lemma1.10.2.71 theorem
  • theorem estimate_bad_partial.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r : }
      {K : X  X  } {x : X} [IsTwoSidedKernel a K] {f : X  }
      {α : ENNReal} (hf : BoundedFiniteSupport f MeasureTheory.volume)
      (hr : 0 < r) ( : ⨍⁻ (x : X), f x‖ₑ / (c10_0_3 a) < α)
      (hx : x  (Ω f (α' a α))) (hX : GeneralCase f (α' a α)) :
      czOperator K r (czRemainder f (α' a α)) x‖ₑ 
        3 * czOperatorBound hX x + α / 8
    theorem estimate_bad_partial.{u_1} {X : Type u_1}
      {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r : } {K : X  X  } {x : X}
      [IsTwoSidedKernel a K] {f : X  }
      {α : ENNReal}
      (hf :
        BoundedFiniteSupport f
          MeasureTheory.volume)
      (hr : 0 < r)
      ( :
        ⨍⁻ (x : X), f x‖ₑ / (c10_0_3 a) < α)
      (hx : x  (Ω f (α' a α)))
      (hX : GeneralCase f (α' a α)) :
      czOperator K r (czRemainder f (α' a α))
            x‖ₑ 
        3 * czOperatorBound hX x + α / 8
    Lemma 10.2.7.
    Note that `hx` implies `hX`, but we keep the superfluous hypothesis to shorten the statement. 
Proof for Lemma 1.10.2.7
uses 0

Proof. Decompose J into the disjoint sets \begin{aligned} \mathcal J_1(x)&:=\{j:r+3r_j\le\rho(x,x_j)\},\\ \mathcal J_2(x)&:=\{j:r-3r_j\le\rho(x,x_j)<r+3r_j\},\\ \mathcal J_3(x)&:=\{j:\rho(x,x_j)<r-3r_j\}. \end{aligned} The triangle inequality gives |T_rb(x)|\le \sum_{j\in\mathcal J_1(x)}|T_rb_j(x)|+ \sum_{j\in\mathcal J_2(x)}|T_rb_j(x)|+ \sum_{j\in\mathcal J_3(x)}|T_rb_j(x)|. For j\in\mathcal J_3(x), the support of b_j is contained in B_{3,j}\subset B(x,r), so the third sum vanishes.

For j\in\mathcal J_1(x), the support is contained in X\setminus B(x,r), and hence T_rb_j(x)=\int_{B_{3,j}}K(x,y)b_j(y)\,d\mu(y). The mean-zero property of b_j lets us replace the kernel by K(x,y)-K(x,x_j). Since x\notin\Omega, for y\in B_{3,j} we have \rho(x,x_j)\ge6r_j>2\rho(x_j,y). The kernel smoothness bound and the L^1 bound on each bad part therefore give \begin{aligned} \sum_{j\in\mathcal J_1(x)}|T_rb_j(x)| &\le2^{a^3}\sum_j \left(\frac{3r_j}{\rho(x,x_j)}\right)^{1/a} \frac1{V(x,x_j)}\int_{B_{3,j}}|b_j(y)|\,dy\\ &\le2^{a^3+2a+1}c\alpha\sum_j \left(\frac{3r_j}{\rho(x,x_j)}\right)^{1/a} \frac{\mu(B_{3,j})}{V(x,x_j)}=F(x). \end{aligned}

For j\in\mathcal J_2(x), set d_j:=\frac1{\mu(B_{3,j})}\int_{B_{3,j}} \mathbf1_{X\setminus B(x,r)}(y)b_j(y)\,dy. Then |d_j|\le2^{2a+1}c\alpha, and \begin{aligned} T_rb_j(x) &=\int_{B_{3,j}}K(x,y) (\mathbf1_{X\setminus B(x,r)}(y)b_j(y)-d_j)\,dy +\int_{B_{3,j}}d_jK(x,y)\,dy\\ &=\int_{B_{3,j}}(K(x,y)-K(x,x_j)) (\mathbf1_{X\setminus B(x,r)}(y)b_j(y)-d_j)\,dy +\int_{B_{3,j}}d_jK(x,y)\,dy. \end{aligned} Thus |T_rb_j(x)|\le \int_{B_{3,j}}|K(x,y)-K(x,x_j)| (|b_j(y)|+2^{2a+1}c\alpha)\,dy +2^{2a+1}c\alpha\int_{B_{3,j}}|K(x,y)|\,dy. Using the same smoothness estimate as above and summing yields \sum_{j\in\mathcal J_2(x)}|T_rb_j(x)| \le2F(x)+2^{2a+1}c\alpha \sum_{j\in\mathcal J_2(x)}\int_{B_{3,j}}|K(x,y)|\,d\mu(y).

Put A:=\bigcup_{j\in\mathcal J_2(x)}B_{3,j}. We claim A\subset B(x,3r)\setminus B(x,r/3). Indeed, if j\in\mathcal J_2(x) and y\in B_{3,j}, then 3r_j\le\rho(x,x_j)/2. Consequently \rho(x,x_j)<r+3r_j\le r+\tfrac12\rho(x,x_j), so \rho(x,x_j)<2r and \rho(x,y)<3r. Similarly, \rho(x,x_j)\ge r-3r_j\ge r-\tfrac12\rho(x,x_j), so \rho(x,x_j)\ge2r/3 and \rho(x,y)\ge r/3.

The bounded-intersection property of the B_{3,j}, the preceding annular containment, and the kernel size estimate give \begin{aligned} \sum_{j\in\mathcal J_2(x)}\int_{B_{3,j}}|K(x,y)|\,d\mu(y) &\le2^{6a}\int_A|K(x,y)|\,d\mu(y)\\ &\le2^{a^3+6a}\int_{B(x,3r)\setminus B(x,r/3)} \frac1{\mu(B(x,r/3))}\,d\mu(y)\\ &\le2^{a^3+6a}\frac{\mu(B(x,3r))}{\mu(B(x,r/3))} \le2^{a^3+10a}. \end{aligned} Combining the three index-set estimates gives |T_rb(x)|\le3F(x)+2^{a^3+12a+1}c\alpha. By the definition c=2^{-a^3-12a-4}, the last term is \alpha/8, as claimed.

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

For F as defined in Lemma 1.10.2.7, \mu\{x\in X\setminus\Omega:F(x)>\alpha/8\} \le\frac{2^{a^3+9a+4}}\alpha\int|f(y)|\,d\mu(y).

Lean code for Lemma1.10.2.81 theorem
  • theorem distribution_czOperatorBound.{u_1} {X : Type u_1} {a : }
      [MetricSpace X] [MeasureTheory.DoublingMeasure X (defaultA a)]
      {f : X  } {α : ENNReal} (ha : 4  a)
      (hf : BoundedFiniteSupport f MeasureTheory.volume)
      ( : ⨍⁻ (x : X), f x‖ₑ / (c10_0_3 a) < α)
      (hX : GeneralCase f (α' a α)) :
      MeasureTheory.volume
          ((Ω f (α' a α))  czOperatorBound hX ⁻¹' Set.Ioi (α / 8)) 
        (C10_2_8 a) / α * MeasureTheory.eLpNorm f 1 MeasureTheory.volume
    theorem distribution_czOperatorBound.{u_1}
      {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {f : X  } {α : ENNReal} (ha : 4  a)
      (hf :
        BoundedFiniteSupport f
          MeasureTheory.volume)
      ( :
        ⨍⁻ (x : X), f x‖ₑ / (c10_0_3 a) < α)
      (hX : GeneralCase f (α' a α)) :
      MeasureTheory.volume
          ((Ω f (α' a α)) 
            czOperatorBound hX ⁻¹'
              Set.Ioi (α / 8)) 
        (C10_2_8 a) / α *
          MeasureTheory.eLpNorm f 1
            MeasureTheory.volume
    Lemma 10.2.8 
Proof for Lemma 1.10.2.8
uses 0

Proof. First, \begin{aligned} \mu\{x\in X\setminus\Omega:F(x)>\alpha/8\} &\le\frac8\alpha\int_{X\setminus\Omega}F(x)\,d\mu(x)\\ &\le\frac8\alpha\int_{X\setminus\Omega} 2^{a^3+2a+1}c\alpha\sum_j \left(\frac{3r_j}{\rho(x,x_j)}\right)^{1/a} \frac{\mu(B_{3,j})}{V(x,x_j)}\,d\mu(x)\\ &\le2^{a^3+2a+4}c\sum_j\mu(B_{3,j}) \int_{X\setminus B_{6,j}} \left(\frac{3r_j}{\rho(x,x_j)}\right)^{1/a} \frac1{V(x,x_j)}\,d\mu(x). \end{aligned} For every j, doubling gives V(x,x_j)=\mu(B(x,\rho(x,x_j))) \ge2^{-a}\mu(B(x,2\rho(x,x_j))) \ge2^{-a}\mu(B(x_j,\rho(x_j,x))). Decomposing X\setminus B_{6,j} into dyadic annuli and using Lemma 1.10.1.1 therefore yields \begin{aligned} &\int_{X\setminus B_{6,j}} \left(\frac{3r_j}{\rho(x,x_j)}\right)^{1/a} \frac1{V(x,x_j)}\,d\mu(x)\\ &\quad\le2^a\int_{X\setminus B_{6,j}} \left(\frac{3r_j}{\rho(x,x_j)}\right)^{1/a} \frac1{\mu(B(x_j,\rho(x_j,x)))}\,d\mu(x)\\ &\quad\le2^a\sum_{n=1}^\infty \int_{B(x_j,2^{n+1}3r_j)\setminus B(x_j,2^n3r_j)} \left(\frac{3r_j}{2^n3r_j}\right)^{1/a} \frac1{\mu(B(x_j,2^n3r_j))}\,d\mu(x)\\ &\quad\le2^a\sum_{n=1}^\infty 2^{-n/a}\frac{\mu(B(x_j,2^{n+1}3r_j))} {\mu(B(x_j,2^n3r_j))} \le2^{3a}. \end{aligned} Substituting this estimate and using the total measure bound for the B_{3,j} proves \mu\{x\in X\setminus\Omega:F(x)>\alpha/8\} \le\frac{2^{a^3+9a+4}}\alpha\int|f(y)|\,d\mu(y).

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

We have \mu\{x\in X:|T_rb(x)|>\alpha/2\} \le\frac{2^{5a}/c+2^{a^3+9a+4}}\alpha\int|f(y)|\,d\mu(y).

Lean code for Lemma1.10.2.91 theorem
  • theorem estimate_bad.{u_1} {X : Type u_1} {a : } [MetricSpace X]
      [MeasureTheory.DoublingMeasure X (defaultA a)] {r : }
      {K : X  X  } [IsTwoSidedKernel a K] {f : X  } {α : ENNReal}
      (ha : 4  a) (hr : 0 < r)
      (hf : BoundedFiniteSupport f MeasureTheory.volume)
      ( : ⨍⁻ (x : X), f x‖ₑ / (c10_0_3 a) < α) :
      MeasureTheory.distribution (czOperator K r (czRemainder f (α' a α)))
          (α / 2) MeasureTheory.volume 
        (C10_2_9 a) / α * MeasureTheory.eLpNorm f 1 MeasureTheory.volume
    theorem estimate_bad.{u_1} {X : Type u_1} {a : }
      [MetricSpace X]
      [MeasureTheory.DoublingMeasure X
          (defaultA a)]
      {r : } {K : X  X  }
      [IsTwoSidedKernel a K] {f : X  }
      {α : ENNReal} (ha : 4  a) (hr : 0 < r)
      (hf :
        BoundedFiniteSupport f
          MeasureTheory.volume)
      ( :
        ⨍⁻ (x : X), f x‖ₑ / (c10_0_3 a) <
          α) :
      MeasureTheory.distribution
          (czOperator K r
            (czRemainder f (α' a α)))
          (α / 2) MeasureTheory.volume 
        (C10_2_9 a) / α *
          MeasureTheory.eLpNorm f 1
            MeasureTheory.volume
    Lemma 10.2.9 
Proof for Lemma 1.10.2.9
uses 0

Proof. Split the exceptional set into its parts inside and outside \Omega: \mu\{x\in X:|T_rb(x)|>\alpha/2\} \le\mu(\Omega)+ \mu\{x\in X\setminus\Omega:|T_rb(x)|>\alpha/2\}. The enlargement estimate for B_{6,j} and the total measure bound for B_{3,j} give \mu(\Omega)\le\sum_j\mu(B_{6,j}) \le2^a\sum_j\mu(B_{3,j}) \le\frac{2^{5a}}{c\alpha}\int|f(y)|\,d\mu(y). By Lemma 1.10.2.7 and the triangle inequality, \mu\{x\in X\setminus\Omega:|T_rb(x)|>\alpha/2\} \le\mu\{x\in X\setminus\Omega:F(x)>\alpha/8\}. The conclusion follows from Lemma 1.10.2.8.