How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Support of a distribution
Definition
For , say vanishes on an open if its restriction to is zero. Let be the union of all such open sets. Locality in Distributions form a sheaf shows that , since these sets cover and all its restrictions are zero. Thus is the largest vanishing open set. The support is the relatively closed set .
In particular if and only if : emptiness gives and vanishing there, while the zero distribution vanishes everywhere. If a test vanishes on a neighborhood of , its compact support is contained in , so by restriction. Consequently two tests agreeing on a neighborhood of have equal pairings with , by applying this fact to their difference.
Compactly supported means that is a compact subset of . Relative closedness in an arbitrary open domain is not by itself compactness or closedness in the ambient Euclidean space. On the empty domain support is empty. The union and locality argument require no selection of vanishing neighborhoods and no choice axiom.
Depends on
Used by
- Smooth functions are weakly dense in distributions Corollary
- Convolution of distributions when one has compact support Definition
- Compactly supported distributions extend to smooth functions Lemma
- Convolution of distributions is well defined under the support hypothesis Lemma
- Associativity of distribution convolution under compact support Theorem
- Compactly supported distributions have global finite order Theorem
- Distributions supported at one point Theorem
- Extension by zero for distributions with ambient closed support Theorem
- Tensor product distributions and iterated pairings Theorem
Dependency tree · two levels
5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Semyon Dyatlov, Lecture notes for 18.155 (2022) (standard reference, not scraped)