Skip to main content
Totally rewritten solution
Source Link
Taras Banakh
  • 41.8k
  • 3
  • 74
  • 183

Let us show how to find such a retraction for $n=2$ (the general case is analogous but technically more complicatedI do not know if this method generalizes to higher dimensions).

Without loss of generalityReplacing the triangulation by a finer triangulation, we can assume that for each triangle $T$ with $T\not\subseteq C$, one vertex of the triangulation either$T$ does not belong to $C$ meets the.

How to find such a triangulations? Assuming that $T\not\subseteq C$, we can find an interior point $v$ of $T$ that does not belong to $C$ and replace the triangle $T$ by 3 subtriangles having $v$ as a vertex.

Also we can assume that either $T\subseteq\mathbb R^2\setminus C$ or else$T$ has a vertex in $C$ intersects at most two sides of the triangle. IfAssuming that $T$ has no vertices in $C$ intersects three sides of the triangle but does not intersect the interior$T\cap C\ne\emptyset$, then we can divide this triangle intochoose a point $c\in T\cap C$ and replace the triange $T$ by two or three triangles having at most two sides intersecting $C$$c$ as a vartex.

LetTherefore, we lose no generality assuming that each triangle $K^{(0)}$ be the set of vertices$T$ of the triangulation and lethas one of the following properties:

  1. $T\subseteq C$;

  2. $T\cap C=\emptyset$;

  3. $T$ has one vertex in $C$ and one vertex outside of $C$;

  4. If two vertices $u,v$ of $T$ do not belong to $C$, then the side $[u,v]$ does not intersect $C$.

A triangle $K$$T$ will be the family of subsetscalled $\sigma\subset K^{(0)}$ whose convex combinations are verticesdifficult if it has one vertex say $u$ outside $C$, edges or triangles oftwo vertices $v,w$ in $C$ and the triangulationside $[v,w]$ is not a subset of $C$. In this case choose any point $c[v,w]\in [v,w]\setminus C$. The setpoints $K$$c[v,w]$ can be written aschosen so that for two difficult triangle sharing the union $K=\bigcup_{n=1}^3K^{(n)}$ wherecommon side $K^{(n)}=\{\sigma\in K:\sigma$ has exactly$[v,w]$ the point $n+1$ elements$\}$$c[v,w]$ is the same.

ForNow for every triangle $T$ of the triangulation we define a setfunction $\sigma$$r_T\setminus C:T\to T\setminus C$ such that $r_T\circ r_T=r_T$ as follows. In case (1), let $\bar\sigma$$r_T$ be the convex hull ofempty map and in case $\sigma$,(2) $\partial\sigma$$r_T$ be the combinatorial boundaryidenity map of $\bar\sigma$$T$. In the remaining cases, the triangle $T$ has one vertex in $C$ and one vertex outside of $\sigma^\circ=\bar\sigma\setminus\partial\sigma$$C$. If the triangle $T$ is not difficult, then it has two vertices $u,v$ such that the side $[u,v]$ either is contained in $C$ or is disjoint with $C$. If $[u,v]$ is contained in $C$, then let $r_T:T\setminus C\to\{w\}$ be the combinatorial interiorconstant map into the unique vertex $w\notin C$ of $\bar\sigma$$T$.

LetIf $K_C=\{\sigma\in K:\bar\sigma\cap C\ne\emptyset\}$$[u,v]\cap C=\emptyset$, then the third vertex $w$ of $T$ belongs to $C$ and we can apply the Urysohn lemma to find a function $V=\bigcup\{\sigma^\circ:\sigma\in K_C\}$$r_T:T\setminus C\to[u,v]$ such that $r_T[[w,u]\setminus C]=\{u\}$, $r_T[[w,v]\setminus C]=\{v\}$, and $r_T(x)=x$ for every $x\in [u,v]$.

