How is distance in sequence spaces measured?

184 Views Asked by At

I want to prove that $\ell^p$ is separable. I was given the following hint: consider a rational sequence in $\ell^p$ with all terms $0$ except for finitely many.

So consider the set of sequences defined as

$$S=\{(x_k)_k\in \mathbb{Q}:x_1 = q_n, x_k=0\mbox{ for $k\ge 1$}\}$$

Then $S$ is countable. But is it dense? We need to show that for every sequence $(y_k)_k$ in $\ell^p$ and every $\epsilon>0$ there exists a sequence $(x_k)_k$ in $S$ such that

$$\sum_k |y_k-x_k|^p<\epsilon$$

Is this correct?

But if this is what we need, then, obviously, there exists an $\epsilon >0$ and a sequence in $X$ such that $\sum_k |y_k-x_k|^p<\epsilon$, for any sequence in $S$.

So what is it that I do not understand? Would appreciate a clarification.

Edit: Or do we just need one point in $(x_k)_k$ be in the $\epsilon$-range of at least one point of $(y_k)_k$? I.e. to satisfy

$$|x_k-y_l|^p<\epsilon$$

1

There are 1 best solutions below

4
On BEST ANSWER

In $\ell_p$: $$d(a_n,b_n)=\sqrt[p]{\sum_{n \in \Bbb N} |a_n-b_n|^p}$$