0

Consider $C[a,b]$ - metric space with $d(f,g) = \int_{a}^{b} |f-g|dx$.

I consider a Cauchy-sequence $\{f_{n}\}$ then consider $f(x)=\lim_\limits{n \to \infty}f_{n}(x)$ then it's obviously that $f(x)$ is continuous. Now consider: $\forall \epsilon > 0 \exists N : \forall n,m > N : d(f_{n},f_{m}) < \epsilon$, so consider $\int_{a}^{b} |f_{n}-f_{m}| = \lim_\limits{m \to \infty} \int_{a}^{b} |f_{n}-f_{m}| < \int_{a}^{b} |f_{n}-f_{m}| < \epsilon$. Am I right?

openspace
  • 6,470

3 Answers3

1

proof-verification

I consider a Cauchy-sequence $\{f_{n}\}$ then consider $f(x)=\lim_\limits{n \to \infty}f_{n}(x)$ then it's obviously that $f(x)$ is continuous. (Instead of claiming so, one is supposed to show it.)

Now consider: $\forall \epsilon > 0 \exists N : \forall n,m > N : d(f_{n},f_{m}) < \epsilon$, so consider $$ \int_{a}^{b} |f_{n}-f_{m}| = \lim_\limits{m \to \infty} \int_{a}^{b} |f_{n}-f_{m}| < \int_{a}^{b} |f_{n}-f_{m}| < \epsilon.$$ (The first equality does not make sense and your proof breaks down here.)

Am I right? (No. Where do you show that the space is complete?)


There is actually nothing to prove because $C[a,b]$ with your metric $d$ is not a complete metric space. Take a look at this answer:

https://math.stackexchange.com/a/156905/9464

0

No, not at all. How do you know that your definition of $f$ makes sense? It may be obvious for you that $f$ is continuous, but not for me. And what's the goal of the final string of inequalities?