We consider a measure space (X,Ω,μ)(X, \Omega, \mu), where XX is a set of elements, Ω\Omega is a collection of measurable sets and μ:Ω→R\mu : \Omega \rightarrow R a measure defined on μ\mu. Note that by definition Ω\Omega is a σ\sigma algebra and μ\mu satisfies

  1. (Zero element) μ(∅)=0\mu(\emptyset) = 0,
  2. (Non negativity) μ(E)≥0\mu(E) \ge 0 for all E∈ΩE \in \Omega,
  3. (σ\sigma-additivity) μ(∪i≥1Ei)=∑i=1∞μ(Ei)\mu( \cup_{i \ge 1} E_i) = \sum_{i = 1}^\infty \mu(E_i) for a countable sequence of mutually disjoint sets {Ei}\{E_i\}.

Simple Function

A characteristic function [⋅]→{0,1}[ \cdot ] \rightarrow \{0, 1\} is a function that takes value 1 if its argument is true and zero otherwise. A characteristic function χE:X→{0,1}\chi_E : X \rightarrow \{0, 1\} for a set E⊂XE \subset X is denoted as χE≐[x∈E]\chi_E \doteq [x \in E].

A simple function f:X→Rf : X \rightarrow R is summation of finite terms:

f=∑i∈[n]aiχEi f = \sum_{i \in [n] } a_i \chi_{E_i}

where {E1,E2,...En}\{E_1, E_2,... E_n \} are measurable sets and constitute a partition of XX, i.e., ∪i∈[n]Ei=X\cup_{i \in [n] } E_i = X and Ei∩Ej=∅E_i \cap E_j = \emptyset for i≠ji \neq j.

Simple Integrable Function

A simple function f=∑i∈[n]aiχEif=\sum_{ i \in [n] } a_i \chi_{E_i } is said to be integrable if μ(Ei)<∞\mu(E_i ) < \infty for all the indices ii for which ai≠0a_i \neq 0, i.e., ai≠0→μ(Ei)<∞a_i \neq 0 \rightarrow \mu(E_i) < \infty.
The integral of ff is the real number ∑i∈[n]aiμ(Ei)\sum_{ i \in [n] } a_i \mu(E_i), where we agree to take aiμ(Ei)=0a_i \mu(E_i ) = 0 for all the indices ii for which ai=0,μ(Ei)=∞a_i=0, \mu(E_i )= \infty. We denote this sum by

∫f=∑i∈[n]aiμ(Ei) \int f= \sum_{ i \in [n] } a_i \mu(E_i )

Theorem The integration is well defined and independent of the representation of ff.

Proof. Let f=∑i∈[n]aiχEif = \sum_{i \in [n] } a_i \chi_{E_i} and g=∑j=1mbjχFjg = \sum_{j = 1}^m b_j \chi_{F_j}. Suppose that f≡gf \equiv g, the goal is to show that ∫f=∫g\int f = \int g. Define Sij=Ei∩FjS_{ij} = E_i \cap F_j. If Sij≠∅S_{ij} \neq \emptyset, we must have ai=bja_i = b_j. To see this, let s∈Si,js \in S_{i,j}. Since {E1,E2,...En}\{E_1, E_2,... E_n \} is a partition of XX,only one of the value {χEi(s):i∈[n]}\{ \chi_{E_i} (s) : i \in [n] \} takes value 1 and f(s)=∑i∈[n]aiχEi(x)=aiχEi(x)=aif(s) = \sum_{i \in [n] } a_i \chi_{E_i}(x) = a_i \chi_{E_i}(x) = a_i. Similarly, g(s)=bjg(s) = b_j. We have ai=bja_i = b_j as f≡gf \equiv g.

Now, let ci,j=ai=bjc_{i,j} = a_i = b_j if Si,j≠∅S_{i,j} \neq \emptyset and ci,j=0c_{i,j}= 0 otherwise. Using the fact that {F1,...,Fm}\{ F_1, ..., F_m \} also constitutes a partition of XX, we have Ei=∪j=1mEi∩FjE_i = \cup_{j = 1}^m E_i \cap F_j for i∈[1,n]i \in [1, n]. By finite additivity of measure,

∫f=∑i∈[n]aiμ(Ei)=∑i∈[n]aiμ(∪j=1mEi∩Fj)=∑i∈[n]ai∑j=1mμ(Ei∩Fj)=∑i∈[n]∑j=1mci,jμ(Si,j) \begin{aligned} \int f &= \sum_{ i \in [n] } a_i \mu (E_i ) \\ &= \sum_{ i \in [n] } a_i \mu (\cup_{j=1}^m E_i \cap F_j) \\ &= \sum_{ i \in [n] } a_i \sum_{j = 1}^m \mu (E_i \cap F_j) \\ &= \sum_{ i \in [n] } \sum_{j=1}^m c_{i,j} \mu( S_{i,j} ) \end{aligned}

By symmetry, we can show ∫g=∑i∈[n]∑j=1mci,jμ(Si,j)\int g = \sum_{ i \in [n] } \sum_{j=1}^m c_{i,j} \mu( S_{i,j} ), which implies that ∫f=∫g\int f = \int g, as desired.

NOTE: in the proof we see that ∑i∈[n]∑j=1mci,jμ(Si,j)=∫f<∞\sum_{ i \in [n] } \sum_{j=1}^m c_{i,j} \mu( S_{i,j} ) = \int f < \infty. It follows that μ(Si,j)=∞→ci,j=0\mu(S_{i, j}) = \infty \rightarrow c_{i,j} = 0

■\blacksquare

Theorem. (Integration on a measurable set). If EE is any measurable set and ff is an integrable simple function, then χEf≐χE∑i∈[n]aiχEi\chi_E f \doteq \chi_{E} \sum_{i \in [n] } a_i \chi_{E_i} is also an integrable simple function.

Proof.

χEf=χE∑i∈[n]aiχEi=∑i∈[n]aiχEi∩E \chi_E f = \chi_{E} \sum_{i \in [n] } a_i \chi_{E_i} = \sum_{i \in [n] } a_i \chi_{E_i \cap E}

By monotonicity of measure, if ai≠0a_i \neq 0, then μ(Ei∩E)≤μ(Ei)<∞\mu(E_i \cap E) \le \mu(E_i) < \infty. Therefore, χEf\chi_E f is integrable.

■\blacksquare

Definition The integration of χEf\chi_E f is abbreviated as

∫Ef=∫χEf. \int_E f = \int \chi_E f.

Now we show some basic properties of simple integration. These properties really inherit from the non-negativity and complete additivity of measure μ\mu.

Basic Properties

