← 4. Topology

Exercises

Problems to check your understanding of this chapter. The solutions are folded away — try them yourself first.

Medium

1Medium

An irrational xx is a Liouville number if for every m≥1m \ge 1 there are infinitely many integer pairs (p,q)(p, q) with q≥2q \ge 2 satisfying ∣x−p/q∣<1/qm|x - p/q| < 1/q^m. For k≥1k \ge 1 put Uk=⋃q≥2⋃p∈Z(p/q−1/qk, p/q+1/qk)U_k = \bigcup_{q \ge 2}\bigcup_{p \in \mathbb{Z}} (p/q - 1/q^k,\ p/q + 1/q^k). (a) Show each UkU_k is a dense open set in R\mathbb{R}. (b) Show G=⋂k≥1Uk∩⋂j≥1(R∖{rj})G = \bigcap_{k \ge 1} U_k \cap \bigcap_{j \ge 1} (\mathbb{R} \setminus \{r_j\}), where {rj}\{r_j\} enumerates the rationals, is a GδG_\delta set all of whose elements are Liouville numbers. (c) Use the Baire category theorem to conclude the Liouville numbers are dense in R\mathbb{R} and uncountable.

Uk=⋃q≥2⋃p∈Z(pq−1qk, pq+1qk)U_k = \bigcup_{q \ge 2}\bigcup_{p \in \mathbb{Z}} \left(\frac{p}{q} - \frac{1}{q^k},\ \frac{p}{q} + \frac{1}{q^k}\right)
G=⋂k≥1Uk ∩ ⋂j≥1(R∖{rj})G = \bigcap_{k \ge 1} U_k \ \cap\ \bigcap_{j \ge 1} (\mathbb{R} \setminus \{r_j\})
Show solution
  1. (a) Each UkU_k is a union of open intervals, hence open. Every rational p/qp/q lies in the interval centered at itself, so Q⊂Uk\mathbb{Q} \subset U_k; since Q\mathbb{Q} is dense, each UkU_k is dense.
  2. (b) GG is a countable intersection of open sets, hence GδG_\delta (each R∖{rj}\mathbb{R} \setminus \{r_j\} is open too). Let x∈Gx \in G. Then xx is irrational, and for each kk there is a pair (pk,qk)(p_k, q_k) with ∣x−pk/qk∣<1/qkk|x - p_k/q_k| < 1/q_k^k. If only finitely many distinct pairs occurred, some pair (p,q)(p, q) would repeat for infinitely many kk, forcing ∣x−p/q∣=0|x - p/q| = 0, i.e. x=p/qx = p/q, contradicting irrationality. So infinitely many distinct pairs occur. For fixed mm, the pairs with k≥mk \ge m satisfy ∣x−pk/qk∣<1/qkk≤1/qkm|x - p_k/q_k| < 1/q_k^k \le 1/q_k^m, so xx meets the definition of a Liouville number.
  3. (c) GG is a countable intersection of dense open sets, so by the Baire category theorem it is dense in R\mathbb{R}; hence so are the Liouville numbers. Moreover GG is uncountable: if G={xn}G = \{x_n\} were countable, then G∩⋂n(R∖{xn})=∅G \cap \bigcap_n (\mathbb{R} \setminus \{x_n\}) = \varnothing would be a countable intersection of dense open sets, hence dense by Baire — a contradiction.
2Medium

Let T(x)=cos⁡x+14T(x) = \frac{\cos x + 1}{4} for x∈[0,1]x \in [0, 1]. (a) Show TT maps [0,1][0, 1] into itself and is a contraction (name the contraction constant). (b) Conclude TT has a unique fixed point x∗∈[0,1]x^* \in [0, 1]. (c) With x0=0x_0 = 0 and xn+1=T(xn)x_{n+1} = T(x_n), use the error bound ∣xn−x∗∣≤qn1−q∣x1−x0∣|x_n - x^*| \le \frac{q^n}{1-q}|x_1 - x_0| to find the smallest nn guaranteeing ∣xn−x∗∣<10−3|x_n - x^*| < 10^{-3}.

