Chemiluminescence: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Obsidian Soul
 
en>Eric Corbett
image caption as per MoS
Line 1: Line 1:
In [[mathematics]], '''Fatou's lemma''' establishes an [[inequality (mathematics)|inequality]] relating the [[integral]] (in the sense of [[Lebesgue integration|Lebesgue]]) of the [[limit superior and limit inferior|limit inferior]] of a [[sequence]] of [[function (mathematics)|function]]s to the limit inferior of integrals of these functions.  The [[Lemma (mathematics)|lemma]] is named after [[Pierre Fatou]].


Fatou's lemma can be used to prove the [[Fatou–Lebesgue theorem]] and Lebesgue's [[dominated convergence theorem]].


Fcschat.com has introduced thumb video chat, video messenger, 1to1 video chat extensions for webmasters. These extensions may be easily integrated in just about any existing web sites. The display movie chat extensions are suitable for postnuke,phpnuke sites also. <br><br>fcschat.com provides appropriately created, entirely maintained flash audio movie chat option for websites. It&quot;s a multi-user flash audio movie talk application produced in macromedia flash MX 2004. It uses Macromedia thumb interaction server because of its top quality audio video compression. You are able to adjust the camera bandwidth/compression and quality for thumb movie talk according to your website needs. You can even opt in for a Firewall/Proxy version that works with firewall applying HTTP Tunneling on port 80. It&quot;s the main one of the very best flash movie chat on web which is often tailored to generally meet the looks of your site. Some of its characteristics are: <br><br>1) Stable Flash video chat top end <br><br>2) Compressed audio movie loading <br><br>3) Set movie Bandwidth <br><br>4) Set movie Quality/compression <br><br>5) Customize Gender, webcam star <br><br>6) Create Private rooms( Advanced and Premium Plans) <br><br>7) Create fixed areas <br><br>8) Create active locations <br><br>9) Control audio volume <br><br>10) Publish/un-publish camera, microphone <br><br>11) Private messages <br><br>12) One click space change <br><br>13) Bold,Italic,underline text conversation <br><br>14) smileys support in talk <br><br>15) color scheme for font colors <br><br>16) Ignore/un-ignore consumers <br><br>17) View number of customers in areas <br><br>18) automatic detection of camera and mic <br><br>19) An easy task to incorporate <br><br>20) View Multiple cameras in Premium chat Plan <br><br>You will get an additional admin screen for display movie chat to manage the chat in premium and high level versions. <br><br>The administrator functions are : <br><br>1) [http://En.Search.Wordpress.com/?q=Administer+flash Administer flash] movie chat in invisible setting <br><br>2) View public/private interactions <br><br>3) View/listen any person in chat <br><br>4) Kick users <br><br>6) Ban consumers for a fixed time. <br><br>7) Realtime Data Move Figures <br><br>8) Auto Deleting Dynamic Empty locations <br><br>9) View Private Rooms. Visit [https://www.youtube.com/watch?v=-xdnX_p4Bfw must have sex toys] to discover the inner workings of this activity. <br><br>Flash movie chat Integration: It can be easily integrated with postnuke. Users logged in postnuke may be loged into the talk with no need to provide their userid again. <br><br>It could be incorporated with asp, php, cold fusion, jsp... And so on. In the event people fancy to discover extra resources on [https://www.youtube.com/watch?v=cAHeihPkrsY treatment options for erectile dysfunction], there are lots of [http://www.guardian.Co.uk/search?q=on-line+databases on-line databases] people should think about pursuing. You can find no special requirements because of its integration..<br><br>Should you have virtually any concerns about in which and how to employ dog health problems ([http://righteouspraise67.wordpress.com please click the up coming website page]), you'll be able to call us in our web-site.
==Standard statement of Fatou's lemma==
Let ''f''<sub>1</sub>, ''f''<sub>2</sub>, ''f''<sub>3</sub>, .&nbsp;.&nbsp;. be a sequence of [[non-negative number|non-negative]] [[measurable function|measurable]] functions on a [[measure space]] (''S'',''Σ'',''μ''). Define the function ''f''&thinsp;: ''S'' → <nowiki>[</nowiki>0,&thinsp;∞<nowiki>]</nowiki> a.e. pointwise limit by
:<math>
f(s) =\liminf_{n\to\infty} f_n(s),\qquad s\in S.
</math>
Then ''f&thinsp;''  is measurable and
:<math>
\int_S f\,d\mu \le \liminf_{n\to\infty} \int_S f_n\,d\mu\,.
</math>
 
'''Note:''' The functions are allowed to attain the value [[Extended real number line|+∞]] and the integrals may also be infinite.
 
===Proof===
Fatou's lemma may be proved directly as in the first proof presented below, which is an elaboration on the one that can be found in Royden (see the references). The second proof is shorter but uses the [[monotone convergence theorem]].
 
<div style="clear:both;width:90%;" class="NavFrame">
<div class="NavHead" style="background-color:#FFFAF0; text-align:left; font-size:larger;">Direct proof</div>
<div class="NavContent" style="text-align:left;display:none;">
We will prove something a bit weaker here. Namely, we will allow ''f''<sub>n</sub> to converge μ-[[almost everywhere]] on a subset E of S. We seek to show that
:<math>
\int_E f\,d\mu \le \liminf_{n\to\infty} \int_E f_n\,d\mu\,.
</math>
Let
:<math> K=\{x\in E|f_n(x)\rightarrow f(x)\} </math>.
Then ''μ(E-K)=0'' and  
:<math> \int_{E}f\,d\mu=\int_{K}f\,d\mu,~~~\int_{E}f_n\,d\mu=\int_{K}f_n\,d\mu ~\forall n\in \N. </math>
Thus, replacing ''E'' by ''K'' we may assume that ''f''<sub>n</sub> converge to ''f'' [[pointwise convergence|pointwise]] on E. Next, by the definition of the Lebesgue Integral, it is enough to show that if ''φ'' is any non-negative simple function less than or equal to ''f,'' then
:<math>
\int_{E}\varphi \,d\mu\leq \liminf_{n\rightarrow \infty} \int_{E}f_n\,d\mu
</math>
 
We first consider the case when <math>\int_{E}\varphi=\infty</math>.
Let ''a'' be the minimum non-negative value of ''φ'' (it exists since the integral of ''φ'' is infinite). Define
:<math>
A=\{x\in E |\varphi(x)>a\}
</math>
We must have that ''μ(A)'' is infinite since 
:<math>\int_{E}\varphi\leq M\mu(A),</math>
where ''M'' is the (necessarily finite) maximum value of that ''φ'' attains.
 
Next, we define
:<math>  
A_n=\{x\in E |f_k(x)>a~\forall k\geq n \}.
</math>
We have that
:<math>  
A\subseteq \bigcup_n A_n \Rightarrow \mu(\bigcup_n A_n)=\infty.
</math>
But ''A<sub>n</sub>'' is a nested increasing sequence of functions and hence, by the continuity from below ''μ'',
:<math>
\lim_{n\rightarrow \infty} \mu(A_n)=\infty.
</math>.
At the same time,
:<math>  
\int_E f_n\, d\mu \geq a \mu(A_n) \Rightarrow \liminf_{n\to \infty} \int_E f_n \, d\mu = \infty = \int_E \varphi\, d\mu,
</math>
proving the claim in this case.
 
The remaining case is when <math>\int_{E}\varphi<\infty</math>. We must have that ''μ(A)'' is finite. Denote, as above, by ''M'' the maximum value of ''φ'' and fix ''ε>0.'' Define
:<math>
A_n=\{x\in E|f_k(x)>(1-\epsilon)\varphi(x)~\forall k\geq n\}.
</math>
Then ''A<sub>n</sub>'' is a nested increasing sequence of sets whose union contains ''A.'' Thus, ''A-A<sub>n</sub>'' is a decreasing sequence of sets with empty intersection. Since ''A'' has finite measure (this is why we needed to consider the two separate cases),
:<math>
\lim_{n\rightarrow \infty} \mu(A-A_n)=0.
</math>
Thus, there exists n such that
:<math>  
\mu(A-A_k)<\epsilon ,~\forall k\geq n.
</math>
Hence, for <math>k\geq n</math>
:<math>
\int_E f_k \, d\mu \geq \int_{A_k}f_k \, d\mu \geq (1-\epsilon)\int_{A_k}\varphi\, d\mu.
</math>
At the same time,
:<math>  
\int_E \varphi \, d\mu = \int_A \varphi \, d\mu = \int_{A_k} \varphi \, d\mu + \int_{A-A_k} \varphi \, d\mu.
</math>
Hence,
:<math>
(1-\epsilon)\int_{A_k} \varphi \, d\mu \geq (1-\epsilon)\int_E \varphi \, d\mu -  \int_{A-A_k} \varphi \, d\mu.
</math>
Combining these inequalities gives that
:<math>  
\int_{E} f_k \, d\mu \geq (1-\epsilon)\int_E \varphi \, d\mu -  \int_{A-A_k} \varphi \, d\mu \geq \int_E \varphi \, d\mu -  \epsilon\left(\int_{E} \varphi \, d\mu+M\right).
</math>
Hence, sending ''ε'' to 0 and taking the liminf in n, we get that
:<math>
\liminf_{n\rightarrow \infty} \int_{E} f_n \, d\mu \geq \int_E \varphi \, d\mu,
</math>
completing the proof.
</div>
</div>
 
<div style="clear:both;width:90%;" class="NavFrame">
<div class="NavHead" style="background-color:#FFFAF0; text-align:left; font-size:larger;">Proof using the monotone convergence theorem</div>
<div class="NavContent" style="text-align:left;display:none;">
For every natural number ''k'' define pointwise the function
:<math>g_k=\inf_{n\ge k}f_n.</math>
Then the sequence ''g''<sub>1</sub>, ''g''<sub>2</sub>, .&nbsp;.&nbsp;. of functions is increasing, meaning that ''g<sub>k</sub>''&nbsp;≤ ''g''<sub>''k''+1</sub> for all&nbsp;''k'', and converges pointwise to the limit inferior&nbsp;''f''.
 
For all ''k''&nbsp;≤&nbsp;''n'' we have ''g<sub>k</sub>''&nbsp;≤&nbsp;''f<sub>n</sub>'', so that by the monotonicity of the integral
:<math>\int_E g_k\,d\mu\le\int_E f_n\,d\mu,</math>
hence
:<math>
\int_E g_k\,d\mu
\le\inf_{n\ge k}\int_E f_n\,d\mu.
</math>
Using the monotone convergence theorem for the first equality, then the last inequality from above, and finally the definition of the limit inferior, it follows that
:<math>
\int_E f\,d\mu
=\lim_{k\to\infty}\int_E g_k\,d\mu
\le\lim_{k\to\infty} \inf_{n\ge k}\int_E f_n\,d\mu
=\liminf_{n\to\infty} \int_E f_n\,d\mu\,.
</math>
</div>
</div>
 
==Examples for strict inequality==
Equip the space <math>S</math> with the [[Borel algebra|Borel &sigma;-algebra]] and the [[Lebesgue measure]].
* Example for a [[probability space]]: Let <math>S=[0,1]</math> denote the [[unit interval]]. For every [[natural number]] <math>n</math> define
::<math>
f_n(x)=\begin{cases}n&\text{for }x\in (0,1/n),\\
0&\text{otherwise.}
\end{cases}</math>
* Example with [[uniform convergence]]: Let <math>S</math> denote the set of all [[real number]]s. Define
::<math>
f_n(x)=\begin{cases}\frac1n&\text{for }x\in [0,n],\\
0&\text{otherwise.}
\end{cases}</math>
 
These sequences <math>(f_n)_{n\in\N}</math> converge on <math>S</math> pointwise (respectively uniformly) to the [[zero function]] (with zero integral), but every <math>f_n</math> has integral one.
 
==A counter example==
A suitable assumption concerning the negative parts of the sequence ''f''<sub>1</sub>, ''f''<sub>2</sub>, .&nbsp;.&nbsp;. of functions is necessary for Fatou's lemma, as the following example shows. Let ''S'' denote the half line [0,∞) with the Borel σ-algebra and the Lebesgue measure. For every natural number ''n'' define
:<math>
f_n(x)=\begin{cases}-\frac1n&\text{for }x\in [n,2n],\\
0&\text{otherwise.}
\end{cases}</math>
This sequence converges uniformly on ''S'' to the zero function (with zero integral) and for every ''x''&nbsp;≥&nbsp;0 we even have ''f<sub>n''</sub>(''x'')&nbsp;=&nbsp;0 for all ''n''&nbsp;>&nbsp;''x'' (so for every point ''x'' the limit 0 is reached in a finite number of steps). However, every function ''f<sub>n</sub>'' has integral &minus;1, hence the inequality in Fatou's lemma fails.
 
==Reverse Fatou lemma==
Let ''f''<sub>1</sub>, ''f''<sub>2</sub>, .&nbsp;.&nbsp;. be a sequence of [[extended real number line|extended real]]-valued measurable functions defined on a measure space (''S'',''Σ'',''μ''). If there exists an integrable function ''g'' on ''S'' such that ''f''<sub>''n''</sub>&nbsp;≤&nbsp;''g'' for all ''n'', then
:<math>
\limsup_{n\to\infty}\int_S f_n\,d\mu\leq\int_S\limsup_{n\to\infty}f_n\,d\mu.
</math>
 
'''Note:''' Here ''g&nbsp;integrable'' means that ''g'' is measurable and that <math>\textstyle\int_S g\,d\mu<\infty</math>.
===Proof===
Apply Fatou's lemma to the non-negative sequence given by ''g''&nbsp;–&nbsp;''f''<sub>''n''</sub>.
 
==Extensions and variations of Fatou's lemma==
===Integrable lower bound===
Let ''f''<sub>1</sub>, ''f''<sub>2</sub>, .&nbsp;.&nbsp;. be a sequence of extended real-valued measurable functions defined on a measure space (''S'',''Σ'',''μ''). If there exists a non-negative integrable function ''g'' on ''S'' such that ''f''<sub>''n''</sub>&nbsp;≥&nbsp;&minus;''g'' for all ''n'', then
:<math>
\int_S \liminf_{n\to\infty} f_n\,d\mu
\le \liminf_{n\to\infty} \int_S f_n\,d\mu.\
</math>
 
====Proof====
Apply Fatou's lemma to the non-negative sequence given by ''f''<sub>''n''</sub>&nbsp;+&nbsp;''g''.
 
===Pointwise convergence===
If in the previous setting the sequence ''f''<sub>1</sub>, ''f''<sub>2</sub>, .&nbsp;.&nbsp;. [[Pointwise convergence|converges pointwise]] to a function ''f'' ''μ''-[[almost everywhere]] on ''S'', then
:<math>\int_S f\,d\mu \le \liminf_{n\to\infty} \int_S f_n\,d\mu\,.</math>
 
====Proof====
Note that ''f'' has to agree with the limit inferior of the functions ''f''<sub>''n''</sub> almost everywhere, and that the values of the integrand on a set of  measure zero have no influence on the value of the integral.
 
===Convergence in measure===
The last assertion also holds, if the sequence ''f''<sub>1</sub>, ''f''<sub>2</sub>, .&nbsp;.&nbsp;. [[Convergence in measure|converges in measure]] to a function ''f''.
 
====Proof====
There exists a subsequence such that
:<math>\lim_{k\to\infty} \int_S f_{n_k}\,d\mu=\liminf_{n\to\infty} \int_S f_n\,d\mu.\ </math>
Since this subsequence also converges in measure to ''f'', there exists a further subsequence, which converges pointwise to ''f'' almost everywhere, hence the previous variation of Fatou's lemma is applicable to this subsubsequence.
 
===Fatou's Lemma with Varying Measures===
In all of the above statements of Fatou's Lemma, the integration was carried out with respect to a single fixed measure μ. Suppose that μ<sub>n</sub> is a sequence of measures on the measurable space (''S'',''Σ'') such that (see [[Convergence of measures]])
:<math>\mu_n(E)\to \mu(E),~\forall E\in \Sigma. </math>
Then, with ''f<sub>n</sub>'' non-negative integrable functions and ''f'' being their pointwise limit inferior, we have
:<math> \int_S f\,d\mu \leq \liminf_{n\to \infty} \int_S f_n\, d\mu_n. </math>
 
:{| class="toccolours collapsible collapsed" width="90%" style="text-align:left"
!Proof
|-
|We will prove something a bit stronger here. Namely, we will allow ''f''<sub>n</sub> to converge μ-[[almost everywhere]] on a subset E of S. We seek to show that
:<math>
\int_E f\,d\mu \le \liminf_{n\to\infty} \int_E f_n\,d\mu_n\,.
</math>
Let
:<math> K=\{x\in E|f_n(x)\rightarrow f(x)\} </math>.
Then ''μ(E-K)=0'' and
:<math> \int_{E}f\,d\mu=\int_{E-K}f\,d\mu,~~~\int_{E}f_n\,d\mu=\int_{E-K}f_n\,d\mu ~\forall n\in \N. </math>
Thus, replacing ''E'' by ''E-K'' we may assume that ''f''<sub>n</sub> converge to ''f'' [[pointwise convergence|pointwise]] on E. Next, note that for any simple function ''φ'' we have
:<math> \int_{E}\phi\, d\mu=\lim_{n\to \infty} \int_{E} \phi\, d\mu_n. </math>
Hence, by the definition of the Lebesgue Integral, it is enough to show that if ''φ'' is any non-negative simple function less than or equal to ''f,'' then
:<math>
\int_{E}\phi \,d\mu\leq \liminf_{n\rightarrow \infty} \int_{E}f_n\,d\mu_n
</math>
Let ''a'' be the minimum non-negative value of ''φ.'' Define
:<math>
A=\{x\in E |\phi(x)>a\}
</math>
 
We first consider the case when <math>\int_{E}\phi\, d\mu=\infty</math>.
We must have that ''μ(A)'' is infinite since 
:<math>\int_{E}\phi\, d\mu \leq M\mu(A),</math>
where ''M'' is the (necessarily finite) maximum value of that ''φ'' attains.  
 
Next, we define
:<math>  
A_n=\{x\in E |f_k(x)>a~\forall k\geq n \}.
</math>
We have that
:<math>
A\subseteq \bigcup_n A_n \Rightarrow \mu(\bigcup_n A_n)=\infty.
</math>
But ''A<sub>n</sub>'' is a nested increasing sequence of functions and hence, by the continuity from below ''μ'',
:<math>
\lim_{n\rightarrow \infty} \mu(A_n)=\infty.
</math>.
Thus,
:<math>
\lim_{n\to\infty}\mu_n(A_n)=\mu(A_n)=\infty.
</math>.
At the same time,
:<math>  
\int_E f_n\, d\mu_n \geq a \mu_n(A_n) \Rightarrow \liminf_{n\to \infty}\int_E f_n \, d\mu_n = \infty = \int_E \phi\, d\mu,
</math>
proving the claim in this case.
 
The remaining case is when <math>\int_{E}\phi\, d\mu<\infty</math>. We must have that ''μ(A)'' is finite. Denote, as above, by ''M'' the maximum value of ''φ'' and fix ''ε>0.'' Define
:<math>
A_n=\{x\in E|f_k(x)>(1-\epsilon)\phi(x)~\forall k\geq n\}.
</math>
Then ''A<sub>n</sub>'' is a nested increasing sequence of sets whose union contains ''A.'' Thus, ''A-A<sub>n</sub>'' is a decreasing sequence of sets with empty intersection. Since ''A'' has finite measure (this is why we needed to consider the two separate cases),
:<math>
\lim_{n\rightarrow \infty} \mu(A-A_n)=0.
</math>
Thus, there exists n such that
:<math>
\mu(A-A_k)<\epsilon ,~\forall k\geq n.
</math>
Therefore, since
:<math>
\lim_{n\to \infty} \mu_n(A-A_k)=\mu(A-A_k),
</math>
there exists N such that
:<math>
\mu_k(A-A_k)<\epsilon,~\forall k\geq N.
</math>
Hence, for <math>k\geq N</math>
:<math>
\int_E f_k \, d\mu_k \geq \int_{A_k}f_k \, d\mu_k \geq (1-\epsilon)\int_{A_k}\phi\, d\mu_k.
</math>
At the same time,
:<math>
\int_E \phi \, d\mu_k = \int_A \phi \, d\mu_k = \int_{A_k} \phi \, d\mu_k + \int_{A-A_k} \phi \, d\mu_k.
</math>
Hence,
:<math>
(1-\epsilon)\int_{A_k} \phi \, d\mu_k \geq (1-\epsilon)\int_E \phi \, d\mu_k -  \int_{A-A_k} \phi \, d\mu_k.
</math>
Combining these inequalities gives that
:<math>
\int_{E} f_k \, d\mu_k \geq (1-\epsilon)\int_E \phi \, d\mu_k -  \int_{A-A_k} \phi \, d\mu_k \geq \int_E \phi \, d\mu_k -  \epsilon\left(\int_{E} \phi \, d\mu_k+M\right).
</math>
Hence, sending ''ε'' to 0 and taking the liminf in n, we get that
:<math>
\liminf_{n\rightarrow \infty} \int_{E} f_n \, d\mu_k \geq \int_E \phi \, d\mu,
</math>
completing the proof.
|}
 
==Fatou's lemma for conditional expectations==
In [[probability theory]], by a change of notation, the above versions of Fatou's lemma are applicable to sequences of [[random variables]] ''X''<sub>1</sub>, ''X''<sub>2</sub>, .&nbsp;.&nbsp;. defined on a [[probability space]] <math>\scriptstyle(\Omega,\,\mathcal F,\,\mathbb P)</math>; the integrals turn into [[expected value|expectation]]s. In addition, there is also a version for [[conditional expectation]]s.
 
===Standard version===
Let ''X''<sub>1</sub>, ''X''<sub>2</sub>, .&nbsp;.&nbsp;. be a sequence of non-negative random variables on a probability space <math>\scriptstyle(\Omega,\mathcal F,\mathbb P)</math> and let
<math>\scriptstyle \mathcal G\,\subset\,\mathcal F</math> be a sub-[[σ-algebra]]. Then
:<math>\mathbb{E}\Bigl[\liminf_{n\to\infty}X_n\,\Big|\,\mathcal G\Bigr]\le\liminf_{n\to\infty}\,\mathbb{E}[X_n|\mathcal G]</math>&nbsp;&nbsp;&nbsp;[[almost surely]].
 
'''Note:''' Conditional expectation for non-negative random variables is always well defined, finite expectation is not needed.
 
====Proof====
Besides a change of notation, the proof is very similar to the one for the standard version of Fatou's lemma above, however the [[monotone convergence theorem|monotone convergence theorem for conditional expectations]] has to be applied.
 
Let ''X'' denote the limit inferior of the ''X''<sub>''n''</sub>. For every natural number ''k'' define pointwise the random variable
:<math>Y_k=\inf_{n\ge k}X_n.</math>
Then the sequence ''Y''<sub>1</sub>,  ''Y''<sub>2</sub>, .&nbsp;.&nbsp;. is increasing and converges pointwise to ''X''.
For ''k''&nbsp;≤&nbsp;''n'', we have ''Y''<sub>''k''</sub>&nbsp;≤&nbsp;''X''<sub>''n''</sub>, so that
:<math>\mathbb{E}[Y_k|\mathcal G]\le\mathbb{E}[X_n|\mathcal G]</math>&nbsp;&nbsp;&nbsp;almost surely
by the [[Conditional_expectation#Basic_properties|monotonicity of conditional expectation]], hence
:<math>\mathbb{E}[Y_k|\mathcal G]\le\inf_{n\ge k}\mathbb{E}[X_n|\mathcal G]</math>&nbsp;&nbsp;&nbsp;almost surely,
because the countable union of the exceptional sets of probability zero is again a [[null set]].
Using the definition of ''X'', its representation as pointwise limit of the ''Y''<Sub>''k''</sub>, the monotone convergence theorem for conditional expectations, the last inequality, and the definition of the limit inferior, it follows that almost surely
:<math>
\begin{align}
\mathbb{E}\Bigl[\liminf_{n\to\infty}X_n\,\Big|\,\mathcal G\Bigr]
&=\mathbb{E}[X|\mathcal G]
=\mathbb{E}\Bigl[\lim_{k\to\infty}Y_k\,\Big|\,\mathcal G\Bigr]
=\lim_{k\to\infty}\mathbb{E}[Y_k|\mathcal G]\\
&\le\lim_{k\to\infty} \inf_{n\ge k}\mathbb{E}[X_n|\mathcal G]
=\liminf_{n\to\infty}\,\mathbb{E}[X_n|\mathcal G].
\end{align}
</math>
 
===Extension to uniformly integrable negative parts===
Let ''X''<sub>1</sub>, ''X''<sub>2</sub>, .&nbsp;.&nbsp;. be a sequence of random variables on a probability space <math>\scriptstyle(\Omega,\mathcal F,\mathbb P)</math> and let
<math>\scriptstyle \mathcal G\,\subset\,\mathcal F</math> be a sub-[[σ-algebra]]. If the negative parts
 
:<math>X_n^-:=\max\{-X_n,0\},\qquad n\in{\mathbb N},</math>
 
are uniformly integrable with respect to the conditional expectation, in the sense that, for ''ε''&nbsp;>&nbsp;0 there exists a ''c''&nbsp;>&nbsp;0 such that
 
:<math>\mathbb{E}\bigl[X_n^-1_{\{X_n^->c\}}\,|\,\mathcal G\bigr]<\varepsilon, 
\qquad\text{for all }n\in\mathbb{N},\,\text{almost surely}</math>,
then
 
:<math>\mathbb{E}\Bigl[\liminf_{n\to\infty}X_n\,\Big|\,\mathcal G\Bigr]\le\liminf_{n\to\infty}\,\mathbb{E}[X_n|\mathcal G]</math>&nbsp;&nbsp;&nbsp;almost surely.
 
'''Note:''' On the set where
 
:<math>X:=\liminf_{n\to\infty}X_n</math>
 
satisfies
 
:<math>\mathbb{E}[\max\{X,0\}\,|\,\mathcal G]=\infty,</math>
 
the left-hand side of the inequality is considered to be plus infinity. The conditional expectation of the limit inferior might not be well defined on this set, because the conditional expectation of the negative part might also be plus infinity.
 
====Proof====
Let ''ε''&nbsp;>&nbsp;0. Due to uniform integrability with respect to the conditional expectation, there exists a ''c''&nbsp;>&nbsp;0 such that
 
:<math>\mathbb{E}\bigl[X_n^-1_{\{X_n^->c\}}\,|\,\mathcal G\bigr]<\varepsilon
\qquad\text{for all }n\in\mathbb{N},\,\text{almost surely}.</math>
 
Since
 
:<math>X+c\le\liminf_{n\to\infty}(X_n+c)^+,</math>
 
where ''x''<sup>+</sup> := max{''x'',0} denotes the positive part of a real ''x'', monotonicity of conditional expectation (or the above convention) and the standard version of Fatou's lemma for conditional expectations imply
 
:<math>\mathbb{E}[X\,|\,\mathcal G]+c
\le\mathbb{E}\Bigl[\liminf_{n\to\infty}(X_n+c)^+\,\Big|\,\mathcal G\Bigr]
\le\liminf_{n\to\infty}\mathbb{E}[(X_n+c)^+\,|\,\mathcal G]</math>&nbsp;&nbsp;&nbsp;almost surely.
 
Since
 
:<math>(X_n+c)^+=(X_n+c)+(X_n+c)^-\le X_n+c+X_n^-1_{\{X_n^->c\}},</math>
 
we have
 
:<math>\mathbb{E}[(X_n+c)^+\,|\,\mathcal G]
\le\mathbb{E}[X_n\,|\,\mathcal G]+c+\varepsilon</math>&nbsp;&nbsp;&nbsp;almost surely,
 
hence
 
:<math>\mathbb{E}[X\,|\,\mathcal G]\le
\liminf_{n\to\infty}\mathbb{E}[X_n\,|\,\mathcal G]+\varepsilon</math>&nbsp;&nbsp;&nbsp;almost surely.
 
This implies the assertion.
 
==References==
*{{cite book
| last = Royden
| first = H.L.
| title = Real Analysis
| edition = 3rd
| year = 1988
}}
 
==External links==
*{{planetmath reference|id=3678|title=Fatou's lemma}}
 
[[Category:Inequalities]]
[[Category:Lemmas]]
[[Category:Measure theory]]
[[Category:Real analysis]]
[[Category:Articles containing proofs]]

Revision as of 14:36, 30 January 2014

In mathematics, Fatou's lemma establishes an inequality relating the integral (in the sense of Lebesgue) of the limit inferior of a sequence of functions to the limit inferior of integrals of these functions. The lemma is named after Pierre Fatou.

Fatou's lemma can be used to prove the Fatou–Lebesgue theorem and Lebesgue's dominated convergence theorem.

Standard statement of Fatou's lemma

Let f1, f2, f3, . . . be a sequence of non-negative measurable functions on a measure space (S,Σ,μ). Define the function f : S → [0, ∞] a.e. pointwise limit by

f(s)=lim infnfn(s),sS.

Then f  is measurable and

Sfdμlim infnSfndμ.

Note: The functions are allowed to attain the value +∞ and the integrals may also be infinite.

Proof

Fatou's lemma may be proved directly as in the first proof presented below, which is an elaboration on the one that can be found in Royden (see the references). The second proof is shorter but uses the monotone convergence theorem.

Examples for strict inequality

Equip the space S with the Borel σ-algebra and the Lebesgue measure.

fn(x)={nfor x(0,1/n),0otherwise.
fn(x)={1nfor x[0,n],0otherwise.

These sequences (fn)n converge on S pointwise (respectively uniformly) to the zero function (with zero integral), but every fn has integral one.

A counter example

A suitable assumption concerning the negative parts of the sequence f1, f2, . . . of functions is necessary for Fatou's lemma, as the following example shows. Let S denote the half line [0,∞) with the Borel σ-algebra and the Lebesgue measure. For every natural number n define

fn(x)={1nfor x[n,2n],0otherwise.

This sequence converges uniformly on S to the zero function (with zero integral) and for every x ≥ 0 we even have fn(x) = 0 for all n > x (so for every point x the limit 0 is reached in a finite number of steps). However, every function fn has integral −1, hence the inequality in Fatou's lemma fails.

Reverse Fatou lemma

Let f1, f2, . . . be a sequence of extended real-valued measurable functions defined on a measure space (S,Σ,μ). If there exists an integrable function g on S such that fn ≤ g for all n, then

lim supnSfndμSlim supnfndμ.

Note: Here g integrable means that g is measurable and that Sgdμ<.

Proof

Apply Fatou's lemma to the non-negative sequence given by g – fn.

Extensions and variations of Fatou's lemma

Integrable lower bound

Let f1, f2, . . . be a sequence of extended real-valued measurable functions defined on a measure space (S,Σ,μ). If there exists a non-negative integrable function g on S such that fn ≥ −g for all n, then

Slim infnfndμlim infnSfndμ.

Proof

Apply Fatou's lemma to the non-negative sequence given by fn + g.

Pointwise convergence

If in the previous setting the sequence f1, f2, . . . converges pointwise to a function f μ-almost everywhere on S, then

Sfdμlim infnSfndμ.

Proof

Note that f has to agree with the limit inferior of the functions fn almost everywhere, and that the values of the integrand on a set of measure zero have no influence on the value of the integral.

Convergence in measure

The last assertion also holds, if the sequence f1, f2, . . . converges in measure to a function f.

Proof

There exists a subsequence such that

limkSfnkdμ=lim infnSfndμ.

Since this subsequence also converges in measure to f, there exists a further subsequence, which converges pointwise to f almost everywhere, hence the previous variation of Fatou's lemma is applicable to this subsubsequence.

Fatou's Lemma with Varying Measures

In all of the above statements of Fatou's Lemma, the integration was carried out with respect to a single fixed measure μ. Suppose that μn is a sequence of measures on the measurable space (S,Σ) such that (see Convergence of measures)

μn(E)μ(E),EΣ.

Then, with fn non-negative integrable functions and f being their pointwise limit inferior, we have

Sfdμlim infnSfndμn.

Fatou's lemma for conditional expectations

In probability theory, by a change of notation, the above versions of Fatou's lemma are applicable to sequences of random variables X1, X2, . . . defined on a probability space (Ω,,); the integrals turn into expectations. In addition, there is also a version for conditional expectations.

Standard version

Let X1, X2, . . . be a sequence of non-negative random variables on a probability space (Ω,,) and let 𝒢 be a sub-σ-algebra. Then

𝔼[lim infnXn|𝒢]lim infn𝔼[Xn|𝒢]   almost surely.

Note: Conditional expectation for non-negative random variables is always well defined, finite expectation is not needed.

Proof

Besides a change of notation, the proof is very similar to the one for the standard version of Fatou's lemma above, however the monotone convergence theorem for conditional expectations has to be applied.

Let X denote the limit inferior of the Xn. For every natural number k define pointwise the random variable

Yk=infnkXn.

Then the sequence Y1, Y2, . . . is increasing and converges pointwise to X. For k ≤ n, we have Yk ≤ Xn, so that

𝔼[Yk|𝒢]𝔼[Xn|𝒢]   almost surely

by the monotonicity of conditional expectation, hence

𝔼[Yk|𝒢]infnk𝔼[Xn|𝒢]   almost surely,

because the countable union of the exceptional sets of probability zero is again a null set. Using the definition of X, its representation as pointwise limit of the Yk, the monotone convergence theorem for conditional expectations, the last inequality, and the definition of the limit inferior, it follows that almost surely

𝔼[lim infnXn|𝒢]=𝔼[X|𝒢]=𝔼[limkYk|𝒢]=limk𝔼[Yk|𝒢]limkinfnk𝔼[Xn|𝒢]=lim infn𝔼[Xn|𝒢].

Extension to uniformly integrable negative parts

Let X1, X2, . . . be a sequence of random variables on a probability space (Ω,,) and let 𝒢 be a sub-σ-algebra. If the negative parts

Xn:=max{Xn,0},n,

are uniformly integrable with respect to the conditional expectation, in the sense that, for ε > 0 there exists a c > 0 such that

𝔼[Xn1{Xn>c}|𝒢]<ε,for all n,almost surely,

then

𝔼[lim infnXn|𝒢]lim infn𝔼[Xn|𝒢]   almost surely.

Note: On the set where

X:=lim infnXn

satisfies

𝔼[max{X,0}|𝒢]=,

the left-hand side of the inequality is considered to be plus infinity. The conditional expectation of the limit inferior might not be well defined on this set, because the conditional expectation of the negative part might also be plus infinity.

Proof

Let ε > 0. Due to uniform integrability with respect to the conditional expectation, there exists a c > 0 such that

𝔼[Xn1{Xn>c}|𝒢]<εfor all n,almost surely.

Since

X+clim infn(Xn+c)+,

where x+ := max{x,0} denotes the positive part of a real x, monotonicity of conditional expectation (or the above convention) and the standard version of Fatou's lemma for conditional expectations imply

𝔼[X|𝒢]+c𝔼[lim infn(Xn+c)+|𝒢]lim infn𝔼[(Xn+c)+|𝒢]   almost surely.

Since

(Xn+c)+=(Xn+c)+(Xn+c)Xn+c+Xn1{Xn>c},

we have

𝔼[(Xn+c)+|𝒢]𝔼[Xn|𝒢]+c+ε   almost surely,

hence

𝔼[X|𝒢]lim infn𝔼[Xn|𝒢]+ε   almost surely.

This implies the assertion.

References

  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

External links