Distributional Convolution Convergence Theorem
📂Distribution TheoryDistributional Convolution Convergence Theorem
Theorem
Let’s say ϕ is a test function that satisfies ∫Rnϕ(x)dx=1. And let ϕϵ(x)=ϵ−nϕ(ϵ−1x) be given. Then, for any distribution F and regular distribution TF∗ϕϵ, when ϵ→0, TF∗ϕϵ converges to F.
TF∗ϕϵ→wFas ϵ→0
Description
The name ‘The Convolution Convergence Theorem for Distributions’ is arbitrarily given as there was no specific name attached to the content above.
Proof
Let ϕ~(x)=ϕ(−x) be given. Then, similarly to ϕ, ϕ~ will also be ∫ϕ~=1. Therefore, according to the Convolution Convergence Theorem, for any test function ψ, the following formula holds.
ϕ~ϵ∗ψ→unifψand∂α(ϕ~ϵ∗ψ)=ϕ~ϵ∗∂αψ→unif∂αψ
Then, the following formula is established.
ϵ→0limTF∗ϕϵ(ψ)=ϵ→0limF(ϕ~ϵ∗ψ)=F(ψ)
The first equality is due to the Auxiliary Theorem of Convolution for Distributions. The second equality is based on the Continuity Condition of Distributions. Thus, according to the definition of Convergence of Distributions, TF∗ϕϵ converges to F.
■