TheoremComplete

Measurable Functions - Main Theorem

TheoremEgorov's Theorem

Let (X,F,μ)(X, \mathcal{F}, \mu) be a finite measure space (i.e., μ(X)<\mu(X) < \infty). Let {fn}\{f_n\} be a sequence of measurable functions converging pointwise almost everywhere to a measurable function ff.

Then for every ϵ>0\epsilon > 0, there exists a measurable set EXE \subseteq X such that:

  1. μ(E)<ϵ\mu(E) < \epsilon
  2. fnff_n \to f uniformly on EcE^c

In other words, pointwise convergence almost everywhere implies uniform convergence except on a set of arbitrarily small measure.

Egorov's Theorem bridges pointwise and uniform convergence. It shows that on finite measure spaces, pointwise convergence a.e. is "almost" uniform convergence - we only need to remove a small exceptional set.

ExampleApplication to Function Sequences

Consider fn(x)=xnf_n(x) = x^n on [0,1][0, 1] with Lebesgue measure. We have fn0f_n \to 0 pointwise on [0,1)[0, 1) and fn(1)=1f_n(1) = 1.

Given ϵ>0\epsilon > 0, Egorov's theorem guarantees a set EE with λ(E)<ϵ\lambda(E) < \epsilon such that convergence is uniform on [0,1]E[0, 1] \setminus E.

We can take E=[1δ,1]E = [1 - \delta, 1] for appropriate δ\delta. On [0,1δ][0, 1 - \delta], we have xn(1δ)n0x^n \leq (1-\delta)^n \to 0 uniformly, confirming the theorem.

Remark

Important observations about Egorov's Theorem:

  1. Finiteness is essential: The theorem fails for infinite measure spaces. On R\mathbb{R} with Lebesgue measure, consider fn=χ[n,n+1]f_n = \chi_{[n, n+1]}. Then fn0f_n \to 0 pointwise everywhere, but for uniform convergence on a set FF, we need FF to miss infinitely many intervals, so λ(Fc)=\lambda(F^c) = \infty.

  2. Relationship to integration: Egorov's theorem helps prove that convergence in measure follows from pointwise convergence on finite measure spaces.

  3. Lusin's theorem complement: While Lusin's theorem makes measurable functions "nearly continuous," Egorov's theorem makes convergent sequences "nearly uniformly convergent."

The proof uses the fact that if fnff_n \to f pointwise, then for each kk, the sets EkN=n=N{x:fn(x)f(x)1/k}E_k^N = \bigcup_{n=N}^{\infty} \{x : |f_n(x) - f(x)| \geq 1/k\} decrease to measure zero as NN \to \infty. We can choose NkN_k so that μ(EkNk)<ϵ/2k\mu(E_k^{N_k}) < \epsilon/2^k, and take E=kEkNkE = \bigcup_k E_k^{N_k}.