Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4.2.1, p. 7 — every impression type has no coloured edge, one blue edge, or one blue and one red edge

Proved
OnlineStochMatching.TSM.impression_incidence

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

bipartite-matchingonline-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(A,I,E)G = (A, I, E)G=(A,I,E) be a finite bipartite graph, EfE_fEf​ the edge set of an integral maximum flow of the boosted flow graph, and blue/red a TSM colouring of EfE_fEf​. Then every impression type i∈Ii \in Ii∈I is incident to either

  1. no coloured edge,
  2. exactly one blue edge and no red edge, or
  3. exactly one blue edge and exactly one red edge.

This is what makes the two suggested matchings algorithm well defined: "the advertiser along iii's blue edge" and "the advertiser along iii's red edge" are unique when they exist, and a type with no blue edge has no red edge either.

Preamble
import Mathlib
import Definitions.Def_OnlineStochMatching_TSM_Coloring
Formal statement
namespace OnlineStochMatching.TSM

/-- **The note of §4.2.1** (Feldman, Mehta, Mirrokni, Muthukrishnan, *Online Stochastic Matching:
Beating 1-1/e*, arXiv:0905.4100v1, p. 7): for a maximum flow edge set `E_f` and a TSM colouring
`(blue, red)` of it, every impression type `i` is incident to either no coloured edge, exactly one
blue edge (and no red edge), or exactly one blue and exactly one red edge. In particular "the ad
along `i`'s blue edge" and "the ad along `i`'s red edge" are well defined. -/
theorem impression_incidence {A I : Type} [Fintype A] [DecidableEq A] [Fintype I] [DecidableEq I]
    (E F blue red : Finset (A × I)) (hF : IsMaxFlowSet E F) (hcol : IsTSMColoring F blue red)
    (i : I) :
    (degI blue i = 0 ∧ degI red i = 0) ∨ (degI blue i = 1 ∧ degI red i = 0) ∨
      (degI blue i = 1 ∧ degI red i = 1) := by sorry

end OnlineStochMatching.TSM
Source
Feldman, Mehta, Mirrokni, Muthukrishnan, Online Stochastic Matching: Beating 1-1/e, arXiv:0905.4100v1, p. 7, Section 4.2.1 (note after the colouring rules)
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