L0, convergence in measure, equi-integrability, the Vitali convergence theorem, and the de la Vallée-Poussin criterion

Jordan Bell
June 10, 2015

1 Measurable spaces

Let ℝ¯=ℝ∪{-∞,∞}, with the order topology. We assign ℝ the Borel σ-algebra. It is a fact that for E⊂ℝ¯, E∈ℬℝ¯ if and only if E∖{-∞,∞}∈ℬℝ.

Theorem 1.

Let (Ω,Σ) be a measurable space. If fj is a sequence of measurable functions Ω→ℝ¯, then for each k,

gk⁢(x)=supj≥k⁡fj⁢(x),hk⁢(x)=infj≥k⁡fj⁢(x),

are measurable Ω→ℝ¯, and

g⁢(x)=lim supj→∞⁡fj⁢(x),h⁢(x)=lim infj→∞⁡fj⁢(x),

are measurable Ω→ℝ¯.

Proof.

Let a∈ℝ. For each j, fj-1⁢(a,∞]∈Σ, so

⋃j=k∞fj-1⁢(a,∞]∈Σ.

For each j≥k,

fj-1⁢(a,∞]⊂{x∈Ω:supi≥k⁡fi⁢(x)>a},

so

⋃j=k∞fj-1⁢(a,∞]⊂{x∈Ω:supi≥k⁡fi⁢(x)>a}.

If y∉⋃j=k∞fj-1⁢(a,∞], then for each j≥k, fj⁢(y)≤a, hence gk⁢(y)≤a, which means that y∉{x∈Ω:gk⁢(x)>a}. Therefore,

⋃j=k∞fj-1⁢(a,∞]={x∈Ω:gk⁢(x)>a},

and thus gk-1⁢(a,∞]∈Σ. Because this is true for all a∈ℝ and ℬℝ¯ is generated by the collection {(a,∞]:a∈ℝ}, it follows that gk:Ω→ℝ¯ is measurable.

That hk is measurable follows from the fact that if f:Ω→ℝ¯ is measurable then -f:Ω→ℝ¯ is measurable, and that hk⁢(x)=infj≥k⁡fj⁢(x)=-supj≥k⁡(-fj⁢(x)).

For x∈Ω,

g⁢(x)=infk≥1⁡gk⁢(x),

and because each gk is measurable it follows that g is measurable. Likewise,

h⁢(x)=supk≥1⁡hk⁢(x),

and because each hk is measurable it follows that h is measurable. ∎

2 Convergence in measure

Let (Ω,Σ,μ) be a probability space. Let L0⁢(μ) be the collection of equivalence classes of measurable functions Ω→ℂ, where ℂ has the Borel σ-algebra, and where two functions f and g are equivalent when

μ⁢{x∈Ω:f⁢(x)≠g⁢(x)}=0.

L0⁢(μ) is a vector space. For f,g∈L0⁢(μ) we define

ρ⁢(f,g)=∫Ω|f-g|1+|f-g|⁢𝑑μ.

This is a metric on L0⁢(μ), and one proves that with this metric L0⁢(μ) is a topological vector space. We call the topology induced by ρ the topology of convergence in measure.11 1 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 480, Lemma 13.40.

Theorem 2.

Suppose that fn is a sequence in L0⁢(μ). fn→0 in the topology of convergence in measure if and only if for each ϵ>0,

limn→∞⁡μ⁢({x∈Ω:|fn⁢(x)|≥ϵ})=0.
Proof.

Suppose that fn→0 in the topology of convergence in measure and let ϵ>0. For each n, let

An={x∈Ω:|fn⁢(x)|≥ϵ}={x∈Ω:|fn⁢(x)|1+|fn⁢(x)|≥ϵ1+ϵ}.

Because ϵ1+ϵ⁢χAn≤|fn|1+|fn|,

∫Ωϵ1+ϵ⁢χAn⁢𝑑μ≤∫Ω|fn|1+|fn|⁢𝑑μ=ρ⁢(fn,0),

i.e. μ⁢(An)≤1+ϵϵ⁢ρ⁢(fn,0), which tends to 0 as n→∞.

Let ϵ>0 and for each n, let

An={x∈Ω:|fn⁢(x)|≥ϵ}={x∈Ω:|fn⁢(x)|1+|fn⁢(x)|≥ϵ1+ϵ}.

