Theorem 1 (Fatou’s lemma). Let (X,M,μ) be a measure space and let (fn) be a sequence of measurable functions fn:X→[0,+∞]. Let f:X→[0,+∞] be given by f(x)=limn→∞fn(x), written f=limnfn. Then
be a simple function such that 0≤s≤f, written as in Definition 16 of the fourth post. Only the case 0<ak<+∞ for every k=1,…,m is treated. Let t∈(0,1). For every k=1,…,m and every n∈N define
Bk,n:={x∈Ak:fj(x)≥takfor every j≥n}⊂Ak,
as in Figure 1. These sets satisfy Bk,n⊂Bk,n+1 for every n and every k.
Figure 1. The drawing of the proof, with an instance on an interval X and μ=λ: the function f, the level ak of s over the set Ak, the dotted level tak, the function fn and, faint, the next functions fj with j>n. On the axis, the set Bk,n, under hatched rectangles of height tak; the sliders set n and t.
Let x∈Ak. Then f(x)=limnfn(x)≥s(x)=ak>tak. Hence there exists nx∈N such that fj(x)≥tak for every j≥nx. In other words, for every x∈Ak there exists nx such that x∈Bk,nx, so that
n⋃Bk,n=Ak
and, by the continuity of measures, Proposition 6 (i) of the second post,
μ(Ak)=n→+∞limμ(Bk,n).
For every n, by monotonicity, and since fn≥tak on Bk,n,
Taking the supremum over the simple functions s with 0≤s≤f gives, by Definition 3 of the previous post,
nlim∫Xfndμ≥t∫Xfdμ,
and letting t→1− gives
nlim∫Xfndμ≥∫Xfdμ.■
Remark 2. In Theorem 1 the assumption fn:X→[0,+∞] is needed. Otherwise, on R with the Lebesgue measure λ, let fn=−nχ[0,1/n] for every n≥1, as in Figure 2. Then ∫Rfndλ=−1 for every n, and fn→0 almost everywhere, so that, with f=0,
∫Rfdλ=0≤nlim∫Rfndλ=−1.
Figure 2. The drawing of Remark 2: the function fn, equal to −n on [0,1/n] and to 0 elsewhere, and the region of area 1 between its graph and the axis. The slider sets n.
Remark 3 (Reverse Fatou’s lemma). Let (X,M,μ) be a measure space, let (fn) be a sequence of measurable functions fn:X→[0,+∞), and let f=limnfn. Assume that there exists a measurable g:X→[0,+∞] such that g∈L1 and g≥fn almost everywhere for every n. Then
nlim∫Xfndμ≤∫Xfdμ.
Proof (sketch). Let hn=g−fn, so that hn≥0 almost everywhere, and
Theorem 4 (Monotone convergence, Beppo Levi). Let (X,M,μ) be a measure space and let (fn) be a sequence of measurable functions fn:X→[0,+∞]. Assume that fn+1≥fn almost everywhere for every n. Let f:X→[0,+∞] be such that f=limn→∞fn almost everywhere, that is, f(x)=supnfn(x) for almost every x. Then
where the first inequality is Fatou’s lemma, Theorem 1, and the third is monotonicity, as fn≤f almost everywhere. ■
Remark 5. In Theorem 4 the assumption fn+1≥fn almost everywhere for every n is needed. Otherwise, on R with the Lebesgue measure λ, let fn=χ[n,n+1] for every n∈N, as in Figure 3. Then fn→0 pointwise and ∫Rfndλ=1 for every n.
Figure 3. The drawing of Remark 5: the function fn, equal to 1 on [n,n+1] and to 0 elsewhere, and the region of area 1 under its graph. The slider sets n.
Remark 6 (Reverse monotone convergence). Let (X,M,μ) be a measure space and let (fn) be a sequence of measurable functions fn:X→[0,+∞). Assume that fn+1≤fn almost everywhere for every n. Let f:X→[0,+∞] be such that f=limnfn almost everywhere, that is, f(x)=infnfn(x) for almost every x. Suppose that ∫Xf0dμ<+∞. Then
where the first equality is the monotone convergence theorem, Theorem 4. ■
Proposition 8 (Measure induced by a nonnegative function). Let (X,M,μ) be a measure space, let φ:X→[0,+∞] be measurable, and define ν:M→[0,+∞] by
ν(E):=∫Eφdμ.
Then ν is a measure on M.
Remark 9. Let φ and ν be as in Proposition 8. For every measurable function f:X→[0,+∞),
∫Xfdν=∫Xfφdμ.
For example, let X=R,μ=λ and φ:R→[0,+∞] be measurable: Figure 4 draws λ and the measure ν, written φλ.
Figure 4. The drawing of Remark 9: on the left the Lebesgue measure λ, drawn as a horizontal line, and on the right, after the arrow, the measure φλ, drawn as the graph of φ, with the region under it over a small interval hatched.
Proof (sketch). Only the σ-additivity of the function ν of Proposition 8 is proved. Let (En)⊂M be pairwise disjoint and let E=⋃nEn. The goal is
where the second equality is Remark 7 and the third holds because the series inside the integral is φχE.■
Figure 5. The drawing of the proof: three of the pairwise disjoint sets En, here E1,E2 and E3, in a plane, and above each of them, at height 1, the graph of its characteristic function, the first one marked χE1.
Theorem 10 (Dominated convergence). Let (X,M,μ) be a measure space, let (fn) be a sequence of measurable functions fn:X→R, and let f:X→R. Suppose that fn→f almost everywhere and that there exists g∈L1(X) such that ∣fn∣≤g almost everywhere for every n. Then f∈L1(X) and
n→∞lim∫X∣fn−f∣dμ=0.
Proof (complete). At almost every x∈X,
∣f(x)∣=n→∞lim∣fn(x)∣≤g(x),
because ∣fn(x)∣≤g(x) for every n at almost every x. Hence
∫X∣f∣dμ≤∫Xgdμ<+∞,
and f∈L1.
(i) For every n, almost everywhere,
∣fn−f∣≤∣fn∣+∣f∣≤2g∈L1,
where ∣fn∣≤g almost everywhere by assumption and ∣f∣≤g almost everywhere by the first step.
(ii) By Fatou’s lemma, Theorem 1, and by the reverse Fatou’s lemma, Remark 3, applied to the sequence (∣fn−f∣) with 2g in place of g,
Definition 12. Let (X,M,μ) be a measure space. For every p∈[1,+∞) we define
Lp(X,M,μ):={f:X→R:f measurable,∫X∣f∣pdμ<+∞}.
Remark 13. Let (X,M,μ) be a measure space and let p∈[1,+∞). (i) If f,g:X→R are measurable and f=g almost everywhere, then ∫X∣f∣pdμ=∫X∣g∣pdμ.
(ii) For functions f,g:X→R, the relation given by f∼g if and only if f=g almost everywhere is an equivalence relation. Hence we can consider the equivalence class of a function f,
[f]={g:g∼f}.
Definition 14 (Lp spaces). Let (X,M,μ) be a measure space and let p∈[1,+∞). We define
Lp(X,M,μ):={[f]:f∈Lp(X,M,μ)},
also written Lp(X) or Lp.
Notation. The elements of Lp are indicated simply by f, thinking of f as a representative of [f].
Remark 15. Let (X,M,μ) be a measure space, let p∈[1,+∞) and let f,g∈Lp. (1) It makes sense to write ∫X∣f∣pdμ, because it does not depend on the choice of the representative. It makes sense to write f+g and f⋅g, since f+g is a representative of the class [f+g] for any choice of representatives f and g of [f] and [g], and the same holds for f⋅g. It makes sense to write f≥g almost everywhere. (2) It does not make sense to write f(x0) for a fixed x0∈X, if μ({x0})=0. It does not make sense to write f≥g for every x∈X.
Remark 16. Let (fn)⊂Lp and f∈Lp. Then it makes sense to write fn→f almost everywhere. We also write
C([0,1])⊂Lp([0,1],L([0,1]),λ),
where C([0,1]) is the set of the continuous functions on [0,1].
Definition 17 (Lp-norm). Let (X,M,μ) be a measure space and let p∈[1,+∞). For f∈Lp(X) we define the Lp-norm of f as
∥f∥p:=(∫X∣f∣pdμ)1/p.
Notation. The norm ∥f∥p is also written ∥f∥Lp or ∥f∥Lp(X).
Remark 18. Let (X,M,μ) be a measure space and let p∈[1,+∞). (i) The set Lp(X,M,μ) is a vector space.
(ii) If f,g∈Lp(X,M,μ), then
∥f−g∥p=0⟺f=g in Lp⟺f=g almost everywhere.
Proof (sketch). In (i) only sums are checked. For f,g∈Lp(X),
In (ii), the equivalence of ∥f−g∥p=0 and f=g almost everywhere is the vanishing lemma for nonnegative functions, (1) of Corollary 10 of the previous post, applied to ∣f−g∣p.■
Definition 19 (Essentially bounded functions and L∞). Let (X,M,μ) be a measure space. (i) A measurable function f:X→R is said to be essentially bounded if there exists M≥0 such that μ({∣f∣>M})=0, as in Figure 6.
and esssupXf is called the essential supremum of f.
(iii) We define
L∞(X,M,μ)L∞(X,M,μ):={f:X→R:f measurable and essentially bounded},:={[f]:f∈L∞(X,M,μ)}.
(iv) For f∈L∞(X) we define the L∞-norm∥f∥∞:=esssupX∣f∣, also written ∥f∥L∞ or ∥f∥L∞(X).
Figure 6. The drawing of Definition 19 (i): a function f, the dashed level M and the set {∣f∣>M}, hatched on the axis. The slider sets M.
Remark 20. If f∈L∞(X), then ∣f∣≤∥f∥∞ almost everywhere.
Lemma 21. Let (X,M,μ) be a measure space with μ(X)<+∞, and let f:X→R be measurable. Then f∈L∞(X) if and only if the limit limp→+∞∥f∥p exists and is finite. Moreover, in this case,