Professional Documents
Culture Documents
Math 414
Spring 2004
1
if x = 1
f (x) =
1 .
1 n1 if 1 n1 x < 1 n+1
ppp
s c
s c
s c
s
s
s
1 if x = 0
t(x) = 0 x 6 Q
.
1 if x = m Q where m 6= 0 and n are relatively prime
n
n
We have shown that t is continuous at every irrational number but discontinuous at every rational number.
R1
Proposition 1 The Thomae function is integrable and 0 t = 0.
Proof The irrational numbers are dense. Thus for any partition P =
{x0 . . . , xn } there is always an irrational in every interval [xi1 , xi ]. Thus
L(t, P ) = 0. To prove that t is integrable it is enough to show that for every
> 0 there is a partition P with U (t, P ) < .
Let An = {x : t(x) n1 }. If x An , then x = i/j where i, j n. In
particular An is finite.
Suppose > 0. Choose n such that n1 < 2 . We will choose a partition P
such that each point of An is in an interval [xi1 , xi ] where
xi = xi xi1 <
.
2|An |
i6B
X
X
xi +
xi
<
2
iB
i6B
<
+ |An |
2
2|An |
< .
for all ,
R1
0
t = 0.
1 if x C
f (x) =
.
0 if x 6 C
R1
Proposition 2 f is integrable and 0 f = 0.
Recall the construction of the Cantor set from Quick Tour of the Topology
of R 11 or section 3.1 of Abbott. We build a sequence of closed sets C0
C1 C2 . . . as follows:
C0 = [0, 1],
1 if x Cn
fn (x) =
.
0 if x 6 Cn
Note that f (x) fn (x) for all x [0, 1]. The function fn is easy to integrate.
fn (x) = 1 on 2n intervals of length 31n and is 0 everywhere else. Thus
n
Z 1
2
.
fn =
3
0
Suppose > 0. Choose n such that (2/3)n < 2 and choose a partition P
such that U (fn , P ) L(fn , P ) < 2 . Then U (fn , P ) < . But f (x) fn (x)
for all x [0, 1]. Thus
U (f, P ) U (fn , P ) < .
3
Then f (x) b
h(x) for all x [a, b] and
Z b
n
X
b
h=
Mi xi = U (f, P ).
a
i=1
Rb
We next find a continuous function h b
h with a (h b
h) < . We
b
do this by modifying h near the points x1 , . . . , xn1 where there may be a
discontinuity.
The idea of the proof is easy but the notation can get messy. Rather than
giving a detailed proof we give an example.
Suppose P = {a, x1 , x2 , b} and
(c a x < x
1
1
b
h(x) = c2 x1 x < x2
c 3 x2 x b
c2
c3
c
s
c1 s
x1
x2
c1
u x1
x2v
b
Rb
We will choose u and v so that a (h b
h) < . We do this by making sure
both of the triangles have area less than 2 .
and v x2 < c2 c
. Then each triangle has area
Suppose x1 u < c2 c
1
3
R
b
c1
axu
c2 c1
c1 + x1 u (x u) u < x < x1
x1 x x2 .
h(x) = c2
c3 c2
c2 + vx2 (v x) x2 < x v
c3
v<xb
Rb
It is clear that h(x) b
h(x) for all x [a, b] and a (h b
h) < . Thus
Rb
h(x) f (x) for all x [a, b] and a h U (f, P ) < .
5
Rb
a
g < .
By the Lemma we can find continuous functions g and h such that g(x)
f (x) h(x) for all x [a, b],
Then
Rb
a
b
a
b
a
g< .
3
h g < .
f =A
a
.
|f (x) f (y)| <
ba
6
. Thus
mi and f (v) = Mi . By choice of , |Mi mi | < ba
n
X
X
(Mi mi )xi <
xi = .
U (f, P ) L(f, P ) =
b
a
i=1
i=1
But
L(f, P ) R(f, P ) U (f, P )
and
L(f, P )
Thus
f U (f, P ).
a
Z b
R(f, P )
< .
f
We now consider the general case where f may not be continuous. Let
> 0. We know that there are continuous functions g, h : [a, b] R such
that g(x) f (x) h(x) for all x [a, b] and
Z b
Z b
h
g < .
2
a
a
By the argument above we can find > 0 such that for any tagged -fine
partition P
Z b
Z b
R(h, P )
< .
h
<
and
R(g,
P
)
2
a
a
Since
and
R(g, P )
g
a
f
a
h R(f, P )
a
h,
a
f R(h, P )
a
g
a
and
Z b
Z b
Z b
R(f, P )
max R(g, P )
, R(h, P )
.
f
h
g
But
and
Z b
Z b Z b
Z b
R(g, P )
+ =
h
R(g,
P
)
g
+
h
2 2
a
a
a
a
Z b
Z b Z b
Z b
R(h, P )
g + = .
h
h +
g R(h, P )
2 2
a
a
a
a
Thus
Z b
R(g, P )
h
as desired.
Mi f (zi ) <
.
n(xi xi1 )
Then
U (f, P ) R(f, P ) =
<
n
X
i=1
n
X
i=1
xi
n(xi xi1 )
n
X
=
= .
n
i=1
and
U (f, P )L(f, P ) U (f, P )R(f, P1 )+R(f, P2 )L(f, P )+|R(f, P1 )R(f, P2 )| < .
Thus f is integrable.
These arguments also show that for any > 0 we can find a partiion P
with
|U (f, P ) A| < .
Rb
Thus a f = A.
Sets of Discontinuity
In Math 413 we proved that for any f : R R the set of points where f is
discontinuous is an F -set. Lets review the key steps of that proof.
Definition 7 For f : [a, b] R let
D = {x [a, b] : f is discontinuous at x}.
If > 0, let
D = {x : for all > 0 there are y, z (x , x + ) with |f (y) f (z)| }.
Lemma 8 D =
D1 .
n
n=1
Proof Suppose x D. Then there is > 0 such that for any > 0 there
is a y such that |x y| < and |f (x) f (y)| . If n1 < , then x D 1 .
n
S
1.
Thus D
n=1 D n
On the other hand, suppose x D 1 . For all n choose
m
1
1
,x+ )
n
n
1
such that |f (yn ) f (zn )| m . Note that lim yn = lim zn = x. If f were
continuous at x, then lim f (yn ) = lim f (zn ) = x and there would be an N
such that |f (yn ) f (xn )| < m1 for all n > N , a contradiction. Thus each
D 1 D and
m
[
D=
D1.
yn , zn (x
n=1
10
.
Let P = {x0 , . . . , xn } be a partition such that U (f, P ) L(f, P ) < 2m
P
and iB xi < 2 . If x D 1 , then either x (xi1 , xi ) for some i B, or
m
x = xi for some i = 0, . . . , n. Thus
[
D 1 O0 . . . On
(xi1 , xi )
m
iB
and
|O0 | + + |On | +
xi < (n + 1)
iB
+ = .
2(n + 1) 2
() Suppose D has measure zero. Suppose |f (x)| < M for all x [a, b].
Let > 0. Choose n such that ba
< 2 . The set D 1 D has measure
n
n
zero. Thus we can find a countable collection of open intervals O1 , O2 , . . .
such that
[
X
D1
Oj and
|Oj | <
.
n
4M
j=1
j=1
11
We choose a partition P that contains all of the endpoints of Oj1 , . . . , Ojm , Ix1 , . . . , Ixk .
Each interval [xi1 , xi ] is either contained in O or |f (z) f (y)| < n1 for all
y, z [[xi1 , xi ]. In the later case Mi mi n1 . Let B = {i : [xi1 , xi ] O}.
Then
X
X
U (f, P ) L(f, P ) =
(Mi mi )xi +
(Mi mi )xi
iB
i6B
X1
2M xi +
xi
n
iB
i6B
1
2M (|Oj1 + . . . + Ojm |) + (b a)
n
< 2M
+
< .
4M
2
Thus f is integrable.
12