Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (7), p. 10 — a(e)·Pr[e is free] ≥ ã(p_e y_e)·Pr[e is safe]

Proved
OfflineStochMatch.Attenuation.eq_7

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

attenuationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-orderstochastic-matching

Let Algorithm 1 run on a finite graph G=(V,E)G = (V,E)G=(V,E) with activeness probabilities pf∈[0,1]p_f \in [0,1]pf​∈[0,1], patience values tv∈{1,2,… }∪{∞}t_v \in \{1,2,\dots\}\cup\{\infty\}tv​∈{1,2,…}∪{∞}, probing probabilities yf∈[0,1]y_f \in [0,1]yf​∈[0,1], and an attenuation function a~\tilde aa~ mapping [0,1][0,1][0,1] into [0,1][0,1][0,1], so that edge fff has attenuation a(f)=a~(pfyf)a(f) = \tilde a(p_f y_f)a(f)=a~(pf​yf​). Then for every edge eee,

a(e)⋅Pr⁡[e is free]  ≥  a~(peye) Pr⁡[e is safe].a(e) \cdot \Pr[e \text{ is free}] \;\ge\; \tilde a(p_e y_e)\, \Pr[e \text{ is safe}].a(e)⋅Pr[e is free]≥a~(pe​ye​)Pr[e is safe].

The inequality holds because a safe edge is free. It reduces the goal theorem to a lower bound on the probability of the event safe, which depends only on the edges incident to the endpoints of eee.

Formalization Note Since a(e)=a~(peye)a(e) = \tilde a(p_e y_e)a(e)=a~(pe​ye​), both sides carry the same factor. LP feasibility is not needed for this step and is not assumed; only yf∈[0,1]y_f \in [0,1]yf​∈[0,1] (3c) is.

Preamble
import Mathlib
import Definitions.Def_OfflineStochMatch_Attenuation_Setting
Formal statement
namespace OfflineStochMatch.Attenuation

theorem eq_7 {V E : Type} [Fintype V] [DecidableEq V] [Fintype E] [DecidableEq E]
    (G : EdmondsMatching65.Polyhedron.Graph V E) (p y : E → ℝ) (t : V → ℕ∞) (aT : ℝ → ℝ)
    (hp : ∀ f, 0 ≤ p f ∧ p f ≤ 1) (hy : ∀ f, 0 ≤ y f ∧ y f ≤ 1)
    (haT : ∀ z ∈ Set.Icc (0 : ℝ) 1, aT z ∈ Set.Icc (0 : ℝ) 1) (e : E) :
    aT (p e * y e) * probSafe G p t y aT e ≤ aT (p e * y e) * probFree G p t y aT e := by sorry

end OfflineStochMatch.Attenuation
Source
Brubach, Grammel, Ma, MacRury, Srinivasan, Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes, arXiv:2106.06892v3, p. 10, Eq. (7) (safe event defined on p. 9)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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