logo

Vitali Convergence Theorem 📂Measure Theory

Vitali Convergence Theorem

Theorem 1

Let’s assume that a measure space (X,E,μ)( X , \mathcal{E} , \mu) is given.

When we say 1p<1 \le p < \infty, the sequence of functions {fn}nNLp\left\{ f_{n} \right\}_{n \in \mathbb{N}} \subset \mathcal{L}^{p} converging to ff in Lp\mathcal{L}_{p} is equivalent to the necessity and sufficiency of all three conditions being satisfied:

  • (i): {fn}\left\{ f_{n} \right\} converges in measure to ff.
  • (ii): {fnp}\left\{ | f_{n} |^{p} \right\} is uniformly integrable.
  • (iii): For all ε>0\varepsilon > 0, FEFE=    Ffnpdμ<εpnN F \in \mathcal{E} \land F \cap E = \emptyset \implies \int_{F} | f_{n} |^{p} d \mu < \varepsilon^{p} \qquad \forall n \in \mathbb{N} is satisfied, and there exists EEE \in \mathcal{E} such that μ(E)<\mu (E) < \infty.

Description

  • (iii): This might sound complicated, but EE needs to be dependent on some ε>0\varepsilon>0 such that it can be expressed as E=EεE = E_{\varepsilon} without being too large to satisfy μ(E)<\mu (E) < \infty. There must exist EεE_{\varepsilon} small enough not to overlap with a sufficiently large FF that satisfies Ffnpdμ<εp\displaystyle \int_{F} | f_{n} |^{p} d \mu < \varepsilon^{p}.
    In fact, as long as the inequality is satisfied, EE can grow indefinitely without any issue. Therefore, this condition is trivially met if the measure μ\mu is a finite measure. Since μ(X)<\mu (X) < \infty for the entire space XX, setting Eε=XE_{\varepsilon} = X means there’s only one measurable set that doesn’t overlap, which is E\emptyset \in \mathcal{E}, and so fnpdμ=0\displaystyle \int_{\emptyset} | f_{n} |^{p} d \mu = 0 makes it unnecessary to check the condition.

20191028\_102403.png

An example of a finite measure is probability PP. In the theory of probability, Vitali’s convergence theorem becomes one that extends the notion of convergence to Lp\mathcal{L}_{p} by adding the criterion of uniform integrability.


  1. Bartle. (1995). The Elements of Integration and Lebesgue Measure: p76. ↩︎