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.
Convolution of two tempered distributions need not exist
Statement refuted
Every pair of tempered distributions has an ordinary convolution.
Already on , for , the two constant tempered distributions and do not have an ordinary convolution.
Facts & Assumptions
Given: .
A function of polynomial growth defines a tempered distribution (Polynomial growth functions define tempered distributions).
Convolution is canonically defined when one distribution has compact support; the constants in this example have no compact support (Convolution of distributions when one has compact support).
Counterexample
The constant function has polynomial growth of order zero, so each factor defines a tempered distribution by [F1]. Neither factor is compactly supported, so [F2] does not itself define their convolution.
Choose a nonnegative with . The formal distributional convolution pairing would require the following addition-pullback integral.
For the cube , translation in the inner integral gives
The quantities on the right tend to . Equivalently, is not compactly supported on : every nonempty addition fiber has infinite volume. [given, algebra]
Hence the ordinary integral construction does not produce a finite pairing even on this one nonnegative test function, and is undefined as an ordinary distributional convolution. This does not say that no separately chosen regularization can assign an object to the pair; such an assignment is additional structure, not the ordinary convolution supplied by [F2].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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)