Proving Density of U and V in Hilbert Space: Tips and Tricks

noospace
Messages
69
Reaction score
0

Homework Statement



Let e_i = (0,0,\ldots, 1, 0 , \ldots) be the basis vectors of the Hilbert space \ell_2^\infty.

Let U and V be the closed vector subspaces generated by \{ e_{2k-1}|k \geq 1 \} and \{ e_{2k-1} + (1/k)e_{2k} | k \geq 1 \}].

Show U \oplus V dense in \ell_2^\infty

I am looking for hints that anyone can offer.

The Attempt at a Solution



My main problem seems to be finding the most direct method of proof.

First I tried proving that \overline{U\oplus V} = \ell_2^\infty using the set theoretic procedure of show each side of the equation is a subset or equal to the opposite side. I tried to use the fact that every element of the LHS has a sequence in U + V converging towards it. This got me nowhere.

I next tried showing that if x is any point in the hilbert space, there should be a point in the direct sum within a distance epsilon > 0 of it. I managed to construct an expression for x in terms of the basis vectors, but this expression is precisely x so is useless.

Currently I'm thinking about projecting x onto the subspaces and then using the sum of the projections somehow. It seems like this won't work however, since there no dependence on epsilon.

Any help would be greatly appreciated.

Thanks,.
 
Physics news on Phys.org
If (xn) is in l2, then given \epsilon > 0, there exists N such that

\sum _{n > 2N}|x_n|^2 < \epsilon

So at this point it suffices to show that for any N, (x1, x2, ..., x2N-1, x2N, 0, 0, ...) is in U \oplus V.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top