Suppose that μ⁢(An)→0 as n→∞. There is some nϵ such that n≥nϵ implies that μ⁢(An)<ϵ. For n≥nϵ,

ρ⁢(fn,0) =∫An|fn|1+|fn|⁢𝑑μ+∫Ω∖An|fn|1+|fn|⁢𝑑μ
≤∫An1⁢𝑑μ+∫Ω∖Anϵ1+ϵ⁢𝑑μ
=1+ϵ1+ϵ⁢μ⁢(An)+ϵ1+ϵ⁢μ⁢(Ω∖An)
=11+ϵ⁢μ⁢(An)+ϵ1+ϵ⁢(μ⁢(An)+μ⁢(Ω∖An))
=11+ϵ⁢μ⁢(An)+ϵ1+ϵ
<11+ϵ⋅ϵ+ϵ1+ϵ
<2⁢ϵ.

This shows that fn→0 in the topology of convergence in measure. ∎

We now prove that if a sequence in L0⁢(μ) converges almost everywhere to 0 then it converges in measure to 0.22 2 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 479, Theorem 13.37.

Theorem 3.

Suppose that fn is a sequence in L0⁢(μ) and that for almost all x∈Ω, fn⁢(x)→0 as n→∞. Then fn→0 in the topology of convergence in measure.

Proof.

Let ϵ>0 and let η>0. Egorov’s theorem tells us that there is some E∈Σ with μ⁢(E)<η such that fn→0 uniformly on Ω∖E. So there is some n0 such that if n≥n0 and x∈Ω∖E then |fn⁢(x)|<ϵ. Thus for n≥n0,

μ⁢({x∈Ω:|fn⁢(x)|≥ϵ}) ≤μ⁢(E)+μ⁢({x∈Ω∖E:|fn⁢(x)|≥ϵ})
=μ⁢(E)
<η.

Then μ⁢({x∈Ω:|fn⁢(x)|≥ϵ})→0 as n→∞, namely, fn→0 in measure. ∎

Theorem 4.

If fn is a sequence in L1⁢(μ) that converges in L1⁢(μ) to 0, then fn converges in measure to 0.

Proof.

Let ϵ>0 and let An={x∈Ω:|fn⁢(x)|≥ϵ}. By Chebyshev’s inequality,

μ⁢(An)≤1ϵ⁢∥fn∥1,

hence μ⁢(An)→0 as n→∞, namely, fn converges to 0 in measure. ∎

The following theorem shows that a sequence in L0⁢(μ) that converges in measure to 0 then it has a subsequence that almost everywhere converges to 0.33 3 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 479, Theorem 13.38.

Theorem 5.

Suppose that fn is a sequence in L0⁢(μ) that converges in measure to 0. Then there is a subsequence fa⁢(n) of fn such that for almost all x∈Ω, fa⁢(n)⁢(x)→0.

Proof.

For each n, with ϵ=1n, there is some a⁢(n) such that m≥a⁢(n) implies that

μ⁢({x∈Ω:|fm⁢(x)|≥1n})<12n.

For each n, let

En={x∈Ω:|fa⁢(n)⁢(x)|≥1n},

for which μ⁢(En)<12n. Let

E=⋂n=1∞⋃m=nEm,

and for each n,

μ⁢(E)≤μ⁢(⋃m=n∞Em)≤∑m=n∞μ⁢(Em)<∑m=n∞12m=12n⋅2=21-n.

Because this is true for all n, μ⁢(E)=0. If x∈Ω∖E, then there is some nx such that x∉⋃m=nx∞Em. This means that for m≥nx we have x∉Em, i.e. |fa⁢(m)⁢(x)|<1m. This implies that for x∉E, fa⁢(n)⁢(x)→0 as n→∞, showing that for almost all x∈Ω, fa⁢(n)⁢(x)→0 as n→∞. ∎

We now prove that ρ is a complete metric, namely that L0⁢(μ) with this metric is an F-space.44 4 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 481, Theorem 13.41; Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, second ed., p. 61, Theorem 2.30.

Theorem 6.

ρ is a complete metric on L0⁢(μ).

Proof.

