Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
OfflineStochMatch.InfinitePatience.eq_7

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

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

Let G=(V,E)G=(V,E)G=(V,E) be a graph with activeness probabilities pe∈[0,1]p_e\in[0,1]pe​∈[0,1], patiences tv∈N∪{∞}t_v\in\mathbb N\cup\{\infty\}tv​∈N∪{∞}, a feasible solution (ye)(y_e)(ye​) of LP (3), and an attenuation function a~\tilde aa~ mapping [0,1][0,1][0,1] into [0,1][0,1][0,1]. For every edge eee, under Algorithm 1,

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

Here e={u,v}e=\{u,v\}e={u,v} is safe when, before eee is processed, at most tr−1t_r-1tr​−1 probes were made at each endpoint rrr, and no edge f≠ef\ne ef=e sharing an endpoint with eee and processed earlier has Af=Pf=Yf=1A_f=P_f=Y_f=1Af​=Pf​=Yf​=1. Being safe implies being free, which gives the inequality. The safe event depends only on the edges at the endpoints of eee, which is what makes its probability computable.

Formalization Note. The page's XfX_fXf​ is YfY_fYf​ (no XXX is defined in the paper).

Preamble
import Mathlib
import Definitions.Def_OfflineStochMatch_InfinitePatience_Setting
Formal statement
namespace OfflineStochMatch.InfinitePatience

/-- (7), p. 10: a safe edge is free, so `a(e) · Pr[e is free] ≥ ã(p_e y_e) Pr[e is safe]`. -/
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 : LPFeasible G p t y)
    (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.InfinitePatience
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