Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

Measure

Measure and integration theory develops the necessary tool for solving PDEs and stochastic processes.

σ\sigma-Algebra

Motivation

In physics, the task of finiding “volume” is ubquitous. For instance in computing mass, charge, the integral would resemble:

∫(⋅)dV\int (\cdot ) dV

In some sense, this dVdV is a function dV:E→RdV:E\to \mathbb{R} which computes the volume of E⊂RnE\subset \mathbb{R}^n, a tiny control volume we are interested in. It would be very natural to ask for this function to satisfy:

The question would be, when can we find such a function. Trivially we can obtain such property by sending every AA to 0. However, for more practical purposes of modeling the world, we would like nicer properties. In particular, let’s consider this compeletly reasonable demand on Rn\mathbb{R}^n.

Solution to Exercise 1
  1. We prove that T(B)\mathcal{T}(\mathcal{B}) is a topology on R\mathbb{R}.

  • Property 1: ∅,R∈T(B)\emptyset, \mathbb{R} \in \mathcal{T}(\mathcal{B})

    • ∅=∪B∈∅B\emptyset = \cup_{B \in \emptyset} B (empty union), so ∅∈T(B)\emptyset \in \mathcal{T}(\mathcal{B})

    • R=(−∞,∞)\mathbb{R} = (-\infty, \infty) is a generalized open interval, hence R∈T(B)\mathbb{R} \in \mathcal{T}(\mathcal{B}). More explicitly, we can cover it by ∪a=0∞{(a,a+1),(−a−1,−a)}\cup_{a=0}^{\infty} \{(a,a+1),(-a-1,-a)\}

  • Property 2: Closed under arbitrary unions

    • Let U⊆T(B)\mathcal{U} \subseteq \mathcal{T}(\mathcal{B}) be an arbitrary collection of sets in T(B)\mathcal{T}(\mathcal{B}). For each U∈UU \in \mathcal{U}, we have U=∪B∈BUBU = \cup_{B \in \mathcal{B}_U} B for some BU⊆B\mathcal{B}_U \subseteq \mathcal{B}. Then ∪U∈UU=∪U∈U(∪B∈BUB)=∪B∈∪U∈UBUB\cup_{U \in \mathcal{U}} U = \cup_{U \in \mathcal{U}} \left(\cup_{B \in \mathcal{B}_U} B\right) = \cup_{B \in \cup_{U \in \mathcal{U}} \mathcal{B}_U} B. Since ∪U∈UBU⊆B\cup_{U \in \mathcal{U}} \mathcal{B}_U \subseteq \mathcal{B}, we have ∪U∈UU∈T(B)\cup_{U \in \mathcal{U}} U \in \mathcal{T}(\mathcal{B})

  • Property 3: Closed under finite intersections

    • By induction on the number nn of sets.

    • Base case (n=1n=1): Trivial, U∈T(B)U \in \mathcal{T}(\mathcal{B}).

    • Inductive step: Assume U1∩⋯∩Un∈T(B)U_1 \cap \cdots \cap U_n \in \mathcal{T}(\mathcal{B}) for any nn sets in T(B)\mathcal{T}(\mathcal{B}). For n+1n+1 sets, write (U1∩⋯∩Un)∩Un+1(U_1 \cap \cdots \cap U_n) \cap U_{n+1}. By induction hypothesis, U1∩⋯∩Un=∪i∈I(ai,bi)U_1 \cap \cdots \cap U_n = \cup_{i \in I}(a_i, b_i) for some countable collection of open intervals. Then

      (U1∩⋯∩Un)∩Un+1=(∪i∈I(ai,bi))∩Un+1=∪i∈I((ai,bi)∩Un+1)(U_1 \cap \cdots \cap U_n) \cap U_{n+1} = \left(\cup_{i \in I}(a_i, b_i)\right) \cap U_{n+1} = \cup_{i \in I}((a_i, b_i) \cap U_{n+1})

      Each (ai,bi)∩Un+1(a_i, b_i) \cap U_{n+1} is an intersection of an open interval with a union of open intervals, which is a finite union of open intervals (or empty). Hence (U1∩⋯∩Un+1)∈T(B)(U_1 \cap \cdots \cap U_{n+1}) \in \mathcal{T}(\mathcal{B}).

