Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1 Bounding ALG — assignments from the selected flow

Proved
OnlineStochMatching.SuggestedMatching.bounding_alg

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

balls-in-binsonline-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-matching

Let A∗A^*A∗ be the advertisers covered by any maximum integral expected-instance matching MMM. For every ε>0\varepsilon>0ε>0, there are constants δ>0\delta>0δ>0 and NNN independent of the instance, MMM, and its labelling such that, whenever n≥Nn\ge Nn≥N,

Pr⁡ ⁣[ALG≥(1−e−1)∣A∗∣−εn]≥1−e−δn.\Pr\!\left[\mathrm{ALG}\ge(1-e^{-1})|A^*|-\varepsilon n\right]\ge1-e^{-\delta n}.Pr[ALG≥(1−e−1)∣A∗∣−εn]≥1−e−δn.

This is the assignment side of Theorem 4's analysis. The paper writes the failure probability as e−Ω(n)e^{-\Omega(n)}e−Ω(n); the constants are quantified before the instance to make that uniform claim explicit.

Preamble
import Definitions.Def_OnlineStochMatching_SuggestedMatching_Algorithm
Formal statement
namespace OnlineStochMatching.SuggestedMatching

/-- Section 4.1, "Bounding ALG": the paper's exponential concentration claim. -/
theorem bounding_alg :
    ∀ ε : ℝ, 0 < ε → ∃ δ : ℝ, 0 < δ ∧ ∃ N : ℕ,
      ∀ (A I : Type) [Fintype A] [Fintype I]
        (inst : Instance A I) (hn : N ≤ inst.n)
        (M : Finset (A × I)) (hM : IsMaxBMatching inst M)
        (label : inst.Copy → Option A) (hlabel : IsLabelling inst M label),
        runProbability inst (fun ω =>
          (1 - Real.exp (-1)) * (coveredAds M).card - ε * (inst.n : ℝ) ≤
            (algorithm inst label ω : ℝ)) ≥
          1 - Real.exp (-δ * (inst.n : ℝ)) := by sorry

end OnlineStochMatching.SuggestedMatching
Source
Feldman, Mehta, Mirrokni, Muthukrishnan, Online Stochastic Matching: Beating 1-1/e, arXiv:0905.4100v1, p. 5, §4.1, Bounding ALG
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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