Skip to content

Measurable Functions

Let (X,F)(X, \mathcal{F}) and (Y,G)(Y, \mathcal{G}) be measurable spaces. A function f:X→Yf : X \to Y is measurable if f−1(G)∈Ff^{-1}(G) \in \mathcal{F} for every G∈GG \in \mathcal{G}. When Y=RY = \mathbb{R}, we equip R\mathbb{R} with B(R)\mathcal{B}(\mathbb{R}).

Proposition 5.1. f:X→Rf : X \to \mathbb{R} is measurable if and only if f−1((a,∞))∈Ff^{-1}((a, \infty)) \in \mathcal{F} for every a∈Ra \in \mathbb{R}.

Proof. Since (a,∞)(a, \infty) generates B(R)\mathcal{B}(\mathbb{R}), the σ\sigma-algebra f−1(B(R))f^{-1}(\mathcal{B}(\mathbb{R})) equals the σ\sigma-algebra generated by f−1((a,∞))f^{-1}((a, \infty)). ■\blacksquare

Proposition 5.2. Compositions of measurable functions are measurable.

Proposition 5.3. If f,g:X→Rf, g : X \to \mathbb{R} are measurable, then f+gf + g, fgfg, f/gf/g (when defined), ∣f∣|f|, max⁡(f,g)\max(f, g), and min⁡(f,g)\min(f, g) are all measurable.

A simple function is a finite linear combination of indicator functions:

s(x)=∑i=1naiχAi(x)s(x) = \sum_{i=1}^{n} a_i \chi_{A_i}(x)

where ai∈Ra_i \in \mathbb{R} and Ai∈FA_i \in \mathcal{F} are measurable sets.

Theorem 5.4 (Approximation Theorem). For every non-negative measurable function f:X→[0,∞]f : X \to [0, \infty], there exists an increasing sequence of simple functions 0≤s1≤s2≤⋯0 \leq s_1 \leq s_2 \leq \cdots converging pointwise to ff.

Proof. For each nn, partition [0,n)[0, n) into n⋅2nn \cdot 2^n subintervals of length 2−n2^{-n}. Define

