Homework 5 Spring 2014 Solutions
Homework 5 Spring 2014 Solutions
Mary Radcliffe
due 14 May 2014
In Bartle:
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
6H. Let X = Z+ , and let be the measure on X which has measure n12 at
the
point n. Show that (X) < . Let f be defined on X by f (n) = n.
Show that f Lp if and only if 1 p < 2.
Solution. We have (X) =
Z
n=1
|f |p d
(n) =
n=1
n=1
2
6 ,
|f (n)|p (n)
np/2 n2
np/22 ,
n=1
which converges if and only if p/2 2 < 1, if and only if p < 2. But as
p is assumed to be at least 1, since otherwise we do not have a norm, we
have that the integral is finite if and only if 1 p < 2.
6I. Modify the previous exercise to obtain a function on a finite measure space
which belongs to Lp if and only if 1 p < p0 .
Th
X
|f |p d =
|f (n)|p (n)
n=1
n=1
npp/p0 np0
n=1
6N. Let (X, F, ) be a measure space, and let f belong to both Lp1 and Lp2 ,
with 1 p1 < p2 < . Prove that f Lp for any value of p such that
p1 p p2 .
https://www.coursehero.com/file/9770580/Homework-5-Spring-2014-Solutions/
|f |p1 d +
E2
E1
Z
Z
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
6P. Let f Lp (X, F, ), 1 p < , and let > 0. Show that there exists
a set E F with (E ) < such that if F F and F E = , then
kf F kp < .
Solution. For n Z+ , define
Gn = R{x X | |f (x)|p > n1 }. Then |f (x)|p
R
1
p
|f | d n1 Gn d = n1 (Gn ), so (Gn ) <
n Gn , and thus >
for all n.
|f
|
d.
Let
Gn
R
R
R
R N Z
|f |p G d |f |p d < p . Then as |f |p d = |f |p G d+
such
that
N
N
R
R
|f |p X\GN d, we have that |f |p X\GN d < p . Let GN = E .
Now, let F F with F E = , so F X\GN . Then
Z
Z
kf F kpp = |f |p F d |f |p X\GN d < p ,
and the desired result follows.
Th
Solution. Note that n (E) = kfn E kp . Moreover, by the triangle inequality, we have that for any two functions f and g, kf kp kf gkp +kgkp , and
thus kf kp kgkp kf gkp . Wolog, assume that kfn E kp > kfm E kp .
Then
|n (E) m (E)| = |kfn E kp kfm E kp |
= kfn E kp kfm E kp
k(fn fm )E kp
kfn fm kp ,
as desired.
6R. Let fn , n be as in Exercise 6Q. If {fn } is a Cauchy sequence and > 0,
then there exists a set E F with (E ) < such that if F F and
F E = , then n (F ) < for all n Z+ .
https://www.coursehero.com/file/9770580/Homework-5-Spring-2014-Solutions/
Solution. By problem 6P, such a set exists for each fn ; for all > 0, let
(n)
(n)
E be such that if F E = , then kfn E (n) kp < .
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
Solution. For all > 0, there exists a set N such that (N ) = 0 and
S(N ) < kf k + . Take N =
k=1 N1/k . Then (N ) = 0 by countable
additivity, and if x
/ N , then x
/ N1/k for all k. Thus, |f (x)| S(N1/k )
for all k, and thus |f (x)| < kf k + 1/k for all k, so |f (x)| kf k for all
x
/ N . Therefore, |f (x)| kf k for almost all x.
Additional Exercises:
satisfies the properties of a norm in Theorem 9.7 (again, page 208.) This
is usually called the Euclidean norm, the `2 norm, or the Frobenius norm
for matrices, and is more properly denoted by kAk2 .
(a) Let V be a vector space with norm k k, and let L(V ) be the space
of linear transformations from V to itself. Define N : L(V ) R by
N (A) = sup kAvk. Show that N defines a norm on V . (Usually
Th
kvk=1
(b) Show that if |||A||| is defined from a vector norm on V as in part (a),
then we have the inequality |||AB||| |||A||||||B||| for all A, B L(V ).
This property is usually called submultiplicativity.
Solution. (a) Clearly, N (A) 0 for all A L(V ), and N (0) = 0. Now,
suppose that A 6= 0. Then there exists some x V such that Ax 6= 0,
so sup kAvk kAxk/kxk > 0. Thus, N (A) = 0 if and only if A = 0.
kvk=1
kvk=1
kvk=1
|||AB||| =
sup k(AB)vk
kvk=1
sup kAyk
kvk=1
kyk
kyk
kAyk
kBvk
kyk
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
=
sup
kvk=1
sup
yV
kAyk
sup kBvk
kyk kvk=1
kyk=1
kvk=1
n
(c) We first
P consider |||A|||1 . Note that if v R has kvk1 = 1, then we
have
|vi | = 1. Thus, if A1 , A2 , . . .P
, An are the columns of A, we
have kAvk = kv1 A1 + + vn An k |vi |kAi k1 max1in kAi k1 .
Moreover, if i attains the maximum, taking v = ei yields that kAei k =
max1in kAi k1 . Therefore, the 1-norm of A is the maximal 1-norm
of the columns of A.
On the other hand, if kvk = 1, then max |vi | = 1. Moreover, if
T
a1 , a2 , . . . , an are the rows of A, then Av
Pn= [a1 v, a2 v, . . . , an v] ,
so kAvk = max1in |ai v|. If S = j=1 |aij | is the maximal row
sum, then, it is clear that kAvk S. Moreover, taking v to be a
vector of all 1 such that aij vj > 0 for all j, we have kAvk = S.
Therefore, |||A||| is the maximal 1-norm of the rows of A.
Th
(a) Prove that the simple functions with finite support are dense in
Lp (X) if 1 p < . That is, for all f Lp and > 0, there
exists a simple function with finite support and kf kp < .
(b) Prove that the simple functions with finite support are dense in L
if X is of finite measure. Give an example of an L function that
cannot be approximated by simple functions with finite support if
(X) = .
Therefore, we have
Z
kf kp
1/p
|f | d
=
Z
|f | d +
|f | d
c
En
En
Z
!1/p
|g | d +
En
p 1/p
2
p 1/p
2
2
= 21/p < ,
2
as desired.
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
(b) The first part is immediate by applying Theorem 2.11 to f . For the
second part, if f (x) = 1, where f L (R), it is clear that if g is
any finitely supported function, then kf gk 1, so f cannot be
approximated by finitely supported simple functions.
3. Consider the real space under Lebesgue measure, (R, B, ). Recall that
C(R) is the family of continuous functions on R. Define Cc (R) to be the
family of continuous, compactly supported functions on R.
(a) Show that for 1 p < , Cc (R) is dense in Lp (R). (Hint: Since
we know the simple functions are dense by problem 2, it suffices
to approximate simple functions by compactly supported continuous
functions.)
Th
Solution. (a) First, we claim that if (E) < , then for all > 0 there
exists a continuous function f such that kf E kp < .
Let En = E [n, n]. As En En+1 and En = E, we have that
(E
n ) (E). Choose N sufficiently large that (En ) (E)
p
4 .
p
Let U be an open set such that En U and (U \En ) 4 . By
possibly intersecting with the open set (n , n + ), we can ensure
that U is contained in a compact set. Note, moreover, that as U
is open U can be written as an (at most) countable union of open
intervals. Write U = Ik , where Ik = (ak , bk ).
Define fk as follows. Fix some k <
1
fk (x) =
1+
1
k (x
1
k (x
p (p+1)
.
2kp+2
Then put
ak x bk
bk ) bk < x bk + k
.
ak ) ak k x < ak
else
https://www.coursehero.com/file/9770580/Homework-5-Spring-2014-Solutions/
and
kIk
fk kpp
|Ik fk |p d
p
p
Z bk
Z ak
Z bk +k
1
1
p
0 dx +
=
1 + k (x ak ) dx +
1 k (x bk ) dx
ak
ak k
bk
Z 1
Z 0
=
k up du +
k up du
=
k
= 2
p+1
< 2
Let f =
p (p+1)
2kp+2
p+1
p
2k+1
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
kf U kp
kf Ik kp
<
X
k
= /2
2k+1
Therefore, we have
kE f kp
kE En kp + kEn U kp + kU f kp
(E\En )1/p + (U \En )1/p +
2
+ + < .
4 4 2
Th
(b) No. We have the same problem with compact (aka finite) support
here as in 2b.
Extras:
C
>
0.
Then
for
all
n,
we
have
|f
|
d
n
R
p
p
|f
|
d
Cn
,
and
thus
the
integral
is
infinite,
a
contradiction.
En
6K. If (X, F, ) is a finite measure space and f Lp , then f Lr for 1 r p.
Apply H
olders Inequality to |f |r in Lp/r and g = 1 to obtain the inequality
kf kr kf kp (X)s , where s = 1/r 1/p.
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
E1
1 d +
E1
<
(E1 ) +
|f (x)|p d
E1c
p
kf kp <
Thus, f Lr .
Note that for any x, y, we have k|f |x ky = kf kxxy , and thus we may rewrite
the above inequality as
kf krr kf krp (X)(pr)/p .
Th
P
Solution. If f Lp , then we have
|f (n)|p < . Then by comparison
s
p
test, for n sufficiently large
P |f (n)|s< 1,Pand we phave |f (n)| < |f (n)| , and
s
thus f L and kf ks = |f (n)| |f (n)| = kf kp .
https://www.coursehero.com/file/9770580/Homework-5-Spring-2014-Solutions/