Problems to check your understanding of this chapter. The solutions are folded away — try them yourself first.
Medium
1Medium
An irrational x is a Liouville number if for every m≥1 there are infinitely many integer pairs (p,q) with q≥2 satisfying ∣x−p/q∣<1/qm. For k≥1 put Uk=⋃q≥2⋃p∈Z(p/q−1/qk, p/q+1/qk). (a) Show each Uk is a dense open set in R. (b) Show G=⋂k≥1Uk∩⋂j≥1(R∖{rj}), where {rj} enumerates the rationals, is a Gδ set all of whose elements are Liouville numbers. (c) Use the Baire category theorem to conclude the Liouville numbers are dense in R and uncountable.
Uk=q≥2⋃p∈Z⋃(qp−qk1, qp+qk1)
G=k≥1⋂Uk ∩ j≥1⋂(R∖{rj})
Show solution
- (a) Each Uk is a union of open intervals, hence open. Every rational p/q lies in the interval centered at itself, so Q⊂Uk; since Q is dense, each Uk is dense.
- (b) G is a countable intersection of open sets, hence Gδ (each R∖{rj} is open too). Let x∈G. Then x is irrational, and for each k there is a pair (pk,qk) with ∣x−pk/qk∣<1/qkk. If only finitely many distinct pairs occurred, some pair (p,q) would repeat for infinitely many k, forcing ∣x−p/q∣=0, i.e. x=p/q, contradicting irrationality. So infinitely many distinct pairs occur. For fixed m, the pairs with k≥m satisfy ∣x−pk/qk∣<1/qkk≤1/qkm, so x meets the definition of a Liouville number.
- (c) G is a countable intersection of dense open sets, so by the Baire category theorem it is dense in R; hence so are the Liouville numbers. Moreover G is uncountable: if G={xn} were countable, then G∩⋂n(R∖{xn})=∅ would be a countable intersection of dense open sets, hence dense by Baire — a contradiction.
2Medium
Let T(x)=4cosx+1 for x∈[0,1]. (a) Show T maps [0,1] into itself and is a contraction (name the contraction constant). (b) Conclude T has a unique fixed point x∗∈[0,1]. (c) With x0=0 and xn+1=T(xn), use the error bound ∣xn−x∗∣≤1−qqn∣x1−x0∣ to find the smallest n guaranteeing ∣xn−x∗∣<10−3.
∣T(x)−T(y)∣≤41∣x−y∣
∣xn−x∗∣≤32(41)n
Show solution
- (a) cos decreases on [0,π] and 1<π/3, so cos1>cos(π/3)=1/2. Hence for x∈[0,1], cosx∈(cos1,1]⊂(1/2,1] and T(x)∈(3/8,1/2]⊂[0,1]. For the contraction property, the mean value theorem gives ∣cosx−cosy∣≤∣x−y∣ (since ∣sin∣≤1), so
∣T(x)−T(y)∣=4∣cosx−cosy∣≤41∣x−y∣,
- So T is a contraction with constant q=1/4. Since [0,1] is a complete metric space, the Banach fixed point theorem gives a unique fixed point x∗∈[0,1]. This is (b).
- (c) With x0=0, x1=T(0)=1/2, so ∣x1−x0∣=1/2. The error bound with q=1/4 gives ∣xn−x∗∣≤3/4(1/4)n⋅21=324−n. Now 324−n<10−3 iff 4n>2000/3≈666.7, and 44=256<666.7<1024=45, so the smallest such n is 5. Indeed ∣x5−x∗∣≤3⋅10242=15361<10−3.
3Medium
Let C be the set of points in [0,1] possessing a ternary expansion using only the digits 0 and 2 (the standard middle-thirds Cantor set). For C+C={x+y:x,y∈C}, prove C+C=[0,2].
C={n=1∑∞3n2an:an∈{0,1}}
C+C=[0,2]
Show solution
- Dividing the digits by 2 rewrites the set as C={∑n≥12an3−n:an∈{0,1}}. If x,y∈C then x+y≤2, so C+C⊂[0,2] is clear. We prove the reverse inclusion.
- Let s∈[0,2]. Then s/2∈[0,1] has a ternary expansion s/2=∑n≥1en3−n with en∈{0,1,2}. Split each digit: put (an,bn)=(0,0) if en=0, (1,0) if en=1, (1,1) if en=2; then an,bn∈{0,1} and en=an+bn. With x=∑2an3−n and y=∑2bn3−n, we have x,y∈C and
x+y=n=1∑∞3n2(an+bn)=2n=1∑∞3nen=s.
- Hence s∈C+C. Since s was arbitrary, [0,2]⊂C+C, and the two inclusions give C+C=[0,2]. Remarkably, the sum of two "hole-ridden" sets of measure zero fills an entire interval.