Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedaudited 2026-09-22
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.

Fourier coefficients and trigonometric polynomials on the torus

Definition

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and let T=R/Z with its normalized Haar integral dmT (The one-dimensional torus and its normalized Haar integral).

Characters. For k∈Z define ek:T→C by ek(x):=exp⁡(2πi k x~) for x=[x~]∈T, where exp⁡ is the complex exponential (The complex exponential by its power series). The definition is independent of the representative x~: replacing x~ by x~+n with n∈Z adds the period 2πkn to the argument of sine and cosine. Each ek is continuous, hence Borel, and satisfies

ek(x)el(x)=ek+l(x),∣ek(x)∣=1,ek(x)‾=e−k(x),

the last two by the cartesian form exp⁡(iθ)=cos⁡θ+isin⁡θ of exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0 and Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive. In particular e0=1 and every ek is bounded and nonzero everywhere.

Fourier coefficients. Let f∈L1(T;C) (Complex Lp classes and Euclidean test-function conventions), that is, a class of Borel functions with ∫T∣f∣ dmT<+∞. Define the Fourier coefficient of f at k∈Z by

f^(k):=∫Tf(x)e−k(x) dmT=∫Tf(x)exp⁡(−2πikx) dmT.

This is well defined: ∣f e−k∣=∣f∣ because ∣e−k∣=1, so f e−k∈L1(T;C) and its integral is finite; and the integral depends only on the class of f, because it is unchanged when f is modified on a null set (Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree). The map f↦f^(k) is complex-linear for each k (The Lebesgue integral is linear on L1(μ)).

Trigonometric polynomials. A trigonometric polynomial on T is a finite complex linear combination of characters, p=∑k∈Fckek, for a finite F⊆Z and scalars ck∈C. The set of all trigonometric polynomials is the span of {ek:k∈Z}; it is closed under addition, scalar multiplication, multiplication and complex conjugation (by the identities for ekel and ek‾), and it contains e0=1. Nothing is claimed here about uniqueness of the coefficients in an expansion, nor about the size of p^; those are properties of the characters proved below.

The finite torus. On Tn, n≥1, the characters are ek(x):=exp⁡(2πi k⋅x) for k∈Zn, where k⋅x is the Euclidean dot product of a representative tuple; trigonometric polynomials are finite complex linear combinations of these, and Fourier coefficients of f∈L1(Tn;C) are f^(k)=∫Tnf e−k dmTn. Fubini computes integrals of products of characters on the product measure (Fubini's theorem for L1 functions on a sigma-finite product); for f∈L2(Tn;C) Hölder's inequality makes f e−k integrable (Complex Holder, Minkowski, and the quotient norm, Finite-measure Lr includes into Lp for p<r).

Depends on

Used by

Dependency tree · two levels

101 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