Suppose that fn is a Cauchy sequence in L0⁢(μ). To prove that fn is convergent it suffices to prove that fn has a convergent subsequence. If (X,d) is a metric space and xn is a Cauchy sequence in X, for any N let aN be such that n,m≥aN implies that d⁢(xn,xm)<1N and a fortiori d⁢(xn,xm)<1aN. Thus we presume that fn itself satisfies ρ⁢(fn,fm)<1n for m≥n.

Let

Ak,m⁢(ϵ)={x∈Ω:|fk⁢(x)-fm⁢(x)|≥ϵ}={x∈Ω:|fk⁢(x)-fm⁢(x)|1+|fk⁢(x)-fm⁢(x)|≥ϵ1+ϵ},

for which

ϵ1+ϵ⁢χAk,m⁢(ϵ)≤|fk⁢(x)-fm⁢(x)|1+|fk⁢(x)-fm⁢(x)|.

If m≥k,

μ⁢(Ak,m⁢(ϵ))≤1+ϵϵ⁢∫Ω|fk-fm|1+|fk-fm|⁢𝑑μ=1+ϵϵ⁢ρ⁢(fk,fm)<1+ϵϵ⁢1k. (1)

For n=1 and ϵ1=121, let k1 be such that 1+ϵ1ϵ1⁢1k1≤121, i.e. k1≥21⋅1+ϵ1ϵ1. For n≥1 and ϵn=12n, assume that kn satisfies 1+ϵnϵn⁢1kn≤12n and kn>kn-1. For ϵn+1=12n+1, let kn+1 be such that 1+ϵn+1ϵn+1⁢1kn+1≤12n+1 and kn+1>kn. For any n we have, because kn≥n, 1+ϵnϵn⁢1kn≤12kn. Then using (1) with m≥kn,

μ⁢(Akn,m⁢(12n))<1+ϵnϵn⁢1kn≤12kn. (2)

Let gn=fkn and let

En={x∈Ω:|gn+1⁢(x)-gn⁢(x)|≥12n},

for which, by (2), μ⁢(En)<12n. Let

Fn=⋃r=n∞En,

which satisfies

μ⁢(Fn)≤∑r=n∞μ⁢(En)<∑r=n∞2-r=2-n+1.

Hence F=⋂n=1∞Fn satisfies μ⁢(F)=0.

If x∉F, then there is some n for which x∉Fn, i.e. for each r≥n we have x∉Er, i.e. for each r≥n we have |gr+1⁢(x)-gr⁢(x)|<2-r. This implies that for k≥n and for any positive integer p,

|gk+p⁢(x)-gk⁢(x)| ≤|gk+p⁢(x)-gk+p-1⁢(x)|+⋯+|gk+1⁢(x)-gk⁢(x)|
<2-k-p+1+⋯+2-k
<2-k+1,

so if j≥k then

|gj⁢(x)-gk⁢(x)|<2-k+1. (3)

This shows that if x∉F then gk⁢(x) is a Cauchy sequence in ℂ, and hence converges. We define g:Ω→ℂ by

g⁢(x)=χΩ∖F⁢(x)⁢lim supk→∞⁡gk⁢(x),x∈Ω,

and by Theorem 1, g∈L0⁢(μ). For x∉Fk we have x∉F and so gl⁢(x)→g⁢(x) as l→∞. Then for x∉Fk and j≥k, using (3) we have

|gj⁢(x)-g⁢(x)|≤|gj⁢(x)-gl⁢(x)|+|gl⁢(x)-g⁢(x)|<2-k+1+|gl⁢(x)-g⁢(x)|→2-k+1

as l→∞, so |gj⁢(x)-g⁢(x)|<2-k+1. For ϵ>0, let k be such that 2-k+1≤ϵ. Then

μ⁢({x∈Ω:|gk⁢(x)-g⁢(x)|≥ϵ})≤μ⁢(Fk)+μ⁢({x∈Ω∖Fk:|gk⁢(x)-g⁢(x)|≥ϵ})<2-k+1+μ⁢({x∈Ω∖Fk:|gk⁢(x)-g⁢(x)|≥2-k+1})=2-k+1,

which tends to 0 as k→∞, showing that gk converges to g in measure, and because gk is a subsequence of fk this completes the proof. ∎

3 Equi-integrability

Let (Ω,Σ,μ) be a probability space. A subset ℱ of L1⁢(μ) is said to be equi-integrable if for every ϵ>0 there is some δ>0 such that for all E∈Σ with μ⁢(E)≤δ and for all f∈ℱ,

∫E|f|⁢𝑑μ≤ϵ.

In other words, to say that ℱ is equi-integrable means that

limμ⁢(E)→0⁡supf∈ℱ⁡∫E|f|⁢𝑑μ=0.

The following theorem gives an equivalent condition for a bounded subset of L1⁢(μ) to be equi-integrable.55 5 Fernando Albiac and Nigel J. Kalton, Topics in Banach Space Theory, p. 105, Lemma 5.2.6.

Theorem 7.

Suppose that ℱ is a bounded subset of L1⁢(μ). Then the following are equivalent:

  1. 1.

    ℱ is equi-integrable.

  2. 2.

    limC→∞⁡supf∈ℱ⁡∫{|f|>C}|f|⁢𝑑μ=0.

Proof.

Let K=supf∈ℱ⁡∥f∥1<∞ and suppose that ℱ is equi-integrable. For f∈ℱ, Chebyshev’s inequality tells us

μ({|f|>M})≤∥f∥1M≤KM.

Because μ({|f|>M})→0 as M→∞ and ℱ is equi-integrable,

limM→∞⁡supf∈ℱ⁡∫{|f|>M}|f|⁢𝑑μ=0.

Suppose now that

limM→∞⁡supf∈ℱ⁡∫{|f|>M}|f|⁢𝑑μ=0. (4)

For E∈Σ and f∈ℱ, if M>0 then

∫E|f|⁢𝑑μ =∫E∩{|f|≤M}|f|⁢𝑑μ+∫E∩{|f|>M}|f|⁢𝑑μ
≤M⁢μ⁢(E)+∫{|f|>M}|f|⁢𝑑μ
≤M⁢μ⁢(E)+supg∈ℱ⁡∫{|g|>M}|g|⁢𝑑μ,

hence

supf∈ℱ⁡∫E|f|⁢𝑑μ≤M⁢μ⁢(E)+supg∈ℱ⁡∫{|g|>M}|g|⁢𝑑μ. (5)

Let ϵ>0. By (4) there is some M such that supg∈ℱ⁡∫{|g|>M}|g|⁢𝑑μ≤ϵ2. For δ=ϵ2⁢M, if E∈Σ and μ⁢(E)≤δ then (5) yields

supf∈ℱ⁡∫E|f|⁢𝑑μ≤M⁢δ+ϵ2=ϵ,

showing that ℱ is equi-integrable. ∎

Theorem 8 (Absolute continuity of Lebesgue integral).

Suppose that f∈L1⁢(μ). If ϵ>0 then there is some δ>0 such that for any E∈Σ with μ⁢(E)≤δ,

∫E|f|⁢𝑑μ≤ϵ.
Proof.

For n≥1, define

gn⁢(x)=min⁡{|f⁢(x)|,n},x∈Ω.

Then gn is a sequence in L1⁢(μ) such that for each x∈Ω, gn⁢(x) is nondecreasing and gn⁢(x)→|f⁢(x)|, and thus the monotone convergence theorem tells us that

limn→∞⁡∫Ωgn⁢𝑑μ=∫Ω|f|⁢𝑑μ.

Then there is some N for which

0≤∫Ω|f|⁢𝑑μ-∫ΩgN⁢𝑑μ≤ϵ2.

For δ=ϵ2⁢N and E∈Σ with μ⁢(E)≤δ,

∫E|f|⁢𝑑μ =∫E(|f|-gN)⁢𝑑μ+∫EgN⁢𝑑μ
≤ϵ2+∫EgN⁢𝑑μ
≤ϵ2+N⁢μ⁢(E)
≤ϵ2+N⁢δ
=ϵ.

∎

The following is the Vitali convergence theorem.66 6 V. I. Bogachev, Measure Theory, volume I, p. 268, Theorem 4.5.4.

Theorem 9 (Vitali convergence theorem).

Suppose that f∈L0⁢(μ) and fn is a sequence in L1⁢(μ). Then the following are equivalent:

  1. 1.

    {fn} is equi-integrable, {fn} is bounded in L1⁢(μ), and fn→f in measure.

  2. 2.

    f∈L1⁢(μ) and fn→f in L1⁢(μ).

Proof.

