1
$\begingroup$

This natural property is not true always, when I mean a bounded set, I mean a set that it's contained in some ball of radius $r$. It's not always true that if this is the case, I can cover fixing a radius $u < r$ cover with balls of radius $u$, my bounded set, using only finite or even numerable balls. An example is the discrete metric, and any no numerable set ($[0,1]$) . What conditions I can impose in my space, to have this nice property? In any bounded set, not only in compact sets (or at least in open balls, that's what I need now)

  • 0
    The first letter in your post should be capitalized (since it's the first letter in a sentence). "I mean a bounded set" should be "I say a bounded set". "I mean a set that it's" should be "I mean a set that is". The next sentence should be "It's not always true, that if this is the case, I can cover my bounded set using only finitely many or even numerably many balls of a fixed radius u2011-08-24
  • 0
    "I can impose in my space" should be "can I impose on my space" ("I can" is for a statement and "can I" is for a question, and "impose in my space" sounds like we already have a specific space and the conditions are on something else).2011-08-24

1 Answers 1

1

If Countable Choice, then your property is equivalent to being a Lindelöf space.

Proof:


I assume we must have $0. $ \; $ (I am not sure if that is part of the definition of balls.)

Let $B_u(x)$ be the open ball of radius $u$ centered at $x$.

Let $\overline{B}_u(x)$ be the closed ball of radius $u$ centered at $x$.

Clearly, $\; B_u(x) \subseteq \overline{B}_u(x) \subseteq B_{\frac12 \cdot (u+r)}(x)$,
so it does not matter whether we cover with open or closed balls.

I also assume you are including finite sets as "numerable", and I include them as "countable".


part 1: Lindelöf spaces have your property

Let $C$ be the set of all open balls of radius $u$.
Since the space is Lindelöf, let $C'$ be a countable subcover of $C$.
$C'$ is a countable cover of every bounded subset, and this works for all $u$, which proves part 1.



part 2: If countable choice, then spaces with your property are Lindelöf


(CC) will mean a use of countable choice.
If the space is finite, then in space is compact, in which case the space is Lindelöf.
Assume the space is infinte. $ \; $ Let $x$ be a point in the space.
By your property, for all non-negative integers $n$,
there is a countable cover of $B_{n+1}(x)$ by balls of radius $\frac1{n+1}$.
(CC) $\;$ For all non-negative integers $n$, let $C_n$ be such a cover.
For all positive integers $n$, since $x_0\in B_n(x)$, $C_n$ is non-empty.

Define $\quad D \; = \; \displaystyle\bigcup_{n\in \{0,1,2,3,...\}} C_n$

(CC) $\;$ By the last property proven here, $D$ is countable.
Since the diameter of the balls in $C_n$ goes to zero as $n$ goes to infinity, and the space is infinite,
the number of balls in $C_n$ must go to infinity as $n$ goes to infinity. $ \; $This shows that $D$ is infinite. $\;\;$ Since $D$ is countably infinite, let $\; f : \{0,1,2,3,...\} \to D \;$ be some bijection.
(CC) $\;$ For all non-negative integers $n$, let $x_n$ be a member of $f(n)$.
That finishes the setup.
Now, let $U$ be a non-empty open subset of the space, and let $y$ be a member of $U$.
Let $r$ be a positive real number such that $\; B_r(y) \subseteq U \;$.
Since the diameter of the balls in $C_n$ goes to zero as $n$ goes to infinity, there is an $n$ such that the diameter of the balls in $C_n$ is less than $r$. $\;\;$ Let $m$ be such an $n$.
Let $B$ be a member of $C_m$ such that $y\in B$. $ \; $ By construction, $\; x_{f^{-1}(B)} \in B \subseteq B_r(y) \subseteq U \;$.
This works for all non-empty open subsets $U$ of the space, so the space is separable.
(CC) $\;$ Therefore, by Theorem 3.12, the space is Lindelof.


QED

  • 0
    @ Daniel - I'll give a proof if you fix the grammar and capitalization in your post.2011-08-24
  • 1
    I agree that this is a particularly badly written question. However, I wouldn't focus on the grammar and capitalization; the site should be accessible to non-native speakers who might not be able to produce perfect grammar. I think the more important flaw is the lack of structure in the exposition of the ideas; ideas are begun, interrupted and then partially repeated, and the implied universal quantifier over $u$ isn't immediately clear. (By the way, the ping doesn't work if you put a space between the '@' and the name.)2011-08-24
  • 0
    If he's a non-native speaker, he should give some indication of that on his user page. (There's a ping?)2011-08-24
  • 1
    I disagree. Your user page gives no indication that you're not a native speaker of Lindelöf's native language, whose name you misspelled, and I don't see why it should. Roughly 95% of all people are not native English speakers. By "ping" I mean the notification you get e.g. when I post a comment under your answer. You can explicitly send one of these using the '@' directly followed by (at least the first three letters of) a user name.2011-08-24
  • 0
    That raises an interesting question: does missing an accent qualify as misspelling? $\; $ If I had seen such an indication, I would have explained in a comment exactly how he should fix his post. $\; $ If he says he's not a native English speaker, I _will_ do that (and give the proof).2011-08-24
  • 3
    This is not an accent; it's a diacritic that turns the vowel into a merely historically related vowel. In English, which experienced the same vowel shifts but denotes the shifted vowels by different letters, the difference would correspond e.g. to "men" being misspelled as "man". (See http://en.wikipedia.org/wiki/Trema_(diacritic).)2011-08-24
  • 1
    @Ricky: The specific English errors in Daniel’s questions make it pretty obvious that he’s not a native speaker of English, but he generally manages to make himself understood.2011-08-24
  • 0
    @joriki: While I very much agree with your stance in this argument, some keyboards are not equipped with ö and similar letters. I know that if I'm writing Godel's or Erdos' name, unless there is a very ready source for a copy/paste - I will not use any letter which I cannot directly type.2011-08-24
  • 1
    @Asaf: Since one has to be online to post a question, one has available at that time that ever ready source called Google. :-) Searching for "Lindelof", "Godel" and "Erdos" will get you plenty of copyable instances of the names. If you ever have to write an umlaut without that vast resource at your fingertips, it's worth knowing that in German they are replaced by "ae", "oe" and "ue", respectively when they're not available, and [Wikipedia tells me](http://en.wikipedia.org/wiki/Trema_(diacritic)#Borrowing_of_German_umlaut_notation) that this is also done to varying degrees in other languages.2011-08-24
  • 0
    @joriki: I always felt strange writing "Goedel", but I guess I should start doing so. :-)2011-08-24
  • 0
    Excuse my grammar, the problem is I can not speak English. I can read and listen English very well. The problem is to talk and write, because I only know the words but do not know at that time are, or anything like that. I worry to study some grammar, and I take to ask if they know where I could do it...2011-08-24
  • 0
    @Asaf: If you use Windows, there’s a very nice freeware app called [AllChars](http://allchars.zwolnet.com/) that makes it very easy; it more or less imitates the Linux compose key functionality. *Erdős* is still a nuisance to get exactly right, though: it requires a double acute (U+0151) rather than a diaresis/umlaut (U+00F6).2011-08-24
  • 1
    @Brian: God forbid! :-) I use Arch Linux with awesome as a windows manager :-)2011-08-24