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.
Finite seminorm bound characterizes tempered distributions
Statement
Let be complex-linear. Then is tempered if and only if there are and integers such that
for every .
Facts & Assumptions
Given: A complex-linear functional on .
A basic zero-neighborhood in Schwartz space imposes finitely many strict bounds on its defining seminorms (Tempered distribution).
Proof
Suppose is continuous. There is a basic zero-neighborhood on which . If , then and linearity forces , so take . Otherwise put .
If , then , whence . If , every scalar multiple of lies in ; boundedness of those scalar multiples of forces . Choose and dominating the finitely many and . Then is at most times the rectangular maximum in the statement, which proves the required estimate.
Conversely, assume the displayed estimate. For every , the set on which its finite maximum is less than is a zero-neighborhood and is carried by into the disk of radius . Thus is continuous and hence tempered.
Depends on
Used by
- Dirac comb Definition
- Principal value one over x is tempered and its fourier transform Example
- Schwartz parameter pairing and integral interchange Lemma
- Compactly supported distributions are tempered Theorem
- Polynomial growth functions define tempered distributions Theorem
- Tempered convolution is smooth with polynomial growth Theorem
Dependency tree · two levels
3 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)