$$ \newcommand{\RR}{\mathbb{R}} \newcommand{\QQ}{\mathbb{Q}} \newcommand{\CC}{\mathbb{C}} \newcommand{\NN}{\mathbb{N}} \newcommand{\ZZ}{\mathbb{Z}} \newcommand{\EE}{\mathbb{E}} \newcommand{\HH}{\mathbb{H}} \newcommand{\FF}{\mathbb{F}} \newcommand{\SO}{\operatorname{SO}} \newcommand{\dist}{\operatorname{dist}} \newcommand{\length}{\operatorname{length}} \newcommand{\uppersum}[1]{{\textstyle\sum^+_{#1}}} \newcommand{\lowersum}[1]{{\textstyle\sum^-_{#1}}} \newcommand{\upperint}[1]{{\textstyle\smallint^+_{#1}}} \newcommand{\lowerint}[1]{{\textstyle\smallint^-_{#1}}} \newcommand{\rsum}[1]{{\textstyle\sum_{#1}}} \newcommand{\partitions}[1]{\mathcal{P}_{#1}} \newcommand{\erf}{\operatorname{erf}} \newcommand{\ihat}{\hat{\imath}} \newcommand{\jhat}{\hat{\jmath}} \newcommand{\khat}{\hat{k}} \newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}} \newcommand{\smat}[1]{\left(\begin{smallmatrix}#1\end{smallmatrix}\right)} $$

Assignment 10

We have been doing a lot of proofs in class recently, and its important not just to watch a proof be done, but to really rewrite it by yourself. So, most of this homework is asking you to prove things extremely similar to things we’ve proven in class, as motivation to write out those proofs yourself. You should be able to follow the book / notes rather closely, for hints!

Exercise 1 (Convergence at the Endpoints) We saw in class that proving in general that a power series is convergent at its endpoints is rather complicated. But in certain situations its easy to show. In this problem, assume \(f(x)=\sum_n a_n x^n\) has radius of convergence 1, and also that \(f(1)=\sum_n a_n\) converges absolutely.

Use this to prove that \(f(x)\) is continuous at \(x=1\).

Hint: follow the same proof technique we used for continuity on the interior, with Dominated convergence, adapted to this situation

Solution. Let \(x_k\in(-1,1)\) be a sequence converging to \(1\), we wish to show that \(\lim f(x_n)=f(1)\). Writing out \(f=\sum_n a_n x^n\) as a power series, we see that we wish to switch the limit and sum:

\[\lim_k f(x_k)=\lim_k\sum_n a_nx_k^n\] \[\sum_n \lim_k a_nx_k^n = \sum_n a_n \lim_k x_k^n=\sum_n a_n (\lim_k x_k)^n = \sum_n a_n(1)^n=f(1)\]

So, we must show that dominated convergence applies, which means that we need to find \(M_n\) with \(|a_n x_k^n|<M_n\) for all \(k\). Because of the assumption that \(\sum a_n\) converges absolutely, we can set \(M_n=|a_n|\) and note \(\sum M_n\) converges. Now for every \(k\), \(x_k\in(-1,1)\implies |x_k|<1\) so \(|x_k|^n<1\) and \(|a_n x_k^n|<|a_n|=M_n\). This is exactly what we needed! The terms of \(f(x_k)\) are bounded above by a convergent sum, so dominated convergence applies, and the two lines above (where we switched the order of the limits and sum) are equal: \(f\) is continuous at 1.

Exercise 2 (Continuity and Dense Sets I) Let \(X\subset \RR\) be a subset of the real line, and \(f,g\colon X\to \RR\) two continuous functions with domain \(X\). Let \(D\subset X\) be a dense subset of \(X\), and prove that if \(f(d)=g(d)\) for all \(d\in D\), then actually \(f\) and \(g\) are the same function.

*Hint: follow closely the proof we did for \(\QQ\subset\RR\) in class.

Solution. This argument is very similar to the argument in the textbook.

Exercise 3 (Continuity and Dense Sets II) Let \(f\RR\to\RR\) be a continuous and \(D\) a dense subst of \(\RR\) on which \(f\) takes only positive values.

Prove that \(f\) never takes any negative values, on all of \(\RR\).

Solution. Let \(x\in\RR\) be arbitrary. For each \(n\), by density, we can find a point \(d_n\in D\) with \(x<d_n<x+1/n\). Using the squeeze theorem, we see \(d_n\to x\), and so by continuity of \(f\) we know \[f(x)=f(\lim d_n)=\lim f(d_n)\]

But on \(D\) \(f\) is positive, so for each \(n\) we know \(f(d_n)>0\). Thus by the limit inequalities, we see \[\lim f(d_n)\geq 0\]

So putting these two together, we have \(f(x)\geq 0\), as required.

Exercise 4 (Extreme Value Theorem) Show that if \(f\) is a continuous function on a closed interval \([a,b]\), that \(f\) achieves a minimum value: that is, there exists a \(q\in [a,b]\) such that \(f(a)\leq f(x)\) for all \(x\in [a,b]\).

Hint: follow closely the proof we did in class, for the existence of a maximum.

Solution. This argument is very similar to the argument in the textbook.

Exercise 5 (Intermediate Value Theorem) Let \(f\) be continuous on \([a,b]\) and assume \(f(a)>0\) and \(f(b)<0\). Show there exists a \(z\in[a,b]\) with \(f(z)=0\).

Hint: follow closely the proof we did in class, where we had \(f(a)< 0\) and \(f(b) > 0\)

Solution. This argument is very similar to the argument in the textbook.

Exercise 6 (Using the IVT) Prove that there is a real number which solves the equation \[x^3=10x+10,000\]

Solution. Consider the polynomial \(f(x)=x^3-10x-10,000\), and observe that a zero of \(f\) is a solution to the equation we seek. Since polynomials are continuous functions we aim to use the Intermediate Value Theorem, and prove the existence of a zero by finding a point where \(f\) is negative and another point where \(f\) is positive. At zero, \(f(0)=-10,000\) is certainly negative. But at \(x=100\) \[f(100)=(100)^3-10\cdot 100 - 10,000 = 1,000,000 - (11,000)= 9,989,000\] which is very positive. Thus, there must exist some \(z\in [0,100]\) where \(f(z)=0\).

Exercise 7 (Uniform Continuity) Recall function is called uniformly continuous if for \(\epsilon>0\) you can pick a single \(\delta\) that works on the entire domain. (You do not need the optional chapter uniform continuity to do this problem: just that definition).

Let \(f,g\) be two uniformly continuous functions defined on the same domain \(X\subset\RR\). Prove that \(f+g\) is uniformly continuous on \(X\).

Solution. Choose \(\epsilon>0\) arbitrary. Then by the uniform continuity of \(g,f\) we can find a \(\delta_f\) such that \(|x-y|<\delta_f\implies |f(x)-f(y)|<\epsilon/2\), and similarly a \(\delta_g\) such that \(|x-y|<\delta_g\implies |g(x)-g(y)|<\epsilon/2\). Set \(\delta=\min\{\delta_f,\delta_g\}\), and let \(x,y\) be two points int eh domain such that \(|x-y|<\delta\). Then for \(h=f+g\),

\[|h(x)-h(y)|=\left|\left(f(x)+g(x)\right)-\left(f(y)+g(y)\right)\right|=\left|\left(f(x)-f(y)\right)+\left(g(x)-g(y)\right)\right|\] By the triangle inequality, \[\leq \left|f(x)-f(y)\right|+\left|g(x)-g(y)\right|\] And as \(|x-y|<\delta\), its \(\leq\) both \(\delta_f\) and \(\delta_g\) by design. So each of these quantities is less than \(\epsilon/2\), and the entire thing is less than \(\epsilon\).

Since \(x,y\) were arbitrary in the domain subject only to the constraint of being within \(\delta\) of one another, this same uniform \(\delta\) works for all such pairs, and \(f+g\) is uniformly continuous.