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.
Standard statement
In what follows,
B
R
¯
≥
0
{\displaystyle \operatorname {\mathcal {B}} _{{\bar {\mathbb {R} }}_{\geq 0}}}
denotes the
σ
{\displaystyle \sigma }
-algebra of Borel sets on
[
0
,
+
∞
]
{\displaystyle [0,+\infty ]}
.
Theorem—Fatou's lemma. Given a measure space
(
Ω
,
F
,
μ
)
{\displaystyle (\Omega ,{\mathcal {F}},\mu )}
and a set
X
∈
F
,
{\displaystyle X\in {\mathcal {F}},}
let
{
f
n
}
{\displaystyle \{f_{n}\}}
be a sequence of
(
F
,
B
R
¯
≥
0
)
{\displaystyle ({\mathcal {F}},\operatorname {\mathcal {B}} _{{\bar {\mathbb {R} }}_{\geq 0}})}
-measurable non-negative functions
f
n
:
X
→
[
0
,
+
∞
]
{\displaystyle f_{n}:X\to [0,+\infty ]}
. Define the function
f
:
X
→
[
0
,
+
∞
]
{\displaystyle f:X\to [0,+\infty ]}
by
f
(
x
)
=
lim inf
n
→
∞
f
n
(
x
)
,
{\displaystyle f(x)=\liminf _{n\to \infty }f_{n}(x),}
for every
x
∈
X
{\displaystyle x\in X}
. Then
f
{\displaystyle f}
is
(
F
,
B
R
¯
≥
0
)
{\displaystyle ({\mathcal {F}},\operatorname {\mathcal {B}} _{{\bar {\mathbb {R} }}_{\geq 0}})}
-measurable, and
-
∫
X
f
d
μ
≤
lim inf
n
→
∞
∫
X
f
n
d
μ
,
{\displaystyle \int _{X}f\,d\mu \leq \liminf _{n\to \infty }\int _{X}f_{n}\,d\mu ,}
where the integrals and the limit inferior may be infinite.
Fatou's lemma remains true if its assumptions hold
μ
{\displaystyle \mu }
-almost everywhere. In other words, it is enough that there is a null set
N
{\displaystyle N}
such that the values
{
f
n
(
x
)
}
{\displaystyle \{f_{n}(x)\}}
are non-negative for every
x
∈
X
∖
N
.
{\displaystyle {x\in X\setminus N}.}
To see this, note that the integrals appearing in Fatou's lemma are unchanged if we change each function on
N
{\displaystyle N}
.
Proof
Fatou's lemma does not require the monotone convergence theorem, 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
g
n
(
x
)
=
inf
k
≥
n
f
k
(
x
)
{\displaystyle \textstyle g_{n}(x)=\inf _{k\geq n}f_{k}(x)}
. Then:
- the sequence
{
g
n
(
x
)
}
n
{\displaystyle \{g_{n}(x)\}_{n}}
is pointwise non-decreasing at any x and
-
g
n
≤
f
n
{\displaystyle g_{n}\leq f_{n}}
, ∀ n ∈ N {\displaystyle \forall n\in \mathbb {N} }
.
Since
-
f
(
x
)
=
lim inf
n
→
∞
f
n
(
x
)
=
sup
n
inf
k
≥
n
f
k
(
x
)
=
sup
n
g
n
(
x
)
{\displaystyle f(x)=\liminf _{n\to \infty }f_{n}(x)=\sup _{n}\inf _{k\geq n}f_{k}(x)=\sup _{n}g_{n}(x)}
,
and infima and suprema of measurable functions are measurable we see that
f
{\displaystyle f}
is measurable.
By the Monotone Convergence Theorem and property (1), the sup and integral may be interchanged:
-
∫
X
f
d
μ
=
∫
X
sup
n
g
n
d
μ
=
sup
n
∫
X
g
n
d
μ
=
lim inf
n
→
∞
∫
X
g
n
d
μ
≤
lim inf
n
→
∞
∫
X
f
n
d
μ
,
{\displaystyle {\begin{aligned}\int _{X}f\,d\mu &=\int _{X}\sup _{n}g_{n}\,d\mu \\&=\sup _{n}\int _{X}g_{n}\,d\mu \\&=\liminf _{n\to \infty }\int _{X}g_{n}\,d\mu \\&\leq \liminf _{n\to \infty }\int _{X}f_{n}\,d\mu ,\end{aligned}}}
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
{\displaystyle f}
and
g
n
{\displaystyle g_{n}}
are measurable.
Denote by
SF
(
f
)
{\displaystyle \operatorname {SF} (f)}
the set of simple
(
F
,
B
R
≥
0
)
{\displaystyle ({\mathcal {F}},\operatorname {\mathcal {B}} _{\mathbb {R} _{\geq 0}})}
-measurable functions
s
:
X
→
[
0
,
∞
)
{\displaystyle s:X\to [0,\infty )}
such that
0
≤
s
≤
f
{\displaystyle 0\leq s\leq f}
on
X
{\displaystyle X}
.
Monotonicity—
- If
f
≤
g
{\displaystyle f\leq g}
everywhere on X , {\displaystyle X,}
then
-
∫
X
f
d
μ
≤
∫
X
g
d
μ
.
{\displaystyle \int _{X}f\,d\mu \leq \int _{X}g\,d\mu .}
- If
X
1
,
X
2
∈
F
{\displaystyle X_{1},X_{2}\in {\mathcal {F}}}
and X 1 ⊆ X 2 , {\displaystyle X_{1}\subseteq X_{2},}
then
-
∫
X
1
f
d
μ
≤
∫
X
2
f
d
μ
.
{\displaystyle \int _{X_{1}}f\,d\mu \leq \int _{X_{2}}f\,d\mu .}
- If f is nonnegative and
S
=
∪
i
=
1
∞
S
i
{\displaystyle S=\cup _{i=1}^{\infty }S_{i}}
, where S 1 ⊆ … ⊆ S i ⊆ … ⊆ S {\displaystyle S_{1}\subseteq \ldots \subseteq S_{i}\subseteq \ldots \subseteq S}
is a non-decreasing chain of μ {\displaystyle \mu }
-measurable sets, then
-
∫
S
f
d
μ
=
lim
n
→
∞
∫
S
n
f
d
μ
{\displaystyle \int _{S}{f\,d\mu }=\lim _{n\to \infty }{\int _{S_{n}}{f\,d\mu }}}
1. Since
f
≤
g
,
{\displaystyle f\leq g,}
we have
-
SF
(
f
)
⊆
SF
(
g
)
.
{\displaystyle \operatorname {SF} (f)\subseteq \operatorname {SF} (g).}
By definition of Lebesgue integral and the properties of supremum,
-
∫
X
f
d
μ
=
sup
s
∈
S
F
(
f
)
∫
X
s
d
μ
≤
sup
s
∈
S
F
(
g
)
∫
X
s
d
μ
=
∫
X
g
d
μ
.
{\displaystyle \int _{X}f\,d\mu =\sup _{s\in {\rm {SF}}(f)}\int _{X}s\,d\mu \leq \sup _{s\in {\rm {SF}}(g)}\int _{X}s\,d\mu =\int _{X}g\,d\mu .}
2. Let
1
X
1
{\displaystyle {\mathbf {1} }_{X_{1}}}
be the indicator function of the set
X
1
.
{\displaystyle X_{1}.}
It can be deduced from the definition of Lebesgue integral that
-
∫
X
2
f
⋅
1
X
1
d
μ
=
∫
X
1
f
d
μ
{\displaystyle \int _{X_{2}}f\cdot {\mathbf {1} }_{X_{1}}\,d\mu =\int _{X_{1}}f\,d\mu }
if we notice that, for every
s
∈
S
F
(
f
⋅
1
X
1
)
,
{\displaystyle s\in {\rm {SF}}(f\cdot {\mathbf {1} }_{X_{1}}),}
s
=
0
{\displaystyle s=0}
outside of
X
1
.
{\displaystyle X_{1}.}
Combined with the previous property, the inequality
f
⋅
1
X
1
≤
f
{\displaystyle f\cdot {\mathbf {1} }_{X_{1}}\leq f}
implies
-
∫
X
1
f
d
μ
=
∫
X
2
f
⋅
1
X
1
d
μ
≤
∫
X
2
f
d
μ
.
{\displaystyle \int _{X_{1}}f\,d\mu =\int _{X_{2}}f\cdot {\mathbf {1} }_{X_{1}}\,d\mu \leq \int _{X_{2}}f\,d\mu .}
3. First note that the claim holds if f is the indicator function of a set, by monotonicity of measures. By linearity, this also immediately implies the claim for simple functions.
Since any simple function supported on Sn is simple and supported on X, we must have
-
∫
X
f
d
μ
≥
lim
n
→
∞
∫
S
n
f
d
μ
{\displaystyle \int _{X}{f\,d\mu }\geq \lim _{n\to \infty }{\int _{S_{n}}{f\,d\mu }}}
.
For the reverse, suppose g ∈ SF(f) with
∫
X
f
d
μ
−
ϵ
≤
∫
X
g
d
μ
{\displaystyle \textstyle \int _{X}{f\,d\mu }-\epsilon \leq \int _{X}{g\,d\mu }}
By the above,
-
∫
X
f
d
μ
−
ϵ
≤
∫
X
g
d
μ
=
lim
n
→
∞
∫
S
n
g
d
μ
≤
lim
n
→
∞
∫
S
n
f
d
μ
{\displaystyle \int _{X}{f\,d\mu }-\epsilon \leq \int _{X}{g\,d\mu }=\lim _{n\to \infty }{\int _{S_{n}}{g\,d\mu }}\leq \lim _{n\to \infty }{\int _{S_{n}}{f\,d\mu }}}
Now we turn to the main theorem
Step 1—
g
n
=
g
n
(
x
)
{\displaystyle g_{n}=g_{n}(x)}
is
(
F
,
B
R
≥
0
)
{\displaystyle ({\mathcal {F}},\operatorname {\mathcal {B}} _{\mathbb {R} _{\geq 0}})}
-measurable, for every
n
≥
1
{\displaystyle n\geq 1}
, as is
f
{\displaystyle f}
.
Recall the closed intervals generate the Borel σ-algebra. Thus it suffices to show, for every
t
∈
[
−
∞
,
+
∞
]
{\displaystyle t\in [-\infty ,+\infty ]}
, that
g
n
−
1
(
[
t
,
+
∞
]
)
∈
F
{\displaystyle g_{n}^{-1}([t,+\infty ])\in {\mathcal {F}}}
. Now observe that
-
g
n
−
1
(
[
t
,
+
∞
]
)
=
{
x
∈
X
∣
g
n
(
x
)
≥
t
}
=
{
x
∈
X
|
inf
k
≥
n
f
k
(
x
)
≥
t
}
=
⋂
k
≥
n
{
x
∈
X
∣
f
k
(
x
)
≥
t
}
=
⋂
k
≥
n
f
k
−
1
(
[
t
,
+
∞
]
)
{\displaystyle {\begin{aligned}g_{n}^{-1}([t,+\infty ])&=\left\{x\in X\mid g_{n}(x)\geq t\right\}\\[3pt]&=\left\{x\in X\;\left|\;\inf _{k\,\geq \,n}f_{k}(x)\geq t\right.\right\}\\[3pt]&=\bigcap _{k\,\geq \,n}\left\{x\in X\mid f_{k}(x)\geq t\right\}\\[3pt]&=\bigcap _{k\,\geq \,n}f_{k}^{-1}([t,+\infty ])\end{aligned}}}
Every set on the right-hand side is from
F
{\displaystyle {\mathcal {F}}}
, which is closed under countable intersections. Thus the left-hand side is also a member of
F
{\displaystyle {\mathcal {F}}}
.
Similarly, it is enough to verify that
f
−
1
(
[
0
,
t
]
)
∈
F
{\displaystyle f^{-1}([0,t])\in {\mathcal {F}}}
, for every
t
∈
[
−
∞
,
+
∞
]
{\displaystyle t\in [-\infty ,+\infty ]}
. Since the sequence
{
g
n
(
x
)
}
{\displaystyle \{g_{n}(x)\}}
pointwise non-decreases,
-
f
−
1
(
[
0
,
t
]
)
=
⋂
n
g
n
−
1
(
[
0
,
t
]
)
∈
F
{\displaystyle f^{-1}([0,t])=\bigcap _{n}g_{n}^{-1}([0,t])\in {\mathcal {F}}}
.
Step 2—Given a simple function
s
∈
SF
(
f
)
{\displaystyle s\in \operatorname {SF} (f)}
and a real number
t
∈
(
0
,
1
)
{\displaystyle t\in (0,1)}
, define
-
B
k
s
,
t
=
{
x
∈
X
∣
t
⋅
s
(
x
)
≤
g
k
(
x
)
}
⊆
X
.
{\displaystyle B_{k}^{s,t}=\{x\in X\mid t\cdot s(x)\leq g_{k}(x)\}\subseteq X.}
Then
B
k
s
,
t
∈
F
{\displaystyle B_{k}^{s,t}\in {\mathcal {F}}}
,
B
k
s
,
t
⊆
B
k
+
1
s
,
t
{\displaystyle B_{k}^{s,t}\subseteq B_{k+1}^{s,t}}
, and
X
=
⋃
k
B
k
s
,
t
{\displaystyle \textstyle X=\bigcup _{k}B_{k}^{s,t}}
.
Step 2a. To prove the first claim, write s as a weighted sum of indicator functions of disjoint sets:
-
s
=
∑
i
=
1
m
c
i
⋅
1
A
i
{\displaystyle s=\sum _{i=1}^{m}c_{i}\cdot \mathbf {1} _{A_{i}}}
.
Then
-
B
k
s
,
t
=
⋃
i
=
1
m
(
g
k
−
1
(
[
t
⋅
c
i
,
+
∞
]
)
∩
A
i
)
{\displaystyle B_{k}^{s,t}=\bigcup _{i=1}^{m}{\Bigl (}g_{k}^{-1}{\Bigl (}[t\cdot c_{i},+\infty ]{\Bigr )}\cap A_{i}{\Bigr )}}
.
Since the pre-image
g
k
−
1
(
[
t
⋅
c
i
,
+
∞
]
)
{\displaystyle g_{k}^{-1}{\Bigl (}[t\cdot c_{i},+\infty ]{\Bigr )}}
of the Borel set
[
t
⋅
c
i
,
+
∞
]
{\displaystyle [t\cdot c_{i},+\infty ]}
under the measurable function
g
k
{\displaystyle g_{k}}
is measurable, and
σ
{\displaystyle \sigma }
-algebras are closed under finite intersection and unions, the first claim follows.
Step 2b. To prove the second claim, note that, for each
k
{\displaystyle k}
and every
x
∈
X
{\displaystyle x\in X}
,
g
k
(
x
)
≤
g
k
+
1
(
x
)
.
{\displaystyle g_{k}(x)\leq g_{k+1}(x).}
Step 2c. To prove the third claim, suppose for contradiction there exists
-
x
0
∈
X
∖
⋃
k
B
k
s
,
t
=
⋂
k
(
X
∖
B
k
s
,
t
)
{\displaystyle x_{0}\in X\setminus \bigcup _{k}B_{k}^{s,t}=\bigcap _{k}(X\setminus B_{k}^{s,t})}
Then
0
≤
g
k
(
x
0
)
<
t
⋅
s
(
x
0
)
<
s
(
x
0
)
{\displaystyle 0\leq g_{k}(x_{0})<t\cdot s(x_{0})<s(x_{0})}
, for every
k
{\displaystyle k}
. Taking the limit as
k
→
∞
{\displaystyle k\to \infty }
,
-
f
(
x
0
)
≤
t
⋅
s
(
x
0
)
<
s
(
x
0
)
.
{\displaystyle f(x_{0})\leq t\cdot s(x_{0})<s(x_{0}).}
This contradicts our initial assumption that
s
≤
f
{\displaystyle s\leq f}
.
Step 3—From step 2 and monotonicity,
-
lim
n
∫
B
n
s
,
t
s
d
μ
=
∫
X
s
d
μ
.
{\displaystyle \lim _{n}\int _{B_{n}^{s,t}}s\,d\mu =\int _{X}s\,d\mu .}
Step 4—For every
s
∈
SF
(
f
)
{\displaystyle s\in \operatorname {SF} (f)}
,
-
∫
X
s
d
μ
≤
lim
k
∫
X
g
k
d
μ
{\displaystyle \int _{X}s\,d\mu \leq \lim _{k}\int _{X}g_{k}\,d\mu }
.
Indeed, using the definition of
B
k
s
,
t
{\displaystyle B_{k}^{s,t}}
, the non-negativity of
g
k
{\displaystyle g_{k}}
, and the monotonicity of Lebesgue integral, we have
-
∀
k
≥
1
∫
B
k
s
,
t
t
⋅
s
d
μ
≤
∫
B
k
s
,
t
g
k
d
μ
≤
∫
X
g
k
d
μ
{\displaystyle \forall k\geq 1\qquad \int _{B_{k}^{s,t}}t\cdot s\,d\mu \leq \int _{B_{k}^{s,t}}g_{k}\,d\mu \leq \int _{X}g_{k}\,d\mu }
.
In accordance with Step 4, as
k
→
∞
{\displaystyle k\to \infty }
the inequality becomes
-
t
∫
X
s
d
μ
≤
lim
k
∫
X
g
k
d
μ
{\displaystyle t\int _{X}s\,d\mu \leq \lim _{k}\int _{X}g_{k}\,d\mu }
.
Taking the limit as
t
↑
1
{\displaystyle t\uparrow 1}
yields
-
∫
X
s
d
μ
≤
lim
k
∫
X
g
k
d
μ
{\displaystyle \int _{X}s\,d\mu \leq \lim _{k}\int _{X}g_{k}\,d\mu }
,
as required.
Step 5—To complete the proof, we apply the definition of Lebesgue integral to the inequality established in Step 4 and take into account that
g
n
≤
f
n
{\displaystyle g_{n}\leq f_{n}}
:
-
∫
X
f
d
μ
=
sup
s
∈
SF
(
f
)
∫
X
s
d
μ
≤
lim
k
∫
X
g
k
d
μ
=
lim inf
k
∫
X
g
k
d
μ
≤
lim inf
k
∫
X
f
k
d
μ
{\displaystyle {\begin{aligned}\int _{X}f\,d\mu &=\sup _{s\in \operatorname {SF} (f)}\int _{X}s\,d\mu \\&\leq \lim _{k}\int _{X}g_{k}\,d\mu \\&=\liminf _{k}\int _{X}g_{k}\,d\mu \\&\leq \liminf _{k}\int _{X}f_{k}\,d\mu \end{aligned}}}
The proof is complete.
Examples for strict inequality
Equip the space
S
{\displaystyle S}
with the Borel σ-algebra and the Lebesgue measure.
- Example for a probability space: Let
S
=
[
0
,
1
]
{\displaystyle S=[0,1]}
denote the unit interval. For every natural number n {\displaystyle n}
define
-
f
n
(
x
)
=
{
n
for
x
∈
(
0
,
1
/
n
)
,
0
otherwise.
{\displaystyle f_{n}(x)={\begin{cases}n&{\text{for }}x\in (0,1/n),\\0&{\text{otherwise.}}\end{cases}}}
-
f
n
(
x
)
=
{
n
for
x
∈
(
0
,
1
/
n
)
,
0
otherwise.
{\displaystyle f_{n}(x)={\begin{cases}n&{\text{for }}x\in (0,1/n),\\0&{\text{otherwise.}}\end{cases}}}
- Example with uniform convergence: Let
S
{\displaystyle S}
denote the set of all real numbers. Define
-
f
n
(
x
)
=
{
1
n
for
x
∈
[
0
,
n
]
,
0
otherwise.
{\displaystyle f_{n}(x)={\begin{cases}{\frac {1}{n}}&{\text{for }}x\in [0,n],\\0&{\text{otherwise.}}\end{cases}}}
-
f
n
(
x
)
=
{
1
n
for
x
∈
[
0
,
n
]
,
0
otherwise.
{\displaystyle f_{n}(x)={\begin{cases}{\frac {1}{n}}&{\text{for }}x\in [0,n],\\0&{\text{otherwise.}}\end{cases}}}
These sequences
(
f
n
)
n
∈
N
{\displaystyle (f_{n})_{n\in \mathbb {N} }}
converge on
S
{\displaystyle S}
pointwise (respectively uniformly) to the zero function (with zero integral), but every
f
n
{\displaystyle 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.
{\displaystyle f_{n}(x)={\begin{cases}-{\frac {1}{n}}&{\text{for }}x\in [n,2n],\\0&{\text{otherwise.}}\end{cases}}}
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 n > x, 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 § Extensions and variations of Fatou's lemma 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 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
μ
.
{\displaystyle \limsup _{n\to \infty }\int _{S}f_{n}\,d\mu \leq \int _{S}\limsup _{n\to \infty }f_{n}\,d\mu .}
Note: Here g integrable means that g is measurable and that
∫
S
g
d
μ
<
∞
{\displaystyle \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
.
{\displaystyle g-f_{n}.}
Since
∫
S
g
d
μ
<
+
∞
,
{\displaystyle \textstyle \int _{S}g\,d\mu <+\infty ,}
this sequence is defined
μ
{\displaystyle \mu }
-almost everywhere and non-negative.
Extensions and variations of Fatou's lemma
Integrable lower bound
Let
f
1
,
f
2
,
…
{\displaystyle f_{1},f_{2},\ldots }
be a sequence of extended real-valued measurable functions defined on a measure space
(
S
,
Σ
,
μ
)
{\displaystyle (S,\Sigma ,\mu )}
. If there exists an integrable function
g
{\displaystyle g}
on
S
{\displaystyle S}
such that
f
n
≥
−
g
{\displaystyle f_{n}\geq -g}
for all
n
{\displaystyle n}
, then
-
∫
S
lim inf
n
→
∞
f
n
d
μ
≤
lim inf
n
→
∞
∫
S
f
n
d
μ
.
{\displaystyle \int _{S}\liminf _{n\to \infty }f_{n}\,d\mu \leq \liminf _{n\to \infty }\int _{S}f_{n}\,d\mu .}
Proof
Apply Fatou's lemma to the non-negative sequence given by
f
n
+
g
{\displaystyle f_{n}+g}
.
Pointwise convergence
If in the previous setting the sequence
f
1
,
f
2
,
…
{\displaystyle f_{1},f_{2},\ldots }
converges pointwise to a function
f
{\displaystyle f}
μ
{\displaystyle \mu }
-almost everywhere on
S
{\displaystyle S}
, then
-
∫
S
f
d
μ
≤
lim inf
n
→
∞
∫
S
f
n
d
μ
.
{\displaystyle \int _{S}f\,d\mu \leq \liminf _{n\to \infty }\int _{S}f_{n}\,d\mu \,.}
Proof
Note that
f
{\displaystyle f}
has to agree with the limit inferior of the functions
f
n
{\displaystyle 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
,
…
{\displaystyle f_{1},f_{2},\ldots }
converges in measure to a function
f
{\displaystyle f}
.
Proof
There exists a subsequence such that
-
lim
k
→
∞
∫
S
f
n
k
d
μ
=
lim inf
n
→
∞
∫
S
f
n
d
μ
.
{\displaystyle \lim _{k\to \infty }\int _{S}f_{n_{k}}\,d\mu =\liminf _{n\to \infty }\int _{S}f_{n}\,d\mu .}
Since this subsequence also converges in measure to
f
{\displaystyle f}
, there exists a further subsequence, which converges pointwise to
f
{\displaystyle 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
μ
{\displaystyle \mu }
. Suppose that
μ
n
{\displaystyle \mu _{n}}
is a sequence of measures on the measurable space
(
M
,
Σ
)
{\displaystyle (M,\Sigma )}
such that (see Convergence of measures)
-
∀
E
∈
F
:
μ
n
(
E
)
→
μ
(
E
)
{\displaystyle \forall E\in {\mathcal {F}}\colon \;\mu _{n}(E)\to \mu (E)}
.
Then, with
f
n
{\displaystyle f_{n}}
non-negative integrable functions and
f
{\displaystyle f}
being their pointwise limit inferior, we have
-
∫
S
f
d
μ
≤
lim inf
n
→
∞
∫
S
f
n
d
μ
n
.
{\displaystyle \int _{S}f\,d\mu \leq \liminf _{n\to \infty }\int _{S}f_{n}\,d\mu _{n}.}
Proof We will prove something a bit stronger here. Namely, we will allow f n {\displaystyle f_{n}} to converge μ {\displaystyle \mu }
-almost everywhere on a subset E {\displaystyle E}
of S {\displaystyle S}
. We seek to show that
-
∫
E
f
d
μ
≤
lim inf
n
→
∞
∫
E
f
n
d
μ
n
.
{\displaystyle \int _{E}f\,d\mu \leq \liminf _{n\to \infty }\int _{E}f_{n}\,d\mu _{n}\,.}
-
K
=
{
x
∈
E
|
f
n
(
x
)
→
f
(
x
)
}
{\displaystyle K=\{x\in E|f_{n}(x)\rightarrow f(x)\}}
.
-
∫
E
f
d
μ
=
∫
E
−
K
f
d
μ
,
∫
E
f
n
d
μ
=
∫
E
−
K
f
n
d
μ
∀
n
∈
N
.
{\displaystyle \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 \mathbb {N} .}
by E − K {\displaystyle E-K}
we may assume that f n {\displaystyle f_{n}}
converge to f {\displaystyle f}
pointwise on E {\displaystyle E}
. Next, note that for any simple function ϕ {\displaystyle \phi }
we have
-
∫
E
ϕ
d
μ
=
lim
n
→
∞
∫
E
ϕ
d
μ
n
.
{\displaystyle \int _{E}\phi \,d\mu =\lim _{n\to \infty }\int _{E}\phi \,d\mu _{n}.}
is any non-negative simple function less than or equal to f {\displaystyle f}
, then
-
∫
E
ϕ
d
μ
≤
lim inf
n
→
∞
∫
E
f
n
d
μ
n
{\displaystyle \int _{E}\phi \,d\mu \leq \liminf _{n\rightarrow \infty }\int _{E}f_{n}\,d\mu _{n}}
-
A
=
{
x
∈
E
|
ϕ
(
x
)
>
a
}
{\displaystyle A=\{x\in E|\phi (x)>a\}}
. We must have that μ ( A ) {\displaystyle \mu (A)}
is infinite since
-
∫
E
ϕ
d
μ
≤
M
μ
(
A
)
,
{\displaystyle \int _{E}\phi \,d\mu \leq M\mu (A),}
attains. Next, we define
-
A
n
=
{
x
∈
E
|
f
k
(
x
)
>
a
∀
k
≥
n
}
.
{\displaystyle A_{n}=\{x\in E|f_{k}(x)>a~\forall k\geq n\}.}
-
A
⊆
⋃
n
A
n
⇒
μ
(
⋃
n
A
n
)
=
∞
.
{\displaystyle A\subseteq \bigcup _{n}A_{n}\Rightarrow \mu (\bigcup _{n}A_{n})=\infty .}
is a nested increasing sequence of functions and hence, by the continuity from below μ {\displaystyle \mu }
,
-
lim
n
→
∞
μ
(
A
n
)
=
∞
.
{\displaystyle \lim _{n\rightarrow \infty }\mu (A_{n})=\infty .}
.
-
lim
n
→
∞
μ
n
(
A
n
)
=
μ
(
A
n
)
=
∞
.
{\displaystyle \lim _{n\to \infty }\mu _{n}(A_{n})=\mu (A_{n})=\infty .}
.
-
∫
E
f
n
d
μ
n
≥
a
μ
n
(
A
n
)
⇒
lim inf
n
→
∞
∫
E
f
n
d
μ
n
=
∞
=
∫
E
ϕ
d
μ
,
{\displaystyle \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 ,}
. We must have that μ ( A ) {\displaystyle \mu (A)}
is finite. Denote, as above, by M {\displaystyle M}
the maximum value of ϕ {\displaystyle \phi }
and fix ϵ > 0 {\displaystyle \epsilon >0}
Define
-
A
n
=
{
x
∈
E
|
f
k
(
x
)
>
(
1
−
ϵ
)
ϕ
(
x
)
∀
k
≥
n
}
.
{\displaystyle A_{n}=\{x\in E|f_{k}(x)>(1-\epsilon )\phi (x)~\forall k\geq n\}.}
. Thus, A − A n {\displaystyle A-A_{n}}
is a decreasing sequence of sets with empty intersection. Since A {\displaystyle A}
has finite measure (this is why we needed to consider the two separate cases),
-
lim
n
→
∞
μ
(
A
−
A
n
)
=
0.
{\displaystyle \lim _{n\rightarrow \infty }\mu (A-A_{n})=0.}
-
μ
(
A
−
A
k
)
<
ϵ
,
∀
k
≥
n
.
{\displaystyle \mu (A-A_{k})<\epsilon ,~\forall k\geq n.}
-
lim
n
→
∞
μ
n
(
A
−
A
k
)
=
μ
(
A
−
A
k
)
,
{\displaystyle \lim _{n\to \infty }\mu _{n}(A-A_{k})=\mu (A-A_{k}),}
-
μ
k
(
A
−
A
k
)
<
ϵ
,
∀
k
≥
N
.
{\displaystyle \mu _{k}(A-A_{k})<\epsilon ,~\forall k\geq N.}
-
∫
E
f
k
d
μ
k
≥
∫
A
k
f
k
d
μ
k
≥
(
1
−
ϵ
)
∫
A
k
ϕ
d
μ
k
.
{\displaystyle \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}.}
-
∫
E
ϕ
d
μ
k
=
∫
A
ϕ
d
μ
k
=
∫
A
k
ϕ
d
μ
k
+
∫
A
−
A
k
ϕ
d
μ
k
.
{\displaystyle \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}.}
-
(
1
−
ϵ
)
∫
A
k
ϕ
d
μ
k
≥
(
1
−
ϵ
)
∫
E
ϕ
d
μ
k
−
∫
A
−
A
k
ϕ
d
μ
k
.
{\displaystyle (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}.}
-
∫
E
f
k
d
μ
k
≥
(
1
−
ϵ
)
∫
E
ϕ
d
μ
k
−
∫
A
−
A
k
ϕ
d
μ
k
≥
∫
E
ϕ
d
μ
k
−
ϵ
(
∫
E
ϕ
d
μ
k
+
M
)
.
{\displaystyle \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).}
to 0 and taking the liminf in n {\displaystyle n}
, we get that
-
lim inf
n
→
∞
∫
E
f
n
d
μ
k
≥
∫
E
ϕ
d
μ
,
{\displaystyle \liminf _{n\rightarrow \infty }\int _{E}f_{n}\,d\mu _{k}\geq \int _{E}\phi \,d\mu ,}
-
∫
E
f
d
μ
≤
lim inf
n
→
∞
∫
E
f
n
d
μ
n
.
{\displaystyle \int _{E}f\,d\mu \leq \liminf _{n\to \infty }\int _{E}f_{n}\,d\mu _{n}\,.}
Asymptotically uniform integrable functions
The following results use the notion asymptotically uniform integrable (a.u.i). A sequence
{
f
n
}
n
∈
N
{\displaystyle \{f_{n}\}_{n\in \mathbb {N} }}
of measurable
{
R
∪
±
∞
}
{\displaystyle \{\mathbb {R} \cup \pm \infty \}}
-valued functions is a.u.i with respect to a sequence of measures
{
μ
n
}
n
∈
N
{\displaystyle \{\mu _{n}\}_{n\in \mathbb {N} }}
if
lim
K
→
+
∞
lim sup
n
→
∞
∫
M
|
f
n
(
s
)
|
I
{
s
∈
M
:
|
f
n
(
s
)
|
≥
K
}
μ
n
(
d
s
)
=
0
.
{\displaystyle \lim _{K\rightarrow +\infty }\limsup _{n\rightarrow \infty }\int _{M}|f_{n}(s)|\mathbf {I} \{s\in M:|f_{n}(s)|\geq K\}\mu _{n}(ds)=0\,.}
Weakly converging measures
A sequence of measures
{
μ
n
}
n
∈
N
{\displaystyle \{\mu _{n}\}_{n\in \mathbb {N} }}
on a metric space
M
{\displaystyle M}
converges weakly to a finite measure
μ
{\displaystyle \mu }
on M if, for each bounded continuous function
f
{\displaystyle f}
on
M
{\displaystyle M}
,
∫
M
f
(
s
)
μ
n
(
d
s
)
→
∫
M
f
(
s
)
μ
(
d
s
)
as
n
→
∞
.
{\displaystyle \int _{M}f(s)\mu _{n}(ds)\rightarrow \int _{M}f(s)\mu (ds)\quad {\text{as }}n\rightarrow \infty \,.}
Theorem[1]—Denote
f
n
−
(
s
)
=
−
min
{
f
n
(
s
)
,
0
}
{\displaystyle f_{n}^{-}(s)=-\min\{f_{n}(s),0\}}
. Let
M
{\displaystyle M}
be a metric space,
{
μ
n
}
n
∈
N
{\displaystyle \{\mu _{n}\}_{n\in \mathbb {N} }}
be a sequence of measures on
M
{\displaystyle M}
converging weakly to
μ
∈
M
(
M
)
{\displaystyle \mu \in {\mathcal {M}}(M)}
, and
{
f
n
}
n
∈
N
{\displaystyle \{f_{n}\}_{n\in \mathbb {N} }}
be a sequence of measurable
{
R
∪
±
∞
}
{\displaystyle \{\mathbb {R} \cup \pm \infty \}}
-valued functions on
M
{\displaystyle M}
such that
{
f
n
−
}
n
∈
N
{\displaystyle \{f_{n}^{-}\}_{n\in \mathbb {N} }}
is a.u.i with respect to
{
μ
n
}
n
∈
N
{\displaystyle \{\mu _{n}\}_{n\in \mathbb {N} }}
. Then
-
∫
M
lim inf
n
→
∞
,
s
′
→
s
f
n
(
s
′
)
μ
(
d
s
)
≤
lim inf
n
→
∞
∫
M
f
n
(
s
)
μ
n
(
d
s
)
.
{\displaystyle \int _{M}\liminf _{n\rightarrow \infty ,s'\rightarrow s}f_{n}(s')\mu (ds)\leq \liminf _{n\rightarrow \infty }\int _{M}f_{n}(s)\mu _{n}(ds)\,.}
Measures with convergence in total variation
A sequence of finite measures
{
μ
n
}
n
∈
N
{\displaystyle \{\mu _{n}\}_{n\in \mathbb {N} }}
on a measurable space
(
M
,
Σ
)
{\displaystyle (M,\Sigma )}
converges in total variation to a measure
μ
{\displaystyle \mu }
on
(
M
,
Σ
)
{\displaystyle (M,\Sigma )}
if
sup
{
|
∫
M
f
(
s
)
μ
n
(
d
s
)
−
∫
M
f
(
s
)
μ
(
d
s
)
|
:
f
:
M
↦
[
−
1
,
1
]
is measurable
}
→
0
as
n
→
∞
.
{\displaystyle \sup \left\{\left|\int _{M}f(s)\mu _{n}(ds)-\int _{M}f(s)\mu (ds)\right|:\,f:M\mapsto [-1,1]{\text{ is measurable}}\right\}\rightarrow 0\quad {\text{as }}n\rightarrow \infty \,.}
Theorem[2]—Let
M
{\displaystyle M}
be a measurable space,
{
μ
n
}
n
∈
N
{\displaystyle \{\mu _{n}\}_{n\in \mathbb {N} }}
be a sequence of measures on
M
{\displaystyle M}
converging in total variation to a measure
μ
∈
M
(
M
)
{\displaystyle \mu \in {\mathcal {M}}(M)}
, and
{
f
n
}
n
∈
N
{\displaystyle \{f_{n}\}_{n\in \mathbb {N} }}
be a sequence of measurable
{
R
∪
±
∞
}
{\displaystyle \{\mathbb {R} \cup \pm \infty \}}
-valued functions on
M
{\displaystyle M}
, and
f
{\displaystyle f}
be a measurable
{
R
∪
±
∞
}
{\displaystyle \{\mathbb {R} \cup \pm \infty \}}
-valued function. Assume that
f
∈
L
1
(
M
;
μ
)
{\displaystyle f\in L^{1}(M;\mu )}
and
f
n
∈
L
1
(
M
;
μ
n
)
{\displaystyle f_{n}\in L^{1}(M;\mu _{n})}
Then
-
lim inf
n
→
∞
inf
C
∈
Σ
(
∫
C
f
n
(
s
)
μ
n
(
d
s
)
−
∫
C
f
(
s
)
μ
(
d
s
)
)
≥
0
,
{\displaystyle \liminf _{n\rightarrow \infty }\inf _{C\in \Sigma }\left(\int _{C}f_{n}(s)\mu _{n}(ds)-\int _{C}f(s)\mu (ds)\right)\geq 0\,,}
if and only if the following two statements hold:
- (i) for each
ε
>
0
{\displaystyle \varepsilon >0}
, μ ( { s ∈ M : f n ( s ) ≤ f ( s ) − ε } ) → 0 {\displaystyle \mu (\{s\in M:f_{n}(s)\leq f(s)-\varepsilon \})\to 0}
as n → ∞ {\displaystyle n\to \infty }
, and, therefore, there exists a subsequence { f n k } k ∈ N ⊂ { f n } n ∈ N {\displaystyle \{f_{n_{k}}\}_{k\in \mathbb {N} }\subset \{f_{n}\}_{n\in \mathbb {N} }}
such that f ( s ) ≤ lim inf k → ∞ f n k ( s ) {\displaystyle f(s)\leq \liminf _{k\to \infty }f_{n_{k}}(s)}
for μ {\displaystyle \mu }
-a.e. s ∈ M {\displaystyle s\in M}
;
- (ii)
{
f
n
−
}
n
∈
N
{\displaystyle \{f_{n}^{-}\}_{n\in \mathbb {N} }}
is a.u.i. with respect to { μ n } n ∈ N {\displaystyle \{\mu _{n}\}_{n\in \mathbb {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
)
{\displaystyle \scriptstyle (\Omega ,\,{\mathcal {F}},\,\mathbb {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
)
{\displaystyle \scriptstyle (\Omega ,{\mathcal {F}},\mathbb {P} )}
and let
G
⊂
F
{\displaystyle \scriptstyle {\mathcal {G}}\,\subset \,{\mathcal {F}}}
be a sub-σ-algebra. Then
-
E
[
lim inf
n
→
∞
X
n
|
G
]
≤
lim inf
n
→
∞
E
[
X
n
|
G
]
{\displaystyle \mathbb {E} {\Bigl [}\liminf _{n\to \infty }X_{n}\,{\Big |}\,{\mathcal {G}}{\Bigr ]}\leq \liminf _{n\to \infty }\,\mathbb {E} [X_{n}|{\mathcal {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
.
{\displaystyle Y_{k}=\inf _{n\geq 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
]
{\displaystyle \mathbb {E} [Y_{k}|{\mathcal {G}}]\leq \mathbb {E} [X_{n}|{\mathcal {G}}]}
almost surely
by the monotonicity of conditional expectation, hence
-
E
[
Y
k
|
G
]
≤
inf
n
≥
k
E
[
X
n
|
G
]
{\displaystyle \mathbb {E} [Y_{k}|{\mathcal {G}}]\leq \inf _{n\geq k}\mathbb {E} [X_{n}|{\mathcal {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
]
.
{\displaystyle {\begin{aligned}\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}}]\\&\leq \lim _{k\to \infty }\inf _{n\geq k}\mathbb {E} [X_{n}|{\mathcal {G}}]=\liminf _{n\to \infty }\,\mathbb {E} [X_{n}|{\mathcal {G}}].\end{aligned}}}
Extension to uniformly integrable negative parts
Let X1, X2, . . . be a sequence of random variables on a probability space
(
Ω
,
F
,
P
)
{\displaystyle \scriptstyle (\Omega ,{\mathcal {F}},\mathbb {P} )}
and let
G
⊂
F
{\displaystyle \scriptstyle {\mathcal {G}}\,\subset \,{\mathcal {F}}}
be a sub-σ-algebra. If the negative parts
-
X
n
−
:=
max
{
−
X
n
,
0
}
,
n
∈
N
,
{\displaystyle X_{n}^{-}:=\max\{-X_{n},0\},\qquad n\in {\mathbb {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
{\displaystyle \mathbb {E} {\bigl [}X_{n}^{-}1_{\{X_{n}^{-}>c\}}\,|\,{\mathcal {G}}{\bigr ]}<\varepsilon ,\qquad {\text{for all }}n\in \mathbb {N} ,\,{\text{almost surely}}}
,
then
-
E
[
lim inf
n
→
∞
X
n
|
G
]
≤
lim inf
n
→
∞
E
[
X
n
|
G
]
{\displaystyle \mathbb {E} {\Bigl [}\liminf _{n\to \infty }X_{n}\,{\Big |}\,{\mathcal {G}}{\Bigr ]}\leq \liminf _{n\to \infty }\,\mathbb {E} [X_{n}|{\mathcal {G}}]}
almost surely.
Note: On the set where
-
X
:=
lim inf
n
→
∞
X
n
{\displaystyle X:=\liminf _{n\to \infty }X_{n}}
satisfies
-
E
[
max
{
X
,
0
}
|
G
]
=
∞
,
{\displaystyle \mathbb {E} [\max\{X,0\}\,|\,{\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
-
E
[
X
n
−
1
{
X
n
−
>
c
}
|
G
]
<
ε
for all
n
∈
N
,
almost surely
.
{\displaystyle \mathbb {E} {\bigl [}X_{n}^{-}1_{\{X_{n}^{-}>c\}}\,|\,{\mathcal {G}}{\bigr ]}<\varepsilon \qquad {\text{for all }}n\in \mathbb {N} ,\,{\text{almost surely}}.}
Since
-
X
+
c
≤
lim inf
n
→
∞
(
X
n
+
c
)
+
,
{\displaystyle X+c\leq \liminf _{n\to \infty }(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
]
{\displaystyle \mathbb {E} [X\,|\,{\mathcal {G}}]+c\leq \mathbb {E} {\Bigl [}\liminf _{n\to \infty }(X_{n}+c)^{+}\,{\Big |}\,{\mathcal {G}}{\Bigr ]}\leq \liminf _{n\to \infty }\mathbb {E} [(X_{n}+c)^{+}\,|\,{\mathcal {G}}]}
almost surely.
Since
-
(
X
n
+
c
)
+
=
(
X
n
+
c
)
+
(
X
n
+
c
)
−
≤
X
n
+
c
+
X
n
−
1
{
X
n
−
>
c
}
,
{\displaystyle (X_{n}+c)^{+}=(X_{n}+c)+(X_{n}+c)^{-}\leq X_{n}+c+X_{n}^{-}1_{\{X_{n}^{-}>c\}},}
we have
-
E
[
(
X
n
+
c
)
+
|
G
]
≤
E
[
X
n
|
G
]
+
c
+
ε
{\displaystyle \mathbb {E} [(X_{n}+c)^{+}\,|\,{\mathcal {G}}]\leq \mathbb {E} [X_{n}\,|\,{\mathcal {G}}]+c+\varepsilon }
almost surely,
hence
-
E
[
X
|
G
]
≤
lim inf
n
→
∞
E
[
X
n
|
G
]
+
ε
{\displaystyle \mathbb {E} [X\,|\,{\mathcal {G}}]\leq \liminf _{n\to \infty }\mathbb {E} [X_{n}\,|\,{\mathcal {G}}]+\varepsilon }
almost surely.
This implies the assertion.
References
- Feinberg, E. A.; Kasyanov, P. O.; Liang, Y. (2020). "Fatou's Lemma for Weakly Converging Measures under the Uniform Integrability Condition". Theory of Probability & Its Applications. 64 (4): 615–630. arXiv:1807.07931. doi:10.1137/S0040585X97T989738. ISSN 0040-585X.
- Feinberg; Kasyanov; Zgurovsky (2016). "Uniform Fatou's lemma". Journal of Mathematical Analysis and Applications. 444: 550–567.
- Carothers, N. L. (2000). Real Analysis. New York: Cambridge University Press. pp. 321–22. ISBN 0-521-49756-6.
- Royden, H. L. (1988). Real Analysis (3rd ed.). London: Collier Macmillan. ISBN 0-02-404151-3.
- Weir, Alan J. (1973). "The Convergence Theorems". Lebesgue Integration and Measure. Cambridge: Cambridge University Press. pp. 93–118. ISBN 0-521-08728-7.