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 ()). Let be continuous and -periodic for a full-rank lattice , with fundamental parallelotope . If for every , then everywhere. Consequently a continuous -periodic function is determined by the family of its unnormalised lattice Fourier coefficients.
Facts & Assumptions
Given: Countable Choice, a continuous -periodic function with a full-rank lattice, , (Full-rank lattices, covolume, and the dual lattice, Fundamental parallelotopes of a lattice tile Euclidean space with covolume volume), and for every .
The pullback 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 -periodic: because (Full-rank lattices, covolume, and the dual lattice, Rectangular matrix multiplication and the identity matrix , including zero-sized shapes).
Published uniqueness for the unit lattice: a continuous -periodic with for every is zero everywhere; this assumes Countable Choice (Fourier uniqueness for continuous functions on the Euclidean torus).
The cube is compact by Heine-Borel in : with the Euclidean metric a subset of 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, so the closed parallelotope is compact, and the real and imaginary parts of are bounded on it by the compact-image and extreme-value clauses of A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism. The boundary of the unit cube is a finite union of degenerate boxes, hence null (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included); its image under is null by A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not. Thus the substitution A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions on the open box also computes the half-open and closed-domain integrals, since integrals over null sets vanish (A nonnegative integral over a null set vanishes).
Transpose algebra: , and for (Transpose is linear and involutive, and , Rectangular matrix multiplication and the identity matrix , including zero-sized shapes, Full-rank lattices, covolume, and the dual lattice); the exponential is additive, (, and the complex exponential extends the real exponential).
Proof
By [F1], is continuous and -periodic. For every its unit-lattice Fourier coefficient vanishes: substituting in the change-of-variables formula [F3] and using [F4], , because and the hypothesis makes every -coefficient of vanish.
The difference between and is null by [F3], so the coefficients in step 1.1 also vanish over . Applying the published unit-lattice uniqueness [F2] to gives ; since is invertible, hence surjective (Invertible matrices and the general linear group ), every has , so 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
- Full-rank lattices, covolume, and the dual lattice
- Fundamental parallelotopes of a lattice tile Euclidean space with covolume volume
- Fourier uniqueness for continuous functions on the Euclidean torus
- A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset
- Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
- Transpose is linear and involutive, and $(AB)^{\mathsf T}=B^{\mathsf T}A^{\mathsf T}$
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- A nonnegative integral over a null set vanishes
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- Invertible matrices and the general linear group $\operatorname{GL}_n(F)$
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
- A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ 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
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
- Lior Silberman, Fourier series and the Poisson summation formula (Math 604/613 notes, UBC) (standard reference, not scraped)
- Richard S. Laugesen, Harmonic Analysis Lecture Notes (arXiv:0903.3845) (standard reference, not scraped)