Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 14 — Greedy is 1/k-competitive for k-Max-Matching

Proved
HyperMatchDelay.Batching.lemma_4

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

approximation-algorithmsgreedyhypergraph-matchingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1set-packing

Let k≥1k \ge 1k≥1 and let SSS be a finite family of hyperedges, each with at most kkk vertices and non-negative weight w(e)≥0w(e) \ge 0w(e)≥0 (a weighted hypergraph of rank at most kkk). Run Greedy (Algorithm 5): scan the edges in non-increasing order of weight, with ties broken in any way, and keep each edge that is disjoint from the edges kept so far. Then the output GGG is a matching of SSS, and for every matching MMM of SSS

1k w(M)  ≤  w(G).\frac1k\, w(M) \;\le\; w(G).k1​w(M)≤w(G).

In particular Greedy achieves at least a 1/k1/k1/k fraction of the maximum weight matching, i.e. its competitive ratio for k-Max-Matching is at least 1/k1/k1/k. This classical guarantee (also known for weighted kkk-set packing) is used inside Depth-k Greedy to handle the short edges of each batch.

Formalization Note The ordering with arbitrary ties is an oracle σ\sigmaσ satisfying the sorted-order predicate; the statement holds for every such oracle. The running-time clause of Lemma 4, O(∣E∣log⁡∣E∣)O(|E|\log|E|)O(∣E∣log∣E∣), is not formalized.

Preamble
import Mathlib
import Definitions.Def_HyperMatchDelay_Batching_Model
Formal statement
namespace HyperMatchDelay.Batching

/-- Lemma 4, p. 14 (competitive clause): on a rank-`k` hypergraph with non-negative weights,
Greedy (Algorithm 5, with any weight-sorted order) returns a matching whose weight is at least
`1/k` times the weight of every matching. -/
theorem lemma_4 (k : ℕ) (hk : 1 ≤ k) (w : Finset ℕ → ℝ)
    (σ : Finset (Finset ℕ) → List (Finset ℕ)) (hσ : IsSortedOrder w σ)
    (S : Finset (Finset ℕ)) (hS : ∀ e ∈ S, e.card ≤ k ∧ 0 ≤ w e) :
    IsMatching S (greedy σ S) ∧
    ∀ M, IsMatching S M → (1 / (k : ℝ)) * weight w M ≤ weight w (greedy σ S) := by sorry

end HyperMatchDelay.Batching
Source
Pavone, Saberi, Schiffer & Tsao, Online Hypergraph Matching with Delays, arXiv:2009.12022v1, p. 14, Lemma 4 (Algorithm 5, p. 15); cited from [6, 8]
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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