Chapter 4

Lebesgue Measure

[58/28%]
Show
LaTeX
Problem 4.1.1

Let x∈Rx \in \mathbb {R} and k⩾2k \geqslant 2. Then λ({x})=λk({x}×Rk−1)=0\lambda (\left\{ x\right\} )=\lambda_{k}\left(\left\{ x\right\} \times \mathbb {R}^{k-1}\right)=0. Next, for any j∈{1,…,k−1}j \in \left\{ 1, \ldots , k-1\right\} and x∈Rj\boldsymbol {x} \in \mathbb {R}^{j} we have λk({x}×Rk−j)=0\lambda_{k}\left(\left\{ \boldsymbol {x}\right\} \times \mathbb {R}^{k-j}\right)=0.

?
Problem 4.1.2

Enumerate the rationals in (0,1](0,1] by {q1,q2,…}\left\{ q_{1}, q_{2}, \ldots \right\}. Given arbitrarily small ε>0\varepsilon >0, remove the interval An=(qn−ε/2n+1,qn+ε/2n+1)∩(0,1]A_{n}=\left(q_{n}-\varepsilon / 2^{n+1}, q_{n}+\varepsilon / 2^{n+1}\right) \cap (0,1]. Let A=⋃n=1∞AnA=\bigcup_{n=1}^{\infty } A_{n}. Then λˉ(A)⩽ε\bar{\lambda }(A) \leqslant \varepsilon, despite the fact that AA is an open dense subset of (0,1](0,1]. Also, we have λˉ((0,1]\A)⩾1−ε\bar{\lambda }((0,1] \backslash A) \geqslant 1-\varepsilon, even though (0,1]\A(0,1] \backslash A is a nowhere dense subset of (0,1](0,1].

?
Problem 4.1.3

There cannot exist a closed subset of (0,1](0,1] whose interior is empty, yet has λˉ\bar{\lambda }-measure of one.

?
Problem 4.1.4

λk\lambda_{k} is nonatomic: any A∈BkA \in \mathscr {B}^{k} with λk(A)>0\lambda_{k}(A)>0 has a proper subset B∈BkB \in \mathscr {B}^{k} with 0<λk(B)<λk(A)0<\lambda_{k}(B)<\lambda_{k}(A). This forces λˉk\bar{\lambda }_{k} to be nonatomic as well.

?
Problem 4.1.5

Let k⩾2k \geqslant 2. There exists an uncountable set U∈BkU \in \mathscr {B}^{k} with λk(U)=0\lambda_{k}(U)=0.

?
Problem 4.1.6

∣Lk∣=2c\left|\mathscr {L}^{k}\right|=2^{\mathrm{c}} and ∣Bk∣=c\left|\mathscr {B}^{k}\right|=\mathrm{c} for each k∈Nk \in \mathbb {N}.

?
Problem 4.1.7

Assume that L=2R\mathscr {L}=2^{\mathbb {R}}; in particular every one of the 2c2^{\mathrm{c}} subsets of [0,1]\left[0,1\right] is a Lebesgue set. Let B={λˉ(A):A⊆[0,1],λˉ(A)∉A}B=\left\{ \bar{\lambda }(A): A \subseteq [0,1], \bar{\lambda }(A) \notin A\right\}. Consideration of the set BB (which is in L\mathscr {L} be assumption) leads to contradiction.

?
Problem 4.1.8

Let k⩾2k \geqslant 2. Every line is in Bk\mathscr {B}^{k}, has λk\lambda_{k}-measure zero, and hence has λˉk\bar{\lambda }_{k}-measure.

?
Problem 4.1.9

Let B(0,1]=σ({(a,b]:(a,b]⊆(0,1]})\mathscr {B}_{(0,1]}=\sigma (\left\{ (a, b]:(a, b] \subseteq (0,1]\right\} ).

?
(a)

B(0,1]={B⊆(0,1]:B∈B}\mathscr {B}_{(0,1]}=\left\{ B \subseteq (0,1]: B \in \mathscr {B}\right\} and B(0,1]‾={B⊆(0,1]:B∈L}\overline{\mathscr {B}_{(0,1]}}=\left\{ B \subseteq (0,1]: B \in \mathscr {L}\right\}.

(b)

Construct Lebesgue measure on both B(0,1]\mathfrak {B}_{(0,1]} and B(0,1]‾\overline{\mathfrak {B}_{(0,1]}}. Call these measures λ(0,1]\lambda_{(0,1]} and λˉ(0,1]\bar{\lambda }_{(0,1]}, and denote B(0,1]‾\overline{\mathcal{B}_{(0,1]}} by L(0,1]\mathscr {L}_{(0,1]}.

(c)

λ(0,1]\lambda_{(0,1]} as constructed is the measure restriction of λ\lambda from B\mathfrak {B} to B(0,1]\mathfrak {B}_{(0,1]} and λˉ(0,1]\bar{\lambda }_{(0,1]} as constructed is the measure restriction of λˉ\bar{\lambda } from L\mathscr {L} to L(0,1]\mathscr {L}_{(0,1]}.

Problem 4.3.1

Let μ:Bk→R‾\mu : \mathscr {B}^{k} \rightarrow \overline{\mathbb {R}} denote a measure that assigns finite measure to bounded Bk\mathscr {B}^{k}-sets. Furthermore, suppose that μ\mu is translation invariant: μ(B⊕x)=μ(B)\mu (B \oplus \boldsymbol {x})=\mu (B) for all x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}. Then there is c>0c>0 such that μ(B)=cλk(B)\mu (B)=c \lambda_{k}(B) for all B∈BkB \in \mathscr {B}^{k}.

?
Problem 4.3.2

Let A∈LA \in \mathscr {L} be such that λˉ(A)>0\bar{\lambda }(A)>0, and let c∈[0,1)c \in [0,1). There exists an open interval UU such that λˉ(A∩U)⩾cλ(U).1\bar{\lambda }(A \cap U) \geqslant c \lambda (U) .^{1}

?
Problem 4.3.3

Let A∈LA \in \mathscr {L} contain an open interval. Then there exists a>0a>0 such that (−a,a)(-a, a) is contained in D(A)={x−y:x,y∈A}D(A)=\left\{ x-y: x, y \in A\right\}.

?
Problem 4.3.4

Let A∈LA \in \mathscr {L} be such that λˉ(A)>0\bar{\lambda }(A)>0. Then there exists a>0a>0 such that (−a,a)(-a, a) is contained in D(A)={x−y:x,y∈A}D(A)=\left\{ x-y: x, y \in A\right\}.

?
Problem 4.3.5

Let AA be a dense subset of R\mathbb {R}. Then cA={ca:a∈A}c A=\left\{ c a: a \in A\right\} is dense for any c≠0c \neq 0.

?
Problem 4.3.6

Let ξ\xi be an irrational number.

?
(a)

Let A={n+mξ:n,m∈Z}A=\left\{ n+m \xi : n, m \in \mathbb {Z}\right\}. Then AA is a dense subset of R\mathbb {R}.

(b)

Let B=\left\{ n+m \xi : n, m \in \mathbb {Z}, n even \right\}. Then BB is a sense subset of R\mathbb {R}.

(c)

Let C=\left\{ n+m \xi : n, m \in \mathbb {Z}, n odd \right\}. Then CC is a sense subset of R\mathbb {R}.

Problem 4.3.7

