Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7 — survival and blocked neighbours imply selection

Proved
RandomOrderCRS.proposition_7

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

contention-resolutiononline-matchingp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrandom-order

Let YYY have distinct coordinates. If eee survives, ∣Re∣≤1|\mathcal R_e|\le1∣Re​∣≤1, and each f∈Ref\in\mathcal R_ef∈Re​ satisfies sblf\mathrm{sbl}_fsblf​, then e∈Me\in\mathcal Me∈M.

This is the event that the lower bound on the selection probability counts.

Differences from the source:

  • encoding: the statement on the sample space → pathwise, for injective YYY; reason: with a tie Yf=YeY_f=Y_eYf​=Ye​, the edge fff is not relevant for eee and yet may arrive first; ties have probability 0
Preamble
import Mathlib
import Definitions.Def_RandomOrderCRS_ArrivalModel
import Definitions.Def_RandomOrderCRS_SimpleBlocker
Formal statement
namespace RandomOrderCRS

variable {V : Type} [Fintype V] [DecidableEq V]

/-- Proposition 7, MacRury, Ma & Grammel, arXiv:2209.07520v2, p.19: "If e survives, |ℛ_e| ≤ 1, and
each f ∈ ℛ_e satisfies sbl_f, then e ∈ ℳ."

**Formalization Note.** Pathwise, for injective `Y`, i.e. almost surely. With a tie `Y_f = Y_e`, the
edge `f` is not relevant for `e` and yet may arrive first. -/
theorem proposition_7 (G : SimpleGraph V) [DecidableRel G.Adj] (Y : G.edgeSet → ℝ)
    (S : G.edgeSet → Bool) (hY : Function.Injective Y) (e : G.edgeSet) (he : S e = true)
    (hcard : (relevantSet G Y S e).card ≤ 1)
    (hsbl : ∀ f ∈ relevantSet G Y S e, HasSimpleBlocker G Y S e f) :
    e ∈ greedy G (arrivalOrder G Y) S := by sorry

end RandomOrderCRS
Source
MacRury, Ma & Grammel, On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs, arXiv:2209.07520v2, Proposition 7, p.19
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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