Let $K$ be a compact subset of the open and connected set $\Omega\subseteq\mathbb{R}^n$, $B_\varepsilon$ the ball centered at the origin of radius $\varepsilon$. Is it true the intuitive fact that there exists an $\varepsilon>0$ and a smooth curve $\gamma_K:I\to\mathbb{R}^n$ such that $K\subseteq\gamma_K+B_\varepsilon\subseteq\Omega$?
1 Answer
Here's a quick answer, but you should make sure that everything I'm saying is justified.
First, since $K$ is compact, there is a finite set of points $\{p_i\}_{i=1}^N$ such that $K$ is covered by the balls $B_{\epsilon/2}(p_i)$.
Second, we can construct a piecewise-linear curve $\gamma$ by connecting $p_1$ to $p_2$ with a line, $p_2$ to $p_3$, and so on.
Third, you can always find a smooth, embedded curve $\gamma_K$ within a distance of $\epsilon/2$ of $\gamma$.
Therefore, any point in $K$ is within a distance of $\epsilon$ of $\gamma_K$, so $$K \subseteq \gamma_K + B_\epsilon$$ as desired.
This construction can be modified without much effort to make sure that $\gamma_K + B_\epsilon$ lies inside this set $\Omega$ as well (Hint: since $K$ is compact, the distance between $K$ and the boundary of $\Omega$ is bounded away from zero).
-
$\begingroup$ Officially you cannot connect by a line $p_1$ and $p_2$ because this line can lie outside of $\Omega$. The idea is clear, the problem is the (maybe combinatorial) formalization of the existence of a path that visit all the centers of these balls without going out of $\Omega$. $\endgroup$– KoshCommented Jul 13, 2020 at 19:56
-
1$\begingroup$ Since $\Omega \subset \mathbb{R}^n$ is (path) connected, you can connect the $p_i$ inside it. That should help you construct $\gamma_K$ to satisfy all requirements. $\endgroup$ Commented Jul 13, 2020 at 20:56
-
$\begingroup$ The third point can be simplified: one does not need smooth approximation. Instead, one can re-parametrize each affine segment of $\gamma$, in such a way that derivatives of all order vanish at any node, which makes the whole curve smooth, with the same image as $\gamma$. In other words, you can make any zig-zag curve smooth, if you stop whenever you need to make an angle. $\endgroup$ Commented Jul 13, 2020 at 21:05
-
$\begingroup$ The problem of the proof is not smoothness. It is to write down rigorously an "algorithm" which builds the curve (piecewise linear, even just continuous, is more than fine) given a linked sequence of balls (because one could be obliged to go through the same balls several times). I was hoping someone already faced such a question and could give a rigorous and simple answer :) The answer given by Rohil cover the simple part that anyone trying to prove the result would write down (I don't know how to express this without appearing rude, but it is not my intention) $\endgroup$– KoshCommented Jul 13, 2020 at 21:14
-
$\begingroup$ I suppose the "piecewise-linear" approach is only rigorous if the set is convex, but as mentioned above it is easy to adapt. If you would like an "algorithm", then you can just connect any pair of two points by curves that pairwise do not intersect (as long as $n \geq 3$). This is some complete graph, and then you just apply your favorite graph theory algorithm for extracting a path that visits all vertices exactly once. $\endgroup$ Commented Jul 14, 2020 at 1:38