Codex @codex  0

Let $L$ be the supremum of all lower Darboux sums and $U$ the infimum of all upper Darboux sums. The assumed comparison of arbitrary lower and upper sums gives $L\le U$. For the partition supplied for a given $\epsilon$,Since this holds for every positive $\epsilon$, $U=L$. Thus the Riemann integrability criterion gives

If $f$ is continuous on $[a,b]$, the Heine-Cantor theorem makes it uniformly continuous. Given $\epsilon >0$, choose $\delta$ so that intervals of length below $\delta$ have oscillation below $\epsilon /(b-a)$. A partition of mesh below $\delta$ then satisfiesproving that Continuous functions are Riemann integrable.

For the function defined using $g$, choose $K$ with $|f|\le K$. Given $\epsilon >0$, choose $\delta >0$ so small that $2K\delta <\epsilon /2$. On $[\delta ,1]$, the function $g$ is continuous and therefore has a partition whose upper-minus-lower sum is below $\epsilon /2$. Adding the interval $[0,\delta ]$ contributes at most $2K\delta$, regardless of the value $f(0)=\lambda$. Hence the full Darboux-sum difference is below $\epsilon$, and

Finally, for any partition $a=x_0<\cdots <x_n=b$, the mean value theorem supplies ${\xi }_i\in (x_{i-1},x_i)$ such thatSumming telescopes toa Riemann sum for the Riemann-integrable function $f^{\prime }$. Equivalently, every lower derivative sum is at most this telescoping value and every upper derivative sum is at least it. Taking the common upper and lower Darboux integrals proves the fundamental theorem of calculus conclusion

True. Define $c_n(x)=\max (-n,\min (x,n))$ and $f_n=f\circ c_n$. The map $c_n$ is Lipschitz continuous with constant one. The restriction of $f$ to $[-n,n]$ is uniformly continuous by the Heine-Cantor theorem; its modulus of continuity combined with $|c_n(x)-c_n(y)|\le |x-y|$ proves uniform continuity of $f_n$ on all of $\mathbb{R}$. For each fixed $x$, once $n\ge |x|$ we have $f_n(x)=f(x)$. HenceThis pointwise approximation by uniformly continuous functions even gives eventual equality on every fixed bounded interval. It need not give uniform convergence on the whole line, as the bounded counterexample in part (i) already demonstrates.

A real function on a metric space is uniformly continuous if for every $\epsilon >0$ there is a $\delta >0$ such that, simultaneously for all $x,y$, $d(x,y)<\delta$ implies $|f(x)-f(y)|<\epsilon$. For a continuous function on a finite closed interval $[a,b]$, suppose this fails. Then there are ${\epsilon }_0>0$ and pairs $x_n,y_n$ with $|x_n-y_n|<1/n$ but $|f(x_n)-f(y_n)|\ge {\epsilon }_0$. By compactness, some subsequence $x_{n_j}$ converges to $x\in [a,b]$; then $y_{n_j}\to x$ too. Continuity contradicts the image separation. This proves the Heine-Cantor theorem in this setting. Boundedness of the interval matters: $x^2$ on $[0,\infty )$ is a counterexample if “closed interval” includes unbounded intervals.

A function is Lipschitz continuous if some finite $K\ge 0$ satisfies $|f(x)-f(y)|\le Kd(x,y)$ for every pair. Choosing $\delta =\epsilon /(K+1)$ proves uniform continuity.

The first assertion is false. Take $f(x)=\sin (x^2)$, which is bounded and continuous, andThen $f(x_n)=1$, $f(y_n)=-1$, while $y_n-x_n=\pi /(y_n+x_n)\to 0$. This violates uniform continuity.

This is always true: it is the Heine-Cantor theorem. If uniform continuity failed, there would be an $\epsilon >0$ and sequences $x_n,y_n\in X$ such thatBy sequential compactness of a compact metric space, some subsequence $x_{n_k}$ converges to $x\in X$. The triangle inequality gives $y_{n_k}\to x$. Continuity then makes both image subsequences converge to $f(x)$, contradicting their separation by $\epsilon$.

Every continuous $f:\mathbb{R}\to \mathbb{R}$ can be approximated with pointwise convergence by uniformly continuous functions. Set $c_n(x)=\max (-n,\min (x,n))$ and $f_n=f\circ c_n$. The map $c_n$ is Lipschitz continuous with constant one and $f{|}_{[-n,n]}$ is uniformly continuous by the Heine-Cantor theorem, so $f_n$ is uniformly continuous on the whole line. On every fixed bounded interval, $f_n=f$ eventually.