Outer Measure

Basis
Last updated: Tags: Measure Theory

You want a function that assigns a “size” to every subset of R\mathbb{R}. The σ-algebra told you which sets will ultimately be measurable, but before restricting to them you first build a preliminary size function — the outer measure — that is defined on all subsets. Its key virtue is that it is always well-defined; its key limitation is that it is only sub-additive, not fully additive. Fixing that limitation is exactly Carathéodory’s job in the next checkpoint.

The definition

The idea is to approximate the size of a set EE from the outside by covering it with open intervals and summing up their lengths. Taking the infimum over all countable covers gives the smallest possible total length needed to cover EE.

Definition. For any set ERE \subseteq \mathbb{R}, the Lebesgue outer measure of EE is

λ(E)    inf ⁣{k=1(bkak)  |  Ek=1(ak,bk)},(1)\lambda^*(E) \;\coloneqq\; \inf\!\left\{ \sum_{k=1}^{\infty} (b_k - a_k) \;\middle|\; E \subseteq \bigcup_{k=1}^{\infty} (a_k, b_k) \right\}, \tag{1}

where the infimum is over all countable collections of open intervals (ak,bk)(a_k, b_k) covering EE. If no finite bound exists, set λ(E)=+\lambda^*(E) = +\infty.

A few notational notes:

  • The intervals (ak,bk)(a_k, b_k) may overlap; bkakb_k - a_k is the length of the kk-th interval.
  • You are allowed to use the same interval more than once (though doing so only wastes coverage).
  • A finite cover is a special case of a countable cover (pad with empty intervals).

The same construction works on Rn\mathbb{R}^n using nn-dimensional boxes, or on any metric space using appropriate “elementary sets”, but for now you work in R\mathbb{R}.

Three fundamental properties

(i) Outer measure of the empty set is zero

λ()=0.(2)\lambda^*(\emptyset) = 0. \tag{2}

For any ε>0\varepsilon > 0, cover \emptyset with a single interval (0,ε)(0, \varepsilon) of length ε\varepsilon. Taking ε0\varepsilon \to 0 gives λ()0\lambda^*(\emptyset) \leq 0; since lengths are non-negative, λ()=0\lambda^*(\emptyset) = 0.

(ii) Monotonicity

If ABRA \subseteq B \subseteq \mathbb{R}, then

λ(A)λ(B).(3)\lambda^*(A) \leq \lambda^*(B). \tag{3}

Every countable cover of BB is also a countable cover of AA. Taking the infimum over covers of BB therefore gives a number that is already at least as large as λ(A)\lambda^*(A).

(iii) Countable sub-additivity

For any sequence of sets E1,E2,E3,RE_1, E_2, E_3, \ldots \subseteq \mathbb{R},

λ ⁣(k=1Ek)    k=1λ(Ek).(4)\lambda^*\!\left(\bigcup_{k=1}^{\infty} E_k\right) \;\leq\; \sum_{k=1}^{\infty} \lambda^*(E_k). \tag{4}

Proof sketch. If any λ(Ek)=+\lambda^*(E_k) = +\infty the inequality is trivial. Otherwise, fix ε>0\varepsilon > 0. For each kk, choose a countable cover of EkE_k by open intervals with total length at most λ(Ek)+ε/2k\lambda^*(E_k) + \varepsilon/2^k. The combined collection of all these intervals is a countable cover of kEk\bigcup_k E_k, with total length at most

k=1 ⁣(λ(Ek)+ε2k)=k=1λ(Ek)+ε.\sum_{k=1}^{\infty}\!\left(\lambda^*(E_k) + \frac{\varepsilon}{2^k}\right) = \sum_{k=1}^{\infty} \lambda^*(E_k) + \varepsilon.

Since ε\varepsilon is arbitrary, (4)(4) follows.

These three properties — normalization (2)(2), monotonicity (3)(3), and countable sub-additivity (4)(4) — are the defining axioms of an outer measure in the abstract sense. Any function μ ⁣:2X[0,+]\mu^* \colon 2^X \to [0, +\infty] satisfying them on a set XX is called an outer measure on XX.

Outer measure agrees with length on intervals

A basic sanity check: for a bounded closed interval [a,b][a, b],

λ([a,b])=ba.(5)\lambda^*([a, b]) = b - a. \tag{5}

Upper bound. Cover [a,b][a, b] with the single interval (aε,b+ε)(a - \varepsilon, b + \varepsilon) to get λ([a,b])ba+2ε\lambda^*([a,b]) \leq b - a + 2\varepsilon; take ε0\varepsilon \to 0.

Lower bound. Any open cover of [a,b][a, b] has a finite sub-cover (Heine–Borel). Summing the lengths of a finite cover of [a,b][a, b] yields at least bab - a (a standard argument by induction on the number of overlapping intervals). Since every countable cover contains such a finite sub-cover, the infimum is at least bab - a.

Together, λ([a,b])=ba\lambda^*([a,b]) = b - a. The same argument gives λ((a,b))=λ([a,b))=ba\lambda^*((a,b)) = \lambda^*([a,b)) = b - a for open and half-open intervals.

Why countable additivity fails

Outer measure satisfies sub-additivity (4)(4), but it does not satisfy countable additivity on all subsets. The Vitali set VV from Introduction to Measure is the witness: the translates VqV+qV_q \coloneqq V + q (for qQ[1,1]q \in \mathbb{Q} \cap [-1, 1]) are pairwise disjoint, and

[0,1]    qQ[1,1]Vq    [1,2].[0,1] \;\subseteq\; \bigcup_{q \in \mathbb{Q} \cap [-1,1]} V_q \;\subseteq\; [-1, 2].

Monotonicity gives 1λ ⁣(qVq)31 \leq \lambda^*\!\left(\bigcup_q V_q\right) \leq 3. Since all VqV_q are translates of VV, they all have the same outer measure. If countable additivity held, the sum would be either 00 (if λ(V)=0\lambda^*(V) = 0) or ++\infty (if λ(V)>0\lambda^*(V) > 0) — neither of which lies in [1,3][1, 3]. Contradiction.

The conclusion: outer measure is the best you can do on all subsets of R\mathbb{R}. To obtain true additivity you must restrict to a suitable sub-collection — the measurable sets, identified by Carathéodory’s criterion.

Summary

  • The Lebesgue outer measure λ(E)\lambda^*(E) is defined in equation (1)(1) as the infimum of total interval lengths over countable open covers of EE.
  • It satisfies: λ()=0\lambda^*(\emptyset) = 0 (equation (2)(2)), monotonicity (equation (3)(3)), and countable sub-additivity (equation (4)(4)).
  • These three properties are the abstract definition of an outer measure; λ\lambda^* is an outer measure on R\mathbb{R}.
  • On intervals, λ\lambda^* agrees with ordinary length — equation (5)(5).
  • Countable additivity fails on all subsets: the Vitali set shows that no consistent, translation-invariant, countably additive measure can live on 2R2^{\mathbb{R}}.
  • The fix is Carathéodory’s criterion: identify which sets split every test set additively, and restrict λ\lambda^* to those sets.