Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $\mathcal{H}_1$ and $\mathcal{H}_2$ be Hilbert spaces and $T: \mathcal{H}_1 \rightarrow \mathcal{H}_2$ a compact operator.

I want to show that $(\ker T)^\perp$ and $\text{ran}\ T$ are separable.

Since $T$ maps to a Hilbert space, there is a sequence $(T_n)_{n \in \mathbb{N}}$ of finite-dimensional operators that converges to $T$ in the operator norm. Unfortunately, I was unable to make proper use of this fact. Or do I have to use another approach?

I don't know much about compact operators between Hilbert spaces...

Can someone help me to get started on this?

[Update on the Definitions I use here:]

A Hilbert space is an inner product space $(\mathcal{H}, \langle .,.\rangle)$ that is complete with respect to the norm that is induced by $\|x\|=\langle x,x\rangle^{1/2}$.

A linear space $\mathcal{X}$ is separable iff there exists a dense countable subset of $\mathcal{X}$, where countable means finite or countably infinite.

share|improve this question
    
Some people include separable in the definition of a Hilbert space. I take it you are not one of those people? (I just want to be clear the statement on the problem.) –  Potato Jul 9 '13 at 23:07
    
Oh, I didn't know that. I will clarify the definitions. Thanks for your remark! –  Amarus Jul 9 '13 at 23:10
add comment

1 Answer

Here are some remarks to get you started.

  • $T$ is compact iff $T^*$ is compact.
  • $\ker(T)^\bot = \overline{ \mathrm{ran}(T^*)}$.
  • $\mathcal{K} \subset \mathcal{H}$ is separable iff $\overline{ \mathcal{K}}$ is separable.

With knowledge of these facts, you should be able to reduce one of your statements to the other. You might also consider trying to prove a lemma along the lines of

  • If $T_n \to T$ in operator norm, then $\mathrm{ran}(T) \subset \overline{ \bigcup_n \mathrm{ran}(T_n)}$.
share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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