Monotone convergence theorem

From HandWiki
Short description: Theorems on the convergence of bounded monotonic sequences

In the mathematical field of real analysis, the monotone convergence theorem is any of a number of related theorems proving the convergence of monotonic sequences (sequences that are decreasing or increasing) that are also bounded. Informally, the theorems state that if a sequence is increasing and bounded above by a supremum, then the sequence will converge to the supremum; in the same way, if a sequence is decreasing and is bounded below by an infimum, it will converge to the infimum.

Convergence of a monotone sequence of real numbers

Lemma 1

If a sequence of real numbers is increasing and bounded above, then its supremum is the limit.

Proof

Let (an)n be such a sequence, and let {an} be the set of terms of (an)n. By assumption, {an} is non-empty and bounded above. By the least-upper-bound property of real numbers, c=supn{an} exists and is finite. Now, for every ε>0, there exists N such that aN>cε, since otherwise cε is an upper bound of {an}, which contradicts the definition of c. Then since (an)n is increasing, and c is its upper bound, for every n>N, we have |can||caN|<ε. Hence, by definition, the limit of (an)n is supn{an}.

Lemma 2

If a sequence of real numbers is decreasing and bounded below, then its infimum is the limit.

Proof

The proof is similar to the proof for the case when the sequence is increasing and bounded above.

Theorem

If (an)n is a monotone sequence of real numbers (i.e., if an ≤ an+1 for every n ≥ 1 or an ≥ an+1 for every n ≥ 1), then this sequence has a finite limit if and only if the sequence is bounded.[1]

Proof

  • "If"-direction: The proof follows directly from the lemmas.
  • "Only If"-direction: By (ε, δ)-definition of limit, every sequence (an)n with a finite limit L is necessarily bounded.

Convergence of a monotone series

Theorem

If for all natural numbers j and k, aj,k is a non-negative real number and aj,k ≤ aj+1,k, then[2]:168

limjkaj,k=klimjaj,k.

The theorem states that if you have an infinite matrix of non-negative real numbers such that

  1. the columns are weakly increasing and bounded, and
  2. for each row, the series whose terms are given by this row has a convergent sum,

then the limit of the sums of the rows is equal to the sum of the series whose term k is given by the limit of column k (which is also its supremum). The series has a convergent sum if and only if the (weakly increasing) sequence of row sums is bounded and therefore convergent.

As an example, consider the infinite series of rows

(1+1n)n=k=0n(nk)1nk=k=0n1k!×nn×n1n××nk+1n,

where n approaches infinity (the limit of this series is e). Here the matrix entry in row n and column k is

(nk)1nk=1k!×nn×n1n××nk+1n;

the columns (fixed k) are indeed weakly increasing with n and bounded (by 1/k!), while the rows only have finitely many nonzero terms, so condition 2 is satisfied; the theorem now says that you can compute the limit of the row sums (1+1/n)n by taking the sum of the column limits, namely 1k!.

Beppo Levi's lemma

The following result is due to Beppo Levi, who proved a slight generalization in 1906 of an earlier result by Henri Lebesgue.[3] In what follows, 0 denotes the σ-algebra of Borel sets on [0,+]. By definition, 0 contains the set {+} and all Borel subsets of 0.

Theorem

Let (Ω,Σ,μ) be a measure space, and XΣ. Consider a pointwise non-decreasing sequence {fk}k=1 of (Σ,0)-measurable non-negative functions fk:X[0,+], i.e., for every k1 and every xX,

0fk(x)fk+1(x).

Set the pointwise limit of the sequence {fn} to be f. That is, for every xX,

f(x):=limkfk(x).

Then f is (Σ,0)-measurable and

limkXfkdμ=Xfdμ.

Remark 1. The integrals may be finite or infinite.

Remark 2. The theorem remains true if its assumptions hold μ-almost everywhere. In other words, it is enough that there is a null set N such that the sequence {fn(x)} non-decreases for every xXN. To see why this is true, we start with an observation that allowing the sequence {fn} to pointwise non-decrease almost everywhere causes its pointwise limit f to be undefined on some null set N. On that null set, f may then be defined arbitrarily, e.g. as zero, or in any other way that preserves measurability. To see why this will not affect the outcome of the theorem, note that since μ(N)=0, we have, for every k,

Xfkdμ=XNfkdμ and Xfdμ=XNfdμ,

provided that f is (Σ,0)-measurable.[4](section 21.38) (These equalities follow directly from the definition of the Lebesgue integral for a non-negative function).

Remark 3. Under the assumptions of the theorem,

  1. f(x)=lim infkfk(x)=lim supkfk(x)=supkfk(x)
  2. lim infkXfkdμ=lim supkXfkdμ=limkXfkdμ=supkXfkdμ

(Note that the second chain of equalities follows from Remark 5).

