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.
The weighted Fourier seminorm separates Schwartz functions
Statement
Assume Countable Choice. For every , real , and , implies that as an actual smooth function. Consequently from Weighted Fourier candidate norm on Schwartz space is a positive-definite inner product, and its induced norm is .
Facts & Assumptions
Given: Countable Choice, , , and .
The form and candidate seminorm satisfy and (Weighted Fourier candidate norm on Schwartz space).
The repository Fourier transform extends to a unitary map on complex and preserves the norm of Schwartz functions (Plancherel theorem).
A Schwartz function is an actual continuous smooth function, not only an almost-everywhere class (Schwartz space and its seminorms).
Proof
Suppose . By [F1], , so almost everywhere.
Since at every , step 1.1 implies almost everywhere; Plancherel [F2] then gives .
If , continuity from [F3] gives a ball on which ; its positive Lebesgue measure contradicts . Therefore the actual Schwartz function vanishes everywhere.
By [F1], is the complex inner product of the weighted Fourier images, hence is linear in the first variable, conjugate symmetric, and nonnegative on the diagonal; step 3.1 makes it positive definite, and [F1] gives .
Conversely, if , its Fourier transform vanishes and the defining formula [F1] gives ; thus the kernel is exactly .
Depends on
Used by
- Real-order Bessel-potential completion Hˢ Definition
Dependency tree · two levels
19 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, current revision (standard reference, not scraped)
- Richard B. Melrose, Differential Analysis, Chapter 3 (standard reference, not scraped)