sn(x)={k−12nif k−12n≤f(x)<k2n, k=1,…,n2nnif f(x)≥ns_n(x) = \begin{cases} \frac{k-1}{2^n} & \text{if } \frac{k-1}{2^n} \leq f(x) < \frac{k}{2^n},\ k = 1, \ldots, n2^n \\ n & \text{if } f(x) \geq n \end{cases}

Each sns_n is a simple function, sn≤sn+1s_n \leq s_{n+1}, and sn(x)→f(x)s_n(x) \to f(x) for every xx. ■\blacksquare

5.3 Egorov’s Theorem and Lusin’s Theorem

Section titled “5.3 Egorov’s Theorem and Lusin’s Theorem”

Theorem 5.5 (Egorov’s Theorem). Let (X,F,μ)(X, \mathcal{F}, \mu) be a finite measure space and let fn:X→Rf_n : X \to \mathbb{R} be measurable functions converging pointwise to ff a.e. Then for every ε>0\varepsilon > 0, there exists A∈FA \in \mathcal{F} with μ(A)<ε\mu(A) < \varepsilon such that fn→ff_n \to f uniformly on X∖AX \setminus A.

Theorem 5.6 (Lusin’s Theorem). Let f:[a,b]→Rf : [a, b] \to \mathbb{R} be Lebesgue measurable. Then for every ε>0\varepsilon > 0, there exists a compact set K⊆[a,b]K \subseteq [a, b] with m([a,b]∖K)<εm([a, b] \setminus K) < \varepsilon such that f∣Kf|_K is continuous.

Definition. A sequence of measurable functions fnf_n converges in measure to ff if for every ε>0\varepsilon > 0:

lim⁡n→∞μ({x:∣fn(x)−f(x)∣≥ε})=0\lim_{n \to \infty} \mu(\{x : |f_n(x) - f(x)| \geq \varepsilon\}) = 0

Theorem 5.7. If fn→ff_n \to f a.e. on a finite measure space, then fn→ff_n \to f in measure.

Proof. For any ε>0\varepsilon > 0, let En=⋃k≥n{∣fk−f∣≥ε}E_n = \bigcup_{k \geq n} \{|f_k - f| \geq \varepsilon\}. Then En+1⊆EnE_{n+1} \subseteq E_n and μ(⋂nEn)=0\mu(\bigcap_n E_n) = 0 by a.e. convergence. By continuity from above, μ(En)→0\mu(E_n) \to 0, hence μ({∣fn−f∣≥ε})→0\mu(\{|f_n - f| \geq \varepsilon\}) \to 0. ■\blacksquare

The converse is false but there is a partial converse:

Theorem 5.8. If fn→ff_n \to f in measure, then there exists a subsequence fnkf_{n_k} converging to ff a.e.

Definition. For 1≤p<∞1 \leq p < \infty, fn→ff_n \to f in Lp(μ)L^p(\mu) if:

∫∣fn−f∣p dμ→0as n→∞\int |f_n - f|^p \, d\mu \to 0 \quad \text{as } n \to \infty

Proposition 5.9. Convergence in LpL^p implies convergence in measure.

Proof. By Chebyshev’s inequality: μ({∣fn−f∣≥ε})≤1εp∫∣fn−f∣p dμ→0\mu(\{|f_n - f| \geq \varepsilon\}) \leq \frac{1}{\varepsilon^p} \int |f_n - f|^p \, d\mu \to 0. ■\blacksquare

Proposition 5.10. Convergence a.e. does not imply convergence in LpL^p, and vice versa.

Example. fn=nχ(0,1/n)f_n = n\chi_{(0, 1/n)} on [0,1][0, 1] with Lebesgue measure. Then fn→0f_n \to 0 a.e. but ∫fn=1\int f_n = 1, so fn↛0f_n \nrightarrow 0 in L1L^1.

The relationships between convergence modes (on a finite measure space) are:

  1. Uniform convergence   ⟹  \implies pointwise convergence   ⟹  \implies a.e. convergence.
  2. A.e. convergence (on finite measure)   ⟹  \implies convergence in measure.
  3. LpL^p convergence   ⟹  \implies convergence in measure.
  4. Convergence in measure   ⟹  \implies existence of a.e. convergent subsequence.

Problem 1. Show that if ff is measurable and gg is continuous, then g∘fg \circ f is measurable.

Solution. For any open set U⊆RU \subseteq \mathbb{R}, (g∘f)−1(U)=f−1(g−1(U))(g \circ f)^{-1}(U) = f^{-1}(g^{-1}(U)). Since gg is continuous, g−1(U)g^{-1}(U) is open, hence Borel. Since ff is measurable, the preimage is in F\mathcal{F}. ■\blacksquare

Problem 2. Prove that the pointwise limit of measurable functions is measurable.

Solution. If fn→ff_n \to f pointwise, then {x:f(x)>a}=⋃m=1∞⋂n=m∞{x:fn(x)>a+1/m}\{x : f(x) > a\} = \bigcup_{m=1}^\infty \bigcap_{n=m}^\infty \{x : f_n(x) > a + 1/m\}. Each inner set is measurable, so the countable union/intersection is measurable. ■\blacksquare

Problem 3. Construct an example of convergence in measure but not a.e.

Solution. Let X=[0,1]X = [0, 1] with Lebesgue measure. Arrange indicator functions of intervals [0,1],[0,1/2],[1/2,1],[0,1/3],[1/3,2/3],[2/3,1],…[0, 1], [0, 1/2], [1/2, 1], [0, 1/3], [1/3, 2/3], [2/3, 1], \ldots For each xx, fn(x)=1f_n(x) = 1 infinitely often and 00 infinitely often, so no pointwise convergence. But μ({fn=1})→0\mu(\{f_n = 1\}) \to 0, so convergence in measure holds. ■\blacksquare

Proposition 5.11. If An∈FA_n \in \mathcal{F} and An↑AA_n \uparrow A (i.e., An⊆An+1A_n \subseteq A_{n+1} and ⋃An=A\bigcup A_n = A), then μ(An)→μ(A)\mu(A_n) \to \mu(A). This is continuity from below.

Proposition 5.12. If An∈FA_n \in \mathcal{F} and An↓AA_n \downarrow A with μ(A1)<∞\mu(A_1) < \infty, then μ(An)→μ(A)\mu(A_n) \to \mu(A). This is continuity from above.

Theorem 5.13 (Layer Cake Representation). For a non-negative measurable function ff:

∫Xf dμ=∫0∞μ({x:f(x)>t}) dt\int_X f\, d\mu = \int_0^\infty \mu(\{x : f(x) > t\})\, dt

This formula is useful for computing integrals and for proving inequalities such as Chebyshev’s and the Marcinkiewicz interpolation theorem.

Problem 4. Prove the layer cake representation using Fubini’s theorem.

Problem 5. Show that if fn→ff_n \to f in LpL^p, then fn→ff_n \to f in measure, but the converse does not hold. Construct a counterexample.