Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Full-rank lattices, covolume, and the dual lattice

Definition

Let n≥1. A full-rank lattice in Rn is a subgroup Λ⊆Rn of the form

Λ=AZn={∑i=1nkiai:k=(k1,…,kn)∈Zn},

where A is an invertible real n×n matrix with columns a1,…,an; here Ak is the matrix product (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes) and the column matrix Ak 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 A makes its columns linearly independent over R (A finite square real matrix is invertible if and only if its determinant is nonzero), so they form a real basis of Rn and Λ is their Z-span, and conversely the basis matrix of every full Euclidean lattice is invertible. The covolume of Λ is

covol⁡(Λ):=∣det⁡A∣>0,

with the determinant and the real absolute value of For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, and the dual lattice is

Λ∗:={ξ∈Rn:ξ⋅λ∈Z for every λ∈Λ}=A−TZn,

where ξ⋅λ is the Euclidean inner product (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn), A−T:=(A−1)T=(AT)−1 is formed with the transpose of The transpose AT of a matrix and the inverse of Invertible matrices and the general linear group GL⁡n(F) (Transpose is linear and involutive, and (AB)T=BTAT for the identity (A−1)T=(AT)−1, and A finite square real matrix is invertible if and only if its determinant is nonzero for the existence of A−1).

Well-definedness: the presentation does not matter. Suppose BZn=AZn for a second invertible real matrix B. Then U:=A−1B has integer entries: each column bj of B lies in AZn, say bj=Auj with uj∈Zn, so U=(u1 ⋯ un)∈Mn(Z) (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 A and B shows likewise that U−1=B−1A has integer entries. Hence det⁡U∈Z and det⁡U−1∈Z, and det⁡U⋅det⁡U−1=det⁡(UU−1)=det⁡In=1 (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B), Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes); by (Z,⋅,1) is a commutative monoid whose group of units is {1,−1}; equivalently u∣1 holds exactly for u=1 and u=−1 the only way two integers can multiply to 1 is det⁡U=det⁡U−1=±1 (with the same sign). Consequently ∣det⁡B∣=∣det⁡A∣ ∣det⁡U∣=∣det⁡A∣, so the covolume is independent of the presentation. For the dual, B−TZn=A−TU−TZn by Transpose is linear and involutive, and (AB)T=BTAT, and U−T=(U−1)T as well as UT have integer entries (The transpose AT of a matrix); matrices with integer entries send Zn into Zn under matrix multiplication (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose), so U−TZn⊆Zn and, applying the same statement to the integer matrix UT=(U−T)−1, also Zn⊆U−TZn. Hence U−TZn=Zn and B−TZn=A−TZn.

The dual in closed form. For ξ=A−Tm with m∈Zn and λ=Ak with k∈Zn one has ξ⋅λ=(A−Tm)⋅(Ak)=m⋅k∈Z, because (A−Tm)⋅(Ak)=m⋅(A−1Ak); so A−TZn is contained in the defining set. Conversely, if ξ⋅λ∈Z for every λ∈Λ, then testing λ=aj=Aej gives ξ⋅aj=(ATξ)j∈Z for every j, so ATξ∈Zn and ξ=A−T(ATξ)∈A−TZn. This also shows that the second description of Λ∗ depends only on Λ. The dual is itself a full-rank lattice: A−T is invertible, its columns being a real basis, and covol⁡(Λ∗)=∣det⁡A−T∣=∣det⁡A−1∣=∣det⁡A∣−1=covol⁡(Λ)−1, using det⁡A−T=det⁡A−1 (For every square matrix over a commutative ring, det⁡(AT)=det⁡(A)) and det⁡A−1=(det⁡A)−1 (If A is invertible over a commutative ring, then det⁡(A−1)=det⁡(A)−1). For Λ=Zn, that is A=In, one gets Λ∗=Zn because In−T=In (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

Characters. For λ∗∈Rn put χλ∗(x):=e2πi λ∗⋅x, with the complex exponential of The complex exponential by its power series. Then χλ∗(x+λ)=χλ∗(x)e2πi λ∗⋅λ for every λ∈Λ, so χλ∗ is Λ-periodic exactly when e2πi λ∗⋅λ=1 for every λ∈Λ, that is (ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ) exactly when λ∗⋅λ∈Z for every λ∈Λ --- precisely the condition λ∗∈Λ∗. Thus λ∗↦χλ∗ is a bijection from Λ∗ onto the set of exponential characters χλ∗ of the torus Rn/Λ, 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 Rn/Λ is of that form.

No choice principle is used anywhere in this item.

Depends on

Used by

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