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.
Computed unitary radix-two FFT with certified twiddle phases
Definition
Fix an instance of the operationwise floating-point model in Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add, with representable real set . Input with , whose real and imaginary coordinates all belong to , a direction forward or inverse, an exact rational twiddle tolerance , integer exponent limits for the dyadic phase format, an initial phase precision , a finite precision cap , a finite elementary-series cap , and a maximum radix-two recursion depth . At precision , phase endpoints use the dyadic format with precision and exponent limits . Output a vector in and the certificate for each twiddle used, or the first range-failure/inconclusive status and its stage, index, or phase. Before multiplying by a certified phase , require its real and imaginary coordinates to belong to ; otherwise return range-failure at that twiddle index before performing the product. Use the same floating-point model instance throughout the recursion.
For direction forward, at return . For , if return inconclusive with the subdivision-cap-exhausted status. Otherwise split into even and odd subsequences and recursively compute their unitary transforms by calling this routine with the same phase parameters and depth cap . For each , call Certified dyadic enclosures for unit-circle phases on with , obtaining approximating . Compute the six-real-operation complex product , componentwise rounded sums and , and . Set output entries and to the componentwise rounded real scalings and , respectively. For direction inverse, conjugate the input, run the forward routine with the same phase parameters and , and conjugate its output; conjugation is exact in the operationwise model. Propagate any failed phase certificate; on arithmetic failure return the operationwise range status and index. Accuracy is asserted only by the separate theorem and only on a successful no-range-failure execution.
Depends on
- Certified dyadic enclosures for unit-circle phases
- Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add
- The standard relative floating-point model and unit roundoff
- The unitary discrete Fourier transform on $\mathbb Z/N\mathbb Z$
- The recursive radix-two fast Fourier transform
Used by
- Arbitrary-length mixed-radix and Bluestein DFT Algorithm
- Certified Gaussian gridding for type 1 and type 2 Algorithm
- Computed FFT cyclic convolution and zero-padded linear convolution Algorithm
- A computed unitary radix-two butterfly has error at most (10u + εtw) times its input norm Lemma
- Certified Gaussian gridding terminates with a defined status Lemma
- The certified particle-mesh Ewald evaluator terminates with finite outputs or an explicit status Lemma
- Computed unitary radix-two FFT has the multiplicative stage error bound Theorem
Dependency tree · two levels
35 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
- Nicholas J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed., Chapter 24, pp. 451–454 (standard reference, not scraped)
- C. Sidney Burrus, Fast Fourier Transforms, Chapter 11 §11.7 (standard reference, not scraped)