Analysis Lebesgue
Analysis Lebesgue
2
n+1
, a
n
+
2
n+1
_
, for n = 1, 2, 3, ....
It is easily seen that
(I
n
) =
2
n
.
Then,
Q
_
n=1
I
n
= (Q) <
_
_
n=1
I
n
_
n=1
(I
n
) =
n=1
2
n
= .
Since we can take arbitrarily small, (Q) = 0.
1-2 Find the Lebesgue measure of [0, 1] \ (
1
3
,
2
3
).
Let denote the Lebesgue measure.
[0, 1] \
_
1
3
,
2
3
_
=
_
0,
1
3
_
_
_
2
3
, 1
_
,
so that
_
[0, 1] \
_
1
3
,
2
3
__
=
__
0,
1
3
_
_
_
2
3
, 1
__
=
__
0,
1
3
__
+
__
2
3
, 1
__
=
1
3
+
1
3
=
2
3
.
1-3 := Lebesgue measure on R. For any compact interval I = [a, b], let
C(I) := I \ (s, t), where s =
2a
3
+
b
3
and t =
a
3
+
2b
3
. If I
1
,..., I
n
are pairwise-disjoint
compact intervals, then we dene C(I
1
... I
n
) := (C(I
1
)) ... (C(I
n
)). Let
C
0
:= [0, 1]. Let C
1
:= C(C
0
), C
2
:= C(C
1
), C
3
:= C(C
2
), C
4
:= C(C
3
), etc.
1
1-3a Compute (C
0
), (C
1
), (C
2
), ...
(C
0
) = ([0, 1]) = 1
(C
1
) =
_
[0, 1] \
_
1
3
,
2
3
__
=
2
3
C
2
=
_
0,
1
9
_
_
_
2
9
,
1
3
_
_
_
2
3
,
7
9
_
_
_
8
9
, 1
_
Hence, C
2
is the union of 2
2
closed intervals of length
1
3
2
. Thus,
(C
2
) =
2
2
3
2
=
4
9
.
We can inductively prove that in general C
n
is the union of 2
n
closed intervals of length
1
3
n
each, so that
(C
n
) =
_
2
3
_
n
.
Assume that we have that C
k
consists of 2
k
closed intervals of length
1
3
k
. C
k+1
is obtained
by removing the middle third of each of the 2
k
intervals in C
k
, so that the number of
intervals doubles, i.e. it becomes 2 2
k
= 2
k+1
. The length of the intervals in C
k+1
is a
third of the length of the intervals in C
k
. Thus, C
k+1
consists of 2
k+1
intervals of length
1
3
k+1
, and this completes the proof.
1-3b Compute (C
0
C
1
C
2
...).
Let > 0. Then there exists an integer n such that
_
2
3
_
n
< .
i=0
C
i
C
n
=
_
i=0
C
i
_
< (C
n
) =
_
2
3
_
n
< .
Since we can take arbitrarily small,
i=0
C
i
_
= 0.
2