Let f=∑i∈[n]aiχEif=\sum_{ i \in [n] } a_i \chi_{E_i } and g=∑j=1mbjχFjg=\sum_{j=1}^m b_j \chi_{F_j } be two integrable simple functions, and α,β∈R\alpha, \beta \in R two real values.

  1. Linearity. Integrable simple functions forms a vector space, i.e., ∫αf+βg=a∫f+β∫g\int \alpha f + \beta g =a \int f + \beta \int g
    Proof. Define Sij=Ei∩FjS_{ij} = E_i \cap F_j. Now {Si,j}\{ S_{i,j} \} is a partition of XX. Let ci,j=ai=bjc_{i,j} = a_i = b_j if Si,j≠∅S_{i,j} \neq \emptyset and ci,j=0c_{i,j}= 0 otherwise. Moreover, we have ci,j≠0  ⟹  μ(Si,j)=0c_{i,j} \neq 0 \implies \mu(S_{i,j} ) = 0.

    αf+βg=α∑i∈[n]aiχEi+β∑j=1mbjχFj=∑i,j(α+β)ci,jχSi,j ,∫αf+βg=∑i,j(α+β)ci,jμ(Si,j)=α∑i,jci,jμ(Si,j)+β∑i,jci,jμ(Si,j)=α∫f+β∫g■ \begin{aligned} \alpha f + \beta g &= \alpha \sum_{i \in [n] } a_i \chi_{E_i} + \beta \sum_{j = 1}^m b_j \chi_{F_j} = \sum_{i,j} (\alpha + \beta) c_{i,j} \chi_{S_{i,j} } \,, \\ \int \alpha f + \beta g &= \sum_{i,j} (\alpha + β) c_{i,j} \mu(S_{i,j}) \\ &= \alpha \sum_{i,j} c_{i,j} \mu(S_{i,j} ) + β \sum_{i,j} c_{i,j} \mu( S_{i,j} ) \\ &= \alpha \int f + \beta \int g \qquad \qquad \qquad \qquad \qquad \blacksquare \end{aligned}
  2. If f≥0 a.e.f \ge 0 \ a.e., then ∫f≥0\int f \ge 0.
    Proof. Let f=∑i∈[n]aiχEif = \sum_{i \in [n] } a_i \chi_{E_i}. We claim that aiμ(Ei)≥0a_i \mu(E_i) \ge 0 for all i≥1i \ge 1.

    • If μ(Ei)=∞\mu(E_i) = \infty, then ai=0a_i = 0, since ff is measurable.

    • If μ(Ei)>0\mu(E_i) > 0, then ai≥0a_i \ge 0. Otherwise, we have f<0f < 0 on a set EiE_i with positive measure, contradicting f≥0 a.e.f \ge 0 \ a.e..

    • If μ(Ei)=0\mu(E_i) = 0, the claim is trivially true.
      Therefore, ∫f=∑iaiμ(Ei)≥0\int f = \sum_i a_i \mu(E_i ) \ge0.

    ■\blacksquare

  3. If f≥g a.ef \ge g \ a.e, then ∫f≥∫g\int f \ge \int g.
    Proof. Observe that

    ∫f−∫g=∑i∈[n]aiμ(Ei)−∑j∈[m]bjμ(Fj)=∑i∈[n],j∈[m](ai−bj)μ(Ei∩Fj) \begin{aligned} \int f - \int g &= \sum_{i \in [n] } a_i \mu(E_i ) -\sum_{j \in [m] } b_j \mu(F_j ) \\ &= \sum_{i \in [n], j \in [m] } (a_i - b_j ) \mu(E_i \cap F_j) \end{aligned}

    and that

    ai−bj<0  ⟹  μ(Ei∩Fj)=0 a_i-b_j < 0 \implies \mu(E_i \cap F_j ) = 0

    NOTE: Another way to prove this is by defining h≐f−gh \doteq f - g which if non-negative almost everywhere and use conclusion of (1).
    ■\blacksquare

  4. ∣f∣|f| is an integrable simple function, and ∣∫f∣≤∫∣f∣|\int f|\le \int |f|.
    Proof. Let ∣f∣=∑i∣ai∣χEi|f|=\sum_i |a_i | \chi_{E_i }. Therefore, ∣ai∣≠0  ⟹  μ(Ei)=0|a_i| ≠ 0 \implies \mu(E_i )=0. ∣f∣|f| is simple and integrable.

    ∫∣f∣=∑i∣ai∣μ(Ei)≥∣∑iaiμ(Ei)∣=∣∫f∣.■ \int|f| =\sum_i |a_i |\mu(E_i ) \ge \left| \sum_i a_i \mu(E_i ) \right| = \left| \int f \right|. \qquad \blacksquare
  5. ∫∣f+g∣≤∫∣f∣+∫∣g∣\int|f+g | \le \int |f| + \int |g|.
    Proof.

    ∫∣f+g∣≤∫(∣f∣+∣g∣)=∫∣f∣+∫∣g∣.■ \int|f+g| \le \int(|f|+|g|) =\int|f| +\int|g|. \qquad \blacksquare
  6. If m≤f≤M a.e.m \le f \le M \ a.e. on a measurable set EE with μ(E)<∞\mu(E) < \infty, then mμ(E)≤∫Ef≤Mμ(E)m \mu(E) \le \int_E f \le M \mu(E).
    Proof. The condition μ(E)<∞\mu(E) < \infty ensures that m⋅μ(E)<∞m \cdot \mu(E) < \infty. Note that

    ∫Ef=∑iaiμ(Ei∩E) \int_E f=\sum_i a_i \mu(E_i \cap E)

    and that

    ai<m  ⟹  μ(Ei∩E)=0  ⟹  ∑i(ai−m)μ(Ei∩E)≥0. a_i < m \implies \mu(E_i \cap E) = 0 \implies \sum_i (a_i-m) \mu(E_i \cap E) \ge 0.

    In a similar manner we can prove the other inequality.

    NOTE: another way is to utilize that μχE\mu \chi_E is simple, integrable μχE≤f\mu \chi_E \le f almost everywhere.
    ■\blacksquare

  7. If f≥0, a.e.f \ge 0,\ a.e., and if EE and FF are measurable sets with E⊂FE⊂F, then ∫Ef≤∫Ff\int_E f \le \int_F f.
    Proof.

    ∫Ef=∑iaiμ(Ei∩E)≤∑iaiμ(Ei∩F)=∫Ff. \int_E f = \sum_i a_i \mu(E_i \cap E) \le \sum_i a_i \mu(E_i \cap F) =\int_F f.

    Then inequality holds since it is always true that

    aiμ(Ei∩E)≤aiμ(Fi∩E). a_i \mu(E_i \cap E) \le a_i \mu(F_i \cap E).
    • If μ(Ei∩E)≤μ(Ei∩F)=∞\mu(E_i \cap E) \le \mu(E_i \cap F) = \infty, then ai=0a_i = 0.
    • If 0<μ(Ei∩E)≤μ(Ei∩E)<∞0 < \mu(E_i \cap E) \le \mu(E_i \cap E) < \infty, then ai≥0a_i \ge 0.
    • If 0=μ(Ei∩E)=μ(Ei∩E)0 = \mu(E_i \cap E) = \mu(E_i \cap E), then it is trivially true.

    NOTE: another way is to utilize that χEf≤χFf\chi_E f \le \chi_F f almost everywhere.
    ■\blacksquare

  8. Monotone convergence. If F=+m≥1FmF = +_{m \ge 1} F_m is a disjoint union of measurable sets, then

    ∫Ff=∫f⋅(∑m≥1χFm)=∑m≥1∫f⋅χFm=∑m≥1∫Fmf \int_F f = \int f \cdot \Big( \sum_{m \ge 1} \chi_{ F_m } \Big) = \sum_{m \ge 1} \int f \cdot \chi_{ F_m } = \sum_{m \ge 1} \int_{F_m} f

    Proof. This is a consequence of σ\sigma-additivity of measure. Let f=∑i∈[n]aiχEif = \sum_{i \in [n] } a_i \chi_{E_i},

    ∫Ff=∑i∈[n]aiμ(Ei∩F)=∑i∈[n]aiμ(Ei∩(+m≥1Fm))=∑i∈[n]aiμ(+m≥1Ei∩Fm)=∑i∈[n]ai∑m≥1μ(Ei∩Fm) by σ-additivity of measure =∑i∈[n]ailim⁡k→∞⁡∑m=1kμ(Ei∩Fm)=lim⁡k→∞⁡∑i∈[n]ai∑m=1kμ(Ei∩Fm) exchange order of limit and finite summation=lim⁡k→∞⁡∑m=1k∑i∈[n]aiμ(Ei∩Fm)=lim⁡k→∞⁡∑i=1k∫Fmf■ \begin{aligned} \int_F f &= \sum_{ i \in [n] } a_i \mu(E_i \cap F) \\ &=\sum_{ i \in [n] } a_i \mu(E_i \cap ( +_{m \ge 1} F_m )) \\ &=\sum_{ i \in [n] } a_i \mu( +_{m \ge 1} E_i \cap F_m ) \\ &=\sum_{ i \in [n] } a_i \sum_{m \ge 1} \mu(E_i \cap F_m) & \text{ by $\sigma$-additivity of measure }\\ &=\sum_{ i \in [n] } a_i \lim_{k \rightarrow \infty} ⁡\sum_{m=1}^k \mu(E_i \cap F_m) \\ &= \lim_{k \rightarrow \infty} ⁡\sum_{ i \in [n] } a_i \sum_{m=1}^k \mu(E_i \cap F_m) & \text{ exchange order of limit and finite summation} \\ &= \lim_{k \rightarrow \infty} ⁡ \sum_{m=1}^k \sum_{ i \in [n] } a_i \mu(E_i \cap F_m) \\ &= \lim_{k \rightarrow \infty} ⁡\sum_{i=1}^k \int_{F_m} f \qquad \blacksquare \end{aligned}
  9. Monotone convergence. If F1⊂F2⊂F3⊂...F_1 \subset F_2 \subset F_3 \subset ... is a sequence of increasing measurable sets and let F=∪nFnF = \cup_{n} F_n, then lim⁡n∫Fnf=∫Ff\lim_n \int_{F_n} f = \int_F f.
    Proof. Let Fn′=Fn−Fn−1F_n' = F_n - F_{n - 1}. The result follows immediately from the previous property.
    ■\blacksquare

  10. If F1⊃F2⊃F3⊃...F_1 \supset F_2 \supset F_3 \supset ... is a sequence of decreasing measurable sets and let F=∩nFnF = \cap_{n} F_n, then lim⁡n∫Fnf=∫Ff\lim_n \int_{F_n} f = \int_F f.

    Proof. Let f=∑i=1NaiχEif = \sum_{i = 1}^N a_i \chi_{E_i}. It follow that

    ai≠0  ⟹  μ(Ei∩F1)<μ(Ei)<∞. a_i \neq 0 \implies \mu(E_i \cap F_1) < \mu(E_i) < \infty.

    Using continuity of measure μ\mu,

    lim⁡nμ(Ei∩Fn)=μ(Ei∩lim⁡nFn)=μ(Ei∩F), \lim_n \mu(E_i \cap F_n) = \mu(E_i \cap \lim_n F_n) = \mu (E_i \cap F),

    which implies that lim⁡n∫Fnf=∫Ff\lim_n \int_{F_n} f = \int_F f.

    Remark. Since ff is integrable, it has nonzero values on a finite support. We don't even require that μ(F1)<∞\mu(F_1) < \infty.
    ■\blacksquare

  11. Let f=∑i∈[n]aiχEif = \sum_{i \in [n] } a_i \chi_{E_i} and define the support N(f)N(f) of simple integrable function ff to be the set of elements with non-zero values N(f)={x∈X:f(x)≠0}=∪i,ai≠0EiN(f) = \{ x \in X : f(x) \neq 0 \} = \cup_{i, a_i \neq 0} E_i, then μ(N(f))≤∞\mu( N(f) ) \le \infty.

    Proof. Since ff is integrable, ai≠0a_i \neq 0 implies μ(Ei)<∞\mu(E_i) < \infty. Now

    μ(N(F))=∑1≤i≤n,ai≠0μ(Ei)<∞■ \mu( N(F) ) = \sum_{1 \le i \le n, a_i \neq 0} \mu(E_i) < \infty \qquad \qquad \blacksquare

