Alessandro Palliccia

Real and Functional Analysis

The Vitali example, measurable functions and simple functions

1,900 words, , published

The Lebesgue measure of the previous post is defined on the σ\sigma-algebra L(RN),{\mathcal{L}(\mathbb{R}^N),} which contains B(RN)\mathcal{B}(\mathbb{R}^N) and is contained in P(RN).{\mathcal{P}(\mathbb{R}^N).} The lecture shows that both inclusions are strict, and then passes from measurable sets to measurable functions.

The Vitali example

Theorem 1 (Vitali). Let E∈L(RN){E \in \mathcal{L}(\mathbb{R}^N)} with λ(E)>0.{\lambda(E) > 0.} Then there exists F0⊂E{F_0 \subset E} such that F0∉L(RN).{F_0 \notin \mathcal{L}(\mathbb{R}^N).} In particular, L(RN)⊊P(RN).{\mathcal{L}(\mathbb{R}^N) \subsetneq \mathcal{P}(\mathbb{R}^N).}

Proof (sketch). Only the case E⊂[0,1]⊂R{E \subset [0, 1] \subset \mathbb{R}} is proved, so that N=1.{N = 1.} Recall that an equivalence relation on EE is a binary relation ∼\sim such that, for all x,y,z∈E,{x, y, z \in E,}

x∼x,x∼y  ⟺  y∼x,x∼y, y∼z  ⟹  x∼z.x \sim x, \qquad x \sim y \iff y \sim x, \qquad x \sim y, \ y \sim z \implies x \sim z.

The equivalence classes of ∼\sim split E,{E,} and picking one element from each equivalence class one can make a new set F0⊂E,{F_0 \subset E,} as in Figure 1. The picking uses the axiom of choice.

Epicked elements, which form F0other elements

Figure 1. A set EE split into its equivalence classes, and one element picked from each class, darker. The picked elements form the set F0.{F_0.}

Now consider on EE the relation given by x∼y{x \sim y} if x−y∈Q.{x - y \in \mathbb{Q}.} Let F0⊂E{F_0 \subset E} be given by picking an element from each equivalence class, and define

Fq:=q+F0for every q∈Q.F_q := q + F_0 \qquad \text{for every } q \in \mathbb{Q}.

Step 1. For all p,q∈Q{p, q \in \mathbb{Q}} with p≠q,{p \neq q,} the sets FqF_q and FpF_p are disjoint. Suppose that Fq∩Fp≠∅.{F_q \cap F_p \neq \emptyset.} Then there exist x,y∈F0{x, y \in F_0} such that q+x=p+y.{q + x = p + y.} Hence x−y=p−q∈Q,{x - y = p - q \in \mathbb{Q},} so x∼y,{x \sim y,} which is impossible. Indeed, F0F_0 contains one element of each equivalence class, so x∼y{x \sim y} gives x=y{x = y} and then p=q.{p = q.}

Step 2. The sets FqF_q with ∣q∣≤1{|q| \le 1} satisfy

E⊂⋃q∈Q, ∣q∣≤1Fq⊂[−2,2].E \subset \bigcup_{q \in \mathbb{Q}, \, |q| \le 1} F_q \subset [-2, 2].

Let x∈E.{x \in E.} Then there exists a unique y∈F0{y \in F_0} with x∼y,{x \sim y,} that is, a rational qq such that x−y=q.{x - y = q.} Then x=y+q,{x = y + q,} so x∈Fq.{x \in F_q.} Moreover, ∣q∣=∣x−y∣≤1{|q| = |x - y| \le 1} because x,y∈[0,1].{x, y \in [0, 1].} For the second inclusion, let x∈Fq{x \in F_q} with ∣q∣≤1,{|q| \le 1,} as in Figure 2. There exists y∈F0{y \in F_0} such that x=q+y,{x = q + y,} hence ∣x∣=∣q+y∣≤∣q∣+∣y∣≤1+1=2.{|x| = |q + y| \le |q| + |y| \le 1 + 1 = 2.}

[0, 1]q + [0, 1]−2−1012

Figure 2. The interval [0,1],{[0, 1],} which contains EE and F0,{F_0,} and its translate q+[0,1],{q + [0, 1],} which contains FqF_q and lies in [−2,2].{[-2, 2].} The slider sets the rational number qq among the multiples of 1/81/8 between −1-1 and 1.{1.}

Step 3. Suppose, by contradiction, that F0∈L(R).{F_0 \in \mathcal{L}(\mathbb{R}).} Then

λ(⋃q∈Q, ∣q∣≤1Fq)=∑q∈Q, ∣q∣≤1λ(Fq)=∑q∈Q, ∣q∣≤1λ(F0).\lambda\Big( \bigcup_{q \in \mathbb{Q}, \, |q| \le 1} F_q \Big) = \sum_{q \in \mathbb{Q}, \, |q| \le 1} \lambda(F_q) = \sum_{q \in \mathbb{Q}, \, |q| \le 1} \lambda(F_0).

