Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1 Bounding OPT — canonical cut identity

Proved
OnlineStochMatching.SuggestedMatching.cut_identity

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

bipartite-matchingmax-flowp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-matching

For any maximum integral expected-instance matching MMM, let AS,ISA_S,I_SAS​,IS​ be the advertiser and type vertices reachable from the source in its residual network, and let AT=A∖ASA_T=A\setminus A_SAT​=A∖AS​. No edge of the original graph joins ASA_SAS​ to a type outside ISI_SIS​, and

∣A∗∣=∣AT∣+∑i∈ISei.|A^*|=|A_T|+\sum_{i\in I_S}e_i.∣A∗∣=∣AT​∣+i∈IS​∑​ei​.

The identity equates the size of the selected integral flow with the capacity of its canonical minimum cut. It supports the scenario-wise bound on hindsight optimum.

Preamble
import Definitions.Def_OnlineStochMatching_SuggestedMatching_Cut
import Definitions.Def_OnlineStochMatching_SuggestedMatching_Algorithm
Formal statement
namespace OnlineStochMatching.SuggestedMatching

/-- Section 4.1's canonical cut has no advertiser-to-type crossing edge,
and its capacity equals the maximum integral flow. -/
theorem cut_identity (A I : Type) [Fintype A] [Fintype I]
    (inst : Instance A I) (M : Finset (A × I)) (hM : IsMaxBMatching inst M) :
    (∀ a i, (a, i) ∈ inst.E → adInSourceSide inst M a → typeInSourceSide inst M i) ∧
      (coveredAds M).card =
        (adsInSinkSide inst M).card +
          ∑ i ∈ typesInSourceSide inst M, inst.e i := by sorry

end OnlineStochMatching.SuggestedMatching
Source
Feldman, Mehta, Mirrokni, Muthukrishnan, Online Stochastic Matching: Beating 1-1/e, arXiv:0905.4100v1, p. 5, §4.1, Bounding OPT, cut identity
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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