Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
KalaiVempala.Additive.lemma_3_2

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

follow-the-perturbed-leadermeasure-theoryonline-learningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Overlap of translated cubes. Let ε>0\varepsilon > 0ε>0, let C=[0,1/ε]nC = [0, 1/\varepsilon]^nC=[0,1/ε]n, and let v∈Rnv \in \mathbb R^nv∈Rn with ∣v∣1=∑i∣vi∣|v|_1 = \sum_i |v_i|∣v∣1​=∑i​∣vi​∣. Then the cubes CCC and v+Cv + Cv+C overlap in at least a (1−ε∣v∣1)(1 - \varepsilon |v|_1)(1−ε∣v∣1​) fraction of the volume of CCC:

vol⁡(C∩(v+C))vol⁡(C)  ≥  1−ε ∣v∣1.\frac{\operatorname{vol}\big(C \cap (v + C)\big)}{\operatorname{vol}(C)} \;\ge\; 1 - \varepsilon\,|v|_1 .vol(C)vol(C∩(v+C))​≥1−ε∣v∣1​.

Equivalently, if xxx is uniformly distributed on CCC, then Pr⁡[x∈v+C]≥1−ε∣v∣1\Pr[x \in v + C] \ge 1 - \varepsilon |v|_1Pr[x∈v+C]≥1−ε∣v∣1​. In the analysis of Follow the Perturbed Leader this says that the laws of s1:t−1+pts_{1:t-1} + p_ts1:t−1​+pt​ and s1:t+pts_{1:t} + p_ts1:t​+pt​, uniform on cubes shifted by sts_tst​, agree on all but an ε∣st∣1\varepsilon |s_t|_1ε∣st​∣1​ fraction.

Formalization Note The fraction is the probability, under the uniform law perturbLaw n ε on [0,1/ε]n[0, 1/\varepsilon]^n[0,1/ε]n from OracleRO.ApproxFPL.FPL, of the set {x:x−v∈C}=v+C\{x : x - v \in C\} = v + C{x:x−v∈C}=v+C. The left side is ENNReal.ofReal (1 - ε|v|₁), which is 000 when ε∣v∣1≥1\varepsilon |v|_1 \ge 1ε∣v∣1​≥1, so the statement is then trivially true, as on the page. The hypothesis ε>0\varepsilon > 0ε>0 is added because the cube has side 1/ε1/\varepsilon1/ε.

Preamble
import Mathlib
import Definitions.Def_OracleRO_ApproxFPL_FPL
import Definitions.Def_KalaiVempala_Additive_Setting

open MeasureTheory OracleRO.ApproxFPL
Formal statement
namespace KalaiVempala.Additive

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.Additive
Source
Kalai & Vempala, Efficient algorithms for online decision problems, J. Comput. System Sci. 71 (2005), pp. 300–301, Lemma 3.2
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