Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.2, p. 300 — the cubes [0,1/ε]ⁿ and v+[0,1/ε]ⁿ overlap in at least a (1 − ε|v|₁) fraction

Proved
KalaiVempala.Lazy.lemma_3_2

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

follow-the-perturbed-leaderlebesgue-measureonline-learningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Overlap of shifted cubes. Let ε>0\varepsilon > 0ε>0 and let UUU be the uniform probability measure on the cube [0,1/ε]n[0, 1/\varepsilon]^n[0,1/ε]n. For every v∈Rnv \in \mathbb R^nv∈Rn,

U({x:x−v∈[0,1/ε]n})  ≥  1−ε∣v∣1,∣v∣1=∑i=1n∣vi∣.U\big(\{x : x - v \in [0, 1/\varepsilon]^n\}\big) \;\ge\; 1 - \varepsilon |v|_1, \qquad |v|_1 = \sum_{i=1}^n |v_i| .U({x:x−v∈[0,1/ε]n})≥1−ε∣v∣1​,∣v∣1​=i=1∑n​∣vi​∣.

That is, the cubes [0,1/ε]n[0, 1/\varepsilon]^n[0,1/ε]n and v+[0,1/ε]nv + [0, 1/\varepsilon]^nv+[0,1/ε]n overlap in at least a (1−ε∣v∣1)(1 - \varepsilon|v|_1)(1−ε∣v∣1​) fraction of their volume. In this mission it gives the update bound of FLL.

Formalization Note The fraction is the UUU-measure of the overlap, written in ℝ≥0∞; when 1−ε∣v∣1<01 - \varepsilon|v|_1 < 01−ε∣v∣1​<0 the left side is 000 and the claim is trivial, as on the page. UUU is perturbLaw n ε from OracleRO.ApproxFPL.FPL. The statement is identical to Lemma 3.2 of the companion mission on FPL(ε\varepsilonε), restated because draft items cannot import each other.

Preamble
import Mathlib
import Definitions.Def_OracleRO_ApproxFPL_FPL
import Definitions.Def_KalaiVempala_Lazy_Setting

open MeasureTheory OracleRO.ApproxFPL
Formal statement
namespace KalaiVempala.Lazy

theorem lemma_3_2 {n : ℕ} (ε : ℝ) (hε : 0 < ε) (v : Fin n → ℝ) :
    ENNReal.ofReal (1 - ε * ∑ i, |v i|) ≤
      perturbLaw n ε {x | x - v ∈ Set.Icc (0 : Fin n → ℝ) (fun _ => ε⁻¹)} := by sorry

end KalaiVempala.Lazy
Source
Kalai & Vempala, Efficient algorithms for online decision problems, J. Comput. System Sci. 71 (2005), p. 300, Lemma 3.2 (proof p. 301)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me