Canonical: https://knowlpedia.com/linear-algebra/euclidean-lattice/

# Full-rank Euclidean lattice

Integer linear combinations of a basis of a Euclidean space.

A **full-rank Euclidean lattice** in \(\mathbb R^n\) is a set
\[
\Lambda=B\mathbb Z^n=\{Bm:m\in\mathbb Z^n\},
\]
where the columns of \(B\) form a [basis](https://knowlpedia.com/convex-analysis/basis-hamel-basis-and-dimension/) of \(\mathbb R^n\). Thus \(B\) is invertible. The lattice is an additive subgroup and is discrete: \(|Bm|\ge |m|/\|B^{-1}\|\), so its nonzero points have a positive lower bound on their distance from zero.

## Basis choices

Different bases can describe the same lattice. Replacing \(B\) by \(BU\), where \(U\) is an integer matrix with integer inverse, preserves \(\Lambda\). The standard example is [\(\mathbb Z^n\)](https://knowlpedia.com/discrete-structures/lattice-zd/). Here “lattice” refers to a discrete additive set in Euclidean space; an [order-theoretic lattice](https://knowlpedia.com/shared-foundations/lattice/) is a different structure.
