Littlewood's First Principle: Difference between revisions

From Optimal Transport Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(22 intermediate revisions by the same user not shown)
Line 1: Line 1:
Littlewood stated the principles in his 1944 ''Lectures on the Theory of Functions'' as:
Littlewood three principles of real analysis in his 1944 ''Lectures on the Theory of Functions'' <ref> Littlewood, J. E. ''Lectures on the Theory of Functions''. Oxford University Press, 1944. </ref>:


{{quote|There are three principles, roughly expressible in the following terms: Every (measurable) set is nearly a finite sum of intervals; every function (of class <math> L_p </math>) is nearly continuous; every convergent sequence of functions is nearly uniformly convergent.}}
<blockquote> There are three principles, roughly expressible in the following terms: Every (measurable) set is nearly a finite sum of intervals; every function (of class ''L''<sup>p</sup>) is nearly continuous; every convergent sequence of functions is nearly uniformly convergent. </blockquote>


This article examines the first principle and attempts to divine how restrictive the constraint of (Borel) measurability truly is for a set. This will be done in the form of two important results; namely, showing how well such a set can be approximated from above by open sets and how well such a set can be approximated from below by compact sets.  
This article examines the first principle and attempts to divine how restrictive the constraint of (Borel) measurability truly is for a set. This will be done in the form of two important results; namely, showing how well such a set can be approximated from above by open sets and how well such a set can be approximated from below by compact sets.  
Line 8: Line 8:


==Approximation by Open Sets==
==Approximation by Open Sets==
The following theorem shows how well Borel measurable sets can be approximated from above by open sets.


The main result is the following:
'''Theorem.''' Let <math> E </math> be a Borel measurable set. For every <math> \varepsilon > 0</math> there exists an open set <math> U </math> with <math> U\subset E </math> such that <math> m(E) \leq m(U) \leq m(E)+\varepsilon </math>.
Let <math> E </math> be a Borel measurable set. For every <math> \varepsilon > 0</math> there exists a compact set <math> K </math> with <math> K\subset E </math> such that <math> m(E)<m(K)+\varepsilon </math>. Note that this implies <math> 0< m(K)-m(E)<\varepsilon </math> by monotonicity.


Proof: By construction of the Borel measure, there exists a sequence of intervals <math> \{(a_k,b_k)\}_{k=1}^\infty </math> such that <math> E \subset \bigcup_{k=1}^\infty (a_k,b_k) </math> and <math display="block"> m(E) > \sum_{k=1}^\infty (b_k-a_k) - \varepsilon </math> Taking <math> U= \bigcup_{k=1}^\infty (a_k,b_k) </math> gives the result.<ref name="Folland">Gerald B. Folland, ''Real Analysis: Modern Techniques and Their Applications, second edition'', §2.3 </ref>
''Proof:'' By construction of the Borel measure, there exists a sequence of intervals <math> \{(a_k,b_k)\}_{k=1}^\infty </math> such that <math> E \subset \bigcup_{k=1}^\infty (a_k,b_k) </math> and <math display="block"> m(E) > \sum_{k=1}^\infty (b_k-a_k) - \varepsilon </math> Taking <math> U= \bigcup_{k=1}^\infty (a_k,b_k) </math> gives the result.<ref name="Folland">Gerald B. Folland, ''Real Analysis: Modern Techniques and Their Applications, second edition'', §1.5 </ref>


==Approximation by Compact Sets==
==Approximation by Compact Sets==
The next theorem demonstrates how well Borel measurable sets can be approximated from below by compact sets.


The main result is the following:
'''Theorem.''' Let <math> E </math> be a Borel measurable set. For every <math>\varepsilon > 0</math> there exists an open set <math> K </math> with <math> E\subset K </math> such that <math> m(E) - \varepsilon \leq m(K) \leq m(E) </math>.  
Let </math> E </math> be a Borel measurable set. For every </math>\varepsilon > 0</math> there exists an open set </math> U </math> with </math> E\subset U </math> such that </math> m(E)>m(U)-\varepsilon </math>. Note that this implies </math> 0< m(U)-m(E)<\varepsilon </math> by monotonicity.


