Keyboard shortcuts

Press or to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Measure Theory

The Riemann integral of riemann-integral.md and the Jordan content of multiple-integrals.md both measure sets by approximating them with finitely many boxes. That is enough for the path to Stokes' theorem, but it leaves two debts outstanding: the phrase "measure zero" used in Lebesgue's criterion (§3 of both pages) has never been defined, and no notion of length/area/volume in this spine is stable under countable operations.

This page pays the first debt. We build the general notion of a measure — a countably additive set function on a -algebra — construct Lebesgue measure on via Carathéodory's extension theorem, and prove the uniqueness theorem () that makes measures cheap to identify. The Lebesgue integral is built on top of it, and probability is the special case .

References: Rudin, Real and Complex Analysis, ch. 1–2; Folland, Real Analysis, ch. 1; Tao, An Introduction to Measure Theory.

1. Why Not Measure Every Set?

The naive goal is a function assigning a "volume" to every subset, with three properties one would not want to give up:

  1. Countable additivity. for pairwise disjoint .
  2. Translation invariance. .
  3. Normalization. .

Theorem (no total measure). For no such exists.

The proof — Vitali's construction of a non-measurable set — is deferred to non-measurable.md, because it is really a statement about the axiom of choice rather than about analysis. Its consequence, though, dictates the design of everything below: we must give up (0) "every subset". Measure theory is the discipline of specifying, in advance, a family of sets we promise to measure — and that family must be closed under exactly the operations we intend to perform.

Why countable additivity in particular? Finite additivity alone is achievable on all subsets (in dimensions 1 and 2, via Banach limits), but it is useless for analysis: every limit theorem — monotone convergence, dominated convergence, the continuity of along increasing sequences — is a countable statement. The whole point of the Lebesgue theory is to exchange limits and integrals, and that exchange is countable additivity in disguise.

2. -Algebras

Definition (-algebra). A collection of subsets of a set is a -algebra if

  1. ;
  2. (complements);
  3. (countable unions).

The pair is a measurable space; members of are measurable sets.

De Morgan gives countable intersections for free, and . Note the asymmetry with a topology: a -algebra is closed under complement but only countable union, a topology under arbitrary union but not complement.

Two extremes always exist: and . Between them, the useful construction is generation.

Definition (generated -algebra). For , is the intersection of all -algebras containing — the smallest one containing .

The intersection of any family of -algebras is a -algebra (check the three axioms pointwise), and is always available, so is well defined. It is defined "from above", by intersection; there is in general no description of its members from below, as sets built from in countably many steps. That is why §4 below (the theorem) matters so much: it is the standard substitute for the induction one cannot do.

Definition (Borel -algebra). For a topological space , . On , is generated equally by the open intervals, the closed intervals, or the rays .

Proof of the last claim. Each ray is closed, hence Borel; conversely , and every open subset of is a countable union of open intervals (metric-spaces.md §2), so .

Borel sets include everything encountered in practice — open, closed, , , and every set obtainable from them by countable Boolean operations — but the class is much larger than that hierarchy suggests, and its structure is a descriptive-set-theory question rather than an analytic one.

3. Measures

Definition (measure). A measure on is a function with that is countably additive: for pairwise disjoint ,

is a measure space. It is finite if , -finite if with , and a probability space if .

Values in are genuinely allowed; the arithmetic convention is standard and makes the integral of §15 behave.

Proposition (elementary properties). For :

  • Monotonicity. .
  • Countable subadditivity. , without disjointness.
  • Continuity from below. .
  • Continuity from above. and .

Proof. Monotonicity: . Subadditivity: disjointify, , so with . Continuity from below: apply countable additivity to the disjoint pieces and recognize the partial sums as . Continuity from above: apply the previous item to .

The finiteness hypothesis in the last item is not decorative: on with Lebesgue measure, has for all while .

Definition (null set, a.e.). is -null if and . A property holds almost everywhere (a.e.) if the set where it fails is contained in a null set.

This is the definition the Riemann theory borrowed on credit: the discontinuity set in Lebesgue's criterion (riemann-integral.md §3, multiple-integrals.md §2) is required to be null for , and the criterion is proved in lebesgue-integral.md §6.

A measure space is complete if every subset of a null set is measurable (and null). Countable additivity does not deliver this — a subset of a Borel null set need not be Borel — but every measure has a completion , with ; the definition is forced and the check that it is well posed is routine.

4. Uniqueness: the Theorem

Because has no constructive description, one cannot verify a claim about all its members by induction. Dynkin's theorem supplies the missing induction principle, and is used constantly (in probability, it is the tool for proving that two laws agree).

Definitions. is a -system if it is closed under finite intersection. is a -system (Dynkin system) if , it is closed under proper differences (, both in ), and closed under increasing countable unions.

