Alphabeta Math
Remark‡ 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.

Lusin's theorem

Statement

Let E⊆Rn be measurable with λn(E)<∞ and let f:E→R be measurable. Then for every ε>0 there is a closed set K⊆E with

λn(E∖K)<εandf∣K continuous.

K may be taken compact when E is bounded, and f∣K extends to a continuous function on all of Rn by Tietze. The assertion is about the restriction f∣K and not about continuity of f at the points of K: the Dirichlet function 1Q is nowhere continuous on R, yet its restriction to the closed set R∖U, where U is an open set of measure below ε containing Q, is identically zero and so continuous.

Remarks

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

What would prove it. Regularity of Lebesgue measure, which supplies closed sets from inside and open sets from outside, applied to the preimages of a countable base of intervals, plus Egorov's theorem (Egorov's theorem ‡) in the version where a measurable function is an almost everywhere limit of simple functions. Both ingredients are measure-theoretic (Lebesgue measure and the Lebesgue integral ‡).

Which page it serves. The continuity page and the uniform convergence page, where the question "how badly can a function fail to be continuous" is answered only for specific examples (Dirichlet, Thomae, Volterra). Lusin's theorem is the general answer: measurability is exactly continuity after deleting a set of arbitrarily small measure, which is Littlewood's second principle. It also belongs beside the Riesz-Markov-Kakutani theorem (Riesz-Markov-Kakutani representation theorem ‡), since both express that continuous functions are dense in the measurable world.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · one level

2 results within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources