logo

Maximal Lemma 📂Measure Theory

Maximal Lemma

Theorem1

Let’s call a collection of open balls at Rn\mathbb{R}^n given B\mathcal{B}. Let’s say U=BBBU=\bigcup \limits_ { B\in \mathcal{B}} B. Then, for some constant c<m(U)c \lt m (U), there exist a finite number of mutually disjoint BjBB_{j} \in \mathcal{B} that satisfy the following condition.

c3n<j=1km(Bj) \dfrac{c}{3^{n}} \lt \sum \limits_{j=1}^{k} m(B_{j})

Here, mm is the nn-dimensional Lebesgue measure.

Description

Actually, this theorem is not officially named the maximal lemma, but it is conveniently named because it is used as a lemma in the maximal theorem.

It guarantees that there necessarily exists a finite set Bj{B_{j}} whose measure values are between m(U)m(U) and c/3nc/3^{n}.

Proof

First, there exists a compact set KUK \subset U that satisfies c<m(K)m(U)c< m (K) \le m (U)2. Then, by the definition of compact, there exists a sub cover {Ai}1l\left\{ A_{i} \right\}_{1}^l of KK. Now, among these, let’s call the largest3 one B1B_{1}. Let’s call the largest among AiA_{i} that are disjoint with B1B_{1}, B2B_2. And let’s call the largest one among AiA_{i} that are disjoint with both B1B_{1} and B2B_2, B3B_{3}. In this way, we can construct a finite collection {Bj}\left\{ B_{j} \right\}.

For AiA_{i} not included in {Bj}\left\{ B_{j} \right\}, there exists jj that satisfies AiBjA_{i} \cap B_{j} \ne \varnothing. Moreover, for the smallest jj among those jjs4, the radius of AiA_{i} can be at most BjB_{j}. That means, it cannot be larger than the radius of BjB_{j}. Otherwise, AiA_{i} would have taken the name of BjB_{j} when constructing {Bj}\left\{ B_{j}\right\}5.

Now, let’s call BjB^{\ast}_{j} an open ball with the same center as BjB_{j} but with a radius three times larger. Then, as AiA_{i} is not larger than BjB_{j} in radius and overlaps with BjB_{j}, it must be included in BjB^{\ast}_{j}. Hence, KAjBjK \subset \bigcup A_{j} \subset \bigcup B^{\ast}_{j} is true.

c<m(K)<m(1kBj)=1km(Bj)=1k3nm(Bj) \begin{align*} c \lt m (K) & \lt m \left( \bigcup \nolimits_{1}^k B^{\ast}_{j}\right) \\ &= \sum \limits_{1}^{k} m (B^{\ast}_{j}) \\ &= \sum \limits_{1}^{k} 3^{n} m (B_{j}) \end{align*}

    c3n<j=1km(Bj) \implies \dfrac{c}{3^{n}} \lt \sum \limits_{j=1}^{k} m(B_{j})

Definition

For every bounded measurable set KRnK \subset \mathbb{R}^n,

Kf(x)dx< \int_{K} |f(x)|dx<\infty

a function f:RnCf : \mathbb{R}^n \rightarrow \mathbb{C} that satisfies this is said to be locally integrable, and the set of locally integrable functions is denoted as Lloc1L^{1}_{\mathrm{loc}}.

Let fLloc1f \in L^1_{\mathrm{loc}}, xRn x\in \mathbb{R}^n, and r>0r>0. Let’s denote the open ball with center xx and radius rr as B(r,x)=Br(x)B(r,x)=B_{r}(x). Then, on Br(x)B_{r}(x), the average value of function Arf(x)A_{r}f(x) of ff is defined as follows.

Arf(x):=1m(Br(x))Br(x)f(y)dy A_{r} f(x) := \frac{1}{m \big( B_{r}(x) \big)} \int _{B_{r}(x)}f(y)dy

ArA_{r} is called an averaging operator.


  1. Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications (2nd Edition, 1999), p95-96 ↩︎

  2. 받아들이고 넘어가자. ↩︎

  3. 반지름이 가장 큰 ↩︎

  4. 인덱스가 제일 작은 BjB_{j}가 반지름은 제일 크다. ↩︎

  5. It’s easier to understand by overlaying several circles. ↩︎