Lattice (group)

From Wikipedia, the free encyclopedia

For other uses, see lattice.

In mathematics, especially in geometry and group theory, a lattice in Rⁿ is a discrete subgroup of Rⁿ which spans the real vector space Rⁿ. Every lattice in Rⁿ can be generated from a basis for the vector space by forming all linear combinations with integral coefficients. A lattice may be viewed as a regular tiling of a space by a primitive cell.

Lattices have many significant applications in pure mathematics, particularly in connection to Lie algebras, number theory and group theory. They also arise in applied mathematics in connection with coding theory, and are used in various ways in the physical sciences. For instance, in materials science and solid-state physics, a lattice is a synonym for a crystalline structure, a 3-dimensional array of regularly spaced points coinciding with the atom or molecule positions in a crystal. More generally, lattice models are studied in physics, often by the techniques of computational physics.

Contents 1 Symmetry considerations and examples 2 Dividing space according to a lattice 3 Lattice points in convex sets 4 Computing with lattices 5 Lattices in two dimensions: detailed discussion 6 Lattices in three dimensions 7 Lattices in complex space 8 In Lie groups 9 Lattices over general vector-spaces 10 See also 11 References

[edit] Symmetry considerations and examples

A lattice is the symmetry group of discrete translational symmetry in n directions. A pattern with this lattice of translational symmetry cannot have more, but may have less symmetry than the lattice itself.

A lattice in the sense of a 3-dimensional array of regularly spaced points coinciding with e.g. the atom or molecule positions in a crystal, or more generally, the orbit of a group action under translational symmetry, is a translate of the translation lattice: a coset, which need not contain the origin, and therefore need not be a lattice in the previous sense.

A simple example of a lattice in Rⁿ is the subgroup Zⁿ. A more complicated example is the Leech lattice, which is a lattice in R²⁴. The period lattice in R² is central to the study of elliptic functions, developed in nineteenth century mathematics; it generalises to higher dimensions in the theory of abelian functions.

[edit] Dividing space according to a lattice

A typical lattice Λ in Rⁿ thus has the form

where {v₁, ..., v_n} is a basis for Rⁿ. Different bases can generate the same lattice, but the absolute value of the determinant of the vectors v_i is uniquely determined by Λ, and is denoted by d(Λ). If one thinks of a lattice as dividing the whole of Rⁿ into equal polyhedra (copies of an n-dimensional parallelepiped, known as the fundamental region of the lattice), then d(Λ) is equal to the n-dimensional volume of this polyhedron. This is why d(Λ) is sometimes called the covolume of the lattice.

[edit] Lattice points in convex sets

Minkowski's theorem relates the number d(Λ) and the volume of a symmetric convex set S to the number of lattice points contained in S. The number of lattice points contained in a polytope all of whose vertices are elements of the lattice is described by the polytope's Ehrhart polynomial. Formulas for some of the coefficients of this polynomial involve d(Λ) as well.

[edit] Computing with lattices

Lattice basis reduction is the problem of finding a short lattice basis. The Lenstra-Lenstra-Lovász lattice reduction algorithm (LLL) finds a short lattice basis in polynomial time; it has found numerous applications, particularly in public-key cryptography.

[edit] Lattices in two dimensions: detailed discussion

There are five 2D lattice types as given by the crystallographic restriction theorem. Below the wallpaper group of the lattice is given in parentheses; note that a pattern with this lattice of translational symmetry cannot have more, but may have less symmetry than the lattice itself. If the symmetry group of a pattern contains an n-fold rotation then the lattice has n-fold symmetry for even n and 2n-fold for odd n.

• a rhombic lattice, also called centered rectangular lattice or isosceles triangular lattice (cmm), with evenly spaced rows of evenly spaced points, with the rows alternatingly shifted one half spacing (symmetrically staggered rows); special cases are:
  • a hexagonal lattice or equilateral triangular lattice (p6m)
  • a square lattice (see below, and turn 45°)

     * * * * * * *
    * * * * * * * *
     * * * * * * *
    * * * * * * * *

• a rectangular lattice, also called primitive rectangular lattice (pmm), with as special case a square lattice (p4m):

    * * * * * * * *
    * * * * * * * *
    * * * * * * * *

• more generally, a parallelogrammic lattice, also called oblique lattice (p2)(with asymmetrically staggered rows):

     *  *  *  *  *  *  *
    *  *  *  *  *  *  * 
      *  *  *  *  *  *  *
     *  *  *  *  *  *  *

