Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof sketch of Lemma 2.2, pp. 321–322 — components with ≤ ½|S| of S each can be split into two sides with ≤ ⅔|S| of S each

Proved
TreewidthApprox.Pushed.packing_argument

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

balanced-separatorcombinatoricsgraph-separationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

This is the packing step in the proof sketch of Lemma 2.2.

Let GGG be a finite graph and S,X′⊆V(G)S, X' \subseteq V(G)S,X′⊆V(G). Suppose every connected component CCC of G∖X′G \setminus X'G∖X′ satisfies ∣C∩S∣≤12∣S∣|C \cap S| \le \tfrac12 |S|∣C∩S∣≤21​∣S∣. Then the components of G∖X′G \setminus X'G∖X′ can be distributed between a left side and a right side so that each side holds at most two thirds of SSS: there are disjoint sets L′,R′L', R'L′,R′ with L′∪R′=V(G)∖X′L' \cup R' = V(G) \setminus X'L′∪R′=V(G)∖X′, no edge of GGG between L′L'L′ and R′R'R′, and

∣L′∩S∣≤23∣S∣,∣R′∩S∣≤23∣S∣.|L' \cap S| \le \tfrac23 |S|, \qquad |R' \cap S| \le \tfrac23 |S|.∣L′∩S∣≤32​∣S∣,∣R′∩S∣≤32​∣S∣.

Combined with Lemma 2.1 this gives, for every graph of treewidth at most kkk, a set of at most k+1k+1k+1 vertices whose removal splits SSS into two sides of at most 23∣S∣\tfrac23|S|32​∣S∣ each; with S=V(G)S = V(G)S=V(G) it is the folklore 23\tfrac2332​-balanced separation used in Lemma 6.5.

Formalization Note "Assigning each component to the left or the right" is encoded as a partition (L′,R′)(L', R')(L′,R′) of V(G)∖X′V(G) \setminus X'V(G)∖X′ with no edge between L′L'L′ and R′R'R′: such a partition is exactly a union of components on each side. No treewidth hypothesis is needed and none is assumed. The bounds are stated without division as 3 ∣L′∩S∣≤2 ∣S∣3\,|L' \cap S| \le 2\,|S|3∣L′∩S∣≤2∣S∣ and 3 ∣R′∩S∣≤2 ∣S∣3\,|R' \cap S| \le 2\,|S|3∣R′∩S∣≤2∣S∣.

Preamble
import Mathlib
import Definitions.Def_TreewidthApprox_Pushed_Setting
Formal statement
namespace TreewidthApprox.Pushed

theorem packing_argument {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (S X' : Finset V)
    (hX' : ∀ u : V, u ∉ X' → 2 * (avoidComp G X' u ∩ S).card ≤ S.card) :
    ∃ Lft Rgt : Finset V, Disjoint Lft Rgt ∧ Lft ∪ Rgt = Finset.univ \ X' ∧
      NoEdge G Lft Rgt ∧
      3 * (Lft ∩ S).card ≤ 2 * S.card ∧ 3 * (Rgt ∩ S).card ≤ 2 * S.card := by sorry

end TreewidthApprox.Pushed
Source
Bodlaender, Drange, Dregi, Fomin, Lokshtanov and Pilipczuk, A c^k n 5-approximation algorithm for treewidth, SIAM J. Comput. 45(2) (2016), pp. 321–322, proof sketch of Lemma 2.2, first two sentences
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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