Theorem (Dynkin ). If a -system contains a -system , it contains .

Sketch. Let be the smallest -system containing . One shows is closed under intersection — first that is a -system containing , hence all of ; then the same trick with replaced by an arbitrary element of . A -system closed under intersection is a -algebra, so .

Corollary (uniqueness of measures). Let be a -system with , and suppose with and . If on , then on .

Proof. For fixed of finite measure, is a -system containing ; apply the theorem, then let using continuity from below.

So a measure on is pinned down by its values on intervals, and a probability distribution by its CDF — the fact that makes distribution functions a legitimate substitute for measures in random-variables.md.

5. Construction: Outer Measures and Carathéodory

Uniqueness is settled; existence is the harder half. The standard route builds a crude, everywhere-defined but merely subadditive object, then carves out the sets on which it behaves.

Definition (outer measure). with , monotone, and countably subadditive.

Outer measures are easy to produce: given any family covering and any ,

is one. The cost is that is not additive. Carathéodory's insight was that additivity can be imposed as a definition of which sets are measurable.

Definition (Carathéodory measurable). is -measurable if for every test set ,

is measurable iff it splits every set additively — "" always holds by subadditivity, so only "" is a condition.

Theorem (Carathéodory). The -measurable sets form a -algebra , and restricted to is a complete measure.

Sketch. Complementation is symmetric in the definition; finite unions follow by applying the splitting condition twice with well-chosen test sets; countable additivity comes from applying the finite case to and passing to the limit with subadditivity. Any set of outer measure zero splits everything trivially, giving completeness.

Theorem (Carathéodory extension). Let be an algebra (closed under complement and finite union) and a premeasure (-additive whenever a countable disjoint union happens to lie in ). Then extends to a measure on ; if is -finite the extension is unique.

Existence is the outer measure generated by ; uniqueness is §4 applied to the -system .

6. Lebesgue Measure on

Take = half-open boxes with , the elementary volume already used for Jordan content (multiple-integrals.md §1). Finite disjoint unions of boxes form an algebra, is a premeasure on it (the only real work is countable additivity, which follows from compactness of closed boxes plus a Heine–Borel argument, metric-spaces.md §4), and Carathéodory delivers:

Definition/Theorem (Lebesgue measure). There is a unique complete, translation-invariant measure on a -algebra with . Its restriction to is the unique Borel measure with that property, and is the completion of .

Basic consequences:

  • Points and countable sets are null: , so . Hence " is small" in measure while being topologically dense — the two notions of smallness are independent.
  • Regularity. for . This is what lets one transfer topological arguments to measurable sets.
  • Behaviour under affine maps. for linear — the measure-theoretic form of the Jacobian factor in the change-of-variables theorem (multiple-integrals.md §4).
  • The Cantor set is uncountable, compact, and null: "measure zero" is strictly weaker than "countable". It is also nowhere dense, but there are fat Cantor sets which are nowhere dense with positive measure, so the two smallness notions dissociate in both directions.

Jordan vs. Lebesgue. Jordan content approximates from inside and outside with finitely many boxes; a set is Jordan measurable iff its topological boundary is null. has Jordan inner content and outer content — not Jordan measurable — but is Lebesgue-null. Every Jordan-measurable set is Lebesgue measurable with the same content, so nothing proved in multiple-integrals.md is disturbed; the theory is strictly extended, not revised.

7. Measurable Functions

Integration needs maps that pull measurable questions back to measurable sets.

Definition. is measurable if for all . For real-valued we always take (or for extended values).

Proposition (generator criterion). If it suffices that for — because is a -algebra.

Hence is measurable iff for all , and every continuous function on a topological space is Borel measurable.

The class is closed under everything analysis does:

  • , , , , are measurable;
  • , , , are measurable (this is exactly where countable unions are consumed: );
  • consequently a pointwise limit of measurable functions is measurable.

That last item is the decisive advantage over the Riemann theory, where a pointwise limit of integrable functions need not be integrable (riemann-integral.md §7).

Theorem (simple approximation). For measurable there are simple functions (finite-valued measurable, ) with pointwise, uniformly on any set where is bounded.

Construction. : chop the range into dyadic layers. That the layers are cut in the range rather than the domain is the one-sentence summary of the whole Lebesgue theory, and is the starting point of lebesgue-integral.md.

8. Where This Is Used

  • The Lebesgue integral built from §7's simple functions, with the convergence theorems.
  • Product measures and Fubini, i.e. when iterated integrals may be exchanged.
  • Non-measurable sets — the theorem promised in §1, and the role of the axiom of choice.
  • Probability — a probability space is a measure space with ; -algebras there carry the extra reading "information available".
  • Functional analysis — the spaces, whose completeness (Riesz–Fischer) needs the convergence theorems.