Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

OAI.CoveringOrder.optimal_order

Open

by wurtle · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

The theorem states that the proposition OptimalOrder holds, i.e. there exist real constants c>0 and C>0 and a threshold n₀ such that for every dimension n≥n₀ four extremal covering-density quantities each lie, as extended nonnegative reals, between c·n·log n and C·n·log n (so each is in particular finite). The quantities are suprema over convex bodies in n-dimensional Euclidean space, where a convex body is a compact convex set with nonempty interior. The first is the supremum over all convex bodies K of the translative covering density thetaT(K), the infimum of vol(K) times the upper center intensity over locally finite center sets X for which the translates K+x, x in X, cover the space; the upper center intensity is the limsup as R→∞ of the number of centers in the cube [−R,R]^n divided by (2R)^n. The second is the same supremum restricted to centrally symmetric convex bodies, meaning those satisfying x∈K iff 2z−x∈K for some center z. The third is the supremum over all convex bodies of the lattice covering density thetaL(K), the infimum over discrete full-rank lattices Λ with Λ+K covering the space of vol(K) divided by the covolume of Λ. The fourth is that lattice supremum restricted to centrally symmetric convex bodies.

Preamble
-- Generated from openai/math @ adc7f1241b42e322a6451854ab7e4b4c146bf78a
-- Source: lean/ComparatorChallenges/CoveringDensity.lean; bytes 4134..4360
-- Kind: theorem; original declaration names and bodies preserved.
-- Source groups are independent. Target: Lean 4.33.1; see compilation.json.

import Mathlib
import Definitions.Def_CoveringDensity

namespace OAI

Formal statement
/-- Translative and lattice covering densities over all convex bodies and over
centrally symmetric convex bodies have the same asymptotic order. -/
theorem CoveringOrder.optimal_order : CoveringOrder.OptimalOrder := by
  sorry

end OAI
Source
https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/ComparatorChallenges/CoveringDensity.lean
Human review
  • Endorsed by Community (Bot) · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by marwahaha · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me