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.

In course of showing that the Sorgenfrey line $(\mathbb R$ endowed with the lower limit topology $\tau_l)$ is lindelöf I've made the following attempt:

I've picked up a cover $\mathcal U$ of $\mathbb R$ by the elements chosen arbitrarily from $\tau_l.$ Next for $q\in\mathbb Q$ I've choosed $G_q\in \mathcal U$ such that $q\in G_q$ to form the set $K=\{G_q:q\in\mathbb Q\}.$ My intuition says that this $K$ must cover $\mathbb R$ since no matter what irrational I choose, on its left there exists (due to denseness of $\mathbb R$) arbitrarily close rational which would get enclosed in some member of $K.$ Now here where I got stuck since I can't convert my intuition to the mathematical language. Can someone suggest me any way out?

share|improve this question

1 Answer 1

up vote 3 down vote accepted

This proof will not work. If it would, in general, we could prove that a separable space is always Lindelöf (pick a covering element for each member of a countable dense set). And there are lots of counterexamples to this idea (the square of this space is one of them).

Hint for a better proof: consider a cover by basic open sets $[a,b)$. Then consider the collection of the corresponding $(a,b)$ in $\mathbb{R}$ in the usual topology. This need not be a cover anymore, but as $\mathbb{R}$ is second countable, one can show that countably many of these open intervals have the exact same union as all these $(a,b)$. Then we only need to cover the countably many left end points that we might have missed...

share|improve this answer
    
''If it would, in general, we could prove that a separable space is always Lindelöf...'' - Loved it !! You've identified my problem with pinpoint accuracy. Thanks. –  Sugata Adhya Feb 24 '13 at 15:26
    
@SugataAdhya glad to be able to help –  Henno Brandsma Feb 24 '13 at 15:29

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.