Definition 1 (Notions of convergence). Let (X,M,μ) be a measure space, and let fn:X→R, for every n, and f:X→R be measurable. (i) We say that fn→fpointwise if limn→∞fn(x)=f(x) for every x∈X. (ii) We say that fn→funiformly if limn→+∞supx∈X∣fn(x)−f(x)∣=0. (iii) We say that fn→falmost everywhere if limn→+∞fn(x)=f(x) for almost every x∈X.
(iv) Let p∈[1,+∞]. We say that fn→fin Lp(X) if limn→+∞∥fn−f∥p=0, that is, if
(v) We say that fn→fin measure if, for every ε>0,
n→∞limμ({x∈X:∣fn(x)−f(x)∣>ε})=0.
The set in Definition 1 (v) is also written {∣fn−f∣>ε}.
Remark 2. The notions (iii), (iv) and (v) of Definition 1 make sense for (fn)⊂Lp and f∈Lp.
Remark 3 (Obvious implications). Let (fn) and f be as in Definition 1. The notions of convergence of Definition 1 are related as in Figure 1. Uniform convergence implies pointwise convergence, which implies convergence almost everywhere, and neither implication can be reversed. Uniform convergence implies convergence in L∞, which does not imply uniform convergence, and convergence in L∞ implies convergence almost everywhere and convergence in measure.
Convergence in L∞ implies convergence almost everywhere: ∣fn(x)−f(x)∣≤∥fn−f∥∞ for almost every x∈X, and limn→∞∥fn−f∥∞=0. Convergence in L∞ implies convergence in measure. Let ε>0 and consider the set {∣fn−f∣>ε}. There exists N such that ∥fn−f∥∞≤ε/2 for every n≥N. Hence μ({∣fn−f∣>ε})=0 for every n≥N.
Figure 1. The drawing of Remark 3: the five notions of convergence of fn to f, a double arrow for each implication and a crossed double arrow for each implication that does not hold.
Example 4 (Typewriter sequence). On [0,1] with the Lebesgue measure λ, consider the sequence (fn)n≥1 of characteristic functions drawn in Figure 2. Its first terms are f1=χ[0,1/2] and f2=χ[1/2,1], then the characteristic functions f3,…,f6 of [0,1/4],[1/4,1/2],[1/2,3/4] and [3/4,1], then f7=χ[0,1/8], and so on. In detail, the terms come in groups: for every k≥1 the k-th group is made of the characteristic functions of the intervals [j/2k,(j+1)/2k] with j=0,1,…,2k−1, in this order.
Figure 2. The drawing of Example 4: the graphs of the functions f1 to f14, in rows of 2, 4 and 8, each on its own copy of [0,1]. The functions f1,f3 and f7, circled, are the first terms of the subsequence that converges to 0 almost everywhere.
For every x∈[0,1],limn→∞fn(x)=0 and limn→∞fn(x)=1. In fact, for every x and every N there exist n1,n2≥N such that fn1(x)=0 and fn2(x)=1. Indeed, for every k≥2 the point x lies in at least one and in at most two of the intervals of the k-th group. Hence the limit limn→∞fn(x) exists at no x, and (fn) does not converge almost everywhere.
The circled functions of Figure 2 form a subsequence (fnk), made of the characteristic functions of [0,1/2],[0,1/4],[0,1/8], and so on, such that fnk→0 almost everywhere on [0,1]. Finally, fn→0 in L1([0,1]).
Theorem 5 (Almost everywhere versus in measure). Let (X,M,μ) be a measure space, and let fn:X→R, for every n, and f:X→R be measurable. (1) If μ(X)<+∞ and fn→f almost everywhere, then fn→f in measure. (2) If fn→f in measure, then there exists a subsequence (fnk) such that fnk→f almost everywhere.
Theorem 5 (2) gives the convergence almost everywhere of a subsequence: the typewriter sequence of Example 4 converges to 0 in measure, but (fn) itself does not converge almost everywhere. In Theorem 5 (1) the assumption μ(X)<+∞ is needed. Otherwise, take (R,L(R),λ) and fn=χ[n,n+1], as in Figure 3: then fn→0 almost everywhere, but (fn) does not converge to 0 in measure. In fact, λ({∣fn∣>1/2})=λ([n,n+1])=1 for every n.
Figure 3. The function fn=χ[n,n+1] on R, the dashed level 1/2, and the set {∣fn∣>1/2}=[n,n+1] hatched on the axis. The slider sets n.
Theorem 6 (Lp implies measure). Let (X,M,μ) be a measure space, let fn:X→R, for every n, and f:X→R be measurable, and let p∈[1,+∞]. If fn→f in Lp, then fn→f in measure. In particular, by Theorem 5 (2), there exists a subsequence (fnk) such that fnk→f almost everywhere.
Proof (complete). The case p=+∞ is in Remark 3. Let p∈[1,+∞) and let ε>0. Then
where both inequalities are monotonicity, (3) and (2) of Remark 4 of the fifth post. Hence
μ({∣fn−f∣>ε})≤(ε1)p∥fn−f∥pp,
where ∥fn−f∥pp→0 as n→+∞ by assumption. Therefore
n→∞limμ({∣fn−f∣>ε})=0.■
Remark 7. On (R,L(R),λ) let fn=nχ[0,1/n] for every n≥1, as in Figure 4. Then fn→0 almost everywhere, fn↛0 in L1, and fn→0 in measure.
In fact, ∫R∣fn∣dλ=1 for every n. Moreover, for every ε>0 we have {∣fn∣>ε}=[0,1/n] for every n sufficiently big, hence λ({∣fn∣>ε})=1/n→0.
Figure 4. The drawing of Remark 7: the function fn=nχ[0,1/n], the region of area 1 under its graph, the dashed level ε, and the set {∣fn∣>ε} hatched on the axis. The sliders set n and ε.
Theorem 8 (Dominated convergence in Lp). Let (X,M,μ) be a measure space, let fn:X→R, for every n, and f:X→R be measurable, and let p∈[1,+∞). Suppose that fn→f almost everywhere and that there exists g∈Lp such that ∣fn∣≤g almost everywhere for every n. Then f∈Lp and fn→f in Lp.
Remark 9.Theorem 8 does not hold with p=+∞. On (R,L(R),λ) let fn=χ[0,1−1/n] for every n≥1, as in Figure 5. Then fn→χ[0,1] almost everywhere and ∣fn∣≤1∈L∞, but fn↛χ[0,1] in L∞.
In fact, ∣χ[0,1](x)−fn(x)∣=χ(1−1/n,1](x) for every x∈R, hence
∥fn−χ[0,1]∥∞=∥χ(1−1/n,1]∥∞=1for every n,
so ∥fn−χ[0,1]∥∞ does not tend to 0 as n→∞.
Figure 5. The drawing of Remark 9: above, the function fn=χ[0,1−1/n] and, dashed, its limit χ[0,1]; below, their difference ∣χ[0,1]−fn∣=χ(1−1/n,1]. The slider sets n.
Remark 10 (Reverse dominated convergence in Lp). Let (X,M,μ) be a measure space and let fn,f:X→R be measurable, for every n. Let p∈[1,+∞] and (fn)⊂Lp. If fn→f in Lp, then f∈Lp and there exist a subsequence (fnk) and g∈Lp such that: (i)fnk→f almost everywhere; (ii)∣fnk∣≤g almost everywhere for every k.
Proposition 11 (Almost everywhere and norms imply Lp). Let (X,M,μ) be a measure space, let fn,f:X→R be measurable, for every n, and let p∈[1,+∞). Suppose that fn→f almost everywhere, that fn,f∈Lp and that limn→∞∥fn∥p=∥f∥p. Then fn→f in Lp.
where the second equality is the hypothesis limn∥fn∥p=∥f∥p. Indeed, the first equality holds because, by the same hypothesis, the sequence 2p−1∥fn∥pp converges.
Comparing the first line of the first display with the last line of the second, limn∥fn−f∥pp≤0. Indeed, 2p∥f∥pp is finite because f∈Lp, so it can be subtracted from both sides. Since ∥fn−f∥pp≥0 for every n, it follows that limn∥fn−f∥p=0.■
Remark 12 (Uniqueness of limits). Let (X,M,μ) be a measure space and let fn,f,g:X→R be measurable, for every n. Suppose that fn→f with respect to a notion of convergence N1 and fn→g with respect to a notion of convergence N2, both among the notions of Definition 1. Then f=g almost everywhere.
Proof (complete). Every notion of Definition 1 implies the convergence almost everywhere of a subsequence, so there exists a subsequence (fnk) such that fnk→f almost everywhere. Indeed, uniform and pointwise convergence imply convergence almost everywhere by Remark 3, and convergence in Lp or in measure gives a subsequence that converges almost everywhere by Theorem 6 and by Theorem 5 (2).
Also fn→g with respect to N2, hence fnk→g with respect to N2, and therefore there exists a subsequence (fnkl) of (fnk) such that fnkl→g almost everywhere. Moreover, fnk→f almost everywhere, hence fnkl→f almost everywhere. Therefore, at almost every x∈X,
∣f(x)−g(x)∣=l→∞lim∣fnkl(x)−fnkl(x)∣=0.
Indeed, at such x the numbers fnkl(x) tend both to f(x) and to g(x). Hence f=g almost everywhere. ■
Example 13. Let fn(x)=cos(xn) for x∈[0,1], with the Lebesgue measure λ on [0,1], as in Figure 6. Does (fn) converge almost everywhere, in L1, in measure?
Figure 6. The drawing of Example 13 for the n of the slider: the graph of xn, which ends at the point (1,1), the graph of fn(x)=cos(xn), which ends at (1,cos(1)), and, dashed, the constant 1.
As n→∞,xn→0 for x∈[0,1) and xn→1 for x=1, pointwise. Hence, pointwise for every x∈[0,1],
fn(x)=cos(xn)n→∞{1cos(1)if x∈[0,1),if x=1.
Therefore fn→f almost everywhere, where f(x)=1 for every x∈[0,1]. Moreover, ∣fn∣=∣cos(xn)∣≤1 for every x∈[0,1]. Hence ∣fn∣≤f for every x and f∈L1((0,1)). By the dominated convergence theorem, Theorem 8 with p=1,fn→f in L1((0,1)). Finally, fn→f in measure by Theorem 6.
Example 14. Let α>0 and, on (R,L(R),λ), let fn=(1/nα)χ[0,n] for every n≥1, as in Figure 7. Find all α>0 such that (fn) converges in L1(R), and all α>0 such that (fn) converges in measure.
Figure 7. The drawing of Example 14: the function fn=(1/nα)χ[0,n], the region under its graph, of area n1−α, and the dashed level ε, with the set {fn>ε} hatched on the axis when it is not empty. The sliders set n,α and ε.
For every x∈R we have ∣fn(x)∣≤1/nα, which tends to 0 as n grows, so fn→0 pointwise on R. By the uniqueness of limits, Remark 12, if (fn) converges in L1, it converges to 0 in L1. We compute
Notice that limn→∞∥fn∥L1=limn→∞n1−α, which is 0 if and only if 1−α<0, that is, if and only if α>1. Hence (fn) converges in L1(R) if and only if α>1.
Let ε>0. By the uniqueness of limits, if (fn) converges in measure, it converges to 0 in measure, so it is enough to study λ({∣fn−0∣>ε})=λ({fn>ε}). There exists Nε such that fn≤ε for every n≥Nε, because fn≤1/nα→0. Hence {fn>ε}=∅ for every n≥Nε.
Therefore λ({fn>ε})=λ(∅)=0 for every n≥Nε, and limnλ({fn>ε})=0. This holds for every α>0, hence fn→0 in measure on R for every α>0.
since 1/n2≤1 and x/n2≥0. Moreover, g∈L1((2,+∞)), since g(x)∼2/x2 as x→+∞. Hence, by the dominated convergence theorem, Theorem 8 with p=1,fn→f in L1((2,+∞)).
(3) Compute limn∫2∞fndλ.
Remark 16. Let (X,M,μ) be a measure space and let fn,f:X→R be measurable, for every n. If fn→f in L1, then limn∫X∣fn∣dμ=∫X∣f∣dμ.
By Remark 16, applied to the functions fn≥0 and f≥0 of (2),
n→∞lim∫2∞fndλ=∫2∞(x−1)(x+2)1dλ.
Notice that f≥0 and that ∣f∣=f is integrable over (2,+∞) in the sense of the generalized Riemann integral. Hence, by (2) of Theorem 17 of the fifth post,