Indeed, every FqF_q belongs to L(R)\mathcal{L}(\mathbb{R}) and has measure λ(F0)\lambda(F_0) by part (2) of Theorem 4 of the previous post. The sets FqF_q are countably many and pairwise disjoint by Step 1, so the first equality is σ\sigma-additivity.

By Step 2 and monotonicity, the left-hand side is at least λ(E)>0,{\lambda(E) > 0,} hence λ(F0)>0.{\lambda(F_0) > 0.} By Step 2 again, it is at most λ([−2,2])=4,{\lambda([-2, 2]) = 4,} hence λ(F0)=0.{\lambda(F_0) = 0.} This is impossible. In detail, the sum has infinitely many terms, all equal to λ(F0),{\lambda(F_0),} so it is 00 when λ(F0)=0{\lambda(F_0) = 0} and +∞+\infty when λ(F0)>0.{\lambda(F_0) > 0.} ■\blacksquare

Measurable functions

Definition 2 (Measurable function). Let (X,MX)(X, \mathcal{M}_X) and (Y,MY)(Y, \mathcal{M}_Y) be measurable spaces. A function f ⁣:X→Y{f \colon X \to Y} is called (MX,MY)(\mathcal{M}_X, \mathcal{M}_Y)-measurable if f−1(E)∈MX{f^{-1}(E) \in \mathcal{M}_X} for every E∈MY.{E \in \mathcal{M}_Y.}

XYEf−1(E)f

Figure 3. An instance: a function f ⁣:X→Y,{f \colon X \to Y,} a set E∈MY{E \in \mathcal{M}_Y} and its preimage f−1(E),{f^{-1}(E),} the points of XX that ff sends into E.{E.}

Proposition 3. Let (X,MX)(X, \mathcal{M}_X) and (Y,MY)(Y, \mathcal{M}_Y) be measurable spaces, and suppose that MY=σ0(F){\mathcal{M}_Y = \sigma_0(\mathcal{F})} for some F⊂P(Y).{\mathcal{F} \subset \mathcal{P}(Y).} Let f ⁣:X→Y.{f \colon X \to Y.} Then ff is (MX,MY)(\mathcal{M}_X, \mathcal{M}_Y)-measurable if and only if f−1(E)∈MX{f^{-1}(E) \in \mathcal{M}_X} for every E∈F.{E \in \mathcal{F}.}

Proof (complete). We prove that the condition on F\mathcal{F} implies measurability. Let

N:={E⊂Y:f−1(E)∈MX}.\mathcal{N} := \{ E \subset Y : f^{-1}(E) \in \mathcal{M}_X \}.

Step 1. By hypothesis, F⊂N.{\mathcal{F} \subset \mathcal{N}.} The goal is N⊃MY.{\mathcal{N} \supset \mathcal{M}_Y.}

Step 2. It is enough to prove that N\mathcal{N} is a σ\sigma-algebra. At that point MY=σ0(F)⊂N{\mathcal{M}_Y = \sigma_0(\mathcal{F}) \subset \mathcal{N}} by Theorem 26 (ii) of the first post, as in Figure 4.

P(Y)NMY = σ0(F)F

Figure 4. Inside P(Y),{\mathcal{P}(Y),} the family F,{\mathcal{F},} the σ\sigma-algebra MY=σ0(F){\mathcal{M}_Y = \sigma_0(\mathcal{F})} that it generates, and the family N,{\mathcal{N},} which contains F\mathcal{F} and, being a σ\sigma-algebra, contains MY.{\mathcal{M}_Y.}

To prove Step 2, note first that ∅∈N.{\emptyset \in \mathcal{N}.} If E∈N,{E \in \mathcal{N},} then

f−1(Y∖E)=f−1(Y)∖f−1(E)=X∖f−1(E),f^{-1}(Y \setminus E) = f^{-1}(Y) \setminus f^{-1}(E) = X \setminus f^{-1}(E),

where X∈MX{X \in \mathcal{M}_X} and f−1(E)∈MX.{f^{-1}(E) \in \mathcal{M}_X.} Hence f−1(Y∖E)∈MX,{f^{-1}(Y \setminus E) \in \mathcal{M}_X,} that is, Y∖E∈N.{Y \setminus E \in \mathcal{N}.} If (Em)⊂N,{(E_m) \subset \mathcal{N},} then

f−1(⋃mEm)=⋃mf−1(Em),f^{-1}\Big( \bigcup_m E_m \Big) = \bigcup_m f^{-1}(E_m),

