<?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 2: The Lebesgue integral</title>
	<atom:link href="http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/feed/" rel="self" type="application/rss+xml" />
	<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/</link>
	<description>Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</description>
	<lastBuildDate>Tue, 18 Jun 2013 18:30:25 +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/19/245a-notes-2-the-lebesgue-integral/#comment-230907</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Thu, 23 May 2013 13:55:50 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230907</guid>
		<description><![CDATA[A remark to Egorov&#039;s theorem:


A generalization of this theorem is stated as follows,but it is not true:



(A false generalization of Egorov’s theorem) Let $latex f_n: {\bf R}^d \rightarrow {\bf C}$ be a sequence of measurable functions that converge pointwise almost everywhere to another function $latex f: {\bf R}^d \rightarrow {\bf C}\bigcup\{\infty\}$, and let $latex \epsilon &gt; 0$. Then there exists a Lebesgue measurable set $latex A$ of measure at most $latex \epsilon$, such that $latex f_n$ converges locally uniformly to $latex f$ outside of $latex A$,and $latex f$ can not reach $latex \infty$ outside of $latex A$.



Because if $latex f$ is from $latex \mathbf{R}^d$ to $latex \mathbf{C}\bigcup\{\infty\}$,then in the process of the proof, $latex \displaystyle \bigcap_{N=0}^\infty E_{N,m} = \emptyset$ will not hold.]]></description>
		<content:encoded><![CDATA[<p>A remark to Egorov&#8217;s theorem:</p>
<p>A generalization of this theorem is stated as follows,but it is not true:</p>
<p>(A false generalization of Egorov’s theorem) Let <img src='http://s0.wp.com/latex.php?latex=f_n%3A+%7B%5Cbf+R%7D%5Ed+%5Crightarrow+%7B%5Cbf+C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_n: {&#92;bf R}^d &#92;rightarrow {&#92;bf C}' title='f_n: {&#92;bf R}^d &#92;rightarrow {&#92;bf C}' class='latex' /> be a sequence of measurable functions that converge pointwise almost everywhere to another function <img src='http://s0.wp.com/latex.php?latex=f%3A+%7B%5Cbf+R%7D%5Ed+%5Crightarrow+%7B%5Cbf+C%7D%5Cbigcup%5C%7B%5Cinfty%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f: {&#92;bf R}^d &#92;rightarrow {&#92;bf C}&#92;bigcup&#92;{&#92;infty&#92;}' title='f: {&#92;bf R}^d &#92;rightarrow {&#92;bf C}&#92;bigcup&#92;{&#92;infty&#92;}' class='latex' />, and let <img src='http://s0.wp.com/latex.php?latex=%5Cepsilon+%3E+0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;epsilon &gt; 0' title='&#92;epsilon &gt; 0' class='latex' />. Then there exists a Lebesgue measurable set <img src='http://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='A' title='A' class='latex' /> of measure at most <img src='http://s0.wp.com/latex.php?latex=%5Cepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;epsilon' title='&#92;epsilon' class='latex' />, such that <img src='http://s0.wp.com/latex.php?latex=f_n&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_n' title='f_n' class='latex' /> converges locally uniformly to <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> outside of <img src='http://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='A' title='A' class='latex' />,and <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> can not reach <img src='http://s0.wp.com/latex.php?latex=%5Cinfty&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;infty' title='&#92;infty' class='latex' /> outside of <img src='http://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='A' title='A' class='latex' />.</p>
<p>Because if <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is 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 <img src='http://s0.wp.com/latex.php?latex=%5Cmathbf%7BC%7D%5Cbigcup%5C%7B%5Cinfty%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbf{C}&#92;bigcup&#92;{&#92;infty&#92;}' title='&#92;mathbf{C}&#92;bigcup&#92;{&#92;infty&#92;}' class='latex' />,then in the process of the proof, <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cbigcap_%7BN%3D0%7D%5E%5Cinfty+E_%7BN%2Cm%7D+%3D+%5Cemptyset&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle &#92;bigcap_{N=0}^&#92;infty E_{N,m} = &#92;emptyset' title='&#92;displaystyle &#92;bigcap_{N=0}^&#92;infty E_{N,m} = &#92;emptyset' class='latex' /> will not hold.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-230791</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Wed, 22 May 2013 18:36:39 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230791</guid>
		<description><![CDATA[A remark to Lusin&#039;s theorem:

I prove Lusin&#039;s theorem myself,because I don&#039;t like to see proofs provided by other people.


Theorem 18 (Lusin’s theorem) Let $latex f: \mathbf{R} \rightarrow
\mathbf{R}\bigcup\{\infty\}$ be measurable,and finite almost
everywhere, and let $latex \epsilon &gt; 0$. Then there exists a Lebesgue
measurable set $latex E \subset {\bf R}^d$ of measure at most $latex \epsilon$ such that the restriction of $latex f$ to the complementary set $latex {\bf R}^d \backslash E$ is continuous on that set.


Proof:For sake of convenience we ignore the measure zero set,let we
assume that $latex f$ is finite everywhere and measurable.Suppose that $latex f$ is pointwise approximated by a sequence of simple functions
$latex f_1,f_2,\cdots,f_n,\cdots$.According to Egorov&#039;s theorem,for any
given $latex \varepsilon_1&gt;0$,there exists a measurable $latex A\subset
\mathbf{R}$ such that $latex m(A)\leq\varepsilon_1$,and such that $latex f$ can be locally uniformly approximated by $latex f_n$.

There is little difference between a simple function and a finite
linear combination of indicator functions on boxes.In fact,$latex \displaystyle \mbox{simple function}+\mbox{vanishing function}$
$latex \displaystyle =\mbox{a finite linear combination of indicator function on}$ $latex \displaystyle \mbox{at most countable numbers of elementary sets}$, where a vanishing function means a function whose
support set has measure zero.


So it in fact does no harm to assume that $latex \forall i\in
\mathbf{N}^{+},f_i$ is a finite linear combination of indicator
functions on at most countable numbers of elementary box(Why it does
no harm?).

Suppose that the support set of $latex f_i$ is $latex \bigcup_{h=1}^{\infty}(S_h)$,where $latex \forall h\in\mathbf{N}^{+}$,$latex S_h$
is an elementary box who has positive measure.And $latex \forall k\neq
k$,$latex S_k$ and $latex S_j$ are almost disjoint.

Now $latex \forall h\in\mathbf{N}^{+}$,we take $latex S_h=[a,b]$(or
$latex (a,b),[a,b),(a,b]$),we cut a very small fraction of $latex S_h$ out,which is denoted by $latex S_{h,out}$,whose measure is $latex \varepsilon_h$,after cut $latex S_{h,out}$,$latex S_h\backslash S_{h,out}=(c,d)$ is still an elementary box,and such that $latex a&lt;c&lt;d&lt;b$.

By using the trick &quot;give yourself an epsilon of room&quot;,we can let
$latex \sum_{h\in\mathbf{N}^{+}}\varepsilon_h$ as small as possible.

So after this operation,the support set of $latex f_i$ becomes
$latex \bigcup_{h=1}^{\infty}(S_h\backslash S_{h,out})$,and we let $latex f_i$ be restricted on $latex \bigcup_{h=1}^{\infty}(S_h\backslash S_{h,out})$.After $latex f_i$ is restricted,it can be easily be verified that $latex f_i$ is continuous.


It is easy to verify that a if a sequence of continuous function convergent locally uniformly to a function,then that function is also continuous.


So Lusin&#039;s theorem is proved!]]></description>
		<content:encoded><![CDATA[<p>A remark to Lusin&#8217;s theorem:</p>
<p>I prove Lusin&#8217;s theorem myself,because I don&#8217;t like to see proofs provided by other people.</p>
<p>Theorem 18 (Lusin’s theorem) Let <img src='http://s0.wp.com/latex.php?latex=f%3A+%5Cmathbf%7BR%7D+%5Crightarrow+%5Cmathbf%7BR%7D%5Cbigcup%5C%7B%5Cinfty%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f: &#92;mathbf{R} &#92;rightarrow &#92;mathbf{R}&#92;bigcup&#92;{&#92;infty&#92;}' title='f: &#92;mathbf{R} &#92;rightarrow &#92;mathbf{R}&#92;bigcup&#92;{&#92;infty&#92;}' class='latex' /> be measurable,and finite almost<br />
everywhere, and let <img src='http://s0.wp.com/latex.php?latex=%5Cepsilon+%3E+0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;epsilon &gt; 0' title='&#92;epsilon &gt; 0' class='latex' />. Then there exists a Lebesgue<br />
measurable set <img src='http://s0.wp.com/latex.php?latex=E+%5Csubset+%7B%5Cbf+R%7D%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='E &#92;subset {&#92;bf R}^d' title='E &#92;subset {&#92;bf R}^d' class='latex' /> of measure at most <img src='http://s0.wp.com/latex.php?latex=%5Cepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;epsilon' title='&#92;epsilon' class='latex' /> such that the restriction of <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> to the complementary set <img src='http://s0.wp.com/latex.php?latex=%7B%5Cbf+R%7D%5Ed+%5Cbackslash+E&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='{&#92;bf R}^d &#92;backslash E' title='{&#92;bf R}^d &#92;backslash E' class='latex' /> is continuous on that set.</p>
<p>Proof:For sake of convenience we ignore the measure zero set,let we<br />
assume that <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is finite everywhere and measurable.Suppose that <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is pointwise approximated by a sequence of simple functions<br />
<img src='http://s0.wp.com/latex.php?latex=f_1%2Cf_2%2C%5Ccdots%2Cf_n%2C%5Ccdots&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_1,f_2,&#92;cdots,f_n,&#92;cdots' title='f_1,f_2,&#92;cdots,f_n,&#92;cdots' class='latex' />.According to Egorov&#8217;s theorem,for any<br />
given <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon_1%3E0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon_1&gt;0' title='&#92;varepsilon_1&gt;0' class='latex' />,there exists a measurable <img src='http://s0.wp.com/latex.php?latex=A%5Csubset+%5Cmathbf%7BR%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='A&#92;subset &#92;mathbf{R}' title='A&#92;subset &#92;mathbf{R}' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=m%28A%29%5Cleq%5Cvarepsilon_1&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(A)&#92;leq&#92;varepsilon_1' title='m(A)&#92;leq&#92;varepsilon_1' class='latex' />,and such that <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> can be locally uniformly approximated by <img src='http://s0.wp.com/latex.php?latex=f_n&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_n' title='f_n' class='latex' />.</p>
<p>There is little difference between a simple function and a finite<br />
linear combination of indicator functions on boxes.In fact,<img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cmbox%7Bsimple+function%7D%2B%5Cmbox%7Bvanishing+function%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle &#92;mbox{simple function}+&#92;mbox{vanishing function}' title='&#92;displaystyle &#92;mbox{simple function}+&#92;mbox{vanishing function}' class='latex' /><br />
<img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%3D%5Cmbox%7Ba+finite+linear+combination+of+indicator+function+on%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle =&#92;mbox{a finite linear combination of indicator function on}' title='&#92;displaystyle =&#92;mbox{a finite linear combination of indicator function on}' class='latex' /> <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cmbox%7Bat+most+countable+numbers+of+elementary+sets%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle &#92;mbox{at most countable numbers of elementary sets}' title='&#92;displaystyle &#92;mbox{at most countable numbers of elementary sets}' class='latex' />, where a vanishing function means a function whose<br />
support set has measure zero.</p>
<p>So it in fact does no harm to assume that <img src='http://s0.wp.com/latex.php?latex=%5Cforall+i%5Cin+%5Cmathbf%7BN%7D%5E%7B%2B%7D%2Cf_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;forall i&#92;in &#92;mathbf{N}^{+},f_i' title='&#92;forall i&#92;in &#92;mathbf{N}^{+},f_i' class='latex' /> is a finite linear combination of indicator<br />
functions on at most countable numbers of elementary box(Why it does<br />
no harm?).</p>
<p>Suppose that the support set of <img src='http://s0.wp.com/latex.php?latex=f_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_i' title='f_i' class='latex' /> is <img src='http://s0.wp.com/latex.php?latex=%5Cbigcup_%7Bh%3D1%7D%5E%7B%5Cinfty%7D%28S_h%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;bigcup_{h=1}^{&#92;infty}(S_h)' title='&#92;bigcup_{h=1}^{&#92;infty}(S_h)' class='latex' />,where <img src='http://s0.wp.com/latex.php?latex=%5Cforall+h%5Cin%5Cmathbf%7BN%7D%5E%7B%2B%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;forall h&#92;in&#92;mathbf{N}^{+}' title='&#92;forall h&#92;in&#92;mathbf{N}^{+}' class='latex' />,<img src='http://s0.wp.com/latex.php?latex=S_h&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S_h' title='S_h' class='latex' /><br />
is an elementary box who has positive measure.And <img src='http://s0.wp.com/latex.php?latex=%5Cforall+k%5Cneq+k&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;forall k&#92;neq k' title='&#92;forall k&#92;neq k' class='latex' />,<img src='http://s0.wp.com/latex.php?latex=S_k&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S_k' title='S_k' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=S_j&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S_j' title='S_j' class='latex' /> are almost disjoint.</p>
<p>Now <img src='http://s0.wp.com/latex.php?latex=%5Cforall+h%5Cin%5Cmathbf%7BN%7D%5E%7B%2B%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;forall h&#92;in&#92;mathbf{N}^{+}' title='&#92;forall h&#92;in&#92;mathbf{N}^{+}' class='latex' />,we take <img src='http://s0.wp.com/latex.php?latex=S_h%3D%5Ba%2Cb%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S_h=[a,b]' title='S_h=[a,b]' class='latex' />(or<br />
<img src='http://s0.wp.com/latex.php?latex=%28a%2Cb%29%2C%5Ba%2Cb%29%2C%28a%2Cb%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(a,b),[a,b),(a,b]' title='(a,b),[a,b),(a,b]' class='latex' />),we cut a very small fraction of <img src='http://s0.wp.com/latex.php?latex=S_h&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S_h' title='S_h' class='latex' /> out,which is denoted by <img src='http://s0.wp.com/latex.php?latex=S_%7Bh%2Cout%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S_{h,out}' title='S_{h,out}' class='latex' />,whose measure is <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon_h&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon_h' title='&#92;varepsilon_h' class='latex' />,after cut <img src='http://s0.wp.com/latex.php?latex=S_%7Bh%2Cout%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S_{h,out}' title='S_{h,out}' class='latex' />,<img src='http://s0.wp.com/latex.php?latex=S_h%5Cbackslash+S_%7Bh%2Cout%7D%3D%28c%2Cd%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='S_h&#92;backslash S_{h,out}=(c,d)' title='S_h&#92;backslash S_{h,out}=(c,d)' class='latex' /> is still an elementary box,and such that <img src='http://s0.wp.com/latex.php?latex=a%3Cc%3Cd%3Cb&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='a&lt;c&lt;d&lt;b' title='a&lt;c&lt;d&lt;b' class='latex' />.</p>
<p>By using the trick &quot;give yourself an epsilon of room&quot;,we can let<br />
<img src='http://s0.wp.com/latex.php?latex=%5Csum_%7Bh%5Cin%5Cmathbf%7BN%7D%5E%7B%2B%7D%7D%5Cvarepsilon_h&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;sum_{h&#92;in&#92;mathbf{N}^{+}}&#92;varepsilon_h' title='&#92;sum_{h&#92;in&#92;mathbf{N}^{+}}&#92;varepsilon_h' class='latex' /> as small as possible.</p>
<p>So after this operation,the support set of <img src='http://s0.wp.com/latex.php?latex=f_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_i' title='f_i' class='latex' /> becomes<br />
<img src='http://s0.wp.com/latex.php?latex=%5Cbigcup_%7Bh%3D1%7D%5E%7B%5Cinfty%7D%28S_h%5Cbackslash+S_%7Bh%2Cout%7D%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;bigcup_{h=1}^{&#92;infty}(S_h&#92;backslash S_{h,out})' title='&#92;bigcup_{h=1}^{&#92;infty}(S_h&#92;backslash S_{h,out})' class='latex' />,and we let <img src='http://s0.wp.com/latex.php?latex=f_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_i' title='f_i' class='latex' /> be restricted on <img src='http://s0.wp.com/latex.php?latex=%5Cbigcup_%7Bh%3D1%7D%5E%7B%5Cinfty%7D%28S_h%5Cbackslash+S_%7Bh%2Cout%7D%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;bigcup_{h=1}^{&#92;infty}(S_h&#92;backslash S_{h,out})' title='&#92;bigcup_{h=1}^{&#92;infty}(S_h&#92;backslash S_{h,out})' class='latex' />.After <img src='http://s0.wp.com/latex.php?latex=f_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_i' title='f_i' class='latex' /> is restricted,it can be easily be verified that <img src='http://s0.wp.com/latex.php?latex=f_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_i' title='f_i' class='latex' /> is continuous.</p>
<p>It is easy to verify that a if a sequence of continuous function convergent locally uniformly to a function,then that function is also continuous.</p>
<p>So Lusin&#039;s theorem is proved!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-230763</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Wed, 22 May 2013 15:31:32 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230763</guid>
		<description><![CDATA[A remark to Egolov&#039;s theorem:

My above comment prove Egolov&#039;s theorem,however,my writing is bad,and
lose several key point.

In my opinion,the key words of proving Egolov&#039;s theorem is &quot;localize
and minimize&quot;.We localize the region on which $latex f$ tends to infinity so as to make use of the downward monotone convergence theorem(In order to manage it successfully,we must make use of the regularity of $latex f$,because $latex f$ can be pointwise approximated by a sequence measurable functions,so $latex f$ itself must be measurable.Measurable function is lovely,it is very regular,i.e,it can be pointwise approximated by simple functions),after that,we use the trick &quot;give yourself an epsilon of room&quot;,to minimize the region on which $latex f$ tends to infinity.

We also localize the region on which $latex f$ is bounded,to avoid such case as &quot;escape to horizontal infinity&quot; happen.]]></description>
		<content:encoded><![CDATA[<p>A remark to Egolov&#8217;s theorem:</p>
<p>My above comment prove Egolov&#8217;s theorem,however,my writing is bad,and<br />
lose several key point.</p>
<p>In my opinion,the key words of proving Egolov&#8217;s theorem is &#8220;localize<br />
and minimize&#8221;.We localize the region on which <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> tends to infinity so as to make use of the downward monotone convergence theorem(In order to manage it successfully,we must make use of the regularity of <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' />,because <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> can be pointwise approximated by a sequence measurable functions,so <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> itself must be measurable.Measurable function is lovely,it is very regular,i.e,it can be pointwise approximated by simple functions),after that,we use the trick &#8220;give yourself an epsilon of room&#8221;,to minimize the region on which <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> tends to infinity.</p>
<p>We also localize the region on which <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is bounded,to avoid such case as &#8220;escape to horizontal infinity&#8221; happen.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-230755</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Wed, 22 May 2013 13:21:13 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230755</guid>
		<description><![CDATA[I have to say sorry again because it is my fault.It is  the distinction between the potential and reality.

Now I understand that In exercise 4,$latex f$ is the uniform limit of bounded simple function means there EXISTS a sequence of bounded simple functions which approximated uniformly to $latex f$...So the counterexample moving bump is no longer a counterexample,because $latex f=0$ can be approximated uniformly by $latex f_n=0$.]]></description>
		<content:encoded><![CDATA[<p>I have to say sorry again because it is my fault.It is  the distinction between the potential and reality.</p>
<p>Now I understand that In exercise 4,<img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is the uniform limit of bounded simple function means there EXISTS a sequence of bounded simple functions which approximated uniformly to <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' />&#8230;So the counterexample moving bump is no longer a counterexample,because <img src='http://s0.wp.com/latex.php?latex=f%3D0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f=0' title='f=0' class='latex' /> can be approximated uniformly by <img src='http://s0.wp.com/latex.php?latex=f_n%3D0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_n=0' title='f_n=0' class='latex' />.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-230754</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Wed, 22 May 2013 13:10:23 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230754</guid>
		<description><![CDATA[Dear Professor Tao,

I think Exercise 4 is wrong,it says:

Exercise 4 Let $latex f: \mathbf {R}^d \rightarrow [0,+\infty]$. Show that $latex f$ is a bounded unsigned measurable function if and only if $latex f$ is the uniform limit of bounded simple functions. 


A counterexample is the moving bump in Remark 7...

In order to repair,I think $latex f$ should be bounded in two directions,both horizontal and vertical.]]></description>
		<content:encoded><![CDATA[<p>Dear Professor Tao,</p>
<p>I think Exercise 4 is wrong,it says:</p>
<p>Exercise 4 Let <img src='http://s0.wp.com/latex.php?latex=f%3A+%5Cmathbf+%7BR%7D%5Ed+%5Crightarrow+%5B0%2C%2B%5Cinfty%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f: &#92;mathbf {R}^d &#92;rightarrow [0,+&#92;infty]' title='f: &#92;mathbf {R}^d &#92;rightarrow [0,+&#92;infty]' class='latex' />. Show that <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is a bounded unsigned measurable function if and only if <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is the uniform limit of bounded simple functions. </p>
<p>A counterexample is the moving bump in Remark 7&#8230;</p>
<p>In order to repair,I think <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> should be bounded in two directions,both horizontal and vertical.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-230723</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Wed, 22 May 2013 09:21:07 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230723</guid>
		<description><![CDATA[Fistly I fix this question.I should have added the additional hypothythese that $latex m(x:f_k(x)\geq a)$ should be finite.

Now I disprove this question after it is fixed.The counterexample is in Remark 7—— moving bump.I think moving bump is an interesting example,it is as matter of fact a relationship between the reality and potential.$latex f\equiv 0$ is approximated by $latex f_n:= 1_{[n,n+1]}$,this is the reality.But $latex f\equiv 0$ can be approxiamted by $latex f_n=0$,this is the potential.


So if I change my question in this way,then it will be true:



Let $latex f:\mathbf{R}\to\mathbf{R}$ be Lebesgue measurable,then there
exists a sequence of simple functions $latex f_1,f_2,\cdots,f_n,\cdots$
which convergent pointwise to $latex f$ ,such that for any real number $latex a$ and positive real number $latex \varepsilon$ which makes $latex m(x:f_k(x)\geq a)$ finite,there exists positive integer k such that $latex \displaystyle &#124;m({x:f_k(x)\geq a})-m({x:f(x)\geq a})&#124;\leq \varepsilon$.]]></description>
		<content:encoded><![CDATA[<p>Fistly I fix this question.I should have added the additional hypothythese that <img src='http://s0.wp.com/latex.php?latex=m%28x%3Af_k%28x%29%5Cgeq+a%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(x:f_k(x)&#92;geq a)' title='m(x:f_k(x)&#92;geq a)' class='latex' /> should be finite.</p>
<p>Now I disprove this question after it is fixed.The counterexample is in Remark 7—— moving bump.I think moving bump is an interesting example,it is as matter of fact a relationship between the reality and potential.<img src='http://s0.wp.com/latex.php?latex=f%5Cequiv+0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f&#92;equiv 0' title='f&#92;equiv 0' class='latex' /> is approximated by <img src='http://s0.wp.com/latex.php?latex=f_n%3A%3D+1_%7B%5Bn%2Cn%2B1%5D%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_n:= 1_{[n,n+1]}' title='f_n:= 1_{[n,n+1]}' class='latex' />,this is the reality.But <img src='http://s0.wp.com/latex.php?latex=f%5Cequiv+0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f&#92;equiv 0' title='f&#92;equiv 0' class='latex' /> can be approxiamted by <img src='http://s0.wp.com/latex.php?latex=f_n%3D0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_n=0' title='f_n=0' class='latex' />,this is the potential.</p>
<p>So if I change my question in this way,then it will be true:</p>
<p>Let <img src='http://s0.wp.com/latex.php?latex=f%3A%5Cmathbf%7BR%7D%5Cto%5Cmathbf%7BR%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f:&#92;mathbf{R}&#92;to&#92;mathbf{R}' title='f:&#92;mathbf{R}&#92;to&#92;mathbf{R}' class='latex' /> be Lebesgue measurable,then there<br />
exists a sequence of simple functions <img src='http://s0.wp.com/latex.php?latex=f_1%2Cf_2%2C%5Ccdots%2Cf_n%2C%5Ccdots&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_1,f_2,&#92;cdots,f_n,&#92;cdots' title='f_1,f_2,&#92;cdots,f_n,&#92;cdots' class='latex' /><br />
which convergent pointwise to <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> ,such that for any real number <img src='http://s0.wp.com/latex.php?latex=a&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='a' title='a' class='latex' /> and positive real number <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon' title='&#92;varepsilon' class='latex' /> which makes <img src='http://s0.wp.com/latex.php?latex=m%28x%3Af_k%28x%29%5Cgeq+a%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='m(x:f_k(x)&#92;geq a)' title='m(x:f_k(x)&#92;geq a)' class='latex' /> finite,there exists positive integer k such that <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7Cm%28%7Bx%3Af_k%28x%29%5Cgeq+a%7D%29-m%28%7Bx%3Af%28x%29%5Cgeq+a%7D%29%7C%5Cleq+%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle |m({x:f_k(x)&#92;geq a})-m({x:f(x)&#92;geq a})|&#92;leq &#92;varepsilon' title='&#92;displaystyle |m({x:f_k(x)&#92;geq a})-m({x:f(x)&#92;geq a})|&#92;leq &#92;varepsilon' class='latex' />.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-230567</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Tue, 21 May 2013 11:45:50 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230567</guid>
		<description><![CDATA[A remark to Theorem 17 (Egorov’s theorem):

I proved this theorem myself.Now I provide my general idea for proving this theorem.For sake of convenience,I take $latex f$ as a function from $latex \mathbf{R}$ to $latex \mathbf{R}$.

For any point $latex x_0\in\mathbf{R}^d$,and any  $latex \varepsilon&gt;0$, If $latex f$ is bounded on $latex (x_0-\varepsilon,x_0+\varepsilon)$,then let it be.


If $latex f$ is not bounded on $latex (x_0-\varepsilon,x_0+\varepsilon)$,then let $latex \varepsilon$ be as small
as possible,if when $latex \varepsilon&gt;0$ is small enough so that $latex f$
becomes bounded on $latex (x_0-\varepsilon,x_0+\varepsilon)$,then let it be,in such case,we call $latex x_0$ as &quot;not real infinity point&quot;.If
$latex \varepsilon$ becomes &quot;arbitrarily&quot; small but $latex f$ still keeps unbounded on $latex (x_0-\varepsilon,x_0+\varepsilon)$,then just let $latex \varepsilon$ be small enough,in this case,we call $latex x_0$ as &quot;real infinity point&quot;.


In doing so,we will separate all those open interval in $latex \mathbf{R}^d$ on which $latex f$ tends to infinity,and because we let $latex \varepsilon$ be small enough,the region we separated has measure as small as
possible(Why?hint:consider the trick give yourself an epsilon of room
http://terrytao.wordpress.com/2009/02/28/tricks-wiki-give-yourself-an-epsilon-of-room/).


Now we consider those open interval on which $latex f$ is bounded.According to http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-228116 It is easy to verify  that on those interval,$latex f_n$ converges uniformly to $latex f$.


So the Egorov’s theorem is proved!]]></description>
		<content:encoded><![CDATA[<p>A remark to Theorem 17 (Egorov’s theorem):</p>
<p>I proved this theorem myself.Now I provide my general idea for proving this theorem.For sake of convenience,I take <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> as a function from <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' /> to <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>For any point <img src='http://s0.wp.com/latex.php?latex=x_0%5Cin%5Cmathbf%7BR%7D%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='x_0&#92;in&#92;mathbf{R}^d' title='x_0&#92;in&#92;mathbf{R}^d' class='latex' />,and any  <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon%3E0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon&gt;0' title='&#92;varepsilon&gt;0' class='latex' />, If <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is bounded on <img src='http://s0.wp.com/latex.php?latex=%28x_0-%5Cvarepsilon%2Cx_0%2B%5Cvarepsilon%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(x_0-&#92;varepsilon,x_0+&#92;varepsilon)' title='(x_0-&#92;varepsilon,x_0+&#92;varepsilon)' class='latex' />,then let it be.</p>
<p>If <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is not bounded on <img src='http://s0.wp.com/latex.php?latex=%28x_0-%5Cvarepsilon%2Cx_0%2B%5Cvarepsilon%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(x_0-&#92;varepsilon,x_0+&#92;varepsilon)' title='(x_0-&#92;varepsilon,x_0+&#92;varepsilon)' class='latex' />,then let <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon' title='&#92;varepsilon' class='latex' /> be as small<br />
as possible,if when <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon%3E0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon&gt;0' title='&#92;varepsilon&gt;0' class='latex' /> is small enough so that <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /><br />
becomes bounded on <img src='http://s0.wp.com/latex.php?latex=%28x_0-%5Cvarepsilon%2Cx_0%2B%5Cvarepsilon%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(x_0-&#92;varepsilon,x_0+&#92;varepsilon)' title='(x_0-&#92;varepsilon,x_0+&#92;varepsilon)' class='latex' />,then let it be,in such case,we call <img src='http://s0.wp.com/latex.php?latex=x_0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='x_0' title='x_0' class='latex' /> as &#8220;not real infinity point&#8221;.If<br />
<img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon' title='&#92;varepsilon' class='latex' /> becomes &#8220;arbitrarily&#8221; small but <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> still keeps unbounded on <img src='http://s0.wp.com/latex.php?latex=%28x_0-%5Cvarepsilon%2Cx_0%2B%5Cvarepsilon%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(x_0-&#92;varepsilon,x_0+&#92;varepsilon)' title='(x_0-&#92;varepsilon,x_0+&#92;varepsilon)' class='latex' />,then just let <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon' title='&#92;varepsilon' class='latex' /> be small enough,in this case,we call <img src='http://s0.wp.com/latex.php?latex=x_0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='x_0' title='x_0' class='latex' /> as &#8220;real infinity point&#8221;.</p>
<p>In doing so,we will separate all those open interval 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' /> on which <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> tends to infinity,and because we let <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon' title='&#92;varepsilon' class='latex' /> be small enough,the region we separated has measure as small as<br />
possible(Why?hint:consider the trick give yourself an epsilon of room<br />
<a href="http://terrytao.wordpress.com/2009/02/28/tricks-wiki-give-yourself-an-epsilon-of-room/" rel="nofollow">http://terrytao.wordpress.com/2009/02/28/tricks-wiki-give-yourself-an-epsilon-of-room/</a>).</p>
<p>Now we consider those open interval on which <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> is bounded.According to <a href="http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-228116" rel="nofollow">http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-228116</a> It is easy to verify  that on those interval,<img src='http://s0.wp.com/latex.php?latex=f_n&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_n' title='f_n' class='latex' /> converges uniformly to <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' />.</p>
<p>So the Egorov’s theorem is proved!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-230307</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Sun, 19 May 2013 17:23:09 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230307</guid>
		<description><![CDATA[A remark to Lemma 14 (Triangle inequality) .

I enjoy Mr.Tao&#039;s proof of this lemma very much.It is a beautiful,elegant proof!I love this proof very much!


In fact,I prove it in somewhat different way,first,I approximate $latex f$ by simple functions,then I prove the triangle inequality for simple functions.



But Mr.Tao&#039;s proof is really an amazing proof,in fact,Mr.Tao&#039;s proof has a strong geometric meaning,that is,the smallest path between twp point is a line,because any curve (or polyline) through the two points can project on the line,and the function of projection can only make the length shorter !


Especially I enjoy the formula 

$latex \displaystyle &#124;\int_{{\bf R}^d} f(x)\ dx&#124; = e^{i\theta} \int_{{\bf R}^d} f(x)\ dx = \int_{{\bf R}^d} e^{i\theta} f(x)\ dx$

This formula strongly reminds me  of Fourier transform(Which I only learned from Mr.Tao&#039;s Analysis II),so I think this formula combined with my geometric meaning will give me a very vivid geometric meaning about Fourier transform!]]></description>
		<content:encoded><![CDATA[<p>A remark to Lemma 14 (Triangle inequality) .</p>
<p>I enjoy Mr.Tao&#8217;s proof of this lemma very much.It is a beautiful,elegant proof!I love this proof very much!</p>
<p>In fact,I prove it in somewhat different way,first,I approximate <img src='http://s0.wp.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f' title='f' class='latex' /> by simple functions,then I prove the triangle inequality for simple functions.</p>
<p>But Mr.Tao&#8217;s proof is really an amazing proof,in fact,Mr.Tao&#8217;s proof has a strong geometric meaning,that is,the smallest path between twp point is a line,because any curve (or polyline) through the two points can project on the line,and the function of projection can only make the length shorter !</p>
<p>Especially I enjoy the formula </p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7C%5Cint_%7B%7B%5Cbf+R%7D%5Ed%7D+f%28x%29%5C+dx%7C+%3D+e%5E%7Bi%5Ctheta%7D+%5Cint_%7B%7B%5Cbf+R%7D%5Ed%7D+f%28x%29%5C+dx+%3D+%5Cint_%7B%7B%5Cbf+R%7D%5Ed%7D+e%5E%7Bi%5Ctheta%7D+f%28x%29%5C+dx&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle |&#92;int_{{&#92;bf R}^d} f(x)&#92; dx| = e^{i&#92;theta} &#92;int_{{&#92;bf R}^d} f(x)&#92; dx = &#92;int_{{&#92;bf R}^d} e^{i&#92;theta} f(x)&#92; dx' title='&#92;displaystyle |&#92;int_{{&#92;bf R}^d} f(x)&#92; dx| = e^{i&#92;theta} &#92;int_{{&#92;bf R}^d} f(x)&#92; dx = &#92;int_{{&#92;bf R}^d} e^{i&#92;theta} f(x)&#92; dx' class='latex' /></p>
<p>This formula strongly reminds me  of Fourier transform(Which I only learned from Mr.Tao&#8217;s Analysis II),so I think this formula combined with my geometric meaning will give me a very vivid geometric meaning about Fourier transform!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-230138</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Sat, 18 May 2013 09:04:42 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-230138</guid>
		<description><![CDATA[When I was solving lemma 12(Markov&#039;s inequality),a problem came into my mind，prove or disprove it:

Let $latex f:\mathbf{R}\to\mathbf{R}$ be Lebesgue measurable,and which is pointwise approximated by simple functions $latex f_1,f_2,\cdots,f_n,\cdots$.For any real number $latex a$ and positive real number $latex \varepsilon$,there exists positive integer $latex k$ such that $latex \displaystyle &#124;m({x:f_k(x)&gt;=a})-m({x:f(x)&gt;=a})&#124;&lt;\varepsilon$.]]></description>
		<content:encoded><![CDATA[<p>When I was solving lemma 12(Markov&#8217;s inequality),a problem came into my mind，prove or disprove it:</p>
<p>Let <img src='http://s0.wp.com/latex.php?latex=f%3A%5Cmathbf%7BR%7D%5Cto%5Cmathbf%7BR%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f:&#92;mathbf{R}&#92;to&#92;mathbf{R}' title='f:&#92;mathbf{R}&#92;to&#92;mathbf{R}' class='latex' /> be Lebesgue measurable,and which is pointwise approximated by simple functions <img src='http://s0.wp.com/latex.php?latex=f_1%2Cf_2%2C%5Ccdots%2Cf_n%2C%5Ccdots&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='f_1,f_2,&#92;cdots,f_n,&#92;cdots' title='f_1,f_2,&#92;cdots,f_n,&#92;cdots' class='latex' />.For any real number <img src='http://s0.wp.com/latex.php?latex=a&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='a' title='a' class='latex' /> and positive real number <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;varepsilon' title='&#92;varepsilon' class='latex' />,there exists positive integer <img src='http://s0.wp.com/latex.php?latex=k&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='k' title='k' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7Cm%28%7Bx%3Af_k%28x%29%3E%3Da%7D%29-m%28%7Bx%3Af%28x%29%3E%3Da%7D%29%7C%3C%5Cvarepsilon&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;displaystyle |m({x:f_k(x)&gt;=a})-m({x:f(x)&gt;=a})|&lt;&#92;varepsilon' title='&#92;displaystyle |m({x:f_k(x)&gt;=a})-m({x:f(x)&gt;=a})|&lt;&#92;varepsilon' class='latex' />.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luqing Ye</title>
		<link>http://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-229680</link>
		<dc:creator><![CDATA[Luqing Ye]]></dc:creator>
		<pubDate>Thu, 16 May 2013 16:11:10 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=4145#comment-229680</guid>
		<description><![CDATA[I lose an additonal hypothythese,now I add it:$latex \forall i\neq j$,$latex G_i\bigcap G_j=\emptyset$.]]></description>
		<content:encoded><![CDATA[<p>I lose an additonal hypothythese,now I add it:<img src='http://s0.wp.com/latex.php?latex=%5Cforall+i%5Cneq+j&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;forall i&#92;neq j' title='&#92;forall i&#92;neq j' class='latex' />,<img src='http://s0.wp.com/latex.php?latex=G_i%5Cbigcap+G_j%3D%5Cemptyset&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='G_i&#92;bigcap G_j=&#92;emptyset' title='G_i&#92;bigcap G_j=&#92;emptyset' class='latex' />.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
