Real Analysis

Chapter 6 Solutions

Jonathan Conder

3. Since Lp and Lr are subspaces of CX , their intersection is a vector space. It is clear that k k is a norm (this
p
r
follows directly from the fact that k kp and k kr are norms). Let hfn i
n=1 be a Cauchy sequence in L L . Since
kfm fn kp kfm fn k and kfm fn kr kfm fn k for all m, n N, it is clear that hfn i
n=1 is a Cauchy sequence
p
r
p
r
in both L and L . Let gp L and gr L be the respective limits of this sequence. Given (0, ), there exists
N N such that kfn gp kp < (p+1)/p for all n N with n N. If n N and n N
Z
Z
Z
p
p
p
|fn gp | |fn gp |p < (p+1)p/p = p+1 ,

(E) =
E

so (E) < , where E := {x X | p |fn (x) gp (x)|p } = {x X | |fn (x) gp (x)|}. This shows that hfn i
n=1
converges in measure to gp . If r < , a similar argument shows that hfn i
converges
in
measure
to
g
.
Otherwise,
r
n=1
some subsequence of hfn i
converges
to
g
almost
everywhere,
and
this
subsequence also converges to gr almost
p
n=1

everywhere (since hfn in=1 converges uniformly to gr off a set of measure 0). In either case gp = gr , so gp Lp Lr .
p
r

p
r
Since hfn i
n=1 converges to gp in L and L , it easily follows that hfn in=1 converges to gp in L L . This shows that
Lp Lr is a Banach space.
Now let q (p, r). There exists (0, 1) such that kf kq kf kp kf kr1 for all f Lp Lr . In particular, if f Lp Lr
and kf k = 1, then kf kp 1 and kf kr 1 and hence kf kq 1 11 = 1. This shows that the linear map Lp Lr , Lq
is continuous.
4. Since Lp and Lr are subspaces of CX , their sum is a vector space. Clearly kf k 0 for all f Lp + Lr . Let f Lp + Lr
and a C. If a = 0 then kaf k = k0k = 0 = |a|kf k because
0 = k0kp + k0kr {kgkp + khkr | g Lp , h Lr and f = g + h}.
Otherwise kaf k kagkp +kahkr = |a|(kgkp +khkr ) for all g Lp and h Lr with f = g+h, and hence kaf k/|a| kf k.
This implies that |a|kf k = ka1 af k/|a1 | kaf k, which shows that kaf k = |a|kf k. Now let f1 , f2 Lp + Lr and
(0, ). There exist g1 , g2 Lp and h1 , h2 Lr such that f1 = g1 + h1 , f2 = g2 + h2 , kg1 kp + kh1 kr < kf1 k + and
kg2 kp + kh2 kr < kf2 k + . It follows that
kf1 + f2 k kg1 + g2 kp + kh1 + h2 kr kg1 kp + kg2 kp + kh1 kr + kh2 kr < kf1 k + kf2 k + 2,
which shows that kf1 + f2 k kf1 k + kf2 k. Finally, let f Lp + Lr , and suppose that kf k = 0. Given (0, 1),
there exist g Lp and h Lr such that f = g + h and kgkp + khkr < (p+1)/p . It follows that (G) < , where
G := {x X | |g(x)|}, because
Z
Z
Z
p
p
p
(G) =

|g| |g|p < (p+1)p/p = p+1 .
G

Similarly (H) < where H := {x X | |h(x)|} (if r = then (H) = 0 because (p+1)/p < ). Define
F := {x X | 2 |f (x)|}, so that F G H. Then (F ) (G H) < 2. It follows that

