Modes of Convergence: N N N N
Modes of Convergence: N N N N
Modes of Convergence: N N N N
Exercise Class 11
Modes of Convergence
If one has a sequence of complex numbers (xn )n∈N , it is unambiguous what it means
for that sequence to converge to a limit x ∈ R. More generally, if we have a sequence
(vn )n∈N of d-dimensional vectors in a real vector space Rn , it is clear what it means for
a sequence to converge to a limit. We usually consider convergence with respect to the
Euclidean norm, but for the purposes of convergence, these norms are all equivalent1 .
If, however, one has a sequence of real-valued functions (fn )n∈N on a common domain
Ω and a perceived limit f , there can now be many different ways how fn may or may
not converge to f . Since the function spaces we consider are infinite dimensional, the
functions fn have an infinite number of degrees of freedom, and this allows them to
approach f in any number of inequivalent ways.
We now introduce different convergence concepts for sequences of measurable func-
tions and then compare them to each other.
Definition 1: Modes of Convergence
Let (fn )n∈N and f : Ω → R be measurable functions. Then we say that (fn )
converges to f
We write fn → f µ-a.e.
µ
We write fn −
→ f.
– in L1 (Ω, µ) if
Z
lim kfn − f kL1 (Ω,µ) := lim |fn − f | dµ = 0.
n→∞ n→∞ Ω
L1
We write fn −→ f .
If there is no confusion as to what the space (Ω, µ) is, one often just speaks of L1
convergence (instead of L1 (Ω, µ) convergence).
Remark. The L1 mode of convergence is a special case of the Lp mode of convergence,
which is just convergence with respect to the Lp norm.
One particular advantage of L1 convergence is that, in the case when the fn are
µ-summable, it implies convergence of the integrals
Z Z
fn dµ → f dµ.
Ω Ω
1
In fact, on a finite dimensional vector space, any two norms are equivalent.
2. From Egorov’s theorem, it follows that for every δ > 0, there exists Fδ ⊂ Ω µ-
measurable with µ(Ω \ Fδ ) < δ such that (fn )n converges uniformly to f on Fδ . In
other words,
∀ε > 0 ∃N ≥ 0 : sup fn (x) − f (x) < ε ∀n ≥ N.
x∈Fδ
Therefore, for n ≥ N
{x ∈ Ω : fn (x) − f (x) > ε} ⊂ Ω \ Fδ .
Hence
µ({x ∈ Ω : fn (x) − f (x) > ε}) ≤ µ(Ω \ Fδ ) < δ.
Since δ > 0 was arbitrary, we can conclude.
Alternatively, the latter can be proven by applying the dominated convergence theorem
to the integral of 1{|fn −f |>ε} , which is dominated by 1 on a finite measure space.
All other implications between different convergence concepts are not true in general.
Example 1. As the sequence fn = 1[n,n+1] shows, the finiteness assumption in the
second implication is necessary. The sequence fn converges to 0 pointwise (and thus
µ-a.e.), however it does not converge in measure.
Example 2. Let Ω = [0, 1] and λ be the Lebesgue measure.
– (Convergence µ-a.e. ; L1 convergence)
The sequence fn := n1(0, 1 ) , n ∈ N, converges to 0 pointwise, hence also λ-a.e.
n
and hence in measure (since we are dealing with a finite measure space). But
fn dλ = 1 and thus (fn ) does not converge to 0 in L1 ([0, 1], λ).
R
Example 3. Let Ω = [0, 1] and consider the Lebesgue measure λ. We define the func-
tions
n
fn := 1 1 ∀n ≥ 1.
log(n) (0, n ]
Then we have fn → 0 pointwise and hence also λ-a.e. Moreover
Z
1
fn dλ = →0
[0,1] log(n)
and hence Z ∞ Z ∞
1
g 1(
X X
gdλ = 1
,1] dλ ≥ = ∞.
[0,1] n+1 n n log(n)
n=1 [0,1] n=2
The family (fn )n∈N is called uniformly µ-summable if for all ε > 0 there exists
δ > 0 such that for all n ∈ N and A ⊂ Ω µ-measurable with µ(A) < δ it holds
Z
|fn | dµ < ε.
A
i) fn → f in L1 (Ω, µ).
µ
ii) fn −
→ f and (fn )n∈N is uniformly µ-summable.
For 1 ≤ p < ∞, Lp (Ω, µ) convergence is the same as |fn − f |p → 0 in L1 (Ω, µ); for
p = ∞, it means that there exists a set N with µ(N ) = 0 such that (fn )n∈N converges
to f uniformly on N c .
Proposition 6
Assume that µ(Ω) < ∞ and 1 ≤ r ≤ s ≤ ∞. Let (fn )n∈N be a sequence of measur-
able functions. To summarize, we have the following implications:
r≤s
Ls Lr L1
+ uniformly µ-summable
µ-a.e. in measure µ