For x,y∈Rx, y \in \mathbb {R} write x∼yx \sim y iff x−y∈A={n+mξ:n,m∈Z}x-y \in A=\left\{ n+m \xi : n, m \in \mathbb {Z}\right\}, where ξ\xi is a fixed irrational number as in the previous exercise. Then ∼\sim is an equivalence relation, and hence R\mathbb {R} may be partitioned into disjoint equivalence classes.

?
Problem 4.3.8

We now invoke ( ACA C ) to form a set E0E_{0} consisting of exactly one element from each of the equivalence classes in the previous exercise. We will now show that E0∉LE_{0} \notin \mathscr {L}.

?
(a)

There exist Borel subsets of E0E_{0}.

(b)

Let F⊆E0F \subseteq E_{0} be a Borel set. Then D(F)D(F) cannot contain any nonzero elements of AA, where AA is the set in Exercise 4.3.6.

(c)

By (b), there cannot exist an open interval containing the origin that is contained in D(F)D(F), hence λ(F)=0\lambda (F)=0.

(d)

From (c), we have λ∗(E0)=0\lambda_{*}\left(E_{0}\right)=0.

(e)

If a1a_{1} and a2a_{2} are distinct elements of A={n+mξ:m,n∈Z}A=\left\{ n+m \xi : m, n \in \mathbb {Z}\right\}, then E0⊕a1E_{0} \oplus a_{1} and E0⊕a2E_{0} \oplus a_{2} are disjoint.

(f)

R=⋃{E0⊕a:a∈A}\mathbb {R}=\bigcup \left\{ E_{0} \oplus a: a \in A\right\}, the countable union being disjoint.

(g)

If E0∈LE_{0} \in \mathscr {L}, then λˉ(E0⊕a)=0\bar{\lambda }\left(E_{0} \oplus a\right)=0 for each a∈Aa \in A, hence λˉ(R)=0\bar{\lambda }(\mathbb {R})=0. Therefore, since the assumption that E0∈LE_{0} \in \mathscr {L} leads to an absurdity, it must be the case that E0∉LE_{0} \notin \mathscr {L}, and hence there exists a subset of R\mathbb {R} that fails to be a Lebesgue set.

Problem 4.3.9

In conjunction with the previous exercises, it is not possible to have Lebesgue measure defined for every subset of R\mathbb {R}. That is, a measure extension μ\mu of ΔF\Delta_{F} [where F∈SF \in \mathfrak {S} is the identity function] from the semiring A\mathcal{A} consisting of ∅\varnothing and the bounded rsc intervals (a,b](a, b] to 2R2^{\mathbb {R}} fails to exist.

?
Remark.
?

Argue by contradiction for a quick answer: if such a measure extension μ\mu to 2R2^{\mathbb {R}} exists then the previous work would force μ(R)=0\mu (\mathbb {R})=0, contradicting what we expect of length.

Problem 4.3.10

Let B∈LB \in \mathscr {L} be such that λˉ(B)>0\bar{\lambda }(B)>0. We will show that there is E1⊆BE_{1} \subseteq B with E1∉LE_{1} \notin \mathscr {L} by following the outline below. The set AA appearing below is the set AA from Exercise 4.3.7, consisting of the numbers n+mξn+m \xi, where n,m∈Zn, m \in \mathbb {Z} and ξ\xi is a fixed irrational number.

?
(a)

λ∗\lambda_{*} is monotone and translation invariant.

(b)

B=⋃{(E0⊕a)∩B:a∈A}B=\bigcup \left\{ (E_{0} \oplus a) \cap B: a \in A\right\}, the union being disjoint.

(c)

There exists a∗∈Aa^{*} \in A such that λ∗((E0⊕a∗)∩B)>0\lambda^{*}\left((E_{0} \oplus a^{*}) \cap B\right)>0.

(d)

Let E1=(E0⊕a∗)∩BE_{1}=(E_{0} \oplus a^{*}) \cap B. Then E1⊆BE_{1} \subseteq B and E1∉LE_{1} \notin \mathscr {L}.

(e)

We may actually generalize further and state that any subset B⊆RB \subseteq \mathbb {R} with λ∗(B)>0\lambda^{*}(B)>0 [BB not necessarily in L\mathscr {L}] contains a subset outside of L\mathscr {L}.

Remark.
?

By (b), we have 0<λˉ(B)=λ∗(B)⩽∑{λ∗((E0⊕a)∩B):a∈A}0<\bar{\lambda }(B)=\lambda^{*}(B) \leqslant \sum \left\{ \lambda^{*}((E_{0} \oplus a) \cap B): a \in A\right\}; and by (a) and part (d) of Exercise 4.3.8, λ∗(E1)=λ∗((E0⊕a∗)∩B)⩽λ∗(E0⊕a∗)=λ∗(E0)=0\lambda_{*}(E_{1})=\lambda_{*}((E_{0} \oplus a^{*}) \cap B) \leqslant \lambda_{*}(E_{0} \oplus a^{*})=\lambda_{*}(E_{0})=0, while at the same time λ∗(E1)>0\lambda^{*}(E_{1})>0; invoke the relevant part of the Approximation Theorem.

Problem 4.3.11

Let A∈LA \in \mathscr {L}, let BB be a dense subset of R\mathbb {R}, and suppose that λˉ(A△(A⊕x))=0\bar{\lambda }(A \triangle (A \oplus x))=0 for every x∈Bx \in B. Then either λˉ(A)=0\bar{\lambda }(A)=0 or λˉ(Ac)=0\bar{\lambda }(A^{c})=0. This exercise is independent of the previous exercises.

?
Problem 4.4.1

Recall that a linear transformation T:Rk→RkT: \mathbb {R}^{k} \rightarrow \mathbb {R}^{k} (for k⩾2k \geqslant 2) is called special iff TT is a mapping of one of the following forms: a k×kk \times k permutation matrix (Claim 4); T(x)=(px1,x2,…,xk)′T(\boldsymbol {x})=(p x_{1}, x_{2}, \ldots , x_{k})' for some p≠0p \neq 0 (Claim 5); T(x)=(x1+x2,x2,…,xk)′T(\boldsymbol {x})=(x_{1}+x_{2}, x_{2}, \ldots , x_{k})' (Claim 6); or T(x)=(x1−x2,x2,…,xk)′T(\boldsymbol {x})=(x_{1}-x_{2}, x_{2}, \ldots , x_{k})' (Claim 7). The matrices associated with such transformations are called special matrices. The inverse of a special matrix is a special matrix.

?
Problem 4.4.2

Any nonsingular k×kk \times k matrix T\mathbf{T} may be written as a finite product TN⋯T2T1\mathbf{T}_{N} \cdots \mathbf{T}_{2} \mathbf{T}_{1} of nonsingular k×kk \times k matrices, each matrix Tj\mathbf{T}_{j} being nonsingular and freely denoting the matrix corresponding to any one of the special linear transformations from Rk\mathbb {R}^{k} to Rk\mathbb {R}^{k} described earlier.

Suggestion: find a finite sequence T1,⋯ ,TN1\mathbf{T}_{1}, \cdots , \mathbf{T}_{N_{1}} of special matrices such that

TN1⋯T1T=(1−−−−−−). \mathbf{T}_{N_{1}} \cdots \mathbf{T}_{1} \mathbf{T}=\begin{pmatrix} 1 & -- \\ -- & -- \end{pmatrix}.

