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.
Gaussian smoothing of finite measures
Statement
Assume AC. Let be a finite complex Borel measure of finite variation on , . For define using the Gaussian kernel. Then , , and . For every complex ,
Facts & Assumptions
Given: The stated data, The Axiom of Choice, the complex test convention Complex Lp classes and Euclidean test-function conventions, and the measure transform Fourier transform of a finite complex Borel measure.
Under AC a finite complex measure absolutely continuous with respect to a sigma-finite positive measure has an integrable density (A finite complex measure absolutely continuous with respect to a sigma-finite positive measure has an integrable complex density).
The variation of a measure with density u has density (The total variation of an absolutely continuous signed or complex measure has density the absolute value of the Radon-Nikodym derivative).
Complex integration obeys the variation bound (Integrals against signed or complex measures are bounded by total variation).
Tonelli and complex Fubini apply on sigma-finite positive product spaces (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Fubini's theorem for L^1 functions on a sigma-finite product).
Gaussian kernels have mass and norm one and the stated Gaussian transform (Gaussian summability kernels).
Gaussian approximate identities converge uniformly on complex (Complex translation, convolution, approximate identities, and mollification).
Translation has transform multiplier (Translation, modulation, linear dilation and reflection laws).
Proof
Put . The inequality gives ; v is finite, hence sigma-finite. F1 gives with , and F2 gives , in particular . For any bounded measurable H, : first verify this for simple H using the density formula on sets, then approximate bounded H uniformly by quantizing its real and imaginary values. F3 bounds the error on the left by , and the right error by . AC enters F1 through the signed RN/Hahn/Jordan existence selections; it also covers the existence assumption omitted in the older F2 proof.
Consequently , absolutely at every x because k_t is bounded and u integrable. The joint function is Borel measurable. By F4, F5 and translation invariance, its double absolute integral is . Fubini therefore supplies a measurable integrable h_t and its stated norm bound. With the additional modulus-one Fourier factor the same double bound applies. F4 and F7 give by step 1.1.
For a compactly supported continuous , the double absolute integral after multiplication by is at most . F4 exchanges the integrals. Since k_t is even, the inner test integral is , and F6 gives uniform convergence to . Thus the difference from has modulus at most . Step 1.1 identifies the limit with .
Depends on
- Fourier transform of a finite complex Borel measure
- Gaussian summability kernels
- Fubini's theorem for L^1 functions on a sigma-finite product
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Integrals against signed or complex measures are bounded by total variation
- A finite complex measure absolutely continuous with respect to a sigma-finite positive measure has an integrable complex density
- Complex Lp classes and Euclidean test-function conventions
- The total variation of an absolutely continuous signed or complex measure has density the absolute value of the Radon-Nikodym derivative
- The Axiom of Choice
- Complex translation, convolution, approximate identities, and mollification
- Translation, modulation, linear dilation and reflection laws
Used by
Dependency tree · two levels
70 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)