<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: 245A, Notes 1: Lebesgue measure</title>
	<atom:link href="http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/feed/" rel="self" type="application/rss+xml" />
	<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/</link>
	<description>Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</description>
	<lastBuildDate>Tue, 21 May 2013 02:34:17 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-228930</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Sun, 12 May 2013 07:46:10 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-228930</guid>
		<description><![CDATA[A remark to unmeasurable set:

The unmeasurable constructed in the post is called Vitali unmeasurable set,in fact,from its construction,Vitali set is highly undetermined,because it uses Axiom of Choice. The outer measure of the Vitali set ranges over $latex (0,1]$,in fact,I think from its construction,we can that the outer measure of  a Vitali set can be any real number in $latex (0,1]$.

It need not to be dense(But it could be dense),but it is must be uncountable,because any countable set is measurable.]]></description>
		<content:encoded><![CDATA[<p>A remark to unmeasurable set:</p>
<p>The unmeasurable constructed in the post is called Vitali unmeasurable set,in fact,from its construction,Vitali set is highly undetermined,because it uses Axiom of Choice. The outer measure of the Vitali set ranges over <img src='http://s0.wp.com/latex.php?latex=%280%2C1%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(0,1]' title='(0,1]' class='latex' />,in fact,I think from its construction,we can that the outer measure of  a Vitali set can be any real number in <img src='http://s0.wp.com/latex.php?latex=%280%2C1%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(0,1]' title='(0,1]' class='latex' />.</p>
<p>It need not to be dense(But it could be dense),but it is must be uncountable,because any countable set is measurable.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227612</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Sat, 04 May 2013 15:41:38 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227612</guid>
		<description><![CDATA[A remark to Exercise 27:
-----------
What is the use of the condition &quot;continuously differentiable&quot; ?


Continuously differentiable reminds of the motion of a mass point in physics.$latex S(t)$ is continuously differentiable.


Maybe with this condition,we can compute the length of the curve?Does a curve which has length in higher dimensional space has outer measure zero?What does a curve which has length mean?
-----------

The above is what I thought when I didn&#039;t know how to solve this problem.Now I figure out it,the condition &quot;continuously differentiable&quot; enable us to approximate this curve by a polygonal line very well!Note that &quot;continuous&quot; is also needed,otherwise,the curve may change so rapidly in an arbitrarily small scale that we can not approximate it well by using polygonal line.]]></description>
		<content:encoded><![CDATA[<p>A remark to Exercise 27:<br />
&#8212;&#8212;&#8212;&#8211;<br />
What is the use of the condition &#8220;continuously differentiable&#8221; ?</p>
<p>Continuously differentiable reminds of the motion of a mass point in physics.<img src='http://s0.wp.com/latex.php?latex=S%28t%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S(t)' title='S(t)' class='latex' /> is continuously differentiable.</p>
<p>Maybe with this condition,we can compute the length of the curve?Does a curve which has length in higher dimensional space has outer measure zero?What does a curve which has length mean?<br />
&#8212;&#8212;&#8212;&#8211;</p>
<p>The above is what I thought when I didn&#8217;t know how to solve this problem.Now I figure out it,the condition &#8220;continuously differentiable&#8221; enable us to approximate this curve by a polygonal line very well!Note that &#8220;continuous&#8221; is also needed,otherwise,the curve may change so rapidly in an arbitrarily small scale that we can not approximate it well by using polygonal line.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227538</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Sat, 04 May 2013 05:37:08 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227538</guid>
		<description><![CDATA[In fact,I think if there is no irrationional number in mathematical world,i.e,there exists only  rational number system in mathematics,then Jordan measure will be enough,and we don&#039;t need Lebesgue measure.


Unfortunately(Or fortunately?),there is real number system,so we need Lebesgue measure.

Jordan measure is suitable for $latex \mathbf{Q}$ ,Lebesgue measure is suitable for $latex \mathbf{R}$.

So if we only use Jordan measure in $latex \mathbf{R}$,that will be not enough.

Jordan measure is dense,but Lebesgue measure is complete!

Complete stuff is real infinity,and dense stuff is not real infinity.Like a natural number,a natural number is finite,but the set of all the natural number is infinite!]]></description>
		<content:encoded><![CDATA[<p>In fact,I think if there is no irrationional number in mathematical world,i.e,there exists only  rational number system in mathematics,then Jordan measure will be enough,and we don&#8217;t need Lebesgue measure.</p>
<p>Unfortunately(Or fortunately?),there is real number system,so we need Lebesgue measure.</p>
<p>Jordan measure is suitable for <img src='http://s0.wp.com/latex.php?latex=%5Cmathbf%7BQ%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbf{Q}' title='&#92;mathbf{Q}' class='latex' /> ,Lebesgue measure is suitable for <img src='http://s0.wp.com/latex.php?latex=%5Cmathbf%7BR%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbf{R}' title='&#92;mathbf{R}' class='latex' />.</p>
<p>So if we only use Jordan measure in <img src='http://s0.wp.com/latex.php?latex=%5Cmathbf%7BR%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbf{R}' title='&#92;mathbf{R}' class='latex' />,that will be not enough.</p>
<p>Jordan measure is dense,but Lebesgue measure is complete!</p>
<p>Complete stuff is real infinity,and dense stuff is not real infinity.Like a natural number,a natural number is finite,but the set of all the natural number is infinite!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227431</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Fri, 03 May 2013 14:28:38 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227431</guid>
		<description><![CDATA[A remark to Exercise 21:

In my comment http://terrytao.wordpress.com/2010/09/04/245a-prologue-the-problem-of-measure/#comment-226452,I have proved this result in the case of Jordan measure.

Now I begin to prove this result in the case of Lebesgue measure.Of course,I will try to base my argument on my proof in the case of Jordan measure.


So the proof becomes simple,based on two facts:

1.A Lebesgue measurable set can be  arbitrarily approximated by a Jordan measurable set.

2.A linear transformation from $latex \mathbf{R}^d$ to itself will not transform a set whose outer measure is very small to a set whose outer measure is far larger.


Fact 1 can be easily proved by the definition of Lebesgue measure.

Fact 2 can  be easily proved by the change of variables formula in Jordan measure.]]></description>
		<content:encoded><![CDATA[<p>A remark to Exercise 21:</p>
<p>In my comment <a href="http://terrytao.wordpress.com/2010/09/04/245a-prologue-the-problem-of-measure/#comment-226452,I" rel="nofollow">http://terrytao.wordpress.com/2010/09/04/245a-prologue-the-problem-of-measure/#comment-226452,I</a> have proved this result in the case of Jordan measure.</p>
<p>Now I begin to prove this result in the case of Lebesgue measure.Of course,I will try to base my argument on my proof in the case of Jordan measure.</p>
<p>So the proof becomes simple,based on two facts:</p>
<p>1.A Lebesgue measurable set can be  arbitrarily approximated by a Jordan measurable set.</p>
<p>2.A linear transformation from <img src='http://s0.wp.com/latex.php?latex=%5Cmathbf%7BR%7D%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbf{R}^d' title='&#92;mathbf{R}^d' class='latex' /> to itself will not transform a set whose outer measure is very small to a set whose outer measure is far larger.</p>
<p>Fact 1 can be easily proved by the definition of Lebesgue measure.</p>
<p>Fact 2 can  be easily proved by the change of variables formula in Jordan measure.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227390</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Fri, 03 May 2013 07:00:39 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227390</guid>
		<description><![CDATA[A remark to Exercise 15,(inner regularity).

Inner regularity is just a counterpart to outer regularity.Just consider the complement of the measurable set $latex E$ will be enough.


But now I still have something to think.In the case of outer regularity(lemma 9),why $latex U$ has to be open?


Open set.I frequently see open set in real analysis.Why open set?I think one reason mathematician like open set,is that,open set has a good property:


Every open set in $latex \mathbf{R}^d$ can be expressed uniquely into at most countable union of open boxes.


This property makes us define the outer measure more conveniently.Because it is easy to define the volume of at most countable union of open boxes.

So if we don&#039;t use open set in outer measure,to reach the same effect,we have to use at most countable union of elementary boxes instead,this becomes more inconvenient in language.]]></description>
		<content:encoded><![CDATA[<p>A remark to Exercise 15,(inner regularity).</p>
<p>Inner regularity is just a counterpart to outer regularity.Just consider the complement of the measurable set <img src='http://s0.wp.com/latex.php?latex=E&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E' title='E' class='latex' /> will be enough.</p>
<p>But now I still have something to think.In the case of outer regularity(lemma 9),why <img src='http://s0.wp.com/latex.php?latex=U&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='U' title='U' class='latex' /> has to be open?</p>
<p>Open set.I frequently see open set in real analysis.Why open set?I think one reason mathematician like open set,is that,open set has a good property:</p>
<p>Every open set in <img src='http://s0.wp.com/latex.php?latex=%5Cmathbf%7BR%7D%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbf{R}^d' title='&#92;mathbf{R}^d' class='latex' /> can be expressed uniquely into at most countable union of open boxes.</p>
<p>This property makes us define the outer measure more conveniently.Because it is easy to define the volume of at most countable union of open boxes.</p>
<p>So if we don&#8217;t use open set in outer measure,to reach the same effect,we have to use at most countable union of elementary boxes instead,this becomes more inconvenient in language.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227380</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Fri, 03 May 2013 05:19:08 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227380</guid>
		<description><![CDATA[A remark to Exercise 13,(1).

This exercise is stated as follows:

&quot;Show that if the $latex E_n$ are all Lebesgue measurable, and converge pointwise to $latex E$ , then $latex E$ is Lebesgue measurable also.&quot;

I love this exercise,because this exercise makes me think again about the distinction between the uniform convergence and pointwise convergence.

I think uniform convergence correspond to the finite intersection of sets,and pointwise convergence correspond  to the infinite(countable or uncountable) intersection of sets.

In this particular exercise,pointwise convergence correspond  to the countable  intersection of sets(Because $latex (E_n)_{n=1}^{\infty}$ is countable).]]></description>
		<content:encoded><![CDATA[<p>A remark to Exercise 13,(1).</p>
<p>This exercise is stated as follows:</p>
<p>&#8220;Show that if the <img src='http://s0.wp.com/latex.php?latex=E_n&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E_n' title='E_n' class='latex' /> are all Lebesgue measurable, and converge pointwise to <img src='http://s0.wp.com/latex.php?latex=E&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E' title='E' class='latex' /> , then <img src='http://s0.wp.com/latex.php?latex=E&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E' title='E' class='latex' /> is Lebesgue measurable also.&#8221;</p>
<p>I love this exercise,because this exercise makes me think again about the distinction between the uniform convergence and pointwise convergence.</p>
<p>I think uniform convergence correspond to the finite intersection of sets,and pointwise convergence correspond  to the infinite(countable or uncountable) intersection of sets.</p>
<p>In this particular exercise,pointwise convergence correspond  to the countable  intersection of sets(Because <img src='http://s0.wp.com/latex.php?latex=%28E_n%29_%7Bn%3D1%7D%5E%7B%5Cinfty%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(E_n)_{n=1}^{&#92;infty}' title='(E_n)_{n=1}^{&#92;infty}' class='latex' /> is countable).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227245</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Thu, 02 May 2013 08:09:36 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227245</guid>
		<description><![CDATA[
----------
A remark to Exercise 11,(2),(Downward
monotone convergence) .

It seems that the condition here is stronger than in Mr.Tao&#039;s book
&quot;Analysis&quot;,exercise 18.2.3.

In that book,the Downward monotone convergence theorem is stated as
follows:

Show that if $latex A_1\supseteq A_2\supseteq A_3\cdots$ is a decreasing
sequence of measurable sets,and $latex m(A_1)\prec +\infty$,then we have
$latex m(\bigcap_{j=1}^{\infty}A_j)=\lim_{j\to\infty}m(A_j)$.


At that time,my proof to that exercise is stated as follows:
--------------------------------

Firstly,by the $latex \sigma-$ algebra property,we know that
$latex m(\bigcap_{j=1}^{\infty}A_j)$ is measurable.

Then,it is easy to verify that $latex \displaystyle
A_1\backslash\bigcup_{i=1}^{\infty}(A_i\backslash A_{i+1})=\bigcap
_{i=1}^{\infty}A_i$.So $latex \displaystyle
m(A_1\backslash\bigcup_{i=1}^{\infty}(A_i\backslash
A_{i+1}))=m(\bigcap_{i=1}^{\infty}A_i)$.


According to the finite additivity of disjoint measurable sets,we have
$latex \displaystyle m(A_1\backslash\bigcup_{i=1}^{\infty}(A_i\backslash
A_{i+1}))=m(A_1)-m(\bigcup_{i=1}^{\infty}(A_i\backslash A_{i+1}))$.
($latex m(A_1)$ is finite,so the operation of minus makes sense).

According to Exercise 11,(1)(Upward monotone convergence),we have
$latex \displaystyle m(\bigcup_{i=1}^{\infty}(A_i\backslash
A_{i+1}))=m(A_1)-\lim_{j\to\infty}(A_j)$,so $latex \displaystyle
m(\bigcap_{j=1}^{\infty}A_j)=m(A_1\backslash\bigcup_{i=1}^{\infty}(A_i\backslash
A_{i+1}))=\lim_{j\to\infty}A_j$.

-------------------------



But,surprizingly,the condition in Exercise 11,(2) is a bit
stronger than in Mr.Tao&#039;s book,$latex m(A_1)$ does not need to be
finite,in the case of when $latex m(A_1)$ is not finite,$latex m(A_j)(j\geq 2)$ is
finite,the theorem also holds!


So I think I need to change my proof a bit to prove this stronger
theorem.Now I figure out it,I even do not need to change my
proof,because &#039;&#039;the stronger theorem&#039;&#039; only make use of the fact that
the first finite elements of a sequence do not affect its limit!HaHaHaHa...]]></description>
		<content:encoded><![CDATA[<p>&#8212;&#8212;&#8212;-<br />
A remark to Exercise 11,(2),(Downward<br />
monotone convergence) .</p>
<p>It seems that the condition here is stronger than in Mr.Tao&#8217;s book<br />
&#8220;Analysis&#8221;,exercise 18.2.3.</p>
<p>In that book,the Downward monotone convergence theorem is stated as<br />
follows:</p>
<p>Show that if <img src='http://s0.wp.com/latex.php?latex=A_1%5Csupseteq+A_2%5Csupseteq+A_3%5Ccdots&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='A_1&#92;supseteq A_2&#92;supseteq A_3&#92;cdots' title='A_1&#92;supseteq A_2&#92;supseteq A_3&#92;cdots' class='latex' /> is a decreasing<br />
sequence of measurable sets,and <img src='http://s0.wp.com/latex.php?latex=m%28A_1%29%5Cprec+%2B%5Cinfty&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(A_1)&#92;prec +&#92;infty' title='m(A_1)&#92;prec +&#92;infty' class='latex' />,then we have<br />
<img src='http://s0.wp.com/latex.php?latex=m%28%5Cbigcap_%7Bj%3D1%7D%5E%7B%5Cinfty%7DA_j%29%3D%5Clim_%7Bj%5Cto%5Cinfty%7Dm%28A_j%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(&#92;bigcap_{j=1}^{&#92;infty}A_j)=&#92;lim_{j&#92;to&#92;infty}m(A_j)' title='m(&#92;bigcap_{j=1}^{&#92;infty}A_j)=&#92;lim_{j&#92;to&#92;infty}m(A_j)' class='latex' />.</p>
<p>At that time,my proof to that exercise is stated as follows:<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8211;</p>
<p>Firstly,by the <img src='http://s0.wp.com/latex.php?latex=%5Csigma-&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;sigma-' title='&#92;sigma-' class='latex' /> algebra property,we know that<br />
<img src='http://s0.wp.com/latex.php?latex=m%28%5Cbigcap_%7Bj%3D1%7D%5E%7B%5Cinfty%7DA_j%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(&#92;bigcap_{j=1}^{&#92;infty}A_j)' title='m(&#92;bigcap_{j=1}^{&#92;infty}A_j)' class='latex' /> is measurable.</p>
<p>Then,it is easy to verify that <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+A_1%5Cbackslash%5Cbigcup_%7Bi%3D1%7D%5E%7B%5Cinfty%7D%28A_i%5Cbackslash+A_%7Bi%2B1%7D%29%3D%5Cbigcap+_%7Bi%3D1%7D%5E%7B%5Cinfty%7DA_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle A_1&#92;backslash&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1})=&#92;bigcap _{i=1}^{&#92;infty}A_i' title='&#92;displaystyle A_1&#92;backslash&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1})=&#92;bigcap _{i=1}^{&#92;infty}A_i' class='latex' />.So <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28A_1%5Cbackslash%5Cbigcup_%7Bi%3D1%7D%5E%7B%5Cinfty%7D%28A_i%5Cbackslash+A_%7Bi%2B1%7D%29%29%3Dm%28%5Cbigcap_%7Bi%3D1%7D%5E%7B%5Cinfty%7DA_i%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m(A_1&#92;backslash&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))=m(&#92;bigcap_{i=1}^{&#92;infty}A_i)' title='&#92;displaystyle m(A_1&#92;backslash&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))=m(&#92;bigcap_{i=1}^{&#92;infty}A_i)' class='latex' />.</p>
<p>According to the finite additivity of disjoint measurable sets,we have<br />
<img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28A_1%5Cbackslash%5Cbigcup_%7Bi%3D1%7D%5E%7B%5Cinfty%7D%28A_i%5Cbackslash+A_%7Bi%2B1%7D%29%29%3Dm%28A_1%29-m%28%5Cbigcup_%7Bi%3D1%7D%5E%7B%5Cinfty%7D%28A_i%5Cbackslash+A_%7Bi%2B1%7D%29%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m(A_1&#92;backslash&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))=m(A_1)-m(&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))' title='&#92;displaystyle m(A_1&#92;backslash&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))=m(A_1)-m(&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))' class='latex' />.<br />
(<img src='http://s0.wp.com/latex.php?latex=m%28A_1%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(A_1)' title='m(A_1)' class='latex' /> is finite,so the operation of minus makes sense).</p>
<p>According to Exercise 11,(1)(Upward monotone convergence),we have<br />
<img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28%5Cbigcup_%7Bi%3D1%7D%5E%7B%5Cinfty%7D%28A_i%5Cbackslash+A_%7Bi%2B1%7D%29%29%3Dm%28A_1%29-%5Clim_%7Bj%5Cto%5Cinfty%7D%28A_j%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m(&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))=m(A_1)-&#92;lim_{j&#92;to&#92;infty}(A_j)' title='&#92;displaystyle m(&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))=m(A_1)-&#92;lim_{j&#92;to&#92;infty}(A_j)' class='latex' />,so <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28%5Cbigcap_%7Bj%3D1%7D%5E%7B%5Cinfty%7DA_j%29%3Dm%28A_1%5Cbackslash%5Cbigcup_%7Bi%3D1%7D%5E%7B%5Cinfty%7D%28A_i%5Cbackslash+A_%7Bi%2B1%7D%29%29%3D%5Clim_%7Bj%5Cto%5Cinfty%7DA_j&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m(&#92;bigcap_{j=1}^{&#92;infty}A_j)=m(A_1&#92;backslash&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))=&#92;lim_{j&#92;to&#92;infty}A_j' title='&#92;displaystyle m(&#92;bigcap_{j=1}^{&#92;infty}A_j)=m(A_1&#92;backslash&#92;bigcup_{i=1}^{&#92;infty}(A_i&#92;backslash A_{i+1}))=&#92;lim_{j&#92;to&#92;infty}A_j' class='latex' />.</p>
<p>&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-</p>
<p>But,surprizingly,the condition in Exercise 11,(2) is a bit<br />
stronger than in Mr.Tao&#8217;s book,<img src='http://s0.wp.com/latex.php?latex=m%28A_1%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(A_1)' title='m(A_1)' class='latex' /> does not need to be<br />
finite,in the case of when <img src='http://s0.wp.com/latex.php?latex=m%28A_1%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(A_1)' title='m(A_1)' class='latex' /> is not finite,<img src='http://s0.wp.com/latex.php?latex=m%28A_j%29%28j%5Cgeq+2%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(A_j)(j&#92;geq 2)' title='m(A_j)(j&#92;geq 2)' class='latex' /> is<br />
finite,the theorem also holds!</p>
<p>So I think I need to change my proof a bit to prove this stronger<br />
theorem.Now I figure out it,I even do not need to change my<br />
proof,because &#8221;the stronger theorem&#8221; only make use of the fact that<br />
the first finite elements of a sequence do not affect its limit!HaHaHaHa&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227158</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Wed, 01 May 2013 18:12:45 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227158</guid>
		<description><![CDATA[A remark to lemma 11(countable additivity),(2).

This lemma tells us the simple fact that disjoint Lebesgue measurable sets has the property of countable additivity,the proof,however,is rather tough,and long.


When faced with such a proof,I usually do not like to read it,because even though I read it,the proof still belongs to the one who find out it.Mathematics,do not like other subjects such as language——Even if you see a proof many times , it still do not belongs to you.In order to truely understand a proof,you have to find it out yourself,or,if the proof is so hard that it does not worth to invest too much time in it, at least you should try to simplify it or rewrite it in your own way,or decompose it in simpler steps.

So I find a proof myself,I think my proof is a bit simpler than Mr.Tao&#039;s proof.Now let me start the proof.




As a preliminary,I have already proved that a set is L-measurable iff it satisfy the Carathéodory criterion.


Let $latex T=\bigcup_{j\in \mathbf{N}^+}E_j$,We first prove that $latex T$ is L-measurable,that is ,according to Caratheodory criterion,$latex \forall A\in\mathbf{R}^d$,$latex m^*(A)=m^*(A\backslash T)+m^*(A\bigcap T)$.


According to the sub-additivity property of outer measure,we know that $latex m^*(A)\leq m^*(A\backslash T)+m^*(A\bigcap T)$,so we only need to prove that $latex m^*(A)\geq m^*(A\backslash T)+m^*(A\bigcap T)$.



According to the Morgan law,we just need to prove that

$latex \displaystyle m^*(A)\geq m^*(A\backslash T)+m^*(\bigcup_{j\in \mathbf{N}^+}(A\bigcap E_j))$.


According to the outer regularity(Lemma 9,see also my comment http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227019 ),we just need to prove that 

$latex \displaystyle m^*(A)\geq m^*(A\backslash T)+\lim_{N\to\infty}m^*((\bigcup_{i=1}^N(A\bigcap E_i)))$.


According to the Monotonicity property of outer measure,we know that  $latex \displaystyle m^*(A\backslash T)+\lim_{N\to\infty}m^*(\bigcup_{i=1}^N(A\bigcap E_i))\leq m^*(A\backslash \lim_{N\to\infty}(\bigcup_{j=1}^NE_j))+\lim_{N\to\infty}m^*(\bigcup_{i=1}^N(A\bigcap E_i))$.

So we just need to prove that 

$latex \displaystyle m^*(A)\geq m^*(A\backslash \lim_{N\to\infty}(\bigcup_{j=1}^NE_j))+\lim_{N\to\infty}m^*((\bigcup_{i=1}^N(A\bigcap E_i)))$.............(1)


According to the L-measurability of $latex E_j$(together with the mathematical induction),we know that 

$latex \displaystyle m^*(A)=m^*(A\backslash \lim_{N\to\infty}(\bigcup_{j=1}^NE_j))+\lim_{N\to\infty}m^*(A\bigcap(\bigcup_{i=1}^NE_i))$,


so (1) holds.So $latex T$ is L-measurable.Now we prove that 


$latex \displaystyle m(\bigcup_{j\in \mathbf{N}^+}E_j)=\sum_{j\in \mathbf{N}^+}m(E_j)$.

According to the outer regularity(Lemma 9,see also my comment http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227019 ),we have 


$latex \displaystyle m(\bigcup_{j\in \mathbf{N}^+}E_j)=\lim_{N\to\infty}m^*(\bigcup_{j=1}^NE_j)$.

Then according to the finite additivity of disjoint L-measurable sets(The finite additivity of disjoint L-measurable sets can be easily proved by using Caratheodory criterion together with the mathematical induction.),we have $latex \displaystyle m(\bigcup_{j\in J}E_j)=\lim_{N\to\infty}m^*(\bigcup_{j=1}^NE_j)=\lim_{N\to\infty}\sum_{j=1}^Nm^*(E_j)$.


Done.$latex \Box$]]></description>
		<content:encoded><![CDATA[<p>A remark to lemma 11(countable additivity),(2).</p>
<p>This lemma tells us the simple fact that disjoint Lebesgue measurable sets has the property of countable additivity,the proof,however,is rather tough,and long.</p>
<p>When faced with such a proof,I usually do not like to read it,because even though I read it,the proof still belongs to the one who find out it.Mathematics,do not like other subjects such as language——Even if you see a proof many times , it still do not belongs to you.In order to truely understand a proof,you have to find it out yourself,or,if the proof is so hard that it does not worth to invest too much time in it, at least you should try to simplify it or rewrite it in your own way,or decompose it in simpler steps.</p>
<p>So I find a proof myself,I think my proof is a bit simpler than Mr.Tao&#8217;s proof.Now let me start the proof.</p>
<p>As a preliminary,I have already proved that a set is L-measurable iff it satisfy the Carathéodory criterion.</p>
<p>Let <img src='http://s0.wp.com/latex.php?latex=T%3D%5Cbigcup_%7Bj%5Cin+%5Cmathbf%7BN%7D%5E%2B%7DE_j&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='T=&#92;bigcup_{j&#92;in &#92;mathbf{N}^+}E_j' title='T=&#92;bigcup_{j&#92;in &#92;mathbf{N}^+}E_j' class='latex' />,We first prove that <img src='http://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='T' title='T' class='latex' /> is L-measurable,that is ,according to Caratheodory criterion,<img src='http://s0.wp.com/latex.php?latex=%5Cforall+A%5Cin%5Cmathbf%7BR%7D%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;forall A&#92;in&#92;mathbf{R}^d' title='&#92;forall A&#92;in&#92;mathbf{R}^d' class='latex' />,<img src='http://s0.wp.com/latex.php?latex=m%5E%2A%28A%29%3Dm%5E%2A%28A%5Cbackslash+T%29%2Bm%5E%2A%28A%5Cbigcap+T%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m^*(A)=m^*(A&#92;backslash T)+m^*(A&#92;bigcap T)' title='m^*(A)=m^*(A&#92;backslash T)+m^*(A&#92;bigcap T)' class='latex' />.</p>
<p>According to the sub-additivity property of outer measure,we know that <img src='http://s0.wp.com/latex.php?latex=m%5E%2A%28A%29%5Cleq+m%5E%2A%28A%5Cbackslash+T%29%2Bm%5E%2A%28A%5Cbigcap+T%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m^*(A)&#92;leq m^*(A&#92;backslash T)+m^*(A&#92;bigcap T)' title='m^*(A)&#92;leq m^*(A&#92;backslash T)+m^*(A&#92;bigcap T)' class='latex' />,so we only need to prove that <img src='http://s0.wp.com/latex.php?latex=m%5E%2A%28A%29%5Cgeq+m%5E%2A%28A%5Cbackslash+T%29%2Bm%5E%2A%28A%5Cbigcap+T%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m^*(A)&#92;geq m^*(A&#92;backslash T)+m^*(A&#92;bigcap T)' title='m^*(A)&#92;geq m^*(A&#92;backslash T)+m^*(A&#92;bigcap T)' class='latex' />.</p>
<p>According to the Morgan law,we just need to prove that</p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%5E%2A%28A%29%5Cgeq+m%5E%2A%28A%5Cbackslash+T%29%2Bm%5E%2A%28%5Cbigcup_%7Bj%5Cin+%5Cmathbf%7BN%7D%5E%2B%7D%28A%5Cbigcap+E_j%29%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m^*(A)&#92;geq m^*(A&#92;backslash T)+m^*(&#92;bigcup_{j&#92;in &#92;mathbf{N}^+}(A&#92;bigcap E_j))' title='&#92;displaystyle m^*(A)&#92;geq m^*(A&#92;backslash T)+m^*(&#92;bigcup_{j&#92;in &#92;mathbf{N}^+}(A&#92;bigcap E_j))' class='latex' />.</p>
<p>According to the outer regularity(Lemma 9,see also my comment <a href="http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227019" rel="nofollow">http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227019</a> ),we just need to prove that </p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%5E%2A%28A%29%5Cgeq+m%5E%2A%28A%5Cbackslash+T%29%2B%5Clim_%7BN%5Cto%5Cinfty%7Dm%5E%2A%28%28%5Cbigcup_%7Bi%3D1%7D%5EN%28A%5Cbigcap+E_i%29%29%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m^*(A)&#92;geq m^*(A&#92;backslash T)+&#92;lim_{N&#92;to&#92;infty}m^*((&#92;bigcup_{i=1}^N(A&#92;bigcap E_i)))' title='&#92;displaystyle m^*(A)&#92;geq m^*(A&#92;backslash T)+&#92;lim_{N&#92;to&#92;infty}m^*((&#92;bigcup_{i=1}^N(A&#92;bigcap E_i)))' class='latex' />.</p>
<p>According to the Monotonicity property of outer measure,we know that  <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%5E%2A%28A%5Cbackslash+T%29%2B%5Clim_%7BN%5Cto%5Cinfty%7Dm%5E%2A%28%5Cbigcup_%7Bi%3D1%7D%5EN%28A%5Cbigcap+E_i%29%29%5Cleq+m%5E%2A%28A%5Cbackslash+%5Clim_%7BN%5Cto%5Cinfty%7D%28%5Cbigcup_%7Bj%3D1%7D%5ENE_j%29%29%2B%5Clim_%7BN%5Cto%5Cinfty%7Dm%5E%2A%28%5Cbigcup_%7Bi%3D1%7D%5EN%28A%5Cbigcap+E_i%29%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m^*(A&#92;backslash T)+&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{i=1}^N(A&#92;bigcap E_i))&#92;leq m^*(A&#92;backslash &#92;lim_{N&#92;to&#92;infty}(&#92;bigcup_{j=1}^NE_j))+&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{i=1}^N(A&#92;bigcap E_i))' title='&#92;displaystyle m^*(A&#92;backslash T)+&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{i=1}^N(A&#92;bigcap E_i))&#92;leq m^*(A&#92;backslash &#92;lim_{N&#92;to&#92;infty}(&#92;bigcup_{j=1}^NE_j))+&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{i=1}^N(A&#92;bigcap E_i))' class='latex' />.</p>
<p>So we just need to prove that </p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%5E%2A%28A%29%5Cgeq+m%5E%2A%28A%5Cbackslash+%5Clim_%7BN%5Cto%5Cinfty%7D%28%5Cbigcup_%7Bj%3D1%7D%5ENE_j%29%29%2B%5Clim_%7BN%5Cto%5Cinfty%7Dm%5E%2A%28%28%5Cbigcup_%7Bi%3D1%7D%5EN%28A%5Cbigcap+E_i%29%29%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m^*(A)&#92;geq m^*(A&#92;backslash &#92;lim_{N&#92;to&#92;infty}(&#92;bigcup_{j=1}^NE_j))+&#92;lim_{N&#92;to&#92;infty}m^*((&#92;bigcup_{i=1}^N(A&#92;bigcap E_i)))' title='&#92;displaystyle m^*(A)&#92;geq m^*(A&#92;backslash &#92;lim_{N&#92;to&#92;infty}(&#92;bigcup_{j=1}^NE_j))+&#92;lim_{N&#92;to&#92;infty}m^*((&#92;bigcup_{i=1}^N(A&#92;bigcap E_i)))' class='latex' />&#8230;&#8230;&#8230;&#8230;.(1)</p>
<p>According to the L-measurability of <img src='http://s0.wp.com/latex.php?latex=E_j&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E_j' title='E_j' class='latex' />(together with the mathematical induction),we know that </p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%5E%2A%28A%29%3Dm%5E%2A%28A%5Cbackslash+%5Clim_%7BN%5Cto%5Cinfty%7D%28%5Cbigcup_%7Bj%3D1%7D%5ENE_j%29%29%2B%5Clim_%7BN%5Cto%5Cinfty%7Dm%5E%2A%28A%5Cbigcap%28%5Cbigcup_%7Bi%3D1%7D%5ENE_i%29%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m^*(A)=m^*(A&#92;backslash &#92;lim_{N&#92;to&#92;infty}(&#92;bigcup_{j=1}^NE_j))+&#92;lim_{N&#92;to&#92;infty}m^*(A&#92;bigcap(&#92;bigcup_{i=1}^NE_i))' title='&#92;displaystyle m^*(A)=m^*(A&#92;backslash &#92;lim_{N&#92;to&#92;infty}(&#92;bigcup_{j=1}^NE_j))+&#92;lim_{N&#92;to&#92;infty}m^*(A&#92;bigcap(&#92;bigcup_{i=1}^NE_i))' class='latex' />,</p>
<p>so (1) holds.So <img src='http://s0.wp.com/latex.php?latex=T&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='T' title='T' class='latex' /> is L-measurable.Now we prove that </p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28%5Cbigcup_%7Bj%5Cin+%5Cmathbf%7BN%7D%5E%2B%7DE_j%29%3D%5Csum_%7Bj%5Cin+%5Cmathbf%7BN%7D%5E%2B%7Dm%28E_j%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m(&#92;bigcup_{j&#92;in &#92;mathbf{N}^+}E_j)=&#92;sum_{j&#92;in &#92;mathbf{N}^+}m(E_j)' title='&#92;displaystyle m(&#92;bigcup_{j&#92;in &#92;mathbf{N}^+}E_j)=&#92;sum_{j&#92;in &#92;mathbf{N}^+}m(E_j)' class='latex' />.</p>
<p>According to the outer regularity(Lemma 9,see also my comment <a href="http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227019" rel="nofollow">http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227019</a> ),we have </p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28%5Cbigcup_%7Bj%5Cin+%5Cmathbf%7BN%7D%5E%2B%7DE_j%29%3D%5Clim_%7BN%5Cto%5Cinfty%7Dm%5E%2A%28%5Cbigcup_%7Bj%3D1%7D%5ENE_j%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m(&#92;bigcup_{j&#92;in &#92;mathbf{N}^+}E_j)=&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{j=1}^NE_j)' title='&#92;displaystyle m(&#92;bigcup_{j&#92;in &#92;mathbf{N}^+}E_j)=&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{j=1}^NE_j)' class='latex' />.</p>
<p>Then according to the finite additivity of disjoint L-measurable sets(The finite additivity of disjoint L-measurable sets can be easily proved by using Caratheodory criterion together with the mathematical induction.),we have <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28%5Cbigcup_%7Bj%5Cin+J%7DE_j%29%3D%5Clim_%7BN%5Cto%5Cinfty%7Dm%5E%2A%28%5Cbigcup_%7Bj%3D1%7D%5ENE_j%29%3D%5Clim_%7BN%5Cto%5Cinfty%7D%5Csum_%7Bj%3D1%7D%5ENm%5E%2A%28E_j%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m(&#92;bigcup_{j&#92;in J}E_j)=&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{j=1}^NE_j)=&#92;lim_{N&#92;to&#92;infty}&#92;sum_{j=1}^Nm^*(E_j)' title='&#92;displaystyle m(&#92;bigcup_{j&#92;in J}E_j)=&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{j=1}^NE_j)=&#92;lim_{N&#92;to&#92;infty}&#92;sum_{j=1}^Nm^*(E_j)' class='latex' />.</p>
<p>Done.<img src='http://s0.wp.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;Box' title='&#92;Box' class='latex' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227019</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Tue, 30 Apr 2013 17:43:11 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227019</guid>
		<description><![CDATA[A remark to Lemma 9(outer regularity) 

Outer regularity can also be stated as this way,which is also the way I prefer:

$latex \displaystyle m^*(\bigcup_{j\in \mathbb{N}^+}E_j)=\lim_{N\to\infty}m^*(\bigcup_{j=1}^{N}E_j)$]]></description>
		<content:encoded><![CDATA[<p>A remark to Lemma 9(outer regularity) </p>
<p>Outer regularity can also be stated as this way,which is also the way I prefer:</p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%5E%2A%28%5Cbigcup_%7Bj%5Cin+%5Cmathbb%7BN%7D%5E%2B%7DE_j%29%3D%5Clim_%7BN%5Cto%5Cinfty%7Dm%5E%2A%28%5Cbigcup_%7Bj%3D1%7D%5E%7BN%7DE_j%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle m^*(&#92;bigcup_{j&#92;in &#92;mathbb{N}^+}E_j)=&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{j=1}^{N}E_j)' title='&#92;displaystyle m^*(&#92;bigcup_{j&#92;in &#92;mathbb{N}^+}E_j)=&#92;lim_{N&#92;to&#92;infty}m^*(&#92;bigcup_{j=1}^{N}E_j)' class='latex' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/09/245a-notes-1-lebesgue-measure/#comment-227016</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Tue, 30 Apr 2013 17:25:05 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4062#comment-227016</guid>
		<description><![CDATA[A remark to Lemma 8:

&quot;Let  $latex E\subset \mathbf{R}^d$ be an open set. Then $latex E$ can be expressed as the countable union of almost disjoint boxes (and, in fact, as the countable union of almost disjoint closed cubes).&quot;



I think that the following is also true:

Let $latex E\subset \mathbf{R}^d$ be an open set. Then $latex E$ can be expressed UNIQUELY as the countable union of  disjoint open boxes.]]></description>
		<content:encoded><![CDATA[<p>A remark to Lemma 8:</p>
<p>&#8220;Let  <img src='http://s0.wp.com/latex.php?latex=E%5Csubset+%5Cmathbf%7BR%7D%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E&#92;subset &#92;mathbf{R}^d' title='E&#92;subset &#92;mathbf{R}^d' class='latex' /> be an open set. Then <img src='http://s0.wp.com/latex.php?latex=E&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E' title='E' class='latex' /> can be expressed as the countable union of almost disjoint boxes (and, in fact, as the countable union of almost disjoint closed cubes).&#8221;</p>
<p>I think that the following is also true:</p>
<p>Let <img src='http://s0.wp.com/latex.php?latex=E%5Csubset+%5Cmathbf%7BR%7D%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E&#92;subset &#92;mathbf{R}^d' title='E&#92;subset &#92;mathbf{R}^d' class='latex' /> be an open set. Then <img src='http://s0.wp.com/latex.php?latex=E&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E' title='E' class='latex' /> can be expressed UNIQUELY as the countable union of  disjoint open boxes.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
