Professional Documents
Culture Documents
5 Modes of Convergence: Tel Aviv University, 2015 Functions of Real Variables
5 Modes of Convergence: Tel Aviv University, 2015 Functions of Real Variables
5 Modes of convergence
5a Introduction . . . . . . . . . . . . . . . . . . . . . 46
5b Local convergence in measure . . . . . . . . . . . 47
5c Convergence almost everywhere . . . . . . . . . 49
5d Dominated convergence; integrals depending on
a parameter . . . . . . . . . . . . . . . . . . . . . . 51
5e One-sided bounds . . . . . . . . . . . . . . . . . . 53
5f Spaces Lp . . . . . . . . . . . . . . . . . . . . . . . 56
5a Introduction
If one has a sequence x1 , x2 , x3 , · · · ∈ R of real numbers xn , it
is unambiguous what it means for that sequence to converge to
a limit x ∈ R . . . If, however, one has a sequence f1 , f2 , f3 , . . .
of functions fn : X → R . . . and a putative limit f : X → R
. . . there can now be many different ways in which the sequence
fn may or may not converge to the limit f . . . Once X becomes
infinite, the functions fn acquire an infinite number of degrees of
freedom, and this allows them to approach f in any number of
inequivalent ways. . . . However, pointwise and uniform conver-
gence are only two of dozens of many other modes of convergence
that are of importance in analysis.
Tao, Sect. 1.5 “Modes of convergence”.
When speaking about functions fn on a measure space we really mean, as
usual, equivalence classes [fn ]. Thus we restrict ourselves to such modes of
convergence that are insensitive to arbitrary change of fn on a null set. (Do
you bother whether the null set depends on n?) We replace the pointwise
convergence with the convergence almost everywhere,
(why “L∞ ”? wait for 5f7). On the other hand, the given measure leads to
new modes of convergence, such as
Z
fn → f in L1 ⇐⇒ |fn − f | dµ → 0 .
X
Proof. Let fn → f locally in µ, ε > 0 and ν(A) < ∞; we have to prove that
ν(An ) → 0, where An = {x ∈ A : |fn (x) − f (x)| ≥ ε}. By 5b2, WLOG we
may assume that dµdν
and dµ
dν
are bounded on A, since countably many such
≤ supx∈A dµ
sets A can cover X (think, why). Now, µ(A) dν
(x) ν(A) < ∞,
dν
thus µ(An ) → 0, and ν(An ) ≤ supx∈A dµ (x) µ(An ) → 0.
R
(b) X min(1, |fn |) dµ → 0;
R |fn |
(c) X 1+|f n|
dµ → 0.
Prove it.
We may define a metric ρ on the set1 L0 (X) of all equivalence classes of
measurable functions X → R by2
Z
(5b10) ρ [f ], [g] = min(1, |f − g|) dµ
X
provided that µ(X) < ∞; otherwise we use a finite equivalent measure in-
stead.
fn → f a.e. ;
∀n |fn | ≤ g a.e. ;
g is integrable .
Proof. We did not stipulate σ-finiteness of µ, but this does not matter;
WLOG, g : X → (0, ∞), since all fn and f vanish outside {x : g(x) 6= 0};
now µ must be σ-finite, since it is equivalent to the finite measure ν = g · µ.
By (4c28),2
Z Z Z Z
fn f
fn dµ = dν , f dµ = dν .
X X g X X g
5d2 Remark. The a.e. convergence (fn → f ) may be replaces with the local
convergence in measure. (Use 5c8.)
The Dominated Convergence Theorem 5d1 is useful when dealing with
integrals depending on a parameter.1 Consider a function f : R × X → R
such that its first section f (t, ·) : x 7→ f (t, x) is integrable (for every t ∈ R),
and its second sectionRf (·, x) : t 7→ f (t, x) is continuous (for every x ∈ X).
We introduce F (t) = X f (t, ·) dµ and wonder, whether F is continuous, or
not.
The function g : x 7→ supt∈R f (t, x) is measurable (since the supremum
may be taken over rational t); and if g is integrable, then F is continuous
(since tn → t implies F (tn ) → F (t) by 5d1).
Z
(5d3) If t 7→ f (t, x) is continuous and sup |f (t, ·)| dµ < ∞ ,
X t Z
then t 7→ f (t, ·) dµ is continuous.
X
R R
(Warning: sup(. . . ) is generally larger than sup (. . . ).)
Moreover, it is enough if t 7→ f (t, x) is continuous at t for all x outside
some null set that may depend on t. In particular,
Z t
(5d4) if f : R → R is integrable, then t 7→ f dm is continuous.
0
(5d5) If a random function is continuous almost surely (at each point separately)
and the supremum of its absolute value has finite expectation,
then its expectation is a continuous function.
5d6 Example. The integrable majorant is essential.
Consider a random function equal to 2n f (2n t) with probability 2−n , n =
1, 2, . . . ; here
1
2t − 1 for t ∈ [ 2 , 1],
f (t) = 2 − t for t ∈ [1, 2],
0 for t ∈ (−∞, 12 ] ∪ [2, ∞).
1
See Jones, Sect. 6G.
Tel Aviv University, 2015 Functions of real variables 53
Its expectation is
∞
X 0
for t ∈ (−∞, 0] ∪ [1, ∞),
n
f (2 t) = 1 for t ∈ [0, 21 ],
n=1
2(1 − t) for t ∈ [ 21 , 1]
f (t + h, ·) − f (t, ·) ∂ f (t + h, ·) − f (t, ·)
→ f (t, ·) a.e., ≤ g(·) ;
h ∂t h
by 5d1, F (t+h)−F (t)
= X f (t+h,·)−f (t,·)
R R ∂
h h
dµ → X ∂t f (t, ·) dµ as h → 0. Nice;
but is f (t, ·) integrable? For now we only know that f (t + h, ·) − f (t, ·) is
integrable for all t and h.
Z ∂
1
(5d7) If t 7→ f (t, x) ∈ C (R) , and sup f (t, ·) dµ < ∞ , and
X t∈R ∂t
f (t, ·) is integrable for some (therefore, every) t , then
Z Z Z
1 d ∂
t 7→ f (t, ·) dµ ∈ C (R) , and f (t, ·) dµ = f (t, ·) dµ .
X dt X X ∂t
5e One-sided bounds
First, the monotone case.
In the Monotone Convergence Theorem 4c11, functions fn are bounded
from below by 0; equally well they may be bounded from below by an inte-
grable function.
Tel Aviv University, 2015 Functions of real variables 54
∞, 5e1 fails for two reasons. First, it may happen that X fRn dµ is ∞ − ∞
for all n, and the conclusion Ris a nonsense. Second, even if X fn dµ = −∞
for all n, it does not imply X f dµ = −∞. For a counterexample take a
nonintegrable h : X → [0, ∞), an integrable f , and consider fn = f − n1 h.
Now, the non-monotone case.
In the Dominated Convergence Theorem 5d1, functions fn are bounded
by integrable function(s) from both sides: R −g ≤ fn ≤ g. In Example 5d6,
taking tn → 0, we get fn → 0 a.e., but X fn dµ → 1; these fn are bounded
from below (just by 0), and surely not bounded from aboveR (by an integrable
function) according to 5d1. Also, (−fR n ) → 0 a.e., but X (−f
R n ) dµ → −1; and
(−fn ) ≤ 0. Does it mean that limn fn can deviate R from lim R n fn only to the
unbounded direction? Can we prove that limn X fn dµ ≤R X f dµ whenever
fn → f a.e. and ∀n fn ≤ g, g integrable,
R or equivalently, X (supn fn )+ dµ <
∞? No, we cannot, since limn X fn dµ R need not Rexist (try fR2 = f4 = ·· · =
f ). But we can prove that lim supn X fn dµ ≤ X f dµ = X limn fn dµ.
Moreover, R we do notR really need existence
of limn fn ; we can prove that
lim supn X fn dµ ≤ X lim supn fn dµ whenever supn fn + is integrable.
Or we may change the signs of fn .
5e2 Proposition (Fatou’s Lemma).
Z Z
lim inf fn dµ ≤ lim inf fn dµ
X n n X
Thus,
Z Z Z Z
lim inf fn dµ = lim gn dµ = lim inf gn dµ ≤ lim inf fn dµ ,
X n n X n X n X
since gn ≤ fn .
5e5 Exercise. Z Z
f dµ ≤ lim inf fn dµ
X n X
whenever measurable functions f, fn : X → [−∞, +∞] are such that fn → f
locally in measure and (inf n fn )− is integrable.
Prove it.2
R
5e6 Corollary. (a) The set of all f ∈ L0 (X) such that f ≥ 0 and X f dµ ≤ 1
is closed in L0 (X) (w.r.t. the local convergence
R in measure);
R holds for f such that |f | dµ ≤ 1, and more generally, for
(b) the same
f such that ϕ ◦ f dµ ≤ 1 for a given continuous ϕ : [−∞, +∞] → [0, ∞]
(recall 5c9).3
R
In contrast, the set of all f ∈ L0 (X) such that f ≥ 0 and X f dµ ≥ 1 is
not closed in L0 (X).
1
Similarly to the proof of 5c1.
2
Hint: 5c8.
3
Still more generally: for all lower semicontinuous ϕ (it means, lims→t ϕ(s) ≥ ϕ(t)).
Tel Aviv University, 2015 Functions of real variables 56
5f Spaces Lp
Let ϕ : R → [0, ∞) be a convex function such that ϕ(0) = 0, ϕ(t) > 0 for all
t 6= 0, and ϕ(−t) = ϕ(t). For example, ϕ(t) = |t|p for a given p ∈ [1, ∞).
We introduce the set
n Z o
Bϕ = f ∈ L0 (X) : ϕ ◦ f dµ ≤ 1 .
X
the infimum is reached (since Bϕ is closed) unless the set is empty (in which
case kf kϕ = inf ∅ = +∞, of course). Convexity of Bϕ implies the triangle
inequality:
kf + gkϕ ≤ kf kϕ + kgkϕ ,
since, assuming kf kϕ + kgkϕ < ∞ (otherwise nothing to prove) we take
θ ∈ [0, 1] such that kf k = θ(kf k + kgk), kgk = (1 − θ)(kf k + kgk) and get
f ∈ θ(kf k+kgk)Bϕ , g ∈ (1−θ)(kf k+kgk)Bϕ , whence f +g ∈ (kf k+kgk)Bϕ .
Clearly, kf kϕ = 0 if and only if f = 0 a.e.
Thus, the set
5f2 Exercise. (a) For every ε > 0 there exists δ > 0 such that
∀f ∈ L0 (X) kf kϕ < δ =⇒ ρ(f, 0) < ε .
(b) Every Cauchy sequence in Lϕ (X) is a Cauchy sequence in L0 (X), ρ .
Prove it.1
5f3 Proposition. The normed space Lϕ (X) is complete (that is, every
Cauchy sequence is converging).
(Schwarz inequality).
Back to Lp (X).
5f4 Lemma. If µ(X) < ∞ and 1 ≤ p ≤ q < ∞, then Lp (X) ⊃ Lq (X) and
sup kf kp < ∞ .
kf kq =1
R
Proof. 1 If kf kq = 1, then X |fR|q dµ = 1; we note that
R |f |p ≤ max(1, |f |q ) ≤
1 + |f |q (think, why), and get X |f |p dµ ≤ µ(X) + X |f |q dµ = µ(X) + 1,
that is, kf kp ≤ µ(X) + 1 1/p .
5f5 Remark. (a) On (0, 1) (with Lebesgue measure), the function t 7→ t−α
belongs to Lp if and only if p < 1/α (check it), which shows that the inclusion
in 5f4 is generally strict: Lp (X) % Lq (X).
(b) On (1, ∞) (with Lebesgue measure), the function t 7→ t−α belongs to
Lp if and only if p > 1/α (check it), which shows that the inclusion in 5f4
may fail when µ(X) = ∞.
5f6 Lemma. If X is countable and inf x∈X µ({x}) > 0, then Lp (X) ⊂ Lq (X)
for 1 ≤ p ≤ q < ∞, and
sup kf kq < ∞ .
kf kp =1
P p
R p
Proof. If kf kp = 1, then x∈X |f (x)| µ({x}) = X |f | dµ = 1. Intro-
ducing ε = inf x∈X µ({x}) >R 0 we note that |f (x)| ≤ 1ε 1/p , therefore
|f |q ≤ 1ε (q−p)/p |f |p , and get X |f |q dµ ≤ 1ε (q−p)/p X |f |p dµ = 1ε (q−p)/p ,
R
1 1
that is, kf kq ≤ 1ε p − q .
5f7 Exercise. (a) lim inf p→∞ kf kp ≥ kf k∞ , where
(the infimum is reached, unless the set is empty, in which case kf k∞ = inf ∅ =
+∞, of course).
(b) If µ(X) < ∞ then kf kp → kf k∞ as p → ∞.
1
See Capiński & Kopp, Th. 5.25. In fact, the supremum is reached on constant f and
1 1
is therefore equal to (µ(X)) p − q .
Tel Aviv University, 2015 Functions of real variables 59
Index
Banach space, 57 Fatou’s Lemma, 54
1
1/p
Hint: (a) kf kp ≥ c µ{x : |f (x)| ≥ c} ; (b) use (a); (c) 5c6 aside, use uniform
convergence outside a null set.