The Setting
A lattice covering asks that every point of Euclidean space belong to a translate of one fixed set by a lattice vector. We regard as the real vector space of functions on .✦ A lattice is a discrete subgroup spanning ; its determinant denotes the Haar covolume of this discrete full-rank integer submodule. For a set , the covering condition and its density are those in (1). (1) A convex body is a compact convex set with nonempty interior.
The coordinate torus is the product of circle groups in (2), equipped with the translation-invariant Haar measure normalized there. (2) Choose an integer basis of , also regarded as a real vector-space basis of , and let be the linear isomorphism with these columns.✦ The lattice quotient map takes the coordinates in this lattice basis modulo one, as in (3). (3)✦ The hole proportion of a compact set is the measure of the complement of its projected set, given in (4). (4)✦
The Claim
Theorem 1. Let , let be compact and convex, and let be a lattice. If , there is a lattice satisfying (5). (5)✦
Let be an affine automorphism, let , and let be a lattice. Let , and suppose and . There is a lattice satisfying (6). (6)✦
Let and let be a convex body. There is a lattice satisfying (7). (7)✦
There are a constant and an integer with the following property. If and is a convex body, there is a lattice satisfying (8). (8)✦
Suppose that, for some , every convex body in admits a lattice cover of density at most for all sufficiently large . There is a constant with the following property. If and is a convex body, there is a lattice satisfying (9). (9)✦
What Is Checked
The completion statement concerns compact convex sets and discrete full-rank lattices; the dimension bounds concern convex bodies, while affine pullback is stated for arbitrary subsets and affine automorphisms. The lattice quotient map is a continuous homomorphism of additive groups.