# Thread:

1. ## How to show B[0,1] is not separable

I'm studying for comps, and this one has me stumped:

Show that the space of bounded functions $f:[0,1]\rightarrow \mathbb{R}$ under the sup norm is not separable.

I suspect that you'd either have to show an arbitrary dense set is uncountable or that an arbitrary countable set can't be dense, but I don't have any idea how to actually implement those strategies.

2. ## Re: How to show B[0,1] is not separable

For all $x\in [0,1]$ consider the family of bounded functions $f_x(t)=\begin{Bmatrix} 1 & \mbox{ if }& t=x\\0 & \mbox{if}& t\neq x\end{matrix}$
We verify $d(f_x,f_y)=1$ for all $x\neq y$ i.e., the family $\mathcal{F}=\{B(f_x,1/2):x\in[0,1]\}$ is pairwise disjoint. Now, choose $A\subset B[0,1]$ dense and use that $[0,1]$ is non denumerable.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 8, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9300147294998169, "perplexity_flag": "head"}