Remark: Family 130. Fourier transforms below n n

Gives a deterministic length-$n$ discrete Fourier transform algorithm using $O(n(\log n{)}^{1-\delta })$ operations for every $n$, with explicit $\delta =10^{-13}$. The model uses exact complex arithmetic, unrestricted coefficients and a supplied root of unity, and counts scalar preparation and logarithmic-word indexing.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.