Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 1, p. 6 — every hyperedge e lies in E_z for at least d − diam(e) shifts z

Proved
HyperMatchDelay.Batching.observation_1

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

batchinghypergraph-matchingonline-algorithmsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let H=(V,E,w)H = (V, E, w)H=(V,E,w) be a shareability hypergraph with parameters (n,d,k)(n, d, k)(n,d,k) and d≥1d \ge 1d≥1. For a shift z∈{0,…,d−1}z \in \{0,\dots,d-1\}z∈{0,…,d−1} let Ez=⋃iEz,iE_z = \bigcup_i E_{z,i}Ez​=⋃i​Ez,i​ be the set of hyperedges contained in a single batch window Vz,i={v∈[n]:z+id≤v≤z+(i+1)d−1}V_{z,i} = \{v \in [n] : z + id \le v \le z + (i+1)d - 1\}Vz,i​={v∈[n]:z+id≤v≤z+(i+1)d−1}. Then every hyperedge e∈Ee \in Ee∈E survives the batching for many shifts:

∑z=0d−11[e∈Ez]  ≥  d−diam(e).\sum_{z=0}^{d-1} \mathbb 1[e \in E_z] \;\ge\; d - \mathrm{diam}(e).z=0∑d−1​1[e∈Ez​]≥d−diam(e).

Since diam(e)<d\mathrm{diam}(e) < ddiam(e)<d, every hyperedge lies in EzE_zEz​ for at least one shift, and a hyperedge of diameter at most d−kd - kd−k for at least kkk shifts. This counting fact is what turns per-batch guarantees into the 1/d1/d1/d competitive ratio.

Formalization Note The left-hand side is the number of z∈{0,…,d−1}z \in \{0,\dots,d-1\}z∈{0,…,d−1} with e∈Eze \in E_ze∈Ez​; d−diam(e)d - \mathrm{diam}(e)d−diam(e) is a natural-number difference, exact here because diam(e)<d\mathrm{diam}(e) < ddiam(e)<d.

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

/-- Observation 1, p. 6: every hyperedge `e` of a shareability hypergraph lies in `E_z` for at
least `d - diam(e)` of the `d` shifts `z ∈ {0, …, d - 1}`. -/
theorem observation_1 (n d k : ℕ) (hd : 1 ≤ d) (E : Finset (Finset ℕ))
    (w : Finset ℕ → ℝ) (hE : IsShareability n d k E w) (e : Finset ℕ) (he : e ∈ E) :
    d - diam e ≤ ((Finset.range d).filter (fun z => e ∈ shiftEdges E n d z)).card := by sorry

end HyperMatchDelay.Batching
Source
Pavone, Saberi, Schiffer & Tsao, Online Hypergraph Matching with Delays, arXiv:2009.12022v1, p. 6, Observation 1
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