Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.1, p. 44 (first sentence) — a connected acyclic matching network graph has at least n − d + 1 leaves

Proved
ConstRegretMatch.Acyclic.lemma_C_1_leaves

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

dynamic-matchingleavesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trees

Let a matching network have nnn agent types and ddd matches, every match using at least two types and every type taking part in at least one match. Suppose its matching network graph G\mathcal GG (the bipartite type–match incidence graph) is connected and acyclic. Then the number LLL of leaves of G\mathcal GG (vertices of degree one) satisfies

L ≥ n−d+1.L \ \ge\ n - d + 1.L ≥ n−d+1.

In Appendix C this count is used to show that some over-demanded queue is a leaf, which is the starting point of the explicit construction of the inverse of the optimal basis.

Formalization Note The inequality is written n+1≤L+dn + 1 \le L + dn+1≤L+d to avoid natural-number subtraction. Leaves are counted among all vertices of G\mathcal GG; since ∣A(m)∣≥2|\mathcal A(m)| \ge 2∣A(m)∣≥2, match vertices never are leaves, so LLL is the number of types that take part in exactly one match.

Preamble
import Mathlib
import Definitions.Def_ConstRegretMatch_Acyclic_Network
Formal statement
namespace ConstRegretMatch.Acyclic

/-- Lemma C.1, p. 44 (first sentence; proof pp. 46–47): if the matching network graph `𝒢` of a
matching network with `n` agent types and `d` matches is connected and acyclic, then the number of
leaves (vertices of degree one) of `𝒢` is at least `n - d + 1`, written without subtraction. -/
theorem lemma_C_1_leaves {n d : ℕ} (N : MatchingNetwork n d)
    (hconn : (networkGraph N).Connected) (hacyc : (networkGraph N).IsAcyclic) :
    n + 1 ≤ (leaves (networkGraph N)).card + d := by sorry

end ConstRegretMatch.Acyclic
Source
Kerimov, Ashlagi, Gurvich, Dynamic Matching: Characterizing and Achieving Constant Regret, SSRN 3824407 (Sep 14, 2022), p. 44, Lemma C.1 (first sentence); proof pp. 46–47
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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