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 under two-sided polynomial decay

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let Λ be a full-rank lattice with covolume c and dual Λ∗, and let f:Rn→C be continuous with ∫Rn∣f∣<∞ and Fourier transform f^(ξ)=∫f(x)e−2πix⋅ξdx. Suppose that for some constants C>0 and ε>0, ∣f(x)∣≤C(1+∣x∣)n+εand∣f^(ξ)∣≤C(1+∣ξ∣)n+ε(x,ξ∈Rn). Then for every x∈Rn both series converge absolutely (the left one locally uniformly in x) and ∑λ∈Λf(x+λ)=1c∑λ∗∈Λ∗f^(λ∗)e2πiλ∗⋅x; in particular ∑λf(λ)=c−1∑λ∗f^(λ∗). This is the non-Schwartz hypothesis promised by the design: continuity and two-sided (n+ε)-decay, with no claim for bare L1 data.

Facts & Assumptions

Given: Countable Choice, a continuous integrable f with the two-sided decay bounds displayed, the full-rank lattice Λ=AZn with dual Λ∗=A−TZn, covolume c, fundamental parallelotope F (Full-rank lattices, covolume, and the dual lattice, Fundamental parallelotopes of a lattice tile Euclidean space with covolume volume), and the L1 transform f^ (Fourier transform on complex L1 classes).

[F1]

Lattice-ball growth: #{λ∈Λ:∣λ∣≤r}≤CΛ(1+r)n, and likewise #{λ∗∈Λ∗:∣λ∗∣≤r}≤CΛ∗(1+r)n. If Λ=AZn, boundedness of A−1 gives ∣k∣≤K∣Ak∣; hence each integer coordinate of k lies in [−Kr,Kr], leaving at most (2Kr+1)n choices. The dual case is the same with AT (Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0). Compact Euclidean sets are bounded by Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, providing the bound on x used in the locally uniform estimate.

[F2]
[F3]

For ε>0, put q=2−ε∈(0,1). Then the dyadic tail ∑j≥j02−jε=∑j≥j0qj converges by the geometric-series theorem (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges).

[F5]

Character orthogonality: (1/c)∫Fe2πi(λ∗−η∗)⋅xdx=δλ∗η∗ (Orthogonality of the lattice characters over a fundamental domain); for λ∗∈Λ∗, λ∈Λ one has λ∗⋅λ∈Z and e−2πiλ∗⋅(y−λ)=e−2πiλ∗⋅y (Full-rank lattices, covolume, and the dual lattice, 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).

[F6]

Termwise integration and exchange of sum and integral under absolute convergence and uniform majorants (Dominated convergence, Fubini's theorem for L^1 functions on a sigma-finite product).

[F7]

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

[F8]

Since f∈L1(Rn;C), its Fourier transform f^ is bounded and uniformly continuous; the character factor x↦e2πiλ∗⋅x is continuous (The L1 transform is bounded and uniformly continuous, The complex exponential is entire and its complex derivative is itself).

[F9]

Proof

technique · direct
1.1F1F3F4F9givenalgebra

Fix a compact set K, let R bound ∣x∣ on K, and choose j0 so 2j≥2R for j≥j0. For 2j≤∣λ∣<2j+1 we have ∣x+λ∣≥2j−1, so ∣f(x+λ)∣≤C′2−j(n+ε) uniformly on K. The annulus contains at most the number of lattice points in the ball of radius 2j+1, hence at most C′′2jn by [F1]; its total contribution is therefore O(2−jε). These contributions are summable by [F3]. The finitely many lattice points with ∣λ∣<2j0 contribute a finite sum of continuous functions, uniformly on K. Thus P(x):=∑λ∈Λf(x+λ) converges absolutely and uniformly on K; its real and imaginary parts are uniform limits of continuous real-valued functions, so [F4] makes both limits continuous and [F9] makes P continuous on K. Since K was arbitrary, P is continuous on Rn, and reindexing the absolutely convergent series gives P(x+μ)=P(x) for μ∈Λ.

2.1step 1.1F2F5F6given

By the tiling [F2], Tonelli and the integrability of f, ∑λ∈Λ∫F∣f(x+λ)∣dx=∫Rn∣f∣<∞; hence [F6] justifies termwise integration and, substituting y=x+λ with e−2πiλ∗⋅(y−λ)=e−2πiλ∗⋅y [F5], ∫FP(x)e−2πiλ∗⋅xdx=∑λ∫F+λf(y)e−2πiλ∗⋅ydy=f^(λ∗) for every λ∗∈Λ∗.

2.2step 1.1F1F3F4F5F6F8F9given

Define S(x):=c−1∑λ∗∈Λ∗f^(λ∗)e2πiλ∗⋅x. Grouping the dual lattice into dyadic annuli and applying [F1], each annulus contributes O(2−jε) by the decay bound on f^; [F3] makes the series absolutely convergent. Since each exponential has modulus one, this convergence is uniform on Rn; each summand is continuous by [F8], so its real and imaginary partial sums converge uniformly to continuous functions, and [F4] and [F9] make S continuous. It is Λ-periodic because λ∗⋅λ∈Z for λ∗∈Λ∗, λ∈Λ. Integrating term by term with [F5] and [F6] gives ∫FS(x)e−2πiη∗⋅xdx=c−1∑λ∗f^(λ∗)∫Fe2πi(λ∗−η∗)⋅xdx=f^(η∗) for every η∗∈Λ∗.

3.1step 2.1step 2.2F7given∎

By steps 2.1 and 2.2 the continuous Λ-periodic function P−S has every lattice Fourier coefficient zero, so P=S by [F7]; this is the displayed identity, and its left side converges absolutely by step 1.1. Evaluating at x=0 gives ∑λf(λ)=c−1∑λ∗f^(λ∗). The two-sided (n+ε)-decay hypotheses are used only through the majorants of steps 1.1 and 2.2; they cannot be dropped to bare integrability with point values, as recorded on the companion page. Countable Choice is inherited from the integration and convergence suppliers above.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

167 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