Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Positive-sign cyclic quantum Fourier transform

Definition

For an integer N≥1, let FN be the negative-sign, N−1/2-normalized transform of The unitary discrete Fourier transform on Z/NZ. Define the cyclic quantum Fourier transform by QFT⁡N:=FN−1. The inverse exists by Finite Fourier inversion for the unitary transform on Z/NZ, and its matrix on the standard basis indexed by 0,…,N−1 is

QFT⁡N∣x⟩=N−1/2∑y=0N−1e2πixy/N∣y⟩,0≤x<N.

Here the standard-basis ket convention is the one specified by Dirac Notation Conversion. Thus the transform has the positive sign and the same N−1/2 normalization as the inverse Fourier formula. At N=1 it is the identity on the one-dimensional register. In the binary specialization N=2n, the circuit page writes each index in its unique base-two expansion.

Depends on

Used by

Dependency tree · two levels

27 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