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.

Continuous lattice-periodic functions are determined by their lattice Fourier coefficients

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let h:Rn→C be continuous and Λ-periodic for a full-rank lattice Λ, with fundamental parallelotope F. If ∫Fh(x)e−2πiλ∗⋅x dx=0 for every λ∗∈Λ∗, then h=0 everywhere. Consequently a continuous Λ-periodic function is determined by the family (∫Fh(x)e−2πiλ∗⋅x dx)λ∗∈Λ∗ of its unnormalised lattice Fourier coefficients.

Facts & Assumptions

Given: Countable Choice, a continuous Λ-periodic function h:Rn→C with Λ=AZn a full-rank lattice, Λ∗=A−TZn, F=A((0,1]n) (Full-rank lattices, covolume, and the dual lattice, Fundamental parallelotopes of a lattice tile Euclidean space with covolume volume), and ∫Fh e−2πiλ∗⋅xdx=0 for every λ∗∈Λ∗.

[F1]

The pullback hA(y):=h(Ay) is continuous, as a composite of continuous maps (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous), and Zn-periodic: hA(y+k)=h(Ay+Ak)=h(Ay) because Ak∈Λ (Full-rank lattices, covolume, and the dual lattice, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[F2]

Published uniqueness for the unit lattice: a continuous Zn-periodic g with ∫[0,1]ng(y)e−2πik⋅ydy=0 for every k∈Zn is zero everywhere; this assumes Countable Choice (Fourier uniqueness for continuous functions on the Euclidean torus).

[F4]

Transpose algebra: k⋅y=k⋅A−1x=(A−1)Tk⋅x=(A−Tk)⋅x, and A−Tk∈Λ∗ for k∈Zn (Transpose is linear and involutive, and (AB)T=BTAT, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes, Full-rank lattices, covolume, and the dual lattice); the exponential is additive, eu+v=euev (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential).

Proof

technique · direct
1.1F1F3F4givenalgebra

By [F1], hA is continuous and Zn-periodic. For every k∈Zn its unit-lattice Fourier coefficient vanishes: substituting x=Ay in the L1 change-of-variables formula [F3] and using [F4], ∫(0,1]nh(Ay)e−2πik⋅ydy=(1/∣det⁡A∣)∫Fh(x)e−2πi(A−Tk)⋅xdx=0, because A−Tk∈Λ∗ and the hypothesis makes every Λ∗-coefficient of h vanish.

2.1step 1.1F2F3given∎

The difference between [0,1]n and (0,1]n is null by [F3], so the coefficients in step 1.1 also vanish over [0,1]n. Applying the published unit-lattice uniqueness [F2] to hA gives hA=0; since A is invertible, hence surjective (Invertible matrices and the general linear group GL⁡n(F)), every x=Ay has h(x)=hA(y)=0, so h=0 everywhere. Finally, if two continuous Λ-periodic functions have the same unnormalised coefficient family, their difference has all coefficients zero and is therefore identically zero, so the coefficient family determines the function; this last restatement uses nothing beyond linearity of the integral. Countable Choice is inherited from the published unit-lattice theorem.

Depends on

Used by

Dependency tree · two levels

143 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