Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1 Tightness — complete bipartite family

Proved
OnlineStochMatching.SuggestedMatching.tightness

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

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

For every n≥1n\ge1n≥1, take the complete bipartite graph with nnn advertisers and nnn impression types, each with ei=1e_i=1ei​=1. For every maximum expected-instance matching and every valid labelling, the hindsight optimum is nnn in every scenario, while

E[ALG]=n(1−(1−1n)n).\mathbb E[\mathrm{ALG}]=n\left(1-\left(1-\frac1n\right)^n\right).E[ALG]=n(1−(1−n1​)n).

This is the exact finite-nnn expectation underlying the paper's statement that the 1−1/e1-1/e1−1/e factor is tight even in expectation. Each maximum matching is perfect in this family.

Preamble
import Definitions.Def_OnlineStochMatching_SuggestedMatching_Algorithm
Formal statement
namespace OnlineStochMatching.SuggestedMatching

/-- The exact expectation and optimum for the complete-graph family in Section 4.1. -/
theorem tightness :
    ∀ (n : ℕ) (hn : 0 < n),
      let inst := completeInstance n hn
      ∀ (M : Finset (Fin n × Fin n)) (hM : IsMaxBMatching inst M)
        (label : inst.Copy → Option (Fin n)) (hlabel : IsLabelling inst M label),
        (∀ ω : Fin inst.n → inst.Copy, optimum inst ω = n) ∧
          expectedAlgorithm inst label =
            (n : ℝ) * (1 - (1 - 1 / (n : ℝ)) ^ n) := by sorry

end OnlineStochMatching.SuggestedMatching
Source
Feldman, Mehta, Mirrokni, Muthukrishnan, Online Stochastic Matching: Beating 1-1/e, arXiv:0905.4100v1, p. 6, §4.1, Tightness of the Analysis
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