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

The unitary discrete Fourier transform on Z/NZ

Definition

Let N≥1 and let CZ/N be the complex vector space of all functions Z/NZ→C (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field). For f∈CZ/N define the unitary discrete Fourier transform FNf:Z→C by

(FNf)(k):=N−1/2∑x=0N−1f([x]N) e−2πikx/N,k∈Z,

where [x]N is the class of the integer x in Z/NZ (The congruence class [a]n and the quotient set Z/n, Congruence modulo every integer is an equivalence relation on Z), ez=exp⁡z is the complex exponential (The complex exponential by its power series), and N−1/2 is the rational power of the positive real N (Rational powers ar of a positive base, Laws of rational exponents), read in C through the embedded copy of R (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)).

The summands depend only on classes, and the transform is periodic in k. Each summand f([x]N)e−2πikx/N is a complex number determined by the class [x]N and the integer k, and the classes [0]N,…,[N−1]N are pairwise distinct and exhaust Z/NZ (For n≥1, every class in Z/n has one representative r with 0≤r<n, so ∣Z/n∣=n; while Z/0 is in bijection with Z); so the display is the finite sum, over the finite group, of the family x↦f(x)N−1/2e−2πikx/N, and reindexing by any other representative list leaves it unchanged (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule, part 1). Reindexing by the transition x↦x+N uses e−2πik(x+N)/N=e−2πikx/Ne−2πik and e−2πik=1 for every integer k, because −2πk∈2πZ (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential, ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ). For periodicity in k, the same two facts give e−2πi(k+N)x/N=e−2πikx/Ne−2πix=e−2πikx/N for every integer x, so (FNf)(k+N)=(FNf)(k) for every k∈Z (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential, ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ). Consequently FNf factors through the quotient Z→Z/NZ and is a well-defined function on Z/NZ, and FN is a map CZ/N→CZ/N.

Form in terms of characters. Define χk([m]):=exp⁡(2πikm/N) for k,m∈Z. The assignment is well defined on classes because replacing m by m+N multiplies the exponential by e2πik=1 (ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ); it is multiplicative, χk(x+y)=χk(x)χk(y), by the addition law (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential); and it takes values of modulus 1, since ∣exp⁡(iθ)∣=1 (exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0). Thus the χk are characters of the finite group Z/NZ (homomorphisms into the unit circle; no continuity is required on a discrete group), and the definition reads

(FNf)(k)=N−1/2∑x∈Z/Nf(x) χ−k(x),

with the positive-sign transform obtained by replacing k with −k. This fixes the negative-sign, N−1/2-normalised convention of the whole page: the forward transform carries the minus sign in the exponent and the factor N−1/2, and the inverse transform of the inversion theorem carries the plus sign with the same factor. A different, unnormalised convention is introduced later on this page for the algorithmic part; the two are related by a single explicit rescaling recorded there.

Linearity, recorded for later use. For a,b∈C and f,g∈CZ/N one has FN(af+bg)=a FNf+b FNg: the identity holds at each k by distributivity in C (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)) and the elementary laws of finite sums over a fixed finite index set, which follow from the recursion clauses of A finite sum in a commutative monoid indexed by an arbitrary finite set by induction on an enumeration. Nothing else about FN — unitarity, invertibility, the convolution law — is asserted here; those are proved in the items that follow.

Remarks

  • Why the normalisation is split as N−1/2. The factor N−1/2 is exactly what makes the transform an isometry for the counting inner product, and is the finite analogue of the 1/2π convention in the L2 Fourier transform. Taylor writes the finite transform (11.1) with the factor 1/n in the forward direction and weights L2(Γn) by (1/n)-counting measure; the two descriptions differ by relabelling the sides, not by mathematics, and the translation used here sends ωj to [j]N and f# to N−1/2FNf.

  • No convergence hypothesis is needed or used. The index set is finite, so the definition involves no limit, no summability condition and no auxiliary topology; it applies to every function in CZ/N, including the zero function, and it is total at N=1, where the single summand is f([0]1)e0=f([0]1) with coefficient 1−1/2=1.

Depends on

Used by

Dependency tree · two levels

76 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