Get AI summaries of any video or article — Sign up free
Distributions 15 | Support for Distributions thumbnail

Distributions 15 | Support for Distributions

5 min read

Based on The Bright Side of Mathematics's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

For ordinary functions, support is the closure of points where the function is nonzero; its complement is the largest open set where the function vanishes.

Briefing

Support for distributions generalizes the familiar idea of where an ordinary function is nonzero, but it’s built using test functions rather than pointwise values. For a usual function f on ℝ^N, the support is the closure of the set where f(x) ≠ 0; equivalently, its complement is the largest open region where f vanishes identically. Distributions don’t allow evaluation at single points in any meaningful way, so the definition shifts from pointwise behavior to local behavior tested against smooth, compactly supported functions.

A distribution T is a linear functional acting on test functions. To say that T “vanishes on” an open set U, the transcript uses the rule: T(f) = 0 for every test function f whose support lies entirely inside U. This captures the idea that T contributes nothing when probed by test functions concentrated in that region. With this notion, the support of a distribution should again be the complement of the largest open set where T vanishes.

The delta distribution provides the guiding example. For the Dirac delta δ, applying it to a test function returns the value of that test function at the origin: δ(f) = f(0). That means δ is zero on any open set that does not contain 0, since test functions supported away from the origin evaluate to 0 under δ. The largest open set where δ vanishes is therefore ℝ^N \\ {0}, so the support of δ is exactly {0}.

For a general distribution T, the key step is showing that a maximal open set U_max exists such that T vanishes on U_max, and that the complement of U_max is a well-defined closed set called supp(T). The transcript constructs U_max by collecting all open sets U on which T vanishes and taking their union. The only nontrivial issue is whether T also vanishes on the union itself, not just on each piece.

To prove this, the argument starts with an arbitrary test function f whose support is contained in U_max. Since the support of f is compact, it can be covered by the open sets from the union; compactness then guarantees a finite subcover. That reduces the situation to a finite union of open sets U_1, …, U_m, each of which already has the property that T vanishes on it.

At this point, a partition of unity enters. For a compact set covered by finitely many open sets, one can choose test functions φ_1, …, φ_m supported in U_1, …, U_m such that their sum equals 1 on the support of f. This lets f be decomposed into a finite sum of test functions, each supported in one of the U_i. By linearity, T(f) becomes a sum of terms T(φ_i f), and each term is zero because φ_i f has support inside an open set where T vanishes. Therefore T(f)=0 for every test function supported in U_max, proving that T vanishes on U_max.

With that missing piece filled, the support of any distribution is well defined as the complement of U_max. The transcript closes by noting that this concept is needed to extend convolution to distributions in the next installment.

Cornell Notes

Support for distributions is defined through how a distribution acts on test functions, not through pointwise values. A distribution T is said to vanish on an open set U if T(f)=0 for every test function f whose support lies inside U. The support supp(T) is then the complement of the largest open set U_max where T vanishes. Existence and well-definedness rely on taking the union of all such open sets and proving T still vanishes on that union. Compactness of the test function’s support and a partition of unity reduce the proof to finitely many open sets, where linearity forces T(f)=0.

Why can’t support for distributions be defined using pointwise values like for ordinary functions?

Ordinary support uses points where f(x) ≠ 0. For distributions, evaluating T at a single point x0 is not meaningful. Instead, local behavior is probed by test functions: T can be tested against smooth, compactly supported functions concentrated near regions. So “vanishing on U” is defined by requiring T(f)=0 for all test functions f supported inside U.

How does the definition of “T vanishes on U” work in practice?

Given an open set U ⊂ ℝ^N, T vanishes on U if for every test function f with supp(f) ⊂ U, the pairing satisfies T(f)=0. The distribution’s effect is checked only through test functions that live entirely inside U, so the distribution contributes nothing to those localized probes.

What does the delta distribution example reveal about support?

For the Dirac delta δ, δ(f)=f(0). If an open set U does not contain 0, then any test function supported in U has f(0)=0, so δ(f)=0 for all such f. Thus δ vanishes on ℝ^N \ {0}. The largest open set where δ vanishes is ℝ^N \ {0}, so supp(δ) = {0}.

Why does the union construction for U_max require an extra proof?

Let U_max be the union of all open sets U where T vanishes. It’s immediate that T vanishes on each individual U, but it’s not automatic that T vanishes on the union. The proof must show: if a test function f is supported in U_max, then T(f)=0, even though f may intersect many different U’s from the union.

How do compactness and partition of unity finish the argument?

If supp(f) ⊂ U_max, then supp(f) is compact. The open sets from the union cover supp(f), so compactness yields a finite subcover U_1,…,U_m. A partition of unity provides test functions φ_1,…,φ_m with supp(φ_i) ⊂ U_i and φ_1+…+φ_m = 1 on supp(f). Then f = Σ_i φ_i f, and each φ_i f is supported in U_i where T vanishes. Linearity gives T(f)=Σ_i T(φ_i f)=0.

What is the final definition of support for a distribution?

Once U_max is shown to be the largest open set where T vanishes, the support is defined as supp(T) = ℝ^N \ U_max. Since U_max is open, its complement is closed, matching the expected topological behavior of support.

Review Questions

  1. State the definition of “T vanishes on an open set U” for a distribution T.
  2. Explain why the support of a distribution is the complement of a maximal open set U_max.
  3. Outline how compactness and partition of unity are used to prove T vanishes on the union of all such open sets.

Key Points

  1. 1

    For ordinary functions, support is the closure of points where the function is nonzero; its complement is the largest open set where the function vanishes.

  2. 2

    For distributions, pointwise evaluation is not used; instead, vanishing on an open set U means T(f)=0 for every test function f supported in U.

  3. 3

    The Dirac delta δ vanishes on any open set not containing 0, leading to supp(δ) = {0}.

  4. 4

    Define U_max as the union of all open sets where T vanishes; then supp(T) is ℝ^N \ U_max.

  5. 5

    The nontrivial step is proving T vanishes on U_max, which requires showing T(f)=0 for any test function supported in U_max.

  6. 6

    Compactness of supp(f) reduces an infinite open cover to a finite one, enabling a finite partition of unity.

  7. 7

    Linearity plus the partition of unity forces T(f) to be a sum of zeros, proving T vanishes on U_max.

Highlights

Support for distributions is determined by where the distribution produces nonzero results against test functions, not by pointwise values.
The delta distribution’s support is exactly the origin because δ(f)=f(0) and test functions supported away from 0 vanish at that point.
Taking the union of all open sets where T vanishes works only after proving T still vanishes on the union.
Compactness and a partition of unity convert the problem from an infinite cover to a finite sum of test functions.
Once U_max is established, supp(T) becomes a closed set automatically as the complement of an open set.

Topics