Math 2.0

Integral transforms, operational calculus Convolution Proposition

Support of a convolution

Builds on ConvolutionCompact setSumset

Statement

Let n≥1n \ge 1, and let f,g ⁣:ℝn→ℂf, g \colon \R^n \to \C be continuous functions with compact supports supp⁡f\operatorname{supp} f and supp⁡g\operatorname{supp} g. Here the support of a function is the closure of the set where it is not 00. Then the convolution f∗gf * g is continuous, and supp⁡(f∗g)⊆supp⁡f+supp⁡g={a+b:a∈supp⁡f, b∈supp⁡g}.\operatorname{supp}(f * g) \subseteq \operatorname{supp} f + \operatorname{supp} g = \set{a + b : a \in \operatorname{supp} f, \ b \in \operatorname{supp} g}. In particular f∗gf * g has compact support.

Remarks

If (f∗g)(x)=∫f(y)g(x−y) dy≠0(f * g)(x) = \int f(y) g(x - y) \, dy \ne 0, then f(y)g(x−y)≠0f(y) g(x - y) \ne 0 for some yy. So y∈supp⁡fy \in \operatorname{supp} f and x−y∈supp⁡gx - y \in \operatorname{supp} g, and x=y+(x−y)x = y + (x - y) lies in the sumset supp⁡f+supp⁡g\operatorname{supp} f + \operatorname{supp} g. This sumset is the image of the compact set supp⁡f×supp⁡g\operatorname{supp} f \times \operatorname{supp} g under the continuous map (a,b)↦a+b(a, b) \mapsto a + b, so it is compact and hence closed, and it contains the closure of {f∗g≠0}\set{f * g \ne 0}.

Example: if ff and gg are continuous, positive on (0,1)(0, 1) and zero elsewhere, then f∗gf * g is positive exactly on (0,2)(0, 2), and supp⁡(f∗g)=[0,2]=[0,1]+[0,1]\operatorname{supp}(f * g) = [0, 2] = [0, 1] + [0, 1].

The inclusion can be strict, because of cancellation in the integral. Let φ\varphi be continuous, positive on (0,1)(0, 1) and zero elsewhere, and put ψ=φ∗φ\psi = \varphi * \varphi, supported on [0,2][0, 2]. For f(x)=φ(x)−φ(x−2)f(x) = \varphi(x) - \varphi(x - 2) and g(x)=φ(x)+φ(x−2)g(x) = \varphi(x) + \varphi(x - 2) the cross terms cancel and f∗g(x)=ψ(x)−ψ(x−4)f * g(x) = \psi(x) - \psi(x - 4). So supp⁡(f∗g)=[0,2]∪[4,6]\operatorname{supp}(f * g) = [0, 2] \cup [4, 6], while supp⁡f+supp⁡g=[0,6]\operatorname{supp} f + \operatorname{supp} g = [0, 6]. For integrable functions the same statement holds with essential supports, in the form supp⁡(f∗g)⊆supp⁡f+supp⁡g‾\operatorname{supp}(f * g) \subseteq \overline{\operatorname{supp} f + \operatorname{supp} g}.

Going deeper

For a student

This is why convolution with a mollifier supported in a ball of radius ε\varepsilon moves the support of a function by at most ε\varepsilon. Together with smoothing by convolution it shows that smooth functions with compact support are dense in LpL^p for 1≤p<∞1 \le p < \infty. On the line, the Titchmarsh convolution theorem gives an equality for the convex hulls of the supports.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Compact set concept
  2. Convolution concept
  3. Sumset concept
  4. Support of a convolution statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Convolution
About this page
TagZS29A7QQC2
URIm2://ZS29A7QQC2
Kindstatement, proposition
WritingW0 stub
MSC44A35, 42A85
StatusThis copy of the site has no build data. Run m2 status ZS29A7QQC2.
AboutConvolution
UsesConvolution, Compact set, Sumset

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.