1
{x X | 0 < |f (x)|} =
|f (x)|},
n=1 k=n {x X | 2k

has measure 0, so f = 0 almost everywhere. This shows that k k is a norm.

P
p
r
p
r
Let
n=1 fn be an absolutelty convergent series in L + L . For each n N there exist gn L and hn L such
P
P

that fn = gn + hn and kgn kp + khn kr < kfn k + 2n . It follows that

n=1 gn and
n=1 hn are absolutely convergent
p
r
p
r
series in L and L respectively, so they have limits g L and h L respectively. This convergence also holds in
1

Real Analysis

Chapter 6 Solutions

Jonathan Conder

PN
PN
PN
P
Lp + Lr , because k N
n=1 hn hkr for all
n=1 hn hk k0kp + k
n=1 gn gkp + k0kr and k
n=1 gn gk k
P
P
p
r
N N. Therefore n=1 fn = n=1 (gn + hn ) has a limit in L + L , namely g + h. This shows that Lp + Lr is a
Banach space.
Now let q (p, r) and let f Lq with kf kq = 1. Define E := {x X | 1 < |f (x)|}, g := f E and h := f E c . Then
|g|p |g|q |f |q and |h|r |h|q |f |q , so g Lp and h Lr , which implies that
Z
1/p Z
1/r
q
q
kf k = kg + hk kgkp + khkr
|f |
+
|f |
= 11/p + 11/p = 2.
This shows that the linear map Lq , Lp + Lr is continuous.
6. Most of the hard work has been done as part of exercise 2.64.
(a) If p1 < , define f (x) := x1/p1 (0, 1 ) (x) + x1/p0 (2,) (x). Otherwise replace x1/p1 by | log(x)|.
2

(b) If p1 < , set f (x) := x1/p1 | log(x)|2/p1 (0, 1 ) + x1/p0 | log(x)|2/p0 (2,) . Otherwise, omit the first term.
2

(c) Set p1 := p0 in part (b).

9. In exercise 3 we showed that convergence in Lp implies convergence in measure (which in turn implies Cauchyness in
measure, hence subsequential convergence almost everywhere). Conversely, let hfn i
n=1 be a sequence of measurable
X
functions in C which converges to f : X C in measure. Suppose there exists g Lp such that |fn | g for

all n N. If hfnk i
k=1 is a subsequence of hfn in=1 , it converges to f in measure, so it has a further subsequence
p
p
hfnkj i
j=1 which converges to f almost everywhere. It follows that h|fnkj | ij=1 converges to |f | almost everywhere,
so by the dominated convergence theorem |f |p L1 , whence f Lp (note that |fn |p g p for all n N, and g p L1 ).
p
p p
p
Furthermore h|fnkj f |p i
j=1 converges to 0 almost everywhere, and since |fnkj f | 2 (g + |f | ) for all j N,
p
the dominated convergence theorem implies that hkfnkj f kp ij=1 converges to 0, in which case hkfnkj f kp i
j=1 also

converges to 0. This shows that every subsequence of hkfn f kp in=1 has a subsequence which converges to 0, so
hkfn f kp i
n=1 itself converges to 0.
p
p

10. Let hfn i

n=1 be a sequence in L which converges to f L almost everywhere. Suppose that hkfn kp in=1 converges
p
p
p
p+1 |f |p almost
to kf kp . Since |fn f |p 2p (|fn |p + |f |p ), h|fn f |p i
n=1 and h2 (|fn | + |f | )in=1 converge to 0 and 2
everywhere, and
Z
Z

p
lim
2p (|fn |p + |f |p ) = 2p lim kfn kpp + 2p kf kpp = 2p lim kfn kp + 2p kf kpp = 2p kf kpp + 2p kf kpp = 2p+1 |f |p ,
n

the generalised dominated convergence theorem implies that hkfn f kpp i

n=1 converges to 0, in which case hkfn f kp in=1
also converges to 0. The converse follows from the reverse triangle inequality.
Pr
13. Let f Lp (Rn , m) and (0, ). By Proposition 6.7 there is a simple function g =
j=1 aj Ej such that

m(rj=1 Ej ) < and kf gkp < 4 . Fix j {1, . . . , r} and assume without loss of generality that m(Ej ) > 0.

There exists bj Q(i) such that kaj Ej bj Ej kp = |aj bj |m(Ej )1/p < 4r
. Moreover, by Theorem 2.40(c) there is a

finite collection of rectangles whose sides are intervals such that kbj Ej bj Fj kp = |bj |m(Ej 4Fj )1/p < 4r
, where Fj
is the union of these rectangles. We may shrink Fj to give a finite collection of rectangles with sides that are intervals

with rational endpoints, whose union Gj satisfies kbj Fj bj Gj kp < 4r

. It follows that




r
r
r
r
X
X
X
X


f

bj Gj kf gk +
kai Ei bi Ei kp +
kbi Ei bi Fi kp +
kbi Fi bi Gi kp < ,



j=1
j=1
j=1
j=1
p

Real Analysis

Chapter 6 Solutions

Jonathan Conder

so the collection of rational linear combinations of characteristic functions of finite unions of rectangles with sides
that are intervals with rational endpoints (which is countable) is dense in Lp (Rn , m).
For each r (0, ) set fr := Br (0) , and note that kfr fs k = 1 for all r, s (0, ) such that r 6= s (find some
open rectangle inside Br (0)4Bs (0)). If D L (Rn , m) is dense then B1/2 (fr ) D 6= for all r (0, ), so there
is an injective function (0, ) D. In particular D is uncountable.
p
1/p for all
15. Let hfn i
n=1 be a Cauchy sequence in L . Let , (0, ). There exists N N such that kfm fn kp <
m, n N with m n N. If m, n N and m n N then
Z
Z
Z
p
p
p
(E) =

|fm fn | |fm fn |p = kfm fn kpp < ()(p+1)p/p = p ,
E

so (E) < , where E := {x X | |fm (x) fn (x)|} = {x X | p |fm (x) fn (x)|p }. This shows that hfn i
n=1
(p+1)/p
1/p
is Cauchy in measure. Now let (0, ). There exists N N such that kfm fn kp < 2

for all m, n N
p
N
1
with m n N. Since {|fn | }n=1 is a finite subset of L , it is uniformly integrable by exercise 11 in section 3.2.
R
Hence, there exists (0, ) such that | E |fn |p | < 2(p+1) < for all n N and E M with n N and (E) < .
If n N and E M such that n > N and (E) < , then
Z
 Z
Z

Z




p
p
p
p
p
p
p
p
 |fn |p  =
|fn |
2 (|fn fN | + |fN | ) 2 kfn fN kp + 2  |fN |  < 21 + 21 = .


E

p
This shows that {|fn |p }
n=1 is uniformly integrable. Now fix n N, set F := {x X | 0 < |fn (x)| } and define

Fm := {x X | m1 |fn (x)|p } for each m N. Then hFm i

m=1 is increasing and m=1 Fm = F, so
Z
 Z
Z
Z
Z
Z
Z
p
p
p
p
p
p
lim
|fn | = lim
|fn |
|fn | = |fn | lim
|fn | = |fn |
|fn |p = 0.
m F c
m

m F
m

Fm

Hence, there exists m N such that

c
Fm

|fn |p < 2(p+1) . Define En := Fm , and note that (En ) < because

(En )m1 =

m1

En

|fn |p

|fn |p < .

En

R
p
p
(p+1) < for all n N with n N. If
Therefore (E) < , where E := N
c |fn | < 2
n=1 En . Clearly E c |fn | En
n N and n > N then
Z
Z
Z
p
p
p
p
p
p
p
|fn |
2 (|fn fN | + |fN | ) 2 kfn fN kp + 2
|fN |p < 21 + 21 = .
R

Ec

Ec

Ec

This shows that hfn i

n=1 has property (iii).
p
Conversely, let hfn i
n=1 be a sequence in L which satisfies properties (i)-(iii). Let (0, ) and choose E M such
R
that (E) < and E c |fn |p < 2(p+3) p for all n N. If (E) = 0 then
Z
Z
Z
Z
Z
p
p
p
p
p
p
p
p
p
< p
|fm fn | =
|fm fn |
2 (|fm | + |fn | ) = 2
|fm | + 2
|fn |p < 2p+1(p+3) p =
4
Ec
Ec
Ec
Ec
R
R
and hence kfm fn kp < for all m, n N. Otherwise, take (0, ) such that F |fn |p = | F |fn |p | < 2(p+3) p for
all n N and F M with (F ) < . For each m, n N define

Amn := {x X | (2(E))1/p |fm (x) fn (x)|},

Real Analysis

so that

Chapter 6 Solutions

|fm fn |p

p (2(E))1

p (2(E))1 =

E\Amn

E\Amn

Jonathan Conder

p
.
2

There exists N N such that (Amn ) < for all m, n N with m n N, in which case
Z
Z
Z
Z
p
|fn |p < 2p+1(p+3) p = .
|fm |p + 2p
|fm fn |p
2p (|fm |p + |fn |p ) 2p
4
Amn
Amn
Amn
Amn
It follows that
Z

|fm fn |

|fm fn | +
Ec

|fm fn | +
E\Amn

|fm fn |p <

Amn

p p p
+
+
= p ,
4
2
4

p
and hence kfm fn kp < , for all m, n N with m n N. This shows that hfn i
n=1 is Cauchy in L .

18. (a) Let f L2 () and suppose that kf k2 = 1. For every simple function : X [0, ], hence every L+ and in
R
R
R
fact every L1 (), it is clear that d = d + d. Therefore
Z
 Z
Z
Z
Z
p


 f d  |f | d |f | d + |f | d = |f | d kf k2 k1k2 = (X)


R
by Holders inequality. This shows that the linear functional f 7 f d on L2 () is bounded, so there exists
R
R
R
R
R
R
g L2 () such that f d = f g d = f g d + f g d, and hence f (1 g) d = f g d, for all f L2 ().
R
R
In fact E f (1 g) d = E f g d for all f L2 () and E M (as f E L2 ()).
R
R
R
R
R
R
(b) Note that E g d = E g d = E d = (E) 0 and E (1 g) d = E d E g d = (E) (E) 0
R
for all E M. In particular E Im(g) d = 0 for all E M, which implies that Im(g) = 0 -almost everywhere.
Moreover, ({x X | g(x) n1 }) = 0 for all n N, which implies that g 0 -almost everywhere. Similarly
1 g 0, whence 0 g 1, -almost everywhere. In particular 0 g 1 -almost everywhere and -almost
everywhere.
(c) Clearly s (E) = () = 0 for all E M with E B c . Moreover
Z
Z
Z
Z
(E) = E d = E g d = E (1 g) d = 0 d = 0
for all E M with E B. Therefore s . Since (1 g)1 A 0 -almost everywhere, there is an increasing
1
1
sequence of simple functions hn i
n=1 which converges to (1g) A -almost everywhere. Since (1g) A <
pointwise, n L2 () for all n N. Therefore
Z
Z
Z
Z
A
(1 g) d = lim
n (1 g) d = lim
n g d =
g(1 g)1 A d
a (E) = (A E) =
n E
n E
E
E 1g
for all E M, by the monotone convergence theorem. This shows that a  .
19. Note that n = n1 {1,...,n} and hence kn k = kn1 {1,...,n} k1 = 1, by Proposition 6.13. It follows by Alaoglus

1
theorem and Theorem 4.29 that (n )
n=1 has a weak* cluster point (l ) . Suppose that = g for some g l .
1
If k N and (0, ), then ({k} ) = g(k) and hence (n )
d
{k} (B/2 (g(k))). In particular,
n=1 is frequently in
1

1
there exists n N with n < 2 and n k such that |g(k) n | = |g(k) n ({k} )| < 2 . It follows that g(k) < , so
g = 0. Therefore (n )
cN 1 (B1 (0)), which is impossible because n (N ) = 1 for all n N. This
n=1 is frequently in
shows that 6= g for all g l1 .
4

Real Analysis

Chapter 6 Solutions

Jonathan Conder

R
20. (a) Let g (Lp ) . There exists g Lq , where q := p/(p 1), such that g(h) = hg for all h Lp . Hence, it
R
R
suffices to show that h fn gi
f g. To this end, let (0, ). Set M := supnN kfn kp + 1. Since
n=1 converges to
R
q
E 7 E |g| is a finite measure on M which is absolutely continuous with respect to , there exists (0, )
R
R
such that E |g|q = | E |g|q | < 12 (/4M )q for all E M with (E) < . Now define F := {x X | 0 < |g(x)|q }

and set Fm := {x X | m1 |g(x)|q } for each m N. Then hFm i

m=1 is increasing and m=1 Fm = F, so
 Z
Z
Z
Z
Z
Z
Z
q
q
q
q
q
q
|g|q = 0.
|g| = |g|
lim
|g| = lim
|g| = |g| lim
|g|
m F c
m

m F
m

Fm

|g|q < 21 (/4M )q , where A := Fm . Note that (A) < because

Z
Z
Z
q
1
1
|g| |g|q < .
m
(A)m =

Hence, there exists m N such that

Ac

By Egoroffs theorem, it follows that there exists B M such that B A, (B) < and hfn |A\B i
n=1 converges
R
R
R
q
q
q
q
uniformly to f |A\B . In particular (A\B)c |g| = Ac |g| + B |g| < (/4M ) . By Fatous lemma
Z

|f | lim inf
n

|fn |p = lim inf kfn kpp M p ,

n

so f Lp and kf kp M. It follows from Holders inequality that

Z

!1/q

|(fn f )g| kfn f kp

(A\B)c

|g|
(A\B)c

(kfn kp + kf kp )

4M
2

for all n N. Set L := (A)kgkpq + 1 and choose N N such that |fn (x) f (x)| < p /2p L for all x A \ B and
n N with n N. If n N and n N, then
Z

!1/p

Z
|(fn f )g|

A\B

|fn f |
A\B




p 1/p
kgkq <
kgkq (A \ B) p
2 L
2

and hence

Z
 Z
Z
Z
Z


 fn g f g  |(fn f )g| =
|(f

f
)g|
+
|(fn f )g| < .
n


A\B
(A\B)c
R
R
This shows that h fn gi
f g, as required.
n=1 converges to
(b) For each n N define fn := [n,n+1] . Then supnN kfn k1 = supnN 1 = 1 and hfn i
n=1 converges to 0 pointwise.
R

Define g := E , where E := n=1 [2n, 2n + 1]. Clearly |g| 1 and f 7 f g dm is in L1 (R, m) . However
R

h fn g dmi
n=1 does not converge, and hence hfn in=1 does not converge weakly, because

Z
Z
0, if n is odd
fn g dm = [n,n+1]E dm =
1, if n is even.
Similarly, for each n N define xn : N C by xn := {n} . Then supnN kxn k1 = supnN 1 = 1 and hxn i
n=1
P
1 ) . However
converges to 0 pointwise. Set g := 2N , so that |g| 1 and hence x 7
x(m)g(m)
is
in
(l
m=1

0, if n is odd
X
xn (m)g(m) = g(n) =
1, if n is even,
m=1

Real Analysis

Chapter 6 Solutions

Jonathan Conder

m=1 xn (m)g(m)in=1 does not converge, and hence hxn in=1 does not converge weakly.
which converges almost everywhere to f : X
Now let hfn i
n=1 be a sequence in L
R
R
supnN kfn k < and is -finite. We aim to show that h gfn i
n=1 converges to gf for all g
let g L1 and set M := supnN kfn k . For each n N set En := {x X | fn (x) > M }. Since

so h

C. Suppose that
L1 . To this end,

n=1 En has measure zero, it is easily shown that |f | M almost everywhere. It follows that |g(fn f )| |g|(|fn | + |f |) 2|g|M
R
almost everywhere for all n N, so by the dominated convergence theorem h |g(fn f )|i
n=1 converges to
R
0 = 0. Since
Z
 Z
Z



0  gfn gf  |g(fn f )|
R
R
for all n N, the squeeze theorem implies that h gfn i
gf, as required.
n=1 converges to
p
p/(p1) defines a functional lp (A) , so
21. Suppose that (fn )
a
n=1 converges weakly to f in l (A). If a A then {a} l

(fn (a))n=1 = (a (fn ))n=1 converges to a (f ) = f (a). Therefore (fn )n=1 converges pointwise to f. If lp (A) then
supnN |fbn ()| = supnN |(fn )| < , so supnN kfn kp = supnN kfbn k < by the uniform boundedness principle.
The converse is a special case of exercise 20(a).

22. (a) If m, n N and m 6= n then

Z 1
hfm , fn i =
cos(2mx) cos(2nx) dx
0
Z
1 1
(cos(2(m n)x) + cos(2(m + n)x)) dx
=
2 0


1 sin(2(m n)x) sin(2(m + n)x) 1
=
+

2
2(m n)
2(m + n)
0




1 sin(2(m n)) sin(2(m + n))
1
sin(0)
sin(0)
=
+

+
2
2(m n)
2(m + n)
2 2(m n) 2(m + n)
= 0.
Moreover, if n N then
Z
hfn , fn i =
0

1
cos(2nx) dx =
2
2

Z
0


1 1 sin(4nx) 1 1
(cos(0) + cos(4nx)) dx = +
= .
2 2
4n 0 2

2
This shows that h 2fn i
n=1 is an orthonormal sequence in L , so it converges weakly to 0 by exercise 63 of the
previous homework. Therefore hfn i
n=1 converges weakly to 0.
Let x (0, 1/4) and N N. Choose m N with N x 1/4 m. Let n N be the smallest number such that
nx 1/4 > m (which exists because R is Archimedean). Then n > N 1 and hence (n 1)x 1/4 m, in
which case 0 < nx m 1/4 x < 1/4. Therefore |2nx 2m /2| < 1/2. By the mean value theorem
and the fact that | sin | 1, it follows that | cos(2nx) 1| = | cos(2nx) cos(2m + /2)| < 1/2 and hence

cos(2nx) > 1/2. This implies that hcos(2nx)i

n=1 does not converge to 0, so hfn in=1 does not converge to 0 on
(0, 1/4). Thus, it is not the case that hfn i
n=1 converges to 0 almost everywhere.

Note that {x R | 1/ 2 cos(2x)} = mZ [m + 1/8, m + 3/8] = mZ [(8m + 1)/8, (8m + 3)/8] and

n1
hence, for each n N, {x X | 1/ 2 cos(2nx)} = m=0
[(8m + 1)/8n, (8m + 3)/8n]. It follows that

P
m({x X | 1/ 2 |fn (x) 0|}) m({x X | 1/ 2 cos(2nx)}) = n1
m=0 2/8n = 2/8 for all n N, which

shows that hfn in=1 does not converge to 0 in measure.

6

Real Analysis

Chapter 6 Solutions

Jonathan Conder

(b) If x (0, 1] there exists N N such that 1/N < x, in which case fn (x) = 0 for all n N with n N. This
shows that hfn i
n=1 converges to 0 on (0, 1], hence almost everywhere. If (0, ) then m({x X |
|fn (x) 0|}) m({x X | 0 < |fn (x)|}) = m((0, 1/n)) = 1/n for all n N, which shows that hfn i
n=1 converges
R

p
p
to 0 in measure. Given p [1, ] it is clear that hfn in=1 is a sequence in L , and f 7 f is in (L ) by H
olders
R
q
inequality and the fact that X L , where q is the conjugate exponent to p. Since fn = 1 6= 0 for all n N,
p
it follows that hfn i
n=1 does not converge to 0 weakly in L .
27. Define a measurable function K : (0, )2 C by K(x, y) := (x + y)1 . Note that K(x, y) = 1 K(x, y) for all
, x, y (0, ). Moreover,
Z
Z 1
Z
Z
1
1
1
1/p
dx
dx +
dx < .
|K(x, 1)|x
dx =
Cp =
1+1/p
1/p
1/p
1+1/p
x
+x
x
0
0 x
1
0
It follows by Theorem 6.20 that kT f kp Cp kf kp for all f Lp .
30. (a) If y (0, ) then
Z
Z
Z
1/q
1/q 1
1/q1
K(xy)x
dx = K(z)(z/y)
y dz = y
K(z)z 1/p1 dz = y 1/p (p1 )
2

and hence, using H

olders inequality and the fact that K(xy)f (x) = K(xy)1/q x1/q x1/q K(xy)1/p f (x),
Z
p Z
p/q Z
2
1/q
K(xy)f (x) dx
K(xy)x
dx
xp/q K(xy)f (x)p dx
Z
2
1/q
1 p/q
xp/q K(xy)f (x)p dx.
=y
(p )
Since p + q = pq and hence p q = pq 2q, it follows by Tonellis theorem that
p
Z
Z Z
Z
2
1/q
1 p/q
xp/q K(xy)f (x)p dx dy
K(xy)f (x) dx
dy y
(p )
ZZ
2
1 p/q
= (p )
y 1/q xp/q K(xy)f (x)p dy dx
Z
Z
1 p/q
p/q 2
p
= (p )
x
f (x)
K(xy)y 1/q dy dx
Z
2
1 p/q
xp/q f (x)p x1/p (p1 ) dx
= (p )
Z
2
2
2
1 (p+q)/q
= (p )
x(p q )/(pq ) f (x)p dx
Z
1 p
= (p )
x(pq)/q f (x)p dx
Z
= (p1 )p xp2 f (x)p dx.
Thus, by Holders inequality (and Tonelli again)

Z
1/p
ZZ
Z Z
1
p2
p
K(xy)f (x)g(y) dx dy =
K(xy)f (x) dx g(y) dy (p )
x f (x) dx
kgkq .
(b) From the long calculation
Z
Z
2
|T f (y)| dy =

in part (a), if f L2 ((0, )) then

Z
2
2
Z Z
Z


1 2
 K(xy)f (x) dx dy
K(xy)|f (x)| dx
dy ( 2 )
x0 |f (x)|2 dx


7

Real Analysis

Chapter 6 Solutions

Jonathan Conder

and hence T f L2 ((0, )) with kT f k2 ( 21 )kf k2 . Therefore T : L2 ((0, )) L2 ((0, )) is well-defined, and
it is clearly linear. Moreover kT k ( 12 ).
32. Since |K|2 L1 ( ), Fubinis theorem implies that |Kx |2 L1 () for almost all x X. Therefore Kx L2 () for
R
almost all x X. By H
olders inequality |K(x, y)f (y)| d(y) kKx k2 kf k2 , and hence T f (x) converges absolutely,
for almost all x X. Fubinis theorem implies that K y L2 () and hence K y f (y) L2 (), for almost all y Y.
Define k : Y [0, ) by k(y) := kK y k2 . Then
Z
ZZ
ZZ
kkk22 = |k(y)|2 d(y) =
|K y (x)|2 d(x) d(y) =
|K(x, y)|2 d(x) d(y) = kKk22
and hence, by Holders inequality
Z
Z
y
kK f (y)k2 d(y) = kK y k2 |f (y)| d(y) = kkf k1 kkk2 kf k2 = kKk2 kf k2 .
This implies that y 7 kK y f (y)k2 is in L1 (), so by Minkowskis inequality for integrals
2 Z
Z
2
Z


2


kK(, y)f (y)k2 d(y) (kKk2 kf k2 )2 .
|T f (x)| d(x) = K(, y)f (y) d(y)
2

This shows that T f L2 () and kT f k2 kKk2 kf k2 .

33. Since Lq ((0, x)) L1 ((0, x)) for all x (0, ), it is clear that T is a well-defined linear map from Lq ((0, )) to C(0,) .
Rx
If f Lq ((0, )), the map x 7 0 f is absolutely continuous on (0, ), so T f is continuous. Given (0, ) there
R
R
exists n N such that n |f |q < ( 2 )q , by continuity of the finite measure E 7 E |f |q . Now


Z
Z
 1/p

1/p

|T f (x) T (f (0,n) )(x)| = x
f x
f (0,n) 
0
Z 0
x1/p
|f f (0,n) |
0
Z
= x1/p (0,x) |f [n,) |
x1/p k(0,x) kp kf [n,) kq

<
2
for all x (0, ), by H
olders inequality. In particular, if x (0, ) and |T f (x)| , then
Z n

1/p
|T (f (0,n) )(x)| x
|f |
2
0
and hence x ( 2 kf (0,n) k1 )p . This implies that {x X | |T f (x)|} is bounded, thus compact (because |T f | is
continuous), so T f C0 ((0, )). Moreover, by Holders inequality


Z
Z

 1/p
1/p


|T f (x)| = x
f (0,x)  x
|f (0,x) | x1/p k(0,x) kp kf kq = kf kq
for all x (0, ). This shows that kT f ku kf kq , so T is a bounded linear map from Lq ((0, )) to C0 ((0, )).
34. Set q := p/(p 1). Suppose p > 2, so that p = (p 1)q > q and hence q/p < 1. By Holders inequality
Z

Z

|f |
0

1/p Z
x|f (x)| dx
0

q/p

1/q
dx

<

Real Analysis

Chapter 6 Solutions

Jonathan Conder

R1
and hence f 0 L1 ([0, 1]). Define g : [0, 1] C by g(0) := f (1) 0 f 0 and g|(0,) := f. Then g is differentiable almost
everywhere on [0, 1], and g 0 L1 ([0, 1]) because g 0 = f 0 almost everywhere. Moreover
Z 
Z 1
Z 1
Z 1
f0
f0 =
f0 +
f0 =
g() g(0) = f () f (1) +
0

for all  (0, 1). This clearly also holds for  {0, 1}, so g is absolutely continuous on [0, 1] and hence limx0 f (x) =
limx0 g(x) = g(0). If p = 2,  (0, 21 ) and (, 2), then Holders inequality implies that
s
s
s
Z 2
Z
Z 1
Z 1
Z 1
0
1
0
2
0
2
x dx =
|f |
x|f (x)| dx
x|f (x)| dx (log(2) log()) =
x|f 0 (x)|2 dx log(2)


and hence (where M :=

qR
1

|f ()|
| log()|1/2

x|f 0 (x)|2 dx log(2))


R 



Z
f ()  f 0 
0
1/2
|f | | log()|1/2 (|f ()| + M )
|f ()| +
=
| log()|
1/2
| log()|

0

36. Suppose f weak Lp and ({x X | 0 6= f (x)}) < . Fix q (0, p). Define E0 := {x X | 0 < |f (x)| 1}, and for
each n N set En := {x X | 2n1 < |f (x)| 2n }. By the monotone convergence theorem
Z
Z X

X
X
X
|f |q
(2n )q En =
2nq (En ) (E0 ) +
2nq f (2n1 ) (E0 ) +
2nq+pnp [f ]pp < ,
n=0

n=0

n=1

because E0 {x X | 0 6= f (x)} and

geometric series). This shows that f Lq .

