Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.7 — k-way delay bound 64(k−1)ln⁡2(1+3ln⁡n) dual\frac{64(k-1)}{\ln2}(1+3\ln n)\,\mathrm{dual}ln264(k−1)​(1+3lnn)dual

Open
MatchingDelays.Linear.Supplement.kway_delay_bound

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

k-way-matchingmatchingonline-algorithmsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix an integer k≥2k\ge2k≥2 and an input of n≥kn\ge kn≥k requests with k∣nk\mid nk∣n, located at points xux_uxu​ of an arbitrary metric space (X,d0)(X,d_0)(X,d0​) and arriving at times au≥0a_u\ge0au​≥0. Write d^(u,v)=(k−1)d0(xu,xv)+∣au−av∣\hat d(u,v)=(k-1)d_0(x_u,x_v)+|a_u-a_v|d^(u,v)=(k−1)d0​(xu​,xv​)+∣au​−av​∣, Δ(G)=max⁡u,v∈Gd^(u,v)\Delta(G)=\max_{u,v\in G}\hat d(u,v)Δ(G)=maxu,v∈G​d^(u,v) and τ(G)=min⁡u∈Gau+2Δ(G)\tau(G)=\min_{u\in G}a_u+2\Delta(G)τ(G)=minu∈G​au​+2Δ(G). Let RRR be any execution of the k-way Delayed Best-Effort Matching algorithm of §C.3 with any tie-breaking: an active component SSS grows its dual at rate α=1/64\alpha=1/64α=1/64 when k∤∣S∣k\nmid|S|k∤∣S∣ and is frozen otherwise; two active components merge when a crossing pairwise constraint ∑S:∣S∩{u,v}∣=1yS≤d^(u,v)\sum_{S:|S\cap\{u,v\}|=1}y_S\le\hat d(u,v)∑S:∣S∩{u,v}∣=1​yS​≤d^(u,v) becomes tight; any kkk unmatched requests of one active component are grouped once t≥τ(G)t\ge\tau(G)t≥τ(G). Quantities at time ttt refer to the state after all arrivals, merges and group formations at ttt; yS(s)=dual⁡(s)=0y_S(s)=\operatorname{dual}(s)=0yS​(s)=dual(s)=0 for s≤0s\le0s≤0; U(t)U(t)U(t) is the set of arrived ungrouped requests and U(r,t)={u∈U(t):r≤t−au<2r}U(r,t)=\{u\in U(t):r\le t-a_u<2r\}U(r,t)={u∈U(t):r≤t−au​<2r}.

Let tut_utu​ be the time at which uuu is grouped, delay=∑u(tu−au)\mathrm{delay}=\sum_u(t_u-a_u)delay=∑u​(tu​−au​) and dual\mathrm{dual}dual the final dual. Then

delay≤64(k−1)ln⁡2 (1+3ln⁡n) dual.\mathrm{delay}\le\frac{64(k-1)}{\ln2}\,(1+3\ln n)\,\mathrm{dual}.delay≤ln264(k−1)​(1+3lnn)dual.

The bound does not involve the group connection cost, so it can be reused for other connection objectives.

Differences from the source:

  • encoding: requests labeled [n] in continuous real time → arrival-ranked Fin n input, batched simultaneous arrivals, and natural-number microsteps with exact continuous interpolation; time-indexed objects are read from the completed event state at t; reason: relabeling preserves all inputs and ties; microsteps do not discretize time, and they order arrivals, merges and matches at one instant exactly as the source does
Preamble
import Mathlib
import Definitions.Def_MatchingDelays_Linear_Supplement_KWay

set_option autoImplicit false
open scoped BigOperators
open Classical
noncomputable section
Formal statement
namespace MatchingDelays.Linear.Supplement

variable {n : ℕ} {X : Type*} [MetricSpace X]

/-- Lemma C.7 (printed 32 / PDF 33): `delay ≤ 64(k−1)/ln 2 · (1 + 3 ln n) · dual`. -/
theorem kway_delay_bound (k : ℕ) (I : Instance n X) (hk : ValidKSize k n) (R : KRun) (hR : IsKExecution k I R) :
    kDelay I R ≤ (64 * ((k : ℝ) - 1) / Real.log 2) * (1 + 3 * Real.log (n : ℝ)) * kFinalDual R := by sorry

end MatchingDelays.Linear.Supplement
Source
Ahmadian, Chawla, Kumar, Purohit, and Zhang, A General Framework for Matching with Delays, STOC 2027 submission #482 (October 2026), Lemma C.7, printed p.32 / PDF p.33. SHA-256 20a2fed026bd39130a6aff1891feff42709817c1c43d85d5a879a4935a1646be. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/482.pdf

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