∣T(x)−T(y)∣≤14∣x−y∣|T(x) - T(y)| \le \frac{1}{4}|x - y|
∣xn−x∗∣≤23(14)n|x_n - x^*| \le \frac{2}{3}\left(\frac{1}{4}\right)^n
Show solution
  1. (a) cos⁡\cos decreases on [0,π][0, \pi] and 1<π/31 < \pi/3, so cos⁡1>cos⁡(π/3)=1/2\cos 1 > \cos(\pi/3) = 1/2. Hence for x∈[0,1]x \in [0,1], cos⁡x∈(cos⁡1,1]⊂(1/2,1]\cos x \in (\cos 1, 1] \subset (1/2, 1] and T(x)∈(3/8,1/2]⊂[0,1]T(x) \in (3/8, 1/2] \subset [0, 1]. For the contraction property, the mean value theorem gives ∣cos⁡x−cos⁡y∣≤∣x−y∣|\cos x - \cos y| \le |x - y| (since ∣sin⁡∣≤1|\sin| \le 1), so
    ∣T(x)−T(y)∣=∣cos⁡x−cos⁡y∣4≤14∣x−y∣,|T(x) - T(y)| = \frac{|\cos x - \cos y|}{4} \le \frac{1}{4}|x - y|,
  2. So TT is a contraction with constant q=1/4q = 1/4. Since [0,1][0, 1] is a complete metric space, the Banach fixed point theorem gives a unique fixed point x∗∈[0,1]x^* \in [0, 1]. This is (b).
  3. (c) With x0=0x_0 = 0, x1=T(0)=1/2x_1 = T(0) = 1/2, so ∣x1−x0∣=1/2|x_1 - x_0| = 1/2. The error bound with q=1/4q = 1/4 gives ∣xn−x∗∣≤(1/4)n3/4⋅12=234−n|x_n - x^*| \le \frac{(1/4)^n}{3/4} \cdot \frac{1}{2} = \frac{2}{3}4^{-n}. Now 234−n<10−3\frac{2}{3}4^{-n} < 10^{-3} iff 4n>2000/3≈666.74^n > 2000/3 \approx 666.7, and 44=256<666.7<1024=454^4 = 256 < 666.7 < 1024 = 4^5, so the smallest such nn is 55. Indeed ∣x5−x∗∣≤23⋅1024=11536<10−3|x_5 - x^*| \le \frac{2}{3 \cdot 1024} = \frac{1}{1536} < 10^{-3}.
3Medium

Let CC be the set of points in [0,1][0, 1] possessing a ternary expansion using only the digits 00 and 22 (the standard middle-thirds Cantor set). For C+C={x+y:x,y∈C}C + C = \{x + y : x, y \in C\}, prove C+C=[0,2]C + C = [0, 2].

C={∑n=1∞2an3n:an∈{0,1}}C = \left\{ \sum_{n=1}^{\infty} \frac{2a_n}{3^n} : a_n \in \{0, 1\} \right\}
C+C=[0,2]C + C = [0, 2]
Show solution
  1. Dividing the digits by 22 rewrites the set as C={∑n≥12an3−n:an∈{0,1}}C = \{\sum_{n \ge 1} 2a_n 3^{-n} : a_n \in \{0,1\}\}. If x,y∈Cx, y \in C then x+y≤2x + y \le 2, so C+C⊂[0,2]C + C \subset [0, 2] is clear. We prove the reverse inclusion.
  2. Let s∈[0,2]s \in [0, 2]. Then s/2∈[0,1]s/2 \in [0, 1] has a ternary expansion s/2=∑n≥1en3−ns/2 = \sum_{n \ge 1} e_n 3^{-n} with en∈{0,1,2}e_n \in \{0, 1, 2\}. Split each digit: put (an,bn)=(0,0)(a_n, b_n) = (0,0) if en=0e_n = 0, (1,0)(1,0) if en=1e_n = 1, (1,1)(1,1) if en=2e_n = 2; then an,bn∈{0,1}a_n, b_n \in \{0, 1\} and en=an+bne_n = a_n + b_n. With x=∑2an3−nx = \sum 2a_n 3^{-n} and y=∑2bn3−ny = \sum 2b_n 3^{-n}, we have x,y∈Cx, y \in C and
    x+y=∑n=1∞2(an+bn)3n=2∑n=1∞en3n=s.x + y = \sum_{n=1}^{\infty} \frac{2(a_n + b_n)}{3^n} = 2\sum_{n=1}^{\infty} \frac{e_n}{3^n} = s.
  3. Hence s∈C+Cs \in C + C. Since ss was arbitrary, [0,2]⊂C+C[0, 2] \subset C + C, and the two inclusions give C+C=[0,2]C + C = [0, 2]. Remarkably, the sum of two "hole-ridden" sets of measure zero fills an entire interval.

