0% found this document useful (0 votes)
38 views3 pages

Answer Chapter

This document provides solutions to homework problems from a real analysis class. It addresses topics like measure theory, convergence of functions, normed vector spaces, and bounded linear functionals. Many problems involve proving statements about limits, integrals, and topological properties in these contexts.

Uploaded by

chic19801041
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
38 views3 pages

Answer Chapter

This document provides solutions to homework problems from a real analysis class. It addresses topics like measure theory, convergence of functions, normed vector spaces, and bounded linear functionals. Many problems involve proving statements about limits, integrals, and topological properties in these contexts.

Uploaded by

chic19801041
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MATH 605, HW 5 SOLUTIONS

Folland’s Real Analysis; Chapter 2:


39.) Suppose fn ! f almost uniformly.
(a) Show fn ! f a.e.: This is immediate. Let B be the bad set where fn does not converge
to f (we say in an earlier assignment that this was measurable). It follows that B ⇢ E for
each set E in the “almost uniform” – and hence µ(B) = 0.
(b) Show fn ! f in measure: Given ✏ > 0, choose E so that µ(E) < ✏ and fn ! f on E c .
Using the uniform convergence, choose N so that |fn f | < ✏ on E c for n N . We are now
done since for n N
µ({x | |fn (x) f (x)| ✏})  µ(E) < ✏ .

44.) Prove Lusin’s theorem that if f : [a, b] ! R is measurable and ✏ > 0, then there is
a compact set E so m(E c ) < ✏ and f is continuous on E: First, Theorem 2.26 gives simple
functions n ! f in L1 where the sets are intervals. Second, choose continuous functions
1
n where | n n | ! 0 in L (just change n near the boundaries of the intervals). Since
1
|f n |  |f n| + | n n |, the n ’s go to f in L . Egoro↵ gives a bad set B with
c
m(B) < ✏ so n ! f uniformly on B . By the definition of measure, there is an open set
F with B ⇢ F and m(F ) < ✏. Set E = [a, b] \ F so E is compact, m(E c ) < ✏, and f is
continuous on E (since it is the uniform limit of continuous functions there).
R R
56.) Define h(x, t) = t 1 f (t) {t x} . Note that g(x) = xa t 1 f (t) dt is then just 0a h(x, t) dt.
R R R R
Meanwhile, 0a h(x, t) dx = 0t t 1 f (t) dx = f (t). By Fubini’s theorem, 0a g(x) dx = 0a f (t) dt
as desired.
R
57.) Show that 01 e sx x 1 sin x dx = arctan(s 1 ) for s > 0: Define h(x, y) = e sxy
sin x.
Since the derivative of ecx is cecx , we have
Z 1 Z 1
sxy sx
h(x, y) dy = sin x e dy = e sin x/(sx) .
1 1
R1 cx
Since 0 e sin x dx = 1/(c2 + 1) (think of e cx
sin x as the imaginary part of e(i c)x
),
Z 1Z 1 Z 1 Z 1
dy dt
h(x, y) dx dy = = 1/s = (⇡/2 arctan(s))/s = 1/(s arctan(s)) .
1 0 1 s2 y 2+1 s t2 +1
(I used the change of variables t = sy.) Applying Fubini to h(x, y) gives the claim.
59). Let f (x) = x 1 sin x.
R R (2n+1)⇡
a). Show that 01 |f (x)| dx = 1: If n is an integer, then 2n⇡ sin x dx = cos(2n + 1)⇡
cos 2n⇡ = 2. Therefore,
Z 1 1 Z
X X
(2n+1)⇡ sin x 2
|f (x)| dx dx = = 1.
0 n=1 2n⇡ (2n + 1)⇡ (2n + 1)⇡

Professor Minicozzi, Fall 2002.


1
2 MATH 605, HW 5 SOLUTIONS
R
b). Show that limb!1 0b f (x) dx = ⇡/2: Apply Fubini on the square [0, b] ⇥ [0, b] to h(x, y) =
e xy sin x (when we integrate first in y we get the integral that we’re interested in; get the
other way as in 57).
MATH 605, HW 6 SOLUTIONS

Folland’s Real Analysis; Chapter 5:


1.) Let X be a normed v.s. over R.
(a) Show that vector addition and scalar multiplication are continuous from X ⇥ X and
X ⇥ R to X: I’ll just do this for addition. Define T : X ⇥ X ! X by T (x, y) = x + y. Given
✏ > 0, we have that if max{|x x1 |, |y y1 |} < ✏/2, then the triangle inequality gives
|T (x, y) T (x1 , y1 )| = |x + y x1 y1 |  |x x1 | + |y y1 | < ✏ .
(b) Show that ||x| |y||  |x y| (so that the norm is continuous from X to R): This
follows immediately from the triangle inequality since |x| = |x y + y|  |x y| + |y| and
|y| = |y x + x|  |x y| + |x|.
5.) Let X be a normed v.s. over R and Y ⇢ X a subspace. Show that the closure Ȳ of
Y is also a subspace: Suppose that xn , yn 2 Y with xn ! x and yn ! y (so x and y are in
Ȳ ). We have to show that ax 2 Ȳ and x + y 2 Ȳ . This follows immediately from exercise
1 but I will prove it without using that by instead showing that (xn + yn ) ! (x + y) and
axn ! ax. The triangle inequality gives the first:
|(xn + yn ) (x + y)|  |xn x| + |yn y| ! 0 .
The second is even easier since |axn ax| = |a(xn x)| = |a| |xn x| ! 0.
7.) Let X be a Banach space.
(a) Suppose that T 2 L(X, X) and |I T | < 1 where I is the identity operator. Show
P1
that
P1 0 (I T )n converges to T 1 : First of all, note that |(I T )n | = |I T |n so that
n
0 |(I T ) | < 1 since it is a geometric series (here we use that |I T | < 1). Since X
P
is complete, so is L(X, X); therefore 1 0 (I T )n converges to some limit, let’s call it S, in
L(X, X) (by theorem 5.1). We now show that S is really T 1 . To see this, note that
N
X N
X +1
(I T )S = lim (I T) (I T )n = lim (I T )n = S I.
N !1 N !1
0 1

In other words, S T S = S I so that T S = I (it’s easy to see that ST = T S).


(b) Suppose that T 2 L(X, X) is invertible and and |S T | < |T 1 | 1 . Show that S is
invertible: We have that
1 1 1 1 1 1
|ST I| = |(S T )T |  |S T | |T | < |T | |T | = 1.
1 1 1 1
Therefore, (a) gives [ST ] . Now just check that multiplying this by T gives S .
11.) This is standard, see almost any analysis book.
12.) Ditto.
17.) Show that a linear functional f on a normed v.s. X is bounded i↵ f 1 (0) is closed:
By 5.2, f is bounded i↵ it is continuous i↵ it is continuous at 0. Therefore, f bounded
Professor Minicozzi, Fall 2002.
1

You might also like