Then $V$ is an open neighborhoodIt remains to consider the case of a difficult triangle $C$$T$. We claim that there existsSuch a retraction oftriangle has one vertex $\mathbb R^2\setminus C$ onto$u$ outside of $\mathbb R^2\setminus V$. For every simplex$C$, two vertices $\sigma\in K^{(2)}\cap K_C$ the set$v,w$ in $C$ either intesects $\sigma^\circ$ of intersect at most two 1-simplexes ofand the boundarypoint $\partial \sigma$$c[v,w]\in [v,w]\setminus C$. In bothTwo cases we can construct a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. For every $\sigma\in K^{(2)}\setminus K_C$ let $r_\sigma$ be the identity map of $\bar\sigma$are possible.

  1. There exists a path $\gamma:[0,1]\to T\setminus C$ such that $\gamma(0)=u$ and $\gamma(1)=c[v,w]$. We can assume that $\gamma$ is injective and hence its image $A_T=\gamma[0,1]$ is an arc with endpoints $u$ and $c[v,w]$. Using the Urysohn Lemma, we can find a continuous function $r_T:T\setminus C\to A_T$ such that $r_T[([u,v]\cup[u,w])\setminus C]\subseteq \{u\}$, $r_T[[v,w]\setminus C]\subseteq\{c[v,w]\}$ and $r_T(a)=a$ for every $a\in A_T$.

  2. No such a path $\gamma$ exists. Then the points $u$ and $c[v,w]$ belong to distinct connected components of $T\setminus C$. In this case we can choose a continuous map $r_T:T\setminus C\to\{u,c[v,w]\}$ such that $r_T[([u,v]\cup[u,w])\setminus C]\subseteq\{u\}$ and $r_T[[v,w]\setminus C]\subset\{c[v,w]\}$.