With simple integrable functions as building blocks, we are ready to define integration for functions in general.

Fist we introduce a notation of convergence we need in the following discussion.

Cauchy In Mean

Definition. A sequence {fn}\{ f_n \} of simple functions is called Cauchy in mean if

lim⁡n,m∫∣fn−fm∣=0 \lim_{n, m} \int |f_n - f_m| = 0

Cauchy in mean does not implies Cauchy almost everywhere. Consider the sequence of functions

  1. χ[0,1/2],χ[1/2,1]\chi_{[0, 1/2]}, \chi_{[1 / 2, 1]},
  2. χ[0,1/4],χ[1/4,1/2],χ[1/2,3/4],χ[3/4,1]\chi_{ [0, 1 / 4 ] }, \chi_{ [1 / 4, 1 / 2] }, \chi_{ [ 1 / 2, 3 / 4 ] }, \chi_{ [3 / 4, 1] },
  3. ...
  4. ...χ[i/2n,(i+1)/2n]...,(i∈{0,1,2,...,2n−1})... \chi_{ [ i / 2^n, (i + 1) / 2^n ] } ...,(i \in \{0, 1, 2, ..., 2^{n} - 1 \} )

They are Cauchy in mean but don's Cauchy almost everywhere. But it is Cauchy in measure.

Theorem If a sequence {fn}\{ f_n \} of simple functions is Cauchy in mean, it is Cauchy in measure.

Proof. Let hn,m=∣fn−fm∣h_{n, m} = |f_n - f_m|. As fnf_n and fmf_m are simple and integrable, hn,mh_{n, m} is simple and integrable. Moreover, it is non-negative. We write it as hn,m=∑j∈[k]bjχFjh_{n,m} = \sum_{j \in [k] } b_j \chi_{F_j}, where bj≥0b_j \ge 0. For all δ>0\delta > 0, bj≥δ>0b_j \ge \delta > 0 implies that μ(Fj)<∞\mu(F_j) < \infty. Now

δ⋅μ({x∈X:hn,m(x)≥δ})=∑j∈[k],bj≥δδ⋅μ(Fj)≤∑j∈[k],bj≥δbjμ(Fj)≤∫hn,m=∫∣fn−fm∣. \begin{aligned} \delta \cdot \mu( \{ x \in X: h_{n,m}(x) \ge \delta\} ) &= \sum_{j \in [k], b_j \ge \delta} \delta \cdot \mu(F_j) \\ &\le \sum_{j \in [k], b_j \ge \delta} b_j \mu(F_j) \\ &\le \int h_{n,m} \\ &= \int |f_n - f_m|. \end{aligned}

Hence, μ({x∈X:hn,m(x)≥δ})≤∫∣fn−fm∣δ\mu( \{ x \in X: h_{n,m}(x) \ge \delta\} ) \le \frac{ \int |f_n - f_m| }{ \delta }. For any fix δ\delta, this can be arbitrary small as n,m→∞n, m \rightarrow \infty.

■\blacksquare

NOTE: the converse is not true.

Example Consider this sequence of functions:

{n⋅χ[0,1/n]:n∈N} \{ n \cdot \chi_{[0, 1 / n] } : n \in \mathbf{N} \}

It converges in measure to f≡0f \equiv 0. But ∫n⋅χ[0,1/n]=1\int n \cdot \chi_{[0, 1 / n] } = 1 for all nn. lim⁡n∫n⋅χ[0,1/n]≠∫f\lim_n \int n \cdot \chi_{[0, 1 / n] } \neq \int f.

The implication here is that we need additional condition more than converge in mean to define the integral for a general function ff. We need to connect the sequence {fn}\{ f_n \} with ff, the function we want to define integral. Can we say something like {fn}\{ f_n \} converges to ff in mean, i.e., lim⁡n∫∣fn−f∣=0\lim_n \int |f_n - f| = 0? But we have not define integral of non-simple function yet. Here is how we establish the connection.

General Integrable Functions

Definition. An extended real-valued, measurable function ff, on a measure space (X,Ω,μ)(X, \Omega, \mu) is said to be integrable if there exists a sequence {fn}\{ f_n \} of integrable simple functions having the following properties:

  1. {fn}\{ f_n \} is a Cauchy sequence in the mean.
  2. lim⁡nfn(x)=f(x)a.e.\lim_{n} f_n (x) = f(x) \quad a.e..

The integral ∫f\int f of ff is defined as

∫f=lim⁡n∫fn. \int f = \lim_{n} \int f_n.

There are two issues we need to answer for the definition to be well-defined. The first one is that the limit of ∫fn\int f_n indeed exists. Second, we need to show that for any sequence satisfying condition (1) and (2), their integral converges to the same limit.