Remark 4. The proof below does not use any properties of the Lebesgue integral except those established here. The theorem, thus, can be used to prove other basic properties, such as linearity, pertaining to Lebesgue integration.

Remark 5 (monotonicity of the Lebesgue integral). In the proof below, we apply the monotonic property of the Lebesgue integral to non-negative functions only. Specifically (see Remark 4), let the functions f,g:X[0,+] be (Σ,0)-measurable.

  • If fg everywhere on X, then
XfdμXgdμ.
  • If X1,X2Σ and X1X2, then
X1fdμX2fdμ.

Proof. Denote by SF(h) the set of simple (Σ,0)-measurable functions s:X[0,) such that 0sh everywhere on X.

1. Since fg, we have

SF(f)SF(g).

By definition of the Lebesgue integral and the properties of supremum,

Xfdμ=supsSF(f)XsdμsupsSF(g)Xsdμ=Xgdμ.

2. Let 𝟏X1 be the indicator function of the set X1. It can be deduced from the definition of the Lebesgue integral that

X2f𝟏X1dμ=X1fdμ

if we notice that, for every sSF(f𝟏X1), s=0 outside of X1. Combined with the previous property, the inequality f𝟏X1f implies

X1fdμ=X2f𝟏X1dμX2fdμ.

Proof

This proof does not rely on Fatou's lemma; however, we do explain how that lemma might be used. Those not interested in this independency of the proof may skip the intermediate results below.

Intermediate results

Lebesgue integral as measure

Lemma 1. Let (Ω,Σ,μ) be a measurable space. Consider a simple (Σ,0)-measurable non-negative function s:Ω0. For a subset SΩ, define

ν(S)=Ssdμ.

Then ν is a measure on Ω.

Proof

Monotonicity follows from Remark 5. Here, we will only prove countable additivity, leaving the rest up to the reader. Let S=i=1Si, where all the sets Si are pairwise disjoint. Due to simplicity,

s=i=1nci𝟏Ai,

for some finite non-negative constants ci0 and pairwise disjoint sets AiΣ such that i=1nAi=Ω. By definition of the Lebesgue integral,

ν(S)=i=1nciμ(SAi)=i=1nciμ((j=1Sj)Ai)=i=1nciμ(j=1(SjAi))

Since all the sets SjAi are pairwise disjoint, the countable additivity of μ gives us

i=1nciμ(j=1(SjAi))=i=1ncij=1μ(SjAi).

Since all the summands are non-negative, the sum of the series, whether this sum is finite or infinite, cannot change if summation order does. For that reason,

i=1ncij=1μ(SjAi)=j=1i=1nciμ(SjAi)=j=1Sjsdμ=j=1ν(Sj),

as required.

"Continuity from below"

The following property is a direct consequence of the definition of measure.

Lemma 2. Let μ be a measure, and S=i=1Si, where

S1SiSi+1S

is a non-decreasing chain with all its sets μ-measurable. Then

μ(S)=limiμ(Si).

Proof of theorem

Step 1. We begin by showing that f is (Σ,0)–measurable.[4](section 21.3)

Note. If we were using Fatou's lemma, the measurability would follow easily from Remark 3(a).

To do this without using Fatou's lemma, it is sufficient to show that the inverse image of an interval [0,t] under f is an element of the sigma-algebra Σ on X, because (closed) intervals generate the Borel sigma algebra on the reals. Since [0,t] is a closed interval, and, for every k, 0fk(x)f(x),

0f(x)t[k0fk(x)t].

Thus,

{xX0f(x)t}=k{xX0fk(x)t}.

Being the inverse image of a Borel set under a (Σ,0)-measurable function fk, each set in the countable intersection is an element of Σ. Since σ-algebras are, by definition, closed under countable intersections, this shows that f is (Σ,0)-measurable, and the integral Xfdμ is well-defined (and possibly infinite).

Step 2. We will first show that XfdμlimkXfkdμ.

The definition of f and monotonicity of {fk} imply that f(x)fk(x), for every k and every xX. By monotonicity (or, more precisely, its narrower version established in Remark 5; see also Remark 4) of the Lebesgue integral,

XfdμXfkdμ,

and

XfdμlimkXfkdμ.

Note that the limit on the right exists (finite or infinite) because, due to monotonicity (see Remark 5 and Remark 4), the sequence is non-decreasing.

End of Step 2.

We now prove the reverse inequality. We seek to show that

XfdμlimkXfkdμ.

Proof using Fatou's lemma. Per Remark 3, the inequality we want to prove is equivalent to

Xlim infkfk(x)dμlim infkXfkdμ.

But the latter follows immediately from Fatou's lemma, and the proof is complete.

Independent proof. To prove the inequality without using Fatou's lemma, we need some extra machinery. Denote by SF(f) the set of simple (Σ,0)-measurable functions s:X[0,) such that 0sf on X.

Step 3. Given a simple function sSF(f) and a real number t(0,1), define