Proof: First suppose </math> E </math> is bounded. If </math> E </math> is also closed, then we're done; </math> E </math> is compact. Otherwise, the boundary </math> \partial{E}=\overline{E}\backslash E </math> is nonempty. Now, </math> \partial{E} </math> is a Borel measurable set, so we can approximate it from above by the previous section. That is, there exists an open set </math> U\supset \partial{E} </math> such that </math> m(U) < m(\overline{E}\backslash E) +\varepsilon = \varepsilon </math>. Now define </math> K= \overline{E} \backslash U </math>. By construction, this set is contained in </math> U </math>. Moreover, it is closed, being the intersection of two closed sets. Finally, </math> K </math> is bounded because </math> E </math> is bounded. By the Heine-Borel Theorem, </math> K </math> is compact, and </math> K </math> satisfies the constraints of the theorem because <math display = "block"> m(K)=m(\overline{E} \backslash U) = m(E)- M(E\cap U) = m(E)-m(U)+m(U/E) \geq m(E)-m(U)+m(\overline{E} \backslash E) \geq m(E)-\varepsilon </math>
''Proof:'' First suppose <math> E </math> is bounded. If <math> E </math> is also closed, then we're done; <math> E </math> is compact. Otherwise, the boundary <math> \partial{E}=\overline{E}\backslash E </math> is nonempty. Now, <math> \partial{E} </math> is a Borel measurable set, so we can approximate it from above by the previous section. That is, there exists an open set <math> U\supset \partial{E} </math> such that <math> m(U) < m(\overline{E}\backslash E) +\varepsilon = \varepsilon </math>. Now define <math> K= \overline{E} \backslash U </math>. By construction, this set is contained in <math> U </math>. Moreover, it is closed, being the intersection of two closed sets. Finally, <math> K </math> is bounded because <math> E </math> is bounded. By the Heine-Borel Theorem, <math> K </math> is compact, and <math> K </math> satisfies the constraints of the theorem because <math display = "block"> m(K)=m(\overline{E} \backslash U) = m(E)- m(E\cap U) = m(E)-m(U)+m(U/E) \geq m(E)-m(U)+m(\overline{E} \backslash E) \geq m(E)-\varepsilon </math>
Now assume </math> E </math> is unbounded. Let </math> E_j = E \cap [j, j+1) </math>. By the preceding argument, for each </math> \varepsilon > 0 </math> there exist compact </math> K_j </math> such that </math> K_j \subset E_j </math> and </math> m(K_j) > m(E_j)-\varepsilon / 2^k </math>. Let </math> H_n = \bigcup_{j=-n}^{n} K_j </math>. Then </math> H_n </math> is compact and </math> m(H_n) \geq m(\bigcup_{j=-n}^n E_j) + \varepsilon </math>, and since </math> \lim_{n\to\infty} m(E)=m(\bigcup_{j=-n}^n E_j) </math>, the result follows.<ref name="Folland">Gerald B. Folland, ''Real Analysis: Modern Techniques and Their Applications, second edition'', §2.3 </ref>
Now assume <math> E </math> is unbounded. Let <math> E_j = E \cap [j, j+1) </math>. By the preceding argument, for each <math> \varepsilon > 0 </math> there exist compact <math> K_j </math> such that <math> K_j \subset E_j </math> and <math> m(K_j) > m(E_j)-\varepsilon / 2^k </math>. Let <math> H_n = \bigcup_{j=-n}^{n} K_j </math>. Then <math> H_n </math> is compact and <math> m(H_n) \geq m(\bigcup_{j=-n}^n E_j) + \varepsilon </math>, and since <math> \lim_{n\to\infty} m(E)=m(\bigcup_{j=-n}^n E_j) </math>, the result follows.<ref name="Folland">Gerald B. Folland, ''Real Analysis: Modern Techniques and Their Applications, second edition'', §1.5 </ref>


==Littlewood's First Principle==
==Littlewood's First Principle==


The previous two results imply the following formulation of Littlewood's First Principle:
The previous two results imply the following formulation of Littlewood's First Principle:
If </math> E </math> is a Borel measurable set and </math> m(E)<+\infty </math>, then for every </math> \varepsilon > 0</math> there is a set </math> A </math> that is a finite union of open intervals such that </math> m(A\delta E) < \varepsilon </math>, where </math> \delta </math> denotes symmetric difference.