The uniondefinitions of the retractionmaps $r_\sigma$$r_T$ ensure that they agree on the intersections of their domains. Consequently, the union $\sigma\in K^{(2)}$$r=\bigcup_T r_T$ of these maps is a continuous function $r:\mathbb R^2\setminus C\to\mathbb R^2\setminus C$ such that $r\circ r=r$. So, $r$ is a retraction of $\mathbb R^2\setminus C$ onto the setclosed subset $S=(\mathbb R^2\setminus V)\cup\bigcup_{\sigma\in K^{(1)}\cap K_C}(\bar\sigma\setminus C)$. Then do$F$ which can be written as the same withunion of the set $K^{(1)}\cap K_C$: for every 1-simplextriangles of the triangulation that do not intersect $\sigma\in K^{(1)}\cap K_C$$C$, usesome vertices of the facttriangles that $\bar\sigma\cap C\ne\emptyset$ and find a retractionintersect $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. The union of those retractions$C$ and the identity maps $r_\sigma$ forarcs $\sigma\in K^{(2)}\setminus K_C$ retract the set$A_T$ of difficult triangles $S$ onto(of the set $$S'=(\mathbb R^2\setminus V)\cup \bigcup_{\sigma\in K^{(2)}\cap K_C}(\sigma^{(0)}\setminus C).$$first type).

SinceThe choice of the settriangulation $S'\setminus(\mathbb R^2\setminus V)$$T$ (as sufficiently fine) implies that $V=\mathbb R^2\setminus F$ is finite, here exists a retrationneighborhood of $S'$ onto$C$ with $\mathbb R^2\setminus V$$\bar V\subset U$. So, our final retractionThen $\mathbb R^2\setminus C\to\mathbb R^2\setminus V$$r{\restriction}U\setminus C$ is the compositionrequired retraction of the retractions $\mathbb R^2\setminus C\to S\to S'\to\mathbb R^2\setminus V$$U\setminus C$ onto $U\setminus V$.

Let us show how to find such a retraction for $n=2$ (the general case is analogous but technically more complicated).

Without loss of generality we can assume that for each triangle of the triangulation either $C$ meets the interior of the triangle or else $C$ intersects at most two sides of the triangle. If $C$ intersects three sides of the triangle but does not intersect the interior, then we can divide this triangle into two triangles having at most two sides intersecting $C$.

Let $K^{(0)}$ be the set of vertices of the triangulation and let $K$ be the family of subsets $\sigma\subset K^{(0)}$ whose convex combinations are vertices, edges or triangles of the triangulation. The set $K$ can be written as the union $K=\bigcup_{n=1}^3K^{(n)}$ where $K^{(n)}=\{\sigma\in K:\sigma$ has exactly $n+1$ elements$\}$.

For a set $\sigma$ let $\bar\sigma$ be the convex hull of $\sigma$, $\partial\sigma$ be the combinatorial boundary of $\bar\sigma$ and $\sigma^\circ=\bar\sigma\setminus\partial\sigma$ be the combinatorial interior of $\bar\sigma$.

Let $K_C=\{\sigma\in K:\bar\sigma\cap C\ne\emptyset\}$ and $V=\bigcup\{\sigma^\circ:\sigma\in K_C\}$.

Then $V$ is an open neighborhood of $C$. We claim that there exists a retraction of $\mathbb R^2\setminus C$ onto $\mathbb R^2\setminus V$. For every simplex $\sigma\in K^{(2)}\cap K_C$ the set $C$ either intesects $\sigma^\circ$ of intersect at most two 1-simplexes of the boundary $\partial \sigma$. In both cases we can construct a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. For every $\sigma\in K^{(2)}\setminus K_C$ let $r_\sigma$ be the identity map of $\bar\sigma$.

The union of the retraction $r_\sigma$, $\sigma\in K^{(2)}$, is a retraction of $\mathbb R^2\setminus C$ onto the set $S=(\mathbb R^2\setminus V)\cup\bigcup_{\sigma\in K^{(1)}\cap K_C}(\bar\sigma\setminus C)$. Then do the same with the set $K^{(1)}\cap K_C$: for every 1-simplex $\sigma\in K^{(1)}\cap K_C$, use the fact that $\bar\sigma\cap C\ne\emptyset$ and find a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. The union of those retractions and the identity maps $r_\sigma$ for $\sigma\in K^{(2)}\setminus K_C$ retract the set $S$ onto the set $$S'=(\mathbb R^2\setminus V)\cup \bigcup_{\sigma\in K^{(2)}\cap K_C}(\sigma^{(0)}\setminus C).$$

Since the set $S'\setminus(\mathbb R^2\setminus V)$ is finite, here exists a retration of $S'$ onto $\mathbb R^2\setminus V$. So, our final retraction $\mathbb R^2\setminus C\to\mathbb R^2\setminus V$ is the composition of the retractions $\mathbb R^2\setminus C\to S\to S'\to\mathbb R^2\setminus V$.

Let us show how to find such a retraction for $n=2$ (I do not know if this method generalizes to higher dimensions).

Replacing the triangulation by a finer triangulation, we can assume that for each triangle $T$ with $T\not\subseteq C$, one vertex of $T$ does not belong to $C$.

How to find such a triangulations? Assuming that $T\not\subseteq C$, we can find an interior point $v$ of $T$ that does not belong to $C$ and replace the triangle $T$ by 3 subtriangles having $v$ as a vertex.

Also we can assume that either $T\subseteq\mathbb R^2\setminus C$ or $T$ has a vertex in $C$. Assuming that $T$ has no vertices in $C$ but $T\cap C\ne\emptyset$, we can choose a point $c\in T\cap C$ and replace the triange $T$ by two or three triangles having $c$ as a vartex.

Therefore, we lose no generality assuming that each triangle $T$ of the triangulation has one of the following properties:

  1. $T\subseteq C$;

  2. $T\cap C=\emptyset$;

  3. $T$ has one vertex in $C$ and one vertex outside of $C$;

  4. If two vertices $u,v$ of $T$ do not belong to $C$, then the side $[u,v]$ does not intersect $C$.

A triangle $T$ will be called difficult if it has one vertex say $u$ outside $C$, two vertices $v,w$ in $C$ and the side $[v,w]$ is not a subset of $C$. In this case choose any point $c[v,w]\in [v,w]\setminus C$. The points $c[v,w]$ can be chosen so that for two difficult triangle sharing the common side $[v,w]$ the point $c[v,w]$ is the same.

Now for every triangle $T$ of the triangulation we define a function $r_T\setminus C:T\to T\setminus C$ such that $r_T\circ r_T=r_T$ as follows. In case (1), let $r_T$ be the empty map and in case (2) $r_T$ be the idenity map of $T$. In the remaining cases, the triangle $T$ has one vertex in $C$ and one vertex outside of $C$. If the triangle $T$ is not difficult, then it has two vertices $u,v$ such that the side $[u,v]$ either is contained in $C$ or is disjoint with $C$. If $[u,v]$ is contained in $C$, then let $r_T:T\setminus C\to\{w\}$ be the constant map into the unique vertex $w\notin C$ of $T$.

If $[u,v]\cap C=\emptyset$, then the third vertex $w$ of $T$ belongs to $C$ and we can apply the Urysohn lemma to find a function $r_T:T\setminus C\to[u,v]$ such that $r_T[[w,u]\setminus C]=\{u\}$, $r_T[[w,v]\setminus C]=\{v\}$, and $r_T(x)=x$ for every $x\in [u,v]$.

It remains to consider the case of a difficult triangle $T$. Such a triangle has one vertex $u$ outside of $C$, two vertices $v,w$ in $C$ and the point $c[v,w]\in [v,w]\setminus C$. Two cases are possible.

  1. There exists a path $\gamma:[0,1]\to T\setminus C$ such that $\gamma(0)=u$ and $\gamma(1)=c[v,w]$. We can assume that $\gamma$ is injective and hence its image $A_T=\gamma[0,1]$ is an arc with endpoints $u$ and $c[v,w]$. Using the Urysohn Lemma, we can find a continuous function $r_T:T\setminus C\to A_T$ such that $r_T[([u,v]\cup[u,w])\setminus C]\subseteq \{u\}$, $r_T[[v,w]\setminus C]\subseteq\{c[v,w]\}$ and $r_T(a)=a$ for every $a\in A_T$.

  2. No such a path $\gamma$ exists. Then the points $u$ and $c[v,w]$ belong to distinct connected components of $T\setminus C$. In this case we can choose a continuous map $r_T:T\setminus C\to\{u,c[v,w]\}$ such that $r_T[([u,v]\cup[u,w])\setminus C]\subseteq\{u\}$ and $r_T[[v,w]\setminus C]\subset\{c[v,w]\}$.

The definitions of the maps $r_T$ ensure that they agree on the intersections of their domains. Consequently, the union $r=\bigcup_T r_T$ of these maps is a continuous function $r:\mathbb R^2\setminus C\to\mathbb R^2\setminus C$ such that $r\circ r=r$. So, $r$ is a retraction onto the closed subset $F$ which can be written as the union of the triangles of the triangulation that do not intersect $C$, some vertices of the triangles that intersect $C$ and the arcs $A_T$ of difficult triangles (of the first type).

The choice of the triangulation $T$ (as sufficiently fine) implies that $V=\mathbb R^2\setminus F$ is a neighborhood of $C$ with $\bar V\subset U$. Then $r{\restriction}U\setminus C$ is the required retraction of $U\setminus C$ onto $U\setminus V$.

added 2 characters in body
Source Link
Taras Banakh
  • 41.8k
  • 3
  • 74
  • 183

Let us show how to find such a retraction for $n=2$ (the general case is analogous but technically more complicated).

Given a compact set $C\subset\mathbb R^2$ and an open neighborhood $U\subseteq\mathbb R^2$ of $C$, choose a triangulation on $\mathbb R^2$ so fine that no triangle of the triangulation meets $C$ and $\mathbb R^2\setminus U$ simultaneously.

Without loss of generality we can assume that for each triangle of the triangulation either $C$ meets the interior of the triangle or else $C$ intersects at most two sides of the triangle. If $C$ intersects three sides of the triangle but does not intersect the interior, then we can divide this triangle into two triangles having at most two sides intersecting $C$.

Let $K^{(0)}$ be the set of vertices of the triangulation and let $K$ be the family of subsets $\sigma\subset K^{(0)}$ whose convex combinations are vertices, edges or triangles of the triangulation. The set $K$ can be written as the union $K=\bigcup_{n=1}^3K^{(n)}$ where $K^{(n)}=\{\sigma\in K:\sigma$ has exactly $n$$n+1$ elements$\}$.

For a set $\sigma$ let $\bar\sigma$ be the convex hull of $\sigma$, $\partial\sigma$ be the combinatorial boundary of $\bar\sigma$ and $\sigma^\circ=\bar\sigma\setminus\partial\sigma$ be the combinatorial interior of $\bar\sigma$.

Let $K_C=\{\sigma\in K:\bar\sigma\cap C\ne\emptyset\}$ and $V=\bigcup\{\sigma^\circ:\sigma\in K_C\}$.

Then $V$ is an open neighborhood of $C$. We claim that there exists a retraction of $\mathbb R^2\setminus C$ onto $\mathbb R^2\setminus V$. For every simplex $\sigma\in K^{(2)}\cap K_C$ the set $C$ either intesects $\sigma^\circ$ of intersect at most two 1-simplexes of the boundary $\partial \sigma$. In both cases we can construct a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. For every $\sigma\in K^{(2)}\setminus K_C$ let $r_\sigma$ be the identity map of $\bar\sigma$.

The union of the retraction $r_\sigma$, $\sigma\in K^{(2)}$, is a retraction of $\mathbb R^2\setminus C$ onto the set $S=(\mathbb R^2\setminus V)\cup\bigcup_{\sigma\in K^{(1)}\cap K_C}(\bar\sigma\setminus C)$. Then do the same with the set $K^{(1)}\cap K_C$: for every 1-simplex $\sigma\in K^{(1)}\cap K_C$, use the fact that $\bar\sigma\cap C\ne\emptyset$ and find a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. The union of those retractions and the identity maps $r_\sigma$ for $\sigma\in K^{(2)}\setminus K_C$ retract the set $S$ onto the set $$S'=(\mathbb R^2\setminus V)\cup \bigcup_{\sigma\in K^{(2)}\cap K_C}(\sigma^{(0)}\setminus C).$$

Since the set $S'\setminus(\mathbb R^2\setminus V)$ is finite, here exists a retration of $S'$ onto $\mathbb R^2\setminus V$. So, our final retraction $\mathbb R^2\setminus C\to\mathbb R^2\setminus V$ is the composition of the retractions $\mathbb R^2\setminus C\to S\to S'\to\mathbb R^2\setminus V$.

Let us show how to find such a retraction for $n=2$ (the general case is analogous but technically more complicated).

Given a compact set $C\subset\mathbb R^2$ and an open neighborhood $U\subseteq\mathbb R^2$ of $C$, choose a triangulation on $\mathbb R^2$ so fine that no triangle of the triangulation meets $C$ and $\mathbb R^2\setminus U$ simultaneously.

Without loss of generality we can assume that for each triangle of the triangulation either $C$ meets the interior of the triangle or else $C$ intersects at most two sides of the triangle. If $C$ intersects three sides of the triangle but does not intersect the interior, then we can divide this triangle into two triangles having at most two sides intersecting $C$.

Let $K^{(0)}$ be the set of vertices of the triangulation and let $K$ be the family of subsets $\sigma\subset K^{(0)}$ whose convex combinations are vertices, edges or triangles of the triangulation. The set $K$ can be written as the union $K=\bigcup_{n=1}^3K^{(n)}$ where $K^{(n)}=\{\sigma\in K:\sigma$ has exactly $n$ elements$\}$.

For a set $\sigma$ let $\bar\sigma$ be the convex hull of $\sigma$, $\partial\sigma$ be the combinatorial boundary of $\bar\sigma$ and $\sigma^\circ=\bar\sigma\setminus\partial\sigma$ be the combinatorial interior of $\bar\sigma$.

Let $K_C=\{\sigma\in K:\bar\sigma\cap C\ne\emptyset\}$ and $V=\bigcup\{\sigma^\circ:\sigma\in K_C\}$.

Then $V$ is an open neighborhood of $C$. We claim that there exists a retraction of $\mathbb R^2\setminus C$ onto $\mathbb R^2\setminus V$. For every simplex $\sigma\in K^{(2)}\cap K_C$ the set $C$ either intesects $\sigma^\circ$ of intersect at most two 1-simplexes of the boundary $\partial \sigma$. In both cases we can construct a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. For every $\sigma\in K^{(2)}\setminus K_C$ let $r_\sigma$ be the identity map of $\bar\sigma$.

The union of the retraction $r_\sigma$, $\sigma\in K^{(2)}$, is a retraction of $\mathbb R^2\setminus C$ onto the set $S=(\mathbb R^2\setminus V)\cup\bigcup_{\sigma\in K^{(1)}\cap K_C}(\bar\sigma\setminus C)$. Then do the same with the set $K^{(1)}\cap K_C$: for every 1-simplex $\sigma\in K^{(1)}\cap K_C$, use the fact that $\bar\sigma\cap C\ne\emptyset$ and find a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. The union of those retractions and the identity maps $r_\sigma$ for $\sigma\in K^{(2)}\setminus K_C$ retract the set $S$ onto the set $$S'=(\mathbb R^2\setminus V)\cup \bigcup_{\sigma\in K^{(2)}\cap K_C}(\sigma^{(0)}\setminus C).$$

Since the set $S'\setminus(\mathbb R^2\setminus V)$ is finite, here exists a retration of $S'$ onto $\mathbb R^2\setminus V$. So, our final retraction $\mathbb R^2\setminus C\to\mathbb R^2\setminus V$ is the composition of the retractions $\mathbb R^2\setminus C\to S\to S'\to\mathbb R^2\setminus V$.

Let us show how to find such a retraction for $n=2$ (the general case is analogous but technically more complicated).

Given a compact set $C\subset\mathbb R^2$ and an open neighborhood $U\subseteq\mathbb R^2$ of $C$, choose a triangulation on $\mathbb R^2$ so fine that no triangle of the triangulation meets $C$ and $\mathbb R^2\setminus U$ simultaneously.

Without loss of generality we can assume that for each triangle of the triangulation either $C$ meets the interior of the triangle or else $C$ intersects at most two sides of the triangle. If $C$ intersects three sides of the triangle but does not intersect the interior, then we can divide this triangle into two triangles having at most two sides intersecting $C$.

Let $K^{(0)}$ be the set of vertices of the triangulation and let $K$ be the family of subsets $\sigma\subset K^{(0)}$ whose convex combinations are vertices, edges or triangles of the triangulation. The set $K$ can be written as the union $K=\bigcup_{n=1}^3K^{(n)}$ where $K^{(n)}=\{\sigma\in K:\sigma$ has exactly $n+1$ elements$\}$.

For a set $\sigma$ let $\bar\sigma$ be the convex hull of $\sigma$, $\partial\sigma$ be the combinatorial boundary of $\bar\sigma$ and $\sigma^\circ=\bar\sigma\setminus\partial\sigma$ be the combinatorial interior of $\bar\sigma$.

Let $K_C=\{\sigma\in K:\bar\sigma\cap C\ne\emptyset\}$ and $V=\bigcup\{\sigma^\circ:\sigma\in K_C\}$.

Then $V$ is an open neighborhood of $C$. We claim that there exists a retraction of $\mathbb R^2\setminus C$ onto $\mathbb R^2\setminus V$. For every simplex $\sigma\in K^{(2)}\cap K_C$ the set $C$ either intesects $\sigma^\circ$ of intersect at most two 1-simplexes of the boundary $\partial \sigma$. In both cases we can construct a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. For every $\sigma\in K^{(2)}\setminus K_C$ let $r_\sigma$ be the identity map of $\bar\sigma$.

The union of the retraction $r_\sigma$, $\sigma\in K^{(2)}$, is a retraction of $\mathbb R^2\setminus C$ onto the set $S=(\mathbb R^2\setminus V)\cup\bigcup_{\sigma\in K^{(1)}\cap K_C}(\bar\sigma\setminus C)$. Then do the same with the set $K^{(1)}\cap K_C$: for every 1-simplex $\sigma\in K^{(1)}\cap K_C$, use the fact that $\bar\sigma\cap C\ne\emptyset$ and find a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. The union of those retractions and the identity maps $r_\sigma$ for $\sigma\in K^{(2)}\setminus K_C$ retract the set $S$ onto the set $$S'=(\mathbb R^2\setminus V)\cup \bigcup_{\sigma\in K^{(2)}\cap K_C}(\sigma^{(0)}\setminus C).$$

Since the set $S'\setminus(\mathbb R^2\setminus V)$ is finite, here exists a retration of $S'$ onto $\mathbb R^2\setminus V$. So, our final retraction $\mathbb R^2\setminus C\to\mathbb R^2\setminus V$ is the composition of the retractions $\mathbb R^2\setminus C\to S\to S'\to\mathbb R^2\setminus V$.

Source Link
Taras Banakh
  • 41.8k
  • 3
  • 74
  • 183

Let us show how to find such a retraction for $n=2$ (the general case is analogous but technically more complicated).

Given a compact set $C\subset\mathbb R^2$ and an open neighborhood $U\subseteq\mathbb R^2$ of $C$, choose a triangulation on $\mathbb R^2$ so fine that no triangle of the triangulation meets $C$ and $\mathbb R^2\setminus U$ simultaneously.

Without loss of generality we can assume that for each triangle of the triangulation either $C$ meets the interior of the triangle or else $C$ intersects at most two sides of the triangle. If $C$ intersects three sides of the triangle but does not intersect the interior, then we can divide this triangle into two triangles having at most two sides intersecting $C$.

Let $K^{(0)}$ be the set of vertices of the triangulation and let $K$ be the family of subsets $\sigma\subset K^{(0)}$ whose convex combinations are vertices, edges or triangles of the triangulation. The set $K$ can be written as the union $K=\bigcup_{n=1}^3K^{(n)}$ where $K^{(n)}=\{\sigma\in K:\sigma$ has exactly $n$ elements$\}$.

For a set $\sigma$ let $\bar\sigma$ be the convex hull of $\sigma$, $\partial\sigma$ be the combinatorial boundary of $\bar\sigma$ and $\sigma^\circ=\bar\sigma\setminus\partial\sigma$ be the combinatorial interior of $\bar\sigma$.

Let $K_C=\{\sigma\in K:\bar\sigma\cap C\ne\emptyset\}$ and $V=\bigcup\{\sigma^\circ:\sigma\in K_C\}$.

Then $V$ is an open neighborhood of $C$. We claim that there exists a retraction of $\mathbb R^2\setminus C$ onto $\mathbb R^2\setminus V$. For every simplex $\sigma\in K^{(2)}\cap K_C$ the set $C$ either intesects $\sigma^\circ$ of intersect at most two 1-simplexes of the boundary $\partial \sigma$. In both cases we can construct a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. For every $\sigma\in K^{(2)}\setminus K_C$ let $r_\sigma$ be the identity map of $\bar\sigma$.

The union of the retraction $r_\sigma$, $\sigma\in K^{(2)}$, is a retraction of $\mathbb R^2\setminus C$ onto the set $S=(\mathbb R^2\setminus V)\cup\bigcup_{\sigma\in K^{(1)}\cap K_C}(\bar\sigma\setminus C)$. Then do the same with the set $K^{(1)}\cap K_C$: for every 1-simplex $\sigma\in K^{(1)}\cap K_C$, use the fact that $\bar\sigma\cap C\ne\emptyset$ and find a retraction $r_\sigma:\bar\sigma\setminus C\to\partial \sigma\setminus C$. The union of those retractions and the identity maps $r_\sigma$ for $\sigma\in K^{(2)}\setminus K_C$ retract the set $S$ onto the set $$S'=(\mathbb R^2\setminus V)\cup \bigcup_{\sigma\in K^{(2)}\cap K_C}(\sigma^{(0)}\setminus C).$$

Since the set $S'\setminus(\mathbb R^2\setminus V)$ is finite, here exists a retration of $S'$ onto $\mathbb R^2\setminus V$. So, our final retraction $\mathbb R^2\setminus C\to\mathbb R^2\setminus V$ is the composition of the retractions $\mathbb R^2\setminus C\to S\to S'\to\mathbb R^2\setminus V$.