1
$\begingroup$

Let $F = \{f\colon [0,1] \to \Bbb R\mid f \text{ is bounded }\}$; $d(f,g) = \sup|f(x) - g(x)|$ for $x \in [0,1]$. $F_1 = \{f\colon [0,1] \to \Bbb R:\mid |f(x)| \le 1, \forall x \in [0,1]\}$. Show that $F_1$ is not totally bounded.

I'm given the definition of a totally bounded space as:

A metric space $(X,d)$ is said to be totally bounded provided the following condition is satisfied. For each $\epsilon > 0$, there exists a finite set $F_\epsilon$ (called an $\epsilon$-net) contained in $X$ such that $X = \bigcup_{z \in F_{\epsilon}} N(z;\epsilon)$.

This is a homework question, so I would like the work to be my own, however I'm having a tough time knowing where to start. I've begun by assuming that $F_1$ is totally bounded, and hoping to find a contradiction but thus far have made little progress.

Any help is appreciated!

$\endgroup$
  • $\begingroup$ Whats is the definition of $N$ if I may ask? $\endgroup$ – MoebiusCorzer Nov 4 '15 at 22:59
  • 2
    $\begingroup$ @MoebiusCorzer presumably an open $\epsilon$-neighborhood of the point $z$. $\endgroup$ – Kevin Carlson Nov 4 '15 at 23:00
  • $\begingroup$ @KevinCarlson Thank you. $\endgroup$ – MoebiusCorzer Nov 4 '15 at 23:00
  • $\begingroup$ Yes, that is the epsilon neighborhood of a point z. $\endgroup$ – Iff Nov 4 '15 at 23:10
1
$\begingroup$

Some hints: you want to find an $\epsilon$ so that there's no such net, so pick your favorite $\epsilon$ (smaller than $1$!) Then given finitely many functions $f_1,...,f_n$ on the interval bounded between $-1$ and $1$, you need to produce $f_{n+1}$ not within $\epsilon$ of any of them, and still bounded between $-1$ and $1$. There aren't any continuity conditions on members of $F$, so you can construct $f_{n+1}$ arbitrarily: try a "diagonalization" process, where you make it differ from each of the other $f_i$ at a different point.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.