Rasalhague
- 1,383
- 2
Dan Ma's proof that the Sorgenfrey line is Lindelöf (part A) seems to rely on the assumption that if every basic open cover has a countable subcover, then every open cover has a countable subcover. In trying to prove this, I got a stronger result, namely that if every basic open cover has a countable subcover, then every open cover is countable. If this correct? Here is my proof:
Every element C_{\lambda} of an arbitrary open cover \cal{C}=\left \{ C_\lambda | \lambda\in \Lambda \right \} is a union of basic open sets, so we can choose a countable cover \cal{B}, each of whose elements is a subset of some C_{\lambda}\in\cal{C}. By the axiom of choice, for each C_\lambda\in\cal{C} we can choose one B_{C_\lambda} \in \cal{B}. The set \beta = \left \{ B_{C_\lambda} | C_\lambda\in\cal{C} \right \} of these so-chosen B_{C_\lambda} is a subset of \cal{B}, and \cal{B} is countable, therefore \beta is countable. There is a natural bijection f:\beta\rightarrow\cal{C}, specified by f(B_{C_\lambda})=C_\lambda. Therefore the arbitrary open cover \cal{C} is countable. \blacksquare
Every element C_{\lambda} of an arbitrary open cover \cal{C}=\left \{ C_\lambda | \lambda\in \Lambda \right \} is a union of basic open sets, so we can choose a countable cover \cal{B}, each of whose elements is a subset of some C_{\lambda}\in\cal{C}. By the axiom of choice, for each C_\lambda\in\cal{C} we can choose one B_{C_\lambda} \in \cal{B}. The set \beta = \left \{ B_{C_\lambda} | C_\lambda\in\cal{C} \right \} of these so-chosen B_{C_\lambda} is a subset of \cal{B}, and \cal{B} is countable, therefore \beta is countable. There is a natural bijection f:\beta\rightarrow\cal{C}, specified by f(B_{C_\lambda})=C_\lambda. Therefore the arbitrary open cover \cal{C} is countable. \blacksquare