where every f−1(Em)f^{-1}(E_m) belongs to MX.{\mathcal{M}_X.} Hence f−1(⋃mEm)∈MX,{f^{-1}(\bigcup_m E_m) \in \mathcal{M}_X,} that is, ⋃mEm∈N.{\bigcup_m E_m \in \mathcal{N}.} The converse implication holds as well. Indeed, F⊂σ0(F)=MY.{\mathcal{F} \subset \sigma_0(\mathcal{F}) = \mathcal{M}_Y.} ■\blacksquare

From now on, f ⁣:X→Y,{f \colon X \to Y,} where (X,d)(X, d) is a metric space, (X,MX)(X, \mathcal{M}_X) is a measurable space with B(X)⊂MX,{\mathcal{B}(X) \subset \mathcal{M}_X,} and YY is one of the sets

R,R‾,[0,+∞),[0,+∞],(−∞,+∞],\mathbb{R}, \qquad \overline{\mathbb{R}}, \qquad [0, +\infty), \qquad [0, +\infty], \qquad (-\infty, +\infty],

drawn in Figure 5. On YY only the Borel σ\sigma-algebra B(Y)\mathcal{B}(Y) of Definition 27 of the first post is considered.

−∞0+∞

Figure 5. From top to bottom, the sets R,{\mathbb{R},} R‾,{\overline{\mathbb{R}},} [0,+∞),{[0, +\infty),} [0,+∞][0, +\infty] and (−∞,+∞](-\infty, +\infty] on the extended real line. A filled end belongs to the set, an empty one does not.

Definition 4 (Borel measurable and measurable functions). A function f ⁣:X→Y{f \colon X \to Y} is said to be:
(i) Borel measurable if it is (B(X),B(Y))(\mathcal{B}(X), \mathcal{B}(Y))-measurable;
(ii) measurable, also called Lebesgue measurable, if it is (MX,B(Y))(\mathcal{M}_X, \mathcal{B}(Y))-measurable.

Remark 5. (i) If a function f ⁣:X→Y{f \colon X \to Y} is Borel measurable, then it is measurable. By Proposition 3, applied to the family of the open sets of Y,{Y,} which generates B(Y),{\mathcal{B}(Y),} the two properties read as follows:

f Borel measurable⟹f measurable⇕⇕f−1(E)∈B(X)  ∀E openf−1(E)∈MX  ∀E open.\begin{array}{ccc} f \text{ Borel measurable} & \Longrightarrow & f \text{ measurable} \\[4pt] \Updownarrow & & \Updownarrow \\[4pt] f^{-1}(E) \in \mathcal{B}(X) \ \ \forall E \text{ open} & & f^{-1}(E) \in \mathcal{M}_X \ \ \forall E \text{ open.} \end{array}

(ii) If ff is continuous, then ff is Borel measurable: for every open set EE the set f−1(E)f^{-1}(E) is open, hence f−1(E)∈B(X).{f^{-1}(E) \in \mathcal{B}(X).}
(iii) Let g ⁣:Y→Z,{g \colon Y \to Z,} where ZZ carries its Borel σ\sigma-algebra B(Z).{\mathcal{B}(Z).} If ff is measurable and gg is continuous, then g∘f{g \circ f} is measurable.

Example 6. If f ⁣:X→R‾{f \colon X \to \overline{\mathbb{R}}} is measurable, then

f+:=max⁡{f,0},f−:=−min⁡{f,0},∣f∣f^+ := \max\{f, 0\}, \qquad f^- := -\min\{f, 0\}, \qquad |f|

are all measurable, and Figure 6 draws them for an instance. Indeed, they are g∘f{g \circ f} with g(t)=max⁡{t,0},{g(t) = \max\{t, 0\},} g(t)=−min⁡{t,0}{g(t) = -\min\{t, 0\}} and g(t)=∣t∣,{g(t) = |t|,} continuous functions from R‾\overline{\mathbb{R}} to [0,+∞],{[0, +\infty],} so Remark 5 (iii) applies.

01f01f+01f−01|f|

Figure 6. An instance with X=[0,1]:{X = [0, 1]{:}} a continuous function f,{f,} and the functions f+,{f^+,} f−f^- and ∣f∣.{|f|.}

Remark 7. (i) If f,g ⁣:X→(−∞,+∞]{f, g \colon X \to (-\infty, +\infty]} are measurable, then f+g{f + g} and f⋅g{f \cdot g} are both measurable, where f⋅g{f \cdot g} takes values in R‾\overline{\mathbb{R}} and is computed with the operations of Definition 5 of the first post.

(ii) If fm ⁣:X→R‾{f_m \colon X \to \overline{\mathbb{R}}} is measurable for every m,{m,} then the following functions are all measurable:

sup⁡mfm,inf⁡mfm,lim‾⁡mfm,lim‾⁡mfm.\sup_m f_m, \qquad \inf_m f_m, \qquad \varlimsup_m f_m, \qquad \varliminf_m f_m.

