Solution to GTM249 Chapter 1 Part I

Errata for GTM 249, 250.

1.1 and Weak

1.1.1

(a)

For an arbitrary sequence , we have the pointwise convergence . If is unbounded, then the proposition holds automatically. Otherwise, are all bounded by , thus

(b)

Let and . Thus by noting that and , -a.e., we have by definition.

(c)

We have by . Now the result comes with (b) that

1.1.2.

(a)

Use induction. Suppose this holds for the case, and consider the case. If , then since , we have by pulling out the essential supremum of that Otherwise, if , then automatically . Set and . Then Also, note that the case is contained in the proof.

(b)

The equality condition is the same as the one of Hölder’s inequality in the case.

(c)

It suffices to show that , which is straightforward by (a).

1.1.3.

(a)

If , then define . Since for each , we have . Let to get , then let vary.

If , now . Let , we obtain . For another, set for arbitrary . Then and thus , and Again let , we get . Now let .

(b)

By Jensen’s inequality, we have This yields

(c)

Fix a sequence bounded by and define Using that as , the Lebesgue monotone convergence theorem yields , hence Using part (b) and taking in the inequality , we get Thus take and we have .

1.1.4.

(a)

Use Jensen’s inequality of integration to and , since is convex for .
Another way is to assume that by homogeneity, which implies , and subsequently

(b)

This is the same as the preceding question with a change in convexity. Or observe that

(c)

Use the discrete Jensen’s inequality. The problem is the same as

(d)

The same as (c).

1.1.5.

(a)

Since , we have The rest is by multiplying both sides by .

(b)

This is just the same with (a). Here the first “” turns to “” and the Hölder’s inequality turns its direction.

(c)

This is direct from 1.1.4 (a) pointwise on , and subsequently 1.1.4 (c) where .

(d)

Take disjoint sets with the same measure and take . Then and .

1.1.6.

(a)

The case is trivial. When , let be the conjugate number of , then set , we have Now eliminating on both sides finishes the proof when . Otherwise, choose ascending sequences of subsets and , such that and , and for all . Now take . Thence for all and . By monotonicity, we obtain the desired result by taking and then .

(b)

Let be a -finite measure space, and be a finite measure space. For every nonnegative measurable function on the product space we have For the proof, take in (a), and guarantees that .

(c)

Since Hölder’s inequality reverses when .

(d)

is not -finite now, and (a) as well as (b) no longer holds for the . Indeed, for any , and therefore the left–hand side equals ; for any , and therefore the right–hand side equals .

1.1.7.

(a)

Since

(b)

Since

1.1.8.

Suppose is an Cauchy sequence. Let be a sequence such that . Thus the series converges in . The next thing is to verify that . This is because for all , take sufficiently large such that , and then which implies . Thus we have shown the completeness.

1.1.9.

Note that for , in which both sides have measure . Since we havefor some large , thus for .

1.1.10.

(a)

This is due to

(b)

Using (a) we obtain

(c)

For , from (b) and we get Plus, for , from (b) and we get Finally, is a direct consequence of .

1.1.11.

(a)

Take , then we have

(b)

Take in the preceding problem, then this means .

1.1.12.

(a)

By Exercise 1.1.11 (a), we have

(b)

Choose an ascending chain of subsets such that and . Now set , we have Since is arbitrary, we have for finite measure spaces , and so for by definition.

(c)

It’s easy to verify that is a norm for by Minkowski’s inequality and taking proper . When it comes to , we have to be the desired metric (but not a norm) which induces the same topology by observing the inequality after taking the power of on all terms.

(d)

Since

1.1.13.

(a)

By definition, .

(b)

Since .

(c)

If not, suppose is an equivalent norm, that is, for all and some . Then we have This contradicts with the fact that when .

1.1.14.

(a)

Since

(b)

Since

1.1.15.

Assume WLOG that for all . Now the estimate follows Take , then we can rewrite it as where . Set for some constant satisfying , and the right side becomes . Hence .

1.1.16.

We skip the cases of since there is nothing to prove.

(a)

If , then And if , then . Thus

(b)

Since we have by definition that where and .

1.1.17.

(a)

The case is nothing other than the Hölder’s inequality. For , suppose the proposition holds for , then for , setthen Note that by the induction hypothesis, we should have Thus,

(b)

Take , then the left–hand side is no less than And the right–hand side is no more than

1.2 Convolution and Approximate Identities

1.2.1.

For , forbidding along with , we have since at least one of and vanishes.

1.2.2.

Since and

1.2.3.

1.2.4.

(a)

Since .

(b)

Let be a positive function supported in with integral , then define , which are compactly supported smooth functions with integral as well. Now we show , which is because Then apply the average continuity.

1.2.5.

is a Haar measure because for any ,

1.2.6.

is a left Haar measure because for any , is a right Haar measure because for any ,

1.2.7.

For the former, note that (here denotes the group ) And Now combine with Minkowski’s inequality, The latter and Exercise 1.2.8 follow in a rather similar manner, so we omit the procedure.

1.2.9.

By Young’s inequality, it’s quite straightforward to obtain . To show the inverse, we use to approximate the result. Note that for , we have . Thus We have , and This meansfor each and . Let and then , we get .

1.2.10.

By Young’s inequality, we obtain . For the inverse, take and . Then for , we have Thus Letting , we have ; then , we get .

1.2.11.

(a) Since Thanks to the adjustment given by , we have Thus Due to the average continuity, we have for each such that for . Plus, we have uniformly for , thus take large so that for , we have This ends the proof.

(b) Due to the uniform continuity, we choose so that for . Now for large , we have and note that the tending to does not depend on the choice of .

(c)&(d) Set , then . can be viewed as satisfying the condition in (c) by zero extension outside . Thus uniformly. However, also note that this means uniformly on , and is a polynomial in , since

1.2.12

Note thatTherefore

Another solution using the hint of convolution:Thus taking norm and using Minkowski’s inequality we obtain

Remark.
Remark. The norm is exactly indeed. In fact, consider a sequence of functions , we find . Compute the norms of transformed functions:For arbitrary fixed, we haveFor sufficiently large, we have by the famous integral thatthus,Finally, take and .