Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (7), p. 303 — E[M(s_{1:t−1}+p)·s_t] = ∫ (M(s_{1:t}+y)·s_t) e^{−ε(|y+s_t|₁−|y|₁)} dμ(y)

Proved
KalaiVempala.Multiplicative.eq_7

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

change-of-variablesfollow-the-perturbed-leaderlaplace-distributionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ε>0\varepsilon > 0ε>0, let με\mu_\varepsilonμε​ be the FPL* perturbation law on Rn\mathbb R^nRn (density (ε/2)ne−ε∣x∣1(\varepsilon/2)^n e^{-\varepsilon|x|_1}(ε/2)ne−ε∣x∣1​), let M:Rn→RnM : \mathbb R^n \to \mathbb R^nM:Rn→Rn be measurable, let s1,s2,⋯∈Rns_1, s_2, \dots \in \mathbb R^ns1​,s2​,⋯∈Rn and t≥1t \ge 1t≥1. Then

∫RnM(s1:t−1+x)⋅st dμε(x)  =  ∫Rn(M(s1:t+y)⋅st) e−ε(∣y+st∣1−∣y∣1) dμε(y).\int_{\mathbb R^n} M(s_{1:t-1} + x)\cdot s_t \, d\mu_\varepsilon(x) \;=\; \int_{\mathbb R^n} \big(M(s_{1:t} + y)\cdot s_t\big)\, e^{-\varepsilon(|y + s_t|_1 - |y|_1)}\, d\mu_\varepsilon(y).∫Rn​M(s1:t−1​+x)⋅st​dμε​(x)=∫Rn​(M(s1:t​+y)⋅st​)e−ε(∣y+st​∣1​−∣y∣1​)dμε​(y).

The identity compares FPL*, which uses s1:t−1s_{1:t-1}s1:t−1​, with the "be the perturbed leader" algorithm, which uses s1:ts_{1:t}s1:t​: the two expectations differ only through the ratio of the densities of με\mu_\varepsilonμε​ at y+sty + s_ty+st​ and at yyy.

Formalization Note The identity holds for every measurable MMM and every real state sequence: the oracle property, the nonnegativity of D,S\mathcal D, \mathcal SD,S and the parameters D,R,AD, R, AD,R,A are not used and are not hypotheses. Measurability of MMM is added, as in every statement of the mission, because the expectations presuppose it. The condition t≥1t \ge 1t≥1 makes s1:t=s1:t−1+sts_{1:t} = s_{1:t-1} + s_ts1:t​=s1:t−1​+st​.

Preamble
import Mathlib
import Definitions.Def_OracleRO_ApproxFPL_FPL
import Definitions.Def_KalaiVempala_Multiplicative_Setting

open MeasureTheory OracleRO.ApproxFPL
Formal statement
namespace KalaiVempala.Multiplicative

theorem eq_7 {n : ℕ} (M : (Fin n → ℝ) → (Fin n → ℝ)) (hMmeas : Measurable M)
    (s : ℕ → Fin n → ℝ) (ε : ℝ) (hε : 0 < ε) (t : ℕ) (ht : 1 ≤ t) :
    ∫ x, M (prefixSum s (t - 1) + x) ⬝ᵥ s t ∂(laplaceLaw n ε) =
      ∫ y, (M (prefixSum s t + y) ⬝ᵥ s t) *
          Real.exp (-(ε * (∑ i, |y i + s t i| - ∑ i, |y i|))) ∂(laplaceLaw n ε) := by sorry

end KalaiVempala.Multiplicative
Source
Kalai & Vempala, Efficient algorithms for online decision problems, J. Comput. System Sci. 71 (2005), p. 303, display (7)
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