Theorem (Existence of Limit). lim⁡n∫fn\lim_n \int f_n exists.

Proof.

∣∫fn−∫fm∣≤∫∣fn−fm∣→0asn,m→∞ \left| \int f_n - \int f_m \right| \le \int | f_n - f_m | \rightarrow 0 \qquad as \quad n, m \rightarrow \infty

Therefore, {∫fn:n∈N}\{ \int f_n : n \in \mathbf{N} \} (note that each element in this set is a real number) is a Cauchy sequence and its limit exists.

■\blacksquare

Theorem (Uniqueness of Limit). Let {fn}\{ f_n \} and {gn}\{ g_n \} be two Cauchy sequences in the mean of integrable simple functions, such that

lim⁡nfn=lim⁡ngn=fa.e. \lim_n f_n = \lim_n g_n = f \qquad a.e.

Then

lim⁡n∫fn=lim⁡n∫gn. \lim_n \int f_n = \lim_n \int g_n.

Proof. Define hn≐fn−gnh_n \doteq f_n - g_n for n∈Nn \in \mathbf{N}. As fnf_n and gng_n are simple and integrable, hnh_n is simple and integrable.

Step 1.

We claim that

  1. {hn}\{ h_n \} is Cauchy in mean.
  2. lim⁡nhn=0a.e.\lim_n h_n = 0 \quad a.e..

By monotonicity and linearity of integration of simple functions,

∫∣hn−hm∣=∫∣fn−gn−(fm−gm)∣≤∫∣fn−fm∣+∣gn−gm∣=∫∣fn−fm∣+∫∣gn−gm∣ \begin{aligned} \int |h_n - h_m| &= \int | f_n - g_n - (f_m - g_m)| \\ &\le \int |f_n - f_m| + |g_n - g_m| \\ &= \int |f_n - f_m| + \int |g_n - g_m| \end{aligned}

The integral can be arbitrary small as n,m→∞n, m \rightarrow \infty.

The second claim results from the lim⁡nfn=f\lim_n f_n = f and lim⁡ngn=f\lim_n g_n = f a.e.a.e..

We are going to prove lim⁡n∫hn=0\lim_n \int h_n = 0, which then implies

lim⁡n∫(fn−gn)=lim⁡n(∫fn−∫gn)=lim⁡n∫fn−lim⁡n∫gn=0. \lim_n \int (f_n - g_n) =\lim_n \left( \int f_n - \int g_n \right) = \lim_n \int f_n - \lim_n \int g_n = 0.

Step 2.

Our goal is to prove that ∫hn→0\int h_n \rightarrow 0. Specifically,

  • ∀ϵ>0\forall \epsilon > 0, ∃N>0\exists N > 0, s.t., ∀n>N,∣∫hn∣<O(ϵ)\forall n > N, | \int h_n | < O(\epsilon).

The trick here is to restrict the discussion of ∫h\int h on a σ\sigma-finite measurable set. Define the support Supp(fn)\mathbb{Supp} ( f_n ) of fnf_n to be the set with non-zero values:

Supp(fn)={x∈X:fn(x)≠0} \mathbb{Supp} ( f_n ) = \{ x \in X : f_n(x) \neq 0\}

As fnf_n is a simple integrable function, μ(Supp(fn))<∞\mu( \mathbb{Supp} ( f_n )) < \infty. Let En=∪k∈[n](Supp(fk)∪Supp(gk))E_n = \cup_{ k \in [n] } \Big( \mathbb{Supp} (f_k) \cup \mathbb{Supp} (g_k) \Big) and E=∪nEnE = \cup_n E_n. We have μ(En)<∞\mu(E_n) < \infty, En↑EE_n \uparrow E and EE is σ\sigma-finite. By monotone convergence property of simple integrable functions, we have, ∀n\forall n,

∫hn=∫Ehn \int h_n = \int_{E} h_n

First, as {hn}\{ h_n \} is Cauchy in mean, for ϵ>0\epsilon > 0, ∃N1>0\exists N_1 > 0, s.t, for n,k>N1n, k > N_1, we have ∫∣hn−hk∣≤ϵ\int |h_n - h_k| \le \epsilon . We choose an integer k>N1k > N_1. As hkh_k is a simple integrable function, and as Em↑EE_m \uparrow E, it holds that

lim⁡m∫Emhk=∫Ehk=∫hk \lim_m \int_{E_m} h_k = \int_E h_k = \int h_k

For fix kk, we choose an integer mm, s..t, ∣∫hk−∫Emhk∣≤ϵ\left| \int h_k - \int_{E_m} h_k \right| \le \epsilon.

For a fix k>N1k > N_1, we claim that for any n>N1n > N_1, we have ∣∫hn−∫Emhn∣<3ϵ| \int h_n - \int_{E_m} h_n | < 3\epsilon,

∣∫hn−∫Emhn∣=∣∫hn−∫hk+∫hk−∫Emhk+∫Emhk−∫Emhn∣≤∣∫hn−∫hk∣+∣∫hk−∫Emhk∣+∣∫Emhk−∫Emhn∣≤ϵ+ϵ+∫Em∣hk−hn∣≤3ϵ \begin{aligned} \left| \int h_n - \int_{E_m} h_n \right| &= \left| \int h_n - \int h_k + \int h_k - \int_{E_m} h_k + \int_{E_m} h_k - \int_{E_m} h_n\right| \\ &\le \left| \int h_n - \int h_k \right| + \left| \int h_k - \int_{E_m} h_k \right| + \left| \int_{E_m} h_k - \int_{E_m} h_n \right| \\ &\le \epsilon + \epsilon + \int_{E_m} |h_k - h_n| \\ &\le 3\epsilon \end{aligned}

We have successfully restrict our discussion on a set with finite measure. The key here is that ∫Emhn\int_{E_m} h_n converges uniformly to ∫hn\int h_n, as mm increases, independent of the choice of nn, as long as {hn}\{ h_n \} is Cauchy in mean.

Indeed, what we have shown here is that

lim⁡nlim⁡m∫Emhn=lim⁡mlim⁡n∫Emhn. \lim_n \lim_m \int_{E_m} h_n = \lim_m \lim_n \int_{E_m} h_n.

Second, we prove that

∫Emhn→0. \int_{E_m} h_n \rightarrow 0.

So far we have not consider the condition lim⁡nhn=0 a.e.\lim_n h_n = 0 \ a.e. It is time to turn to it. Define

Sn={x∈Em:∣hn(x)∣>ϵ/μ(Em)} S_n = \{ x \in E_m : |h_n(x)| > \epsilon / \mu(E_m) \}

Observe that lim⁡n∪i≥nSn↓\lim_n \cup_{i \ge n} S_n \downarrow. As μ(∪i≥1Sn)≤μ(Em)<∞\mu( \cup_{i \ge 1} S_n) \le \mu (E_m) < \infty, by continuity of μ\mu,

lim⁡nμ(∪i≥nSn)=μ(lim⁡n∪i≥nSn)=0. \lim_n \mu( \cup_{i \ge n} S_n) = \mu( \lim_n \cup_{i \ge n} S_n) = 0.

As hkh_k is a simple function, it is bounded by some integer K a.e.K \ a.e.. As μ(Em)<∞\mu(E_m) < \infty, ∃N2>N1\exists N_2 > N_1, s.t., for n>N2n > N_2, we have μ(Sn)≤μ(∪i≥nSn)≤ϵ/K\mu(S_n) \le \mu(\cup_{i \ge n} S_n ) \le \epsilon / K. Now,

∣∫Emhn∣≤∣∫Snhn∣+∣∫Em∖Snhn∣≤∣∫Snhn∣+ϵμ(Em)μ(Em)≤∣∫Snhn∣+ϵ \begin{aligned} \left| \int_{E_m} h_n \right| &\le \left| \int_{S_n} h_n \right| + \left| \int_{E_m \setminus S_n} h_n \right| \\ &\le \left| \int_{S_n} h_n \right| + \frac{\epsilon}{ \mu(E_m) } \mu(E_m) \\ &\le \left| \int_{S_n} h_n \right| + \epsilon \end{aligned}

