Alphabeta Math
RemarkSession-authored (Fable 5 assisted) sources checked 2026-07-26 not proved here
Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Egorov's theorem

Statement

Let (X,A,μ)(X, \mathcal{A}, \mu) be a measure space with μ(X)<\mu(X) < \infty, and let fn,f:XRf_n, f : X \to \mathbb{R} be measurable with fnff_n \to f pointwise almost everywhere. Then for every ε>0\varepsilon > 0 there is a measurable EXE \subseteq X with

μ(XE)<εandfnf uniformly on E.\mu(X \setminus E) < \varepsilon \qquad \text{and} \qquad f_n \to f \text{ uniformly on } E.

The finiteness of μ(X)\mu(X) is essential: on R\mathbb{R} with Lebesgue measure, fn=1[n,n+1]0f_n = \mathbf{1}_{[n, n+1]} \to 0 pointwise, but on any set whose complement has finite measure the convergence is not uniform. The conclusion cannot be improved to ε=0\varepsilon = 0: convergence is in general not uniform off a null set, as fn=xnf_n = x^n on [0,1][0,1] shows.

Remarks

Not proved in this library. It is recorded with citations and used in no proof here.

What would prove it. Countable subadditivity and continuity from above of a finite measure, applied to the sets En,k=mn{fmf1/k}E_{n,k} = \bigcup_{m \ge n} \{ |f_m - f| \ge 1/k \}: each decreases in nn to a null set, so some Enk,kE_{n_k, k} has measure below ε2k\varepsilon 2^{-k}, and the complement of their union works. The argument is short but is entirely about the measure, which this library does not have (Lebesgue measure and the Lebesgue integral ). Continuity from above is where μ(X)<\mu(X) < \infty is spent.

Which page it serves. The uniform convergence page. That page proves what uniform convergence buys, and it can exhibit sequences that converge pointwise but not uniformly; Egorov is the theorem that says the failure is always confined to a small set, and it is the standard bridge from pointwise hypotheses to uniform conclusions. It is also the usual route to Lusin's theorem (Lusin's theorem ).

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 1 result over 1 level. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources