OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.1: An absolute bound Cnlog⁡nCn\log n for the covering density in every dimension n≥2n\ge2

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 ℝn\mathbb{R}^n is the coordinate space of real nn-tuples.✦ A convex body K⊂ℝnK\subset\mathbb{R}^n is a compact convex set with nonempty interior.✦

A full-rank lattice Λ⊂ℝn\Lambda\subset\mathbb{R}^n is a discrete additive subgroup whose real span is ℝn\mathbb{R}^n. The lattice covering condition for a set K⊂ℝnK\subset\mathbb{R}^n and an integer submodule Λ⊂ℝn\Lambda\subset\mathbb{R}^n is (1). K+Λ=ℝn.K+\Lambda=\mathbb{R}^n.(1) The density ρ(K,Λ)\rho(K,\Lambda) of a lattice covering of a convex body K⊂ℝnK\subset\mathbb{R}^n by a full-rank lattice Λ⊂ℝn\Lambda\subset\mathbb{R}^n is the ratio in (2), where vol⁡n\operatorname{vol}_n is Lebesgue volume and det⁡Λ\det\Lambda is the Haar covolume of Λ\Lambda: ρ(K,Λ)=vol⁡n(K)det⁡Λ.\rho(K,\Lambda)=\frac{\operatorname{vol}_n(K)}{\det\Lambda}.(2) All logarithms are natural.

The Claim

Theorem 1. There is an absolute constant C>0C>0 such that every convex body K⊂ℝnK\subset\mathbb{R}^n in every integer dimension n≥2n\ge2 admits a full-rank lattice Λ⊂ℝn\Lambda\subset\mathbb{R}^n satisfying (3): K+Λ=ℝn,vol⁡n(K)det⁡Λ≤Cnlog⁡n.K+\Lambda=\mathbb{R}^n, \qquad \frac{\operatorname{vol}_n(K)}{\det\Lambda}\le Cn\log n.(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.