Bks,t={xXts(x)fk(x)}X.

Then Bks,tΣ, Bks,tBk+1s,t, and X=kBks,t.

Step 3a. To prove the first claim, let s=i=1mci𝟏Ai, for some finite collection of pairwise disjoint measurable sets AiΣ such that X=i=1mAi, some (finite) non-negative constants ci0, and 𝟏Ai denoting the indicator function of the set Ai.

For every xAi, ts(x)fk(x) holds if and only if fk(x)[tci,+]. Given that the sets Ai are pairwise disjoint,

Bks,t=i=1m(fk1([tci,+])Ai).

Since the pre-image fk1([tci,+]) of the Borel set [tci,+] under the measurable function fk is measurable, and σ-algebras, by definition, are closed under finite intersection and unions, the first claim follows.

Step 3b. To prove the second claim, note that, for each k and every xX, fk(x)fk+1(x).

Step 3c. To prove the third claim, we show that XkBks,t.

Indeed, if, to the contrary, X⊈kBks,t, then an element

x0XkBks,t=k(XBks,t)

exists such that fk(x0)<ts(x0), for every k. Taking the limit as k, we get

f(x0)ts(x0)<s(x0).

But by initial assumption, sf. This is a contradiction.

Step 4. For every simple (Σ,0)-measurable non-negative function s2,

limnBns,ts2dμ=Xs2dμ.

To prove this, define ν(S)=Ss2dμ. By Lemma 1, ν(S) is a measure on Ω. By "continuity from below" (Lemma 2),

limnBns,ts2dμ=limnν(Bns,t)=ν(X)=Xs2dμ,

as required.

Step 5. We now prove that, for every sSF(f),

XsdμlimkXfkdμ.

Indeed, using the definition of Bks,t, the non-negativity of fk, and the monotonicity of the Lebesgue integral (see Remark 5 and Remark 4), we have

Bks,ttsdμBks,tfkdμXfkdμ,

for every k1. In accordance with Step 4, as k, the inequality becomes

tXsdμlimkXfkdμ.

Taking the limit as t1 yields

XsdμlimkXfkdμ,

as required.

Step 6. We are now able to prove the reverse inequality, i.e.

XfdμlimkXfkdμ.

Indeed, by non-negativity, f+=f and f=0. For the calculation below, the non-negativity of f is essential. Applying the definition of the Lebesgue integral and the inequality established in Step 5, we have

Xfdμ=supsSF(f)XsdμlimkXfkdμ.

The proof is complete.

Relaxing the monotonicity assumption

Under similar hypotheses to Beppo Levi's theorem, it is possible to relax the hypothesis of monotonicity.[5] As before, let (Ω,Σ,μ) be a measure space and XΣ. Again, {fk}k=1 will be a sequence of (Σ,0)-measurable non-negative functions fk:X[0,+]. However, we do not assume they are pointwise non-decreasing. Instead, we assume that {fk(x)}k=1 converges for almost every x, we define f to be the pointwise limit of {fk}k=1, and we assume additionally that fkf pointwise almost everywhere for all k. Then f is (Σ,0)-measurable, and limkXfkdμ exists, and limkXfkdμ=Xfdμ.

As before, measurability follows from the fact that f=supkfk almost everywhere. The interchange of limits and integrals is then an easy consequence of Fatou's lemma. One has Xfdμ=Xlim infkfkdμlim infXfkdμ by Fatou's lemma, and then, by standard properties of limits and monotonicity, lim infXfkdμlim supXfkdμXfdμ. Therefore lim infXfkdμ=lim supXfkdμ, and both are equal to Xfdμ. It follows that limkXfkdμ exists and equals Xfdμ.

See also

Notes

  1. A generalisation of this theorem was given by Bibby, John (1974). "Axiomatisations of the average and a further generalisation of monotonic sequences". Glasgow Mathematical Journal 15 (1): 63–65. doi:10.1017/S0017089500002135. 
  2. See for instance Yeh, J. (2006). Real Analysis: Theory of Measure and Integration. Hackensack, NJ: World Scientific. ISBN 981-256-653-8. 
  3. Schappacher, Norbert; Schoof, René (1996), "Beppo Levi and the arithmetic of elliptic curves", The Mathematical Intelligencer 18 (1): 60, doi:10.1007/bf03024818, http://irma.math.unistra.fr/~schappa/NSch/Publications_files/1996_RSchNSch.pdf 
  4. 4.0 4.1 See for instance Schechter, Erik (1997). Handbook of Analysis and Its Foundations. San Diego: Academic Press. ISBN 0-12-622760-8. 
  5. coudy (https://mathoverflow.net/users/6129/coudy), Do you know important theorems that remain unknown?, URL (version: 2018-06-05): https://mathoverflow.net/q/296540

it:Passaggio al limite sotto segno di integrale#Integrale di Lebesgue