Alessandro Palliccia

Real and Functional Analysis

Measure spaces, completeness and outer measures

1,563 words, , published

The lecture defines measures on σ\sigma-algebras, extends a measure space so that its negligible sets become measurable, and constructs measures from outer measures.

Measure spaces

The main goal is a flexible theory of computing volumes, such as the volumes of the sets of Rn\mathbb{R}^n in Figure 1.

EAℝn

Figure 1. Two sets EE and AA of Rn,\mathbb{R}^n, and a line that crosses E.E.

Definition 1 (Measure). Let XX be a set and M\mathcal{M} a σ\sigma-algebra on X.X. A measure is a function μ ⁣:M→[0,+∞]{\mu \colon \mathcal{M} \to [0, +\infty]} such that:
(i) μ(∅)=0;{\mu(\emptyset) = 0;}

(ii) (σ\sigma-additivity) for every sequence (En)⊂M{(E_n) \subset \mathcal{M}} that is pairwise disjoint, that is, such that Ei∩Ej=∅{E_i \cap E_j = \emptyset} for every i≠j,{i \neq j,}

μ(⋃nEn)=∑n=0∞μ(En).\mu\Big( \bigcup_n E_n \Big) = \sum_{n=0}^{\infty} \mu(E_n).

Remark 2. It will turn out to be impossible to construct “interesting” measures defined on the whole power set P(X).\mathcal{P}(X).

Example 3 (Counting measure). The counting measure is the function μ ⁣:P(R)→[0,+∞]{\mu \colon \mathcal{P}(\mathbb{R}) \to [0, +\infty]} given by