Hard

4Hard

Let C(f)C(f) be the set of points where f:R→Rf: \mathbb{R} \to \mathbb{R} is continuous. (a) Using the oscillation ωf(x)=inf⁡δ>0sup⁡{∣f(y)−f(z)∣:y,z∈(x−δ,x+δ)}\omega_f(x) = \inf_{\delta > 0} \sup\{|f(y) - f(z)| : y, z \in (x-\delta, x+\delta)\}, show C(f)=⋂k=1∞{x:ωf(x)<1/k}C(f) = \bigcap_{k=1}^{\infty} \{x : \omega_f(x) < 1/k\} with each {x:ωf(x)<1/k}\{x : \omega_f(x) < 1/k\} open; i.e. C(f)C(f) is a GδG_\delta set. (b) Use the Baire category theorem to show Q\mathbb{Q} is not a GδG_\delta subset of R\mathbb{R}. (c) Conclude no function f:R→Rf: \mathbb{R} \to \mathbb{R} is continuous exactly at the rationals and discontinuous exactly at the irrationals.

C(f)=⋂k=1∞{x:ωf(x)<1/k}C(f) = \bigcap_{k=1}^{\infty} \{x : \omega_f(x) < 1/k\}
Q=⋂n=1∞Gn  (Gn open)⟹⋂j=1∞(Gj∖{qj})=∅\mathbb{Q} = \bigcap_{n=1}^{\infty} G_n \ \ (G_n \text{ open}) \quad \Longrightarrow \quad \bigcap_{j=1}^{\infty}\left(G_j \setminus \{q_j\}\right) = \varnothing
Show solution
  1. (a) ff is continuous at xx iff ωf(x)=0\omega_f(x) = 0: continuity drives the oscillation on δ\delta-intervals to 00, and conversely vanishing oscillation is exactly the ε\varepsilon-δ\delta condition. Hence C(f)=⋂k{ωf<1/k}C(f) = \bigcap_k \{\omega_f < 1/k\}. Let ωf(x0)<1/k\omega_f(x_0) < 1/k. By definition of the infimum, some δ>0\delta > 0 gives M:=sup⁡{∣f(y)−f(z)∣:y,z∈(x0−δ,x0+δ)}<1/kM := \sup\{|f(y) - f(z)| : y, z \in (x_0 - \delta, x_0 + \delta)\} < 1/k. If x1∈(x0−δ/2,x0+δ/2)x_1 \in (x_0 - \delta/2, x_0 + \delta/2) then (x1−δ/2,x1+δ/2)⊂(x0−δ,x0+δ)(x_1 - \delta/2, x_1 + \delta/2) \subset (x_0 - \delta, x_0 + \delta), so ωf(x1)≤M<1/k\omega_f(x_1) \le M < 1/k. Thus {ωf<1/k}\{\omega_f < 1/k\} contains a neighborhood of x0x_0: it is open.
  2. (b) Suppose Q=⋂nGn\mathbb{Q} = \bigcap_n G_n with GnG_n open. Each Gn⊃QG_n \supset \mathbb{Q} is dense, hence open dense. Enumerate Q={q1,q2,… }\mathbb{Q} = \{q_1, q_2, \dots\} and put Hj=Gj∩(R∖{qj})H_j = G_j \cap (\mathbb{R} \setminus \{q_j\}). Each HjH_j is open dense (removing one point preserves density). By Baire, ⋂jHj\bigcap_j H_j is dense in R\mathbb{R}, but ⋂jHj⊂Q∖Q=∅\bigcap_j H_j \subset \mathbb{Q} \setminus \mathbb{Q} = \varnothing — a contradiction. So Q\mathbb{Q} is not GδG_\delta.
  3. (c) If some ff had C(f)=QC(f) = \mathbb{Q}, then (a) would make Q\mathbb{Q} a GδG_\delta, contradicting (b). Hence no function is continuous exactly on the rationals. (For contrast, Thomae's function realizes the reverse — continuous exactly at the irrationals — and the irrationals are GδG_\delta.)