Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nearby simplex volume (Lattimore–György, Lemma 7)

Proved
LG2021.nearby_simplex_volume

by sim2000dg · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

banditconvex-geometryvolume

Let d≥1d\ge1d≥1 and let K⊆RdK\subseteq\mathbb R^dK⊆Rd be convex and contain the closed Euclidean unit ball. Suppose D>0D>0D>0 bounds every distance between two points of KKK, and 0<δ≤D0<\delta\le D0<δ≤D. For each x∈Kx\in Kx∈K there are distinct vertices v0,…,vd∈Kv_0,\ldots,v_d\in Kv0​,…,vd​∈K with v0=xv_0=xv0​=x and ∥vi−x∥2≤δ\|v_i-x\|_2\le\delta∥vi​−x∥2​≤δ, satisfying

vol⁡ ⁣(conv⁡{v0,…,vd})≥(δD)d(3/4)(d−1)/22d!.\operatorname{vol}\!\left(\operatorname{conv}\{v_0,\ldots,v_d\}\right)\ge \left(\frac{\delta}{D}\right)^d\frac{(3/4)^{(d-1)/2}}{2d!}.vol(conv{v0​,…,vd​})≥(Dδ​)d2d!(3/4)(d−1)/2​.

This is the nearby simplex used in the bandit stage-count argument. The source slice, number of vertices, homothety, and volume lower bound are preserved. The proof uses a triangular determinant for the base simplex rather than a maximization over regular simplices.

Preamble
import Mathlib
open MeasureTheory Set
Formal statement
theorem LG2021.nearby_simplex_volume {d : ℕ} (hd : 0 < d)
    {K : Set (EuclideanSpace ℝ (Fin d))} (hcv : Convex ℝ K)
    (hball : Metric.closedBall (0 : EuclideanSpace ℝ (Fin d)) 1 ⊆ K)
    {D δ : ℝ} (hD : 0 < D) (hδ : 0 < δ) (hδD : δ ≤ D)
    (hdiam : ∀ x ∈ K, ∀ y ∈ K, dist x y ≤ D)
    {x : EuclideanSpace ℝ (Fin d)} (hx : x ∈ K) :
    ∃ v : Fin (d + 1) → EuclideanSpace ℝ (Fin d), Function.Injective v ∧ v 0 = x ∧
      (∀ i, v i ∈ K) ∧ (∀ i, dist x (v i) ≤ δ) ∧
      ENNReal.ofReal ((δ / D)^d * (Real.sqrt (3 / 4))^(d - 1) / (2 * (d.factorial : ℝ))) ≤
        volume (convexHull ℝ (range v)) := by sorry
Source
Tor Lattimore and András György, Improved Regret for Zeroth-Order Stochastic Convex Bandits, Proceedings of the 34th Conference on Learning Theory (COLT 2021), Proceedings of Machine Learning Research 134:2938–2964, 2021, Appendix B, Lemma 7, printed p. 16.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me