Suppose that {fn} is equi-integrable and fn→f in measure. Because fn→f in measure, there is a subsequence fa⁢(n) of fn that converges almost everywhere to f and so |fa⁢(n)| converges almost everywhere to |f|. Let K=supn≥1⁡∥fa⁢(n)∥1<∞. Fatou’s lemma tells us that |f|∈L1⁢(μ) and

∥f∥1≤lim infn→∞⁡∥fa⁢(n)∥1≤K.

Because f∈L0⁢(μ) and |f|∈L1⁢(μ), f∈L1⁢(μ). To show that fn converges to f in L1⁢(μ), it suffices to show that any subsequence of fn itself has a subsequence that converges to f in L1⁢(μ). (Generally, a sequence in a topological space converges to x if and only if any subsequence itself has a subsequence that converges to x.) Thus, let gn be a subsequence of fn. Because fn converges to f in measure, the subsequence gn converges to f in measure and so there is a subsequence ga⁢(n) of gn that converges almost everywhere to f. Let ϵ>0. Because {fn} is equi-integrable, there is some δ>0 such that for all E∈Σ with μ⁢(E)≤δ and for all n,

∫E|ga⁢(n)|⁢𝑑μ≤ϵ.

If E∈Σ with μ⁢(E)≤δ, then χE⁢ga⁢(n) converges almost everywhere to χE⁢f, and supn≥1⁡∥χE⁢ga⁢(n)∥1≤ϵ, so by Fatou’s lemma we obtain

∫E|f|⁢𝑑μ=∥χE⁢f∥1≤lim infn→∞⁡∥χE⁢ga⁢(n)∥1≤ϵ.

But because ga⁢(n) converges almost everywhere to f, by Egorov’s theorem there is some E∈Σ with μ⁢(E)≤δ such that ga⁢(n)→f uniformly on Ω∖E, and so there is some n0 such that if n≥n0 and x∈Ω∖E then |ga⁢(n)⁢(x)-f⁢(x)|≤ϵ. Thus for n≥n0,

∫Ω|ga⁢(n)-f|⁢𝑑μ =∫Ω∖E|ga⁢(n)-f|⁢𝑑μ+∫E|ga⁢(n)-f|⁢𝑑μ
≤μ⁢(Ω∖E)⁢ϵ+∫E|ga⁢(n)|⁢𝑑μ+∫E|f|⁢𝑑μ
≤ϵ+ϵ+ϵ,

which shows that ga⁢(n)→f in L1⁢(μ). That is, we have shown that for any subsequence gn of fn there is a subsequence ga⁢(n) of gn that converges to f in L1⁢(μ), which implies that the sequence fn converges to f in L1⁢(μ).

Suppose that f∈L1⁢(μ) and fn→f in L1⁢(μ). First, because the sequence fn is convergent in L1⁢(μ) the set {fn} is bounded in L1⁢(μ). Second, fn→f in L1⁢(μ) implies that fn→f in measure. Third, for ϵ>0, let n0 such that n≥n0 implies that ∥fn-f∥1≤ϵ. For each 1≤n<n0, by Theorem 8 there is some δfn>0 such that for E∈Σ and μ⁢(E)≤δfn,

∫E|fn|⁢𝑑μ≤ϵ,

and likewise there is some δf such that for E∈Σ and μ⁢(E)≤f,

∫E|f|⁢𝑑μ≤ϵ.

Let δ>0 be the minimum of δf1,…,δfn-1,δf. Thus if E∈Σ and μ⁢(E)≤δ, then for 1≤n<n,

∫E|fn|⁢𝑑μ≤ϵ,

and for for n≥n0,

∫E|fn|⁢𝑑μ≤∫E|fn-f|⁢𝑑μ+∫E|f|⁢𝑑μ≤∥fn-f∥1+∫E|f|⁢𝑑μ≤ϵ+ϵ.

This shows that {fn} is equi-integrable, completing the proof. ∎

The following is the de la Vallée-Poussin criterion for equi-integrability.77 7 V. I. Bogachev, Measure Theory, volume I, p. 272, Theorem 4.5.9.

Theorem 10 (de la Vallée-Poussin criterion).

Suppose that ℱ⊂L1⁢(μ). ℱ is bounded and equi-integrable if and only if there is a there nonnegative nondecreasing function G on [0,∞) such that

limt→∞⁡G⁢(t)t=∞ and supf∈ℱ⁡∫ΩG⁢(|f⁢(x)|)⁢𝑑μ⁢(x)<∞, (6)

