A covering theorem for families of sets in \(\mathbb R^d\) (Q989230)

Let \(\mathfrak{D}\) and \(\mathfrak{F}\) be families of bounded sets in \(\mathbb{R}^d\). A set \(X\in\mathbb{R}^d\) is called a cover for \(\mathfrak{F}\) if for each \(F\in\mathfrak{F}\) there is an isometry \(\mu\) of \(\mathbb{R}^d\) with \(\mu(F)\subset X\). \(\mathfrak{D}\) is called a \textit{near cover} of \(\mathfrak{F}\) if for each \(\varepsilon >0\) there is a \(D\in\mathfrak{D}\) such that the \(\varepsilon\)-neighborhood of \(D\) is a cover for \(\mathfrak{F}\). The authors prove the following covering theorem: If a compact set \(X\) is a cover for \(\mathfrak{D}\) and if \(\mathfrak{D}\) is a near cover of \(\mathfrak{F}\), then \(X\) is a cover for \(\mathfrak{F}\). As an application they show the following nice \(d\)-dimensional ``worm theorem'' [see, for example, \textit{R. Norwood} and \textit{G. Poole}, Discrete Comput. Geom. 29, No. 3, 409--417 (2003; Zbl 1028.52001)]: A compact set \(X\) is a cover for the family of all unit arcs if and only if \(X\) is cover for the family of all polygonal unit arcs.