Nonlinear system

From formulasearchengine
Revision as of 03:18, 26 January 2014 by en>Dicklyon (dash fixes)
Jump to navigation Jump to search

In the mathematical field of real analysis, the monotone convergence theorem refers to a number of related theorems proving the convergence of monotonic sequences (sequences that are increasing or decreasing) 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

Theorem

If {an} is a monotone sequence of real numbers (i.e., if an ≤ an+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

We prove that if an increasing sequence {an} is bounded above, then it is convergent and the limit is sup\limits n{an}.

Since {an} is non-empty and by assumption, it is bounded above, then, by the Least upper bound property of real numbers, c=supn{an} exists and is finite. Now for every ε>0, there exists aN such that aN>cε, since otherwise cε is an upper bound of {an}, which contradicts to c being supn{an}. Then since {an} is increasing, n>N,|can|=cancaN<ε, hence by definition, the limit of {an} is supn{an}.

Remark

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

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 (see for instance [2] page 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+1/n)n=k=0n(nk)/nk=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)/nk=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!.

Lebesgue's monotone convergence theorem

This theorem generalizes the previous one, and is probably the most important monotone convergence theorem. It is also known as Beppo Levi's theorem.

Theorem

Let (X, Σ, μ) be a measure space. Let f1,f2,  be a pointwise non-decreasing sequence of [0, ∞]-valued Σ–measurable functions, i.e. for every k ≥ 1 and every x in X,

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

Next, set the pointwise limit of the sequence (fn) to be f. That is, for every x in X,

f(x):=limkfk(x).

Then f is Σ–measurable and

limkfkdμ=fdμ.

Remark. If the sequence (fk) satisfies the assumptions μ–almost everywhere, one can find a set N ∈ Σ with μ(N) = 0 such that the sequence (fk(x)) is non-decreasing for every xN. The result remains true because for every k,

fkdμ=XNfkdμ,andfdμ=XNfdμ,

provided that f is Σ–measurable (see for instance [3] section 21.38).

Proof

We will first show that f is Σ–measurable (see for instance [3] section 21.3). To do this, 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. Let I = [0, t] be such a subinterval of [0, ∞]. Let

f1(I)={xX|f(x)I}.

Since I is a closed interval and k,fk(x)f(x),

f(x)Ifk(x)I,k.

Thus,

{xX|f(x)I}=k{xX|fk(x)I}.

Note that each set in the countable intersection is an element of Σ because it is the inverse image of a Borel subset under a Σ-measurable function fk. Since sigma algebras are, by definition, closed under countable intersections, this shows that f is Σ-measurable. In general, the supremum of any countable family of measurable functions is also measurable.

Now we will prove the rest of the monotone convergence theorem. The fact that f is Σ-measurable implies that the expression fdμ is well defined.

We will start by showing that fdμlimkfkdμ.

By the definition of the Lebesgue integral,

fdμ=sup{gdμ|gSF,gf},

where SF is the set of Σ-measurable simple functions on X. Since fk(x)f(x) at every x ∈ X, we have that

{gdμ|gSF,gfk}{gdμ|gSF,gf}.

Hence, since the supremum of a subset cannot be larger than that of the whole set, we have that:

fdμlimkfkdμ,

and the limit on the right exists, since the sequence is monotonic.

We now prove the inequality in the other direction (which also follows from Fatou's lemma), that is we seek to show that

fdμlimkfkdμ.

It follows from the definition of integral, that there is a non-decreasing sequence (gk) of non-negative simple functions such that gk ≤ f and such that

limkgkdμ=fdμ.

It suffices to prove that for each k,

gkdμlimjfjdμ

because if this is true for each k, then the limit of the left-hand side will also be less than or equal to the right-hand side.

We will show that if gk is a simple function and

limjfj(x)gk(x)

for every x, then

limjfjdμgkdμ.

Since the integral is linear, we may break up the function gk into its constant value parts, reducing to the case in which gk is the indicator function of an element B of the sigma algebra Σ. In this case, we assume that fj is a sequence of measurable functions whose supremum at every point of B is greater than or equal to one.

To prove this result, fix ε > 0 and define the sequence of measurable sets

Bn={xB:fn(x)1ϵ}.

By monotonicity of the integral, it follows that for any n,

μ(Bn)(1ϵ)=(1ϵ)1Bndμfndμ

By the assumption that limjfj(x)gk(x), any x in B will be in Bn for sufficiently high values of n, and therefore

nBn=B.

Thus, we have that

gkdμ=1Bdμ=μ(B)=μ(nBn).

Using the monotonicity property of measures, we can continue the above equalities as follows:

μ(nBn)=limnμ(Bn)limn(1ϵ)1fndμ.

Taking k → ∞, and using the fact that this is true for any positive ε, the result follows.

See also

Notes

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

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

  1. A generalisation of this theorem was given by John Bibby (1974) “Axiomatisations of the average and a further generalisation of monotonic sequences,” Glasgow Mathematical Journal, vol. 15, pp. 63–65.
  2. 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  3. 3.0 3.1 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534