0
$\begingroup$

No idea how to start thinking about this..any pointers would be appreciated! :]

Let $K \subseteq \mathbb R^n$ be a compact set.
Let us assume $K$ has a cover of $n$ open balls with radii $r_1,...r_n$.
Show that there exist $0<t_i<r_i$ for every $0\le i \le n$ such that $K$ can be covered by $n$ closed balls with the radii $t_1,...,t_n$.

$\endgroup$
7
  • $\begingroup$ Let $B_i = B_{r_i}(x_i)$. Consider $K \setminus \bigcup\limits_{j = 2}^n Bj$. Can you shrink $B_1$ and still have a cover? $\endgroup$ Commented Jul 8, 2013 at 17:48
  • $\begingroup$ Not necessarily? what if B1 covers all elements of $K ∖ ⋃_{j=2}^{n}Bj$ which obviously it does, and the shrinkage will make me lose one element of $K ∖ ⋃_{j=2}^{n}Bj$ cant that happen? $\endgroup$ Commented Jul 8, 2013 at 17:54
  • $\begingroup$ Well, if you shrink too much, you will lose elements. But if you shrink little enough, you won't. What property of $K \setminus \bigcup\limits_{j=2}^n B_j$ guarantees that? $\endgroup$ Commented Jul 8, 2013 at 17:56
  • $\begingroup$ Well, no idea :S $\endgroup$ Commented Jul 8, 2013 at 18:02
  • $\begingroup$ Remark: The plural of radius is "radii". $\endgroup$ Commented Jul 8, 2013 at 18:03

1 Answer 1

3
$\begingroup$

For $1 \leqslant i \leqslant n$, let $B_i = B_{r_i}(x_i) = \{x \in \mathbb{R}^d \colon \lVert x - x_i\rVert < r_i\}$.

Let $K_1 = K \setminus \bigcup\limits_{j = 2}^n B_j$. The balls $B_j$ are open, hence $K_1$ is a closed subset of $K$, therefore $K_1$ is compact. Let $s_1 := \sup \{\lVert x - x_1\rVert \colon x \in K_1\}$. Since $K_1$ is compact (and the norm/distance continuous), $K_1 = \varnothing$ or there exists a point $y_1 \in K_1$ with $\lVert y_1 - x_1\rVert = s_1$. Then $y_1 \in K$, and $y_1 \notin \bigcup\limits_{j = 2}^n B_j$, hence $y_1 \in B_1$, thus $s_1 < r_1$. Choose $0 < t_1 \in (s_1,\, r_1)$, and let $\tilde{B}_1 = B_{t_1}(x_1)$.

By definition of $s_1$ and the choice of $t_1$, $K_1 \subset \tilde{B}_1$ and therefore

$$K \subset \tilde{B}_1 \cup \bigcup_{j = 2}^n B_j.$$

Now let $K_2 = K \setminus \left(\tilde{B}_1 \cup \bigcup_{j = 3}^n B_j\right)$. With the same argument as above, we find a $0 < t_2 < r_2$ such that, setting $\tilde{B}_2 = B_{t_2}(x_2)$, we have $K \subset\bigcup\limits_{k = 1}^2 \tilde{B}_k \cup \bigcup\limits_{j=3}^n B_j$.

It should be clear how to continue, and after $n$ steps, we have $n$ $0 < t_j < r_j$ such that

$$K \subset \bigcup_{k=1}^n \tilde{B}_k = \bigcup_{k=1}^n B_{t_k}(x_k) \subset \bigcup_{k=1}^n \overline{B_{t_k}(x_k)} \subset \bigcup_{j=1}^n B_j.$$

Such a shrinking of covers is possible in far more general situations than a finite cover of a compact set.

$\endgroup$
0

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .