[Math] Approximation of Semicontinuous Functions

approximationapproximation-theoryreal-analysissemicontinuous-functions

Assume that $k \in \mathbb{N}$ and $f : \mathbb{R}^d \rightarrow [0,\infty)$ is lower semicontinuous, i.e. $f(x) \leq \liminf_{y \rightarrow x} f(y)$ for all $x \in \mathbb{R}^d$.

Does there exist an increasing sequence of $k$-times continuously differentiable functions $(g_n)_n \subset C^k(\mathbb{R}^d ; [0,\infty))$ that converges pointwise to $f$, i.e. $g_n(x) \leq g_{n+1}(x)$ for all $x \in \mathbb{R}^d$ and $n \in \mathbb{N}$ as well as $\lim_{n \rightarrow \infty} g_n(x) = f(x)$ for all $x \in \mathbb{R}^d$?

My intuition would be yes, since we could tile $\mathbb{R}^d$ into dyadic cubes, take for the center of every cube the minimum of the values of $f$ on neighboring cubes and then interpolate between these center points with nice $C^\infty$ functions. Unfortunately this approach sounds very technical to me and I'm wondering whether there is something more elegant.

Best Answer

I came across this looking for a wrong theorem. Sorry if it is too late. I would avoid taking sups because they may not preserve smoothness. But if you know an increasing sequence of continuous functions that converge to your lsc function, you may obtain smooth ones by removing $2^{-n}$ to the current function, approximate it within $2^{-n-2}$ by a smooth function (but in the whole space $R^d$ a brutal convolution will not work, I don't know a better way than using partitions of unity before you convolve). Anyway, your new sequence is smooth and still increasing, and converges to the same limit. Agreed, this will not be nonnegative if your initial function $f$ was zero somewhere. For that case I am afraid I see no way to avoid doing this by hand, working on the open set where $f > 2^{-n}$, doing the same sort of thing as above there, and gluing by hand in the remaining region. (Sorry, did not spend too much time).

Related Question