Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 11 — ∏_{f∈E₁(r)}(1 − x a(f) y_f) ≥ e^{−x Σ_{f∈E₁(r)} y_f} for an effective attenuation

Proved
OfflineStochMatch.InfinitePatience.lemma_3

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

attenuationconvexityinequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(V,E)G=(V,E)G=(V,E) be a graph with pf∈[0,1]p_f\in[0,1]pf​∈[0,1] and yf∈[0,1]y_f\in[0,1]yf​∈[0,1] for all edges, and let a~\tilde aa~ be an effective attenuation function (Definition 3), with a(f)=a~(pfyf)a(f)=\tilde a(p_fy_f)a(f)=a~(pf​yf​). Fix an edge eee, an endpoint rrr of eee, and x∈[0,1]x\in[0,1]x∈[0,1]. With E1(r)={f∈δ(r)∖{e}:pf=1}E_1(r)=\{f\in\delta(r)\setminus\{e\}:p_f=1\}E1​(r)={f∈δ(r)∖{e}:pf​=1},

∏f∈E1(r)(1−x a(f) yf) ≥ e−x∑f∈E1(r)yf.\prod_{f\in E_1(r)}\bigl(1-x\,a(f)\,y_f\bigr)\ \ge\ e^{-x\sum_{f\in E_1(r)}y_f}.f∈E1​(r)∏​(1−xa(f)yf​) ≥ e−x∑f∈E1​(r)​yf​.

In the paper xxx is the arrival time π(e)\pi(e)π(e) on which the analysis conditions, and the product is the conditional probability that no edge of E1(r)E_1(r)E1​(r) blocks eee by being matched before it. The lemma turns that product into an exponential in the LP mass at rrr.

Formalization Note. The convexity in Definition 3 is assumed for x∈(0,1)x\in(0,1)x∈(0,1); the statement covers the closed interval [0,1][0,1][0,1] over which the paper integrates.

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

/-- Lemma 3, p. 11: for an effective attenuation function, an endpoint `r` of `e` and `x ∈ [0,1]`,
`∏_{f ∈ E_1(r)} (1 - x a(f) y_f) ≥ e^{-x ∑_{f ∈ E_1(r)} y_f}`, where `a(f) = ã(p_f y_f)`. -/
theorem lemma_3 {V E : Type} [Fintype V] [DecidableEq V] [Fintype E] [DecidableEq E]
    (G : EdmondsMatching65.Polyhedron.Graph V E) (p y : E → ℝ) (aT : ℝ → ℝ)
    (haT : IsEffective aT) (hp : ∀ f, 0 ≤ p f ∧ p f ≤ 1) (hy : ∀ f, 0 ≤ y f ∧ y f ≤ 1)
    (e : E) (r : V) (hr : r ∈ G.ends e) (x : ℝ) (hx : x ∈ Set.Icc (0 : ℝ) 1) :
    Real.exp (-(x * ∑ f ∈ E1 G p e r, y f))
      ≤ ∏ f ∈ E1 G p e r, (1 - x * aT (p f * y f) * y f) := 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. 11, Lemma 3 (E(r), E_b(r) defined just before)
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