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 series of the periodized Gaussian
Statement
Assume Countable Choice. For , the Fourier coefficient of at each integer is , and The periodized series on the left converges locally uniformly, and the Fourier series on the right converges absolutely and uniformly.
Facts & Assumptions
Given: Countable Choice and a real parameter .
The Axiom of Countable Choice (): Countable Choice, as required by the Schwartz Poisson-summation and Euclidean Gaussian-transform suppliers.
Poisson summation for Schwartz functions: for a Schwartz function on , , with the left side locally uniform and the right side absolutely uniformly convergent.
Euclidean Gaussian transform with the 2π normalization: under Countable Choice, for and .
Schwartz space and its seminorms: when it is smooth and every seminorm is finite.
The exponential function is smooth and and Sum, product, quotient, and chain rules from difference quotients: , and derivatives of products and compositions obey the product and chain rules.
The exponential dominates every fixed nonnegative integer power at : for every fixed nonnegative integer and , as .
Local uniform convergence of the periodized Gaussian: the defining kernel series is locally uniformly convergent and equals .
Real elementary functions and their domains: , so ; the real exponential is defined on all of .
Proof
Let . By [F4], induction on derivative order gives for a polynomial . For every , the quantity tends to zero as : bound the polynomial by a finite sum of powers, set , and apply [F5] with by [F7]. On a compact interval it is bounded by continuity. Thus every seminorm in [F3] is finite and .
Apply [F1] to from step 1.1. By [F2] with , its Fourier transform at integer is . The left periodization is by [F6], so [F1] gives the displayed Fourier series, its coefficient formula, and both convergence assertions.
Depends on
- Periodized Gaussian gridding kernel
- Local uniform convergence of the periodized Gaussian
- Real elementary functions and their domains
- Poisson summation for Schwartz functions
- Euclidean Gaussian transform with the 2π normalization
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Schwartz space and its seminorms
- The exponential function is smooth and $(\exp)'=\exp$
- Sum, product, quotient, and chain rules from difference quotients
- The exponential dominates every fixed nonnegative integer power at $+\infty$
Used by
- Certified Gaussian gridding for type 1 and type 2 Algorithm
- Exact Gaussian grid alias identity and explicit alias bound Lemma
- Certified type-1 Gaussian gridding error and type-2 adjoint bound Theorem
Cited to discharge well-definedness by Periodized Gaussian gridding kernel.
Dependency tree · two levels
53 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
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 31–34 (standard reference, not scraped)
- Leslie Greengard and June-Yub Lee, Accelerating the Nonuniform Fast Fourier Transform (standard reference, not scraped)