HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, Fatou's lemma establishes an inequality relating the
Lebesgue integral In mathematics, the integral of a non-negative Function (mathematics), function of a single variable can be regarded, in the simplest case, as the area between the Graph of a function, graph of that function and the axis. The Lebesgue integral, ...
of the
limit inferior In mathematics, the limit inferior and limit superior of a sequence can be thought of as limiting (that is, eventual and extreme) bounds on the sequence. They can be thought of in a similar fashion for a function (see limit of a function). For ...
of a
sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is cal ...
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 In mathematics, the Fatou–Lebesgue theorem establishes a chain of inequality (mathematics), inequalities relating the integrals (in the sense of Lebesgue integration, Lebesgue) of the limit superior and limit inferior, limit inferior and the lim ...
and Lebesgue's
dominated convergence theorem In measure theory, Lebesgue's dominated convergence theorem gives a mild sufficient condition under which limits and integrals of a sequence of functions can be interchanged. More technically it says that if a sequence of functions is bounded i ...
.


Standard statement

In what follows, \operatorname_ denotes the \sigma-algebra of Borel sets on ,+\infty/math>. Fatou's lemma remains true if its assumptions hold \mu-almost everywhere. In other words, it is enough that there is a
null set In mathematical analysis, a null set is a Lebesgue measurable set of real numbers that has measure zero. This can be characterized as a set that can be covered by a countable union of intervals of arbitrarily small total length. The notio ...
N such that the values \ are non-negative for every . To see this, note that the
integrals In mathematics, an integral is the continuous analog of a sum, which is used to calculate areas, volumes, and their generalizations. Integration, the process of computing an integral, is one of the two fundamental operations of calculus,Int ...
appearing in Fatou's lemma are unchanged if we change each function on N.


Proof

Fatou's lemma does ''not'' require the
monotone convergence theorem In the mathematical field of real analysis, the monotone convergence theorem is any of a number of related theorems proving the good convergence behaviour of monotonic sequences, i.e. sequences that are non- increasing, or non- decreasing. In its ...
, but the latter can be used to provide a quick and natural proof. A proof directly from the definitions of integrals is given further below.


Via the Monotone Convergence Theorem

let \textstyle g_n(x)=\inf_f_k(x). Then: # the sequence \_n is
pointwise In mathematics, the qualifier pointwise is used to indicate that a certain property is defined by considering each value f(x) of some Function (mathematics), function f. An important class of pointwise concepts are the ''pointwise operations'', that ...
non-decreasing at any and # g_n\leq f_n, \forall n \in \N. Since :f(x) =\liminf_ f_n(x) = \sup_n \inf_ f_k(x) = \sup_n g_n(x), and infima and suprema of measurable functions are measurable we see that f is measurable. By the Monotone Convergence Theorem and property (1), the sup and integral may be interchanged: :\begin \int_X f\,d\mu&= \int_X \sup_n g_n\,d\mu\\ &=\sup_n \int_X g_n\,d\mu\\ &=\liminf_\int_X g_n\,d\mu\\ &\leq \liminf_\int_X f_n\,d\mu, \end where the last step used property (2).


From "first principles"

To demonstrate that the monotone convergence theorem is not "hidden", the proof below does not use any properties of Lebesgue integral except those established here and the fact that the functions f and g_n are measurable. Denote by \operatorname(f) the set of
simple Simple or SIMPLE may refer to: *Simplicity, the state or quality of being simple Arts and entertainment * ''Simple'' (album), by Andy Yorke, 2008, and its title track * "Simple" (Florida Georgia Line song), 2018 * "Simple", a song by John ...
(\mathcal, \operatorname_)-measurable functions s:X\to Borel σ-algebra and the Lebesgue measure">Borel algebra">Borel σ-algebra and the Lebesgue measure. * Example for a
probability space In probability theory, a probability space or a probability triple (\Omega, \mathcal, P) is a mathematical construct that provides a formal model of a random process or "experiment". For example, one can define a probability space which models ...
: Let S=[0,1] denote the unit interval. For every natural number n define :: f_n(x)=\beginn&\textx\in (0,1/n),\\ 0&\text \end * Example with uniform convergence: Let S denote the set of all
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s. Define :: f_n(x)=\begin\frac1n&\textx\in ,n\\ 0&\text \end These sequences (f_n)_ converge on S pointwise (respectively uniformly) to the
zero function 0 (zero) is a number representing an empty quantity. Adding (or subtracting) 0 to any number leaves that number unchanged; in mathematical terminology, 0 is the additive identity of the integers, rational numbers, real numbers, and compl ...
(with zero integral), but every f_n has integral one.