(iii) For E⊂X,{E \subset X,} the characteristic function of EE is the function χE ⁣:X→R{\chi_E \colon X \to \mathbb{R}} given by

χE(x)={1x∈E,0x∉E.\chi_E(x) = \begin{cases} 1 & x \in E, \\ 0 & x \notin E. \end{cases}

Then χE\chi_E is measurable if and only if E∈MX.{E \in \mathcal{M}_X.}

Properties defined almost everywhere

Definition 8 (Almost everywhere). Let (X,M,μ){(X, \mathcal{M}, \mu)} be a complete measure space. A property PP holds almost everywhere, or μ\mu-almost everywhere, if the set

{x∈X:P(x) is false}\{ x \in X : P(x) \text{ is false} \}

is negligible in the sense of Definition 9 of the second post. In particular, its measure is zero.

Example 9. On R\mathbb{R} with the Lebesgue measure λ:{\lambda{:}}
(i) if f ⁣:R→R{f \colon \mathbb{R} \to \mathbb{R}} is 00 at every point except one, where it is 1,{1,} as in Figure 7, then f=0{f = 0} almost everywhere;
(ii) the Dirichlet function χQ ⁣:R→R{\chi_{\mathbb{Q}} \colon \mathbb{R} \to \mathbb{R}} satisfies χQ=0{\chi_{\mathbb{Q}} = 0} almost everywhere, because λ(Q)=0;{\lambda(\mathbb{Q}) = 0;}
(iii) the Cantor function v ⁣:[0,1]→[0,1]{v \colon [0, 1] \to [0, 1]} of Example 8 of the previous post has a derivative v′v' almost everywhere, and v′=0{v' = 0} almost everywhere.

10f

Figure 7. The function ff of Example 9 (i): it is 00 at every point except one, where it is 1.{1.} The empty circle marks the point of the axis that is not on the graph.

Definition 10 (Convergence almost everywhere). Let (X,M,μ){(X, \mathcal{M}, \mu)} be a complete measure space, and let fm ⁣:X→R‾,{f_m \colon X \to \overline{\mathbb{R}},} for every m,{m,} and f ⁣:X→R‾{f \colon X \to \overline{\mathbb{R}}} be measurable. We say that fmf_m converges almost everywhere to ff if lim⁡m→+∞fm(x)=f(x){\lim_{m \to +\infty} f_m(x) = f(x)} at almost every x∈X.{x \in X.}

Remark 11. If fm→f{f_m \to f} uniformly, then fm→f{f_m \to f} pointwise, hence fm→f{f_m \to f} almost everywhere (K. Ross, “Elementary Analysis”).

Proposition 12. Let (X,M,μ){(X, \mathcal{M}, \mu)} be a complete measure space.
(1) If f,g ⁣:X→R‾,{f, g \colon X \to \overline{\mathbb{R}},} ff is measurable and f=g{f = g} almost everywhere, then gg is measurable.
(2) If fm,f ⁣:X→R‾,{f_m, f \colon X \to \overline{\mathbb{R}},} fmf_m is measurable for every mm and fm→f{f_m \to f} almost everywhere, then ff is measurable.

The strict inclusion B(RN)⊊L(RN)\mathcal{B}(\mathbb{R}^N) \subsetneq \mathcal{L}(\mathbb{R}^N)

The construction uses Theorem 1 and the Cantor function of Example 8 of the previous post.

Theorem 13. There exists F∈L(R)∖B(R).{F \in \mathcal{L}(\mathbb{R}) \setminus \mathcal{B}(\mathbb{R}).}

Proof (complete). Let TT be the Cantor set of Definition 5 of the previous post, so that T⊂[0,1].{T \subset [0, 1].} Then

T=[0,1]∖A,A=⋃m(am,bm),T = [0, 1] \setminus A, \qquad A = \bigcup_m (a_m, b_m),

where the open intervals (am,bm)(a_m, b_m) are pairwise disjoint, and

∑m(bm−am)=1.\sum_m (b_m - a_m) = 1.

Indeed, AA is the union of the open middle thirds removed in the construction of T,{T,} and the sum equals λ(A)\lambda(A) by σ\sigma-additivity, where λ(A)=1−λ(T)=1{\lambda(A) = 1 - \lambda(T) = 1} by Theorem 6 of the previous post.

Let v ⁣:[0,1]→[0,1]{v \colon [0, 1] \to [0, 1]} be the Cantor function of Example 8 of the previous post, and let f ⁣:[0,1]→[0,2]{f \colon [0, 1] \to [0, 2]} be f(x)=x+v(x),{f(x) = x + v(x),} as in Figure 8. The function ff is strictly increasing and continuous, hence there exists its inverse g=f−1 ⁣:[0,2]→[0,1],{g = f^{-1} \colon [0, 2] \to [0, 1],} and gg is continuous. Indeed, x↦x{x \mapsto x} is strictly increasing and vv is nondecreasing and continuous, while f(0)=0{f(0) = 0} and f(1)=2{f(1) = 2} make ff onto [0,2][0, 2] by the intermediate value theorem. The inverse of a continuous strictly increasing function on an interval is continuous.

