Professional Documents
Culture Documents
1. (4 marks) Let [0, 1]2 = [0, 1] × [0, 1]. Let f : [0, 1]2 → R be defined by
setting f (x, y) = 0 if y 6= x, and f (x, y) = 1 if y = x. Show that f is
integrable over [0, 1]2 .
The first thing that we note is that f is obviously bounded. The second
is that this is a combinatorics question in disguise. Let S = [0, 1]2 be
our square, and let P0 be the empty partition (so that we simply have
the square). Now, divide the square into four equal parts (which will
also be squares)—call this partition P1 . Divide each of these squares
into four equal parts (so that now S is divided into 16 equal parts) and
call this partition P2 . In general, Pn (for n > 1—assume this is the case
in all that follows) is the partition that divides S into 4n equal parts.
We are interested in the diagonal of S (the one going from (0, 0) to
(1, 1))—call it D. How many subsquares of P1 contain a point of the
main diagonal? All of them—it is a diagonal of two of them, and
a corner of two of them. How about P2 ? Well, the two subsquares
of P1 who had D as their diagonal, contribute 4 P2 -subsquares each
(this is isomorphic to the P1 cutting of S; so that again half of these
subsquares have D as their diagonal, and the other half as their corner),
while the two subsquares of P1 who had D as their diagonal contribute
1 P2 -subsquare each. The total is 10—out of them, 4 have D as their
diagonal and 6 have D as their corner. Thus, P3 have 4 · 4 + 6 · 1 = 22
subsquares containing a point of D—out of them, 8 have D as their
diagonal and 14 as their corner. Continuing in this manner it is easy
to see that Pn has exactly 3 · 2n − 2 subsquares that contain a point of
D.
1
congruent squares, we have U (f ; Pn ) = m/4n , where m is the number
of subsquares containing a point of D. We also have L(f ; Pn ) = 0 for
all n. We have already calculated m, and so we have
m 3 · 2n − 2 3 2
U (f ; Pn ) − L(f ; Pn ) = = = −
4n 4n 2n 4n
and since that expression obviously goes to 0 as n tends to +∞, the
Riemann condition is satisfied and f is integrable.
As well, Z
L(f, P ) ≤ f ≤ U (f, P )
Q
Thus
P since [L(f, P ),R U (f, P )] is a interval of length < with both
R f (xR )v(R) and Q f in it, we obviously have
X Z
| mR (f )v(R) − f| <
R Q
2
Now
X X
U (f, P ) = supXR (f (XR ))v(R) = supXR ( f (XR )v(R))
R R
So
X X
|U (f, P )−A| = | sup( f (XR )v(R)−A)| ≤ sup | f (XR )v(R)−A| ≤
XR XR
R R
3
5. (3 marks) Show that Rn−1 × 0 has measure zero in Rn .
First, we cover R by the set S of rectangles [m, m + 1] for m ∈ Z. Since
S is countable, S n is also countable for any finite n. Write S n−1 =
{S1 , S2 , S3 , . . .}, and define
Am = Sm × [− , ]
2m+2 2m+2
Since S n−1 covers Rn−1 and [− 2m+2 , 2m+2 ] covers 0, the set of Am ’s cover
n−1
R × 0. v(Am ) = 2m+1 and so
∞ ∞
X X
v(Am ) = = /2 <
m=1 m=1
2m+1
so that Z Z Z Z
f≤ g(x) ≤ g(x) ≤ f
Q A A Q
4
which implies that
Z Z Z
g(x) = g(x) = f
A A Q
R R
so g is integrable with A
g(x) = Q
f
R
(b) (4 marks) Give an example where Q
f exists and one of the iter-
ated integrals
Z Z Z Z
f (x, y) and f (x, y)
x∈A y∈B y∈B x∈A
which is
R obviously unintegrable (e.g., see example 2 on p. 86).
Thus, x∈A f (x, y) isR not Reven defined in (countably) infinitely
many points, and so y∈B x∈A f (x, y) obviously does not exist.
This completes our counterexample.
5
(c) (4 marks) Find an example R where both the iterated integrals of
(b) exist, but the integral Q f does not.
Let Q = [0, 1]2 and
m n
S = {( , ); p is prime and 0 < m, n < p}
p p
(
1 if (x, y) ∈ S,
f (x, y) =
0 otherwise.