Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 6.5, p. 370 — either |L ∩ A₁|, |R ∩ A₂| ≥ ε or |L ∩ A₂|, |R ∩ A₁| ≥ ε, ε = ⅛|V(G)| − (|B|+(k+1))/2

Proved
TreewidthApprox.Pushed.dichotomy

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

balanced-separatorgraph-separationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1treewidth

Let GGG be a finite graph and k≥0k \ge 0k≥0 an integer. Let (A1,B,A2)(A_1, B, A_2)(A1​,B,A2​) be a separation of GGG with ∣A1∣,∣A2∣≤34∣V(G)∣|A_1|, |A_2| \le \tfrac34|V(G)|∣A1​∣,∣A2​∣≤43​∣V(G)∣, and let (L,X,R)(L, X, R)(L,X,R) be a separation of GGG with ∣L∣,∣R∣≤23∣V(G)∣|L|, |R| \le \tfrac23 |V(G)|∣L∣,∣R∣≤32​∣V(G)∣ and ∣X∣≤k+1|X| \le k+1∣X∣≤k+1. Write

ε=18∣V(G)∣−∣B∣+(k+1)2.\varepsilon = \tfrac18|V(G)| - \frac{|B| + (k+1)}{2}.ε=81​∣V(G)∣−2∣B∣+(k+1)​.

Then at least one of the following holds:

  1. ∣L∩A1∣≥ε|L \cap A_1| \ge \varepsilon∣L∩A1​∣≥ε and ∣R∩A2∣≥ε|R \cap A_2| \ge \varepsilon∣R∩A2​∣≥ε;
  2. ∣L∩A2∣≥ε|L \cap A_2| \ge \varepsilon∣L∩A2​∣≥ε and ∣R∩A1∣≥ε|R \cap A_1| \ge \varepsilon∣R∩A1​∣≥ε.

In the proof of Lemma 6.5 this lets one assume, after possibly exchanging the roles of LLL and RRR, that LLL meets A1A_1A1​ and RRR meets A2A_2A2​ in at least ε\varepsilonε vertices each; that is what bounds the sides of the glued separation by ∣V(G)∣−ε|V(G)| - \varepsilon∣V(G)∣−ε.

Formalization Note ε\varepsilonε is a real number and may be negative (then the claim is trivial); all comparisons are over the reals.

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

theorem dichotomy {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (k : ℕ) (A₁ B A₂ : Finset V) (hAB : IsSeparation G A₁ B A₂)
    (hA₁ : (A₁.card : ℝ) ≤ 3 / 4 * Fintype.card V) (hA₂ : (A₂.card : ℝ) ≤ 3 / 4 * Fintype.card V)
    (L X R : Finset V) (hLXR : IsSeparation G L X R) (hX : X.card ≤ k + 1)
    (hL : (L.card : ℝ) ≤ 2 / 3 * Fintype.card V) (hR : (R.card : ℝ) ≤ 2 / 3 * Fintype.card V) :
    ((1 / 8 * (Fintype.card V : ℝ) - ((B.card : ℝ) + (k + 1)) / 2) ≤ (L ∩ A₁).card ∧
        (1 / 8 * (Fintype.card V : ℝ) - ((B.card : ℝ) + (k + 1)) / 2) ≤ (R ∩ A₂).card) ∨
      ((1 / 8 * (Fintype.card V : ℝ) - ((B.card : ℝ) + (k + 1)) / 2) ≤ (L ∩ A₂).card ∧
        (1 / 8 * (Fintype.card V : ℝ) - ((B.card : ℝ) + (k + 1)) / 2) ≤ (R ∩ A₁).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), p. 370, proof of Lemma 6.5, the claim after the four inequalities
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