<?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: The strong law of large numbers</title>
	<atom:link href="http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/feed/" rel="self" type="application/rss+xml" />
	<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/</link>
	<description>Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</description>
	<lastBuildDate>Fri, 24 May 2013 18:38:29 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Mate Wierdl</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-228297</link>
		<dc:creator><![CDATA[Mate Wierdl]]></dc:creator>
		<pubDate>Wed, 08 May 2013 13:59:17 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-228297</guid>
		<description><![CDATA[Hi Terry! Maybe a few exercises could be added based on the following remarks:

If we assume finite second moment then only &quot;multiplicativity&quot; is needed.  By multiplicativity, I mean $latex \mathbb EX_iX_j=\mathbb E X_i \mathbb E X_j$.  This translates to orthogonality if the expectations are $\latex 0$. 

An application would be Weyl&#039;s result: if $latex  n_1&lt;n_2&lt;n_3&lt;\dots$ is a sequence of integers then for almost all $latex \alpha$, the sequence $latex n_1\alpha, n_2\alpha, n_3\alpha,dots$ is uniformly distributed $latex \mod 1$. For this,  we take $latex X_i=\exp(2\pi i n_i \alpha)$.

With this mutiplicativity assumption, one can simply get results for random variables with varying expectations: Consider nonnegative random variables with varying expectation, but then we would divide by the expectation of the sum of the first $n$ random variables instead of $latex n$ to get the right normalization.   For example, the expectations can go to $latex 0$ arbitrary slowly as long as $latex \sum_i \mathbb EX_i=\infty$. But the expectations can also go to $latex \infty$! They cannot increase arbitrary fast: something like $latex \mathbb EX_i = O(2^{i^b})$ for $latex b&lt;1/2$ seems to be the limit for a strong law, while for norm (weak) convergence, one can get arbitrary close to $latex 2^i$, that is we can have $latex \mathbb E X_i = 2^{o(i)}$. 

I think these are good exercises for using and testing the limits of this &quot;lacunary subsequence&quot; trick.]]></description>
		<content:encoded><![CDATA[<p>Hi Terry! Maybe a few exercises could be added based on the following remarks:</p>
<p>If we assume finite second moment then only &#8220;multiplicativity&#8221; is needed.  By multiplicativity, I mean <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb+EX_iX_j%3D%5Cmathbb+E+X_i+%5Cmathbb+E+X_j&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbb EX_iX_j=&#92;mathbb E X_i &#92;mathbb E X_j' title='&#92;mathbb EX_iX_j=&#92;mathbb E X_i &#92;mathbb E X_j' class='latex' />.  This translates to orthogonality if the expectations are $\latex 0$. </p>
<p>An application would be Weyl&#8217;s result: if <img src='http://s0.wp.com/latex.php?latex=n_1%3Cn_2%3Cn_3%3C%5Cdots&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='n_1&lt;n_2&lt;n_3&lt;&#92;dots' title='n_1&lt;n_2&lt;n_3&lt;&#92;dots' class='latex' /> is a sequence of integers then for almost all <img src='http://s0.wp.com/latex.php?latex=%5Calpha&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;alpha' title='&#92;alpha' class='latex' />, the sequence <img src='http://s0.wp.com/latex.php?latex=n_1%5Calpha%2C+n_2%5Calpha%2C+n_3%5Calpha%2Cdots&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='n_1&#92;alpha, n_2&#92;alpha, n_3&#92;alpha,dots' title='n_1&#92;alpha, n_2&#92;alpha, n_3&#92;alpha,dots' class='latex' /> is uniformly distributed <img src='http://s0.wp.com/latex.php?latex=%5Cmod+1&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mod 1' title='&#92;mod 1' class='latex' />. For this,  we take <img src='http://s0.wp.com/latex.php?latex=X_i%3D%5Cexp%282%5Cpi+i+n_i+%5Calpha%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='X_i=&#92;exp(2&#92;pi i n_i &#92;alpha)' title='X_i=&#92;exp(2&#92;pi i n_i &#92;alpha)' class='latex' />.</p>
<p>With this mutiplicativity assumption, one can simply get results for random variables with varying expectations: Consider nonnegative random variables with varying expectation, but then we would divide by the expectation of the sum of the first $n$ random variables instead of <img src='http://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='n' title='n' class='latex' /> to get the right normalization.   For example, the expectations can go to <img src='http://s0.wp.com/latex.php?latex=0&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='0' title='0' class='latex' /> arbitrary slowly as long as <img src='http://s0.wp.com/latex.php?latex=%5Csum_i+%5Cmathbb+EX_i%3D%5Cinfty&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;sum_i &#92;mathbb EX_i=&#92;infty' title='&#92;sum_i &#92;mathbb EX_i=&#92;infty' class='latex' />. But the expectations can also go to <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' />! They cannot increase arbitrary fast: something like <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb+EX_i+%3D+O%282%5E%7Bi%5Eb%7D%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbb EX_i = O(2^{i^b})' title='&#92;mathbb EX_i = O(2^{i^b})' class='latex' /> for <img src='http://s0.wp.com/latex.php?latex=b%3C1%2F2&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='b&lt;1/2' title='b&lt;1/2' class='latex' /> seems to be the limit for a strong law, while for norm (weak) convergence, one can get arbitrary close to <img src='http://s0.wp.com/latex.php?latex=2%5Ei&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='2^i' title='2^i' class='latex' />, that is we can have <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb+E+X_i+%3D+2%5E%7Bo%28i%29%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;mathbb E X_i = 2^{o(i)}' title='&#92;mathbb E X_i = 2^{o(i)}' class='latex' />. </p>
<p>I think these are good exercises for using and testing the limits of this &quot;lacunary subsequence&quot; trick.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Laws of large numbers and Birkhoff&#8217;s ergodic theorem &#124; Vaughn Climenhaga&#039;s Math Blog</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-219053</link>
		<dc:creator><![CDATA[Laws of large numbers and Birkhoff&#8217;s ergodic theorem &#124; Vaughn Climenhaga&#039;s Math Blog]]></dc:creator>
		<pubDate>Sun, 10 Mar 2013 03:36:12 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-219053</guid>
		<description><![CDATA[[...] including a different proof of the weak law than the one above, can be found on Terry Tao&#8217;s blog), we observe that the strong law of large numbers can be viewed as a special case of the Birkhoff [...]]]></description>
		<content:encoded><![CDATA[<p>[...] including a different proof of the weak law than the one above, can be found on Terry Tao&#8217;s blog), we observe that the strong law of large numbers can be viewed as a special case of the Birkhoff [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Iosif Pinelis</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-215916</link>
		<dc:creator><![CDATA[Iosif Pinelis]]></dc:creator>
		<pubDate>Wed, 06 Feb 2013 04:01:15 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-215916</guid>
		<description><![CDATA[Thank you for the help with LaTeX. A couple more points here: 

(i) Of course, I wanted to say &quot;the pairwise independence does not imply the stationarity, even if the $latex X_i$&#039;s are identically distributed&quot;, rather than just &quot;the pairwise independence does not imply the stationarity&quot;. 

(ii) Tao&#039;s result, with the pairwise independence rather than with the complete independence, can be extended in a standard manner to the case when the $latex X_i$&#039;s take values in an arbitrary separable Banach space (say).]]></description>
		<content:encoded><![CDATA[<p>Thank you for the help with LaTeX. A couple more points here: </p>
<p>(i) Of course, I wanted to say &#8220;the pairwise independence does not imply the stationarity, even if the <img src='http://s0.wp.com/latex.php?latex=X_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='X_i' title='X_i' class='latex' />&#8216;s are identically distributed&#8221;, rather than just &#8220;the pairwise independence does not imply the stationarity&#8221;. </p>
<p>(ii) Tao&#8217;s result, with the pairwise independence rather than with the complete independence, can be extended in a standard manner to the case when the <img src='http://s0.wp.com/latex.php?latex=X_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='X_i' title='X_i' class='latex' />&#8216;s take values in an arbitrary separable Banach space (say).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Iosif Pinelis</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-215780</link>
		<dc:creator><![CDATA[Iosif Pinelis]]></dc:creator>
		<pubDate>Tue, 05 Feb 2013 05:05:44 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-215780</guid>
		<description><![CDATA[I think this result and proof are very nice. There is a vague commonality between Keane&#039;s and Tao&#039;s proof: both exploit, to an extent, the fact that the sample mean $latex \bar{X}_n$ varies little, in a sense, with $latex n$. It is also nice that Tao&#039;s result is not contained in the ergodic theorem. Indeed, one can easily see that the pairwise independence does not imply the stationarity. E.g., let $latex X_1,\dots,X_6$ be defined as $latex R_1, R_2, R_1R_2, R_1R_3, R_2R_3, R_1R_2R_3$, respectively, where the $latex R_i$&#039;s are independent Rademacher random variables, each taking each of the values $latex 1, -1$ with probability 1/2. Define $latex X_7,\dots,X_{12}$ similarly, based on $latex R_4, R_5, R_6$; etc. Then the $latex X_i$&#039;s are pairwise independent. However, $latex P(X_1X_2X_3=1)=1$, whereas $latex P(X_4X_5X_6=1)=1/2$. So, the sequence $latex (X_i)$ is not stationary. 

&lt;i&gt;[LaTeX code corrected; the problem was the lack of a space between &quot;latex&quot; and the LaTeX code. Also, the curly braces were unnecessary. -T]&lt;/i&gt;]]></description>
		<content:encoded><![CDATA[<p>I think this result and proof are very nice. There is a vague commonality between Keane&#8217;s and Tao&#8217;s proof: both exploit, to an extent, the fact that the sample mean <img src='http://s0.wp.com/latex.php?latex=%5Cbar%7BX%7D_n&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='&#92;bar{X}_n' title='&#92;bar{X}_n' class='latex' /> varies little, in a sense, with <img src='http://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='n' title='n' class='latex' />. It is also nice that Tao&#8217;s result is not contained in the ergodic theorem. Indeed, one can easily see that the pairwise independence does not imply the stationarity. E.g., let <img src='http://s0.wp.com/latex.php?latex=X_1%2C%5Cdots%2CX_6&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='X_1,&#92;dots,X_6' title='X_1,&#92;dots,X_6' class='latex' /> be defined as <img src='http://s0.wp.com/latex.php?latex=R_1%2C+R_2%2C+R_1R_2%2C+R_1R_3%2C+R_2R_3%2C+R_1R_2R_3&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='R_1, R_2, R_1R_2, R_1R_3, R_2R_3, R_1R_2R_3' title='R_1, R_2, R_1R_2, R_1R_3, R_2R_3, R_1R_2R_3' class='latex' />, respectively, where the <img src='http://s0.wp.com/latex.php?latex=R_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='R_i' title='R_i' class='latex' />&#8216;s are independent Rademacher random variables, each taking each of the values <img src='http://s0.wp.com/latex.php?latex=1%2C+-1&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='1, -1' title='1, -1' class='latex' /> with probability 1/2. Define <img src='http://s0.wp.com/latex.php?latex=X_7%2C%5Cdots%2CX_%7B12%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='X_7,&#92;dots,X_{12}' title='X_7,&#92;dots,X_{12}' class='latex' /> similarly, based on <img src='http://s0.wp.com/latex.php?latex=R_4%2C+R_5%2C+R_6&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='R_4, R_5, R_6' title='R_4, R_5, R_6' class='latex' />; etc. Then the <img src='http://s0.wp.com/latex.php?latex=X_i&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='X_i' title='X_i' class='latex' />&#8216;s are pairwise independent. However, <img src='http://s0.wp.com/latex.php?latex=P%28X_1X_2X_3%3D1%29%3D1&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='P(X_1X_2X_3=1)=1' title='P(X_1X_2X_3=1)=1' class='latex' />, whereas <img src='http://s0.wp.com/latex.php?latex=P%28X_4X_5X_6%3D1%29%3D1%2F2&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='P(X_4X_5X_6=1)=1/2' title='P(X_4X_5X_6=1)=1/2' class='latex' />. So, the sequence <img src='http://s0.wp.com/latex.php?latex=%28X_i%29&amp;bg=ffffff&amp;fg=545454&amp;s=0' alt='(X_i)' title='(X_i)' class='latex' /> is not stationary. </p>
<p><i>[LaTeX code corrected; the problem was the lack of a space between "latex" and the LaTeX code. Also, the curly braces were unnecessary. -T]</i></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: abc</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-123960</link>
		<dc:creator><![CDATA[abc]]></dc:creator>
		<pubDate>Sat, 21 Jan 2012 23:00:33 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-123960</guid>
		<description><![CDATA[It seems like the proof of the pointwise ergodic theorem is easier than this proof! Inspecting that proof, it uses the the added generality of measure-preserving systems to deal with functions that you could not talk about (naturally) in the setting of the strong law of large numbers.]]></description>
		<content:encoded><![CDATA[<p>It seems like the proof of the pointwise ergodic theorem is easier than this proof! Inspecting that proof, it uses the the added generality of measure-preserving systems to deal with functions that you could not talk about (naturally) in the setting of the strong law of large numbers.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Note on the weak and strong laws of large numbers &#124; Mathematics and me-themed antics.</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-101470</link>
		<dc:creator><![CDATA[Note on the weak and strong laws of large numbers &#124; Mathematics and me-themed antics.]]></dc:creator>
		<pubDate>Mon, 07 Nov 2011 14:02:55 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-101470</guid>
		<description><![CDATA[[...] my development was different from that in the book. My notes essentially follow the proof given by Terry Tao, so you may want to refer to his notes as well. Like this:LikeBe the first to like this post.   [...]]]></description>
		<content:encoded><![CDATA[<p>[...] my development was different from that in the book. My notes essentially follow the proof given by Terry Tao, so you may want to refer to his notes as well. Like this:LikeBe the first to like this post.   [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The law of large numbers and the central limit theorem &#124; Nair Research Notes</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-70957</link>
		<dc:creator><![CDATA[The law of large numbers and the central limit theorem &#124; Nair Research Notes]]></dc:creator>
		<pubDate>Sun, 28 Aug 2011 14:06:28 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-70957</guid>
		<description><![CDATA[[...] central limit theorem (CLT). There are excellent resources on the net for LLN and CLT. For example, this and this are highly recommended readings. This blog will play a complementary with figures and [...]]]></description>
		<content:encoded><![CDATA[<p>[...] central limit theorem (CLT). There are excellent resources on the net for LLN and CLT. For example, this and this are highly recommended readings. This blog will play a complementary with figures and [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: lkozma</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-70948</link>
		<dc:creator><![CDATA[lkozma]]></dc:creator>
		<pubDate>Sun, 28 Aug 2011 12:34:14 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-70948</guid>
		<description><![CDATA[Thank you for the clear and informative post!

The formula for linearity of expectation shouldn&#039;t have parentheses on the left side?]]></description>
		<content:encoded><![CDATA[<p>Thank you for the clear and informative post!</p>
<p>The formula for linearity of expectation shouldn&#8217;t have parentheses on the left side?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Russell Lyons</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-46554</link>
		<dc:creator><![CDATA[Russell Lyons]]></dc:creator>
		<pubDate>Thu, 19 Aug 2010 15:09:30 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-46554</guid>
		<description><![CDATA[Hi, Terry.

I just happened across this post. I have two small comments:

1. For the proof of the Borel-Cantelli lemma, one can simply observe that since the expectation of the sum of indicators is finite, so is the sum itself a.s. For some reason, it has been more popular to do it your way (i.e., using Markov&#039;s inequality).

2. For those who are interested in refinements of the interpolation method that apply to weakly dependent random variables under a second moment condition, I can suggest an old paper of mine: Strong laws of large numbers for weakly correlated random variables,  Mich. Math. J.  35, No. 3 (1988), 353--359 (http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.mmj/1029003816).

Best,
Russ]]></description>
		<content:encoded><![CDATA[<p>Hi, Terry.</p>
<p>I just happened across this post. I have two small comments:</p>
<p>1. For the proof of the Borel-Cantelli lemma, one can simply observe that since the expectation of the sum of indicators is finite, so is the sum itself a.s. For some reason, it has been more popular to do it your way (i.e., using Markov&#8217;s inequality).</p>
<p>2. For those who are interested in refinements of the interpolation method that apply to weakly dependent random variables under a second moment condition, I can suggest an old paper of mine: Strong laws of large numbers for weakly correlated random variables,  Mich. Math. J.  35, No. 3 (1988), 353&#8211;359 (<a href="http://projecteuclid.org/DPubS?service=UI&#038;version=1.0&#038;verb=Display&#038;handle=euclid.mmj/1029003816" rel="nofollow">http://projecteuclid.org/DPubS?service=UI&#038;version=1.0&#038;verb=Display&#038;handle=euclid.mmj/1029003816</a>).</p>
<p>Best,<br />
Russ</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The Khinchine Law of Large Numbers &#124; The Longboat and the Otter</title>
		<link>http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/#comment-44871</link>
		<dc:creator><![CDATA[The Khinchine Law of Large Numbers &#124; The Longboat and the Otter]]></dc:creator>
		<pubDate>Sat, 15 May 2010 20:37:05 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=416#comment-44871</guid>
		<description><![CDATA[[...] http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/ [...]]]></description>
		<content:encoded><![CDATA[<p>[...] <a href="http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/" rel="nofollow">http://terrytao.wordpress.com/2008/06/18/the-strong-law-of-large-numbers/</a> [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