1210vf

Figure 8. The graphs of the Cantor function vv and of f(x)=x+v(x){f(x) = x + v(x)} on [0,1].{[0, 1].}

Now, since ff is bijective,

2=λ([0,2])=λ(f([0,1]))=λ(f(A))+λ(f(T))=λ(f(⋃m(am,bm)))+λ(f(T)).\begin{aligned} 2 &= \lambda([0, 2]) = \lambda\big( f([0, 1]) \big) \\ &= \lambda\big( f(A) \big) + \lambda\big( f(T) \big) \\ &= \lambda\Big( f\Big( \bigcup_m (a_m, b_m) \Big) \Big) + \lambda\big( f(T) \big). \end{aligned}

Moreover, as in Figure 9,

f(⋃m(am,bm))=⋃mf((am,bm))=⋃m(f(am),f(bm)).f\Big( \bigcup_m (a_m, b_m) \Big) = \bigcup_m f\big( (a_m, b_m) \big) = \bigcup_m \big( f(a_m), f(b_m) \big).

Indeed, ff is continuous and strictly increasing, so it maps each (am,bm)(a_m, b_m) onto (f(am),f(bm)).{(f(a_m), f(b_m)).} In particular, f(A)f(A) is open and f(T)=[0,2]∖f(A){f(T) = [0, 2] \setminus f(A)} is closed, so both belong to L(R),{\mathcal{L}(\mathbb{R}),} as the additivity of λ\lambda requires.

ab102f(a)f(b)f

Figure 9. The graph of f,{f,} the intervals (am,bm)(a_m, b_m) removed up to the step kk of the construction of the Cantor set on the horizontal axis, and their images (f(am),f(bm)){(f(a_m), f(b_m))} on the vertical axis. The dashed lines mark a,{a,} b,{b,} f(a)f(a) and f(b)f(b) for one of these intervals, an instance with (a,b)=(1/3,2/3).{(a, b) = (1/3, 2/3).} The slider sets k.{k.}

Notice that

f(bm)−f(am)=bm+v(bm)−am−v(am)=bm−am,f(b_m) - f(a_m) = b_m + v(b_m) - a_m - v(a_m) = b_m - a_m,

because vv is constant on [am,bm],{[a_m, b_m],} which gives v(am)=v(bm).{v(a_m) = v(b_m).} Hence

2=λ(f(⋃m(am,bm)))+λ(f(T))=λ(⋃m(f(am),f(bm)))+λ(f(T))=∑mλ((f(am),f(bm)))+λ(f(T))=∑m(f(bm)−f(am))+λ(f(T))=∑m(bm−am)+λ(f(T))=1+λ(f(T)),\begin{aligned} 2 &= \lambda\Big( f\Big( \bigcup_m (a_m, b_m) \Big) \Big) + \lambda\big( f(T) \big) \\ &= \lambda\Big( \bigcup_m \big( f(a_m), f(b_m) \big) \Big) + \lambda\big( f(T) \big) \\ &= \sum_m \lambda\big( (f(a_m), f(b_m)) \big) + \lambda\big( f(T) \big) \\ &= \sum_m \big( f(b_m) - f(a_m) \big) + \lambda\big( f(T) \big) \\ &= \sum_m (b_m - a_m) + \lambda\big( f(T) \big) \\ &= 1 + \lambda\big( f(T) \big), \end{aligned}

where the third equality is σ\sigma-additivity, since the intervals (f(am),f(bm)){(f(a_m), f(b_m))} are pairwise disjoint. Hence λ(f(T))=2−1=1>0.{\lambda(f(T)) = 2 - 1 = 1 > 0.}

By Theorem 1, applied to f(T),{f(T),} there exists E⊂f(T){E \subset f(T)} such that E∉L(R).{E \notin \mathcal{L}(\mathbb{R}).} Let F:=f−1(E).{F := f^{-1}(E).} Then

F=f−1(E)⊂f−1(f(T))=T,λ(T)=0,F = f^{-1}(E) \subset f^{-1}\big( f(T) \big) = T, \qquad \lambda(T) = 0,

where the inclusion holds because E⊂f(T).{E \subset f(T).} Hence FF is negligible, and F∈L(R){F \in \mathcal{L}(\mathbb{R})} because (R,L(R),λ){(\mathbb{R}, \mathcal{L}(\mathbb{R}), \lambda)} is complete.

We claim that F∉B(R).{F \notin \mathcal{B}(\mathbb{R}).} Otherwise F∈B(R),{F \in \mathcal{B}(\mathbb{R}),} and