Therefore T(B)\mathcal{T}(\mathcal{B}) is a topology on R\mathbb{R}.


  1. Suppose B′⊆B\mathcal B' \subseteq \mathcal B and

    U=⋃B∈B′BU=\bigcup_{B\in \mathcal B'} B

    where B′\mathcal B' can be uncountable. We would like to show ∃B′′\exists \mathcal B'' that is countable such that

    U=⋃B∈B′′BU=\bigcup_{B\in \mathcal B^{''}} B

    We now show a specfic way to construct B′′\mathcal B'' from B′\mathcal B'. Define:

    Bx={(a,b)∈B′:x∈(a,b)}\mathcal B_x = \{(a,b)\in \mathcal B' : x\in (a,b)\}

    Clearly Bx⊆B′\mathcal B_x \subseteq \mathcal B'. Now proceed with the following procedure(an “infinite algorithm”)on the construction of B′′\mathcal B''

where [c][c] picks the closes integer towards the right of the real axis. Note we implicitly invoked the claim below in computing (c,d)(c,d):

  • Cliam 1\boxed{\textbf{Cliam 1}} The union of arbitrary family of open intervals containing x∈Rx\in \mathbb{R} is a generalized open interval

    ⋃B∈BxB∈{(c,d):c,d∈R∪{∞,−∞}}\bigcup_{B\in \mathcal B_x} B\in \{(c,d): c,d\in \mathbb{R}\cup \{\infty, -\infty\}\}
    • I claim the union is just (c,d)(c,d) where c=inf⁡{a:(a,b)∈Bx}c=\inf \{a:(a,b)\in \mathcal B_x\} and d=sup⁡{b:(a,b)∈Bx}d=\sup \{b:(a,b)\in \mathcal B_x\} where we allow ∞\infty and −∞-\infty. Clearly (c,d)(c,d) covers ∪Bx\cup \mathcal B_x. It suffice to show ∪Bx\cup \mathcal B_x covers (c,d)(c,d). Suppose ∃y∈(c,d)\exists y \in (c,d) and y∉∪Bxy\notin \cup \mathcal B_x. This means ∪Bx\cup \mathcal B_x has a hole and there must exists a pair of open interval in Bx\mathcal B_x that is disjoint, contradicting that all open intervals in Bx\mathcal B_x contains xx(in that case no pair should be disjoint).

Now what’s left to show is (1) Only countable number of Bx′\mathcal B_x' is needed. (2) each Bx′\mathcal B_x' is countable. The later is obvious by construction. The former can be argued by countability of Q\mathbb{Q}. Pick a q∈Qq\in \mathbb{Q} in one of the open interval of Bx′\mathcal B_x', this is always possible by density of rationals. Suppose uncountable Bx′\mathcal B_x' is needed to cover ∪B′′\cup \mathcal B'' then U=∪B′′U=\cup \mathcal B'' would contain uncountable number of rationals. This finishes the proof.


  1. By definition, BR\mathcal B_{\mathbb{R}} is the smallest σ\sigma-algebra containing T(B)\mathcal T(\mathcal B). Therefore the inclusion holds by construction.


  1. We only need to show (b), (c), and (e) since (a) and (d) are generalized open intervals and are actually shown by (5).

Case (b): Closed intervals E2={[a,b]:a<b}\mathcal{E}_2 = \{[a,b]: a < b\}

  • M(E2)⊆BR\mathcal{M}(\mathcal{E}_2) \subseteq \mathcal{B}_\mathbb{R}: Note that [a,b]=∩j=1∞(a−1/j,b+1/j)[a,b] = \cap_{j=1}^{\infty}(a-1/j, b+1/j) is a countable intersection of open intervals, so E2⊂BR\mathcal{E}_2 \subset \mathcal{B}_\mathbb{R}.

  • BR⊆M(E2)\mathcal{B}_\mathbb{R} \subseteq \mathcal{M}(\mathcal{E}_2): (a,b)=∪j=1∞[a+1/j,b−1/j](a,b) = \cup_{j=1}^{\infty}[a+1/j, b-1/j] is a countable union of closed intervals, so B⊂M(E2)\mathcal{B} \subset \mathcal{M}(\mathcal{E}_2) and hence BR=M(B)⊂M(E2)\mathcal{B}_\mathbb{R} = \mathcal{M}(\mathcal{B}) \subset \mathcal{M}(\mathcal{E}_2).

Case (c): Half-open intervals E3={(a,b]:a<b}\mathcal{E}_3 = \{(a,b]: a < b\}

  • M(E3)⊆BR\mathcal{M}(\mathcal{E}_3) \subseteq \mathcal{B}_\mathbb{R}: (a,b]=(a,b)∪{b}(a,b] = (a,b) \cup \{b\} where (a,b)∈BR(a,b) \in \mathcal{B}_\mathbb{R} and {b}=∩j=1∞(b−1/j,b+1/j)∈BR\{b\} = \cap_{j=1}^{\infty}(b-1/j, b+1/j) \in \mathcal{B}_\mathbb{R}.

  • BR⊆M(E3)\mathcal{B}_\mathbb{R} \subseteq \mathcal{M}(\mathcal{E}_3): (a,b)=∪j=1∞(a,b−1/j](a,b) = \cup_{j=1}^{\infty}(a, b-1/j] is a countable union of half-open intervals, so B⊂M(E3)\mathcal{B} \subset \mathcal{M}(\mathcal{E}_3) and hence BR⊂M(E3)\mathcal{B}_\mathbb{R} \subset \mathcal{M}(\mathcal{E}_3).

Case (e): Closed rays E7={[a,∞):a∈R}\mathcal{E}_7 = \{[a,\infty): a \in \mathbb{R}\}

  • M(E7)⊆BR\mathcal{M}(\mathcal{E}_7) \subseteq \mathcal{B}_\mathbb{R}: [a,∞)=∩j=1∞(a−1/j,∞)[a,\infty) = \cap_{j=1}^{\infty}(a-1/j, \infty) is a countable intersection of open rays (generalized open intervals), so E7⊂BR\mathcal{E}_7 \subset \mathcal{B}_\mathbb{R}.

  • BR⊆M(E7)\mathcal{B}_\mathbb{R} \subseteq \mathcal{M}(\mathcal{E}_7): (a,b)=(a,∞)∩(−∞,b)(a,b) = (a,\infty) \cap (-\infty,b) where (a,∞)=∪j=1∞[a+1/j,∞)(a,\infty) = \cup_{j=1}^{\infty}[a+1/j,\infty) and (−∞,b)=R∖[b,∞)(-\infty,b) = \mathbb{R} \setminus [b,\infty) are in M(E7)\mathcal{M}(\mathcal{E}_7), so B⊂M(E7)\mathcal{B} \subset \mathcal{M}(\mathcal{E}_7) and hence BR⊂M(E7)\mathcal{B}_\mathbb{R} \subset \mathcal{M}(\mathcal{E}_7).

Cases (c’), (e’) follow by symmetry.


  1. We only need to show

    B⊆M(T(B))T(B)⊆M(B)\begin{align*} \mathcal B &\subseteq \mathcal M(\mathcal T(\mathcal B)) \\ \mathcal T(\mathcal B) &\subseteq \mathcal M( \mathcal B) \end{align*}
  • The former is trivial since B⊆T(B)⊆M(T(B)\mathcal B \subseteq \mathcal T(\mathcal B)\subseteq \mathcal M(\mathcal T(\mathcal B)

  • The later can be shown using (2). M(B)\mathcal M(\mathcal B) contains all countable unions of open intervals B\mathcal B while T(B)\mathcal T(\mathcal B) contains arbitrary union. (2) bridges the gap by claiming the arbitrary union can actually be replaced by countable union.

Construction of Measure

The big picture

The general idea of constructing measure is, in crude terms:

  1. Find a collection of set that has a clear notion of size

  2. Approximate arbitrary subsets using element in the elementary set, hence get a notion of size on arbtirary subsets

  3. Make the notion of size truely a measure by restricting to a special collection of subset.

Observe how the notion of size ripens:

Stage 1: ∣⋅∣:E→R+⟶Stage 2: μ∗:P(X)→R+⟶Stage 3: μ:M∣μ∗→R+\begin{align*} \text{Stage 1: $\boxed{|\cdot|:\mathcal E \to \mathbb{R}^+}$} &\longrightarrow \text{Stage 2: $\boxed{\mu^* : P(X)\to \mathbb{R}^+}$} \\ &\longrightarrow \text{Stage 3: $\boxed{\mu: \mathcal M|_{\mu^*} \to \mathbb{R}^{+}}$} \end{align*}
  1. Stage 1 to 2: Create a notion of size on arbitrary sets A⊂P(X)A\subset P(X) by approximating them using “building blocks”(A∈E)(A\in \mathcal E) which has a notion of size ∣⋅∣|\cdot |. This scarifices additivity and we instead of countable sub-additivity

  2. Stage 2 to 3: Shrink the domain by restrict to a particular family M∣μ∗⊂P(X)\mathcal M |_{\mu^*}\subset P(X). This gives us countable additivity and μ\mu is now a complete measure

Outer Measure

So how do we actually construct measures no matter what set we are working on?(Though in this book we are really interested in just Rn\mathbb{R}^n). A general guidline is:

  1. Find some elementary set E\mathcal{E} where premeasure is defined on the disjoint uniont of E\mathcal{E}.

  2. Define the measure of arbitrary subset A∈P(X)A\in P(X) as the the size of “smallest” cover of AA using the elementary set:

inf⁡{∑ν=1∞ρ(Eν):Eν∈E,A⊂⋃ν=1∞Eν}\inf \left\{\sum_{\nu=1}^{\infty} \rho(E_{\nu}): E_{\nu}\in \mathcal{E}, A\subset \bigcup_{\nu=1}^{\infty} E_{\nu}\right\}

More generally we can define an outer measure as follows:

We note that property (2),(3) are both derived properties of measure. So we can think the definition of outer measure as a relaxation of measure: take out countable additvity and adds back two derived property. In addition, We note that (15) obeys Definition 2

Carathéodory Family Mμ∗\mathcal M_{\mu^*}

How do we then obtain measure from outer measure? We note that what outer measure lacks is finite additivity, so we can further ask, is there a collection of subset M⊂P(X)\mathcal {M}\subset P(X) such that μ∗\mu^* is actually finitey additive? The answer is actually YES! However this seems rather arbitrary:

M={A⊂X:μ∗(F)=μ∗(F−A)+μ∗(A∩F),∀F⊂X}\mathcal M = \{A\subset X: \mu^*(F)=\mu^*(F-A)+\mu^*(A\cap F), \forall F \subset X\}

We call elements of M\mathcal M μ∗\mu^*-measureable. In plain English, this saying AA can “split measure” arbitrary F⊂XF\subset X by measuring the intersection and the complement separetly and add them together.

Premeasure and The Extension Theorem

THe workflow (12) is already very promising except one key issue:

The next theorem prevents this by starting with an algebra A\mathcal A instead of just a plain family of sets E\mathcal E. The plain notion of size on E\mathcal E is replaced by the so-called premeasure.

Solution to Exercise 2
Solution to Exercise 3

1.This is just the definition of outer measure(namingly, infimum). Note since

μ∗(E)=inf⁡C\mu^*(E)= \inf C

where

C={∑μ0(Aj)∣A=∪Aj∈Aσ,E⊂A}C= \left\{\sum \mu_0(A_j) | A=\cup A_j\in \mathcal A_{\sigma}, E\subset A \right\}

Hence ∃c∈C\exists c\in C such that c<μ∗(E)+ϵc < \mu^*(E)+\epsilon by the definition of infimum. Now the map between open covers and their area is clearly surjective by construction:

{A∈Aσ:E⊂A}→RA↦∑jμ0(Aj)⏟μ∗(A)\begin{align*} \{A\in \mathcal A_{\sigma} : E\subset A\} &\to \mathbb{R} \\ A &\mapsto \underbrace{\sum_j \mu_0(A_j)}_{\mu^*(A)} \end{align*}

hence we can find A∈AσA\in A_{\sigma} that correponds to cc.

  1. (⟹)(\Longrightarrow) Suppose EE is μ∗\mu^*-measurable. Now by (1), for each nn we can find An∈AσA_n\in \mathcal A_{\sigma} with E⊂AnE\subset A_n and μ∗(An)≤μ∗(E)+1n\mu^*(A_n)\leq \mu^*(E)+\frac1n. The AnA_n need not be decreasing, so replace them by A~n:=⋂k=1nAk\tilde A_n:=\bigcap_{k=1}^n A_k; since Aσ\mathcal A_\sigma is closed under finite intersections (intersection distributes over the countable unions defining each AkA_k), A~n∈Aσ\tilde A_n\in\mathcal A_\sigma, and now A~n\tilde A_n is a decreasing sequence with E⊂A~n⊂AnE\subset \tilde A_n\subset A_n, so still μ∗(E)≤μ∗(A~n)≤μ∗(An)≤μ∗(E)+1n\mu^*(E)\leq \mu^*(\tilde A_n)\leq \mu^*(A_n)\leq \mu^*(E)+\frac1n. Define:

    B:=⋂nA~n=⋂nAn∈AσδB:=\bigcap_{n}\tilde A_{n} = \bigcap_n A_n \in \mathcal A_{\sigma \delta}

    By construction E⊂BE\subset B. Since A~n∈Aσ⊂Mμ∗\tilde A_n \in \mathcal A_\sigma \subset \mathcal M_{\mu^*} is a decreasing sequence with μ∗(A~1)≤μ∗(E)+1<∞\mu^*(\tilde A_1)\leq \mu^*(E)+1<\infty, continuity-from-above on Mμ∗\mathcal M_{\mu^*} gives:

    μ∗(B)=lim⁡n→∞μ∗(A~n)=μ∗(E)\mu^*(B)=\lim_{n \to \infty}\mu^*(\tilde A_n)=\mu^*(E)

    Now use that EE is μ∗\mu^*-measurable, testing it against BB: since E⊂BE\subset B,

    μ∗(B)=μ∗(B∩E)+μ∗(B∩Ec)=μ∗(E)+μ∗(B∖E)\mu^*(B) = \mu^*(B\cap E)+\mu^*(B\cap E^c) = \mu^*(E) + \mu^*(B\setminus E)

    Combining with μ∗(B)=μ∗(E)<∞\mu^*(B)=\mu^*(E)<\infty and subtracting the finite common value μ∗(E)\mu^*(E) from both sides gives μ∗(B∖E)=0\mu^*(B\setminus E)=0, as desired.

(⟸)(\Longleftarrow) Suppose there exists B∈AσδB\in \mathcal A_{\sigma \delta} such that E⊂BE\subset B and μ∗(B∖E)=0\mu^*(B\setminus E)=0. Note any B∈AσδB\in \mathcal A_{\sigma \delta} is μ∗\mu^*-measurable since A⊂Mμ∗\mathcal A \subset \mathcal M_{\mu^*}(by extension theorem). We would like for all F⊂XF\subset X

μ∗(F)≥μ∗(F∩E)+μ∗(F∩Ec)\mu^*(F) \geq \mu^*(F\cap E) +\mu^*(F \cap E^c)

But now E⊂BE\subset B hence:

μ∗(F)=μ∗(F∩B)+μ∗(F∩Bc)≥μ∗(F∩E)+μ∗(F∩Bc)\begin{align*} \mu^*(F) &= \mu^*(F\cap B) + \mu^*(F\cap B^c) \\ &\geq \mu^*(F\cap E) + \mu^*(F\cap B^c) \end{align*}

Note all we need now is μ∗(F∩Bc)≥μ∗(F∩Ec)\mu^*(F \cap B^c) \geq \mu^*(F\cap E^c).

But now

μ∗(F∩Ec)=μ∗(F∩(Bc∪(B∩Ec)))≤μ∗(F∩Bc)+μ∗(F∩(B∩Ec))\mu^*(F\cap E^c) = \mu^*(F\cap (B^c \cup (B\cap E^c))) \leq \mu^*(F\cap B^c) + \mu^*(F\cap (B\cap E^c))

Again, by monotonicity and the assumption

μ∗(F∩(B∩Ec))≤μ∗(B∩Ec)=0\mu^*(F\cap (B\cap E^c))\leq \mu^*(B\cap E^c) = 0

Therefore μ∗(F∩Bc)≥μ∗(F∩Ec) \mu^*(F \cap B^c) \geq \mu^*(F\cap E^c). As desired.

  1. Suppose μ0\mu_0 is σ\sigma-finite then ∃{Xn}\exists \{X_n\}, μ0(Xn)<∞\mu_0(X_n)<\infty such that X=∪nXnX = \cup_n X_n . Now define En=Xn∩EE_n= X_n\cap E, we can apply (2) to each EnE_n(There existss Bn∈AσδB_n\in \mathcal A_{\sigma\delta} satisfying the property iff En∈ME_n\in \mathcal M).

(⟹\Longrightarrow) Say we already have desired set BnB_n for each EnE_n (each Bn∈AσδB_n\in \mathcal A_{\sigma\delta}, En⊂BnE_n\subset B_n, μ∗(Bn∖En)=0\mu^*(B_n\setminus E_n)=0)[2]. Take the union B=∪nBnB=\cup_n B_n; it covers EE since En⊂BnE_n \subset B_n and E=∪nEnE=\cup_n E_n. It also satisfies the null-excess property: since En⊂EE_n \subset E we have Bn∖E⊂Bn∖EnB_n\setminus E \subset B_n \setminus E_n for each nn, so B∖E=⋃n(Bn∖E)⊂⋃n(Bn∖En)B\setminus E = \bigcup_n(B_n\setminus E) \subset \bigcup_n(B_n\setminus E_n), and by countable subadditivity:

μ∗(B∖E)≤∑nμ∗(Bn∖En)=∑n0=0\mu^*(B\setminus E) \leq \sum_n \mu^*(B_n\setminus E_n) = \sum_n 0 = 0

(⟸\Longleftarrow) Suppose there is such BB for EE (possibly of infinite outer-measure). Define En=Xn∩EE_n = X_n\cap E as before, and now also Bn:=Xn∩B∈AσδB_n := X_n \cap B \in \mathcal A_{\sigma\delta} (intersecting with Xn∈AX_n \in \mathcal A preserves membership in Aσδ\mathcal A_{\sigma\delta}). Then En⊂BnE_n \subset B_n, and

μ∗(Bn∖En)=μ∗(Xn∩(B∖E))≤μ∗(B∖E)=0\mu^*(B_n\setminus E_n) = \mu^*\big(X_n\cap(B\setminus E)\big) \leq \mu^*(B\setminus E) = 0

Since μ∗(En)≤μ0(Xn)<∞\mu^*(E_n)\leq \mu_0(X_n)<\infty, part (2) applies to EnE_n and gives En∈ME_n \in \mathcal M. Now we want to show E∈ME \in \mathcal M but this is trivial as M\mathcal M is a σ\sigma-algebra closed under countable union and E=∪nEnE= \cup_n E_n

Solution to Exercise 4

(⟹)(\Longrightarrow) Suppose EE is μ∗\mu^*-measurable. Then so is EcE^c, and since X=E⊔Ec∈AX=E\sqcup E^c \in \mathcal A, additivity gives μ0(X)=μ∗(X)=μ∗(E)+μ∗(Ec)\mu_0(X)=\mu^*(X)=\mu^*(E)+\mu^*(E^c), i.e. μ∗(E)=μ∗(E)\mu^*(E)=\mu_*(E).

(⟸)(\Longleftarrow) Suppose μ∗(E)+μ∗(Ec)=μ0(X)=μ∗(X)<∞\mu^*(E)+\mu^*(E^c)=\mu_0(X)=\mu^*(X)<\infty. Fix ϵ>0\epsilon>0; by Exercise 3 part (1), pick A,A′∈Aσ⊂Mμ∗A,A'\in \mathcal A_\sigma\subset \mathcal M_{\mu^*} with E⊂AE\subset A, Ec⊂A′E^c\subset A', μ∗(A)≤μ∗(E)+ϵ\mu^*(A)\leq \mu^*(E)+\epsilon, μ∗(A′)≤μ∗(Ec)+ϵ\mu^*(A')\leq \mu^*(E^c)+\epsilon. Then A∪A′=XA\cup A'=X, so

μ∗(X)+μ∗(A∩A′)=μ∗(A)+μ∗(A′)≤μ∗(X)+2ϵ  ⟹  μ∗(A∩A′)≤2ϵ\mu^*(X)+\mu^*(A\cap A') = \mu^*(A)+\mu^*(A') \leq \mu^*(X)+2\epsilon \implies \mu^*(A\cap A')\leq 2\epsilon

Since A∖E⊂A∩A′A\setminus E \subset A\cap A', μ∗(A∖E)≤2ϵ\mu^*(A\setminus E)\leq 2\epsilon. Taking ϵ=1n\epsilon=\frac1n gives An⊃EA_n\supset E with μ∗(An∖E)≤2n\mu^*(A_n\setminus E)\leq \frac2n; let B:=⋂nAn∈Mμ∗B:=\bigcap_n A_n\in \mathcal M_{\mu^*}. Then E⊂BE\subset B and μ∗(B∖E)≤μ∗(An∖E)→0\mu^*(B\setminus E)\leq \mu^*(A_n\setminus E)\to 0, so μ∗(B∖E)=0\mu^*(B\setminus E)=0.

This is exactly the hypothesis of the (⟸)(\Longleftarrow) direction of Exercise 3 part (2) (only measurability of BB was used there, not B∈AσδB\in\mathcal A_{\sigma\delta}), which concludes EE is μ∗\mu^*-measurable. As desired.

The following exercise is assumed everywhere in mathematics and is not directly related to outer measure. But they are invokded multiple times, for instance, in subadditivity of outer measure.

Solution to Exercise 5
  1. We first make a claim

    ∑j∈Naj=sup⁡J∑j∈Jaj\sum_{j\in \mathbb{N}}a_j = \sup_J \sum_{j\in J} a_j

    where J⊂N,∣J∣<∞J\subset \mathbb{N}, |J|<\infty.

  • To show ∑j∈Naj≤sup⁡∑j∈Jaj\sum_{j\in \mathbb{N}} a_j \leq \sup \sum_{j\in J} a_j :

    ∑j∈Naj=lim⁡N→∞∑j=1Naj≤sup⁡∑j∈Jaj\sum_{j\in \mathbb{N}}a_j=\lim_{N\to\infty} \sum_{j=1}^N a_j \leq \sup \sum_{j\in J} a_j
  • To show ∑j∈Naj≥sup⁡∑j∈Jaj\sum_{j\in \mathbb{N}} a_j \geq \sup \sum_{j\in J} a_j , we first note ∀J\forall J as above:

    ∑j∈Naj=sup⁡msm≥smax⁡J≥∑j∈Jaj\sum_{j\in \mathbb{N}} a_j = \sup_m s_m \geq s_{\max J} \geq \sum_{j\in J} a_j

    Now sup⁡\sup perserves non-strict inequality so we can take sup⁡\sup on both sides to get:

    sup⁡J∑j∈Naj=∑j∈Naj≥sup⁡J∑j∈Jaj\sup_{J} \sum_{j\in \mathbb{N}} a_j = \sum_{j\in \mathbb{N}} a_j \geq \sup_J \sum_{j\in J} a_j

    as desired. Now (1) becomes trivial since ∀J\forall J defined as above, suppose we define:

    k(J)={k(j):j∈J}k(J)=\{k(j): j\in J\}

    now by the claim

    ∑j∈Nak(j)=sup⁡J∑j∈J′aj=sup⁡J∑j∈k(J)aj\sum_{j\in \mathbb{N}} a_{k(j)} = \sup_{J} \sum_{j\in J'} a_j = \sup_{J} \sum_{j\in k(J)} a_j

    where the last equality follows as J′J' is also in the set {J⊂N:∣J∣<∞}\{J\subset N: |J|<\infty\}.


  1. We first make a claim: For monotone non-decreasing sequences sn,tns_n, t_n:

    sup⁡(sn+tn)=sup⁡sn+sup⁡tn\sup(s_n + t_n) = \sup s_n + \sup t_n
  • sup⁡(sn+tn)≤sup⁡sn+sup⁡tn\sup(s_n + t_n) \leq \sup s_n + \sup t_n is true since ∀m,sm+tm≤sup⁡sn+sup⁡tn\forall m, s_m + t_m \leq \sup s_n + \sup t_n and taking sup⁡m\sup_m on both sides get us desired.

  • sup⁡(sn+tn)≥sup⁡sn+sup⁡tn\sup(s_n + t_n) \geq \sup s_n + \sup t_n can be shown by arguing ∀ϵ>0\forall \epsilon > 0,

    sup⁡(sn+tn)≥sup⁡sn+sup⁡tn−ϵ\sup(s_n + t_n) \geq \sup s_n + \sup t_n - \epsilon

    Denote s=sup⁡sn,t=sup⁡tns=\sup s_n, t = \sup t_n. By definition of supremum, we can pick N1,N2N_1, N_2 such that sN1>s−ϵ/2s_{N_1} > s - \epsilon/2 and tN2>t−ϵ/2t_{N_2} > t - \epsilon/2. Let N=max⁡(N1,N2)N=\max(N_1,N_2); since sn,tns_n, t_n are non-decreasing, ∀n≥N\forall n \geq N we have sn≥sN1>s−ϵ/2s_n \geq s_{N_1} > s-\epsilon/2 and tn≥tN2>t−ϵ/2t_n \geq t_{N_2} > t-\epsilon/2, hence:

    sn+tn>s+t−ϵs_n + t_n > s + t - \epsilon

    Taking sup⁡n\sup_n on the left gives sup⁡(sn+tn)≥s+t−ϵ=sup⁡sn+sup⁡tn−ϵ\sup(s_n+t_n) \geq s+t-\epsilon = \sup s_n + \sup t_n - \epsilon. As desired, since ϵ>0\epsilon>0 was arbitrary. (2) then easily follows by taking the claim in (1) and then let

    sn=∑j=1najtn=∑j=1mbj\begin{align*} s_n &=\sum_{j=1}^n a_j \\ t_n &=\sum_{j=1}^m b_j \end{align*}

    Apply the above claim gets desired.

Casestudy: Lebesgue-Stieltjes Measure

The most useful set that we would like to equip a measure with is, unarguably, the real numbers R\mathbb{R}.

Starting Point: The half-intervals

Recall that we would start with an elementary collection that has a clear notion of size. We define the h-intervals:

H={(a,b]:a<b,a,b∈R}H=\{(a,b]:a<b, a,b\in \mathbb{R}\}

We define a terminology here:

Another terminology:

We define size on HH as follows:

The next step is to extend this notion of size to A=M(H)\mathcal A=\mathcal M(H).

Step 1: Construction of a premeasure

Now we have an algebra A\mathcal A where elements of the algebra A∈AA\in \mathcal A has an elementary decomposition A={Ij}A=\{I_j\} to h-intervals I=(aj,bj]I=(a_j,b_j], which is equipped with a notion of size bj−ajb_j-a_j. A natural way to define the notion of size for AA is hence:

μ0(A)=∑j=1N∣Ij∣=∑j=1NF(bj)−F(aj)\mu_0(A) = \sum_{j=1}^N |I_j| =\sum_{j=1}^N F(b_j)-F(a_j)

We claim that μ0\mu_0 is actually a pre-measure on A\mathcal A.

Solution to Exercise 7

Recall that:

m∗([a,b])=inf⁡{∑j=1∞bj−aj∣[a,b]⊆⋃(aj,bj]}m^*([a,b])=\inf\left\{\sum_{j=1}^{\infty} b_j - a_j {\Huge |} [a,b]\subseteq \bigcup (a_j, b_j] \right\}
  • For ≤\leq it suffices to find one cover A=∪(aj,bj]A=\cup (a_j,b_j] with ∑bj−aj≤b−a\sum b_j - a_j \leq b-a. We note ∀ϵ>0\forall \epsilon > 0, (a−ϵ/2,b](a-\epsilon/2,b] would cover [a,b][a,b] and

    inf⁡{∑j=1∞bj−aj∣[a,b]⊆⋃(aj,bj]}≤b−a+ϵ/2≤b−a−ϵ\inf\left\{\sum_{j=1}^{\infty} b_j - a_j {\Huge |} [a,b]\subseteq \bigcup (a_j, b_j] \right\} \leq b - a + \epsilon/2 \leq b-a -\epsilon

    where the first inequality follows since (a−ϵ/2,b)(a-\epsilon/2, b) is in the set of AA we are taking infimum over.

  • For ≥\geq we need to show for all cover AA as above, ∀ϵ>0\forall \epsilon>0,

    ϵ+∑j=1∞(bj−aj)≥b−a\epsilon + \sum_{j=1}^{\infty} (b_j - a_j) \geq b-a

    Let A=∪Aj,Aj=(aj,bj]A=\cup A_j, A_j=(a_j,b_j] be an arbitary, potentially infinite cover. Consider Aj′=(aj,bj+ϵ2j)A'_j=(a_j,b_j+\frac{\epsilon}{2^j}), clearly [a,b]⊂∪Aj′[a,b]\subset \cup A'_j . By compactness, we can pick a finite subcover:

    [a,b]=⋃k=1n(ajk,bjk+δjk)[a,b]=\bigcup_{k=1}^n (a_{{j_k}},b_{{j_k}}+\delta_{j_k})

    where δjk≤ϵ/2jk\delta_{j_k} \leq \epsilon / 2^{j_k}. Denote ck=ajk,dk=bjk+δjkc_k = a_{j_k}, d_k = b_{j_k}+\delta_{j_k}. We have [a,b]=⋃k=1n(ck,dk)[a,b]=\bigcup_{k=1}^n (c_k, d_k). Note since implies dn>b,cn<ad_n>b, c_n < a. Without loss of generality, we can assume dk+1>ckd_{k+1}> c_k. Hence:

    ∑k=1n(dj−cj)=dn−c1+∑k=1n−1(dk−ck+1)≥dn−c1≥b−a\begin{align*} \sum_{k=1}^n (d_j - c_j) &= d_n - c_1 + \sum_{k=1}^{n-1}(d_k-c_{k+1}) \\ &\geq d_n - c_1 \\ &\geq b - a \end{align*}

    It remains to show

    ϵ+∑j=1∞(bj−aj)≥∑kdk−ck\epsilon + \sum_{j=1}^{\infty} (b_j - a_j) \geq \sum_k d_k - c_k

    but

    ∑k(dk−ck)≤∑k=1n(bjk+ϵ/2jk−ajk)≤ϵ+∑k=1n(bjk−ajk)≤ϵ+∑k=j∞(bj−aj)\begin{align*} \sum_k (d_k - c_k) &\leq \sum_{k=1}^n (b_{j_k} + \epsilon / 2^{j_k}-a_{j_k}) \\ &\leq \epsilon + \sum_{k=1}^n (b_{j_k} -a_{j_k}) \\ &\leq \epsilon + \sum_{k=j}^{\infty} (b_{j} -a_{j}) \end{align*}
Solution to Exercise 8

Suppose E⊂RE\subset \mathbb{R}, we show

m∗(cE+d)=∣c∣m∗(E)m^*(cE + d) = |c|m^*(E)

First we isolate the special case when c=0c=0. In that case cE+d={d}cE+d = \{d\} and outer measure of singleton is 0 so the equality is trivial. Now we assume c≠0c\neq 0. we claim that every cover A=∪AjA=\cup A_j for cE+dcE+d can be obtained by transforming a cover for EE. Specifically, suppose A=⋃(aj,bj]A=\bigcup (a_j,b_j] is a cover for cE+dcE+d then

B:={⋃j(aj−dc,bj−dc]c>0⋃j(bj−dc,aj−dc]c<0B:= \begin{cases} \bigcup_j \left( \frac{a_j-d}{c}, \frac{b_j-d}{c}\right] & c > 0\\ \bigcup_j \left( \frac{b_j-d}{c}, \frac{a_j-d}{c}\right] & c < 0 \end{cases}

is a cover for EE, furthermore cB+d=AcB+d=A. We consider the positive case first, the negative case follows similarily. Since for all e∈Ee\in E, ce+d∈cE+dce+d\in cE+d hence ∃(at,bt]\exists (a_t, b_t] such that ce+d∈(at,bt]ce+d \in (a_t, b_t]. Hence e∈(at−dc,bt−dc]e \in \left( \frac{a_t-d}{c}, \frac{b_t-d}{c}\right]. Now

m∗(E)=inf⁡{∑jbj−ajc∣cE+d⊂⋃j(aj−dc,bj−dc]}\begin{align*} m^*(E) &=\inf \left\{ \sum_j \frac{b_j - a_j}{c} {\Huge{|}} cE+d \subset \bigcup_j \left( \frac{a_j-d}{c}, \frac{b_j-d}{c}\right] \right\} \end{align*}

Hence m∗(E)=m∗(cE+d)/cm^*(E)= m^*(cE+d)/c when c>0c>0. If c<0c<0, then by the same reason, we get:

m∗(E)=inf⁡{∑jaj−bjc∣cE+d⊂⋃j(bj−dc,aj−dc]}\begin{align*} m^*(E) &=\inf \left\{ \sum_j \frac{a_j - b_j}{c} {\Huge{|}} cE+d \subset \bigcup_j \left( \frac{b_j-d}{c}, \frac{a_j-d}{c}\right] \right\} \end{align*}

hence m∗(E)=−m∗(cE+d)/cm^*(E)=-m^*(cE+d)/c. As desired.

Solution to Exercise 9

Consider Q⊂R\mathbb{Q}\subset \mathbb{R} which is dense. Since Q\mathbb{Q} is denumerable, consider an enumeration Q=q1,q2,...Q = q_1,q_2,.... Consider the following construction(psuedo-algorithm):

where Bro(x)B^o_{r}(x) denotes the open ball of radius rr around xx in Rd\mathbb{R}^d. Now clearly AϵA_{\epsilon} is dense since Q⊂Aϵ\mathbb{Q}\subset A_{\epsilon} and

m(Aϵ)≤∑j=1∞ϵ2j=ϵm(A_{\epsilon})\leq \sum_{j=1}^{\infty}\frac{\epsilon}{2^j } = \epsilon

The set is open because it is a countable union of open balls. Threrefore its complement is closed and has measure ∞−ϵ=∞\infty -\epsilon=\infty(by additivity of measure). It’s left to show that the complement is nowhere dense. We need (R∖Aϵ‾)∘=∅(\overline{\mathbb{R}\setminus A_{\epsilon}})^{\circ}=\varnothing, since R∖Aϵ\mathbb{R}\setminus A_{\epsilon} is closed it suffices to show R∖Aϵ\mathbb{R}\setminus A_{\epsilon} has empty interior, i.e., contains no open interval. Suppose (a,b)⊂R∖Aϵ(a,b)\subset \mathbb{R}\setminus A_{\epsilon}, then ∀j,Bϵ/2j+1o(qj)∩(a,b)=∅\forall j, B_{\epsilon/2^{j+1}}^o(q_j) \cap (a,b) = \varnothing. But rationals are dense in R\mathbb{R} hence there must exists q∈(a,b),q∈Qq\in (a,b), q\in \mathbb{Q}, contradicts.

Footnotes
  1. This problem is selected from Professor Igor Mineyev’s homework from MATH 540(Real Analysis) in Fall 2026 at UIUC.

  2. Strictly, Aσδ\mathcal A_{\sigma\delta} need not be closed under countable unions (only finite ones) — the analogous fact for GδG_\delta sets in R\mathbb R fails: Q=⋃q{q}\mathbb Q=\bigcup_q \{q\} is a countable union of GδG_\delta singletons yet is not itself GδG_\delta. So B=∪nBnB=\cup_n B_n below should be read as living in Mμ∗\mathcal M_{\mu^*} (a genuine σ\sigma-algebra), which is all that is actually used afterward.

  3. Note that in definiting a notion of size μ0\mu_0 on A∈AA\in \mathcal A, we requires AA to have a concrete representation ∪jIj\cup_j I_j. If the result is independent on how we choose this representation(i.e. different elementary decomposition{Ij}\{I_j\}), then this notion of size is indeed fundamentally correct. Otherwise if μ0\mu_0 is dependent on how we choose representation, then it is not a credibe notion of size. Such “representational invariance” is called well-definedness in mathematics.