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 multipliers of approximate identities
Statement
Assume countable choice. For any complex approximate identity , at each frequency. For , uniformly. Also in every finite norm for which .
Facts & Assumptions
Given: , The Axiom of Countable Choice (), and the unit-mass, bounded-norm and absolute-tail conditions of An approximate identity on .
Complex approximate identities converge in finite norms (Complex translation, convolution, approximate identities, and mollification).
The convolution transform equals the product of transforms (Fourier transform turns L1 convolution into multiplication).
The supremum norm of a transform is bounded by the input norm (The L1 transform is bounded and uniformly continuous).
Proof
Put . Unit mass gives . For fixed , its modulus is bounded by . The latter tail tends to zero (bound it by the defining tail outside ), and the first term tends to zero with . This proves the pointwise multiplier limit.
F1 applies to every stated finite p and gives norm convergence, including p=1. By F2 and F3, . Thus uniform transform convergence follows from norm approximation, not merely the pointwise multiplier limit. Countable choice is inherited from F1 and F2.
Depends on
- Fourier transform turns L1 convolution into multiplication
- The L1 transform is bounded and uniformly continuous
- Every $L^1$ approximate identity converges to the identity in $L^p$ for $1 \le p < \infty$
- An $L^1$ approximate identity on $\mathbb{R}^n$
- Complex translation, convolution, approximate identities, and mollification
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
46 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
- Gerald Teschl, Topics in Real and Functional Analysis (2017) (standard reference, not scraped)