f ()

[f ]pp

n=1

for all (0, ) (note that

nqnp
n=1 2

is a convergent

Now suppose that f (weak Lp ) L , and fix q (p, ). Define E0 := {x X | 1 < |f (x)|} and for each n N set
En := {x X | 2n < |f (x)| 21n }. Then
!
Z
Z

X
q
q
1n q
kf k E0 +
|f |
(2
) En
n=1

= kf kq (E0 ) +

2qnq (En )

n=1

kf kq f (1) +

2qnq f (2n )

n=1

kf kq [f ]pp +

2qnq+np [f ]pp

n=1

and hence f

Lq .

It is obvious that f

Lq

for the case q = .

P
38. Let f : X C be a measurable function and suppose that nZ 2np f (2n ) < . For each n Z define En := {x
X | 2n < |f (x)| 2n+1 }. By the monotone convergence theorem
Z
Z X
X
X
p
|f |
(2n+1 )p En = 2p
2np (En ) 2p
2np f (2n ) <
nZ

nZ

nZ

and hence f Lp . Conversely, suppose that f Lp . By Proposition 6.24

Z X
X
np
n
2 f (2 ) =
2npn+1 f (2n )(2n1 ,2n ]
nZ

nZ

Real Analysis

Chapter 6 Solutions

2p

= 2p
p

2(n1)(p1) f ()(2n1 ,2n ] () d

nZ

Jonathan Conder

p1 f ()(2n1 ,2n ] () d

nZ

p1 f ()(0,) () d

Z0

=2

0
p 1

=2 p

p1 f () d

kf kpp

< .
Pn
39. If =
i=1 ai Ei is simple with (0) < and (0, ), then () = 0 if max{|a1 |, . . . , |an |} and
() = (0) if < min{|a1 |, . . . , |an |}. We may assume that ai 6= 0 for all i {1, . . . , n}, so
lim p () = lim 0 = 0

lim p () = lim p (0) = 0.

and

Given (0, ), we may choose Lp such that kf kp <

0 p f () p f


2

+ p


2

.
2p+1

By Chebyshevs inequality

2p kf kpp + 2p

 p
2


2

<

+ =
2 2

provided that (0, ) is sufficiently small (large). Therefore lim0 p f () = 0 (lim p f () = 0).
43. Clearly
1
H(0,1) (x) = sup
r(0,) m((x r, x + r))

m((x r, x + r) (0, 1))

.
2r
r(0,)

|(0,1) (y)| dy = sup

(xr,x+r)

If x (, 0] then

m((x r, x + r) (0, 1)) = x + r

1
Since r 7

x
2r

1
2

r (0, x)
r [x, 1 x]
r (1 x, ).

is increasing on [x, 1 x], it follows that H(0,1) (x) =

2r

m((x r, x + r) (0, 1)) = x + r

Given x (0, 12 ]

r (0, x)
r [x, 1 x]
r (1 x, ).

Since x + r 2r for all r [x, 1 x] and 1 2r for all r (1 x, ),

2r

m((x r, x + r) (0, 1)) = 1 x + r

10

1
22x .

it follows that H(0,1) (x) = 1. Similarly

r (0, 1 x)
r [1 x, x]
r (x, )

Real Analysis

Chapter 6 Solutions

Jonathan Conder

whenever x ( 12 , 1), and hence H(0,1) (x) = 1. Given x [1, )

m((x r, x + r) (0, 1)) = 1 x + r

1
Since r 7

1x
2r

1
2

r (0, x 1)
r [x 1, x]
r (x, ).

is increasing on [x 1, x], it follows that H(0,1) (x) =

Z

|H(0,1) | =

dx
+
(2 2x)p

1
2x .

Z
dx +

Hence, if p [1, )
dx
,
(2x)p

which is finite iff p 6= 1. Also |H(0,1) | 1 so H(0,1) Lp for all p (1, ], but not for p = 1. Moreover
H(0,1) weak L1 because x 7 x1 is in weak L1 . Continuing from above
Z

0



1
1
1
1

 =
+
1
+
+1
|H(0,1) | =


p1
p1
p1
2(1 p)(2 2x)
2(1 p)(2x)
2(p 1)2
2(1 p)2p1

1
p

and hence kH(0,1) kp = 1 + (p 1)1 21p for all p (1, ), so kH(0,1) kp behaves like (p 1)1 as p 1. It is
obvious that k(0,1) kp = 1 for all p [1, ].

11