Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.5 — a vertex has no active edge with probability at least 1−2c1−c\frac{1-2c}{1-c}1−c1−2c​

Proved
ProphetMatchingEFGT.lemma_5_5

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

contention-resolutionmatchingp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let 0<c<120<c<\tfrac120<c<21​, x∈FMx\in\mathcal F_Mx∈FM​, and consider the active-edge process of Algorithm 3 on a duplicate-free list of edges on which it is well defined. For every vertex rrr,

Pr⁡E~r[(rs) is not active ∀s] ≥ 1−2c1−c.\Pr_{\widetilde E_r}\big[(rs)\text{ is not active }\forall s\big]\ \ge\ \frac{1-2c}{1-c}.Er​Pr​[(rs) is not active ∀s] ≥ 1−c1−2c​.

It bounds the last factor of eq. (13) and the probability that a candidate is a witness.

Differences from the source:

  • encoding: probabilities of Algorithm 3 (realization of R and the coin with probability α) → probabilities in the active-edge process of p.14 (each earlier edge active independently with probability α_e x_e, active edges picked greedily in arrival order), computed as finite sums; reason: the page's own unification ('For the purpose of analysis…', p.14); same law whenever α_e ≤ 1
  • reading: the induction hypothesis 'α_e ≤ 1 for every edge e ∈ E but the last edge (uv)' (p.14), left implicit in the statement → hypothesis WellDefinedOn c x es: c ≤ Pr[both ends of e' unmatched at e'] for every earlier edge e'; reason: the statement is made inside this induction; the form c ≤ Pr[…] avoids the junk value α = c/0 = 0
  • reading: c is Algorithm 3's constant (1/3 or 0.337 in §5) → 0 < c < 1/2; reason: the denominators 1 − c − cΣ ≥ 1 − 2c and (1 − 2c)/(1 − c) of §5.3 presuppose c < 1/2
  • encoding: x ∈ FM (§5, p.12) → InFM G x on the edges of the simple graph G; reason: same polytope (p.10)
Preamble
import Mathlib
import Definitions.Def_ProphetMatchingEFGT_ActiveProcess

open Finset
Formal statement
namespace ProphetMatchingEFGT

/-- **Lemma 5.5, p. 16.**
Ezra–Feldman–Gravin–Tang, arXiv:2002.09807v2, Lemma 5.5, p. 16: "For any vertex `r`,
`Pr_{Ẽ_r}[(rs) is not active ∀ s] ≥ (1 − 2c)/(1 − c)`."

**Formalization Note.** The active-edge process of Algorithm 3 with constant `c ∈ (0, 1/2)` on the
edges `es` (in arrival order, the paper's `E` with `(uv)` removed), assumed well defined. -/
theorem lemma_5_5 {V : Type*} [Fintype V] [DecidableEq V] {G : SimpleGraph V} [DecidableRel G.Adj]
    (c : ℝ) (hc0 : 0 < c) (hc : c < 1 / 2) (x : Edge G → ℝ) (hx : InFM G x)
    (es : List (Edge G)) (hnd : es.Nodup) (hwd : WellDefinedOn c x es) (r : V) :
    (1 - 2 * c) / (1 - c) ≤ prob (actProbs c x es) (fun l => ∀ s : V, ¬ isActive l r s) := by sorry

end ProphetMatchingEFGT
Source
Ezra–Feldman–Gravin–Tang, Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models, arXiv:2002.09807v2, §5.3, Lemma 5.5, p. 16
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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