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.
Fourier inversion on Schwartz space
Statement
Assume countable choice. For every and every , The integral is absolutely convergent.
Facts & Assumptions
Given: and The Axiom of Countable Choice ().
The Fourier transform preserves Schwartz space (Fourier transform acts continuously on Schwartz space).
Schwartz functions are integrable (Schwartz derivatives are integrable).
If , inversion gives its value at every Lebesgue point (L1 Fourier inversion with an integrable transform).
Proof
By [F1] and [F2], both and are integrable, and the displayed integral is absolutely convergent since the exponential has modulus one. Fix . Smoothness implies continuity, so for every some gives for . Averaging over any ball of radius bounds its mean oscillation by . Thus is a Lebesgue point with specified value .
Apply [F3] at this arbitrary point. This proves the formula everywhere, inheriting exactly the countable-choice assumption of these three suppliers. The proof never exchanges an undamped double Fourier integral.
Depends on
Used by
- Fourier transform is a topological automorphism of Schwartz space Corollary
- Carleson tiles wave packets and tile order Definition
- Carleson real line to torus transfer Lemma
- Carleson single tree estimate Lemma
- Wave packet model dominates the linearised carleson operator Lemma
- Parseval pairing on Schwartz space Theorem
Dependency tree · two levels
22 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, MIT 18.155 (2022) (standard reference, not scraped)