Alphabeta Math
LemmaStatement: 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.

Sampling at a lattice produces periodisation of the spectrum over the dual lattice

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let f∈S(Rn) and let Λ be a full-rank lattice with covolume c and dual Λ∗. The product f⋅comb⁡Λ∈S′(Rn) equals the sampled distribution ∑λ∈Λf(λ)δλ, and F(f⋅comb⁡Λ)=1c∑λ∗∈Λ∗f^(⋅−λ∗)=1c(comb⁡Λ∗∗f^), the periodisation of the spectrum over the dual lattice with scale c−1. In particular for Λ=hZn (h>0) sampling at spacing h gives F(∑k∈Znf(hk)δhk)=h−n∑m∈Znf^(⋅−m/h).

Facts & Assumptions

Given: Countable Choice, f∈S(Rn), the full-rank lattice Λ=AZn with covolume c and dual Λ∗ (Full-rank lattices, covolume, and the dual lattice), the Dirac combs and deltas of Dirac comb and Dirac delta and its derivatives, and the distributional convolution (u∗φ)(x)=⟨uy,φ(x−y)⟩ of Convolution of a tempered distribution with a schwartz function.

[F1]

comb⁡Λ∈S′(Rn) with ⟨comb⁡Λ,ψ⟩=∑λψ(λ) absolutely convergent for Schwartz ψ, and Fcomb⁡Λ=c−1comb⁡Λ∗ (The Dirac comb of a full-rank lattice transforms to the dual comb).

[F2]

Multiplication by a Schwartz function is transposition, ⟨f⋅u,ψ⟩=⟨u,fψ⟩, preserves S′, and fψ∈S for ψ∈S (Smooth polynomially bounded multipliers on schwartz space).

[F3]

Product-to-convolution: for u∈S′ and φ∈S, F(φ u)=Fφ∗Fu under the distribution-first convention (Fourier transform converts allowed tempered convolutions to products); the transform of a tempered distribution is defined by ⟨Fu,ψ⟩=⟨u,Fψ⟩ (Fourier transform of a tempered distribution).

[F4]

f^∈S(Rn) (Fourier transform acts continuously on Schwartz space), and for the L1 transform f^(ξ)=∫f(x)e−2πix⋅ξdx the two notions agree on Schwartz functions (Fourier transform on complex L1 classes).

[F5]

covol⁡(hZn)=hn and (hZn)∗=h−1Zn: the diagonal matrix hI has determinant hn, and (hI)−TZn=h−1Zn (Full-rank lattices, covolume, and the dual lattice).

Proof

technique · direct
1.1F1F2givenalgebra

For ψ∈S, [F2] gives ⟨f⋅comb⁡Λ,ψ⟩=⟨comb⁡Λ,fψ⟩=∑λ∈Λf(λ)ψ(λ) by [F1], since fψ∈S. The right-hand side is absolutely convergent by the shell estimate of [F1], and equals ⟨∑λf(λ)δλ,ψ⟩ because for compactly supported ψ only finitely many terms remain and the general case is the absolutely convergent limit of the partial sums [F1]. Hence the product is the sampled distribution.

2.1step 1.1F1F3F4givenalgebra

By the product-to-convolution law [F3] applied with φ=f and u=comb⁡Λ, and the comb duality [F1], F(f⋅comb⁡Λ)=f^∗Fcomb⁡Λ=c−1(f^∗comb⁡Λ∗); the convolution definition [F3] and [F4] give (f^∗comb⁡Λ∗)(x)=∑λ∗∈Λ∗f^(x−λ∗), so F(f⋅comb⁡Λ)=c−1∑λ∗f^(⋅−λ∗) in S′.

3.1step 2.1F5given∎

For Λ=hZn one has c=hn and Λ∗=h−1Zn by [F5], so the identity reads F(∑kf(hk)δhk)=h−n∑mf^(⋅−m/h), the sampling periodisation claimed. Countable Choice is inherited from the comb duality and Schwartz Fourier suppliers above.

Depends on

Used by

Dependency tree · two levels

65 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