The role of non-negativity

A suitable assumption concerning the negative parts of the sequence ''f''1, ''f''2, . . . of functions is necessary for Fatou's lemma, as the following example shows. Let ''S'' denote the half line ,∞) with the Borel σ-algebra and the Lebesgue measure. For every natural number ''n'' define : f_n(x)=\begin-\frac1n&\textx\in [n,2n\\ 0&\text \end This sequence converges uniformly on ''S'' to the zero function and the limit, 0, is reached in a finite number of steps: for every ''x'' â‰¥ 0, if , then ''fn''(''x'') = 0. However, every function ''fn'' has integral −1. Contrary to Fatou's lemma, this value is strictly less than the integral of the limit (0). As discussed in below, the problem is that there is no uniform integrable bound on the sequence from below, while 0 is the uniform bound from above.


Reverse Fatou lemma

Let ''f''1, ''f''2, . . . 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''''n'' â‰¤ ''g'' for all ''n'', then : \limsup_\int_S f_n\,d\mu\leq\int_S\limsup_f_n\,d\mu. Note: Here ''g integrable'' means that ''g'' is measurable and that \textstyle\int_S g\,d\mu<\infty.


Sketch of proof

We apply linearity of Lebesgue integral and Fatou's lemma to the sequence g - f_n. Since \textstyle\int_Sg\,d\mu < +\infty, this sequence is defined \mu-almost everywhere and non-negative.


Extensions and variations of Fatou's lemma


Integrable lower bound

Let f_1, f_2, \ldots be a sequence of extended real-valued measurable functions defined on a measure space (S, \Sigma, \mu). If there exists an integrable function g on S such that f_n \ge -g for all n, then : \int_S \liminf_ f_n\,d\mu \le \liminf_ \int_S f_n\,d\mu.


Proof

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


Pointwise convergence

If in the previous setting the sequence f_1, f_2, \ldots converges pointwise to a function f \mu- Pointwise convergence">converges pointwise to a function f \mu-almost everywhere on S, then :\int_S f\,d\mu \le \liminf_ \int_S f_n\,d\mu\,.


Proof

Note that f has to agree with the limit inferior of the functions f_n 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_1, f_2, \ldots Convergence in measure">converges in measure to a function f.


Proof

There exists a subsequence such that :\lim_ \int_S f_\,d\mu=\liminf_ \int_S f_n\,d\mu. 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 Converging Measures

Measures with setwise convergence In all of the above statements of Fatou's Lemma, the integration was carried out with respect to a single fixed measure \mu. Suppose that \mu_n is a sequence of measures on the measurable space (M, \Sigma) such that (see Convergence of measures) :\forall E\in \mathcal \colon\; \mu_n(E)\to \mu(E). Then, with f_n non-negative integrable functions and f being their pointwise limit inferior, we have : \int_S f\,d\mu \leq \liminf_ \int_S f_n\, d\mu_n. : Asymptotically uniform integrable functions The following results use the notion ''asymptotically uniform integrable (a.u.i)''. A sequence \_ of measurable \-valued functions is a.u.i with respect to a sequence of measures \_ if \lim_ \limsup_ \int_M , f_n(s), \mathbf\\mu_n(ds)=0\,. Weakly converging measures A sequence of measures \_ on a metric space M converges weakly to a finite measure \mu on M if, for each bounded continuous function f on M, \int_ f(s) \mu_n(ds) \rightarrow \int_ f(s)\mu(ds) \quad \text n \rightarrow \infty\,. Measures with convergence in total variation A sequence of finite measures \_ on a measurable space (M,\Sigma) converges in total variation to a measure \mu on (M,\Sigma) if \sup \left\ \rightarrow 0 \quad \text n\rightarrow \infty\,.


Fatou's lemma for conditional expectations

In
probability theory Probability theory or probability calculus is the branch of mathematics concerned with probability. Although there are several different probability interpretations, probability theory treats the concept in a rigorous mathematical manner by expre ...
, by a change of notation, the above versions of Fatou's lemma are applicable to sequences of
random variables A random variable (also called random quantity, aleatory variable, or stochastic variable) is a mathematical formalization of a quantity or object which depends on random events. The term 'random variable' in its mathematical definition refers ...
''X''1, ''X''2, . . . defined on a
probability space In probability theory, a probability space or a probability triple (\Omega, \mathcal, P) is a mathematical construct that provides a formal model of a random process or "experiment". For example, one can define a probability space which models ...
\scriptstyle(\Omega,\,\mathcal F,\,\mathbb P); the integrals turn into expectations. In addition, there is also a version for
conditional expectation In probability theory, the conditional expectation, conditional expected value, or conditional mean of a random variable is its expected value evaluated with respect to the conditional probability distribution. If the random variable can take on ...
s.


Standard version

Let ''X''1, ''X''2, . . . be a sequence of non-negative random variables on a probability space \scriptstyle(\Omega,\mathcal F,\mathbb P) and let \scriptstyle \mathcal G\,\subset\,\mathcal F be a sub-
σ-algebra In mathematical analysis and in probability theory, a σ-algebra ("sigma algebra") is part of the formalism for defining sets that can be measured. In calculus and analysis, for example, σ-algebras are used to define the concept of sets with a ...
. Then :\mathbb\Bigl \,\mathcal G\Bigrle\liminf_\,\mathbb \mathcal G/math>   
almost surely In probability theory, an event is said to happen almost surely (sometimes abbreviated as a.s.) if it happens with probability 1 (with respect to the probability measure). In other words, the set of outcomes on which the event does not occur ha ...
. 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 ''X''''n''. For every natural number ''k'' define pointwise the random variable :Y_k=\inf_X_n. Then the sequence ''Y''1, ''Y''2, . . . is increasing and converges pointwise to ''X''. For ''k'' â‰¤ ''n'', we have ''Y''''k'' â‰¤ ''X''''n'', so that :\mathbb \mathcal Gle\mathbb \mathcal G/math>   almost surely by the monotonicity of conditional expectation, hence :\mathbb \mathcal Gle\inf_\mathbb \mathcal G/math>   almost surely, because the countable union of the exceptional sets of probability zero is again a
null set In mathematical analysis, a null set is a Lebesgue measurable set of real numbers that has measure zero. This can be characterized as a set that can be covered by a countable union of intervals of arbitrarily small total length. The notio ...
. Using the definition of ''X'', its representation as pointwise limit of the ''Y''''k'', the monotone convergence theorem for conditional expectations, the last inequality, and the definition of the limit inferior, it follows that almost surely : \begin \mathbb\Bigl \,\mathcal G\Bigr&=\mathbb \mathcal G=\mathbb\Bigl \,\mathcal G\Bigr=\lim_\mathbb \mathcal G\ &\le\lim_ \inf_\mathbb \mathcal G=\liminf_\,\mathbb \mathcal G \end


Extension to uniformly integrable negative parts

Let ''X''1, ''X''2, . . . be a sequence of random variables on a probability space \scriptstyle(\Omega,\mathcal F,\mathbb P) and let \scriptstyle \mathcal G\,\subset\,\mathcal F be a sub-
σ-algebra In mathematical analysis and in probability theory, a σ-algebra ("sigma algebra") is part of the formalism for defining sets that can be measured. In calculus and analysis, for example, σ-algebras are used to define the concept of sets with a ...
. If the negative parts :X_n^-:=\max\,\qquad n\in, are uniformly integrable with respect to the conditional expectation, in the sense that, for ''ε'' > 0 there exists a ''c'' > 0 such that :\mathbb\bigl \,\mathcal G\bigr\varepsilon, \qquad\textn\in\mathbb,\,\text, then :\mathbb\Bigl \,\mathcal G\Bigrle\liminf_\,\mathbb \mathcal G/math>   almost surely. Note: On the set where :X:=\liminf_X_n satisfies :\mathbb \,\mathcal G\infty, 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 :\mathbb\bigl \,\mathcal G\bigr\varepsilon \qquad\textn\in\mathbb,\,\text. Since :X+c\le\liminf_(X_n+c)^+, where ''x''+ := max 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 :\mathbb \,\mathcal Gc \le\mathbb\Bigl \,\mathcal G\Bigr\le\liminf_\mathbb \,\mathcal G/math>   almost surely. Since :(X_n+c)^+=(X_n+c)+(X_n+c)^-\le X_n+c+X_n^-1_, we have :\mathbb \,\mathcal G\le\mathbb \,\mathcal Gc+\varepsilon   almost surely, hence :\mathbb \,\mathcal Gle \liminf_\mathbb \,\mathcal G\varepsilon   almost surely. This implies the assertion.


References

* * * {{Measure theory Inequalities (mathematics) Lemmas in mathematical analysis Theorems in measure theory Real analysis Articles containing proofs