Then find another finite sequence of matrices TN1+1,⋯ ,TN1+N2\mathbf{T}_{N_{1}+1}, \cdots , \mathbf{T}_{N_{1}+N_{2}} such that

TN1+N2⋯T1T=(1−−−−−0−−−−−⋮0−−−−−). \mathbf{T}_{N_{1}+N_{2}} \cdots \mathbf{T}_{1} \mathbf{T}=\begin{pmatrix} 1 & ----- \\ 0 & ----- \\ \vdots & \\ 0 & ----- \end{pmatrix}.

Then, find another finite sequence of matrices TN2+1,⋯ ,TN2+N3\mathbf{T}_{N_{2}+1}, \cdots , \mathbf{T}_{N_{2}+N_{3}} such that

TN1+N2⋯T1TTN2+1⋯TN2+N3=(10⋯00⋮0). \mathbf{T}_{N_{1}+N_{2}} \cdots \mathbf{T}_{1} \mathbf{T} \mathbf{T}_{N_{2}+1} \cdots \mathbf{T}_{N_{2}+N_{3}}=\begin{pmatrix} 1 & 0 & \cdots & 0 \\ 0 & & & \\ \vdots & & & \\ 0 & & & \end{pmatrix}.

Argue that the above matrix contains a (k−1)×(k−1)(k-1) \times (k-1) invertible submatrix [the blank spot in the above matrix] to which we can repeat this entire procedure without disturbing the 1's and 0's of the above matrix in order to obtain a matrix of the form

(100⋯0010⋯000⋮⋮00). \begin{pmatrix} 1 & 0 & 0 & \cdots & 0 \\ 0 & 1 & 0 & \cdots & 0 \\ 0 & 0 & & & \\ \vdots & \vdots & & & \\ 0 & 0 & & & \end{pmatrix}.

Argue that we may carry on this procedure until we have [written symbolically] a sequence T1,⋯ ,Tα+β\mathbf{T}_{1}, \cdots , \mathbf{T}_{\alpha +\beta } of special matrices such that

Tα⋯T1TTα+1⋯Tα+β=Ik. \mathbf{T}_{\alpha } \cdots \mathbf{T}_{1} \mathbf{T} \mathbf{T}_{\alpha +1} \cdots \mathbf{T}_{\alpha +\beta }=\mathbf{I}_{k}.

Therefore,

T=T1−1⋯Tα−1Tα+β−1⋯Tα+1−1. \mathbf{T}=\mathbf{T}_{1}^{-1} \cdots \mathbf{T}_{\alpha }^{-1} \mathbf{T}_{\alpha +\beta }^{-1} \cdots \mathbf{T}_{\alpha +1}^{-1}.

Since the inverse of a special matrix is a special matrix by Exercise 4.4.1, the proof is complete. This gives an outline of the proof of Claim 10.

?
Remark.
?

A linear transformation T:Rk→RkT: \mathbb {R}^{k} \rightarrow \mathbb {R}^{k} is special iff TT is a mapping of one of the forms in Claims 4-7 (see Exercise 4.4.1): a permutation matrix; T(x)=(px1,x2,…,xk)′T(\boldsymbol {x})=(px_{1}, x_{2}, \ldots , x_{k})'; T(x)=(x1+x2,x2,…,xk)′T(\boldsymbol {x})=(x_{1}+x_{2}, x_{2}, \ldots , x_{k})'; or T(x)=(x1−x2,x2,…,xk)′T(\boldsymbol {x})=(x_{1}-x_{2}, x_{2}, \ldots , x_{k})'. Claim 1: if T\mathbf{T} is a nonsingular k×kk \times k matrix, then there exists η>0\eta >0 such that ∥Tx∥⩾η∥x∥\left\| \mathbf{T} \boldsymbol {x}\right\| \geqslant \eta \left\| \boldsymbol {x}\right\| for all x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}.

Problem 4.4.3

A mapping F:Rk→RkF: \mathbb {R}^{k} \rightarrow \mathbb {R}^{k} is called a rigid motion [on Rk\mathbb {R}^{k}] iff there exists x0∈Rk\boldsymbol {x}_{0} \in \mathbb {R}^{k} and an orthonormal matrix O\mathbf{O} such that F(x)=Ox+x0F(\boldsymbol {x})=\mathbf{O} \boldsymbol {x}+\boldsymbol {x}_{0} for all x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}.

?
(a)

Translations, rotations, permutations, and reflections are rigid motions.

(b)

Let II denote the identity mapping [I(x)=xI(\boldsymbol {x})=\boldsymbol {x} for all x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}], and let FF, GG, and HH denote rigid motions. We have:

  1. F∘GF \circ G is a rigid motion.

  2. (F∘G)∘H=F∘(G∘H)(F \circ G) \circ H=F \circ (G \circ H).

  3. F∘I=I∘F=FF \circ I=I \circ F=F.

  4. There exists a rigid motion JJ such that F∘J=J∘F=IF \circ J=J \circ F=I. Thus, the set of rigid motions on Rk\mathbb {R}^{k} forms a group with respect to the binary operation of composition.

Problem 4.4.4

Let a1,⋯ ,ak∈Rk\boldsymbol {a}_{1}, \cdots , \boldsymbol {a}_{k} \in \mathbb {R}^{k}, and define

A={t1a1+⋯+tkak:0⩽ti⩽1 for all 1⩽i⩽k}. A=\left\{ t_{1} \boldsymbol {a}_{1}+\cdots +t_{k} \boldsymbol {a}_{k}: 0 \leqslant t_{i} \leqslant 1 \text{ for all } 1 \leqslant i \leqslant k\right\} .

Use the main result of this section to show that λk(A)\lambda_{k}(A) is the absolute value of the determinant of the matrix whose columns are a1,⋯ ,ak\boldsymbol {a}_{1}, \cdots , \boldsymbol {a}_{k}.

?
Remark.
?

This section's main result (Claim 11): let k∈Nk \in \mathbb {N} and let T\mathbf{T} denote a nonsingular transformation. (i) For every A∈B(Rk)A \in \mathscr {B}\left(\mathbb {R}^{k}\right) we have TA∈B(Rk)\mathbf{T} A \in \mathscr {B}\left(\mathbb {R}^{k}\right) and λk(TA)=∣det⁡(T)∣λk(A)\lambda_{k}(\mathbf{T} A)=\left|\operatorname {det}\left(\mathbf{T}\right)\right| \lambda_{k}(A). (ii) For every A∈LkA \in \mathscr {L}^{k}, we have TA∈Lk\mathbf{T} A \in \mathscr {L}^{k} and λˉk(TA)=∣det⁡(T)∣λˉk(A)\bar{\lambda }_{k}(\mathbf{T} A)=\left|\operatorname {det}\left(\mathbf{T}\right)\right| \bar{\lambda }_{k}(A).

Problem 4.4.5

Consider a parallelogram with vertices (0,0)(0,0), (a1,0)(a_{1}, 0), (h,a2)(h, a_{2}), and (a1+h,a2)(a_{1}+h, a_{2}), where a1,a2>0a_{1}, a_{2}>0 and 0⩽h⩽a10 \leqslant h \leqslant a_{1}. Find the matrix T\mathbf{T} that maps the unit square onto this parallelogram, and obtain the formula for the area of a parallelogram by using this section's main result.

?
Remark.
?

