Exercise 1.5.2 (Easy convergence implications)

Let (X,,μ) be a measure space, and let (f )n be a sequence of measurable functions from X to , and f : X be another measurable function.

(i)
If (f )n converges to f uniformly, then (f )n converges to f pointwise.
(ii)
If (f )n converges to f uniformly, then (f )n converges to f in L-norm. Conversely, If (f )n converges to f in L-norm, then (f )n converges to f uniformly outside of a null set.
(iii)
If (f )n converges to f in L norm, then (f )n converges to f almost uniformly.
(iv)
If (f )n converges to f almost uniformly, then (f )n converges to f almost everywhere pointwise.
(v)
If (f )n converges to f pointwise, then (f )n converges to f almost everywhere pointwise.
(vi)
If (f )n converges to f in L1 norm, then (f )n converges to f in measure.
(vii)
If (f )n converges to f almost uniformly, then (f )n converges to f in measure.

Answers

The following diagram summarizes the statements of the theorem:

Figure 1: Relation between different convergence modes
(i)
Trivial.
(ii)
Trivial.
(iii)
Trivial.
(iv)
Let (E)n be a sequence of measurable sets in X such that for each n we have μ(En) < 1n and (f )n converges uniformly to f on XEn. Now pick an arbitrary x X. We have two cases. In the first case x nEn, in which case lim nfn(x) is not necessarily f(x). But this is not harmful, since μ( nEn) = 0. In the second case x nEn, which implies lim nfn(x) = f(x) from the uniform convergence.
(v)
Trivial.
(vi)
Suppose that we can find a N such that for all n > N we have |fn f | < δ

By Markov’s inequality we have

𝜖 μ ({x X : |fn f| 𝜖}) |fn f | < δ

(vii)
Pick an arbitrary δ > 0 to test the convergence of the measure. Since (f )n converges to f almost uniformly, for this δ we can find a set E : μ(E) < δ such that (f )n converges uniformly to f on XE. Accordingly, we can find a N such that for all x XE and for all n > N we have |fn f| < 𝜖. Thus, for all n > N we have μ ({x X : |fn f| 𝜖}) = μ ({x E : |fn f| 𝜖}) + μ ({x XE : |fn f| 𝜖}) δ + 0 = δ
User profile picture
2020-10-26 00:00
Comments