Girish Mahajan (Editor)

Fatou's lemma

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

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.

Contents

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, ∞] by

f ( s ) = lim inf n f n ( s ) , s S .

Then f  is measurable and

S f d μ lim inf n S f n d μ .

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 – which is usually proved using Fatou's lemma and thus could create a circular argument.

Examples for strict inequality

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

  • Example for a probability space: Let S = [ 0 , 1 ] denote the unit interval. For every natural number n define
  • Example with uniform convergence: Let S denote the set of all real numbers. Define
  • These sequences ( f n ) n N converge on S pointwise (respectively uniformly) to the zero function (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 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

    f n ( x ) = { 1 n for  x [ n , 2 n ] , 0 otherwise.

    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 a non-negative integrable function g on S such that fn ≤ g for all n, then

    lim sup n S f n d μ S lim sup n f n d μ .

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

    Proof

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

    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

    S lim inf n f n d μ lim inf n S f n d μ .  

    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

    S f d μ lim inf n S f n d μ .

    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

    lim k S f n k d μ = lim inf n S f n d μ .  

    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

    S f d μ lim inf n S f n d μ 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 ( Ω , F , P ) ; 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 ( Ω , F , P ) and let G F be a sub-σ-algebra. Then

    E [ lim inf n X n | G ] lim inf n E [ X n | G ]    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

    Y k = inf n k X n .

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

    E [ Y k | G ] E [ X n | G ]    almost surely

    by the monotonicity of conditional expectation, hence

    E [ Y k | G ] inf n k E [ X n | G ]    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

    E [ lim inf n X n | G ] = E [ X | G ] = E [ lim k Y k | G ] = lim k E [ Y k | G ] lim k inf n k E [ X n | G ] = lim inf n E [ X n | G ] .

    Extension to uniformly integrable negative parts

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

    X n := max { X n , 0 } , n N ,

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

    E [ X n 1 { X n > c } | G ] < ε , for all  n N , almost surely ,

    then

    E [ lim inf n X n | G ] lim inf n E [ X n | G ]    almost surely.

    Note: On the set where

    X := lim inf n X n

    satisfies

    E [ max { X , 0 } | G ] = ,

    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

    E [ X n 1 { X n > c } | G ] < ε for all  n N , almost surely .

    Since

    X + c lim inf n ( X n + 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

    E [ X | G ] + c E [ lim inf n ( X n + c ) + | G ] lim inf n E [ ( X n + c ) + | G ]    almost surely.

    Since

    ( X n + c ) + = ( X n + c ) + ( X n + c ) X n + c + X n 1 { X n > c } ,

    we have

    E [ ( X n + c ) + | G ] E [ X n | G ] + c + ε    almost surely,

    hence

    E [ X | G ] lim inf n E [ X n | G ] + ε    almost surely.

    This implies the assertion.

    References

    Fatou's lemma Wikipedia