Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.26 — a bipartite graph with B-degrees ≥ ab and A-degrees ≤ b has a subgraph with B-degrees ≥ a and A-degrees ≤ 1

Proved
DistMapClust.Main.lemma_3_26

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theorymatchingsp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(A⊔B,E)G=(A\sqcup B,E)G=(A⊔B,E) be a finite bipartite graph and a,ba,ba,b positive integers. If every v∈Bv\in Bv∈B has degree at least ababab and every u∈Au\in Au∈A has degree at most bbb, then there is E′⊆EE'\subseteq EE′⊆E such that in G′=(A⊔B,E′)G'=(A\sqcup B,E')G′=(A⊔B,E′)

deg⁡G′(v)≥a  (v∈B),deg⁡G′(u)≤1  (u∈A).\deg_{G'}(v)\ge a\ \ (v\in B),\qquad \deg_{G'}(u)\le1\ \ (u\in A).degG′​(v)≥a  (v∈B),degG′​(u)≤1  (u∈A).

It is a consequence of Hall's theorem and is used to turn a many-to-few charging scheme into a disjoint one in the proof of Lemma 3.28.

Formalization Note. The sides are finite types A, B; edges are a Finset (A × B); a degree is the number of edges at a vertex.

Differences from the source:

  • encoding: bipartite graph G = (A ⊔ B, E), a, b ∈ N_{>0} → finite types A, B, E : Finset (A × B), degrees as numbers of incident edges, 0 < a, 0 < b; reason: Lean convention; the paper's graphs are finite
Preamble
import Mathlib
Formal statement
namespace DistMapClust.Main

/-- Lemma 3.26 (pp. 41–42). A finite bipartite graph with sides `A`, `B` and edge set `E ⊆ A × B`
in which every vertex of `B` has degree at least `ab` and every vertex of `A` degree at most `b` has
a set of edges `E' ⊆ E` in which every vertex of `B` has degree at least `a` and every vertex of `A`
degree at most `1`. -/
theorem lemma_3_26 {A B : Type} [Fintype A] [Fintype B] [DecidableEq A] [DecidableEq B]
    (E : Finset (A × B)) (a b : ℕ) (ha : 0 < a) (hb : 0 < b)
    (hB : ∀ v : B, a * b ≤ (E.filter (fun e => e.2 = v)).card)
    (hA : ∀ u : A, (E.filter (fun e => e.1 = u)).card ≤ b) :
    ∃ E' ⊆ E, (∀ v : B, a ≤ (E'.filter (fun e => e.2 = v)).card) ∧
      ∀ u : A, (E'.filter (fun e => e.1 = u)).card ≤ 1 := by sorry

end DistMapClust.Main
Source
Herold, Spoerhase, Kipouridis, Marx, A Unified Framework for Parameterized Approximation of Clustering Objectives via Distance Mappings, STOC 2027 submission (manuscript sha256 1d00c842…), pp. 41–42, Lemma 3.26
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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