Dual lattice¶

The lattice of vectors pairing integrally with every vector of a full-rank lattice under a declared inner product.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4269
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Geometry of Numbers and Lattice Theory → Mathematics

Core Idea¶

Dual lattices reverse scale and basis geometry, support Poisson summation and transference bounds, and are represented from a basis matrix by the inverse transpose under Euclidean conventions. The inner product maps ambient vectors to linear functionals; selecting those taking integer values on the original lattice forms another lattice, with basis and covolume reciprocal to the original. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Stripe-Pattern Partner Grid

Picture dots in a neat pattern, like pegs on a pegboard. Now think of every way to draw evenly spaced stripes so that every single peg sits right on a stripe. If you turn each of those stripe patterns into a dot, you get a new pattern of dots called the dual lattice. When the pegs are packed close, the new dots come out spread far apart.

A Grid's Partner Grid

A lattice is an endless, evenly repeating grid of points, like the corners of squares on graph paper, but it can be slanted too. Every lattice has a partner called its dual lattice. The dual is made of all the points that, when you combine them with any point of the first lattice using a special kind of multiplication called the dot product, always give a whole number. The two are opposites in size: if the first lattice is tightly packed, the dual is spread out, and the other way round. Taking the dual of the dual gets you back to the original lattice.

Integer Dot-Product Lattice

A lattice is a regularly spaced set of points in space made from whole-number combinations of some basis vectors. Its dual lattice is the set of all vectors whose dot product with every point of the original lattice is a whole number. The dual is itself a lattice, and it reverses scale: if you stretch a lattice by a factor, its dual shrinks by the same factor, and the volume of a basic cell of the dual is the reciprocal of the original's. If the basis vectors are the columns of a matrix, the dual's basis comes from the inverse transpose of that matrix. The dual of the dual is the original lattice. It shows up in tools like Poisson summation, and it's different from the 'dual' of a lattice in the ordering sense used in order theory.

Let L be a full-rank lattice in a real inner-product space V (for example, R^n with the dot product). The dual lattice L* is the set of vectors y in V such that the inner product of y with every x in L is an integer. Equivalently, the inner product identifies V with its space of linear functionals, and L* consists of the functionals taking integer values on L. L* is again a full-rank lattice: if B is a basis matrix for L, then under Euclidean conventions the inverse transpose of B is a basis matrix for L*, giving the dual basis. The construction reverses scale and basis geometry: scaling L by c scales L* by 1/c, and the covolume of L* is the reciprocal of that of L. The double dual identifies canonically with L. These properties underlie Poisson summation over lattices and transference bounds linking the geometry of L and L*. The notion must be kept distinct from the order-theoretic dual of a lattice, a separate object with the same name.

Scope of Application¶

Dual lattice belongs to geometry of numbers and lattice theory and is useful where the analyst can specify the typed geometry of numbers and lattice theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the ambient real inner-product space, full-rank lattice and basis convention, integral-pairing condition, dual basis, scaling, covolume relation, double-dual identification, and distinction from order-dual lattices are explicit. The scope is broad within that domain but bounded by the need for the ambient real inner-product space, full-rank lattice and basis convention, integral-pairing condition, dual basis, scaling, covolume relation, double-dual identification, and distinction from order-dual lattices are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the ambient real inner-product space, full-rank lattice and basis convention, integral-pairing condition, dual basis, scaling, covolume relation, double-dual identification, and distinction from order-dual lattices are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Dual lattice can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Dual lattice. Dual lattice compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed geometry of numbers and lattice theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the ambient real inner-product space, full-rank lattice and basis convention, integral-pairing condition, dual basis, scaling, covolume relation, double-dual identification, and distinction from order-dual lattices are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of geometry of numbers and lattice theory because they reuse the typed geometry of numbers and lattice theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, The inner product maps ambient vectors to linear functionals; selecting those taking integer values on the original lattice forms another lattice, with basis and covolume reciprocal to the original., and type the carrier, state every parameter and convention in the definition, test that the ambient real inner-product space, full-rank lattice and basis convention, integral-pairing condition, dual basis, scaling, covolume relation, double-dual identification, and distinction from order-dual lattices are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Dual lattice Domain-specific

Parents (1) — outgoing typed relations

Dual lattice is a kind of Duality Prime

It remains its own entry because its identity is fixed by the ambient real inner-product space, full-rank lattice and basis convention, integral-pairing condition, dual basis, scaling, covolume relation, double-dual identification, and distinction from order-dual lattices.

Hierarchy path (1) — routes to 1 parentless root

Dual lattice → is a kind of Duality

Neighborhood in Abstraction Space¶

Dual lattice sits in a crowded region of the domain-specific corpus (10^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Integer & Divisor Number Theory (45 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25