In mathematics, Fatou's lemma establishes an inequality relating the Lebesgue integral 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.
In what follows, denotes the -algebra of Borel sets on .
Fatou's lemma. Given a measure space and a set let be a sequence of -measurable non-negative functions . Define the function by setting for every .
Then is -measurable, and also , where the integrals may be infinite.
Fatou's lemma remains true if its assumptions hold -almost everywhere. In other words, it is enough that there is a null set such that the values are non-negative for every To see this, note that the integrals appearing in Fatou's lemma are unchanged if we change each function on .
Fatou's lemma does not require the monotone convergence theorem, but the latter can be used to provide a quick proof. A proof directly from the definitions of integrals is given further below.
In each case, the proof begins by analyzing the properties of . These satisfy:
the sequence is pointwise non-decreasing at any x and
.
Since , we immediately see that f is measurable.
Moreover,
By the Monotone Convergence Theorem and property (1), the limit and integral may be interchanged:
where the last step used property (2).
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.
Denote by the set of simple -measurable functions such that on .
If everywhere on then
If and then
If f is nonnegative and , where is a non-decreasing chain of -measurable sets, then
Since we have
By definition of Lebesgue integral and the properties of supremum,
Let be the indicator function of the set It can be deduced from the definition of Lebesgue integral that
if we notice that, for every outside of Combined with the previous property, the inequality implies
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
The course is based on Durrett's text book
Probability: Theory and Examples.
It takes the measure theory approach to probability theory, wherein expectations are simply abstract integrals.
We discuss a set of topics that are important for the understanding of modern data science but that are typically not taught in an introductory ML course. In particular we discuss fundamental ideas an
Learn the basis of Lebesgue integration and Fourier analysis
In mathematics, the integral of a non-negative function of a single variable can be regarded, in the simplest case, as the area between the graph of that function and the X-axis. The Lebesgue integral, named after French mathematician Henri Lebesgue, extends the integral to a larger class of functions. It also extends the domains on which these functions can be defined.
In measure theory, Lebesgue's dominated convergence theorem provides sufficient conditions under which almost everywhere convergence of a sequence of functions implies convergence in the L1 norm. Its power and utility are two of the primary theoretical advantages of Lebesgue integration over Riemann integration. In addition to its frequent appearance in mathematical analysis and partial differential equations, it is widely used in probability theory, since it gives a sufficient condition for the convergence of expected values of random variables.
In the mathematical field of real analysis, the monotone convergence theorem is any of a number of related theorems proving the convergence of monotonic sequences (sequences that are non-decreasing or non-increasing) that are also bounded. Informally, the theorems state that if a sequence is increasing and bounded above by a supremum, then the sequence will converge to the supremum; in the same way, if a sequence is decreasing and is bounded below by an infimum, it will converge to the infimum.
We propose a variance reduced algorithm for solving monotone variational inequalities. Without assuming strong monotonicity, cocoercivity, or boundedness of the domain, we prove almost sure convergence of the iterates generated by the algorithm to a soluti ...
We study an optimization program over nonnegative Borel measures that encourages sparsity in its solution. Efficient solvers for this program are in increasing demand, as it arises when learning from data generated by a "continuum-of-subspaces" model, a re ...
Human emissions of fluorescent aerosol particles (FAPs) can influence the biological burden of indoor air. Yet, quantification of FAP emissions from human beings remains limited, along with a poor understanding of the underlying emission mechanisms. To red ...