Finally, we argue that ∣∫Snhn∣\left| \int_{S_n} h_n \right| is small enough.

∣∫Snhn∣≤∣∫Snhn−hk+hk∣≤∫∣hn−hk∣+∫Sn∣hk∣≤ϵ+K⋅μ(Sn)≤2ϵ \left| \int_{S_n} h_n \right| \le \left| \int_{S_n} h_n - h_k + h_k \right| \le \int |h_n - h_k| + \int_{S_n} |h_k| \le \epsilon + K \cdot \mu(S_n) \le 2 \epsilon

Indeed, the technique demonstrated here shows that {∫Ehn}\{ \int_E h_n \} is uniformly absolutely continuous with respect to μ(E)\mu(E).

■\blacksquare

Corollary 1 Let {hn}\{ h_n \} be a sequence of simple integrable function that are Cauchy in mean and E1⊂E2⊂E3...E_1 \subset E_2 \subset E_3 ... a sequence of increasing measurable sets that converge to E=∪i≥1EiE = \cup_{i \ge 1} E_i. Then ∫Emhn→∫Ehn\int_{E_m} h_n \rightarrow \int_{E} h_n uniformly, i.e., ∀ϵ>0,∃M>0\forall \epsilon > 0, \exists M > 0, s.t., for m>Mm > M, we have

∣∫Emhn−∫Ehn∣≤ϵ \left| \int_{E_m} h_n - \int_E h_n \right| \le \epsilon

Corollary 2 Let {hn}\{ h_n \} be a sequence of simple integrable function that are Cauchy in mean. ∀ϵ>0,∃δ>0\forall \epsilon > 0, \exists \delta > 0, s.t, for any measurable set EE with μ(E)<δ\mu(E) < \delta, we have ∣∫Ehn∣<ϵ|\int_E h_n| < \epsilon independent of nn.

Definition

Let ff be an integrable function and EE be a measurable set. Then χEf\chi_E f is integrable and its integral is denoted as

∫χEf=∫Ef \int \chi_E f = \int_E f

Remark:
If ff is integrable, then there is a sequence simple, integrable function {fn}\{f_n \} that are Cauchy in mean and converges to ff almost every. It is easy to see that {χEfn}\{ \chi_E f_n \} is simple, integrable, Cauchy in mean and converges to χEf\chi_E f almost everywhere, therefore χEf\chi_E f is integrable. An immediately consequence is the following lemma

Lemma 1

∫Efn\int_E f_n converges to ∫Ef\int_E f uniformly irrespective of EE.
Proof. It suffices to show the sequence {∫Efn:n∈N}\{ \int_E f_n : n \in \mathbf{N} \} is a uniformly Cauchy irrespectively of EE,

∣∫Efn−∫Efm∣≤∫E∣fn−fm∣≤∫∣fn−fm∣→0 \left| \int_E f_n - \int_E f_m \right| \le \int_E |f_n - f_m| \le \int |f_n - f_m| \rightarrow 0

Therefore, for ∀E⊂Ω\forall E \subset \Omega, ∃N>0\exists N > 0, for all n,m>Nn,m > N, we have

∣∫Efn−∫Efm∣≤ϵ \left| \int_E f_n - \int_E f_m \right| \le \epsilon

Taking limit with respect to mm, we get lim⁡m∫Efm−ϵ≤∫Efn≤lim⁡m∫Efm+ϵ\lim_m \int_E f_m - \epsilon \le \int_E f_n \le \lim_m \int_E f_m + \epsilon, i.e.,

∣∫Efn−∫Ef∣≤ϵ \left| \int_E f_n - \int_E f \right| \le \epsilon

as desired.

Combining Corollary 2 and Lemma 1, we have the following theorem.

Theorem. Integration as Finite Signed Measure

If ff is integrable, then

λ(E)=∫Ef \lambda(E) = \int_E f

is absolute continuous.

Proof. Let {fn}\{ f_n \} as defined before. For ∀ϵ>0\forall \epsilon > 0, ∃N1>0\exists N_1 > 0, for all n>N1n > N_1, we have ∣∫Ef−∫Efn∣≤ϵ| \int_E f - \int_E f_n | \le \epsilon. On the other hand, For ∀ϵ>0\forall \epsilon > 0, ∃δ>0\exists \delta > 0, for all EE with μ(E)<δ\mu(E) < \delta, we have ∣∫Efn∣<ϵ|\int_E f_n| < \epsilon. In combination,

∣∫Ef∣≤∣∫Ef−fn∣+∫E∣fn∣≤2ϵ \left| \int_E f \right| \le \left| \int_E f - f_n \right| + \int_E |f_n| \le 2\epsilon

■\blacksquare

Next we discussion the convergence behavior of a sequence of integrable functions.

Lemma

If {fk}\{ f_k \} is a sequence of simple, integrable function that are

  1. Cauchy in the mean,
  2. Converge to ff almost everywhere.

Then

lim⁡k∫∣fk−f∣=0 \lim_k \int |f_k - f| = 0

Proof.
Note that ∣fk−f∣|f_k - f | may not be a simple function. To investigate the value of its integral, we need to characterize it according to the definition of integral for general functions. Here is how we do it. For a fix kk, the sequence {∣fk−fn∣:n∈N}\{ |f_k - f_n| : n \in \mathbf{N} \} is simple, integrable, and converges to ∣fk−f∣|f_k - f | almost everywhere. Moreover, as {fk}\{ f_k \} itself is Cauchy in mean, for ∀ϵ>0\forall \epsilon > 0, ∃N>0\exists N > 0, s.t., ∀k,n,m>N\forall k, n, m > N,

∫∣∣fk−fn∣−∣fk−fm∣∣≤∫∣fk−fn−(fk−fm)∣=∫∣fm−fn∣≤ϵ \int \left| |f_k - f_n| - |f_k - f_m| \right| \le \int |f_k - f_n - (f_k - f_m)| = \int |f_m - f_n| \le \epsilon

As a consequence {∣fk−fn∣:n∈N}\{|f_k - f_n| : n \in \mathbf{N} \} is Cauchy in the mean. ∣fk−f∣|f_k - f| is integrable and ∫∣fk−f∣=lim⁡n∫∣fk−fn∣\int |f_k - f| = \lim_n \int |f_k - f_n|. But for k,n,m>Nk, n, m > N,

∫∣fk−f∣=lim⁡m∫∣fk−fm∣≤∫∣fk−fn∣+ϵ≤2ϵ \int |f_k - f| = \lim_m \int |f_k - f_m| \le \int |f_k - f_n| + \epsilon \le 2\epsilon

As ϵ\epsilon could be arbitrary small, we have lim⁡k∫∣fk−f∣=0\lim_k \int |f_k - f| = 0.

■\blacksquare

Theorem

If gk{g_k} is a sequence of integrable functions satisfying the conditions

  1. gk{g_k} is a Cauchy sequence in the mean.
  2. gk{g_k} converges in measure to ff.

then ff is integrable and ∫f=lim⁡⁡k∫gk\int f = \lim⁡_k \int g_k.

Proof. For each gkg_k, there is a sequence {gkm:m∈N}\{ g_{km} : m ∈ \mathbf{N} \} simple integrable functions,

  1. {gkm}\{ g_{km} \} is a Cauchy sequence in the mean.

  2. {gkm}\{ g_{km} \} converges in measure to gkg_k.

  3. ∫gk=lim⁡m⁡∫gkm\int g_k = \lim_m ⁡\int g_{km}

