In some books, mainly about PDEs, I read that any open set can be approximated by sub-domain with smooth boundary (not just piecewise smooth). In 2 dimensional case, this seemly to be quite trivial: for any subdomain, use small open balls to cover its boundary and then mollify the connection parts. But in the higher dimensional case, I think this is not that obvious.


So the first question is: how can we approximate any open set by sub-domain with smooth boundary?


And the second question is: In what meaning the approximation is? Pointwise, i.e., we can find subdomain $D\_n$ with smooth boundary such that $D\_n\uparrow A$? uniformly pointwise? Or in the Lebesgue measure sense? etc.


Here "$D\_n\uparrow A$" uniformly pointwise" means means that $\partial D\_n\subset A\cap A\_n^c$, where $A\_n:=\{ x \in A:d(x,\partial A)\geq \frac1n \}$,.



Can we approximate any open set by sub-domains with smooth boundary?
By a well-known theorem of Whitney, any closed subset of $R^n$ coincides with the zero set of a $C^\infty$ function:


[Whitney, Hassler: Analytic extensions of differentiable functions defined in closed sets, Trans. AMS 36 (1934), 63--89.](http://www.ams.org/journals/tran/1934-036-01/S0002-9947-1934-1501735-3/S0002-9947-1934-1501735-3.pdf)


Let $f$ be such a function for the boundary of the domain. By Sard's theorem $f$ has a regular value $x$ arbitrarily close to $0$. Then a component of $f^{-1}(x)$ yields the desired approximation. To get a subdomain, make sure that $x$ coincides with a value of $f$ inside the domain.


There is an even easier way of doing this when the domain is bounded: cover the domain by balls of radius $\epsilon$, or take the union of a finite collection of balls of radius $\epsilon$ contained in the domain and covering a compact subset. For each ball let $f\colon R^n\to R$ be the function whose zero set coincides with the boundary of the ball (i.e., the distance function from the center of the ball minus the radius). Now multiply all these functions to obtain a function $F$, and take a level set of $F$ close to $0$.


The second method yields a subdomain which is not only smooth but is algebraic. In both cases here, the approximation is with regard to the [Hausdorff distance](https://en.wikipedia.org/wiki/Hausdorff_distance).