g−1(F)=g−1(f−1(E))=g−1(g(E))=E.g^{-1}(F) = g^{-1}\big( f^{-1}(E) \big) = g^{-1}\big( g(E) \big) = E.

Since gg is continuous, it is Borel measurable by Remark 5 (ii), so g−1(F)=E{g^{-1}(F) = E} is a Borel set. But EE is not even in L(R),{\mathcal{L}(\mathbb{R}),} which contains B(R),{\mathcal{B}(\mathbb{R}),} a contradiction. ■\blacksquare

Remark 14 (More consequences). With the symbols of the proof of Theorem 13:
(1) the function g ⁣:[0,2]→[0,1]{g \colon [0, 2] \to [0, 1]} is Borel measurable, and F∈L(R){F \in \mathcal{L}(\mathbb{R})} but g−1(F)=E∉L(R).{g^{-1}(F) = E \notin \mathcal{L}(\mathbb{R}).} This is the reason why the σ\sigma-algebra considered on the target is B\mathcal{B} and not L;{\mathcal{L};}
(2) a composition of measurable functions may be non-measurable.

Example 15. Let gg be as in Remark 14. The function h=χF{h = \chi_F} is measurable by Remark 7 (iii), because F∈L(R).{F \in \mathcal{L}(\mathbb{R}).} But φ=h∘g{\varphi = h \circ g} is not measurable, since

φ−1((12,+∞))=g−1(h−1((12,+∞)))=g−1(F)=E∉L(R).\begin{aligned} &\varphi^{-1}\Big( \Big( \frac{1}{2}, +\infty \Big) \Big) \\ &\quad = g^{-1}\Big( h^{-1}\Big( \Big( \frac{1}{2}, +\infty \Big) \Big) \Big) \\ &\quad = g^{-1}(F) = E \notin \mathcal{L}(\mathbb{R}). \end{aligned}

In detail, here hh is defined on [0,1],{[0, 1],} the intervals [0,1][0, 1] and [0,2][0, 2] carry the sets of L(R)\mathcal{L}(\mathbb{R}) that they contain, and h−1((1/2,+∞))=F{h^{-1}((1/2, +\infty)) = F} because hh takes only the values 00 and 1.{1.}

Simple functions

Definition 16 (Simple function). Let (X,M){(X, \mathcal{M})} be a measurable space. A function s ⁣:X→R‾{s \colon X \to \overline{\mathbb{R}}} is called simple if it has the form

s(x)=∑i=1kaiχDi(x),s(x) = \sum_{i=1}^{k} a_i \chi_{D_i}(x),

with ai∈R‾{a_i \in \overline{\mathbb{R}}} and with sets D1,…,Dk∈M{D_1, \dots, D_k \in \mathcal{M}} that are pairwise disjoint and whose union is X,{X,} as in Figure 10.

a1D1a2D2a3D3a4D4Xs

Figure 10. An instance with k=4,{k = 4,} where XX is an interval split into the intervals D1,{D_1,} D2,{D_2,} D3D_3 and D4:{D_4{:}} the simple function ss takes the value aia_i on Di.{D_i.}

Proposition 17 (Approximation with simple functions). Let (X,M){(X, \mathcal{M})} be a measurable space and f ⁣:X→[0,+∞]{f \colon X \to [0, +\infty]} measurable. Then there exists a sequence (fm)(f_m) of simple functions such that:
(i) 0≤f1≤f2≤⋯≤f;{0 \le f_1 \le f_2 \le \dots \le f;}
(ii) lim⁡m→∞fm(x)=f(x){\lim_{m \to \infty} f_m(x) = f(x)} for every x∈X;{x \in X;}

(iii) if ff is bounded, then fm→f{f_m \to f} uniformly, that is,

sup⁡x∈X∣f(x)−fm(x)∣⟶0as m→∞.\sup_{x \in X} |f(x) - f_m(x)| \longrightarrow 0 \qquad \text{as } m \to \infty.

Proof (sketch). Only the case 0≤f<1{0 \le f < 1} is treated, and only the inequality fm≤f{f_m \le f} and the uniform convergence are proved. For i=0,…,m−1{i = 0, \dots, m - 1} let

Dmi:={x∈X:im≤f(x)<i+1m}.D_m^i := \Big\{ x \in X : \frac{i}{m} \le f(x) < \frac{i + 1}{m} \Big\}.

These sets satisfy

Dmi∩Dmj=∅  ∀i≠j,⋃i=0m−1Dmi=X,Dmi∈M.D_m^i \cap D_m^j = \emptyset \ \ \forall i \neq j, \qquad \bigcup_{i=0}^{m-1} D_m^i = X, \qquad D_m^i \in \mathcal{M}.

