Escolar Documentos
Profissional Documentos
Cultura Documentos
CIHAN BAHRAN
Given two distinct points x, y C, since |x y| > 0 there exists k N such that
|x y| > 1/3k . Because Ck is a union of closed intervals of length 1/3k and x, y Ck ,
there exists z in between x and y which does not lie in Ck . Thus z / C.
And given x C, for every k N, x lies in one of the 2k intervals that make up Ck .
Thus there exists an end-point yk in Ck such that |x yk | 1/3k . We may assume
yk 6= x here (if x happens to be an end-point of an interval in Ck itself, choose the
other end-point of the interval to be yk ). But we know that the end-points survive
the Cantor intersection, that is they lie in C. Hence [x 1/3k , x + 1/3k ] {x} inter-
sects C for every k. Since x C was arbitrary, we conclude that C has no isolated points.
Note that this decomposition is not unique since, for example, 1/3 = k
k=2 2/3 .
P
The
question asks us to prove f ({0, 2}N ) = C. In the last homework, I showed that
f {0, 2}N C (I also showed that f maps {0, 2}N injectively to C and from here
deduced that C is uncountable).
So its enough to show that C f {0, 2}N , or equivalently [0, 1]rf {0, 2}N [0, 1]rC.
So let x [0, 1]r f {0, 2}N . Since f is surjective there exists a sequence (an )nN with
an {0, 1, 2} such that x = nN an 3n . By assumption, the set {n N : an = 1}
P
must be nonempty. So pick the least element k from that set. Thus ak = 1 but
1
REAL ANALYSIS I HOMEWORK 2 2
precisely, [y, y + 3k+1 ] is one of the intervals in Ck1 . Note that on one hand
i k
ai 3i 3k
X X
xy = ai 3 =3 +
i=k i=k+1
i=k+1 1 31
which implies
(y + 3k+1 ) x = y + 3 3k x 3k .
Thus we get x y + 3k , (y + 3k+1 ) 3k , which is the middle third of the interval
[y, y + 3k+1 ]. Moreover, y and y + 3k+1 = y + i=k 2 3
i
lie in f ({0, 2}N ), thus
P
x in which ak = 0 or 2.
Show that F is well-defined and continuous on C, and moreover F (0) = 0 as well
as F (1) = 1.
since every number in [0, 1] has a binary expansion like 0.0011110010110001... . Now
we can define
F = g f 1 : C [0, 1]
where
: {0, 2}N {0, 1}N
(an )nN 7 (an /2)nN .
If we let 0 to be simply the sequence consisting entirely of 0s, we have
(g )(0) = g(0) = 0 = f (0)
thus
F (0) = (g )(f 1 (0)) = (g )(0) = 0 .
REAL ANALYSIS I HOMEWORK 2 3
thus
F (1) = (g )(f 1 (1)) = (g )(2) = 1 .
For continuity, consider the discrete topology on {0, 1} and then endow the set of
sequences {0, 1}N with the product topology. Do the same for {0, 2}N . Then being
continuous coordinate-wise, is definitely continuous. We will show that f and g are
also continuous. From here it follows that F is continuous, and since the domain {0, 2}N
of f is compact (Tychonoffs theorem!) and the codomain C of f is Hausdorff, the
bijective continuous map f is a homeomorphism; hence F is a composite of continuous
maps. And Proposition 2 yields that f and g are continuous (g by taking d = 2 and f
by taking d = 3 and restricting to {0, 2}N ).
Lemma 1. Let d be a natural number greater than 1 and write D = {0, . . . , d 1}. Let
(an )nN and (bn )nN be two distinct sequences with elements in D. Let k = min{n
N : an 6= bn }. Then
an dn < bn dn
X X
nN nN
is continuous.
nN
for every k, l N with l > k where the D {d 1} term in Vk,l occurs at the l-th
coordinate. Note that every Uk and Vk,l is open in DN . Now by Lemma 1 we get that
an dn < b} =
X [ [ [
{(an )nN : Uk Vk,l
nN kN kN l>k
which is open.
We know that f is bijective and g is surjective. is also clearly surjective by its defini-
tion. Thus F = g f 1 is also surjective.
(d) One can also extend F to be a continuous function on [0, 1] as follows. Note
that if (a, b) is an open interval of the complement of C, then F (a) = F (b). Hence
we may define F to have constant value on that interval.
and
n
(ai /2)2i + 2i
X X
F (r) =
i=1 i=n+1
n
(ai /2)2i + 2n
X
=
i=1
n1
an + 2 n
(ai /2)2i +
X
= 2
i=1 2
n1
!
i n
X
=F ai 3 + (an + 2)3
i=1
n
!
i n
X
=F ai 3 +23
i=1
= F (r + 3n )
as desired.
Note that since E is closed, it is measurable so writing m(E) is OK. Also note that
(On ) is a decreasing family of open sets.
Let O be an arbitrary open set containing E and write C = Rd r O. So E and C are
disjoint, moreover since E is compact and C is closed they are distant by a previous
exercise. Hence d(C, E) 1/n for some n. That is, every point in C is at least 1/n
away from E hence C On = . This implies that On O.
So we showed the set {On : n N} is cofinal in {O Rd : E O-open} with respect
to the reverse containment . Thus by the monotonicity of m the set {m(On ) : n N}
is cofinal in {m(O) : E O-open} with respect to . Thus their infima coincide:
lim On = inf{m(On ) : n N} = inf{m(O) : E O-open} = m(E) .
n
(b) However, the conclusion in (a) may be false for E closed and unbounded; or E
open and bounded.
For the first part, take E = N as a subset of R, which is closed and unbounded. In this
case,
[
On = (N 1/2n, N + 1/2n) .
N N
(qn 4n , qn + 4n ).
[
E=
nN
However, E is dense in [0, 1]. So given x [0, 1], for every n N there exists q E
such that d(x, q) < 1/n so x On . Thus [0, 1] On for every n and hence
1 = m([0, 1]) m(On )
for every n. Therefore
lim m(On ) 1.
n
11. Let A be the subset of [0, 1] which consists of all numbers which do not have
the digit 4 appearing in their decimal expansion. Find m(A).
This corresponds to dividing [0, 1] into 10 equal pieces, labeling them from 0 to 9 and
taking away the piece with label 4 (since the numbers between 0.4 and 0.5 should be
deleted). Then this process is applied to the 9 remaining pieces. So at the first step
REAL ANALYSIS I HOMEWORK 2 6
we take away an interval of length 1/10, at the second step we take away 9 intervals of
length 1/100 and so on. So the complement of A has measure
n1
X n1 1 1 X 9 1 1
9 n = = 9 = 1
nN 10 10 nN 10 10 1 10
hence A has measure 0.
Lets use the notation of the hint. Since F is closed, d(x, F ) = 0 if and only if x F
therefore
\
F = On .
nN
Let G be an open set. Then Gc is closed and hence is a G set. Therefore G is an F
set by de Morgan.
Proof. (2) follows from (1) by taking complements. To prove (1), write A = Fn
S
nN
and B = nN Ln where Fn , Ln are closed. Then
S
[ [
AB = (Fn Ln ), A B = (Fn Lm )
nN n,mN
are F sets.
Lets verify the hint. Assume x Ek for infinitely many k. This implies that for
every n N, there exists k n such that x Ek . That is, for every n N,
x kn Ek and hence x nN kn Ek . Conversely, assume that x nN kn Ek .
S T S T S
there exists k2 > max{2, k1 } such that x Ek2 . Going on like this, we can construct
a sequence k1 < k2 < k3 such that x Ekn for every n. Thus x lies in infinitely
many Ek . Having proved the claim, we are done since the collection of measurable sets
is closed under countable unions and countable intersections.
Thus m(E) = 0.
17. Let {fn } be a sequence of measurable functions on [0, 1] with |fn (x)| < for
a.e. x. Show that there exists a sequence cn of positive real numbers such that
fn (x)
0 a.e. x
cn
[Hint: Pick cn such that m({x : |fn (x)/cn | > 1/n}) < 2n , and apply the Borel-
Cantelli lemma.]
Fix n. Since |fn | < a.e., for every n there exists dn > 0 such that
m({x : |fn (x)| > dn }) < 2n .
Now let cn = ndn . Clearly (cn ) is a sequence of positive real numbers. If we write
|fn (x)|
En = {x : |fn (x)| > dn } = x : > 1/n ,
cn
we have
X X n
m(En ) < 2 = 1 < .
nN nN
So by the Borel-Cantelli lemma, the E := lim supn (En ) is a null set. Now by
definition, every x E c lies in only finitely many En s. That is, given x E c , there
exists N N such that for every n N we have
|fn (x)|
1/n .
cn
fn (x)
Therefore 0 for every x E c .
cn
29. Suppose E is a measurable subset of R with m(E) > 0. Prove that the
difference set of E, which is defined by
{x y : x, y E}
contains an open interval centered at the origin.
It is enough to prove the claim for a measurable subset of E with positive measure, so
we do some reductions by finding some nice subsets of E like this and replacing E with
these subsets.
First, since the collection {E (n, n + 1] : n Z} of disjoint measurable sets cover E,
by countable additivity there exists n N such that m(E (n, n + 1]) > 0. So we may
assume that E has finite measure.
Second, since 0 < m(E) < , by an exercise in the previous homework there exists a
compact set K contained in E such that (choosing = m(E)/2)
m(E r K) m(E)/2 .
Then by addivity of the measure we get m(K) m(E)/2 > 0. So we may assume that
E is compact.
REAL ANALYSIS I HOMEWORK 2 9
Third, since 0 < m(E) < there exists an open set U containing E such that
m(U r E) m(E)/2 .
Hence m(U ) 3/2 m(E) < 2m(E). Now E and U c are disjoint sets where E is
compact and U c is closed. Therefore := d(E, U c ) > 0. We claim that (, ) lies in
the difference set of E. So let t (, ). Then by the definition of , the set
E + t = {x + t : x E}
does not intersect U c , therefore E + t U and hence (E + t) E U . Note that
E + t is a measurable set with m(E + t) = m(E). Suppose (E + t) E = . Then by
additivity, we get
m(U ) m((E + t) E) = 2m(E)
which is a contradiction. Thus there exists x, y E such that x + t = y, so t lies in the
difference set of E.
30. If E and F are measurable subsets of R and m(E) > 0, m(F ) > 0, prove that
E + F = {x + y : x E, y F }
contains an interval.
that x + a + c E. Therefore a + c (E, F ). Since this is true whenever 0 < |c| < ,
the interval (a , a + ) is contained in (E, F ).
33. Let N denote the non-measurable set constructed in the text. Recall from the
exercise above that measurable subsets of N have measure zero.
Show that the set N c = I N satisfies m (N c ) = 1, and conclude that if E1 = N
and E2 = N c , then
m (E1 ) + m (E2 ) 6= m (E1 E2 )
although E1 and E2 are disjoint.
[Hint: To prove that m (N c ) = 1, argue by contradiction and pick a measurable
set U such that U I, N c U and m (U ) < 1 .]
there exists an open, hence measurable set U containing N c such that m(U ) < 1 .
Note that U I is also a measurable containing N c with m(U I) < 1 , so we may
assume U I. Since N c = I N U I, we have I U N . But I U is a
measurable set so by additivity of the measure we have
m(I U ) = m(I) m(U ) = 1 m(U ) > .
So I U is a measurable subset of N with positive measure; a contradiction. Therefore
m (N c ) 1 but on the other hand m (N c ) m (I) = 1 hence m (N c ) = 1.
We know that sets with outer measure zero are measurable, so m (N ) > 0. Thus
m (N ) + m (N c ) > 1 = m (I) = m (N N c ) .
34. Let C1 and C2 be any two Cantor sets (constructed in Exercise 3). Show that
there exists a function F : [0, 1] [0, 1] with the following properties:
(i) F is continuous and bijective.
(ii) F is monotonically increasing.
(iii) F maps C1 surjectively onto C2 .
[Hint: Copy the construction of the standard Cantor-Lebesgue function.]
Lets do as the hint commands. We know such N exists by Exercise 32(b). Since
(N ) C2 and m(C2 ) = 0, we have m ((N )) = 0 and so (N ) is a measurable set.
Therefore f is a measurable function. However,
(f )1 (1) = 1 (f 1 ({1})) = 1 ((N )) = N
is not measurable, hence f is not a measurable function. Also the measurable set
(N ) cannot be Borel because the inverse images of Borel sets under continuous func-
tions are Borel, but although is continuous, 1 ((N )) = N is not even measurable.