and if there is a nonnegative nondecreasing function G satisfying (6) then there is a convex nonnegative nondecreasing function G satisfying (6).

Proof.

Suppose that G is a nonnegative nondecreasing function on [0,∞) satisfying (6). Let

supf∈ℱ⁡∫ΩG⁢(|f⁢(x)|)⁢𝑑μ⁢(x)≤M<∞.

For ϵ>0, there is some C such that t≥C implies that G⁢(t)t≥Mϵ, and hence, for f∈ℱ, if x∈Ω and |f⁢(x)|≥C then G⁢(|f⁢(x)|)|f⁢(x)|≥Mϵ, i.e. |f⁢(x)|≤ϵM⁢G⁢(|f⁢(x)|), which yields

∫{|f|≥C}|f|⁢𝑑μ≤∫{|f|≥C}ϵM⁢G⁢(|f⁢(x)|)⁢𝑑μ⁢(x)≤ϵM⋅M=ϵ.

Therefore by Theorem 7, ℱ is bounded and equi-integrable.

Suppose that ℱ is bounded and equi-integrable. For f∈ℱ and j≥1, let

μj⁢(f)=μ⁢({x∈Ω:|f⁢(x)|>j})∈Σ.

By induction, because ℱ is bounded and equi-integrable there is a strictly increasing sequence of positive integers Cn such that for each n,

supf∈ℱ⁡∫{|f|>Cn}|f|⁢𝑑μ≤2-n. (7)

For f∈ℱ and n≥1,

∫{|f|>Cn}|f|⁢𝑑μ =∑j=Cn∞∫{j<|f|≤j+1}|f|⁢𝑑μ
≥∑j=Cn∞j⁢μ⁢({x∈Ω:j<|f⁢(x)|≤j+1})
=∑j=Cn∞j⁢(μj⁢(f)-μj+1⁢(f))
=∑j=Cn∞μj⁢(f).

Using this and (7), for f∈ℱ,

∑n=1∞∑j=Cn∞μj⁢(f) ≤∑n=1∞∫{|f|>Cn}|f|⁢𝑑μ
≤∑n=1∞2-n
=1.

For n≥0 we define

αn={0n<C1max⁡{k:Ck≤n}n≥C1.

It is straightforward that αn→∞ as n→∞. We define a step function g on [0,∞) by

g⁢(t)=∑n=0∞αn⁢χ(n,n+1]⁢(t),0≤t<∞,

and we define a function G on [0,∞) by

G⁢(t)=∫0tg⁢(s)⁢𝑑s,0≤t<∞.

It is apparent that G is nonnegative and nondecreasing. For t1,t2∈[0,∞), t1≤t2, by the fundamental theorem of calculus,

G′⁢(t1)⁢(t2-t1)=g⁢(t1)⁢(t2-t1)≤G⁢(t2)-G⁢(t1),

showing that G is convex. The above inequality also yields that for t>0, G⁢(t)t≥g⁢(t/2)2, and g⁢(t/2)→∞ as t→∞ so we get that limt→∞⁡G⁢(t)t=∞. For f∈ℱ, using G⁢(0)=0, G⁢(1)=0, and for n≥1,

G⁢(n+1)≤g⁢(1)+g⁢(2)+⋯+g⁢(n+1)=α0+α1+⋯+αn=α1+⋯+αn,

we get

∫ΩG⁢(|f⁢(x)|)⁢𝑑μ⁢(x) =∫{|f|=0}G⁢(|f⁢(x)|)⁢𝑑μ⁢(x)+∑n=0∞∫{n<|f|≤n+1}G⁢(|f⁢(x)|)⁢𝑑μ⁢(x)
≤∑n=0∞∫{n<|f|≤n+1}G⁢(n+1)⁢𝑑μ⁢(x)
=∑n=1∞(μn⁢(f)-μn+1⁢(f))⁢G⁢(n+1)
≤∑n=1∞(μn⁢(f)-μn+1⁢(f))⁢∑j=1nαj
=∑n=1∞μn⁢(f)⁢αn
=∑n=1∞∑j=Cn∞μj⁢(f)
≤1,

showing that supf∈ℱ⁡∫ΩG⁢(|f⁢(x)|)⁢𝑑μ⁢(x)<∞, which completes the proof. ∎