Indeed, DmiD_m^i is the preimage of the Borel set [i/m,(i+1)/m){[i/m, (i + 1)/m)} under the measurable function f,{f,} and the union is XX because 0≤f<1.{0 \le f < 1.} Hence we define the simple function

fm(x):=∑i=0m−1im χDmi(x).f_m(x) := \sum_{i=0}^{m-1} \frac{i}{m} \, \chi_{D_m^i}(x).

By construction, fm(x)≤f(x){f_m(x) \le f(x)} for every x∈X,{x \in X,} as in Figure 11.

01Xffm

Figure 11. An instance: a function ff with 0≤f<1{0 \le f < 1} on an interval X,{X,} the levels i/m,{i/m,} dashed, and the simple function fm.{f_m.} The slider sets m.{m.}

Let x∈X.{x \in X.} Then there exists jj such that x∈Dmj,{x \in D_m^j,} hence

∣f(x)−fm(x)∣=f(x)−fm(x)≤j+1m−jm=1m,|f(x) - f_m(x)| = f(x) - f_m(x) \le \frac{j + 1}{m} - \frac{j}{m} = \frac{1}{m},

because f(x)<(j+1)/m{f(x) < (j + 1)/m} and fm(x)=j/m{f_m(x) = j/m} for x∈Dmj.{x \in D_m^j.} This gives the uniform convergence. ■\blacksquare

Exercises

The exercises apply Remarks 5 and 7 and Definition 8 to sets of R2\mathbb{R}^2 and to functions on R.{\mathbb{R}.}

A product set in the plane

Example 18. Let A⊂[0,1]{A \subset [0, 1]} with A∉L(R),{A \notin \mathcal{L}(\mathbb{R}),} let x0∈R,{x_0 \in \mathbb{R},} and let

E=A×{x0}⊂R2.E = A \times \{x_0\} \subset \mathbb{R}^2.

Is E∈L(R2){E \in \mathcal{L}(\mathbb{R}^2)}? Yes. For every m≥1{m \ge 1} let, as in Figure 12,

Rm=(−1,2)×(x0−1m, x0+1m).R_m = (-1, 2) \times \Big( x_0 - \frac{1}{m}, \ x_0 + \frac{1}{m} \Big).

Then λ2∗(E)≤λ2∗(Rm)→0{\lambda_2^*(E) \le \lambda_2^*(R_m) \to 0} as m→∞.{m \to \infty.} Hence λ2∗(E)=0{\lambda_2^*(E) = 0} and E∈L(R2).{E \in \mathcal{L}(\mathbb{R}^2).} Indeed, E⊂Rm{E \subset R_m} and λ2∗(Rm)=6/m{\lambda_2^*(R_m) = 6/m} by Remark 2 (ii) of the previous post, and a set of outer measure zero is measurable by Step 1 of part (iii) in the proof of Theorem 18 of the second post.

−1120x0EARm

Figure 12. The set E=A×{x0}{E = A \times \{x_0\}} and the set AA on the horizontal axis, both drawn schematically as points, and the rectangle Rm.{R_m.} The slider sets m.{m.}

A function defined differently on rationals and irrationals

Example 19. Is the function f ⁣:R→R{f \colon \mathbb{R} \to \mathbb{R}} given by

