Question #115200

Prove that the Hillbert space is separable


1
Expert's answer
2020-05-13T18:38:54-0400

A Hilbert space H is separable (that is, has a countable dense subset) if and only if it has one countable orthonormal basis if and only if every orthonormal basis for H is countable.

Proof.(    )( \implies )   Suppose HH is separable and consider any orthonormal basis SHS \subset H. Then if ϕ1,ϕ2S\phi_1,\phi_2\in S ∈ and ϕ1/=ϕ2\phi_1 \mathrlap{\,/}{=}\phi_2 we conclude ϕ1ϕ2=ϕ1ϕ2,ϕ1ϕ2=2\begin{Vmatrix} \phi_1 - \phi_2 \end{Vmatrix} = \sqrt{\lang \phi_1 - \phi_2 , \phi_1 - \phi_2 \rang} = \sqrt{2}. Thus SHS \subset H has the discrete topology. Now HH a separable metric space     \implies SS is a separable metric space     \implies SS S has a countable dense subset. But SS is the only subset of itself that is dense in SS and so SS must be countable.

(    )(\impliedby)  Suppose for the converse that there is one countable orthonormal basis S={ϕ1,ϕ2,...}S = \{\phi_1, \phi_2, . . .\}

for HH. We look at the case k=R\Bbbk = \R (HH a real Hilbert space) first. It is quite easy to check that the sets 

Dn={i=1nqiϕi:qiQ for 1in}D_n =\begin{Bmatrix} \displaystyle\sum_ {i=1} ^n q_i\phi_i : q_i \in Q \ for\ 1 ≤ i ≤ n \end{Bmatrix}

are each countable and that their union D=n=1DnD = \bigcup_{n=1} ^∞ D_n is countable and dense in HH. The closure of each DnD_n n is easily seen to be the R-linear span of ϕ1,ϕ2,...,ϕn,\phi_1, \phi_2,...,\phi_n, and so the closure of DD includes all finite linear combinations i=1nxiϕi\displaystyle\sum_ {i=1} ^n x_i\phi_i.  But, each xHx \in H is a limit of such finite linear combinations. Hence the closure of DD is all of HH.  As DD is countable, this shows that HH must be separable. In the complex case (HH a Hilbert space over k=C\Bbbk = \Complex ) we must take qiQ+iQq_i\in Q+iQ instead, so that we can get all finite C\Complex -linear combinations of the ϕi\phi_i in the closure of DD.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS