ScalingStacks

3.2. Regularization [03F1]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

3.2. Regularization

We will be smoothing various functions later on in this section so let us recall the standard regularization techniques. Given a convex bounded domain P⊂ℝnP\subset\mathbb{R}^{n} with piece-wise smooth boundary let ρ\rho be a mollifier whose support is PP, i.e. a positive ℂ∞​(ℝn)\mathbb{C}^{\infty}(\mathbb{R}^{n}) function vanishing exactly outside PP and such that ∫ℝnρ​𝑑x=1\int_{\mathbb{R}^{n}}\rho dx=1. For instance, if PP is a polytope in ℝn\mathbb{R}^{n} given by a collection of inequalities {⟨vi,x⟩+λi≤0}\{\langle v_{i},x\rangle+\lambda_{i}\leq 0\} one can take the usual bell-shaped function

ρ=c​∏iρi, where ​ρi​(x)={e1⟨vi,x⟩+λi,⟨vi,x⟩+λi≤00,⟨vi,x⟩+λi≥0,\rho=c\prod_{i}\rho_{i},\quad\text{ where }\rho_{i}(x)=\begin{cases}e^{\frac{1}{\langle v_{i},x\rangle+\lambda_{i}}},&\quad\langle v_{i},x\rangle+\lambda_{i}\leq 0\\ 0,&\quad\langle v_{i},x\rangle+\lambda_{i}\geq 0\end{cases},

and the constant cc is determined from the normalization. Set ρh:=1hn​ρ​(xh)\rho_{h}:=\frac{1}{h^{n}}\rho(\frac{x}{h}). For any locally integrable function u∈Ll​o​c1​(ℝn)u\in L^{1}_{loc}(\mathbb{R}^{n}) we can apply the standard regularization procedure by taking the convolution with ρh\rho_{h}:

uh​(x):=ρh∗u=∫ℝnρh​(x−y)​u​(y)​𝑑y.u_{h}(x):=\rho_{h}\ast u=\int_{\mathbb{R}^{n}}\rho_{h}(x-y)u(y)\,dy.

Then, if u∈Cp​(ℝn)u\in C^{p}(\mathbb{R}^{n}), the functions uhu_{h} are ℂ∞\mathbb{C}^{\infty} and approaching uu as h→0h\to 0 in the CpC^{p}-norm uniformly on any compact in ℝn\mathbb{R}^{n}.

Below we list some elementary properties of uhu_{h} which will be useful later.

Proposition 3.1.

Let Ω\Omega be a convex domain in ℝn\mathbb{R}^{n}, then

  • •

    uhu_{h} is linear in a vv-direction in Ω\Omega if uu is linear in the vv-direction in the Minkowski sum Ω+h⁡(−P)\Omega+h(-P), with ⟨v,∇uh⟩=⟨v,∇u⟩\langle v,\nabla u_{h}\rangle=\langle v,\nabla u\rangle.

  • •

    uhu_{h} is convex in ℝn\mathbb{R}^{n} if uu is. The gradient ∇uh​(x),x∈Ω\nabla u_{h}(x),x\in\Omega, is always inside the convex hull of all possible gradients of uu in Ω+h⁡(−P)\Omega+h(-P).

  • •

    uhu_{h} is strictly convex in Ω+h⁡(−P)\Omega+h(-P) if uu is convex in ℝn\mathbb{R}^{n} and strictly convex in Ω\Omega.

Proof.

All statements are simple consequences of the following observation. The convolution ρh∗u\rho_{h}\ast u is a weighted averaging of uu over the (translated) support of ρ\rho. The same holds for all derivatives of uu as well. ∎

One can also apply the regularization procedure by taking the convolution with the mollifier parameter depending (smoothly) on the point x∈ℝdx\in\mathbb{R}^{d}. That is uh​(x):=∫ℝnρh⁡(x)​(x−y)​u​(y)​𝑑yu_{h}(x):=\int_{\mathbb{R}^{n}}\rho_{h(x)}(x-y)u(y)\,dy. Or, even, more generally the entire shape of the support of the mollifier can smoothly depend on the center of convolution. We have used this technique of varying support to prove the existence of bi-PIKAS in Proposition 2.1.

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.