μ(E)={#Eif E is finite,+∞if E is infinite.\mu(E) = \begin{cases} \#E & \text{if } E \text{ is finite}, \\ +\infty & \text{if } E \text{ is infinite}. \end{cases}

Example 4 (Dirac delta measure). Let x0∈R.{x_0 \in \mathbb{R}.} The Dirac delta measure at x0x_0 is the function δx0 ⁣:P(R)→[0,+∞]{\delta_{x_0} \colon \mathcal{P}(\mathbb{R}) \to [0, +\infty]} given by

δx0(E)={1if x0∈E,0if x0∉E.\delta_{x_0}(E) = \begin{cases} 1 & \text{if } x_0 \in E, \\ 0 & \text{if } x_0 \notin E. \end{cases}

Figure 2 shows the two cases on the real line, with a set EE around 0 and a set FF around x0.x_0.

Eδx0(E) = 0Fδx0(F) = 10x0ℝ

Figure 2. An instance: EE and FF are intervals of R,\mathbb{R}, and the values of δx0\delta_{x_0} on them are written above. The slider moves x0.x_0.

Remark 5 (Basic properties). A triple (X,M,μ)(X, \mathcal{M}, \mu) of a set X,X, a σ\sigma-algebra M\mathcal{M} on XX and a measure μ\mu on M\mathcal{M} is called a measure space. Let (X,M,μ)(X, \mathcal{M}, \mu) be a measure space.
(i) (Monotonicity) If E,F∈M{E, F \in \mathcal{M}} and E⊂F,{E \subset F,} then μ(E)≤μ(F).{\mu(E) \le \mu(F).}
(ii) (Excision) If E,F∈M,{E, F \in \mathcal{M},} E⊂F{E \subset F} and μ(F)<+∞,{\mu(F) < +\infty,} then μ(F∖E)=μ(F)−μ(E).{\mu(F \setminus E) = \mu(F) - \mu(E).}

Proof (sketch). (i) For the sets E⊂FE \subset F of Figure 3,

μ(E)≤μ(E)+μ(F∖E)=μ(E∪(F∖E))=μ(F).\mu(E) \le \mu(E) + \mu(F \setminus E) = \mu\big( E \cup (F \setminus E) \big) = \mu(F).
EF \ EF

Figure 3. A set EE inside a set F,F, and the difference F∖E.{F \setminus E.}

Details. The inequality holds because μ(F∖E)≥0.{\mu(F \setminus E) \ge 0.} The set F∖E{F \setminus E} belongs to M\mathcal{M} and is disjoint from E,E, so σ\sigma-additivity applied to E,F∖E,∅,∅,…{E, F \setminus E, \emptyset, \emptyset, \dots} gives the first equality, since μ(∅)=0;{\mu(\emptyset) = 0;} the second holds because E∪(F∖E)=F{E \cup (F \setminus E) = F} when E⊂F.{E \subset F.} (ii) The same computation gives μ(F)=μ(E)+μ(F∖E),{\mu(F) = \mu(E) + \mu(F \setminus E),} where μ(E)≤μ(F)<+∞{\mu(E) \le \mu(F) < +\infty} by (i), and subtracting μ(E)\mu(E) gives the claim. ■\blacksquare

Proposition 6 (Continuity of measures). Let (X,M,μ)(X, \mathcal{M}, \mu) be a measure space.
(i) Let (En)⊂M{(E_n) \subset \mathcal{M}} be such that En⊂En+1{E_n \subset E_{n+1}} for every n,n, and let E=⋃nEn.{E = \bigcup_n E_n.} Then μ(E)=lim⁡n→+∞μ(En).{\mu(E) = \lim_{n \to +\infty} \mu(E_n).}
(ii) Let (En)⊂M{(E_n) \subset \mathcal{M}} be such that En+1⊂En{E_{n+1} \subset E_n} for every n,n, suppose μ(E0)<+∞,{\mu(E_0) < +\infty,} and let E=⋂nEn.{E = \bigcap_n E_n.} Then μ(E)=lim⁡n→+∞μ(En).{\mu(E) = \lim_{n \to +\infty} \mu(E_n).}

Proof (complete). (i) Without loss of generality, μ(En)<+∞{\mu(E_n) < +\infty} for every n.n. Indeed, if μ(Em)=+∞{\mu(E_m) = +\infty} for some m,m, then μ(En)=+∞{\mu(E_n) = +\infty} for every n≥m{n \ge m} and μ(E)=+∞{\mu(E) = +\infty} by Remark 5 (i), so both sides equal +∞.+\infty. Let F0=E0{F_0 = E_0} and Fn+1=En+1∖En{F_{n+1} = E_{n+1} \setminus E_n} for every n≥0,{n \ge 0,} as in Figure 4. Then Fi∈M{F_i \in \mathcal{M}} for every i,i, Fi∩Fj=∅{F_i \cap F_j = \emptyset} for every i≠j,{i \neq j,} and E=⋃nEn=⋃nFn.{E = \bigcup_n E_n = \bigcup_n F_n.} Hence

μ(E)=μ(⋃nFn)=∑n=0∞μ(Fn)=lim⁡N→∞∑n=0Nμ(Fn)=lim⁡N→∞μ(EN),\begin{aligned} \mu(E) &= \mu\Big( \bigcup_n F_n \Big) = \sum_{n=0}^{\infty} \mu(F_n) \\ &= \lim_{N \to \infty} \sum_{n=0}^{N} \mu(F_n) = \lim_{N \to \infty} \mu(E_N), \end{aligned}

where the second equality is σ\sigma-additivity and the last one holds because the sum of the μ(Fn)\mu(F_n) with n≤N{n \le N} equals μ(EN),{\mu(E_N),} as ENE_N is the union of the pairwise disjoint sets F0,…,FN{F_0, \dots, F_N} and σ\sigma-additivity applies as in the proof of Remark 5.

F0 = E0E

E2 = F0 ∪ … ∪ F2

Figure 4. An instance of an increasing sequence: the sets E0⊂E1⊂…{E_0 \subset E_1 \subset \dots} and their union E,E, dashed. The slider sets N;N; the rings F0,…,FN{F_0, \dots, F_N} are shaded, and their union is EN.E_N.

(ii) Let An:=E0∖En{A_n := E_0 \setminus E_n} for every n,n, as in Figure 5. Then An⊂An+1{A_n \subset A_{n+1}} and An∈M{A_n \in \mathcal{M}} for every n.n. Let

A=⋃nAn=⋃n(E0∖En)=E0∖⋂nEn=E0∖E.A = \bigcup_n A_n = \bigcup_n (E_0 \setminus E_n) = E_0 \setminus \bigcap_n E_n = E_0 \setminus E.

Then

μ(E0∖E)=μ(E0)−μ(E)=μ(A)=μ(⋃nAn)=lim⁡n→∞μ(An)=lim⁡n→∞μ(E0∖En)=lim⁡n→∞(μ(E0)−μ(En))=μ(E0)−lim⁡n→∞μ(En).\begin{aligned} \mu(E_0 \setminus E) &= \mu(E_0) - \mu(E) \\ &= \mu(A) = \mu\Big( \bigcup_n A_n \Big) \\ &= \lim_{n \to \infty} \mu(A_n) \\ &= \lim_{n \to \infty} \mu(E_0 \setminus E_n) \\ &= \lim_{n \to \infty} \big( \mu(E_0) - \mu(E_n) \big) \\ &= \mu(E_0) - \lim_{n \to \infty} \mu(E_n). \end{aligned}

Here the first and the fifth equality are Remark 5 (ii), which applies because EE and EnE_n are contained in E0E_0 and μ(E0)<+∞,{\mu(E_0) < +\infty,} and the third is (i) applied to (An).(A_n). Comparing μ(E0)−μ(E){\mu(E_0) - \mu(E)} with the last line and cancelling the finite number μ(E0)\mu(E_0) gives μ(E)=lim⁡n→∞μ(En).{\mu(E) = \lim_{n \to \infty} \mu(E_n).} ■\blacksquare

EA1E1E0

A1 = E0 \ E1

Figure 5. An instance of a decreasing sequence: the sets E0⊃E1⊃…{E_0 \supset E_1 \supset \dots} and their intersection E,E, dashed. The slider sets n;n; the shaded set is An=E0∖En.{A_n = E_0 \setminus E_n.}

Proposition 7 (σ\sigma-subadditivity). Let (X,M,μ)(X, \mathcal{M}, \mu) be a measure space, (En)⊂M{(E_n) \subset \mathcal{M}} and E∈M{E \in \mathcal{M}} with E⊂⋃nEn.{E \subset \bigcup_n E_n.} Then

μ(E)≤∑n=0∞μ(En).\mu(E) \le \sum_{n=0}^{\infty} \mu(E_n).
EEn

Figure 6. A set EE contained in the union of sets En.E_n.

Definition 8 (Finite, probability and σ\sigma-finite measures). Let (X,M,μ)(X, \mathcal{M}, \mu) be a measure space.
(i) The measure μ\mu is called finite if μ(X)<+∞.{\mu(X) < +\infty.}
(ii) The measure μ\mu is called a probability measure if μ(X)=1.{\mu(X) = 1.}
(iii) The measure μ\mu is called σ\sigma-finite if there exists (En)⊂M{(E_n) \subset \mathcal{M}} such that μ(En)<+∞{\mu(E_n) < +\infty} for every nn and ⋃nEn=X.{\bigcup_n E_n = X.}

Complete measure spaces

Consider the measure space (R,{∅,R},μ){(\mathbb{R}, \{\emptyset, \mathbb{R}\}, \mu)} with μ(∅)=0{\mu(\emptyset) = 0} and μ(R)=0.{\mu(\mathbb{R}) = 0.} An interval (a,b)⊂R{(a, b) \subset \mathbb{R}} is contained in a set of measure zero, but μ((a,b))=0{\mu((a, b)) = 0} cannot be written, because (a,b)∉{∅,R}.{(a, b) \notin \{\emptyset, \mathbb{R}\}.}

In a measure space (X,M,μ),(X, \mathcal{M}, \mu), let A∈M,{A \in \mathcal{M},} let C∈M{C \in \mathcal{M}} with μ(C)=0,{\mu(C) = 0,} and let B⊂C,{B \subset C,} as in Figure 7. One would like to write μ(A)=μ(A∪B),{\mu(A) = \mu(A \cup B),} but μ(A∪B)\mu(A \cup B) cannot be written, because A∪B{A \cup B} may not belong to M.\mathcal{M}.

ABC

Figure 7. A set A∈M,{A \in \mathcal{M},} a set C∈M{C \in \mathcal{M}} with μ(C)=0,{\mu(C) = 0,} dashed, and a set B⊂C.{B \subset C.}

Definition 9 (Negligible set, complete measure space). Let (X,M,μ)(X, \mathcal{M}, \mu) be a measure space.
(i) A set E∈M{E \in \mathcal{M}} is called a set of zero measure if μ(E)=0.{\mu(E) = 0.}
(ii) A set F⊂X{F \subset X} is called negligible if there exists E∈M{E \in \mathcal{M}} such that μ(E)=0{\mu(E) = 0} and F⊂E.{F \subset E.}
(iii) The measure space is called complete if every negligible set belongs to M.\mathcal{M}.

Theorem 10 (Completion of measure spaces). Let (X,M,μ)(X, \mathcal{M}, \mu) be a measure space. There exists a measure space (X,M‾,μ‾){(X, \overline{\mathcal{M}}, \overline{\mu})} such that:
(i) (X,M‾,μ‾){(X, \overline{\mathcal{M}}, \overline{\mu})} is complete;
(ii) M⊂M‾;{\mathcal{M} \subset \overline{\mathcal{M}};}
(iii) μ‾(E)=μ(E){\overline{\mu}(E) = \mu(E)} for every E∈M.{E \in \mathcal{M}.}

Proof (sketch). One defines

M‾={E⊂X:there exist F1,F2∈M such that F1⊂E⊂F2 and μ(F2∖F1)=0}.\overline{\mathcal{M}} = \{ E \subset X : \text{there exist } F_1, F_2 \in \mathcal{M} \text{ such that } F_1 \subset E \subset F_2 \text{ and } \mu(F_2 \setminus F_1) = 0 \}.

For such sets E,E, F1F_1 and F2,F_2, as in Figure 8, one defines

μ‾(E):=μ(F1)=μ(F2).\overline{\mu}(E) := \mu(F_1) = \mu(F_2).
EF1F2μ(F2 \ F1) = 0

Figure 8. A set EE between two sets F1⊂E⊂F2{F_1 \subset E \subset F_2} of M\mathcal{M} with μ(F2∖F1)=0.{\mu(F_2 \setminus F_1) = 0.}

Details. The two values agree, since μ(F2)=μ(F1)+μ(F2∖F1)=μ(F1){\mu(F_2) = \mu(F_1) + \mu(F_2 \setminus F_1) = \mu(F_1)} as in the proof of Remark 5. They do not depend on the choice of F1F_1 and F2:F_2{:} if also G1⊂E⊂G2{G_1 \subset E \subset G_2} with G1,G2∈M{G_1, G_2 \in \mathcal{M}} and μ(G2∖G1)=0,{\mu(G_2 \setminus G_1) = 0,} then μ(F1)≤μ(G2)=μ(G1)≤μ(F2)=μ(F1){\mu(F_1) \le \mu(G_2) = \mu(G_1) \le \mu(F_2) = \mu(F_1)} by Remark 5 (i). ■\blacksquare

Remark 11. Negligible sets in (X,M,μ)(X, \mathcal{M}, \mu) become measurable in (X,M‾,μ‾).{(X, \overline{\mathcal{M}}, \overline{\mu}).}

Proof (complete). Let F⊂X{F \subset X} be negligible. Then there exists E∈M{E \in \mathcal{M}} such that F⊂E{F \subset E} and μ(E)=0.{\mu(E) = 0.} To check that F∈M‾,{F \in \overline{\mathcal{M}},} notice that ∅⊂F⊂E,{\emptyset \subset F \subset E,} that μ(∅)=μ(E)=0{\mu(\emptyset) = \mu(E) = 0} and that μ(E∖∅)=μ(E)=0.{\mu(E \setminus \emptyset) = \mu(E) = 0.} Hence F∈M‾{F \in \overline{\mathcal{M}}} and μ‾(F)=0.{\overline{\mu}(F) = 0.} ■\blacksquare

Outer measures

The plan starts from a function f ⁣:F→[0,+∞]{f \colon \mathcal{F} \to [0, +\infty]} on a family F⊂P(X){\mathcal{F} \subset \mathcal{P}(X)} and ends with a measure μ ⁣:M→[0,+∞]{\mu \colon \mathcal{M} \to [0, +\infty]} with F⊂M.{\mathcal{F} \subset \mathcal{M}.} As Figure 9 shows, the way from the start to the end passes through outer measures, not directly.

Startfunctionf : F[0, +∞]F ⊂ P(X)outer measuresEndmeasureμ : M[0, +∞]F ⊂ M

Figure 9. The plan: from a function ff on F\mathcal{F} to outer measures, and from outer measures to a measure μ\mu on a σ\sigma-algebra M⊃F.{\mathcal{M} \supset \mathcal{F}.} The direct way is crossed out.

Definition 12 (Outer measure). Let XX be a set. An outer measure is a function μ∗ ⁣:P(X)→[0,+∞]{\mu^* \colon \mathcal{P}(X) \to [0, +\infty]} such that:
(i) μ∗(∅)=0;{\mu^*(\emptyset) = 0;}

(ii) (σ\sigma-subadditivity) for every (En)⊂P(X){(E_n) \subset \mathcal{P}(X)} and every E⊂⋃nEn,{E \subset \bigcup_n E_n,}

μ∗(E)≤∑n=0∞μ∗(En).\mu^*(E) \le \sum_{n=0}^{\infty} \mu^*(E_n).

Remark 13 (Monotonicity). If μ∗\mu^* is an outer measure and E⊂F,{E \subset F,} then μ∗(E)≤μ∗(F).{\mu^*(E) \le \mu^*(F).} Indeed, (ii) of Definition 12 applies with E0=F{E_0 = F} and En=∅{E_n = \emptyset} for n≥1,{n \ge 1,} and μ∗(∅)=0.{\mu^*(\emptyset) = 0.}

Theorem 14 (Construction of outer measure). Let XX be a set, let F⊂P(X){\mathcal{F} \subset \mathcal{P}(X)} be such that ∅∈F,{\emptyset \in \mathcal{F},} and let f ⁣:F→[0,+∞]{f \colon \mathcal{F} \to [0, +\infty]} be such that f(∅)=0.{f(\emptyset) = 0.} For every E⊂X{E \subset X} define

μ∗(E):=inf⁡{∑n=0∞f(An):(An)⊂F, E⊂⋃nAn}.\mu^*(E) := \inf \Big\{ \sum_{n=0}^{\infty} f(A_n) : (A_n) \subset \mathcal{F}, \ E \subset \bigcup_n A_n \Big\}.

Then μ∗\mu^* is an outer measure.

EAn

Figure 10. A set EE and a sequence of sets AnA_n whose union contains E,E, one of the sequences in the definition of μ∗(E).\mu^*(E).

Remark 15. If there is no (An)⊂F{(A_n) \subset \mathcal{F}} such that E⊂⋃nAn,{E \subset \bigcup_n A_n,} then μ∗(E)=+∞.{\mu^*(E) = +\infty.}

Definition 16 (μ∗\mu^*-measurable set). Let XX be a set and μ∗\mu^* an outer measure on X.X. A set E⊂X{E \subset X} is called a μ∗\mu^*-measurable set if, for every Z⊂X,{Z \subset X,}

μ∗(Z)=μ∗(Z∩E)+μ∗(Z∖E).\mu^*(Z) = \mu^*(Z \cap E) + \mu^*(Z \setminus E).
EZZ ∩ EZ \ E

Figure 11. A set EE and a set Z,Z, split into Z∩E{Z \cap E} and Z∖E.{Z \setminus E.}

Remark 17. For every E,Z⊂X{E, Z \subset X} it is always true that

μ∗(Z)=μ∗((Z∩E)∪(Z∖E))≤μ∗(Z∩E)+μ∗(Z∖E).\mu^*(Z) = \mu^*\big( (Z \cap E) \cup (Z \setminus E) \big) \le \mu^*(Z \cap E) + \mu^*(Z \setminus E).

Indeed, the inequality is (ii) of Definition 12 with E0=Z∩E,{E_0 = Z \cap E,} E1=Z∖E{E_1 = Z \setminus E} and En=∅{E_n = \emptyset} for n≥2.{n \ge 2.}

Theorem 18 (Carathéodory’s construction of measures). Let XX be a set and μ∗\mu^* an outer measure on X.X. Let

M:={E⊂X:E is μ∗-measurable},\mathcal{M} := \{ E \subset X : E \text{ is } \mu^*\text{-measurable} \},

and let μ=μ∗∣M.{\mu = \mu^*|_{\mathcal{M}}.} Then:
(i) M\mathcal{M} is a σ\sigma-algebra;
(ii) (X,M,μ)(X, \mathcal{M}, \mu) is a measure space;
(iii) (X,M,μ)(X, \mathcal{M}, \mu) is complete.

Proof (sketch). Parts (ii) and (iii) are proved; part (i) is not.

(ii) Since μ=μ∗∣M,{\mu = \mu^*|_{\mathcal{M}},} what needs to be proved is that μ∗\mu^* is σ\sigma-additive on M,\mathcal{M}, the family of the μ∗\mu^*-measurable sets.

Step 1. If E,F∈M{E, F \in \mathcal{M}} and E∩F=∅,{E \cap F = \emptyset,} then μ∗(E∪F)=μ∗(E)+μ∗(F).{\mu^*(E \cup F) = \mu^*(E) + \mu^*(F).} Let Z=E∪F,{Z = E \cup F,} as in Figure 12. Since E∈M,{E \in \mathcal{M},}

μ∗(E∪F)=μ∗(Z)=μ∗(Z∩E)+μ∗(Z∖E)=μ∗(E)+μ∗(F).\mu^*(E \cup F) = \mu^*(Z) = \mu^*(Z \cap E) + \mu^*(Z \setminus E) = \mu^*(E) + \mu^*(F).

Indeed, Z∩E=E{Z \cap E = E} and Z∖E=F{Z \setminus E = F} because E∩F=∅.{E \cap F = \emptyset.}

EFZ = E ∪ F

Figure 12. Two disjoint sets EE and FF and their union Z.Z.

Step 2. Let (En)⊂M{(E_n) \subset \mathcal{M}} with Ei∩Ej=∅{E_i \cap E_j = \emptyset} for every i≠j.{i \neq j.} Then

μ∗(⋃nEn)≤∑n=0∞μ∗(En)=lim⁡N→∞(∑n=0Nμ∗(En))=lim⁡N→∞μ∗(⋃n=0NEn)≤μ∗(⋃n=0∞En),\begin{aligned} \mu^*\Big( \bigcup_n E_n \Big) &\le \sum_{n=0}^{\infty} \mu^*(E_n) = \lim_{N \to \infty} \Big( \sum_{n=0}^{N} \mu^*(E_n) \Big) \\ &= \lim_{N \to \infty} \mu^*\Big( \bigcup_{n=0}^{N} E_n \Big) \le \mu^*\Big( \bigcup_{n=0}^{\infty} E_n \Big), \end{aligned}

where the first inequality is σ\sigma-subadditivity, the second equality is Step 1, and the last inequality is monotonicity, as ⋃n=0NEn⊂⋃n=0∞En.{\bigcup_{n=0}^{N} E_n \subset \bigcup_{n=0}^{\infty} E_n.} Indeed, Step 1 extends to N+1{N + 1} sets by induction on N,N, because ⋃n=0N−1En{\bigcup_{n=0}^{N-1} E_n} belongs to M\mathcal{M} by (i) and is disjoint from EN.E_N. The chain starts and ends with the same number, hence

μ∗(⋃n=0∞En)=∑n=0∞μ∗(En).\mu^*\Big( \bigcup_{n=0}^{\infty} E_n \Big) = \sum_{n=0}^{\infty} \mu^*(E_n).

(iii) Step 1. If μ∗(E)=0,{\mu^*(E) = 0,} then E∈M,{E \in \mathcal{M},} that is, EE is μ∗\mu^*-measurable. Let Z⊂X.{Z \subset X.} Then

μ∗(Z∩E)+μ∗(Z∖E)≤μ∗(E)+μ∗(Z)=μ∗(Z)≤μ∗(Z∩E)+μ∗(Z∖E),\begin{aligned} \mu^*(Z \cap E) + \mu^*(Z \setminus E) &\le \mu^*(E) + \mu^*(Z) \\ &= \mu^*(Z) \\ &\le \mu^*(Z \cap E) + \mu^*(Z \setminus E), \end{aligned}

where the first inequality is monotonicity, as Z∩E⊂E{Z \cap E \subset E} and Z∖E⊂Z,{Z \setminus E \subset Z,} the equality uses μ∗(E)=0,{\mu^*(E) = 0,} and the last inequality is the one of Remark 17. Hence equality holds throughout.

Step 2. Let FF be negligible in (X,M,μ),(X, \mathcal{M}, \mu), that is, let there exist E∈M{E \in \mathcal{M}} such that F⊂E{F \subset E} and μ(E)=0,{\mu(E) = 0,} where μ(E)=μ∗(E).{\mu(E) = \mu^*(E).} By monotonicity, 0≤μ∗(F)≤μ∗(E)=0,{0 \le \mu^*(F) \le \mu^*(E) = 0,} so μ∗(F)=0{\mu^*(F) = 0} and F∈M{F \in \mathcal{M}} by Step 1. ■\blacksquare

Exercises

The first exercise computes a generated σ\sigma-algebra, and the second checks Definition 1 on a σ\sigma-algebra of subsets of R.\mathbb{R}.

A family of subsets of the integers

Example 19. Let F⊂P(Z){\mathcal{F} \subset \mathcal{P}(\mathbb{Z})} be

F:={∅,{0},{−1,0,1},{−2,−1,0,1,2},…}={∅}∪{{−k,−k+1,…,k−1,k}:k∈N}.\begin{aligned} \mathcal{F} &:= \big\{ \emptyset, \{0\}, \{-1, 0, 1\}, \{-2, -1, 0, 1, 2\}, \dots \big\} \\ &= \{ \emptyset \} \cup \big\{ \{-k, -k+1, \dots, k-1, k\} : k \in \mathbb{N} \big\}. \end{aligned}

What is σ0(F)\sigma_0(\mathcal{F})? The guess is σ0(F)=S,{\sigma_0(\mathcal{F}) = S,} where

S:={A⊂Z:x∈A  ⟺  −x∈A}.S := \{ A \subset \mathbb{Z} : x \in A \iff -x \in A \}.

The sets of SS are the symmetric subsets of Z.\mathbb{Z}.

Step 1. The claim is S⊂σ0(F).{S \subset \sigma_0(\mathcal{F}).} First, {−k,k}∈σ0(F){\{-k, k\} \in \sigma_0(\mathcal{F})} for every k∈N,{k \in \mathbb{N},} because, as in Figure 13,

{−k,k}={−k,…,k}∖{−k+1,…,k−1}.\{-k, k\} = \{-k, \dots, k\} \setminus \{-k+1, \dots, k-1\}.

Indeed, for k≥1{k \ge 1} both sets on the right belong to F,\mathcal{F}, for k=0{k = 0} the second set is empty and {0}∈F,{\{0\} \in \mathcal{F},} and a σ\sigma-algebra is closed under differences by Remark 24 of the previous post.

{−3, …, 3}{−2, …, 2}{−3, 3}−7−3037

Figure 13. The sets {−k,…,k}\{-k, \dots, k\} and {−k+1,…,k−1}\{-k+1, \dots, k-1\} of Z,\mathbb{Z}, and their difference {−k,k}.\{-k, k\}. The slider sets k.k.

Now take E∈S,{E \in S,} as in Figure 14. The set EE is a countable union of sets of the form {−k,k}\{-k, k\} with k∈N,{k \in \mathbb{N},} so E∈σ0(F),{E \in \sigma_0(\mathcal{F}),} and therefore S⊂σ0(F).{S \subset \sigma_0(\mathcal{F}).} Indeed, since EE is symmetric, it is the union of the sets {−k,k}\{-k, k\} over the k∈N{k \in \mathbb{N}} that belong to E.E.

……E0

Figure 14. An instance of a set E∈S:{E \in S{:}} its points are filled, and each arc joins the two points of a set {−k,k}.\{-k, k\}.

Step 2. The set SS is a σ\sigma-algebra. This concludes, as σ0(F)\sigma_0(\mathcal{F}) is the smallest σ\sigma-algebra containing F.\mathcal{F}. Indeed, every set of F\mathcal{F} is symmetric, so F⊂S{\mathcal{F} \subset S} and σ0(F)⊂S{\sigma_0(\mathcal{F}) \subset S} by Theorem 26 (ii) of the previous post. Now ∅∈S,{\emptyset \in S,} the complement Z∖A{\mathbb{Z} \setminus A} of a set A∈S{A \in S} is also symmetric, as in Figure 15, and any union of symmetric sets is symmetric as well.

……A0……ℤ \ A0

Figure 15. An instance of a set A∈S{A \in S} and, below it, its complement Z∖A,{\mathbb{Z} \setminus A,} which is symmetric too.

Countable sets and their complements

Example 20. Let

M:={A⊂R:A is countable or R∖A is countable}.\mathcal{M} := \{ A \subset \mathbb{R} : A \text{ is countable or } \mathbb{R} \setminus A \text{ is countable} \}.

(i) Is M\mathcal{M} a σ\sigma-algebra? The countable union property is checked: let (An)⊂M;{(A_n) \subset \mathcal{M};} what needs to be proved is ⋃nAn∈M.{\bigcup_n A_n \in \mathcal{M}.} The other properties of a σ\sigma-algebra hold as well. Indeed, ∅\emptyset is countable, and the definition of M\mathcal{M} does not change when AA is replaced by R∖A.{\mathbb{R} \setminus A.}

Case 1. Suppose that AnA_n is countable for every n.n. Then ⋃nAn\bigcup_n A_n is countable, hence ⋃nAn∈M.{\bigcup_n A_n \in \mathcal{M}.}

Case 2. Suppose that there exists n0n_0 such that R∖An0{\mathbb{R} \setminus A_{n_0}} is countable. Then

R∖⋃nAn=⋂n(R∖An)⊂R∖An0,(1)\mathbb{R} \setminus \bigcup_n A_n = \bigcap_n (\mathbb{R} \setminus A_n) \subset \mathbb{R} \setminus A_{n_0}, \tag{1}

so R∖⋃nAn{\mathbb{R} \setminus \bigcup_n A_n} is countable, and ⋃nAn∈M.{\bigcup_n A_n \in \mathcal{M}.}

(ii) Let μ ⁣:M→[0,+∞]{\mu \colon \mathcal{M} \to [0, +\infty]} be

μ(A)={0if A is countable,1if R∖A is countable.\mu(A) = \begin{cases} 0 & \text{if } A \text{ is countable}, \\ 1 & \text{if } \mathbb{R} \setminus A \text{ is countable}. \end{cases}

Is μ\mu a measure? The property to check is σ\sigma-additivity: let (An)⊂M{(A_n) \subset \mathcal{M}} be such that Ai∩Aj=∅{A_i \cap A_j = \emptyset} for every i≠j.{i \neq j.} Indeed, μ\mu is well defined, because AA and R∖A{\mathbb{R} \setminus A} are not both countable, otherwise R\mathbb{R} would be countable, against Proposition 9 (i) of the previous post; and μ(∅)=0.{\mu(\emptyset) = 0.}

Case 1. Suppose that AnA_n is countable for every n.n. Then ⋃nAn\bigcup_n A_n is countable, so both μ(⋃nAn)=0{\mu(\bigcup_n A_n) = 0} and μ(An)=0{\mu(A_n) = 0} for every n,n, and

μ(⋃nAn)=0=∑n=0∞μ(An).\mu\Big( \bigcup_n A_n \Big) = 0 = \sum_{n=0}^{\infty} \mu(A_n).

Case 2. Suppose that there exists n0n_0 such that R∖An0{\mathbb{R} \setminus A_{n_0}} is countable. Also An∩An0=∅{A_n \cap A_{n_0} = \emptyset} for every n≠n0,{n \neq n_0,} so An⊂R∖An0,{A_n \subset \mathbb{R} \setminus A_{n_0},} and AnA_n is countable for every n≠n0.{n \neq n_0.} Now

∑n=0∞μ(An)=μ(An0)=1andμ(⋃nAn)=1,\sum_{n=0}^{\infty} \mu(A_n) = \mu(A_{n_0}) = 1 \qquad \text{and} \qquad \mu\Big( \bigcup_n A_n \Big) = 1,

where the last equality holds because, by (1), R∖⋃nAn{\mathbb{R} \setminus \bigcup_n A_n} is contained in the countable set R∖An0.{\mathbb{R} \setminus A_{n_0}.}