Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.9 — balanced S-separators and three non-adjacent parts

Proved
TreewidthApprox.Partition.lemma_2_9

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

balanced-partitionbalanced-separatorgraph-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite simple graph, S⊆V(G)S\subseteq V(G)S⊆V(G), and X⊆V(G)X\subseteq V(G)X⊆V(G). The set XXX is a balanced SSS-separator exactly when V(G)∖XV(G)\setminus XV(G)∖X has a partition into three sets M1,M2,M3M_1,M_2,M_3M1​,M2​,M3​ such that distinct parts have no edges between them and each part contains at most half the vertices of SSS:

X is balanced for S⟺∃ M1,M2,M3:V(G)∖X=M1∪˙M2∪˙M3,NoEdge⁡G(Mi,Mj) (i≠j),2∣Mi∩S∣≤∣S∣ (i=1,2,3).X\text{ is balanced for }S\quad\Longleftrightarrow\quad \exists\,M_1,M_2,M_3:\quad V(G)\setminus X=M_1\mathbin{\dot\cup}M_2\mathbin{\dot\cup}M_3, \quad\operatorname{NoEdge}_G(M_i,M_j)\ (i\ne j), \quad 2|M_i\cap S|\le |S|\ (i=1,2,3).X is balanced for S⟺∃M1​,M2​,M3​:V(G)∖X=M1​∪˙M2​∪˙M3​,NoEdgeG​(Mi​,Mj​) (i=j),2∣Mi​∩S∣≤∣S∣ (i=1,2,3).

The equivalence replaces a condition on every connected component by conditions on three vertex sets.

Formalization Note Parts may be empty; in particular, X=V(G)X=V(G)X=V(G) is included. The three unordered pairs suffice because adjacency is symmetric. Cardinality bounds use natural numbers with denominators cleared, and SSS retains its full cardinality even when it meets XXX. The component relation uses walks avoiding XXX at every vertex. No bound on ∣X∣|X|∣X∣ or treewidth is assumed. Lean uses a vertex type in universe 0, consistently with this series.

Preamble
import Mathlib
import Definitions.Def_TreewidthApprox_Partition_Setting
Formal statement
namespace TreewidthApprox.Partition

/-- Lemma 2.9, p. 328 (restated as Lemma 6.2, p. 363). -/
theorem lemma_2_9 {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (S X : Finset V) :
    IsBalancedSSep G S X ↔
      ∃ M₁ M₂ M₃ : Finset V,
        Disjoint M₁ M₂ ∧ Disjoint M₁ M₃ ∧ Disjoint M₂ M₃ ∧
        M₁ ∪ M₂ ∪ M₃ = Finset.univ \ X ∧
        TreewidthApprox.Pushed.NoEdge G M₁ M₂ ∧ TreewidthApprox.Pushed.NoEdge G M₁ M₃ ∧ TreewidthApprox.Pushed.NoEdge G M₂ M₃ ∧
        2 * (M₁ ∩ S).card ≤ S.card ∧
        2 * (M₂ ∩ S).card ≤ S.card ∧
        2 * (M₃ ∩ S).card ≤ S.card := by sorry

end TreewidthApprox.Partition
Source
Bodlaender, Drange, Dregi, Fomin, Lokshtanov and Pilipczuk, A c^k n 5-approximation algorithm for treewidth, SIAM J. Comput. 45(2) (2016), p. 328, Lemma 2.9 (restated as Lemma 6.2, p. 363), https://doi.org/10.1137/130947374
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