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.
Full-rank lattices, covolume, and the dual lattice
Definition
Let . A full-rank lattice in is a subgroup of the form
where is an invertible real matrix with columns ; here is the matrix product (Rectangular matrix multiplication and the identity matrix , including zero-sized shapes) and the column matrix is identified with the vector it represents. A full-rank lattice is exactly a full Euclidean lattice in the sense of Full Euclidean lattice and covolume: invertibility of makes its columns linearly independent over (A finite square real matrix is invertible if and only if its determinant is nonzero), so they form a real basis of and is their -span, and conversely the basis matrix of every full Euclidean lattice is invertible. The covolume of is
with the determinant and the real absolute value of For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix, and the dual lattice is
where is the Euclidean inner product (The Euclidean inner product on ), is formed with the transpose of The transpose of a matrix and the inverse of Invertible matrices and the general linear group (Transpose is linear and involutive, and for the identity , and A finite square real matrix is invertible if and only if its determinant is nonzero for the existence of ).
Well-definedness: the presentation does not matter. Suppose for a second invertible real matrix . Then has integer entries: each column of lies in , say with , so (Finite rectangular matrices over a commutative ring, their entries, rows and columns, Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose). Exchanging the roles of and shows likewise that has integer entries. Hence and , and (For same-sized finite square matrices over a commutative ring, , Rectangular matrix multiplication and the identity matrix , including zero-sized shapes); by is a commutative monoid whose group of units is ; equivalently holds exactly for and the only way two integers can multiply to is (with the same sign). Consequently , so the covolume is independent of the presentation. For the dual, by Transpose is linear and involutive, and , and as well as have integer entries (The transpose of a matrix); matrices with integer entries send into under matrix multiplication (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose), so and, applying the same statement to the integer matrix , also . Hence and .
The dual in closed form. For with and with one has , because ; so is contained in the defining set. Conversely, if for every , then testing gives for every , so and . This also shows that the second description of depends only on . The dual is itself a full-rank lattice: is invertible, its columns being a real basis, and , using (For every square matrix over a commutative ring, ) and (If is invertible over a commutative ring, then ). For , that is , one gets because (Rectangular matrix multiplication and the identity matrix , including zero-sized shapes).
Characters. For put , with the complex exponential of The complex exponential by its power series. Then for every , so is -periodic exactly when for every , that is (, and exactly when ) exactly when for every --- precisely the condition . Thus is a bijection from onto the set of exponential characters of the torus , and it is a group isomorphism for pointwise multiplication because ; this is the lattice case of the characters of The Pontryagin dual with the compact-open topology. The assertion is about the characters of the displayed exponential form; no claim is made here that every continuous character of is of that form.
No choice principle is used anywhere in this item.
Depends on
- Full Euclidean lattice and covolume
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- If $A$ is invertible over a commutative ring, then $\det(A^{-1})=\det(A)^{-1}$
- Invertible matrices and the general linear group $\operatorname{GL}_n(F)$
- The transpose $A^{\mathsf T}$ of a matrix
- Transpose is linear and involutive, and $(AB)^{\mathsf T}=B^{\mathsf T}A^{\mathsf T}$
- A finite square real matrix is invertible if and only if its determinant is nonzero
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- $\operatorname{GL}_n(F)$ is a group under matrix multiplication, including the trivial group $\operatorname{GL}_0(F)$
- The Pontryagin dual with the compact-open topology
- The complex exponential by its power series
- $\ker(\exp)=2\pi i\mathbb Z$, and $\exp z=\exp w$ exactly when $z-w\in2\pi i\mathbb Z$
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- For every square matrix over a commutative ring, $\det(A^{\mathsf T})=\det(A)$
- Finite rectangular matrices over a commutative ring, their entries, rows and columns
- Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose
- $(\mathbb{Z}, \cdot, 1)$ is a commutative monoid whose group of units is $\{1, -1\}$; equivalently $u \mid 1$ holds exactly for $u = 1$ and $u = -1$
Used by
- Dual lattice and covolume for a diagonal scaling Example
- Continuous lattice-periodic functions are determined by their lattice Fourier coefficients Lemma
- Fourier coefficients of a lattice periodisation Lemma
- Fundamental parallelotopes of a lattice tile Euclidean space with covolume volume Lemma
- Orthogonality of the lattice characters over a fundamental domain Lemma
- Sampling at a lattice produces periodisation of the spectrum over the dual lattice Lemma
- Schwartz periodisation over a lattice is smooth with locally uniformly summable derivatives Lemma
- The Dirac comb of a full-rank lattice transforms to the dual comb Lemma
- Poisson summation for a full-rank lattice Theorem
- Poisson summation under two-sided polynomial decay Theorem
Dependency tree · two levels
94 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)
- Noam Elkies, Theta functions and weighted theta functions of Euclidean lattices (author PDF) (standard reference, not scraped)
- Michael E. Taylor, Fourier Analysis, Distributions, and Constant-Coefficient Linear PDE (author PDF) (standard reference, not scraped)