Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generated
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 F. Input N=2m with m≥0, x∈CN whose real and imaginary coordinates all belong to F, a direction forward or inverse, an exact rational twiddle tolerance 0<τ≤1/4, integer exponent limits emin⁡≤emax⁡ for the dyadic phase format, an initial phase precision p0≥2, a finite precision cap pmax⁡≥p0, a finite elementary-series cap J≥1, and a maximum radix-two recursion depth dmax⁡≥0. At precision p, phase endpoints use the dyadic format with precision p and exponent limits emin⁡,emax⁡. Output a vector in CN 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 w^k, require its real and imaginary coordinates to belong to F; 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 N=1 return x0. For N>1, if dmax⁡=0 return inconclusive with the subdivision-cap-exhausted status. Otherwise split x into even and odd subsequences and recursively compute their unitary transforms E,O by calling this routine with the same phase parameters and depth cap dmax⁡−1. For each 0≤k<N/2, call Certified dyadic enclosures for unit-circle phases on (q,τ,emin⁡,emax⁡,p0,pmax⁡,J) with q=−2k/N, obtaining (w^k,ϵk) approximating wk=e−2πik/N. Compute the six-real-operation complex product tk=fl⁡C(w^kOk), componentwise rounded sums sk+=fl⁡C(Ek+tk) and sk−=fl⁡C(Ek−tk), and c^=fl⁡(1/2). Set output entries k and k+N/2 to the componentwise rounded real scalings fl⁡C(c^sk+) and fl⁡C(c^sk−), respectively. For direction inverse, conjugate the input, run the forward routine with the same phase parameters and dmax⁡, 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

Used by

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