This section's main result (Claim 11): let k∈Nk \in \mathbb {N} and let T\mathbf{T} denote a nonsingular transformation. (i) For every A∈B(Rk)A \in \mathscr {B}\left(\mathbb {R}^{k}\right) we have TA∈B(Rk)\mathbf{T} A \in \mathscr {B}\left(\mathbb {R}^{k}\right) and λk(TA)=∣det⁡(T)∣λk(A)\lambda_{k}(\mathbf{T} A)=\left|\operatorname {det}\left(\mathbf{T}\right)\right| \lambda_{k}(A). (ii) For every A∈LkA \in \mathscr {L}^{k}, we have TA∈Lk\mathbf{T} A \in \mathscr {L}^{k} and λˉk(TA)=∣det⁡(T)∣λˉk(A)\bar{\lambda }_{k}(\mathbf{T} A)=\left|\operatorname {det}\left(\mathbf{T}\right)\right| \bar{\lambda }_{k}(A).

Problem 4.4.6

Use Exercise 14 of Section 2.2 to give a quick proof that the Lebesgue measure of any hyperplane must be zero.

?
Remark.
?

Exercise 14 of Section 2.2: any disjoint collection of B(Rk)\mathscr {B}\left(\mathbb {R}^{k}\right)-sets having positive λk\lambda_{k}-measure must be at most countable.

Problem 4.4.7

If T:Rk→Rk\mathbf{T}: \mathbb {R}^{k} \rightarrow \mathbb {R}^{k} is a singular linear transformation, then we do not necessarily have TAc=(TA)c\mathbf{T} A^{c}=(\mathbf{T} A)^{c} for every A⊆RkA \subseteq \mathbb {R}^{k}. Also, we do not necessarily have that {TAγ:γ∈Γ}\left\{ \mathbf{T} A_{\gamma }: \gamma \in \Gamma \right\} is a disjoint collection of subsets of Rk\mathbb {R}^{k} whenever {Aγ:γ∈Γ}\left\{ A_{\gamma }: \gamma \in \Gamma \right\} is a disjoint collection of subsets of Rk\mathbb {R}^{k}.

?
Problem 4.4.8

Let T\mathbf{T} denote a nonsingular k×kk \times k matrix, and let γ1⩾⋯⩾γk\gamma_{1} \geqslant \cdots \geqslant \gamma_{k} denote the [positive] eigenvalues of T′T\mathbf{T}' \mathbf{T}. Then γk∥x∥⩽∥Tx∥⩽γ1∥x∥\gamma_{k} \left\| \boldsymbol {x}\right\| \leqslant \left\| \mathbf{T} \boldsymbol {x}\right\| \leqslant \gamma_{1} \left\| \boldsymbol {x}\right\| for every x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}. This generalizes Claim 1.

?
Remark.
?

Claim 1: if T\mathbf{T} is a nonsingular k×kk \times k matrix, then there exists η>0\eta >0 such that ∥Tx∥⩾η∥x∥\left\| \mathbf{T} \boldsymbol {x}\right\| \geqslant \eta \left\| \boldsymbol {x}\right\| for all x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}.

Problem 4.4.9

Prove Claim 7 by adapting the proof of Claim 6 accordingly.

?
Remark.
?

Claim 6: let k⩾2k \geqslant 2, let T(x)=(x1+x2,x2,⋯ ,xk)′T(\boldsymbol {x})=(x_{1}+x_{2}, x_{2}, \cdots , x_{k})' for each x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}, and let c>0c>0. Then TT is a nonsingular linear transformation, [so that TA∈B(Rk)TA \in \mathscr {B}\left(\mathbb {R}^{k}\right) whenever A∈B(Rk)A \in \mathscr {B}\left(\mathbb {R}^{k}\right)], and λk(T(0,c1])=ck=λk((0,c1])\lambda_{k}(T(\boldsymbol {0}, c\boldsymbol {1}])=c^{k}=\lambda_{k}((\boldsymbol {0}, c\boldsymbol {1}]). Claim 7 is the same statement with T(x)=(x1−x2,x2,⋯ ,xk)′T(\boldsymbol {x})=(x_{1}-x_{2}, x_{2}, \cdots , x_{k})'.

Problem 4.4.10

Prove Claim 11(i) when k=1k=1.

Let T(x)=pxT(x)=px for some p≠0p \neq 0. By Claim 3, A∈BA \in \mathscr {B} forces pA={pa:a∈A}∈BpA=\left\{ pa: a \in A\right\} \in \mathscr {B}. Let ν(A)=∣p∣λ(A)\nu (A)=\left|p\right| \lambda (A). Show that ν\nu is a measure with domain B\mathscr {B}, then show that ν(A)=λ(pA)\nu (A)=\lambda (pA) whenever A∈AkA \in \mathcal{A}_{k}. Appeal to the Uniqueness Theorem in Section 3.5 to finish things.

?
Remark.
?

Claim 3: let T\mathbf{T} denote an arbitrary nonsingular k×kk \times k matrix. Then for any A∈B(Rk)A \in \mathscr {B}\left(\mathbb {R}^{k}\right) we have TA∈B(Rk)\mathbf{T} A \in \mathscr {B}\left(\mathbb {R}^{k}\right); that is, B(Rk)\mathscr {B}\left(\mathbb {R}^{k}\right) is closed under nonsingular linear transformations. Claim 6: let k⩾2k \geqslant 2, let T(x)=(x1+x2,x2,⋯ ,xk)′T(\boldsymbol {x})=(x_{1}+x_{2}, x_{2}, \cdots , x_{k})' for each x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}, and let c>0c>0. Then TT is a nonsingular linear transformation, and λk(T(0,c1])=ck=λk((0,c1])\lambda_{k}(T(\boldsymbol {0}, c\boldsymbol {1}])=c^{k}=\lambda_{k}((\boldsymbol {0}, c\boldsymbol {1}]). Uniqueness Theorem (Section 3.5): two σ\sigma-finite measures agreeing on a semiring generating a σ\sigma-field, and agreeing on a covering sequence of finite-measure sets, must agree on the whole σ\sigma-field.

Problem 4.5.1

Let E∉LkE \notin \mathscr {L}^{k} denote the set constructed in this section, and let A⊆EA \subseteq E be such that A∈LkA \in \mathscr {L}^{k}. Then λˉk(A)=0\bar{\lambda }_{k}(A)=0.

?
Remark.
?

The construction of this section: for each x\boldsymbol {x} and y\boldsymbol {y} in Rk\mathbb {R}^{k}, write x∼y\boldsymbol {x} \sim \boldsymbol {y} iff there is r∈Qk\boldsymbol {r} \in \mathbb {Q}^{k} such that x+r=y\boldsymbol {x}+\boldsymbol {r}=\boldsymbol {y}; then ∼\sim is an equivalence relation on Rk\mathbb {R}^{k}, determining an infinite number of equivalence classes, each itself infinite. Invoking the Axiom of Choice, form a set E⊆RkE \subseteq \mathbb {R}^{k} consisting of exactly one element from each equivalence class, and consider the collection {E⊕r:r∈Qk}\left\{ E \oplus \boldsymbol {r}: \boldsymbol {r} \in \mathbb {Q}^{k}\right\} of the translates of EE by the elements of Qk\mathbb {Q}^{k}. Claim 2: if r1,r2∈Qk\boldsymbol {r}_{1}, \boldsymbol {r}_{2} \in \mathbb {Q}^{k} are distinct, then E⊕r1E \oplus \boldsymbol {r}_{1} and E⊕r2E \oplus \boldsymbol {r}_{2} are disjoint. Claim 3: Rk=⋃{(E⊕r):r∈Qk}\mathbb {R}^{k}=\bigcup \left\{ (E \oplus \boldsymbol {r}): \boldsymbol {r} \in \mathbb {Q}^{k}\right\}, the union being disjoint. Claim 4: λk∗(E)>0\lambda_{k}^{*}(E)>0. Claim 5: sup⁡{λk(K):K compact,K⊆E}=0\sup \left\{ \lambda_{k}(K): K \text{ compact}, K \subseteq E\right\} =0. Claim 6: the set EE is not in Lk\mathscr {L}^{k}. This is a variant of the classical construction given by Vitali in 1905.

