OpenAI preprint, September 2026 · §1. Introduction
Theorem1.1:An absolute bound
for the covering density in every dimension
Covering each convex body with one lattice.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
A lattice covering places translates of a convex body at the points of a lattice and asks how much volume is used per unit volume of space. Here is the coordinate space of real -tuples.✦A convex body is a compact convex set with nonempty interior.✦
A full-rank lattice is a discrete additive subgroup whose real span is . The lattice covering condition for a set and an integer submodule is (1). (1) The density of a lattice covering of a convex body by a full-rank lattice is the ratio in (2), where is Lebesgue volume and is the Haar covolume of :(2) All logarithms are natural.
The Claim
Theorem 1. There is an absolute constant such that every convex body in every integer dimension admits a full-rank lattice satisfying (3): (3)✦
What Is Checked
The claim is stated over convex bodies in real coordinate space and discrete full-rank integer submodules, with density measured using their Haar covolumes.