Chapter 6

Further Topics

[32/66%]
Show
LaTeX
Problem 6.1.1

Describe the Bernstein polynomials for the two functions f(x)=xf(x)=x and g(x)=x2g(x)=x^{2} on [0,1][0,1].

?
Problem 6.1.2

Prove that (1+x)n≥1+nx(1+x)^{n} \geq 1+n x for all x≥−1x \geq -1 and each positive integer nn.

?
Problem 6.1.3
?
(a)

Complete the proof of the first lemma used in the proof of the Stone-Weierstrass theorem by showing that the described gg satisfies (i)-(iii).

(b)

Complete the proof of the second lemma used in the same theorem.

Problem 6.1.4

In the Weierstrass approximation theorem, it is crucial that the interval is compact, as addressed in Stone's generalization. One of our favorite noncompact subsets of R\mathbb {R} is R\mathbb {R} itself. Show that uniform polynomial approximation is not always guaranteed on R\mathbb {R}. Here are two approaches:

?
(a)

Come up with a function in C(R)C(\mathbb {R}) that cannot be uniformly approximated by polynomials.

(b)

Show that the uniform limit of polynomials R→R\mathbb {R} \rightarrow \mathbb {R} is still a polynomial.

Problem 6.1.5

Deduce the Weierstrass approximation theorem from the Stone-Weierstrass theorem (thus showing that the former is indeed a special case of the latter).

?
Problem 6.1.6

Consider the collection Pe\mathcal{P}_{e} of all even polynomials.

?
(a)

Use the Stone-Weierstrass theorem to show that Pe\mathcal{P}_{e} is dense in C([0,1])C([0,1]).

(b)

Explain why the Stone-Weierstrass theorem cannot be used to show that Pe\mathcal{P}_{e} is dense in C([−1,1])C([-1,1]).

(c)

The following question remains: Is Pe\mathcal{P}_{e} dense in C([−1,1])C([-1,1])? Answer this question, and prove your assertion.

Problem 6.1.7

Let AA be as in the hypotheses of Bishop's theorem.

?
(a)

Prove that functions of the form f+fˉf+\bar{f}, for f∈Af \in A, are real-valued and separate the points of XX.

(b)

Deduce that an Aˉ\bar{A}-symmetric subset of XX must be a singleton.

Problem 6.1.8

Find (in another book) another proof of the Weierstrass approximation theorem. Write up your own account of this proof. For example, if you have read the final section of the chapter, you may want to find the proof that makes use of the Fourier transform.

?
Problem 6.2.1

Show that XX is nowhere dense in MM if and only if its closure has empty interior, (Xˉ)∘=∅(\bar{X})^{\circ }=\emptyset.

?
Problem 6.2.2

Show that any finite subset of R\mathbb {R} is nowhere dense in R\mathbb {R}. Give examples to show that a countable set can be nowhere dense in R\mathbb {R}, but that this is not always the case.

?
Problem 6.2.3

Let f(x)=sin⁡(1x)f(x)=\sin \left(\frac{1}{x}\right) for x≠0x \neq 0, and f(0)=0f(0)=0. Compute ωf(0)\omega_{f}(0). How does this tie in with what you know about the continuity of this function?

?
Problem 6.2.4

First category sets are in some sense "small," while second category sets are "large." Another notion of set size that we have discussed is "measure zero": "Small" sets are of measure zero, while "large" sets are not. Is there a connection between these two ways of describing the size of a set? The answer is no. Please show this by doing two things:

?
(a)

Describe a set that is of first category, but not of measure zero.

(b)

Describe a set that is of measure zero, but not of first category.

Problem 6.2.5

Prove that the function defined on (0,1)(0,1) by