For fix kk, we choose such an integer mm, such that ∫∣gk−∫gkm∣≤1/k\int |g_k - \int g_{k m} |\le 1 / k and μ({x:∣gk(x)−gkm(x)∣≥1/k})≤1/k\mu(\{ x:|g_k (x) - g_{km} (x) | \ge 1 / k \} ) \le 1 / k. For convenience, denote gkmg_{k m} as fkf_k. Now we claim the sequence {fk}\{ f_{k} \} of simple integrable functions satisfies

  1. is a Cauchy sequence in the mean.
  2. converges to ff in measure.

The first one result from the fact {gk}\{ g_k \} is Cauchy sequence in the mean and triangle inequality

∫∣fm−fn∣≤∫∣fm−gm∣+∣gm−gn∣+∣gn−fn∣≤∫∣fm−gm∣+∫∣gm−gn∣+∫∣gn−fn∣≤1m+∫∣gm−gn∣+1n→0as n,m→∞ \begin{aligned} \int | f_{m} - f_{n} | &\le \int | f_{m} - g_m | +| g_m - g_n |+| g_n - f_n | \\ &\le \int | f_{m} - g_m | + \int | g_m - g_n | + \int | g_n - f_n | \\ &\le \frac{1}{m} + \int | g_m - g_n | + \frac{1}{n} \\ &\rightarrow 0 \quad \text{as } n, m \rightarrow \infty \end{aligned}

The second claim also results from triangle inequality. For any δ>0\delta > 0, ∃1/k≤δ\exists 1 / k \le \delta, s.t.,

μ({x∈X:∣fk−f∣≥δ})≤μ({x∈X:∣fk−gk∣≥δ})+μ({x∈X:∣gk−f∣≥δ})≤1/k+μ({x∈X:∣gk−f∣≥δ})→0as k→∞ \begin{aligned} \mu(\{ x \in X: |f_k - f | \ge \delta \} ) &\le \mu(\{ x \in X: |f_k - g_k | \ge \delta \} ) + \mu(\{ x \in X: |g_k - f | \ge \delta \} ) \\ &\le 1/k + \mu(\{ x \in X: |g_k - f | \ge \delta \} ) \\ &\rightarrow 0 \quad \text{as } k \rightarrow \infty \end{aligned}

■\blacksquare

Theorem. Lebesgue's Bounded Convergence Theorem

Let {fn}\{ f_n \} be a sequence of integrable functions that converges either in measure or a.e. to a measurable function ff. If ∣fn(x)∣≤g(x) a.e.|f_n(x)| \le g(x) \ a.e. for all nn, where gg is an integrable function, then ff is integrable.

Note: compared to definition of ff being integrable,

  1. We no longer require {fn}\{ f_n \} to be simple functions.
  2. We no longer require {fn}\{ f_n \} to be Cauchy in mean.

Proof.

It suffices to show {fn}\{ f_n \} is a Cauchy sequence in mean.

  1. Each {fn}\{ f_n \} can be approximated by a sequence of simple functions. Therefore, we can find a σ\sigma-finite measurable set FnF_n such that ∫Fnfn=∫fn\int_{F_n} f_n = \int f_n. Similarly, we can find a σ\sigma finite measurable set GG such that ∫Gg=∫g\int_G g = \int g.

  2. The measurable set E=(∪nFn)∪GE = (\cup_n F_n) \cup G is σ\sigma finite. There exists a sequence of increasing, finite measurable set E1⊂E2⊂E3...E_1 \subset E_2 \subset E_3 ... which satisfies En↑EE_n \uparrow E.

  3. As ∫Eg<∞\int_E g < \infty, and lim⁡m∫Emg=∫Eg\lim_m \int_{E_m} g = \int_E g, ∀ϵ>0,∃m>0\forall \epsilon > 0, \exists m > 0, s.t., ∣∫E∖Emg∣≤ϵ|\int_{E \setminus E_m} g | \le \epsilon.

  4. The integral of ∣fn−fm∣|f_n - f_m| outside EmE_m is small: ∫E∖Em∣fn−fm∣≤∫E∖Em∣fn∣+∣fm∣≤2∫E∖Emg≤2ϵ\int_{E \setminus E_m} |f_n - f_m| \le \int_{E \setminus E_m} |f_n| + |f_m| \le 2 \int_{E \setminus E_m} g \le 2 \epsilon.

  5. Consider the integral inside the finite set EmE_m. Define Sk≐{x∈Em:∣fi(x)−fj(x)∣≥ϵ/μ(Em) for all i,j≥k}S_k \doteq \{ x \in E_m : |f_i(x) - f_j(x)| \ge \epsilon / \mu(E_m) \text{ for all } i, j \ge k\}. As {fn}\{ f_n \} converges to ff in measure or a.e., and μ(Em)<∞\mu(E_m) < \infty, μ(Sk)→μ(Em)\mu(S_k) \rightarrow \mu(E_m). We can choose an kk, s.t., μ(Em∖Sk)≤δ\mu(E_m \setminus S_k) \le \delta, where δ\delta is chosen with ∫Em∖Skg<ϵ\int_{E_m \setminus S_k} g < \epsilon. Such δ\delta exists because gg is integrable, therefore ∫Em∖Skg\int_{E_m \setminus S_k} g absolute continuous with respect to μ(Em Sk)\mu(E_m \ S_k). Now, for n,m≥kn, m \ge k,

  6. ∫Em∣fn−fm∣=∫Sk∣fn−fm∣+∫Em∖Sk∣fn−fm∣≤ϵμ(Em)μ(Em)+2∫Em∖Skg≤3ϵ\int_{E_m} | f_n - f_m | = \int_{S_k} |f_n - f_m| + \int_{E_m \setminus S_k} |f_n - f_m| \le \frac{\epsilon}{\mu(E_m) }\mu(E_m) + 2 \int_{E_m \setminus S_k} g \le 3 \epsilon

  7. ∫E∣fn−fm∣=∫E∖Em∣fn−fm∣+∫Em∣fn−fm∣≤2ϵ+3ϵ=5ϵ\int_E |f_n - f_m| = \int_{E \setminus E_m} |f_n - f_m| + \int_{E_m} | f_n - f_m| \le 2 \epsilon + 3 \epsilon = 5 \epsilon.

■\blacksquare

Theorem. Lebesgue's Monotone Convergence Theorem

Let {fn}\{ f_n \} be a monotone increasing sequence of non-negative integrable functions that converges almost everywhere to ff. Then

lim⁡n∫fn=∫f \lim_n \int f_n = \int f

Note: compared to the definition of integral of ff

  1. We no longer require {fn}\{ f_n \} to be simple functions.
  2. ∫fn\int f_n might diverge to ∞\infty. In this case, ff is not integrable as ∫f=∞\int f = \infty. But the equation still holds.

Proof.
First consider the case ∫fn\int f_n is unbounded. Then ∫f=∫nfn=∞\int f = \int_n f_n = \infty by definition.

Otherwise, suppose lim⁡n∫fn\lim_n \int f_n is bounded. Then ∫fn\int f_n is an increasing sequence that converges to a real number. It follows that for n>mn > m, then fn>fmf_n > f_m. Consequently

∫∣fn−fm∣=∫fn−fm=∫fn−∫fm→0 as n,m→∞ \int |f_n - f_m| = \int f_n - f_m = \int f_n - \int f_m \rightarrow 0 \qquad \text{ as } n, m \rightarrow \infty

Thus, {fn}\{ f_n \} is a Cauchy sequence in the mean. Hence, ff is integrable and lim⁡n∫fn=∫f\lim_n \int f_n = \int f.

Theorem. Fatou 's Lemma

Let {fn}\{ f_n \} be a sequence of non-negative and integrable functions. Then

∫lim inf⁡nfn≤lim inf⁡n∫fn \int \liminf_n f_n \le \liminf_n \int f_n

Proof. Let hn=inf⁡k≥nfkh_n = \inf_{k \ge n} f_k. Then hnh_n is a sequence of monotone increasing measurable functions that converges to lim inf⁡nhn\liminf_n h_n. By monotone convergence theorem,

