Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
@delimit No, $C_c^\infty$ is not dense in $L^\infty(L^\infty)$. But then you can do the approximation with weaker information than that. For instance, it is enough that the approximating sequence $u_m$ (a) converges pointwise, (b) has a uniform bound in $L^\infty(L^\infty)$, (c) has $\nabla u_m$ converging in $L^2(L^2)$, and (d) has $\partial_t u_m$ converging in $L^2(H^{-1})$. Typically approximation by convolution will do that for you.
@SeanEberhard, that is very useful! As I understand it, $C_0$ is not dense in $C_b$, and therefore knowing $\xi\in C_b'$ on $C_0$ is not enough to determine $\xi$.
I just realized that your case is slightly better than the standard $L^1$-right-hand-side case, since you have bounded $\|\nabla \Psi_n\|_2$ by construction. By the Sobolev inequality that implies that $\Psi_n$ is bounded in $L^{d/(d-2)}$ and you can extract a weakly converging subsequence. Then you can pass to the limit in your equality $\Psi_n = G*u_n$ after integrating against a test function.
Yes, if a function $f$ is in $L^p_{weak}(R^d)$, then any truncation $f$ to a finite range (e.g. $(f\vee -1)\wedge 1$) is in $L^q(R^d)$ for $q>p$. This follows from the property that the distribution function satisfies $\lambda_f(t) \leq \|f\|_{p,weak}^p t^{-p}$ and the layer-cake principle (e.g. Lieb-Loss Sec 1.13).