f(x)={x2x∈Q,x6x∉Qf(x) = \begin{cases} x^2 & x \in \mathbb{Q}, \\ x^6 & x \notin \mathbb{Q} \end{cases}

measurable? Yes. Write

f(x)=x2χQ(x)+x6χR∖Q(x).f(x) = x^2 \chi_{\mathbb{Q}}(x) + x^6 \chi_{\mathbb{R} \setminus \mathbb{Q}}(x).

The functions x↦x2,{x \mapsto x^2,} χQ,{\chi_{\mathbb{Q}},} x↦x6{x \mapsto x^6} and χR∖Q\chi_{\mathbb{R} \setminus \mathbb{Q}} are measurable, hence so are the two products, and the sum of measurable functions is measurable. Indeed, the powers are continuous, hence measurable by Remark 5, and the characteristic functions are measurable by Remark 7 (iii), since Q\mathbb{Q} and R∖Q\mathbb{R} \setminus \mathbb{Q} belong to L(R).{\mathcal{L}(\mathbb{R}).} Products and sums are measurable by Remark 7 (i).

Functions equal almost everywhere

Example 20. On R\mathbb{R} with the Lebesgue measure λ,{\lambda,} let f ⁣:R→R‾{f \colon \mathbb{R} \to \overline{\mathbb{R}}} be measurable and let g ⁣:R→R‾{g \colon \mathbb{R} \to \overline{\mathbb{R}}} be such that f=g{f = g} almost everywhere. Is gg also measurable? The equality f=g{f = g} almost everywhere means that the set N={f≠g}{N = \{ f \neq g \}} is negligible, so that λ(N)=0.{\lambda(N) = 0.} It also means that f(x)=g(x){f(x) = g(x)} for every x∈R∖N.{x \in \mathbb{R} \setminus N.}

To prove that gg is measurable, it is enough, by Proposition 3, to prove that g−1((a,+∞])∈L(R){g^{-1}((a, +\infty]) \in \mathcal{L}(\mathbb{R})} for every a∈R,{a \in \mathbb{R},} since the sets (a,+∞](a, +\infty] are generators of B(R‾)\mathcal{B}(\overline{\mathbb{R}}) by Remark 28 of the first post. Now

g−1((a,+∞])=[g−1((a,+∞])∩N]∪[g−1((a,+∞])∖N]=[g−1((a,+∞])∩N]∪[f−1((a,+∞])∖N].\begin{aligned} g^{-1}((a, +\infty]) &= \big[ g^{-1}((a, +\infty]) \cap N \big] \cup \big[ g^{-1}((a, +\infty]) \setminus N \big] \\ &= \big[ g^{-1}((a, +\infty]) \cap N \big] \cup \big[ f^{-1}((a, +\infty]) \setminus N \big]. \end{aligned}

The first set is contained in N,{N,} so it is negligible and belongs to L(R).{\mathcal{L}(\mathbb{R}).} In the second, f−1((a,+∞])∈L(R){f^{-1}((a, +\infty]) \in \mathcal{L}(\mathbb{R})} and N∈L(R),{N \in \mathcal{L}(\mathbb{R}),} so it belongs to L(R).{\mathcal{L}(\mathbb{R}).} Hence g−1((a,+∞])∈L(R),{g^{-1}((a, +\infty]) \in \mathcal{L}(\mathbb{R}),} as in Figure 13.

afg

Figure 13. An instance on an interval: a function f,{f,} and a function gg equal to ff except at the 3 points of N,{N,} where its values are the filled dots. For the level aa set by the slider, the horizontal axis shows f−1((a,+∞])∖N{f^{-1}((a, +\infty]) \setminus N} and, filled, the points of NN where g>a.{g > a.}

The sequence (−1)m+mχ[0,1/m](-1)^m + m \chi_{[0, 1/m]}

Example 21. Let fm ⁣:R→R{f_m \colon \mathbb{R} \to \mathbb{R}} be

fm(x)=(−1)m+m χ[0,1m](x)=(−1)m+gm(x),f_m(x) = (-1)^m + m \, \chi_{[0, \frac{1}{m}]}(x) = (-1)^m + g_m(x),

where gm:=mχ[0,1/m],{g_m := m \chi_{[0, 1/m]},} as in Figure 14. The functions gmg_m converge pointwise to the function

g(x)={0∀x≠0,+∞x=0,g(x) = \begin{cases} 0 & \forall x \neq 0, \\ +\infty & x = 0, \end{cases}

because lim⁡m→∞gm(0)=lim⁡m→∞m=+∞,{\lim_{m \to \infty} g_m(0) = \lim_{m \to \infty} m = +\infty,} and g=0{g = 0} almost everywhere.

1−1m01/mfmgm

Figure 14. The functions gmg_m and fm=(−1)m+gm{f_m = (-1)^m + g_m} for the mm set by the slider. On [0,1/m]{[0, 1/m]} they take the values mm and (−1)m+m.{(-1)^m + m.}

The lower limit of (fm)(f_m) is

lim‾⁡mfm(x)={−1∀x≠0,+∞x=0,\varliminf_m f_m(x) = \begin{cases} -1 & \forall x \neq 0, \\ +\infty & x = 0, \end{cases}

where the value at x=0{x = 0} comes from

lim‾⁡mfm(0)=lim‾⁡m((−1)m+gm(0))=lim‾⁡m((−1)m+m)=+∞,\varliminf_m f_m(0) = \varliminf_m \big( (-1)^m + g_m(0) \big) = \varliminf_m \big( (-1)^m + m \big) = +\infty,

and the upper limit is

lim‾⁡mfm(x)={1∀x≠0,+∞x=0.\varlimsup_m f_m(x) = \begin{cases} 1 & \forall x \neq 0, \\ +\infty & x = 0. \end{cases}

Now consider hm:=f2m,{h_m := f_{2m},} that is,

hm=(−1)2m+2m χ[0,12m]=1+2m χ[0,12m].h_m = (-1)^{2m} + 2m \, \chi_{[0, \frac{1}{2m}]} = 1 + 2m \, \chi_{[0, \frac{1}{2m}]}.

The functions hmh_m converge pointwise to

h(x)={1∀x≠0,+∞x=0,h(x) = \begin{cases} 1 & \forall x \neq 0, \\ +\infty & x = 0, \end{cases}

and hm→1{h_m \to 1} almost everywhere.