Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Poisson summation for a full-rank lattice

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let f∈S(Rn) and let Λ be a full-rank lattice with dual Λ∗ and covolume c:=covol⁡(Λ). Then both series below converge absolutely and ∑λ∈Λf(λ)=1c∑λ∗∈Λ∗f^(λ∗); more precisely, the periodisation identity ∑λ∈Λf(x+λ)=1c∑λ∗∈Λ∗f^(λ∗)e2πiλ∗⋅x holds for every x∈Rn.

Facts & Assumptions

Given: Countable Choice, f∈S(Rn), the full-rank lattice Λ=AZn with dual Λ∗=A−TZn and covolume c=∣det⁡A∣, the fundamental parallelotope F=A((0,1]n), the periodisation P=PΛf, and the L1 transform f^ of Fourier transform on complex L1 classes.

[F1]

P is smooth, Λ-periodic and absolutely convergent at every point: P(x)=∑λ∈Λf(x+λ) with locally uniformly summable derivative series (Schwartz periodisation over a lattice is smooth with locally uniformly summable derivatives).

[F2]

f^∈S(Rn) (Fourier transform acts continuously on Schwartz space), and Schwartz functions satisfy the product-weight bound ∣∂βg(y)∣≤Aβ∏j(1+yj2)−1 for a finite constant built from finitely many seminorms; in particular ∣f^(ξ)∣≤A(1+∣ξ∣)−N for every prescribed N (Schwartz derivatives are integrable).

[F3]

Lattice count: there is a constant C with #{λ∗∈Λ∗:∣λ∗∣≤r}≤C(1+r)n for all r≥0. Indeed λ∗=A−Tk, so ∣λ∗∣≤r implies ∣k∣=∣ATλ∗∣≤Kr for a constant K (Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0, Full-rank lattices, covolume, and the dual lattice), and the number of integer points with ∣k∣≤Kr is at most (2Kr+1)n, as the shell count of Dirac comb shows.

[F4]

∑m≥1mn−N<∞ for real N>n+1 (The p-series for a real exponent p converges exactly when p is greater than one).

[F5]

Character orthogonality on the fundamental domain: (1/c)∫Fe2πi(λ∗−η∗)⋅xdx=1 if λ∗=η∗ and 0 otherwise (Orthogonality of the lattice characters over a fundamental domain).

[F6]

The periodisation has P's coefficients: ∫FP(x)e−2πiη∗⋅xdx=f^(η∗) for every η∗∈Λ∗ (Fourier coefficients of a lattice periodisation).

[F7]

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

[F8]

Termwise integration of a uniformly convergent series over a finite-measure set and interchange of an absolutely summable integral are justified by the dominated-convergence and Fubini interfaces (Dominated convergence, Fubini's theorem for L^1 functions on a sigma-finite product).

Proof

technique · direct
1.1F2F3F4givenalgebra

By [F2], for every N there is AN with ∣f^(λ∗)∣≤AN(1+∣λ∗∣)−N. Splitting Λ∗ into the shells m≤∣λ∗∣<m+1 and using the count of [F3], ∑λ∗∈Λ∗∣f^(λ∗)∣≤AN∑m≥0C(1+m)n(1+m)−N<∞ once N>n+1 by [F4].

2.1step 1.1F9givenalgebra

Hence S(x):=c−1∑λ∗∈Λ∗f^(λ∗)e2πiλ∗⋅x converges absolutely and uniformly on Rn; its sum is continuous by [F9] applied to real and imaginary parts, and it is Λ-periodic because each exponential e2πiλ∗⋅x is Λ-periodic exactly when λ∗∈Λ∗ (Full-rank lattices, covolume, and the dual lattice).

3.1step 2.1F5F6F8given

For every η∗∈Λ∗, [F8] and the absolute convergence of step 1.1 justify integrating the series term by term against e−2πiη∗⋅x over the finite-measure set F: ∫FS(x)e−2πiη∗⋅xdx=c−1∑λ∗f^(λ∗)∫Fe2πi(λ∗−η∗)⋅xdx=f^(η∗), the last equality by [F5]. By [F6] the periodisation P has the same coefficient f^(η∗) for every η∗∈Λ∗.

4.1step 3.1F1F6F7given∎

Since P and S are both continuous and Λ-periodic ([F1], step 2.1) and their difference has every lattice Fourier coefficient zero by step 3.1, [F7] gives P=S, which is the displayed periodisation identity. Evaluating at x=0 gives ∑λ∈Λf(λ)=c−1∑λ∗∈Λ∗f^(λ∗); absolute convergence on the left is the x=0 case of [F1], and on the right it is step 1.1. Countable Choice is inherited from the periodisation, change-of-variables and convergence suppliers above.

Depends on

Used by

Dependency tree · two levels

122 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