Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Smooth torus test functions have rapidly convergent Fourier pairings

Statement

Assume Countable Choice. Let A∈GL3(R), V=∣det⁡A∣, Λ=AZ3, κk=2πA−Tk, and let φ be a smooth Λ-periodic function. With the Fourier coefficients of Neutral point sources and Fourier data on a three-dimensional torus, for every derivative order q≥0, ∑k∈Z3∣κk∣q∣φ^(k)∣<∞. Consequently the Fourier series of φ and every differentiated series converge uniformly to φ and its corresponding derivatives. More generally, if a coefficient sequence satisfies ∣ak∣≤C(1+∣κk∣)s for some C<∞ and s≥0, then Ta(φ):=V∑k∈Z3akφ^(−k) converges absolutely and defines a continuous periodic distribution. A periodic distribution is determined by its Fourier coefficients.

Facts & Assumptions

Given: Countable Choice, A∈GL3(R), the lattice data of Neutral point sources and Fourier data on a three-dimensional torus, a smooth periodic φ, and a sequence (ak)k∈Z3 with ∣ak∣≤C(1+∣κk∣)s for fixed finite C and s≥0.

[A1]

Countable Choice is assumed by the periodic Fourier uniqueness theorem used below (The Axiom of Countable Choice (ACω)).

[F1]

The cell has volume V, its angular characters are ek(x)=eiκk⋅x, and the Fourier coefficient is V−1∫Fφ(x)e−iκk⋅xdx (Neutral point sources and Fourier data on a three-dimensional torus, Fundamental parallelotopes of a lattice tile Euclidean space with covolume volume).

[F2]

The lattice characters are orthogonal on F: V−1∫Fei(κk−κj)⋅xdx=1 for k=j and 0 otherwise (Orthogonality of the lattice characters over a fundamental domain).

[F3]

Integration by parts on a closed interval holds for differentiable factors with integrable derivatives; periodic endpoint values cancel when the factors are periodic (If u,v are differentiable on [a,b] with u′,v′ integrable, then ∫abuv′=u(b)v(b)−u(a)v(a)−∫abu′v).

[F4]

For every real p>1, ∑m≥1m−p converges (The p-series for a real exponent p converges exactly when p is greater than one).

[F5]

A function series dominated termwise by a convergent scalar series converges uniformly (Weierstrass M-test for complex-valued function series).

[F7]

A continuous periodic function with all Fourier coefficients zero vanishes identically on the torus (Continuous lattice-periodic functions are determined by their lattice Fourier coefficients).

[F8]

Linear change of variables sends F to the fundamental cube, and an absolutely integrable function on the cube may be integrated successively in its three coordinates (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions, Fubini's theorem for L^1 functions on a sigma-finite product).

Proof

technique · direct
1.1A1F1F3F8algebra

Put φ~(t)=φ(At), which is smooth and Z3-periodic. Change variables to the unit cube and integrate successively in the three coordinates using [F8]. In t coordinates the physical Laplacian is the constant-coefficient operator Δt=∑r,s(A−1A−T)rs∂tr∂ts. Repeatedly apply [F3] to the real and imaginary parts in each coordinate; periodicity makes every opposite-face boundary term cancel, and the character is an eigenfunction with eigenvalue −∣κk∣2. Thus for every integer m≥1, φ^(k)=(1+∣κk∣2)−m(1−Δ)mφ^(k),∣φ^(k)∣≤(1+∣κk∣2)−msup⁡x∈F∣(1−Δ)mφ(x)∣. The last inequality follows because the Fourier coefficient is the normalized integral over the cell [F1].

2.1step 1.1F4algebra

Since ∣κk∣≥2π∣k∣/∥AT∥2, the number of integer vectors with j≤∣κk∣<j+1 is at most (2∥AT∥2(j+1)/(2π)+3)3. For any fixed q, choose an integer m>(q+4)/2; the shell sum of ∣κk∣q(1+∣κk∣2)−m is then bounded by a constant times a convergent p-series [F4]. Hence ∑k∣κk∣q∣φ^(k)∣<∞.

3.1step 2.1F2F3F5F6F7construct

Enumerate Z3 by increasing max⁡r∣kr∣ and lexicographically within each finite shell. For each derivative order, step 2.1 and [F5] make the Fourier series and its formal derivative series uniformly convergent. Apply [F6] to the real and imaginary parts along each coordinate line; the uniform derivative limits are the derivatives of the sum. By [F2], termwise integration shows that the sum has the same Fourier coefficients as φ; [F7] makes the continuous difference zero. Each derivative series likewise has the coefficients of the corresponding derivative of φ, by periodic integration by parts [F3], so [F7] identifies it with that derivative. Hence the Fourier partial sums converge in every smooth seminorm.

4.1step 1.1step 2.1A1F1F2algebra∎

Choose m>(s+4)/2 in step 1.1. The shell count of step 2.1 gives ∑k∣akφ^(−k)∣≤Csup⁡F∣(1−Δ)mφ∣∑k(1+∣κk∣)s(1+∣κk∣2)−m<∞. This is a bound by the seminorm sup⁡F∣(1−Δ)mφ∣, a finite sum of the smooth seminorms in the source-data definition, so Ta is a continuous linear functional. If a periodic distribution has the same Fourier coefficients as Ta, their difference vanishes on every character and hence on every trigonometric polynomial; by the smooth convergence of step 3.1 and continuity of the distribution, it vanishes on every smooth test function. Therefore the coefficients determine it.

Depends on

Used by

Dependency tree · two levels

88 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