g(x)={1q if x=pq in reduced form 0 if x is irrational,  g(x)= \begin{cases} \frac{1}{q} & \text{ if } x=\frac{p}{q} \text{ in reduced form } \\ 0 & \text{ if } x \text{ is irrational, }\end{cases}

is continuous at each irrational point of (0,1)(0,1) and discontinuous at each rational point of (0,1)(0,1).

?
Problem 6.2.6

The goal of this exercise is to show that "most" continuous functions are nowhere differentiable. Let EnE_{n} denote the set of all f∈C([0,1])f \in C([0,1]) for which there exists an xf∈[0,1]x_{f} \in [0,1] satisfying

∣f(x)−f(xf)∣≤n∣x−xf∣ \left|f(x)-f\left(x_{f}\right)\right| \leq n\left|x-x_{f}\right|

for every x∈[0,1]x \in [0,1].

?
(a)

Show that EnE_{n} is nowhere dense in C([0,1])C([0,1]). To do this, approximate f∈C([0,1])f \in C([0,1]) by a piecewise linear function gg whose pieces each have slope ±2n\pm 2 n. Then, if ∥h−g∥∞\left\| h-g\right\|_{\infty } is sufficiently small, the function hh cannot be in EnE_{n}.

(b)

Deduce from (a) that the nowhere differentiable functions are of second category in C([0,1])C([0,1]).

Problem 6.3.1

Let XX and YY be Banach spaces. By considering the right shift on ℓ2\ell^{2} into itself defined by S(x1,x2,…)=(0,x1,x2,…)S\left(x_{1}, x_{2}, \ldots \right)=\left(0, x_{1}, x_{2}, \ldots \right), we see that the property of being one-to-one is not enough to guarantee that a bounded linear operator be invertible (compare what happens in the finite-dimensional case). However, if a one-to-one bounded linear operator is also onto, then it must be invertible. Use the open mapping theorem to prove that the inverse is also bounded.

?
Problem 6.3.2

Let XX be a Banach space in the two different norms ∥⋅∥1\left\| \cdot \right\|_{1} and ∥⋅∥2\left\| \cdot \right\|_{2}.

?
(a)

Show that if there exists a constant MM satisfying ∥x∥1≤M∥x∥2\left\| x\right\|_{1} \leq M\left\| x\right\|_{2} for all x∈Xx \in X, then the two norms are equivalent.

(b)

Does the result of (a) contradict the result of Exercise 5.2.2? Explain your answer to this question.

Problem 6.4.1

Show that x∼yx \sim y if x−y∈Qx-y \in \mathbb {Q} defines an equivalence relation on the open interval (0,1)(0,1).

?
Problem 6.5.1

Let X=(X,d)X = (X, d) be a complete metric space and T:X→XT: X \rightarrow X a contraction, i.e., there exists M∈[0,1)M \in [0,1) such that d(Tx,Ty)≤Md(x,y)d(Tx, Ty) \leq M d(x, y) for all x,y∈Xx, y \in X. Theorem 6.11 (the Banach contraction mapping principle) states that there exists a unique point x∈Xx \in X with Tx=xTx = x; its proof chooses any x0∈Xx_{0} \in X and puts x1=Tx0x_{1} = T x_{0}, x2=Tx1=T2x0x_{2} = T x_{1} = T^{2} x_{0}, and so on, xn=Tnx0x_{n} = T^{n} x_{0}.

Give an inductive proof of the inequality d(xn+1,xn)≤Mnd(x1,x0)d\left(x_{n+1}, x_{n}\right) \leq M^{n} d\left(x_{1}, x_{0}\right), n=1,2,…n=1,2, \ldots, and thereby complete the proof of the contraction mapping theorem.

?
Problem 6.5.2

Show that the method of successive approximations applied to the differential equation f′=ff^{\prime }=f with f(0)=1f(0)=1 yields the usual formula for exe^{x}.

?
Problem 6.5.3

For each of the following sets give an example of a continuous mapping of the set into itself that has no fixed point:

?
(a)

R\mathbb {R}.

(b)

(0,1](0,1].

(c)

[−10,−7]∪[2,4][-10,-7] \cup [2,4].

Problem 6.5.4

Give an example of a mapping of [0,1][0,1] into itself that is not continuous and has no fixed points.

?
Problem 6.5.5

Consider the function f:R→Rf: \mathbb {R} \rightarrow \mathbb {R} given by

f(x)={x+e−x2 if x≥0e32 if x<0. f(x)= \begin{cases} x+e^{\frac{-x}{2}} & \text{ if } x \geq 0 \\ e^{\frac{3}{2}} & \text{ if } x<0.\end{cases}

Show that ∣f(x)−f(y)∣<∣x−y∣\left|f(x)-f(y)\right|<\left|x-y\right| for all xx and yy, yet ff has no fixed point. Does this contradict the contraction mapping principle? Explain.

?
Problem 6.6.1

For ff and gg in C([a,b])C([a, b]) define f+gf+g and f⋅gf \cdot g by

(f+g)(x)=f(x)+g(x) and (f⋅g)(x)=f(x)⋅g(x) (f+g)(x)=f(x)+g(x) \quad \text{ and } \quad (f \cdot g)(x)=f(x) \cdot g(x)

Show that C([a,b])C([a, b]) is a ring with identity.

?
Problem 6.6.2

Prove that a proper ideal of a ring with identity contains no invertible elements.

?
Problem 6.6.3

If J\mathcal{J} is an ideal in a Banach algebra, then J‾\overline{\mathcal{J}} is also an ideal. (In this statement, "Banach algebra" can be replaced by "normed ring.")

?
Problem 6.6.4

Prove that Jx\mathcal{J}_{x} is a proper ideal of C([a,b])C([a, b]).

?
Problem 6.6.5

Prove that for x,y∈[a,b],Jx=Jyx, y \in [a, b], \mathcal{J}_{x}=\mathcal{J}_{y} if and only if x=yx=y. (In proving this, you may find yourself assuming that x≠yx \neq y and constructing an actual function ff that is in one of the ideals but is not in the either. It is this step that requires Urysohn's lemma when [a,b][a, b] is replaced by a compact Hausdorff space; see the paragraph preceding Theorem 6.14. In fact, in that case ff is not actually constructed but only its existence implied.)

Theorem 6.14: Each ideal Jx\mathcal{J}_{x} is a maximal ideal of C([a,b])C([a, b]), and moreover, every maximal ideal of C([a,b])C([a, b]) is of this form. Finally, Jx=Jy\mathcal{J}_{x} = \mathcal{J}_{y} if and only if x=yx = y.

?
Problem 6.7.1

Fix a positive real number aa and let χ[−a,a]\chi_{[-a, a]} denote the characteristic function

χ[−a,a](t)={1 if t∈[−a,a]0 otherwise  \chi _{[-a, a]}(t)= \begin{cases} 1 & \text{ if } t \in [-a, a] \\ 0 & \text{ otherwise }\end{cases}

Show that the Fourier transform of χ[−a,a]\chi_{[-a, a]} is given by

χ^[−a,a](w)=2sin⁡(aw)w \widehat{\chi }_{[-a, a]}(w)=\frac{2 \sin (a w)}{w}
?
Problem 6.7.2

As in Example 1, fix real numbers θ\theta and aa, and let

f(t)={12aeiθt if t∈(−a,a)0 otherwise.  f(t)= \begin{cases} \frac{1}{\sqrt{2 a}} e^{i \theta t} & \text{ if } t \in (-a, a) \\ 0 & \text{ otherwise. }\end{cases}

Show that ∫−∞∞∣f(t)∣2dt=1\int_{-\infty }^{\infty }|f(t)|^{2} d t=1 and

f^(w)=1πasin⁡a(w−θ)w−θ \hat{f}(w)=\frac{1}{\sqrt{\pi a}} \frac{\sin a(w-\theta )}{w-\theta }

Use that eiθ=cos⁡θ+isin⁡θe^{i \theta }=\cos \theta +i \sin \theta for every real number θ\theta.

?
Problem 6.7.3

In the section we claimed that

σw2=∫−∞∞w2∣f^(w)∣2dw=∫−∞∞∣Df^(w)∣2dw=∥Df∥2 \sigma _{w}^{2}=\int _{-\infty }^{\infty } w^{2}|\hat{f}(w)|^{2} d w=\int _{-\infty }^{\infty }|\widehat{D f}(w)|^{2} d w=\left\| D f\right\| ^{2}

The point of this exercise is to verify the middle equality, and hence all three equalities. Note that

Df^(w)=12π∫−∞∞f′(t)e−iwtdt. \widehat{D f}(w)=\frac{1}{\sqrt{2 \pi }} \int _{-\infty }^{\infty } f^{\prime }(t) e^{-i w t} d t.

Use integration by parts to show that this equals iwf^(w)i w \hat{f}(w), and hence that the equation holds.

?
Problem 6.7.4

Verify the formula

Tf(t)=∫−aasin⁡b(t−s)π(t−s)f(s)ds T f(t)=\int _{-a}^{a} \frac{\sin b(t-s)}{\pi (t-s)} f(s) d s

for T=TbℓTtℓT=T_{b \ell } T_{t \ell }, as used in the section.

?
Problem 6.7.5

Show that (6.8) (in the text of the section) is true whenever α2+β2≤1\alpha^{2}+\beta^{2} \leq 1.

?