Proof: Using the previous two sections find </math> K </math> and </math> U </math> such that </math> K\subset E \subset U </math> and </math> m(E)-\epsilon < m(K) </math> and </math> m(E)+\epsilon > m(U) </math>. As noted in the proof of the first section, </math> U </math> is really a countable union of open intervals. These intervals form an open cover for </math> K </math> and since </math> K </math> is compact, only finitely many cover </math> K </math>. Defining </math> A </math> to be the union of these finitely many intervals, the result follows, since </math> m(A/E) \leq m(U/E) </math> and </math> m(E/A) \leq m(E/K) </math>.
'''Theorem.''' If <math> E </math> is a Borel measurable set and <math> m(E)<+\infty </math>, then for every <math> \varepsilon > 0</math> there is a set <math> A </math> that is a finite union of open intervals such that <math> m(A\Delta E) < \varepsilon </math>, where <math> \Delta </math> denotes symmetric difference.
 
''Proof:'' Using the previous two sections find <math> K </math> and <math> U </math> such that <math> K\subset E \subset U </math> and <math> m(E)-\varepsilon < m(K) </math> and <math> m(E)+\varepsilon > m(U) </math>. As noted in the proof of the first section, <math> U </math> is really a countable union of open intervals. These intervals form an open cover for <math> K </math> and since <math> K </math> is compact, only finitely many cover <math> K </math>. Defining <math> A </math> to be the union of these finitely many intervals, the result follows, since <math> m(A/E) \leq m(U/E) </math> and <math> m(E/A) \leq m(E/K) </math>.


==References==
==References==

Latest revision as of 23:39, 19 December 2020

Littlewood three principles of real analysis in his 1944 Lectures on the Theory of Functions [1]:

There are three principles, roughly expressible in the following terms: Every (measurable) set is nearly a finite sum of intervals; every function (of class Lp) is nearly continuous; every convergent sequence of functions is nearly uniformly convergent.

This article examines the first principle and attempts to divine how restrictive the constraint of (Borel) measurability truly is for a set. This will be done in the form of two important results; namely, showing how well such a set can be approximated from above by open sets and how well such a set can be approximated from below by compact sets.

These two results will demonstrate how convenient Borel measurable sets are to work with and how one may more easily prove results about them by using this approximation and passing to the limit by continuity argument.

Approximation by Open Sets

The following theorem shows how well Borel measurable sets can be approximated from above by open sets.

Theorem. Let be a Borel measurable set. For every there exists an open set with such that .

Proof: By construction of the Borel measure, there exists a sequence of intervals such that and

Taking gives the result.[2]

Approximation by Compact Sets

The next theorem demonstrates how well Borel measurable sets can be approximated from below by compact sets.

Theorem. Let be a Borel measurable set. For every there exists an open set with such that .

Proof: First suppose is bounded. If is also closed, then we're done; is compact. Otherwise, the boundary is nonempty. Now, is a Borel measurable set, so we can approximate it from above by the previous section. That is, there exists an open set such that . Now define . By construction, this set is contained in . Moreover, it is closed, being the intersection of two closed sets. Finally, is bounded because is bounded. By the Heine-Borel Theorem, is compact, and satisfies the constraints of the theorem because

Now assume is unbounded. Let . By the preceding argument, for each there exist compact such that and . Let . Then is compact and , and since , the result follows.[2]

Littlewood's First Principle

The previous two results imply the following formulation of Littlewood's First Principle:

Theorem. If is a Borel measurable set and , then for every there is a set that is a finite union of open intervals such that , where denotes symmetric difference.

Proof: Using the previous two sections find and such that and and . As noted in the proof of the first section, is really a countable union of open intervals. These intervals form an open cover for and since is compact, only finitely many cover . Defining to be the union of these finitely many intervals, the result follows, since and .

References

  1. Littlewood, J. E. Lectures on the Theory of Functions. Oxford University Press, 1944.
  2. 2.0 2.1 Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, second edition, §1.5