Problem 4.5.2

There exists no translation invariant measure μ\mu defined for all subsets of Rk\mathbb {R}^{k} such that μ((a,b])=∏i=1k(bi−ai)\mu ((\boldsymbol {a}, \boldsymbol {b}])=\prod_{i=1}^{k}(b_{i}-a_{i}) for all bounded kk-dimensional rsc rectangles (a,b](\boldsymbol {a}, \boldsymbol {b}].

?
Problem 4.5.3

Here is an alternative but quite similar construction of a set outside L\mathscr {L}. We shall consider (0,1](0,1] as our space. Let +˙\dot{+} denote addition modulo 1: for x,y∈(0,1]x, y \in (0,1],

x+˙y={x+y,if x+y⩽1,x+y−1,if x+y>1. x \mathbin {\dot{+}} y= \begin{cases} x+y, & \text{if } x+y \leqslant 1, \\ x+y-1, & \text{if } x+y>1. \end{cases}

For each A⊆(0,1]A \subseteq (0,1] and x∈(0,1]x \in (0,1], we shall [for this exercise only] write A⊕xA \oplus x as translation modulo 1: A⊕x={a+˙x:a∈A}A \oplus x=\left\{ a \mathbin {\dot{+}} x: a \in A\right\}. Finally, [for this exercise only] we shall let Q\mathbb {Q} denote the rational numbers of (0,1](0,1].

?
(a)

For x,y∈(0,1]x, y \in (0,1] write x∼yx \sim y iff there is r∈Qr \in \mathbb {Q} such that x+˙r=yx \mathbin {\dot{+}} r=y. Then ∼\sim is an equivalence relation.

(b)

Let FF denote the set formed by choosing exactly one element from each equivalence class [use (AC)]. Show that (F⊕r1)∩(F⊕r2)(F \oplus r_{1}) \cap (F \oplus r_{2}) is empty if r1r_{1} and r2r_{2} are distinct elements of Q\mathbb {Q}.

(c)

(0,1]=⋃r∈Q(F⊕r)(0,1]=\bigcup_{r \in \mathbb {Q}}(F \oplus r), where the union is disjoint.

(d)

F∉LF \notin \mathscr {L} and 0<λ∗(F)⩽10<\lambda^{*}(F) \leqslant 1.

(e)

If there exists a translation invariant measure μ\mu defined on a σ\sigma-field on (0,1](0,1] that includes FF and is closed under translations, then μ((0,1])\mu ((0,1]) is either 00 or +∞+\infty.

(f)

Show that there can exist no translation invariant measure defined on all subsets of (0,1](0,1] that agrees with λˉ\bar{\lambda } on the Lebesgue sets of (0,1](0,1].

Remark.
?

Argue by contradiction for (d): if F∈LF \in \mathscr {L}, then

1=λˉ((0,1])=∑r∈Qλˉ(F⊕r)=∑r∈Qλˉ(F). 1=\bar{\lambda }((0,1])=\sum _{r \in \mathbb {Q}} \bar{\lambda }(F \oplus r)=\sum _{r \in \mathbb {Q}} \bar{\lambda }(F).

If λˉ(F)=0\bar{\lambda }(F)=0, we obtain 1=01=0. If λˉ(F)>0\bar{\lambda }(F)>0, then we obtain 1=+∞1=+\infty. Conclude that λˉ(F)\bar{\lambda }(F) cannot exist, which means that F∉LF \notin \mathscr {L}. For the other part, since F⊆(0,1]F \subseteq (0,1], clearly λ∗(F)⩽1\lambda^{*}(F) \leqslant 1. To show that λ∗(F)>0\lambda^{*}(F)>0, write

1=λ∗((0,1])=λ∗(⋃r∈Q(F⊕r))⩽∑r∈Qλ∗(F⊕r)=∑r∈Qλ∗(F). 1=\lambda ^{*}((0,1])=\lambda ^{*}\left(\bigcup _{r \in \mathbb {Q}}(F \oplus r)\right) \leqslant \sum _{r \in \mathbb {Q}} \lambda ^{*}(F \oplus r)=\sum _{r \in \mathbb {Q}} \lambda ^{*}(F).
Problem 4.5.4

Prove the following assertions.

?
(a)

There exists a sequence {En}n=1∞\left\{ E_{n}\right\}_{n=1}^{\infty } of disjoint sets [not necessarily in L\mathscr {L}] such that λ∗(⋃n=1∞En)<∑n=1∞λ∗(En)\lambda^{*}\left(\bigcup_{n=1}^{\infty } E_{n}\right)<\sum_{n=1}^{\infty } \lambda^{*}(E_{n}).

(b)

There exists a nonincreasing sequence {En}n=1∞\left\{ E_{n}\right\}_{n=1}^{\infty } of sets [not necessarily in L\mathscr {L}] with λ∗(En)<+∞\lambda^{*}(E_{n})<+\infty for each n∈Nn \in \mathbb {N} such that λ∗(⋂n=1∞En)<lim⁡nλ∗(En)\lambda^{*}\left(\bigcap_{n=1}^{\infty } E_{n}\right)<\lim_{n} \lambda^{*}(E_{n}).

Remark.
?

For (a): first, show that λ∗\lambda^{*} is translation invariant. Let {rn}n=1∞\left\{ r_{n}\right\}_{n=1}^{\infty } denote the rationals in (0,1](0,1], and let En=F⊕rnE_{n}=F \oplus r_{n}, where FF is the set from Exercise 4.5.3 [the set formed by choosing exactly one element from each equivalence class of ∼\sim on (0,1](0,1], where x∼yx \sim y iff x+˙r=yx \mathbin {\dot{+}} r=y for some rational rr] and ⊕\oplus denotes translation modulo 1.

Problem 4.5.5

Let A∈LkA \in \mathscr {L}^{k} be such that λˉk(A)>0\bar{\lambda }_{k}(A)>0. There exist x,y∈A\boldsymbol {x}, \boldsymbol {y} \in A so that x−y∈Qk\boldsymbol {x}-\boldsymbol {y} \in \mathbb {Q}^{k}.

?
Problem 4.5.6

Let T:R2→RT: \mathbb {R}^{2} \rightarrow \mathbb {R} be such that Tx=x1T \boldsymbol {x}=x_{1} for all x∈R2\boldsymbol {x} \in \mathbb {R}^{2}. That is, TT projects points [perpendicularly] onto the x1x_{1}-axis.

?
(a)

Such a mapping is linear and singular.

(b)

There exists A∈B(R2)A \in \mathscr {B}\left(\mathbb {R}^{2}\right) such that (i) TATA, viewed as a subset of R\mathbb {R}, is not in B\mathscr {B}, while (ii) TATA, viewed as a subset of R2\mathbb {R}^{2}, is in B(R2)\mathscr {B}\left(\mathbb {R}^{2}\right).

Remark.
?

Consider the set E×{0}E \times \left\{ 0\right\}, where EE is the one-dimensional form of the set constructed in this section.

Problem 4.5.7

For any linear mapping TT [singular or nonsingular] defined on Rk\mathbb {R}^{k}, A∈LkA \in \mathscr {L}^{k} forces TA∈LkTA \in \mathscr {L}^{k}.

?
Remark.
?

The result has been established for nonsingular TT (Claim 11(ii) of Section 4.4: if TT is a nonsingular transformation, then for every A∈LkA \in \mathscr {L}^{k} we have TA∈LkTA \in \mathscr {L}^{k} and λˉk(TA)=∣det⁡(T)∣λˉk(A)\bar{\lambda }_{k}(TA)=\left|\operatorname {det}\left(T\right)\right| \bar{\lambda }_{k}(A)). For singular TT, observe that TA⊆TRkTA \subseteq T\mathbb {R}^{k}, which is a hyperplane, hence a Borel set of λk\lambda_{k}-measure zero.

Problem 4.6.1

If x∈[0,1]x \in [0,1] has a finite ternary expansion that ends in two or more 11's, then x∉Cx \notin C.

?
Remark.
?

The set of dyadic rationals of (0,1)(0,1) is D={d∈(0,1):d=m/2n,n∈N,m=1,⋯ ,2n−1}D=\left\{ d \in (0,1): d=m / 2^{n}, n \in \mathbb {N}, m=1, \cdots , 2^{n}-1\right\}, written in lowest terms. The Cantor Set is constructed in stages: at Stage 11, remove the open middle third J1/2=(1/3,2/3)J_{1/2}=(1/3,2/3) from [0,1][0,1], leaving the two closed intervals [0,1/3][0,1/3] and [2/3,1][2/3,1]. At Stage nn, there are 2n−12^{n-1} disjoint closed intervals remaining, each of length (1/3)n−1(1/3)^{n-1}; from each, remove the open middle third, denoting these 2n−12^{n-1} removed open intervals by J1/2n,J3/2n,…,J(2n−1)/2nJ_{1/2^{n}}, J_{3/2^{n}}, \ldots , J_{(2^{n}-1)/2^{n}}, leaving 2n2^{n} disjoint closed intervals, each of Lebesgue measure (1/3)n(1/3)^{n}. Carrying this out for every n∈Nn \in \mathbb {N} removes the intervals {Jd:d∈D}\left\{ J_{d}: d \in D\right\} from [0,1][0,1]; the Cantor Set is C=[0,1]−⋃d∈DJdC=[0,1]-\bigcup_{d \in D} J_{d}. Claim 1(b): x∈Cx \in C iff xx has a unique ternary expansion [terminating or nonterminating] consisting exclusively of 00's and 22's.

Problem 4.6.2

Let x∈Cx \in C.

?
(a)

xx has exactly two different ternary expansions iff there exists d∈Dd \in D such that xx is an endpoint of the removed interval JdJ_{d}.

(b)

For each d∈Dd \in D, either Jd=(0.1,0.2)J_{d}=(0.1,0.2) [base 3], or for some n∈Nn \in \mathbb {N} the interval JdJ_{d} has the form (0.a1⋯an1,0.a1⋯an2)(0.a_{1} \cdots a_{n} 1, 0.a_{1} \cdots a_{n} 2), where a1,⋯ ,an∈{0,2}a_{1}, \cdots , a_{n} \in \left\{ 0,2\right\}.

Problem 4.6.3

1/4∈C1 / 4 \in C, even though 1/41 / 4 fails to be an endpoint of any removed interval JdJ_{d}. Also, 0,1∈C0,1 \in C.

?
Problem 4.6.4

There is a certain symmetry concerning CC.

?
(a)

CC is symmetric about 12\frac{1}{2}: x∈Cx \in C iff 1−x∈C1-x \in C.

(b)

Let d∈Dd \in D, and write Jd=(α,β)J_{d}=(\alpha , \beta ). Then 1−d∈D1-d \in D and J1−d=(1−β,1−α)J_{1-d}=(1-\beta , 1-\alpha ).

Problem 4.6.5

{x−y:x,y∈C}=[−1,1]\left\{ x-y: x, y \in C\right\} =[-1,1] and {x+y:x,y∈C}=[0,2]\left\{ x+y: x, y \in C\right\} =[0,2], so that

λ({x−y:x,y∈C})=λ({x+y:x,y∈C})=2. \lambda (\left\{ x-y: x, y \in C\right\} )=\lambda (\left\{ x+y: x, y \in C\right\} )=2.

That is, while λ(C)=0\lambda (C)=0, both C⊕CC \oplus C and C⊖CC \ominus C have positive Lebesgue measure.

?
Problem 4.6.6

CC is perfect: each x∈Cx \in C is the limit of a sequence of distinct points of CC.

?
Problem 4.6.7

Let ICI_{C} be the indicator function for CC: IC(x)I_{C}(x) is 11 or 00 as x∈Cx \in C or x∉Cx \notin C. Then ICI_{C} is continuous on [0,1]−C[0,1]-C, and ICI_{C} is discontinuous at each x∈Cx \in C.

?
Problem 4.6.8

This problem reviews some basic analysis facts that will be used in the next part of this section.

?
(a)

Every collection of disjoint nonempty open intervals is amc.

(b)

Let f:(a,b)→Rf:(a, b) \rightarrow \mathbb {R} be monotone. Then the set of points of discontinuity of ff is amc, and the only discontinuities are jump discontinuities.

(c)

If f:[a,b]→[c,d]f:[a, b] \rightarrow [c, d] is monotone and onto, then ff is continuous.

Remark.
?

For (a): each such interval contains a distinct rational, and there are only countably many rationals. For (b): recall that ff has a jump discontinuity at xx if and only if both f(x−)f(x-) and f(x+)f(x+) exist, where at least one of f(x−)f(x-) or f(x+)f(x+) differs from f(x)f(x). For (c): use (b).

Problem 4.6.9

We actually have {x∈[0,1]:F′(x) exists and equals zero}∈B\left\{ x \in [0,1]: F'(x) \text{ exists and equals zero}\right\} \in \mathscr {B}.

?
Remark.
?

Show that this set actually equals the Borel set ⋃d∈DJd\bigcup_{d \in D} J_{d}. The Lebesgue [Singular] Function F:[0,1]→RF: [0,1] \rightarrow \mathbb {R} is defined by writing F(x)=sup⁡{f(y):y∈C,y⩽x}F(x)=\sup \left\{ f(y): y \in C, y \leqslant x\right\} for every x∈[0,1]x \in [0,1], where f:C→Rf: C \rightarrow \mathbb {R} is defined by: if x=0.a1a2⋯x=0.a_{1} a_{2} \cdots is the unique ternary expansion of x∈Cx \in C consisting exclusively of 00's and 22's, then f(x)=∑n=1∞an/22n=0.a12a22⋯f(x)=\sum_{n=1}^{\infty } \frac{a_{n}/2}{2^{n}}=0.\frac{a_{1}}{2} \frac{a_{2}}{2} \cdots [base 2]. Claim 3: F=fF=f on CC, with F(0)=0F(0)=0 and F(1)=1F(1)=1; FF is onto [0,1][0,1], nondecreasing, and continuous [in fact uniformly continuous]; and for each d∈Dd \in D, F(x)=dF(x)=d for each x∈Jdx \in J_{d} [so F′(x)F'(x) exists and equals 00 on each JdJ_{d}].

Problem 4.6.10

Let n∈Nn \in \mathbb {N}.

?
(a)

If x,y∈Cx, y \in C and ∣x−y∣<3−n\left|x-y\right|<3^{-n}, then ∣f(x)−f(y)∣⩽2−n\left|f(x)-f(y)\right| \leqslant 2^{-n}.

(b)

If x,y∈[0,1]x, y \in [0,1] and ∣x−y∣<3−n\left|x-y\right|<3^{-n}, then ∣F(x)−F(y)∣⩽2−n\left|F(x)-F(y)\right| \leqslant 2^{-n}. This constitutes another proof that FF is uniformly continuous.

Problem 4.6.11

There is an alternative way of constructing the Lebesgue function. Define g:⋃d∈DJd→[0,1]g: \bigcup_{d \in D} J_{d} \rightarrow [0,1] by writing g(x)=dg(x)=d for all x∈Jdx \in J_{d}, d∈Dd \in D.

?
(a)

gg is nondecreasing.

(b)

gg is uniformly continuous.

(c)

So far gg is defined only on ⋃d∈DJd\bigcup_{d \in D} J_{d}. Define a new function GG with domain [0,1][0,1] by writing G(x)=lim⁡ng(xn)G(x)=\lim_{n} g(x_{n}), where {xn}n=1∞\left\{ x_{n}\right\}_{n=1}^{\infty } is a sequence of points in ⋃d∈DJd\bigcup_{d \in D} J_{d} such that xn→xx_{n} \rightarrow x. For each x∈[0,1]x \in [0,1] the value of G(x)G(x) does not depend on the sequence {xn}n=1∞\left\{ x_{n}\right\}_{n=1}^{\infty } of points in ⋃d∈DJd\bigcup_{d \in D} J_{d} that converges to xx, so GG is well-defined.

(d)

G=gG=g on ⋃d∈DJd\bigcup_{d \in D} J_{d}, and part (b) forces GG to be continuous on [0,1][0,1].

(e)

G=FG=F, where FF is the Lebesgue Singular Function as we have constructed it.

Problem 4.6.12

Let DαD_{\alpha } denote a subset of [0,1][0,1] constructed in the same fashion as the Cantor Set CC, except for the fact that [for each n∈Nn \in \mathbb {N}] at the nnth step, instead of removing the middle third of the 2n−12^{n-1} remaining closed intervals, we instead remove the middle portion of length α3−n\alpha 3^{-n}, where α∈[0,1]\alpha \in [0,1]. [The set CC corresponds to D1D_{1}, and [0,1][0,1] corresponds to D0D_{0}.] Then DαD_{\alpha } is closed, hence in B\mathscr {B}. Also, DαcD_{\alpha }^{c} is a dense subset of [0,1][0,1], and λ(Dα)=1−α\lambda (D_{\alpha })=1-\alpha.

?
Remark.
?

Such sets DαD_{\alpha } for 0<α<10<\alpha <1 are called fat Cantor Sets because they are constructed in a fashion similar to that by which CC was constructed, but unlike CC, they have positive Lebesgue measure.

Problem 4.7.1

Construct a set in Lk−Bk\mathscr {L}^{k} - \mathscr {B}^{k} for each k⩾2k \geqslant 2.

?
Remark.
?

When k⩾2k \geqslant 2, there are very simple uncountable Borel sets of Lebesgue measure zero, namely, the hyperplanes. Use these and an appropriate homeomorphism to carry out the construction. Alternatively, one can find the answer given somewhat implicitly in Section 4.2.

Problem 4.7.2

The homeomorphic image of a Borel set is a Borel set.

?
Problem 4.7.3

The homeomorphic image of a Lebesgue set is not necessarily a Lebesgue set. Therefore, the Lebesgue and Borel sets behave differently in this regard.

?
Remark.
?

From the construction, ϕ−1(B)∈L\phi^{-1}(B) \in \mathscr {L}. The image of ϕ−1(B)\phi^{-1}(B) under the homeomorphism ϕ\phi is B∉LB \notin \mathscr {L}.

Problem 4.8.1

There can exist no measure μ:2Rk→R‾\mu : 2^{\mathbb {R}^{k}} \rightarrow \overline{\mathbb {R}} such that (i) 0<μ(Rk)⩽+∞0 < \mu \left(\mathbb {R}^{k}\right) \leqslant +\infty, (ii) μ\mu assigns a finite nonnegative number to each bounded subset of Rk\mathbb {R}^{k}, and (iii) μ({x})=0\mu \left(\left\{ \boldsymbol {x}\right\} \right) = 0 for each x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}. This is the kk-dimensional version of the Impossibility Theorem.

Impossibility Theorem: There can exist no measure μ:2R→R‾\mu : 2^{\mathbb {R}} \rightarrow \overline{\mathbb {R}} with μ(R)>0\mu (\mathbb {R}) > 0 that simultaneously (a) assigns finite measure to bounded sets, and (b) assigns zero measure to each singleton. In particular, Lebesgue measure cannot be consistently defined for every subset of R\mathbb {R}.

?
Problem 4.9.1

ΔF,Bk∗({x})=0\Delta_{F, \mathcal{B}^{k}}^{*}\left(\left\{ \boldsymbol {x}\right\} \right) = 0 for all x∈Rk\boldsymbol {x} \in \mathbb {R}^{k} iff F∈SkF \in \mathfrak {S}_{k} is continuous.

Notation and framework (Section 4.9): Let Ak\mathcal{A}_{k} denote the semiring consisting of ∅\varnothing and the bounded kk-dimensional rsc rectangles (a,b](\boldsymbol {a}, \boldsymbol {b}], and let F∈SkF \in \mathfrak {S}_{k}. Then ΔF:Ak→R\Delta_{F}: \mathcal{A}_{k} \rightarrow \mathbb {R} is a measure. Let ΔF∗:2Rk→R‾\Delta_{F}^{*}: 2^{\mathbb {R}^{k}} \rightarrow \overline{\mathbb {R}} denote the outer measure induced by ΔF\Delta_{F}. Then the restriction ΔF,M(ΔF∗)∗\Delta_{F, \mathcal{M}\left(\Delta_{F}^{*}\right)}^{*} of ΔF∗\Delta_{F}^{*} to M(ΔF∗)\mathcal{M}\left(\Delta_{F}^{*}\right) is a measure, and the restriction ΔF,Bk∗\Delta_{F, \mathcal{B}^{k}}^{*} of ΔF∗\Delta_{F}^{*} to Bk\mathscr {B}^{k} is a measure as well.

Construction of the set BB: Let {Fη:η≺ω}\left\{ F_{\eta }: \eta \prec \omega \right\} denote a well ordering of the c\mathfrak {c} uncountable closed subsets of Rk\mathbb {R}^{k}, where ω\omega denotes the smallest uncountable ordinal (this well ordering exists by (AC) together with the fact that the collection of uncountable closed subsets of Rk\mathbb {R}^{k} has cardinal number c\mathfrak {c}). By transfinite induction, for each η≺ω\eta \prec \omega choose distinct points xη,yη∈Fη−Aη\boldsymbol {x}_{\eta }, \boldsymbol {y}_{\eta } \in F_{\eta } - A_{\eta }, where Aη={xγ:γ≺η}∪{yγ:γ≺η}A_{\eta } = \left\{ \boldsymbol {x}_{\gamma }: \gamma \prec \eta \right\} \cup \left\{ \boldsymbol {y}_{\gamma }: \gamma \prec \eta \right\} (this is always possible since card⁡(Aη)<c=card⁡(Fη)\operatorname {card}\left(A_{\eta }\right) < \mathfrak {c} = \operatorname {card}\left(F_{\eta }\right)). Let B={xη:η≺ω}B = \left\{ \boldsymbol {x}_{\eta }: \eta \prec \omega \right\}.

Claim 1: For any A∈M(ΔF∗)A \in \mathcal{M}\left(\Delta_{F}^{*}\right) (with F∈SkF \in \mathfrak {S}_{k}), ΔF,M(ΔF∗)∗(A)=sup⁡{ΔF,Bk∗(K):K⊆A,K compact}\Delta_{F, \mathcal{M}\left(\Delta_{F}^{*}\right)}^{*}(A) = \sup \left\{ \Delta_{F, \mathcal{B}^{k}}^{*}(K): K \subseteq A, K \text{ compact}\right\}.

Claim 2: The collection of open subsets of Rk\mathbb {R}^{k} has cardinal number c\mathfrak {c}.

Claim 3: The collection of uncountable closed subsets of Rk\mathbb {R}^{k} has cardinal number c\mathfrak {c}.

Claim 4: For any η≺ω\eta \prec \omega, B∩Fη≠∅B \cap F_{\eta } \neq \varnothing and Bc∩Fη≠∅B^{c} \cap F_{\eta } \neq \varnothing.

Claim 5: If F∈SkF \in \mathfrak {S}_{k} is continuous, then ΔF,Bk∗({x})=0\Delta_{F, \mathcal{B}^{k}}^{*}\left(\left\{ \boldsymbol {x}\right\} \right) = 0 for every x∈Rk\boldsymbol {x} \in \mathbb {R}^{k}.

?
Problem 4.9.2

Let F∈SF \in \mathfrak {S} be continuous. For each ε>0\varepsilon >0 there exists a nowhere dense perfect set A⊆[0,1]A \subseteq [0,1] such that A∈M(ΔF∗)A \in \mathcal{M}\left(\Delta_{F}^{*}\right) and ΔF,M(ΔF∗)∗(A)>ΔF,B∗([0,1])−ε\Delta_{F, \mathcal{M}\left(\Delta_{F}^{*}\right)}^{*}(A) > \Delta_{F, \mathcal{B}}^{*}([0,1]) - \varepsilon. In the case of Lebesgue measure, this says [roughly] that there is a subset of [0,1][0,1] with Lebesgue measure ["length"] arbitrarily close to 1, yet this set contains no open subinterval of [0,1][0,1].

?
Remark.
?

Let q1,q2,…q_{1}, q_{2}, \ldots denote the rational numbers in [0,1][0,1]. For each n∈Nn \in \mathbb {N}, find εn\varepsilon_{n} such that Bn=(qn−εn,qn+εn)B_{n} = \left(q_{n} - \varepsilon_{n}, q_{n} + \varepsilon_{n}\right) has ΔF,B∗\Delta_{F, \mathcal{B}}^{*}-measure less than 2−n2^{-n}, which is possible by the continuity of FF. Let A=[0,1]−⋃n=1∞BnA = [0,1] - \bigcup_{n=1}^{\infty } B_{n}. AA is closed and the interior of AA is empty by construction.

Problem 4.9.3

Let F∈SF \in \mathfrak {S} be continuous. There exists a set B⊆[0,1]B \subseteq [0,1] with (i) B∈M(ΔF∗)B \in \mathcal{M}\left(\Delta_{F}^{*}\right), (ii) BB is a countable union of nowhere dense sets, and (iii) ΔF,M(ΔF∗)∗(B)=ΔF,B∗([0,1])\Delta_{F, \mathcal{M}\left(\Delta_{F}^{*}\right)}^{*}(B) = \Delta_{F, \mathcal{B}}^{*}([0,1]).

?
Remark.
?

For each n∈Nn \in \mathbb {N}, use problem 4.9.2 to find a nowhere dense perfect set An⊆[0,1]A_{n} \subseteq [0,1] with ΔF,M(ΔF∗)∗(An)>ΔF,B∗([0,1])−n−1\Delta_{F, \mathcal{M}\left(\Delta_{F}^{*}\right)}^{*}(A_{n}) > \Delta_{F, \mathcal{B}}^{*}([0,1]) - n^{-1}. Let B=⋃n=1∞AnB = \bigcup_{n=1}^{\infty } A_{n}.

Problem 4.9.4

Let F∈SF \in \mathfrak {S} be continuous. There exists a set C⊆[0,1]C \subseteq [0,1] such that (i) CC is the countable intersection of open subsets of [0,1][0,1], (ii) CC is not a countable union of nowhere dense sets, and (iii) the ΔF,M(ΔF∗)∗\Delta_{F, \mathcal{M}\left(\Delta_{F}^{*}\right)}^{*}-measure of CC is 0.

?
Remark.
?

Use problem 4.9.3.

Problem 4.9.5

The Continuum Hypothesis (CH) and the Axiom of Choice (AC) imply that there exists a set S⊆RS \subseteq \mathbb {R} with card⁡(S)=c\operatorname {card}(S) = \mathfrak {c}, S∈M(ΔF∗)S \in \mathcal{M}\left(\Delta_{F}^{*}\right), and ΔF,M(ΔF∗)∗(S)=0\Delta_{F, \mathcal{M}\left(\Delta_{F}^{*}\right)}^{*}(S) = 0 for every continuous F∈SF \in \mathfrak {S}. Follow this outline.

?
(a)

There exists a well-ordering {Cη:η≺ω}\left\{ C_{\eta }: \eta \prec \omega \right\} of the collection of nowhere dense closed subsets of [0,1][0,1], where ω\omega again denotes the smallest uncountable ordinal.

(b)

Employ a transfinitely recursive scheme to obtain a set {xη:η≺ω}\left\{ x_{\eta }: \eta \prec \omega \right\} by the following: let x0∈[0,1]−C0x_{0} \in [0,1] - C_{0}; suppose that for each γ≺η\gamma \prec \eta the number xγx_{\gamma } is defined for each γ≺η\gamma \prec \eta. Pick xη∈[0,1]−⋃γ≺η(Cγ∪{xγ})x_{\eta } \in [0,1] - \bigcup_{\gamma \prec \eta }\left(C_{\gamma } \cup \left\{ x_{\gamma }\right\} \right). This construction requires (AC). [Precisely where?]

(c)

Let S={xη:η≺ω}S = \left\{ x_{\eta }: \eta \prec \omega \right\}. Then (CH) forces card⁡(S)=c\operatorname {card}(S) = \mathfrak {c}.

(d)

For every η≺ω\eta \prec \omega, S∩CηS \cap C_{\eta } is amc.

(e)

S∈M(ΔF∗)S \in \mathcal{M}\left(\Delta_{F}^{*}\right) and ΔF,M(ΔF∗)∗(S)=0\Delta_{F, \mathcal{M}\left(\Delta_{F}^{*}\right)}^{*}(S) = 0 for every continuous F∈SF \in \mathfrak {S}.

(f)

SS cannot contain a nonempty perfect subset.