For the classification of a given lattice, start with one point and take a nearest second point. For the third point, not on the same line, consider its distances to both points. Among the points for which the smaller of these two distances is least, choose a point for which the larger of the two is least. (Not logically equivalent but in the case of lattices giving the same result is just "Choose a point for which the larger of the two is least".)

The five cases correspond to the triangle being equilateral, right isosceles, right, isosceles, and scalene. In a rhombic lattice, the shortest distance may either be a diagonal or a side of the rhombus, i.e., the line segment connecting the first two points may or may not be one of the equal sides of the isosceles triangle. This depends on the smaller angle of the rhombus being less than 60° or between 60° and 90°.

If the vectors a and b generate the lattice, instead of a and b we can also take a and a-b, etc. In general in 2D, we can take pa + qb and ra + sb for integers p, q, r, and s such that ps-qr is 1 or -1. This ensures that a and b themselves are integer linear combinations of the other two vectors. If not, not all translations are possible with the other pair. Each pair a, b defines a parallelogram, all with the same area, the magnitude of the cross product. One parallelogram fully defines the whole object. Without further symmetry, this parallelogram is a fundamental domain.

The vectors a and b can be represented by complex numbers. Up to size and orientation, a pair can be represented by their quotient. Expressed geometrically: if two lattice points are 0 and 1, we consider the position of a third lattice point. Equivalence in the sense of generating the same lattice is represented by the modular group: represents choosing a different third point in the same grid, represents choosing a different side of the triangle as reference side 0-1, which in general implies changing the scaling of the lattice, and rotating it. Each "curved triangle" in the image contains for each 2D lattice shape one complex number, the grey area is a canonical representation, corresponding to the classification above, with 0 and 1 two lattice points that are closest to each other; duplication is avoided by including only half of the boundary. The rhombic lattices are represented by the points on its boundary, with the hexagonal lattice as vertex, and i for the square lattice. The rectangular lattices are at the imaginary axis, and the remaining area represents the parallelogrammetic lattices, with the mirror image of a parallelogram represented by the mirror image in the imaginary axis.

[edit] Lattices in three dimensions

The 14 lattice types in 3D are called Bravais lattices. They are characterized by their space group. 3D patterns with translational symmetry of a particular type cannot have more, but may have less symmetry than the lattice itself.

[edit] Lattices in complex space

A lattice in Cⁿ is a discrete subgroup of Cⁿ which spans the 2n-dimensional real vector space Cⁿ. For example, the Gaussian integers form a lattice in C.

Every lattice in Rⁿ is a free abelian group of rank n; every lattice in Cⁿ is a free abelian group of rank 2n.

[edit] In Lie groups

More generally, a lattice Γ in a Lie group G is a discrete subgroup, such that the quotient G/Γ is of finite measure, for the measure on it inherited from Haar measure on G (left-invariant, or right-invariant - the definition is independent of that choice). That will certainly be the case when G/Γ is compact, but that sufficient condition is not necessary, as is shown by the case of the modular group in SL₂(R), which is a lattice but where the quotient isn't compact (it has cusps). There are general results stating the existence of lattices in Lie groups.

A lattice is said to be uniform or cocompact if G/Γ is compact; otherwise the lattice is called non-uniform.

[edit] Lattices over general vector-spaces

Whilst we normally consider lattices in this concept can be generalised to any finite dimensional vector space over any field. This can be done as follows:

Let K be a field, let V be an n-dimensional K-vector space, let be a K-basis for V and let R be a ring contained within K. Then the R lattice in V generated by B is given by:

Different bases B will in general generate different lattices. However, if the transition matrix T between the bases is in GL_n(R) - the general linear group of R (in simple terms this means that all the entries of T are in R and all the entries of T ^{− 1} are in R - which is equivalent to saying that the determinant of T is in R ^* - the unit group of elements in R with multiplicative inverses) then the lattices generated by these bases will be isomorphic since T induces an isomorphism between the two lattices.

Important cases occur in number theory with K a p-adic field and R the p-adic integers.

[edit] See also

• Bravais lattice
• Reciprocal lattice
• Unimodular lattice
• Crystal system
• Mahler's compactness theorem

[edit] References

• Peter Mayer, "Lattice Geometries" (2000). (A review of lattices in computational physics).