User Tools

Site Tools


math105-s22:notes:lecture_10

Lecture 10

We did Tao 8.2.

Main result is monotone convergence theorem: given a monotone increasing sequence of non-negative measurable functions fnf_n, we have limfn=limfn \int \lim f_n = \lim \int f_n or equivalently supfn=supfn \int \sup f_n = \sup \int f_n The \geq direction is easy, the \leq direction is hard, which requires 3 steps lowering of the LHS supfn\int \sup f_n:

  • We first replace supfn\sup f_n by simple functions ss, with supfns\sup f_n \geq s, for some simple function ss sub-ordinate to supfn\sup f_n.
  • We then lower ss a bit, s(1ϵ)s s \geq (1-\epsilon)s .
  • We then cut-off the integration domain a bit, by introducing a cut-off function 1En(x)1_{E_n}(x), where En={x:(1ϵ)s(x)fn(x)}E_n= \{x: (1-\epsilon)s(x) \leq f_n(x) \}, we get (1ϵ)s(1ϵ)s1En (1-\epsilon)s \geq (1-\epsilon) s 1_{E_n}.

After the three lowering, we get (1ϵ)s1Enfn(1-\epsilon) s 1_{E_n} \leq f_n, hence (1ϵ)s1Enfnsupfn \int (1-\epsilon) s 1_{E_n} \leq \int f_n \leq \sup \int f_n Then, we reverse the above lowering process, by taking limit, or sup over all possible choices

  • First, we let nn \to \infty. By proving directly a 'baby version' of monotone convergence theorem for simple functions, we have that sups1En=ssup1En=s \sup \int s 1_{E_n} = \int s \sup 1_{E_n} = \int s. This gives us

(1ϵ)ssupfn\int (1-\epsilon) s \leq \sup \int f_n

  • Then, we take limit ϵ0\epsilon \to 0, to get ssupfn\int s \leq \sup \int f_n
  • Finally, we sup over all simple functions ss subordinate to supfn\sup f_n, to get supfnsupfn \int \sup f_n \leq \sup \int f_n

Then, we did some applications. For example, summation and integration can commute now (for non-negative measurable functions).

math105-s22/notes/lecture_10.txt · Last modified: 2022/02/18 06:53 by pzhou