A lattice point is any point in space whose coordinates are all integers. In two dimensions, lattice points are the spots where the gridlines of a standard graph cross: (0, 0), (1, 3), (-2, 5), and so on. In three dimensions, the same idea applies with a third integer coordinate. This simple concept turns out to be surprisingly powerful across mathematics, physics, and chemistry.
The Basic Idea
Picture a sheet of graph paper. Every intersection where a horizontal line meets a vertical line is a lattice point. Mathematically, these are all the points with coordinates that are whole numbers (including zero and negatives). The point (2, 3) is a lattice point. The point (2.5, 3) is not.
This extends naturally into higher dimensions. In three-dimensional space, a lattice point has three integer coordinates, like (1, 4, -2). In any number of dimensions, the principle stays the same: every coordinate must be a whole number. Mathematicians write this as Z² for a two-dimensional integer lattice, Z³ for three dimensions, and Zⁿ for n dimensions.
The Formal Mathematical Definition
In more rigorous terms, a lattice is a discrete subgroup of Euclidean space that contains the origin. “Discrete” means every lattice point has some breathing room around it where no other lattice point exists. “Subgroup” means that if you add two lattice points together or flip one to its negative, you always land on another lattice point. The integer grid is the most familiar example, but it’s not the only one.
A general lattice in n-dimensional space is built by picking n independent vectors and then taking every possible combination of those vectors using only integer multipliers. If you choose the standard unit vectors (one step right, one step up), you get the ordinary integer grid. But you could choose vectors that point in diagonal directions or have different lengths, producing a lattice of evenly spaced points in a tilted, stretched pattern. All that matters is the regularity: the same arrangement repeats infinitely in every direction.
Pick’s Theorem: Counting Points to Find Area
One of the most elegant uses of lattice points in geometry is Pick’s Theorem. If you draw a polygon on graph paper so that every corner sits on a lattice point, you can calculate its exact area just by counting dots. The formula is:
Area = (boundary points / 2) + interior points – 1
Boundary points are the lattice points sitting directly on the edges of the polygon. Interior points are those completely inside it. For example, a triangle with vertices at (0,0), (4,0), and (0,3) has 10 boundary points and 3 interior points, giving an area of 5 + 3 – 1 = 7. No need to remember the base-times-height formula; just count.
This works for any polygon with vertices on lattice points, no matter how irregular. It’s a favorite tool in math competitions and a surprisingly practical shortcut for surveying irregular plots on a grid.
Minkowski’s Theorem: Guaranteed Points Inside Shapes
A deeper result in number theory asks: if you draw a large enough shape around the origin, must it contain a lattice point other than (0, 0)? Minkowski’s Convex Body Theorem answers yes, with a precise size threshold. In two dimensions, if a symmetric convex shape has an area greater than four times the area of the lattice’s basic repeating cell, it must contain at least one nonzero lattice point. In n dimensions, the threshold is 2ⁿ times the volume of the fundamental cell.
“Symmetric” here means the shape looks the same if you rotate it 180 degrees around the origin. “Convex” means it has no dents or concavities. Under those conditions, making the shape large enough guarantees you’ll capture a lattice point. This result has far-reaching consequences in number theory, including proofs about which numbers can be expressed as sums of squares.
Lattice Points in Crystal Structures
In chemistry and physics, lattice points describe the repeating arrangement of atoms in a crystal. A crystal lattice is a pattern of points in three-dimensional space where each point represents the same environment, repeated over and over. In three dimensions, there are exactly 14 unique ways to arrange these points while preserving certain symmetries, known as the Bravais lattices.
An important subtlety: lattice points are not the same as atoms. A lattice point marks a location in the repeating pattern, but the actual atoms (called the “basis”) may sit at or near that location in more complex arrangements. In table salt, for instance, you might place a lattice point where one type of atom sits, but the second type of atom isn’t on a lattice point at all. It’s part of the basis that gets stamped onto each lattice point like a repeating motif on wallpaper.
When counting how many atoms belong to a single unit cell (the smallest repeating box in the crystal), shared points get divided up. An atom at a corner of a cube is shared among eight neighboring cells, so it only contributes one-eighth to each. This gives simple cubic structures 1 atom per cell, body-centered cubic structures 2 (the corners plus one unshared atom in the center), and face-centered cubic structures 4 (corners plus atoms shared between two cells on each face).
Reciprocal Lattices and Diffraction
Physicists also work with a related concept called the reciprocal lattice. Instead of describing where atoms sit in physical space, the reciprocal lattice describes how a crystal scatters waves. Each point in the reciprocal lattice corresponds to a family of parallel planes in the real crystal. The distance from the origin to a reciprocal lattice point is inversely related to the spacing between those planes.
This is the framework behind X-ray crystallography. When X-rays hit a crystal, the pattern of bright spots on a detector is essentially a map of the reciprocal lattice. By measuring the positions and intensities of those spots, scientists can work backward to determine the atomic structure of the crystal. The quality of the crystal determines how sharp these reciprocal lattice points are: a nearly perfect crystal produces tiny, well-defined points, while imperfections cause them to smear out.
Lattice Points in Two Dimensions
In two dimensions, lattices are behind the mathematics of repeating patterns like tiles and wallpaper. There are exactly 5 distinct types of two-dimensional lattices (square, rectangular, centered rectangular, hexagonal, and oblique), and these give rise to exactly 17 wallpaper groups that classify every possible repeating pattern on a flat surface. Every tiled floor, every piece of patterned fabric, and every honeycomb fits into one of these 17 categories.
This classification connects abstract lattice theory directly to art and design. The Alhambra palace in Spain is famous for exhibiting nearly all 17 wallpaper groups in its decorative tilework, centuries before mathematicians formally proved only 17 could exist.