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.
Nonuniform fast fourier transforms
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Computed fast transforms and convolution
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fourier Analysis and the Fast Fourier Transform
- Finite Probability and the Probabilistic Method
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Further Trigonometric Identities and Inverse Functions
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Outward rounded interval and ball arithmetic
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Stone–Weierstrass in General
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Scope and conventions
For type 1, finitely many weighted points on the period-one torus are mapped to integer Fourier modes. Type 2 is the matching conjugate-transpose map from modes back to the same points. Type 3 uses separately supplied real frequencies and has no implicit wrapping, frequency scaling, or type-1 complexity guarantee. The signs, domains and normalizations are fixed in Type-1, type-2, and type-3 nonuniform Fourier transforms.
The finite-array l1, Euclidean, and maximum norms used for data and certificates are fixed, including their empty-array convention, in Finite complex-array norms used by the NUFFT certificates.
Gaussian gridding
The periodized Gaussian is defined and shown locally uniformly convergent in Periodized Gaussian gridding kernel and Local uniform convergence of the periodized Gaussian. Its Fourier coefficients and uniform Fourier expansion are proved in Fourier series of the periodized Gaussian. The finite image sum has an explicit omitted-image bound, while the source-centered finite spread has its own tail bound; these are distinct truncations with different constants.
The factorization below names the operators used by the type-1 procedure. Here is the finite-width spread matrix, is the grid DFT with coefficient , and is the diagonal matrix of positive Gaussian mode multipliers. The type-2 procedure applies the conjugate transposes in reverse order. The diagram records the factorization only; all error estimates are proved algebraically in Exact Gaussian grid alias identity and explicit alias bound and Certified type-1 Gaussian gridding error and type-2 adjoint bound.
\begin{tikzpicture}[>=stealth, node distance=2.1cm]
\node (c) {$c\in\mathbb C^N$};
\node[draw, rounded corners, right of=c] (spread) {$S$\; finite Gaussian spread};
\node[right of=spread] (grid) {$g\in\mathbb C^P$};
\node[draw, rounded corners, right of=grid] (dft) {$Q$\; normalized grid DFT};
\node[right of=dft] (modes) {$Qg$};
\node[draw, rounded corners, right of=modes] (deconv) {$D^{-1}$\; deconvolution};
\node[right of=deconv] (f) {$\widehat F$};
\draw[->] (c) -- (spread);
\draw[->] (spread) -- (grid);
\draw[->] (grid) -- (dft);
\draw[->] (dft) -- (modes);
\draw[->] (modes) -- (deconv);
\draw[->] (deconv) -- (f);
\end{tikzpicture}
The normalized grid transform in the diagram has entries , equivalently times the unitary grid transform. Signed mode is extracted from, or embedded into, the FFT slot ; makes the slots distinct. The algorithm returns inconclusive when an interval, range, denominator, FFT, or twiddle check fails, and returns inconclusive with reason requested-tolerance-not-met when every finite candidate has valid bounds above the requested positive tolerance. Only a candidate whose complete outward error bound meets that tolerance is returned as certified. On successful candidates, the theorem separates the infinite-grid alias term, the finite-spread tail, and the finite-arithmetic radius. For fixed dimension and bounded width and image cutoffs, its scalar work is apart from the stated elementary-range evaluator work.
The prerequisite computed-fast-transforms-and-convolution supplies the computed FFT and its rigorous error bound. The published outward-rounded-interval-and-ball-arithmetic supplies the interval, outward-operation and elementary-range interfaces used directly by the certificate; these existing proved suppliers discharge the planned interval-arithmetic interface. The type-1 coordinate radii explicitly add the computed FFT's normwise error after unitary normalization and positive deconvolution, separately from uncertainty in the spread-grid centers.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Finite complex-array norms used by the NUFFT certificates
Definition
For a finite index set and a complex array , define For , define the counting inner product by . By Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive, , so . For , all three norms and this inner product are defined to be zero. For nonempty finite , the maximum exists by repeated comparison in the real order. Complex modulus is as in Real intervals, complex rectangles and ball enclosures, conjugation as in Real and imaginary parts, complex conjugation, and modulus, finite sums as in A finite sum in a commutative monoid indexed by an arbitrary finite set, and the square root is the unique nonnegative root.
Facts & Assumptions
Given: A finite set and a complex array .
A finite sum in a commutative monoid indexed by an arbitrary finite set: a finite indexed sum is formed from finitely many terms and the empty sum is zero.
Real intervals, complex rectangles and ball enclosures: complex modulus is a finite nonnegative real number.
Nonnegative real square roots exist uniquely: every nonnegative real has a unique nonnegative square root.
Dedekind-complete ordered real field: the real order is total, so any two real numbers are comparable.
The principle of mathematical induction: a statement proved at the first finite list length and preserved when one entry is added holds for every finite list length.
Proof
For all three values are stipulated as zero. If is nonempty finite, enumerate its elements and induct on the number of entries. A one-entry list of real moduli has a maximum; given a maximum for the first entries, compare it with the st modulus using [F2] and [F4] and keep the larger. Induction [F5] constructs the maximum of the finite modulus list. The finite sum formulas in [F1] are well-defined.
Every term is nonnegative by [F2], so the finite sum in the Euclidean norm is nonnegative; [F3] supplies its unique nonnegative square root. Thus all three displayed values are defined, including the separately stipulated empty-array case.
Periodized Gaussian gridding kernel
Definition
For a real parameter , define the period-one Gaussian gridding kernel by the series
The series is the formal periodization; Local uniform convergence of the periodized Gaussian ↗ proves that it converges absolutely and locally uniformly, so its value is a continuous one-periodic real function. Its Fourier coefficient at is denoted when this integral is used; Fourier series of the periodized Gaussian ↗ computes it exactly. The kernel is nonnegative and satisfies .
Triangle inequality for the finite NUFFT Euclidean norm
Statement
For a finite index set and arrays , the Euclidean norm of Finite complex-array norms used by the NUFFT certificates satisfies
Facts & Assumptions
Given: A finite set and arrays with the counting inner product and norms of Finite complex-array norms used by the NUFFT certificates.
Dedekind-complete ordered real field and Squares of nonzero elements are positive: finite sums of nonnegative reals are nonnegative; a nonzero real square is positive, and a positive summand makes such a finite sum positive.
Squaring is monotone on the nonnegatives: for nonnegative reals, comparison of squares is equivalent to comparison of the numbers.
Proof
First prove Cauchy–Schwarz for these arrays. If , its inner product with is zero. If , choose with ; [F2]–[F3] give . Put and . Expanding the finite sum using [F1] and conjugation laws gives Multiplying by the positive denominator yields ; all quantities are nonnegative, so [F4] gives .
Expand the squared norm: where the inequality follows from step 1.1 and , itself immediate from and [F4]. Both sides before squaring are nonnegative, so [F4] gives the stated triangle inequality.
Type-1, type-2, and type-3 nonuniform Fourier transforms
Definition
Fix an integer dimension . Let be the chosen representatives for period-one coordinates; all coordinates in a type-1 or type-2 transform are interpreted modulo integer shifts. Here is the real constant defined in Real elementary functions and their domains. For and , write . Let be finite integers, let , let , and choose integers . The rectangular mode set is
The type-1 nonuniform discrete Fourier transform maps source coefficients to integer-mode samples:
The type-2 nonuniform discrete Fourier transform maps a coefficient array to values at the same point list:
For the type-1 matrix , define its conjugate transpose by . Use the finite counting inner products from Finite complex-array norms used by the NUFFT certificates; the type-2 matrix is as proved below.
The type-3 nonuniform discrete Fourier transform takes a finite source list , coefficients , and a separately specified finite frequency list , and returns
Type 3 has no integer-mode restriction or implicit coordinate wrapping. No frequency normalization, axis scaling, or frequency-space product is implicit; any such scaling is separate input data whose cost must be analyzed separately. Each displayed map is a finite sum of defined complex exponentials; the zero-source case has the empty-sum value zero and the zero-output case returns the empty array. No fast algorithm or complexity claim for type 3 is part of this definition.
Facts & Assumptions
Given: The finite source and mode lists, arrays , and the displayed type-1/type-2 conventions.
, , and : for real , .
Pythagorean and parity identities for all six trigonometric functions on their natural domains: cosine is even and sine is odd.
A finite sum in a commutative monoid indexed by an arbitrary finite set, Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either, is a field, every element is uniquely , and every nonzero element has inverse , and Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive: finite complex sums may be expanded and reordered, multiplication is commutative/distributive, and conjugation preserves products and sums.
Proof
Fix and , and put . By [F1]–[F2], . Applying [F3] gives . Thus .
For any and , expand the finite sums: The first equality uses finite distributivity/reordering from [F4]; the second uses step 1.1 and the stated inner-product convention. Thus the type-2 sum is exactly the conjugate-transpose action under matching finite inner products.
Local uniform convergence of the periodized Gaussian
Statement
For every , the series defining converges absolutely and uniformly on each compact interval of . Its sum is continuous on and has period one.
Facts & Assumptions
Given: A real parameter .
Periodized Gaussian gridding kernel: is the series , with the real constant from the real elementary functions.
Dedekind completeness implies the Archimedean property: the natural numbers are unbounded above.
For , , and for the series diverges: if , then and its tails tend to zero.
The exponential function is strictly increasing, The exponential is positive and satisfies , Continuity and derivative on a real interval, The exponential function is smooth and , Sum, product, quotient, and chain rules from difference quotients, and Real elementary functions and their domains: is continuous and strictly increasing, by its power series, and for every real ; the difference-quotient definition and scalar power, sum and chain rules show each summand is differentiable and hence continuous, so each finite partial sum is continuous.
Real elementary functions and their domains: , whose integrand is at least on ; hence .
Proof
Given: .
Put using [F5] and , and set by [F4]. Fix and choose an integer by [F2]. For and , one has , hence . Since is increasing, the th nonnegative summand is at most by [F6]. The two-sided geometric tail is finite and tends to zero uniformly in as its starting index tends to infinity, by [F3]. This proves absolute and uniform convergence on every compact interval.
Each finite partial sum is continuous by [F1] and [F4]. Fix and , choose , and choose a partial-sum index for which the uniform tail on is below by step 1.1. Continuity of that finite partial sum at gives a neighborhood where its change is below ; the two tail values contribute less than . Thus the full sum is continuous at . Absolute convergence permits the reindexing in , giving . Since was arbitrary, the sum is continuous and one-periodic.
Explicit tail for the periodized Gaussian image sum
Statement
For , integer , and , put Then , and the denominator defining is positive.
Facts & Assumptions
Given: , , and .
Periodized Gaussian gridding kernel and Local uniform convergence of the periodized Gaussian: is the convergent sum over all integer images.
Real elementary functions and their domains: , because on ; the exponential power series gives .
For , , and for the series diverges: for , and .
Proof
Let by [F2]–[F3]. For positive omitted indices write with . Since , , so their sum is at most . By [F4] this is at most .
For negative omitted indices write with . Then , and . Their sum is at most by [F4].
The two omitted tails are nonnegative and exhaust the indices outside . Adding steps 1.1 and 1.2 gives the claimed remainder ; [F3] also proves its denominator is positive.
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.
Explicit periodized Gaussian spread-tail bound
Statement
Let , , and integers satisfy . Define and For , let With , the omitted spreading mass obeys Also for every coordinate and point.
Facts & Assumptions
Given: The stated finite dimension, positive , integers , and point .
Local uniform convergence of the periodized Gaussian: each periodized Gaussian is nonnegative, one-periodic, and its defining integer series converges absolutely and locally uniformly.
For , , and for the series diverges: for , the geometric series converges and its finite tails have the usual explicit sum.
Continuity and derivative on a real interval, The exponential function is smooth and , and Sum, product, quotient, and chain rules from difference quotients: the power and product rules give , and the constant function has zero derivative by its difference quotient; hence . Combining this with and the scalar chain rule shows that is differentiable with derivative for .
The second fundamental theorem: if is differentiable on with and is integrable, then : if on a compact interval and is integrable, then .
Real elementary functions and their domains, The exponential function is strictly increasing, and The exponential is positive and satisfies : , , and the exponential is positive and strictly increasing; hence and .
Proof
Fix one coordinate, write , , , by [F6], and . Reindexing the finite grid index and period index by gives For every integer , at most two integers satisfy . Their terms are at most ; for , . Thus the sum is at most by [F2].
If , then every satisfies . On either side of , the lattice distances form a unit-spaced sequence with . The first term is at most . For each later term, monotonicity of gives . For , [F3]–[F4] give By [F5], the last subtracted term tends to zero as . Taking limits of the finite tail sums, which converge by [F1], bounds each side by . Both sides together yield .
The complement of the product set is the union of the sets where at least one coordinate index is outside its . Since all kernel terms are nonnegative, the total omitted product mass is at most the sum of the coordinate-tail product sums. Each such finite product factors into the one-coordinate tail in step 1.2 and the full-coordinate masses in step 1.1; hence it is at most . Summing over gives .
Exact Gaussian grid alias identity and explicit alias bound
Statement
Assume Countable Choice. Let , , , , integers , positive integers , and . Write , define , and let For define the normalized grid DFT Put . Then where . In particular, and For and the alias error satisfies
Facts & Assumptions
Given: The finite data above and Countable Choice.
The Axiom of Countable Choice (): Countable Choice, inherited through the periodized-Gaussian Fourier-series supplier.
Fourier series of the periodized Gaussian: , absolutely and uniformly.
, and the complex exponential extends the real exponential and , and exactly when : the exponential is multiplicative under addition, , and exactly when .
, , and : for real .
For , , and for the series diverges: for , .
Real elementary functions and their domains, The exponential is positive and satisfies , The exponential function is strictly increasing, and Nonnegative real square roots exist uniquely: , , the exponential is positive and strictly increasing, and for .
Proof
Substitute [F1] into each factor of and then into . Absolute uniform convergence in [F1] permits interchanging the finite grid/source sums with the absolutely convergent Fourier series. For an integer , the coordinate root sum is Indeed, in the first case every term is ; in the second, by [F3] while , so the finite geometric sum is . Thus only remain in each coordinate, giving the displayed exact alias identity.
The term of that identity is by [F1]–[F2]. Each factor is positive by [F6], so division by is valid. For each , its coefficient ratio is Separating proves the deconvolution identity.
Since , and by [F6], the exponent parameter is positive. Positivity and strict monotonicity of in [F6] imply . Fix one coordinate . If with integer and , then Hence the absolute alias multiplier for that coordinate is at most . By [F5] its sum over nonzero is at most , so the sum over all coordinate multi-indices other than zero is at most the product of the coordinate sums including their unit terms, minus the all-zero term, namely . The unit-modulus fact [F4], multiplicativity, and the triangle inequality in [F7] bound each source phase sum by . This gives the asserted alias bound.
Certified Gaussian gridding for type 1 and type 2
Definition
Fix a dimension , finite mode bounds , a finite type-1 source list or type-2 data as in Type-1, type-2, and type-3 nonuniform Fourier transforms, and a nonempty finite ordered list of candidate tuples
an interval-arithmetic format with integers and , and one operationwise arithmetic model from Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add with the same binary precision and normal exponent limits and . Let be a valid unit-roundoff bound for this selected model instance; it is not a separate free control, and require . Use this same model instance for every computed FFT operation. Let be the finite elementary-series truncation index, an exact rational maximum allowed twiddle certificate, an exact rational phase-evaluation tolerance, integers giving the initial and maximum phase precisions, and a finite recursion-depth cap . The phase evaluator uses exponent limits and truncation index . Also supply an exact positive dyadic requested absolute tolerance . Source coordinates and coefficients are finite dyadics interpreted as exact real and complex inputs. Each candidate must have rational , a power-of-two grid length with integer , , integer width with , and integer image cutoff . A malformed global control or structurally invalid candidate returns invalid-input before arithmetic. Type 3 is not an input mode for this algorithm.
After validating the global controls and candidate shapes, if return status certified immediately: type 1 returns the exact zero output array and zero radii, and type 2 returns the empty output array and zero radius. For , process the candidates in supplied order; the first candidate that produces a complete interval certificate meeting is returned.
-
For each coordinate compute outward enclosures for Use Certified range evaluation for elementary real and complex functions for every real exponential and square-root node in the procedure, including the finite norms, normalization and complex moduli; use format and truncation index on every such call. Form every Machin enclosure of with this same format and index. Use the outward interval operations for the rational DAGs. Set Store outward upper bounds and , where bounds the exact image-tail constant , and a lower bound . If any required enclosure is non-finite, if a required denominator interval in contains zero, if some enclosure is not strictly below , or if , reject this candidate as inconclusive; no division by an unverified multiplier is performed.
-
For every source define and construct its periodic nearest-point set by the following finite rule. For each coordinate put , enumerate the integers from through , and take their least nonnegative residues modulo as ; then set . This equals the displayed set because its membership condition is equivalent to some integer satisfying . Compute the endpoints by exact rational comparisons. At most consecutive integers are enumerated, and makes their residues distinct. using the selected candidate. For type 1 only, for each reduce each exact dyadic displacement modulo one to . Enclose the one-dimensional kernel by evaluating the finite image sum with Certified range evaluation for elementary real and complex functions using , then add the symmetric interval from step 1. All kernel and coefficient products and sums use outward interval arithmetic. For each grid cell , this gives a complex rectangle enclosing its exact truncated-spread value . Choose its lower-left corner as a dyadic center and an upward dyadic radius large enough to enclose . Let be an outward upper bound for and let be an outward upper bound for . Before a type-1 FFT call, require every real and imaginary coordinate of every to belong to the representable set of the selected operationwise model; otherwise reject this candidate with a range-failure status before calling the FFT. Type 2 skips this spreading-grid construction; its source-window intervals are evaluated in step 4 using the sets just defined.
-
For each mode , define its grid slot by , using least nonnegative residues; makes this map injective. Put , for each axis, and . For type 1, run Computed unitary radix-two FFT with certified twiddle phases on each length- grid line along axes in a fixed lexicographic line order, with direction
forward, the selected operationwise model, phase tolerance , exponent limits , phase precisions , series cap , and recursion cap . The supplier passes the exact rational phase argument for its twiddle indexed by and returns a certificate for each twiddle it uses. Reject this candidate with the returned status if an FFT call is non-finite or inconclusive; otherwise verify for every returned twiddle certificate that . If any certificate exceeds , reject this candidate with statustwiddle-bound-not-metand do not use that FFT output. This check applies literally when , so every used twiddle must then have certificate zero. After all checks pass, extract the unitary Fourier coordinates at slots for and scale by , where . Use the range evaluator with format and for every real elementary node, including this scaling and the mode multipliers; use the same Machin enclosure of . For each required mode evaluate the multiplier interval ; if its lower endpoint is , reject this candidate as inconclusive before division. Otherwise divide by that certified positive interval. Use outward complex-rectangle arithmetic. For each , choose the lower-left corner of this computed scaling/deconvolution rectangle and an upward dyadic radius containing that rectangle about . This rectangle alone concerns the computed FFT output, not the exact unitary transform. Separately form a certified outward upper bound for Here is the certified norm bound of the actual dyadic input grid from step 2, and uses the same selected model's valid bound and checked twiddle limit as the successful FFT calls. Evaluate this nonnegative radius DAG with outward interval operations: integer powers use finite products, and the normalization square root uses the same range format and index . As with the existing model and rational constants, use certified enclosing constants throughout; in particular enclose the selected model's valid unit-roundoff bound. If that model supplies no tighter certified enclosure for , use the already verified enclosure , converted outward to the selected format; thus no additional oracle or input for is required. Reject the candidate as inconclusive if any radius enclosure is non-finite or the normalization denominator enclosure is not strictly positive before division. Define the returned coordinate radius by the upward dyadic sum ; if this sum overflows, reject the candidate with its range status. Thus every returned radius includes both the scaling/deconvolution rectangle and the separately bounded error of its computed FFT relative to the exact transform of the dyadic center grid. Set The returned error certificate is and . -
For type 2, form the conjugate-transpose finite gridding factorization. For each input mode , evaluate its multiplier interval using the same format and truncation setting ; if its lower endpoint is , reject the candidate as inconclusive before division. Otherwise divide by that certified positive interval. For the resulting mode rectangles choose lower-left dyadic centers and radii enclosing their deviations. Set to an outward upper bound for and to an outward upper bound for . Require every real and imaginary coordinate of the to belong to ; otherwise reject this candidate with a range-failure status before calling the FFT. Embed each at grid slot , zero-fill all unused grid modes with zero centers and zero radii, and apply Computed unitary radix-two FFT with certified twiddle phases in direction
inverseon the same axes and in the same lexicographic line order, passing the same operationwise model and phase controls as in type 1. Reject a non-finite or inconclusive FFT call; for a finite return verify every returned twiddle certificate , with the same literal zero-bound rule. Enlarge the unitary-grid output by radius and scale by . For each source , use exactly the grid cells from step 2; reduce each coordinate displacement modulo one to , enclose by range-evaluator calls with format and , and add . Multiply the coordinate window intervals, conjugate the resulting real window (which leaves it unchanged), and multiply and sum against the scaled grid rectangles using outward complex-rectangle arithmetic at every operation. Return the lower-left corner and an outward radius containing each resulting rectangle; the type-2 rounding certificate is . Its analytic certificate is the same from step 3. -
Enclose or from above by outward modulus and addition intervals. For each candidate whose operations succeed, compare the outward upper bound (type 1), or (type 2), exactly with . If it is at most , return the centers and their certificates with status certified. Otherwise record this candidate's first non-success reason as
requested-tolerance-not-mettogether with its finite bound, then continue to the next candidate. For any candidate rejected by a range, interval, denominator, mode-positivity, FFT, or twiddle check, record its first failure status and location, then continue to the next candidate. If the finite candidate list is exhausted without a certified return, return status inconclusive with the first recorded non-success record in candidate order. In particular, if every candidate had finite valid bounds above , returninconclusive(requested-tolerance-not-met)with the first such bound; no approximation is returned as certified on this branch.
The analytic term consists only of the exact infinite-grid alias contribution and the omitted finite-spread tail. The reported rounding radius contains the finite image-series enclosure, outward arithmetic, and computed FFT error. The signed-mode slot map is used for both type-1 extraction and type-2 embedding. The transform and FFT axes are fixed; a different normalization or sign convention is a different procedure.
Remarks
The unitary radix-two FFT error theorem is used only on successful axes with the stated and twiddle bounds; range, interval, or denominator failures return inconclusive. The global lower bound does not replace checking each separately evaluated mode interval before division. The finite candidate list is part of the input; if none meets the requested tolerance the returned status is inconclusive. This procedure handles types 1 and 2 only. Type 3 requires its own frequency-space scale/product and complexity analysis.
Certified Gaussian gridding terminates with a defined status
Statement
For finite exact dyadic data and finite encoded controls, the procedure
Certified Gaussian gridding for type 1 and type 2 terminates with a defined
status. Malformed global controls or structurally invalid candidates return
invalid-input as specified. On admissible controls, the empty-source branch
returns its exact zero or empty output; otherwise the procedure returns the
first candidate whose complete finite outward bound meets the exact positive
requested tolerance with status certified, or returns inconclusive with
the first recorded non-success reason in candidate order after the finite
list is exhausted. This includes requested-tolerance-not-met when all
candidates have finite valid bounds exceeding the requested tolerance.
Every performed interval division has its prescribed nonzero divisor guard, FFT inputs and twiddle certificates pass the declared checks before use, and every returned finite interval contains the exact value of its evaluated DAG. A candidate with a range failure or unresolved interval, denominator, phase, FFT, radius or tolerance check is not itself returned as certified; a later candidate may still succeed. These are termination and well-defined-status assertions for the specified procedure; its complete transform-error estimates are separate mathematical claims.
Facts & Assumptions
Given: Finite exact dyadic type-1 or type-2 data, a finite nonempty candidate list satisfying the displayed integer/rational hypotheses, the selected operationwise model and its valid unit-roundoff bound , positive requested tolerance , phase controls , common range truncation index , and the interval and FFT routines named in the Definition.
Type-1, type-2, and type-3 nonuniform Fourier transforms: the source, mode and output lists are finite, and the type-1/type-2 formulas use the stated mode set.
Certified range evaluation for elementary real and complex functions: each elementary range call uses a finite truncation index and format, and returns either a finite enclosure or a named failure status; the Definition fixes these to and .
Computed unitary radix-two FFT with certified twiddle phases and Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add: each FFT call requires input coordinates in its selected model's representable set, uses a positive phase tolerance, finite phase-precision range and recursion cap, and returns a certificate for every used twiddle or a failure status; is a valid bound for that same model instance.
Outward-rounded operations are inclusion-isotone and enclose DAG evaluations: every finite interval operation encloses its exact range; invalid or unbounded operations return a non-finite status.
Finite complex-array norms used by the NUFFT certificates: the finite norms used for grid and mode error radii are defined by finite sums, with value zero on an empty array.
Computed unitary radix-two FFT has the multiplicative stage error bound: a successful unitary FFT with the selected model's and all used twiddle certificates at most has Euclidean error factor at length , in either direction. The type-1 radius construction uses the actual center-grid bound and these checked factors; its scaling by and positive mode divisions are included explicitly.
Certified Gaussian gridding for type 1 and type 2: step 2 constructs each coordinate support list from the finite integer interval and reduces those integers modulo .
Proof
The elementary evaluator in [F2] visits a finite typed DAG in topological order. Its series have the fixed finite index ; its exponential scaling uses a finite integer number of squarings; logarithm bins are a finite integer range determined by positive finite endpoints; and trigonometric reduction examines a finite cell list determined by finite endpoints and a positive certified pi lower bound, returning a named failure if that bound or a branch is unresolved. Square-root endpoint bisection starts with finite integer indices and strictly decreases their positive gap until it is at most one (Exact dyadic bisection for square-root endpoints). Thus these child calls terminate. The phase routine examines only the integer precisions from to and calls those finite evaluators (Certified dyadic enclosures for unit-circle phases). Each FFT recursion either returns at length one, returns when its depth cap is zero, or makes two calls with the cap reduced by one and a finite twiddle loop. Induction on the finite depth cap therefore proves termination of every forward call; inverse mode adds only finite conjugations. A failed child call propagates its named status. Consequently no child in [F2]–[F3] is an unbounded evaluation oracle.
Every loop in a candidate is finite: the dimension, source and mode lists, grid-cell lists, image ranges , expression DAGs, range truncation index , phase precision interval , and recursion cap are finite by [F1]–[F3]. Each coordinate support list is generated by the finite integer interval in [F7]. Every FFT length is a finite power of two by [F3]. The finite norm sums used in the radius construction are defined by [F5]. Thus a candidate either returns a result or reaches one of its explicitly named failure branches after finitely many operations.
Every division in step 1 is preceded by the denominator, , and checks; every type-1 or type-2 mode division is preceded by its own positive-lower-endpoint test in steps 3–4. Hence all performed divisions have divisor intervals excluding zero. The FFT is called only on inputs in its model's representable set; its statuses are checked and no FFT output is used unless every returned twiddle certificate is at most . The type-1 FFT-error radius uses the same checked call bounds [F6]; its normalization divisor is checked to have a strictly positive enclosure before division, and its finite upward radius sum is checked for overflow. A failed interval, range, FFT, denominator, mode-positivity, radius or twiddle check rejects the candidate. Sound containment of every returned finite interval follows from [F2] and [F4].
The ordered candidate list is finite, and processing terminates for each candidate by step 1.2. The procedure returns the first successful candidate whose outward absolute-error bound meets ; if none does so, it returns inconclusive with the first recorded non-success reason, including requested-tolerance-not-met when all computed bounds exceed tolerance. Therefore every certified return has passed its finite checks, and the inconclusive branch returns no approximation certified to the requested tolerance.
Certified type-1 Gaussian gridding error and type-2 adjoint bound
Statement
Assume Countable Choice and the input hypotheses of Certified Gaussian gridding for type 1 and type 2. If , the type-1 output is exactly zero and the type-2 output is empty, so their coordinatewise errors are zero. For , fix a successful candidate with , exact multipliers , , , and the exact spread-tail quantity of Explicit periodized Gaussian spread-tail bound. Put The algorithm returns an outward upper bound .
For a type-1 output center array and its returned finite-arithmetic radius , For the type-2 output center array and its returned radius , where is the exact type-1 matrix and is its conjugate transpose. When , the type-2 output is empty and its coordinatewise assertion is vacuous; the procedure returns zero radius for this empty-output branch.
For fixed , widths , image cutoffs , and fixed interval-series controls, one candidate's scalar grid/FFT/deconvolution work is Thus for bounded it is , apart from the explicitly counted finite elementary-range evaluation work. No type-3 fast-cost claim follows.
Facts & Assumptions
Given: Countable Choice; finite dyadic input data; a successful type-1 or type-2 algorithm output for an exact positive requested tolerance; the selected operationwise model and its valid unit-roundoff bound ; positive interval-certified Gaussian deconvolution multipliers; all FFT twiddle certificates verified at using the stated positive phase tolerance, phase precision range and finite recursion cap; no FFT, interval, or range failures; and the same used by the procedure.
The Axiom of Countable Choice (): Countable Choice is inherited through the Schwartz Poisson-summation supplier used by the alias identity.
Type-1, type-2, and type-3 nonuniform Fourier transforms: the exact type-1 matrix is and type 2 is .
Exact Gaussian grid alias identity and explicit alias bound: the full periodized-grid factorization has entrywise alias error at most .
Explicit periodized Gaussian spread-tail bound: for each source column, deleting grid cells outside its product neighborhood removes at most of nonnegative kernel mass.
Explicit tail for the periodized Gaussian image sum, Certified real elementary-function evaluations enclose their ranges, and Outward-rounded operations are inclusion-isotone and enclose DAG evaluations: each finite image sum plus its symmetric remainder interval encloses the exact periodized kernel, and every finite interval operation preserves that enclosure.
Computed unitary radix-two FFT has the multiplicative stage error bound: for a successful length- unitary FFT in the selected operationwise model, with and every returned twiddle certificate checked to be at most , its normwise error factor is ; inverse mode has the same bound.
Finite Parseval and Plancherel identity for the unitary DFT: every exact unitary finite DFT preserves the Euclidean norm; coordinate restriction cannot increase that norm.
Certified Gaussian gridding for type 1 and type 2: the type-1 centers are extracted at signed-mode slots after the checked computed FFT, and their returned coordinate radii are upward sums , where encloses the computed scaling/deconvolution rectangle and . These radii enclose the exact deconvolution of that dyadic center grid; the separate grid-center contribution is bounded by .
The radix-two FFT uses complex arithmetic operations: one radix-two transform of length uses arithmetic operations.
Certified Gaussian gridding for type 1 and type 2, Outward-rounded operations are inclusion-isotone and enclose DAG evaluations, and Certified real elementary-function evaluations enclose their ranges: on a successful candidate the reported is an outward upper bound for , and the type-1 adds the finite interval/FFT radius to .
Type-1, type-2, and type-3 nonuniform Fourier transforms: every satisfies .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm is strictly increasing and .
Finite complex-array norms used by the NUFFT certificates: the finite-array norms are the displayed sums and maximum, with value zero on the empty index set.
Certified Gaussian gridding for type 1 and type 2: type 2 embeds each signed mode into the unique slot , applies the checked inverse unitary FFT, and its output intervals enclose the exact finite conjugate-transpose factorization; the returned radius is the maximum coordinate radius.
The exponential function is strictly increasing, The exponential is positive and satisfies , and Nonnegative real square roots exist uniquely: for the factors and are positive, and implies ; hence .
Certified Gaussian gridding for type 1 and type 2: the empty-source branch returns exact zero type-1 output, empty type-2 output, and zero radii.
Triangle inequality for the finite NUFFT Euclidean norm: the counting Euclidean norm satisfies the triangle inequality.
Rectangular matrix multiplication and the identity matrix , including zero-sized shapes: products of finite matrices have entries given by finite sums over their shared index set.
Periodized Gaussian gridding kernel: every exact spread matrix entry is real, because the Gaussian kernel is a product of sums of real nonnegative exponential terms.
Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive: complex modulus is nonnegative and is multiplicative and satisfies the triangle inequality.
, , and : every grid Fourier phase has modulus one, hence .
Squaring is monotone on the nonnegatives: for nonnegative reals , implies .
Certified Gaussian gridding for type 1 and type 2: step 2 generates each by enumerating the finite integer interval and reducing its entries modulo .
Proof
If , [F17] and the finite sums in [F1] give exact zero type-1 output and an empty type-2 output; [F12] assigns zero to empty norms, so both error assertions hold with zero radii. For the remaining proof assume . Let be the full spread matrix with entries , and let keep only the entries in each source's product neighborhood. Define the mode-by-grid matrix and the diagonal mode matrix , with by the positive-multiplier premise. The products below use the finite matrix multiplication of [F19]. The normalized grid sum in [F2], applied to the unit source vector , says that every entry of has modulus at most . For each column , [F3] bounds the sum of the nonnegative deleted entries by ; since , it follows that . By [F10], , and [F14]–[F15], , so . Adding the two matrix differences gives for every . For each row, multiplication by and the complex modulus laws [F21] give , hence by [F12]. Finally [F9] gives for the returned outward bound.
Let be the exact truncated spread and the dyadic center grid computed by the algorithm. The finite image sums and symmetric remainder intervals enclose every exact kernel by [F4]; isotonicity of the outward DAG operations then gives , with norms as in [F12]. By [F18], the counting Euclidean norm has the triangle inequality. For coordinate axis , regard its length- FFTs as one block-diagonal operator. Squaring and summing the linewise supplier bound [F5] gives a normwise error at most times the block input norm; the exact block transform is unitary by [F6]. If and are the computed and exact outputs after axes , the triangle inequality [F18], the local error bound and unitarity give and . Starting with and iterating gives . For each extracted coordinate, the FFT discrepancy has modulus at most , since a coordinate modulus is bounded by the Euclidean norm. The exact scaling by and exact division by the mode multiplier therefore make its deconvolved discrepancy at most , using [F15] and . By [F4], the computed scaling/deconvolution rectangle encloses the exact scaling/deconvolution of the computed FFT coordinate, so its distance from the returned lower-left center is at most . The algorithm forms outward from the actual input norm bound and the verified call factors; [F7] and the complex triangle inequality [F21] then give distance at most from that center to the exact deconvolution of the dyadic center grid. This justifies the full containment claimed in [F7], including the previously omitted computed FFT error. To transfer the grid-center enclosure, define as the exact unitary DFT on the full rectangular grid and as restriction to the slots . Since , two modes in with the same residue differ by a multiple of of magnitude less than , hence are equal; coordinatewise, is injective. The grid transform in step 1.1 is . For any finite array , each is a nonnegative summand of , so [F12] and [F23] give . Parseval and contraction under coordinate restriction in [F6] then yield . By [F10], [F14] and [F15], each . Thus the additional deconvolution error is at most . The algorithm defines ; using , taking the maximum returned and adding its grid-center term gives the asserted radius.
By [F19], the finite gridding matrix is . Step 1.1 bounds its analytic discrepancy by , and step 2.1 bounds the finite-arithmetic discrepancy from by . The coordinatewise complex triangle inequality [F21], followed by taking the finite maximum, gives , and [F1] identifies .
The type-2 exact finite matrix computed by the algorithm is . By [F19], . Since and are real by [F14]–[F15] and [F20], conjugating this entry gives ; this is exactly the entry of by the same finite-product formula. In the slot notation of step 2.1, , where embeds a mode vector into the grid slots and zero-fills every other slot; this is the inverse-FFT construction in step 4. Thus . Step 1.1 gives for each entry, so the complex modulus laws [F21] give It remains to bound the finite-arithmetic discrepancy. Let be the exact deconvolved mode vector and the dyadic centers of the component rectangles computed in step 4 of the algorithm. That step defines with and by [F12]–[F13]. The positive-sign computed unitary FFT has axis error factors and total ; its bound is the same as the type-1 calculation in step 2.1 because [F5] gives the same factor for the conjugated inverse routine. Thus its computed center differs from the exact transform of the embedded by at most , since zero-fill embedding preserves the Euclidean norm. The exact unitary transform preserves the embedded input uncertainty norm by [F6], so [F18] bounds the computed FFT center's distance from the exact transform of embedded by . After scaling by , each used grid coordinate is therefore within of the exact coordinate. The algorithm encloses this discrepancy, evaluates every real spread-window coefficient with a finite image interval containing its exact value by [F4] and [F20], and applies only sound outward rectangle operations. Hence the final rectangle at source contains ; its center has error at most its radius . Taking the maximum over the finite output set gives . Combining this finite bound with the displayed analytic entry estimate proves the type-2 claim, using [F12] for the finite norms.
There are length- transforms on axis , so [F8] gives work on that axis. Since and , [F11] gives . Formula [F16] therefore shows that is increasing on positive arguments, hence ; fixed gives over all axes. By [F24], forming the coordinate neighborhoods takes index operations per source and produces at most retained product cells. For fixed and , the support-generation cost is bounded by the displayed per-source grid term. Evaluating its coordinatewise image sums costs at most a constant multiple of per retained product cell, and the mode deconvolution pass costs ; interval-series evaluator internals are excluded as stated. These counts yield the displayed bound. This analysis covers types 1 and 2 only; the type-3 frequency ranges require separate scaling and work estimates.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Sheldon Axler, Linear Algebra Done Right, fourth edition
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 44–50 and 65–67
- Leslie Greengard and June-Yub Lee, Accelerating the Nonuniform Fast Fourier Transform
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 40 and 69
- Leslie Greengard and June-Yub Lee, NUFFT User's Guide, Version 1.2
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 44–46
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 44–50
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 31–34
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 48 and 54–58
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 44–58
- Jens Keiner, Stefan Kunis, and Antje Vollrath, The Nonequispaced FFT and its Applications, Part I, slides 44–69