Skip to content

Measurable Functions | Mathematics

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

Proposition 5.1. f:XRf : X \to \mathbb{R} is measurable if and only if f1((a,))Ff^{-1}((a, \infty)) \in \mathcal{F} for every aRa \in \mathbb{R}.

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

Proposition 5.2. Compositions of measurable functions are measurable.

Proposition 5.3. If f,g:XRf, 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 aiRa_i \in \mathbb{R} and AiFA_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 0s1s20 \leq s_1 \leq s_2 \leq \cdots converging pointwise to ff.

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

sn(x)={k12nif k12nf(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, snsn+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:XRf_n : X \to \mathbb{R} be measurable functions converging pointwise to ff a.e. Then for every ε>0\varepsilon > 0, there exists AFA \in \mathcal{F} with μ(A)<ε\mu(A) < \varepsilon such that fnff_n \to f uniformly on XAX \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 fKf|_K is continuous.

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

limnμ({x:fn(x)f(x)ε})=0\lim_{n \to \infty} \mu(\{x : |f_n(x) - f(x)| \geq \varepsilon\}) = 0

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

Proof. For any ε>0\varepsilon > 0, let En=kn{fkfε}E_n = \bigcup_{k \geq n} \{|f_k - f| \geq \varepsilon\}. Then En+1EnE_{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 μ({fnfε})0\mu(\{|f_n - f| \geq \varepsilon\}) \to 0. \blacksquare

The converse is false but there is a partial converse:

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

Definition. For 1p<1 \leq p < \infty, fnff_n \to f in Lp(μ)L^p(\mu) if:

fnfpdμ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: μ({fnfε})1εpfnfpdμ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 fn0f_n \to 0 a.e. but fn=1\int f_n = 1, so fn0f_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 gfg \circ f is measurable.

Solution. For any open set URU \subseteq \mathbb{R}, (gf)1(U)=f1(g1(U))(g \circ f)^{-1}(U) = f^{-1}(g^{-1}(U)). Since gg is continuous, g1(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 fnff_n \to f pointwise, then {x:f(x)>a}=m=1n=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 AnFA_n \in \mathcal{F} and AnAA_n \uparrow A (i.e., AnAn+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 AnFA_n \in \mathcal{F} and AnAA_n \downarrow A with μ(A1)<\mu(A_1) < \infty, then μ(An)μ(A)\mu(A_n) \to \mu(A). This is continuity from above.

flowchart TD
A[5_Measurable Functions] --> B[Key Concepts]
A --> C[Core Principles]
A --> D[Practical Applications]
B --> E[Fundamental definitions]
C --> F[Design patterns]
D --> G[Real-world usage]

Measurable functions are the functions that play nicely with measure theory — they are built from simple functions by taking limits. Simple functions (finite linear combinations of indicator functions) are the “pixels” of measurable functions, approximating any function from below. The Borel σ\sigma-algebra is generated by open sets, ensuring that limits of measurable functions remain measurable. The layer cake representation decomposes a function into horizontal slices: the integral equals the integral of the measures of the superlevel sets. This viewpoint converts questions about functions into questions about sets, which is often easier. Convergence in measure is weaker than pointwise convergence but more robust for passing to limits.

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

Xfdμ=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 fnff_n \to f in LpL^p, then fnff_n \to f in measure, but the converse does not hold. Construct a counterexample.

Mistake 1: Assuming convergence in measure implies pointwise convergence Convergence in measure only guarantees an a.e.\ convergent subsequence, not that the original sequence converges pointwise. The typewriter sequence (moving indicator functions) converges in measure to 00 on [0,1][0,1] but diverges pointwise everywhere. Students often conflate these two modes of convergence.

Mistake 2: Forgetting that Egorov’s theorem requires a finite measure space Egorov’s theorem states that pointwise a.e.\ convergence implies uniform convergence outside a set of small measure, but this requires μ(X)<\mu(X) < \infty. On R\mathbb{R} with Lebesgue measure, fn=χ[n,n+1]f_n = \chi_{[n, n+1]} converges pointwise to 00 but Egorov’s theorem fails because the measure space is infinite.

Mistake 3: Assuming that measurable functions are continuous or have nice properties Measurable functions can be highly discontinuous — in fact, a function is measurable if and only if it is a pointwise limit of simple functions. Students sometimes assume measurability implies continuity or boundedness, which is false. The indicator function of the rationals is measurable but discontinuous everywhere.

This section provides detailed coverage of advanced concepts, including full derivations, proofs, and extended examples.

Complete mathematical derivations and proofs are provided where appropriate. Each step is explained to ensure understanding of the underlying reasoning.

Advanced examples demonstrate the application of concepts to complex problems. These examples go beyond standard exam questions to develop deeper understanding.

This material connects to current research and advanced applications in the field. Understanding these connections provides context for the study material.

Ensure you have mastered the prerequisite material before attempting this advanced content.