∫lim⁡nhn=lim⁡n∫hn \int \lim_n h_n = \lim_n \int h_n

On the other hand, hn=inf⁡k≥nfk≤fmh_n = \inf_{k \ge n} f_k \le f_m for all m≥nm \ge n. It follows that

∫hn≤inf⁡m≥n∫fmlim⁡n∫hn≤lim⁡ninf⁡m≥n∫fm=lim inf⁡n∫fn \begin{aligned} \int h_n &\le \inf_{m \ge n} \int f_m \\ \lim_n \int h_n &\le \lim_n \inf_{m \ge n} \int f_m = \liminf_n \int f_n \end{aligned}

Combining the two equations we obtain the Fatou 's lemma.

Basic Properties

Let ff and gg be two integrable functions, and α,β∈R\alpha, \beta \in R two real values.

  1. Linearity. Integrable functions forms a vector space, i.e., ∫αf+βg=α∫f+β∫g\int \alpha f + \beta g = \alpha \int f + \beta \int g
    Proof. Let {fn}\{ f_n \} and {gn}\{ g_n \} be two sequence of simple, integrable functions that define the integral of ff and gg respectively.
    Then {αfn+βgn}\{ \alpha f_n + \beta g_n \} is a sequence of simple, integrable functions that are Cauchy in the mean and converges to αf+βg\alpha f + \beta g almost everywhere (assuming that lim⁡nfn=f a.e.\lim_n f_n = f \ a.e. and lim⁡ngn=g a.e.\lim_n g_n = g \ a.e.).

    ∫αf+βg=lim⁡n∫αfn+βgn=αlim⁡n∫fn+βlim⁡n∫gn=α∫f+β∫g. \begin{aligned} \int \alpha f + \beta g &= \lim_n \int \alpha f_n + \beta g_n \\ &= \alpha \lim_n \int f_n + \beta \lim_n \int g_n = \alpha \int f + \beta \int g. \end{aligned}

    ■\blacksquare

  2. If f≥0 a.e.f \ge 0 \ a.e., then ∫f≥0\int f \ge 0.
    Proof. Let {fn}\{ f_n \} be a sequence of simple, integrable function that are Cauchy in mean and lim⁡nfn=f a.e.\lim_n f_n = f \ a.e.. Then lim⁡n∫fn=∫f\lim_n \int f_n = \int f.
    As f≥0 a.e.f \ge 0 \ a.e., {∣fn∣}\{ |f_n| \} converges to ff almost everywhere.
    Moreover, {∣fn∣}\{ |f_n| \} is simple, integrable and Cauchy in the mean.
    Therefore, we also have

    ∫f=lim⁡n∫∣fn∣≥0 \int f = \lim_n \int |f_n| \ge 0

    ■\blacksquare

  3. If f≥g a.ef \ge g \ a.e, then ∫f≥∫g\int f \ge \int g.
    Proof. Let h=f−gh = f - g, then h≥0 a.e.h \ge 0 \ a.e.. By property 2 and 1, we obtain

    ∫h=∫f−g=∫f−∫g≥0 \int h = \int f - g = \int f - \int g \ge 0

    NOTE: it is also possible to prove this from scratch. Let {fn}\{ f_n \} and {gn}\{ g_n \} be two sequence of simple, integrable functions that define the integral of ff and gg respectively. Define hn=fn−gnh_n = f_n - g_n be a sequence of simple, integrable functions that are Cauchy in the mean. Moreover, we have lim⁡hn≥0 a.e.\lim h_n \ge 0 \ a.e.. We need to show that ∫h=lim⁡n∫hn≥0\int h = \lim_n \int h_n \ge 0.

    As before, we would like to restrict our discussion on a σ\sigma-finite measurable set. Define Fm=∪i=1mN(fi)∪∪i=1mN(gi)F_m = \cup_{i = 1}^m N(f_i) \cup \cup_{i = 1}^m N(g_i) and F=∪m=1∞FmF = \cup_{m = 1}^\infty F_m. Clearly Fm↑FF_m \uparrow F and ∫h=∫Fh\int h = \int_{F} h.

    On the other hand,

    ∫h≥∫hn−∣∫hn−∫h∣=∫Fmhn−∫Fmhn+∫Fmhk−∫Fmhk+∫hk−∫hk+∫hn−∣∫hn−∫h∣≥∫Fmhn−∣∫Fmhn−∫Fmhk∣−∣∫Fmhk−∫hk∣−∣∫hk−∫hn∣−∣∫hn−∫h∣≥∫Fmhn−∫∣hn−hk∣−∣∫Fmhk−∫hk∣−∫∣hk−hn∣−∫∣hk−hn∣ \begin{aligned} \int h & \ge \int h_n - \left| \int h_n - \int h \right| \\ &= \int_{F_m} h_n - \int_{F_m} h_n + \int_{F_m} h_k - \int_{F_m} h_k + \int h_k - \int h_k + \int h_n - |\int h_n - \int h| \\ &\ge \int_{F_m} h_n - \left| \int_{F_m} h_n - \int_{F_m} h_k \right| - \left| \int_{F_m} h_k - \int h_k \right| - \left| \int h_k - \int h_n \right| - \left| \int h_n - \int h \right| \\ &\ge \int_{F_m} h_n - \int \left| h_n - h_k \right| - \left| \int_{F_m} h_k - \int h_k \right| - \int \left| h_k - h_n \right| - \int \left| h_k - h_n \right| \end{aligned}

    Since {hn}\{h_n\} is Cauchy in mean, we can take sufficient large NN, s.t., for n,k≥Nn, k \ge N, ∫∣hk−hn∣≤ϵ\int |h_k - h_n| \le \epsilon. Now we choose an k≥Nk \ge N and fix its value. Further, as Fm↑FF_m \uparrow F, we can choose an mm, s.t., ∣∫Fmhk−∫hk∣≤ϵ|\int_{F_m} h_k - \int h_k| \le \epsilon. It follow

    ∫h≥∫Fmhn−3ϵ \int h \ge \int_{F_m} h_n - 3 \epsilon

    It suffice to show ∫Fmhn\int_{F_m} h_n is sufficient large on a measurable set FmF_m with finite measure for large enough nn. Define Sn≐{x∈Fm:hi(x)≥−ϵ/μ(Fm) for all i≥n}S_n \doteq \{ x \in F_m : h_i (x) \ge - \epsilon / \mu(F_m) \text{ for all } i \ge n \}. As lim⁡nh≥0 a.e.\lim_n h \ge 0 \ a.e., Sn↑S_n \uparrow and ∃n\exists n s.t., μ(Fm∖Sn)≤δ\mu(F_m \setminus S_n) \le \delta, where δ\delta is chosen s.t., ∫Fm∖Sn∣hk∣≤ϵ\int_{F_m \setminus S_n} |h_k| \le \epsilon. Such δ\delta exists since hkh_k is simple and integrable. For such an nn,

    ∫h≥∫Snhn+∫Fm∖Snhn−3ϵ≥−ϵμ(Fm)μ(Fm)+∫Fm∖Snhk−∫Fm∖Snhk+∫Fm∖Snhn−3ϵ≥−4ϵ−∣∫Fm∖Snhk∣−∫∣hk−hn∣≥−6ϵ \begin{aligned} \int h & \ge \int_{S_n} h_n + \int_{F_m \setminus S_n} h_n - 3 \epsilon \\ &\ge \frac{-\epsilon}{\mu(F_m)}\mu(F_m) + \int_{F_m \setminus S_n} h_k - \int_{F_m \setminus S_n} h_k + \int_{F_m \setminus S_n} h_n - 3 \epsilon \\ &\ge -4 \epsilon - \left| \int_{F_m \setminus S_n} h_k \right| - \int |h_k - h_n| \\ &\ge -6 \epsilon \end{aligned}

    As ϵ\epsilon could be arbitrary value, it must be true that ∫h≥0\int h \ge 0.

    ■\blacksquare

  4. ∣f∣|f| is an integrable function, and ∣∫f∣≤∫∣f∣|\int f| \le \int |f|.
    Proof. Let {fn}\{ f_n \} be a sequence of simple, integrable function that are Cauchy in mean and lim⁡nfn=f a.e.\lim_n f_n = f \ a.e. Then Let {∣fn∣}\{ |f_n| \} be a sequence of simple, integrable function that are Cauchy in mean and lim⁡n∣fn∣=∣f∣ a.e.\lim_n |f_n| = |f| \ a.e.

    ∫∣f∣=lim⁡n∫∣fn∣≥±lim⁡n∫fn=±∫f \int|f| = \lim_n \int |f_n| \ge \pm \lim_n \int f_n = \pm \int f

    ■\blacksquare

  5. ∫∣f+g∣≤∫∣f∣+∫∣g∣\int | f + g | \le \int |f| + \int |g|.
    Proof. ∫∣f+g∣≤∫(∣f∣+∣g∣)=∫∣f∣+∫∣g∣.■\int|f+g| \le \int(|f|+|g|) =\int|f| +\int|g|. \qquad \blacksquare

  6. If m≤f≤M a.e.m \le f \le M \ a.e. on a measurable set EE with μ(E)<∞\mu(E) < \infty, then mμ(E)≤∫Ef≤Mμ(E)m \mu(E) \le \int_E f \le M \mu(E).
    Proof. The condition μ(E)<∞\mu(E) < \infty ensures that mμ(E)<∞m \mu(E) < \infty.
    Then utilize that μχE\mu \chi_E is simple, integrable μχE≤f⋅χE\mu \chi_E \le f \cdot \chi_E almost everywhere.
    ■\blacksquare

  7. If f≥0, a.e.f \ge 0,\ a.e., and if EE and FF are measurable sets with E⊂FE⊂F, then ∫Ef≤∫Ff\int_E f \le \int_F f.
    Proof.
    Utilize that χEf≤χFf\chi_E f \le \chi_F f almost everywhere.
    ■\blacksquare

  8. If F=+m≥1FnF = +_{m \ge 1} F_n is a disjoint union of measurable sets, then
    ∫Ff=∑m≥1∫Fmf\int_F f=\sum_{m \ge 1} \int_{F_m} f.

    Proof. Let {fn}\{ f_n \} be a sequence of simple, integrable function that are Cauchy in mean and lim⁡nfn=f a.e.\lim_n f_n = f \ a.e.. What we are going to prove is

    lim⁡nlim⁡k∫∪m=1kFmfn=lim⁡klim⁡n∫∪m=1kFmfn=lim⁡k∑m=1k∫Fmf \lim_n \lim_k \int_{\cup_{m = 1}^k F_m} f_n = \lim_k \lim_n \int_{\cup_{m = 1}^k F_m} f_n = \lim_k \sum_{m = 1}^k \int_{F_m} f

    The exchange order of limit is justified as {fn}\{f_n\} is a sequence that is Cauchy in mean:

    ∣∫Ff∣=∣∫Ffn∣+∣∫Ffn−∫f∣≤∣∫∪m=1kFmfn∣+∣∫∪m=1kFmfn−∫Ffn∣+∣∫Ffn−∫f∣≤∣∫∪m=1kFmf∣+∣∫∪m=1kFmf−∫∪m=1kFmfn∣+∣∫∪m=1kFmfn−∫Ffn∣+∣∫Ffn−∫f∣≤∣∑m=1k∫Fmf∣+ϵ+∣∫∪m=1kFmfn−∫Ffn∣+ϵ \begin{aligned} \left| \int_F f \right| &= \left| \int_F f_n \right| + \left| \int_F f_n - \int f \right| \\ &\le \left| \int_{\cup_{m=1}^k F_m} f_n \right| + \left| \int_{\cup_{m=1}^k F_m} f_n - \int_F f_n \right| + \left| \int_F f_n - \int f \right| \\ &\le \left| \int_{\cup_{m=1}^k F_m} f \right| + \left| \int_{\cup_{m=1}^k F_m} f - \int_{\cup_{m=1}^k F_m} f_n \right| + \left| \int_{\cup_{m=1}^k F_m} f_n - \int_F f_n \right| + \left| \int_F f_n - \int f \right| \\ &\le \left| \sum_{m=1}^k \int_{F_m} f \right| + \epsilon + \left| \int_{\cup_{m=1}^k F_m} f_n - \int_F f_n \right| + \epsilon \end{aligned}

    for large enough nn. The conclusion follows as m→∞m \rightarrow \infty.

    ■\blacksquare.

  9. If F1⊂F2⊂F3⊂...F_1 \subset F_2 \subset F_3 \subset ... is a sequence of increasing measurable sets and let F=∪nFnF = \cup_{n} F_n, then lim⁡n∫Fnf=∫Ff\lim_n \int_{F_n} f = \int_F f.
    Proof. Let Fn′=Fn−Fn−1F_n' = F_n - F_{n - 1}. The result follows immediately from the previous property.

    ■\blacksquare

  10. If F1⊃F2⊃F3⊃...F_1 \supset F_2 \supset F_3 \supset ... is a sequence of decreasing measurable sets and let F=∩nFnF = \cap_{n} F_n, then lim⁡n∫Fnf=∫Ff\lim_n \int_{F_n} f = \int_F f.
    Proof.
    Let Fn=Fn−Fn+1F_n = F_{n} - F_{n + 1} for n≥1n \ge 1 and F=∩nFnF = \cap_n F_n. Then F1=(∪nFn′)∪FF_1 = (\cup_{n} F_n') \cup F

    ∑n=1∞∫Fn′f+∫Ff=∫F1f \sum_{n = 1}^\infty \int_{F_n'} f + \int_F f = \int_{F_1} f

    The fact that ff is integrable implies ∫F1f<∞\int_{F_1} f < \infty. Hence

    ∫Ff=∫F1f−∑n=1∞∫Fn′f=lim⁡k(∫F1f−∑n=1k∫Fn′f)=lim⁡k∫Fk+1f \int_F f = \int_{F_1} f - \sum_{n = 1}^\infty \int_{F_n'} f = \lim_k \left(\int_{F_1} f - \sum_{n = 1}^k \int_{F_n'} f \right) = \lim_k \int_{F_{k + 1} } f

    ■\blacksquare

  11. Let ff be an integrable function. Then for ∀ϵ>0\forall \epsilon > 0, the set E={x∈X:f(x)>ϵ}E = \{ x \in X : f(x) > \epsilon \} has finite measure and μ(E)≤∫Efϵ\mu(E) \le \frac{\int_E f}{\epsilon}.
    Proof. Clearly EE is measurable. Further, consider the set F={x∈X:f(x)≠0}F = \{ x \in X : f(x) \neq 0 \}, which is σ\sigma finite. We can rewrite it as an increasing sequence of finite measurable set F1⊂F2⊂F3...F_1 \subset F_2 \subset F_3 ..., s.t., Fn↑FF_n \uparrow F. As μ(E∩Fn)≤∞\mu(E \cap F_n) \le \infty, ϵχE∩Fn\epsilon \chi_{E \cap F_n} is integrable. By monotonicity of integration,

    ϵμ(E∩Fn)=∫ϵχE∩Fn≤∫fχE∩Fn≤∫Ef<∞ \epsilon \mu(E \cap F_n) = \int \epsilon \chi_{E \cap F_n} \le \int f \chi_{E \cap F_n} \le \int_E f < \infty

    Now we see that μ(E∩Fn)≤∫fϵ\mu(E \cap F_n) \le \frac{\int f}{\epsilon }. Taking the limit of n→∞n \rightarrow \infty, we obtain the desired result.
    ■\blacksquare

Reference

  1. AVNER FRIEDMAN, Foundations of Modern Analysis