Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.6 — total cost at most 2γγ−1\frac{2\gamma}{\gamma-1}γ−12γ​ times the total waiting time

Open
BipartiteVRM.Competitive.Supplement.lemma_5_6

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

competitive-analysismatching-with-delaysnon-bipartite-matchingonline-algorithmsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix γ>1\gamma>1γ>1, any tie rule and any MPMD input with ∣R∣=2m|R|=2m∣R∣=2m in any metric space. Let ALG\mathrm{ALG}ALG be the cost of the output, distance plus the waiting time of both requests of every output pair, and let WR=∑r∈R(tr−ar)W_R=\sum_{r\in R}(t_r-a_r)WR​=∑r∈R​(tr​−ar​) be the total waiting time of all requests, trt_rtr​ being the time rrr is matched. Then

ALG≤2γγ−1 WR.\mathrm{ALG}\le\frac{2\gamma}{\gamma-1}\,W_R.ALG≤γ−12γ​WR​.

This is the first half of the proof of Theorem 5.1; unlike its bipartite counterpart Lemma 4.1 it carries no additive 222, because WRW_RWR​ counts both endpoints of every pair.

Differences from the source:

  • encoding: a finite request set R with |R| = 2m in any metric space, locations and arrival times a_v ≥ 0 that may coincide → the published MatchingDelays.Linear.Instance n X (labels 0..n−1 in nondecreasing arrival order, any MetricSpace X) with Even n, m = n/2; reason: every finite input can be relabeled in arrival order (simultaneous arrivals in any order); labels give the algorithm no future data, and repeated locations and arrival times are allowed
  • encoding: an arbitrary but fixed rule for ties among simultaneous events and among the choices of N_uv and v in Steps 1 and 2 → every TieRule, a View-and-history selector over the nonempty finite option sets; reason: the rule sees only received data and its own history; every statement quantifies over all such rules
  • encoding: W_R = Σ_{r∈R} (t_r − a_r) → the sum over output pairs uv at time t of (t − a_u) + (t − a_v); reason: the output is a perfect matching in which each request appears exactly once (Theorem 5.1's feasibility conclusion), so the two sums are the same
Preamble
import Definitions.Def_BipartiteVRM_Competitive_Supplement_Specifications

set_option autoImplicit false
Formal statement
namespace BipartiteVRM.Competitive.Supplement

open MatchingDelays.Linear (Instance Edge)

/-- Lemma 5.6, p. 17: no additive 2, both endpoints' waiting in W_R. -/
theorem lemma_5_6 {n : ℕ} {X : Type*} [MetricSpace X] (I : Instance n X) (hn : Even n)
    (γ : ℝ) (hγ : 1 < γ) (tie : TieRule) :
    ALG I γ tie ≤ 2 * γ / (γ - 1) * totalWaiting I γ tie := by sorry

end BipartiteVRM.Competitive.Supplement
Source
Tung-Wei Kuo, STOC 2027 submission #528 (October 2026), p. 17, Lemma 5.6; W_R defined on p. 16, §5.3

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