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.Attenuation.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 finite graph with activeness probabilities pf∈[0,1]p_f \in [0,1]pf​∈[0,1] and values yf∈[0,1]y_f \in [0,1]yf​∈[0,1], and let a~\tilde aa~ be an effective attenuation function (Definition 3), with a(f)=a~(pfyf)a(f) = \tilde a(p_f y_f)a(f)=a~(pf​yf​). Fix an edge eee, one of its endpoints rrr, and x∈[0,1]x \in [0,1]x∈[0,1]. Let

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}.

Then

∏f∈E1(r)(1−x a(f) yf)  ≥  exp⁡(−x∑f∈E1(r)yf).\prod_{f \in E_1(r)} \bigl(1 - x\, a(f)\, y_f\bigr) \;\ge\; \exp\Bigl(-x \sum_{f \in E_1(r)} y_f\Bigr).f∈E1​(r)∏​(1−xa(f)yf​)≥exp(−xf∈E1​(r)∑​yf​).

In the proof of Theorem 1, xxx is the arrival time of eee, and the left side is the conditional probability that no edge of E1(r)E_1(r)E1​(r) arriving before eee is probed; the lemma bounds it by the value obtained in the limit of many small edges.

Formalization Note The arrival time xxx ranges over the closed interval [0,1][0,1][0,1], as in the integral (8) that the lemma feeds.

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

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 ∈ (incident G r).filter (fun f => f ≠ e ∧ p f = 1), y f))
      ≤ ∏ f ∈ (incident G r).filter (fun f => f ≠ e ∧ p f = 1),
          (1 - x * attProb aT p y f * y f) := 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. 11, Lemma 3 (with the definition of E(r), E_b(r) on p. 11)
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